/usr/include/boost/container
Edit: /usr/include/boost/container/map.hpp (103528B)
//////////////////////////////////////////////////////////////////////////////
//
// (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_MAP_HPP
#define BOOST_CONTAINER_MAP_HPP
#ifndef BOOST_CONFIG_HPP
# include
#endif
#if defined(BOOST_HAS_PRAGMA_ONCE)
# pragma once
#endif
#include
#include
// container
#include
#include //new_allocator
#include
// container/detail
#include
#include
#include
#include
#include
#include
// move
#include
#include
// move/detail
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#include
#endif
#include
// intrusive/detail
#include //pair
#include //less, equal
// other
#include
#include
// std
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
#include
#endif
namespace boost {
namespace container {
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! A 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 map class supports bidirectional iterators.
//!
//! A map satisfies all of the requirements of a container and of a reversible
//! container and of an associative container. The value_type stored
//! by this container is the value_type is std::pair.
//!
//! \tparam Key is the key_type of the map
//! \tparam T is the mapped_type
//! \tparam Compare is the ordering function for Keys (e.g. std::less).
//! \tparam Allocator is the allocator to allocate the value_types
//! (e.g. allocator< std::pair > ).
//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
template < class Key, class T, class Compare = std::less
, class Allocator = void, class Options = tree_assoc_defaults >
#else
template
#endif
class map
///@cond
: public dtl::tree
< std::pair
, int
, Compare, Allocator, Options>
///@endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(map)
typedef int select_1st_t;
typedef std::pair value_type_impl;
typedef dtl::tree
base_t;
typedef dtl::pair movable_value_type_impl;
typedef typename base_t::value_compare value_compare_impl;
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef T mapped_type;
typedef typename base_t::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename boost::container::allocator_traits::value_type value_type;
typedef typename boost::container::allocator_traits::pointer pointer;
typedef typename boost::container::allocator_traits::const_pointer const_pointer;
typedef typename boost::container::allocator_traits::reference reference;
typedef typename boost::container::allocator_traits::const_reference const_reference;
typedef typename boost::container::allocator_traits::size_type size_type;
typedef typename boost::container::allocator_traits::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type;
typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare;
typedef Compare key_compare;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator;
typedef std::pair nonconst_value_type;
typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl) movable_value_type;
typedef BOOST_CONTAINER_IMPDEF(node_handle<
typename base_t::stored_allocator_type
BOOST_MOVE_I pair_key_mapped_of_value
>) node_type;
typedef BOOST_CONTAINER_IMPDEF
(insert_return_type_base) insert_return_type;
//allocator_type::value_type type must be std::pair
BOOST_STATIC_ASSERT((dtl::is_same >::value));
//////////////////////////////////////////////
//
// construct/copy/destroy
//
//////////////////////////////////////////////
//! Effects: Default constructs an empty map.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE
map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: base_t()
{}
//! Effects: Constructs an empty map using the specified comparison object
//! and allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE map(const Compare& comp, const allocator_type& a)
: base_t(comp, a)
{}
//! Effects: Constructs an empty map using the specified comparison object.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit map(const Compare& comp)
: base_t(comp)
{}
//! Effects: Constructs an empty map using the specified allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit map(const allocator_type& a)
: base_t(a)
{}
//! Effects: Constructs an empty map and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last)
: base_t(true, first, last)
{}
//! Effects: Constructs an empty map using the specified
//! allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const allocator_type& a)
: base_t(true, first, last, Compare(), a)
{}
//! Effects: Constructs an empty map using the specified comparison object and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const Compare& comp)
: base_t(true, first, last, comp)
{}
//! Effects: Constructs an empty map using the specified comparison object and
//! allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: base_t(true, first, last, comp, a)
{}
//! Effects: Constructs an empty map 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
BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last)
: base_t(ordered_range, first, last)
{}
//! Effects: Constructs an empty map using the specified comparison object 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
BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
: base_t(ordered_range, first, last, comp)
{}
//! Effects: Constructs an empty 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
BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last
, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, first, last, comp, a)
{}
//! Effects: Constructs an empty map using the specified allocator object 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
BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
: base_t(ordered_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Constructs an empty map and
//! inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted according
//! to the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE map(std::initializer_list il)
: base_t(true, il.begin(), il.end())
{}
//! Effects: Constructs an empty map using the specified comparison object and
//! inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE map(std::initializer_list il, const Compare& comp)
: base_t(true, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty map using the specified
//! allocator, and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE map(std::initializer_list il, const allocator_type& a)
: base_t(true, il.begin(), il.end(), Compare(), a)
{}
//! Effects: Constructs an empty 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 [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE map(std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(true, il.begin(), il.end(), comp, a)
{}
//! Effects: Constructs an empty map and inserts elements from the ordered unique range [il.begin(), il.end()).
//! This function is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, std::initializer_list il)
: base_t(ordered_range, il.begin(), il.end())
{}
//! Effects: Constructs an empty map using the specified comparison object,
//! and inserts elements from the ordered unique range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, std::initializer_list il, const Compare& comp)
: base_t(ordered_range, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty map using the specified comparison object and
//! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, std::initializer_list il
, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, il.begin(), il.end(), comp, a)
{}
#endif
//! Effects: Copy constructs a map.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE map(const map& x)
: base_t(static_cast(x))
{}
//! Effects: Move constructs a map. Constructs *this using x's resources.
//!
//! Complexity: Constant.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE map(BOOST_RV_REF(map) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: base_t(BOOST_MOVE_BASE(base_t, x))
{}
//! Effects: Copy constructs a map using the specified allocator.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE map(const map& x, const allocator_type &a)
: base_t(static_cast(x), a)
{}
//! Effects: Move constructs a map using the specified allocator.
//! Constructs *this using x's resources.
//!
//! Complexity: Constant if x == x.get_allocator(), linear otherwise.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE map(BOOST_RV_REF(map) x, const allocator_type &a)
: base_t(BOOST_MOVE_BASE(base_t, x), a)
{}
//! Effects: Makes *this a copy of x.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE map& operator=(BOOST_COPY_ASSIGN_REF(map) x)
{ return static_cast(this->base_t::operator=(static_cast(x))); }
//! Effects: this->swap(x.get()).
//!
//! Throws: If allocator_traits_type::propagate_on_container_move_assignment
//! is false and (allocation throws or value_type's move constructor throws)
//!
//! Complexity: Constant if allocator_traits_type::
//! propagate_on_container_move_assignment is true or
//! this->get>allocator() == x.get_allocator(). Linear otherwise.
BOOST_CONTAINER_FORCEINLINE map& operator=(BOOST_RV_REF(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::value)
{ return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Assign content of il to *this.
//!
BOOST_CONTAINER_FORCEINLINE map& operator=(std::initializer_list il)
{
this->clear();
insert(il.begin(), il.end());
return *this;
}
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Returns a copy of the allocator that
//! was passed to the object's constructor.
//!
//! Complexity: Constant.
allocator_type get_allocator() const;
//! 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;
//! 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;
//! Effects: Returns an iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
iterator begin() BOOST_NOEXCEPT_OR_NOTHROW;
//! 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;
//! 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;
//! Effects: Returns an iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
//! 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;
//! 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;
//! Effects: Returns a reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
//! 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;
//! 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;
//! Effects: Returns true if the container contains no elements.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
bool empty() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the number of the elements contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type size() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the largest possible size of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: If there is no key equivalent to x in the map, inserts
//! value_type(x, T()) into the 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 map, inserts
//! value_type(boost::move(x), T()) into the 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(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(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
BOOST_CONTAINER_FORCEINLINE std::pair insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)
{ return this->base_t::insert_or_assign(const_iterator(), k, ::boost::forward(obj)); }
//! Effects: If a key equivalent to k already exists in the container, assigns forward(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
BOOST_CONTAINER_FORCEINLINE std::pair insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
{ return this->base_t::insert_or_assign(const_iterator(), ::boost::move(k), ::boost::forward(obj)); }
//! Effects: If a key equivalent to k already exists in the container, assigns forward(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(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
BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)
{ return this->base_t::insert_or_assign(hint, k, ::boost::forward(obj)).first; }
//! Effects: If a key equivalent to k already exists in the container, assigns forward(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
BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
{ return this->base_t::insert_or_assign(hint, ::boost::move(k), ::boost::forward(obj)).first; }
//! 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("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("map::at key not found");
}
return i->second;
}
//////////////////////////////////////////////
//
// modifiers
//
//////////////////////////////////////////////
//! 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.
BOOST_CONTAINER_FORCEINLINE std::pair insert(const value_type& x)
{ return this->base_t::insert_unique(x); }
//! Effects: Inserts a new value_type created 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.
BOOST_CONTAINER_FORCEINLINE std::pair insert(const nonconst_value_type& x)
{ return this->try_emplace(x.first, x.second); }
//! 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.
BOOST_CONTAINER_FORCEINLINE std::pair insert(BOOST_RV_REF(nonconst_value_type) x)
{ return this->try_emplace(boost::move(x.first), boost::move(x.second)); }
//! 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.
BOOST_CONTAINER_FORCEINLINE std::pair insert(BOOST_RV_REF(movable_value_type) x)
{ return this->try_emplace(boost::move(x.first), boost::move(x.second)); }
//! Effects: Move constructs a new value from 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.
BOOST_CONTAINER_FORCEINLINE std::pair insert(BOOST_RV_REF(value_type) x)
{ return this->base_t::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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
{ return this->base_t::insert_unique(p, x); }
//! Effects: Move constructs a new value from x 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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(nonconst_value_type) x)
{ return this->try_emplace(p, boost::move(x.first), boost::move(x.second)); }
//! Effects: Move constructs a new value from x 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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
{ return this->try_emplace(p, boost::move(x.first), boost::move(x.second)); }
//! 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.
iterator insert(const_iterator p, const nonconst_value_type& x)
{ return this->try_emplace(p, x.first, x.second); }
//! 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.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
{ return this->base_t::insert_unique(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)
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->base_t::insert_unique(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.begin() to il.end())
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->base_t::insert_unique(il.begin(), il.end()); }
#endif
//! Requires: nh is empty or this->get_allocator() == nh.get_allocator().
//!
//! Effects: If nh is empty, has no effect. Otherwise, inserts the element owned
//! by nh if and only if there is no element in the container with a key equivalent to nh.key().
//!
//! Returns: If nh is empty, insert_return_type.inserted is false, insert_return_type.position
//! is end(), and insert_return_type.node is empty. Otherwise if the insertion took place,
//! insert_return_type.inserted is true, insert_return_type.position points to the inserted element,
//! and insert_return_type.node is empty; if the insertion failed, insert_return_type.inserted is
//! false, insert_return_type.node has the previous value of nh, and insert_return_type.position
//! points to an element with a key equivalent to nh.key().
//!
//! Complexity: Logarithmic
insert_return_type insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{
typename base_t::node_type n(boost::move(nh));
typename base_t::insert_return_type base_ret(this->base_t::insert_unique_node(boost::move(n)));
return insert_return_type (base_ret.inserted, base_ret.position, boost::move(base_ret.node));
}
//! Effects: Same as `insert(node_type && nh)` but the element is inserted as close as possible
//! to the position just prior to "hint".
//!
//! Complexity: logarithmic in general, but amortized constant if the element is inserted
//! right before "hint".
insert_return_type insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{
typename base_t::node_type n(boost::move(nh));
typename base_t::insert_return_type base_ret(this->base_t::insert_unique_node(hint, boost::move(n)));
return insert_return_type (base_ret.inserted, base_ret.position, boost::move(base_ret.node));
}
#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)... in the container if and only if there is
//! no element in the container with an equivalent key.
//! p is a hint pointing to where the insert should start to search.
//!
//! 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 in general, but amortized constant if t
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE std::pair emplace(BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_unique(boost::forward(args)...); }
//! Effects: Inserts an object of type T constructed with
//! std::forward(args)... in the container if and only if there is
//! no element in the container with an equivalent key.
//! 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 in general, but amortized constant if t
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_hint_unique(p, boost::forward(args)...); }
//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct,
//! forward_as_tuple(k), forward_as_tuple(forward(args)...).
//!
//! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
//! forward_as_tuple(forward(args)...).
//!
//! Returns: The bool component of the returned pair is true if and only if the
//! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
//!
//! Complexity: Logarithmic.
template
BOOST_CONTAINER_FORCEINLINE std::pair try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)
{ return this->base_t::try_emplace(const_iterator(), k, boost::forward(args)...); }
//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct,
//! forward_as_tuple(k), forward_as_tuple(forward(args)...).
//!
//! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
//! forward_as_tuple(forward(args)...).
//!
//! Returns: The returned iterator points to the map element whose key is equivalent to k.
//!
//! Complexity: Logarithmic in general, but amortized constant if value
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)
{ return this->base_t::try_emplace(hint, k, boost::forward(args)...).first; }
//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct,
//! forward_as_tuple(move(k)), forward_as_tuple(forward(args)...).
//!
//! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
//! forward_as_tuple(forward(args)...).
//!
//! Returns: The bool component of the returned pair is true if and only if the
//! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
//!
//! Complexity: Logarithmic.
template
BOOST_CONTAINER_FORCEINLINE std::pair try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
{ return this->base_t::try_emplace(const_iterator(), boost::move(k), boost::forward(args)...); }
//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct,
//! forward_as_tuple(move(k)), forward_as_tuple(forward(args)...).
//!
//! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
//! forward_as_tuple(forward(args)...).
//!
//! Returns: The returned iterator points to the map element whose key is equivalent to k.
//!
//! Complexity: Logarithmic in general, but amortized constant if value
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
{ return this->base_t::try_emplace(hint, boost::move(k), boost::forward(args)...).first; }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_MAP_EMPLACE_CODE(N) \
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE std::pair emplace(BOOST_MOVE_UREF##N)\
{ return this->base_t::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 this->base_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE std::pair try_emplace(const key_type& k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::try_emplace(const_iterator(), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::try_emplace(hint, k BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first; }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE std::pair try_emplace(BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::try_emplace(const_iterator(), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::try_emplace(hint, boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first; }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MAP_EMPLACE_CODE)
#undef BOOST_CONTAINER_MAP_EMPLACE_CODE
#endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! 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: Amortized constant time
iterator erase(const_iterator p) BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Erases all elements in the container with key equivalent to x.
//!
//! Returns: Returns the number of erased elements.
//!
//! Complexity: log(size()) + count(k)
size_type erase(const key_type& x) BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Erases all the elements in the range [first, last).
//!
//! Returns: Returns last.
//!
//! Complexity: log(size())+N where N is the distance from first to last.
iterator erase(const_iterator first, const_iterator last) BOOST_NOEXCEPT_OR_NOTHROW;
#endif
//! Effects: Removes the first element in the container with key equivalent to k.
//!
//! Returns: A node_type owning the element if found, otherwise an empty node_type.
//!
//! Complexity: log(size()).
node_type extract(const key_type& k)
{
typename base_t::node_type base_nh(this->base_t::extract(k));
node_type nh(boost::move(base_nh));
return BOOST_MOVE_RET(node_type, nh);
}
//! Effects: Removes the element pointed to by "position".
//!
//! Returns: A node_type owning the element, otherwise an empty node_type.
//!
//! Complexity: Amortized constant.
node_type extract(const_iterator position)
{
typename base_t::node_type base_nh(this->base_t::extract(position));
node_type nh(boost::move(base_nh));
return BOOST_MOVE_RET(node_type, nh);
}
//! Requires: this->get_allocator() == source.get_allocator().
//!
//! Effects: Attempts to extract each element in source and insert it into a using
//! the comparison object of *this. If there is an element in a with key equivalent to the
//! key of an element from source, then that element is not extracted from source.
//!
//! Postcondition: Pointers and references to the transferred elements of source refer
//! to those same elements but as members of *this. Iterators referring to the transferred
//! elements will continue to refer to their elements, but they now behave as iterators into *this,
//! not into source.
//!
//! Throws: Nothing unless the comparison object throws.
//!
//! Complexity: N log(size() + N) (N has the value source.size())
template
BOOST_CONTAINER_FORCEINLINE void merge(map& source)
{
typedef dtl::tree
base2_t;
this->merge_unique(static_cast(source));
}
//! @copydoc ::boost::container::map::merge(map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG map BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::map::merge(map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(multimap& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_unique(static_cast(source));
}
//! @copydoc ::boost::container::map::merge(map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multimap BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Swaps the contents of *this and x.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
void swap(map& x)
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable::value )
//! Effects: erase(begin(),end()).
//!
//! Postcondition: size() == 0.
//!
//! Complexity: linear in size().
void clear() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the comparison object out
//! of which a was constructed.
//!
//! Complexity: Constant.
key_compare key_comp() const;
//! Effects: Returns an object of value_compare constructed out
//! of the comparison object.
//!
//! Complexity: Constant.
value_compare value_comp() const;
//! 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);
//! 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.
const_iterator find(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
iterator find(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const_iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
const_iterator find(const K& x) const;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Returns: The number of elements with key equivalent to x.
//!
//! Complexity: log(size())+count(k)
BOOST_CONTAINER_FORCEINLINE size_type count(const key_type& x) const
{ return static_cast(this->find(x) != this->cend()); }
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: The number of elements with key equivalent to x.
//!
//! Complexity: log(size())+count(k)
template
BOOST_CONTAINER_FORCEINLINE size_type count(const K& x) const
{ return static_cast(this->find(x) != this->cend()); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Returns: Returns true if there is an element with key
//! equivalent to key in the container, otherwise false.
//!
//! Complexity: log(size()).
bool contains(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: Returns true if there is an element with key
//! equivalent to key in the container, otherwise false.
//!
//! Complexity: log(size()).
template
bool contains(const K& x) const;
//! 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 lower_bound(const key_type& 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 lower_bound(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to the first element with key not less
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
iterator lower_bound(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const iterator pointing to the first element with key not
//! less than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
const_iterator lower_bound(const K& x) const;
//! Returns: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
iterator upper_bound(const key_type& x);
//! Returns: A const iterator pointing to the first element with key
//! greater than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
const_iterator upper_bound(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
iterator upper_bound(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const iterator pointing to the first element with key
//! greater than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
const_iterator upper_bound(const K& x) const;
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
std::pair equal_range(const key_type& x);
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
std::pair equal_range(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
template
std::pair equal_range(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
template
std::pair equal_range(const K& x) const;
//! Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.
//!
//! Complexity: Linear
void rebalance();
//! Effects: Returns true if x and y are equal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator==(const map& x, const map& y);
//! Effects: Returns true if x and y are unequal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator!=(const map& x, const map& y);
//! Effects: Returns true if x is less than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator<(const map& x, const map& y);
//! Effects: Returns true if x is greater than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator>(const map& x, const map& y);
//! 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 map& x, const map& y);
//! 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 map& x, const map& y);
//! Effects: x.swap(y)
//!
//! Complexity: Constant.
friend void swap(map& x, map& y);
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
template
BOOST_CONTAINER_FORCEINLINE mapped_type& priv_subscript(BOOST_FWD_REF(KeyConvertible) k)
{
return this->try_emplace(boost::forward(k)).first->second;
}
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
template
map(InputIterator, InputIterator) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
map(InputIterator, InputIterator, AllocatorOrCompare const&) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator, it_based_second_type_t>>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
map(InputIterator, InputIterator, Compare const&, Allocator const&) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t
, Compare
, Allocator>;
template
map(ordered_unique_range_t, InputIterator, InputIterator) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
map(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator, it_based_second_type_t>>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
map(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
map< it_based_non_const_first_type_t
, it_based_second_type_t
, Compare
, Allocator>;
#endif
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
} //namespace container {
//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template
struct has_trivial_destructor_after_move >
{
typedef ::boost::container::dtl::tree, int, Compare, Allocator, Options> tree;
static const bool value = ::boost::has_trivial_destructor_after_move::value;
};
namespace container {
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! A 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 multimap class
//! supports bidirectional iterators.
//!
//! A multimap satisfies all of the requirements of a container and of a reversible
//! container and of an associative container. The value_type stored
//! by this container is the value_type is std::pair.
//!
//! \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).
//! \tparam Allocator is the allocator to allocate the value_types
//! (e.g. allocator< std::pair > ).
//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
template < class Key, class T, class Compare = std::less
, class Allocator = new_allocator< std::pair< const Key, T> >, class Options = tree_assoc_defaults>
#else
template
#endif
class multimap
///@cond
: public dtl::tree
< std::pair
, int
, Compare, Allocator, Options>
///@endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(multimap)
typedef int select_1st_t;
typedef std::pair value_type_impl;
typedef dtl::tree
base_t;
typedef dtl::pair movable_value_type_impl;
typedef typename base_t::value_compare value_compare_impl;
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef T mapped_type;
typedef typename base_t::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename boost::container::allocator_traits::value_type value_type;
typedef typename boost::container::allocator_traits::pointer pointer;
typedef typename boost::container::allocator_traits::const_pointer const_pointer;
typedef typename boost::container::allocator_traits::reference reference;
typedef typename boost::container::allocator_traits::const_reference const_reference;
typedef typename boost::container::allocator_traits::size_type size_type;
typedef typename boost::container::allocator_traits::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type;
typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare;
typedef Compare key_compare;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator;
typedef std::pair nonconst_value_type;
typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl) movable_value_type;
typedef BOOST_CONTAINER_IMPDEF(node_handle<
typename base_t::stored_allocator_type
BOOST_MOVE_I pair_key_mapped_of_value
>) node_type;
//allocator_type::value_type type must be std::pair
BOOST_STATIC_ASSERT((dtl::is_same >::value));
//////////////////////////////////////////////
//
// construct/copy/destroy
//
//////////////////////////////////////////////
//! Effects: Default constructs an empty multimap.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE multimap()
BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: base_t()
{}
//! Effects: Constructs an empty multimap using the specified allocator
//! object and allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit multimap(const allocator_type& a)
: base_t(a)
{}
//! Effects: Constructs an empty multimap using the specified comparison.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit multimap(const Compare& comp)
: base_t(comp)
{}
//! Effects: Constructs an empty multimap using the specified comparison and allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE multimap(const Compare& comp, const allocator_type& a)
: base_t(comp, a)
{}
//! Effects: Constructs an empty multimap and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last)
: base_t(false, first, last)
{}
//! Effects: Constructs an empty multimap using the specified
//! allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last, const allocator_type& a)
: base_t(false, first, last, Compare(), a)
{}
//! Effects: Constructs an empty multimap using the specified comparison object and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last, const Compare& comp)
: base_t(false, first, last, comp)
{}
//! Effects: Constructs an empty multimap using the specified comparison object
//! and allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last,
const Compare& comp, const allocator_type& a)
: base_t(false, first, last, comp, a)
{}
//! Effects: Constructs an empty multimap and
//! inserts elements from the ordered range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last)
: base_t(ordered_range, first, last)
{}
//! Effects: Constructs an empty multimap using the specified comparison object and
//! inserts elements from the ordered range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
: base_t(ordered_range, first, last, comp)
{}
//! Effects: Constructs an empty 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
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp,
const allocator_type& a)
: base_t(ordered_range, first, last, comp, a)
{}
//! Effects: Constructs an empty multimap using the specified allocator and
//! inserts elements from the ordered range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const allocator_type& a)
: base_t(ordered_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Constructs an empty multimap and
//! and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list il)
: base_t(false, il.begin(), il.end())
{}
//! Effects: Constructs an empty multimap using the specified
//! allocator, and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list il, const allocator_type& a)
: base_t(false, il.begin(), il.end(), Compare(), a)
{}
//! Effects: Constructs an empty multimap using the specified comparison object and
//! inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list il, const Compare& comp)
: base_t(false, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty multimap using the specified comparison object and
//! allocator, and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is il.first() - il.end().
BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(false, il.begin(), il.end(), comp, a)
{}
//! Effects: Constructs an empty map and
//! inserts elements from the ordered range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list il)
: base_t(ordered_range, il.begin(), il.end())
{}
//! Effects: Constructs an empty map using the specified comparison object and
//! inserts elements from the ordered range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list il, const Compare& comp)
: base_t(ordered_range, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty map and
//! inserts elements from the ordered range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, il.begin(), il.end(), comp, a)
{}
#endif
//! Effects: Copy constructs a multimap.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE multimap(const multimap& x)
: base_t(static_cast(x))
{}
//! Effects: Move constructs a multimap. Constructs *this using x's resources.
//!
//! Complexity: Constant.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE multimap(BOOST_RV_REF(multimap) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: base_t(BOOST_MOVE_BASE(base_t, x))
{}
//! Effects: Copy constructs a multimap.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE multimap(const multimap& x, const allocator_type &a)
: base_t(static_cast(x), a)
{}
//! Effects: Move constructs a multimap using the specified allocator.
//! Constructs *this using x's resources.
//! Complexity: Constant if a == x.get_allocator(), linear otherwise.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE multimap(BOOST_RV_REF(multimap) x, const allocator_type &a)
: base_t(BOOST_MOVE_BASE(base_t, x), a)
{}
//! Effects: Makes *this a copy of x.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE multimap& operator=(BOOST_COPY_ASSIGN_REF(multimap) x)
{ return static_cast(this->base_t::operator=(static_cast(x))); }
//! Effects: this->swap(x.get()).
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE multimap& operator=(BOOST_RV_REF(multimap) x)
BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
allocator_traits_type::is_always_equal::value) &&
boost::container::dtl::is_nothrow_move_assignable::value)
{ return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Assign content of il to *this.
//!
BOOST_CONTAINER_FORCEINLINE multimap& operator=(std::initializer_list il)
{
this->clear();
insert(il.begin(), il.end());
return *this;
}
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::set::get_allocator()
allocator_type get_allocator() const;
//! @copydoc ::boost::container::set::get_stored_allocator()
stored_allocator_type &get_stored_allocator();
//! @copydoc ::boost::container::set::get_stored_allocator() const
const stored_allocator_type &get_stored_allocator() const;
//! @copydoc ::boost::container::set::begin()
iterator begin();
//! @copydoc ::boost::container::set::begin() const
const_iterator begin() const;
//! @copydoc ::boost::container::set::cbegin() const
const_iterator cbegin() const;
//! @copydoc ::boost::container::set::end()
iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::end() const
const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::cend() const
const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rbegin()
reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rbegin() const
const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::crbegin() const
const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rend()
reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rend() const
const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::crend() const
const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::empty() const
bool empty() const;
//! @copydoc ::boost::container::set::size() const
size_type size() const;
//! @copydoc ::boost::container::set::max_size() const
size_type max_size() const;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts an object of type T constructed with
//! std::forward(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 in general, but amortized constant if t
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_equal(boost::forward(args)...); }
//! Effects: Inserts an object of type T constructed with
//! std::forward(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 in general, but amortized constant if t
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_hint_equal(p, boost::forward(args)...); }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE(N) \
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_equal(BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE)
#undef BOOST_CONTAINER_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.
BOOST_CONTAINER_FORCEINLINE iterator insert(const value_type& x)
{ return this->base_t::insert_equal(x); }
//! Effects: Inserts a new value constructed from x and returns
//! the iterator pointing to the newly inserted element.
//!
//! Complexity: Logarithmic.
BOOST_CONTAINER_FORCEINLINE iterator insert(const nonconst_value_type& x)
{ return this->base_t::emplace_equal(x); }
//! Effects: Inserts a new value move-constructed from x and returns
//! the iterator pointing to the newly inserted element.
//!
//! Complexity: Logarithmic.
BOOST_CONTAINER_FORCEINLINE iterator insert(BOOST_RV_REF(nonconst_value_type) x)
{ return this->base_t::emplace_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.
iterator insert(BOOST_RV_REF(movable_value_type) x)
{ return this->base_t::emplace_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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
{ return this->base_t::insert_equal(p, x); }
//! Effects: Inserts a new value 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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const nonconst_value_type& x)
{ return this->base_t::emplace_hint_equal(p, x); }
//! Effects: Inserts a new 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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(nonconst_value_type) x)
{ return this->base_t::emplace_hint_equal(p, boost::move(x)); }
//! Effects: Inserts a new 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 in general, but amortized constant if t
//! is inserted right before p.
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
{ return this->base_t::emplace_hint_equal(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)
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->base_t::insert_equal(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 il.begin() to il.end())
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->base_t::insert_equal(il.begin(), il.end()); }
#endif
//! Requires: nh is empty or this->get_allocator() == nh.get_allocator().
//!
//! Effects/Returns: If nh is empty, has no effect and returns end(). Otherwise, inserts
//! the element owned by nh and returns an iterator pointing to the newly inserted element.
//! If a range containing elements with keys equivalent to nh.key() exists,
//! the element is inserted at the end of that range. nh is always emptied.
//!
//! Complexity: Logarithmic
iterator insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{
typename base_t::node_type n(boost::move(nh));
return this->base_t::insert_equal_node(boost::move(n));
}
//! Effects: Same as `insert(node_type && nh)` but the element is inserted as close as possible
//! to the position just prior to "hint".
//!
//! Complexity: logarithmic in general, but amortized constant if the element is inserted
//! right before "hint".
iterator insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{
typename base_t::node_type n(boost::move(nh));
return this->base_t::insert_equal_node(hint, boost::move(n));
}
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::set::erase(const_iterator)
iterator erase(const_iterator p);
//! @copydoc ::boost::container::set::erase(const key_type&)
size_type erase(const key_type& x);
//! @copydoc ::boost::container::set::erase(const_iterator,const_iterator)
iterator erase(const_iterator first, const_iterator last);
#endif
//! @copydoc ::boost::container::map::extract(const key_type&)
node_type extract(const key_type& k)
{
typename base_t::node_type base_nh(this->base_t::extract(k));
return node_type(boost::move(base_nh));
}
//! @copydoc ::boost::container::map::extract(const_iterator)
node_type extract(const_iterator position)
{
typename base_t::node_type base_nh(this->base_t::extract(position));
return node_type (boost::move(base_nh));
}
//! Requires: this->get_allocator() == source.get_allocator().
//!
//! Effects: Extracts each element in source and insert it into a using
//! the comparison object of *this.
//!
//! Postcondition: Pointers and references to the transferred elements of source refer
//! to those same elements but as members of *this. Iterators referring to the transferred
//! elements will continue to refer to their elements, but they now behave as iterators into *this,
//! not into source.
//!
//! Throws: Nothing unless the comparison object throws.
//!
//! Complexity: N log(size() + N) (N has the value source.size())
template
BOOST_CONTAINER_FORCEINLINE void merge(multimap& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_equal(static_cast(source));
}
//! @copydoc ::boost::container::multimap::merge(multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multimap BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::multimap::merge(multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(map& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_equal(static_cast(source));
}
//! @copydoc ::boost::container::multimap::merge(multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG map