Chris@16: ////////////////////////////////////////////////////////////////////////////// Chris@16: // Chris@101: // (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost Chris@16: // Software License, Version 1.0. (See accompanying file Chris@16: // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Chris@16: // Chris@16: // See http://www.boost.org/libs/container for documentation. Chris@16: // Chris@16: ////////////////////////////////////////////////////////////////////////////// Chris@16: #ifndef BOOST_CONTAINER_MAP_HPP Chris@16: #define BOOST_CONTAINER_MAP_HPP Chris@16: Chris@101: #ifndef BOOST_CONFIG_HPP Chris@101: # include Chris@101: #endif Chris@101: Chris@101: #if defined(BOOST_HAS_PRAGMA_ONCE) Chris@16: # pragma once Chris@16: #endif Chris@16: Chris@16: #include Chris@16: #include Chris@16: Chris@101: // container Chris@16: #include Chris@101: #include //new_allocator Chris@101: #include Chris@101: // container/detail Chris@101: #include Chris@16: #include Chris@101: #include Chris@16: #include Chris@16: #include Chris@101: // move Chris@101: #include Chris@101: #include Chris@101: // move/detail Chris@101: #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@101: #include Chris@101: #endif Chris@16: #include Chris@101: // intrusive/detail Chris@101: #include //pair Chris@101: #include //less, equal Chris@101: // other Chris@16: #include Chris@101: #include Chris@101: // std Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: #include Chris@101: #endif Chris@16: Chris@16: namespace boost { Chris@16: namespace container { Chris@16: Chris@101: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: //! A map is a kind of associative container that supports unique keys (contains at Chris@16: //! most one of each key value) and provides for fast retrieval of values of another Chris@16: //! type T based on the keys. The map class supports bidirectional iterators. Chris@16: //! Chris@16: //! A map satisfies all of the requirements of a container and of a reversible Chris@101: //! container and of an associative container. The value_type stored Chris@101: //! by this container is the value_type is std::pair. Chris@16: //! Chris@101: //! \tparam Key is the key_type of the map Chris@101: //! \tparam T is the mapped_type Chris@101: //! \tparam Compare is the ordering function for Keys (e.g. std::less). Chris@101: //! \tparam Allocator is the allocator to allocate the value_types Chris@101: //! (e.g. allocator< std::pair > ). Chris@101: //! \tparam MapOptions is an packed option type generated using using boost::container::tree_assoc_options. Chris@101: template < class Key, class T, class Compare = std::less Chris@101: , class Allocator = new_allocator< std::pair< const Key, T> >, class MapOptions = tree_assoc_defaults > Chris@16: #else Chris@101: template Chris@16: #endif Chris@16: class map Chris@101: ///@cond Chris@101: : public container_detail::tree Chris@101: < Key, std::pair Chris@101: , container_detail::select1st< std::pair > Chris@101: , Compare, Allocator, MapOptions> Chris@101: ///@endcond Chris@16: { Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: BOOST_COPYABLE_AND_MOVABLE(map) Chris@16: Chris@16: typedef std::pair value_type_impl; Chris@101: typedef container_detail::tree Chris@101: , Compare, Allocator, MapOptions> base_t; Chris@16: typedef container_detail::pair movable_value_type_impl; Chris@16: typedef container_detail::tree_value_compare Chris@16: < Key, value_type_impl, Compare, container_detail::select1st Chris@16: > value_compare_impl; Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: public: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // types Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@101: typedef Key key_type; Chris@101: typedef ::boost::container::allocator_traits allocator_traits_type; Chris@101: typedef T mapped_type; Chris@101: typedef std::pair value_type; Chris@16: typedef typename boost::container::allocator_traits::pointer pointer; Chris@16: typedef typename boost::container::allocator_traits::const_pointer const_pointer; Chris@16: typedef typename boost::container::allocator_traits::reference reference; Chris@16: typedef typename boost::container::allocator_traits::const_reference const_reference; Chris@16: typedef typename boost::container::allocator_traits::size_type size_type; Chris@16: typedef typename boost::container::allocator_traits::difference_type difference_type; Chris@16: typedef Allocator allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type; Chris@16: typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare; Chris@16: typedef Compare key_compare; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator; Chris@16: typedef std::pair nonconst_value_type; Chris@16: typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl) movable_value_type; Chris@16: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // construct/copy/destroy Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@16: //! Effects: Default constructs an empty map. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: map() Chris@101: : base_t() Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty map using the specified comparison object Chris@16: //! and allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: explicit map(const Compare& comp, const allocator_type& a = allocator_type()) Chris@101: : base_t(comp, a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty map using the specified allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit map(const allocator_type& a) Chris@101: : base_t(a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty map using the specified comparison object and Chris@16: //! allocator, and inserts elements from the range [first ,last ). Chris@16: //! Chris@16: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@16: //! comp and otherwise N logN, where N is last - first. Chris@16: template Chris@16: map(InputIterator first, InputIterator last, const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(true, first, last, comp, a) Chris@16: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty map using the specified Chris@101: //! allocator, and inserts elements from the range [first ,last ). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is last - first. Chris@101: template Chris@101: map(InputIterator first, InputIterator last, const allocator_type& a) Chris@101: : base_t(true, first, last, Compare(), a) Chris@101: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty map using the specified comparison object and Chris@16: //! allocator, and inserts elements from the ordered unique range [first ,last). This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Requires: [first ,last) must be ordered according to the predicate and must be Chris@16: //! unique values. Chris@16: //! Chris@16: //! Complexity: Linear in N. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@16: template Chris@16: map( ordered_unique_range_t, InputIterator first, InputIterator last Chris@16: , const Compare& comp = Compare(), const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, first, last, comp, a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Constructs an empty map using the specified comparison object and Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.first() - il.end(). Chris@101: map(std::initializer_list il, const Compare& comp = Compare(), const allocator_type& a = allocator_type()) Chris@101: : base_t(true, il.begin(), il.end(), comp, a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty map using the specified Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.first() - il.end(). Chris@101: map(std::initializer_list il, const allocator_type& a) Chris@101: : base_t(true, il.begin(), il.end(), Compare(), a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty set using the specified comparison object and Chris@101: //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function Chris@101: //! is more efficient than the normal range creation for ordered ranges. Chris@101: //! Chris@101: //! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be Chris@101: //! unique values. Chris@101: //! Chris@101: //! Complexity: Linear in N. Chris@101: //! Chris@101: //! Note: Non-standard extension. Chris@101: map(ordered_unique_range_t, std::initializer_list il, const Compare& comp = Compare(), Chris@101: const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, il.begin(), il.end(), comp, a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: #endif Chris@101: Chris@16: //! Effects: Copy constructs a map. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: map(const map& x) Chris@101: : base_t(static_cast(x)) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Move constructs a map. Constructs *this using x's resources. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Postcondition: x is emptied. Chris@16: map(BOOST_RV_REF(map) x) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x)) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Copy constructs a map using the specified allocator. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: map(const map& x, const allocator_type &a) Chris@101: : base_t(static_cast(x), a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Move constructs a map using the specified allocator. Chris@16: //! Constructs *this using x's resources. Chris@16: //! Chris@16: //! Complexity: Constant if x == x.get_allocator(), linear otherwise. Chris@16: //! Chris@16: //! Postcondition: x is emptied. Chris@16: map(BOOST_RV_REF(map) x, const allocator_type &a) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x), a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Makes *this a copy of x. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: map& operator=(BOOST_COPY_ASSIGN_REF(map) x) Chris@101: { return static_cast(this->base_t::operator=(static_cast(x))); } Chris@16: Chris@16: //! Effects: this->swap(x.get()). Chris@16: //! Chris@101: //! Throws: If allocator_traits_type::propagate_on_container_move_assignment Chris@101: //! is false and (allocation throws or value_type's move constructor throws) Chris@101: //! Chris@101: //! Complexity: Constant if allocator_traits_type:: Chris@101: //! propagate_on_container_move_assignment is true or Chris@101: //! this->get>allocator() == x.get_allocator(). Linear otherwise. Chris@16: map& operator=(BOOST_RV_REF(map) x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_move_assignable::value ) Chris@16: Chris@101: { return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); } Chris@101: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Assign content of il to *this. Chris@101: //! Chris@101: map& operator=(std::initializer_list il) Chris@101: { Chris@101: this->clear(); Chris@101: insert(il.begin(), il.end()); Chris@101: return *this; Chris@101: } Chris@101: #endif Chris@101: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@101: Chris@101: //! Effects: Returns a copy of the allocator that Chris@16: //! was passed to the object's constructor. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: allocator_type get_allocator() const; Chris@16: Chris@16: //! Effects: Returns a reference to the internal allocator. Chris@16: //! Chris@16: //! Throws: Nothing Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@101: stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reference to the internal allocator. Chris@16: //! Chris@16: //! Throws: Nothing Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@101: const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns an iterator to the first element contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: iterator begin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the first element contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Effects: Returns a const_iterator to the first element contained in the container. Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns an iterator to the end of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: iterator end() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the end of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Effects: Returns a const_iterator to the end of the container. Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reverse_iterator pointing to the beginning Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the beginning Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Effects: Returns a const_reverse_iterator pointing to the beginning Chris@101: //! of the reversed container. Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns true if the container contains no elements. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: bool empty() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the number of the elements contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: size_type size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the largest possible size of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: #endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Effects: If there is no key equivalent to x in the map, inserts Chris@16: //! value_type(x, T()) into the map. Chris@16: //! Chris@101: //! Returns: A reference to the mapped_type corresponding to x in *this. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: mapped_type& operator[](const key_type &k); Chris@16: Chris@16: //! Effects: If there is no key equivalent to x in the map, inserts Chris@16: //! value_type(boost::move(x), T()) into the map (the key is move-constructed) Chris@16: //! Chris@101: //! Returns: A reference to the mapped_type corresponding to x in *this. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: mapped_type& operator[](key_type &&k); Chris@16: #else Chris@16: BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript) Chris@16: #endif Chris@16: Chris@101: //! Returns: A reference to the element whose key is equivalent to x. Chris@16: //! Throws: An exception object of type out_of_range if no such element is present. Chris@16: //! Complexity: logarithmic. Chris@16: T& at(const key_type& k) Chris@16: { Chris@16: iterator i = this->find(k); Chris@16: if(i == this->end()){ Chris@16: throw_out_of_range("map::at key not found"); Chris@16: } Chris@16: return i->second; Chris@16: } Chris@16: Chris@101: //! Returns: A reference to the element whose key is equivalent to x. Chris@16: //! Throws: An exception object of type out_of_range if no such element is present. Chris@16: //! Complexity: logarithmic. Chris@16: const T& at(const key_type& k) const Chris@16: { Chris@16: const_iterator i = this->find(k); Chris@16: if(i == this->end()){ Chris@16: throw_out_of_range("map::at key not found"); Chris@16: } Chris@16: return i->second; Chris@16: } Chris@16: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // modifiers Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@16: //! Effects: Inserts x if and only if there is no element in the container Chris@16: //! with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: std::pair insert(const value_type& x) Chris@101: { return this->base_t::insert_unique(x); } Chris@16: Chris@16: //! Effects: Inserts a new value_type created from the pair if and only if Chris@16: //! there is no element in the container with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: std::pair insert(const nonconst_value_type& x) Chris@101: { return this->base_t::insert_unique(x); } Chris@16: Chris@16: //! Effects: Inserts a new value_type move constructed from the pair if and Chris@16: //! only if there is no element in the container with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: std::pair insert(BOOST_RV_REF(nonconst_value_type) x) Chris@101: { return this->base_t::insert_unique(boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a new value_type move constructed from the pair if and Chris@16: //! only if there is no element in the container with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: std::pair insert(BOOST_RV_REF(movable_value_type) x) Chris@101: { return this->base_t::insert_unique(boost::move(x)); } Chris@16: Chris@16: //! Effects: Move constructs a new value from x if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: std::pair insert(BOOST_RV_REF(value_type) x) Chris@101: { return this->base_t::insert_unique(boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a copy of x in the container if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, const value_type& x) Chris@101: { return this->base_t::insert_unique(p, x); } Chris@16: Chris@16: //! Effects: Move constructs a new value from x if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, BOOST_RV_REF(nonconst_value_type) x) Chris@101: { return this->base_t::insert_unique(p, boost::move(x)); } Chris@16: Chris@16: //! Effects: Move constructs a new value from x if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x) Chris@101: { return this->base_t::insert_unique(p, boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a copy of x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: iterator insert(const_iterator p, const nonconst_value_type& x) Chris@101: { return this->base_t::insert_unique(p, x); } Chris@16: Chris@16: //! Effects: Inserts an element move constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: iterator insert(const_iterator p, BOOST_RV_REF(value_type) x) Chris@101: { return this->base_t::insert_unique(p, boost::move(x)); } Chris@16: Chris@16: //! Requires: first, last are not iterators into *this. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) if and only Chris@16: //! if there is no element with key equivalent to the key of that element. Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: template Chris@16: void insert(InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_unique(first, last); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end()) if and only Chris@101: //! if there is no element with key equivalent to the key of that element. Chris@101: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) Chris@101: void insert(std::initializer_list il) Chris@101: { this->base_t::insert_unique(il.begin(), il.end()); } Chris@101: #endif Chris@101: Chris@101: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Effects: Inserts an object x of type T constructed with Chris@16: //! std::forward(args)... in the container if and only if there is Chris@16: //! no element in the container with an equivalent key. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@16: template Chris@101: std::pair emplace(BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_unique(boost::forward(args)...); } Chris@16: Chris@16: //! Effects: Inserts an object of type T constructed with Chris@16: //! std::forward(args)... in the container if and only if there is Chris@16: //! no element in the container with an equivalent key. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@16: template Chris@101: iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_hint_unique(p, boost::forward(args)...); } Chris@16: Chris@101: #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@101: #define BOOST_CONTAINER_MAP_EMPLACE_CODE(N) \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: std::pair emplace(BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_unique(BOOST_MOVE_FWD##N); }\ Chris@101: \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\ Chris@101: // Chris@101: BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MAP_EMPLACE_CODE) Chris@101: #undef BOOST_CONTAINER_MAP_EMPLACE_CODE Chris@16: Chris@101: #endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@101: Chris@101: //! Effects: Erases the element pointed to by p. Chris@16: //! Chris@16: //! Returns: Returns an iterator pointing to the element immediately Chris@16: //! following q prior to the element being erased. If no such element exists, Chris@16: //! returns end(). Chris@16: //! Chris@16: //! Complexity: Amortized constant time Chris@101: iterator erase(const_iterator p) BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Erases all elements in the container with key equivalent to x. Chris@16: //! Chris@16: //! Returns: Returns the number of erased elements. Chris@16: //! Chris@16: //! Complexity: log(size()) + count(k) Chris@101: size_type erase(const key_type& x) BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Erases all the elements in the range [first, last). Chris@16: //! Chris@16: //! Returns: Returns last. Chris@16: //! Chris@16: //! Complexity: log(size())+N where N is the distance from first to last. Chris@101: iterator erase(const_iterator first, const_iterator last) BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Swaps the contents of *this and x. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: void swap(map& x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_swappable::value ) Chris@16: Chris@16: //! Effects: erase(a.begin(),a.end()). Chris@16: //! Chris@16: //! Postcondition: size() == 0. Chris@16: //! Chris@16: //! Complexity: linear in size(). Chris@101: void clear() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the comparison object out Chris@16: //! of which a was constructed. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: key_compare key_comp() const; Chris@16: Chris@16: //! Effects: Returns an object of value_compare constructed out Chris@16: //! of the comparison object. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: value_compare value_comp() const; Chris@16: Chris@16: //! Returns: An iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: iterator find(const key_type& x); Chris@16: Chris@101: //! Returns: A const_iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: const_iterator find(const key_type& x) const; Chris@101: Chris@101: #endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Returns: The number of elements with key equivalent to x. Chris@16: //! Chris@16: //! Complexity: log(size())+count(k) Chris@16: size_type count(const key_type& x) const Chris@101: { return static_cast(this->find(x) != this->cend()); } Chris@101: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator lower_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator lower_bound(const key_type& x) const; Chris@16: Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator upper_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator upper_bound(const key_type& x) const; Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: std::pair equal_range(const key_type& x); Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: std::pair equal_range(const key_type& x) const; Chris@16: Chris@101: //! Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees. Chris@101: //! Chris@101: //! Complexity: Linear Chris@101: void rebalance(); Chris@101: Chris@101: //! Effects: Returns true if x and y are equal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator==(const map& x, const map& y); Chris@101: Chris@101: //! Effects: Returns true if x and y are unequal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator!=(const map& x, const map& y); Chris@101: Chris@101: //! Effects: Returns true if x is less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<(const map& x, const map& y); Chris@101: Chris@101: //! Effects: Returns true if x is greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>(const map& x, const map& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<=(const map& x, const map& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>=(const map& x, const map& y); Chris@101: Chris@101: //! Effects: x.swap(y) Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: friend void swap(map& x, map& y); Chris@101: Chris@101: #endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@101: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: mapped_type& priv_subscript(const key_type &k) Chris@16: { Chris@16: //we can optimize this Chris@101: iterator i = this->lower_bound(k); Chris@16: // i->first is greater than or equivalent to k. Chris@101: if (i == this->end() || this->key_comp()(k, (*i).first)){ Chris@16: container_detail::value_init m; Chris@16: movable_value_type val(k, boost::move(m.m_t)); Chris@16: i = insert(i, boost::move(val)); Chris@16: } Chris@16: return (*i).second; Chris@16: } Chris@16: Chris@16: mapped_type& priv_subscript(BOOST_RV_REF(key_type) mk) Chris@16: { Chris@16: key_type &k = mk; Chris@16: //we can optimize this Chris@101: iterator i = this->lower_bound(k); Chris@16: // i->first is greater than or equivalent to k. Chris@101: if (i == this->end() || this->key_comp()(k, (*i).first)){ Chris@16: container_detail::value_init m; Chris@16: movable_value_type val(boost::move(k), boost::move(m.m_t)); Chris@16: i = insert(i, boost::move(val)); Chris@16: } Chris@16: return (*i).second; Chris@16: } Chris@16: Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: }; Chris@16: Chris@16: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: } //namespace container { Chris@16: Chris@16: //!has_trivial_destructor_after_move<> == true_type Chris@16: //!specialization for optimizations Chris@101: template Chris@101: struct has_trivial_destructor_after_move > Chris@16: { Chris@101: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@101: static const bool value = ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value; Chris@16: }; Chris@16: Chris@16: namespace container { Chris@16: Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: Chris@101: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: //! A multimap is a kind of associative container that supports equivalent keys Chris@16: //! (possibly containing multiple copies of the same key value) and provides for Chris@16: //! fast retrieval of values of another type T based on the keys. The multimap class Chris@16: //! supports bidirectional iterators. Chris@16: //! Chris@16: //! A multimap satisfies all of the requirements of a container and of a reversible Chris@101: //! container and of an associative container. The value_type stored Chris@101: //! by this container is the value_type is std::pair. Chris@16: //! Chris@101: //! \tparam Key is the key_type of the map Chris@101: //! \tparam Value is the mapped_type Chris@101: //! \tparam Compare is the ordering function for Keys (e.g. std::less). Chris@101: //! \tparam Allocator is the allocator to allocate the value_types Chris@101: //! (e.g. allocator< std::pair > ). Chris@101: //! \tparam MultiMapOptions is an packed option type generated using using boost::container::tree_assoc_options. Chris@101: template < class Key, class T, class Compare = std::less Chris@101: , class Allocator = new_allocator< std::pair< const Key, T> >, class MultiMapOptions = tree_assoc_defaults> Chris@16: #else Chris@101: template Chris@16: #endif Chris@16: class multimap Chris@101: ///@cond Chris@101: : public container_detail::tree Chris@101: < Key, std::pair Chris@101: , container_detail::select1st< std::pair > Chris@101: , Compare, Allocator, MultiMapOptions> Chris@101: ///@endcond Chris@16: { Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: BOOST_COPYABLE_AND_MOVABLE(multimap) Chris@16: Chris@16: typedef std::pair value_type_impl; Chris@101: typedef container_detail::tree Chris@101: , Compare, Allocator, MultiMapOptions> base_t; Chris@16: typedef container_detail::pair movable_value_type_impl; Chris@16: typedef container_detail::tree_value_compare Chris@16: < Key, value_type_impl, Compare, container_detail::select1st Chris@16: > value_compare_impl; Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: Chris@101: typedef ::boost::container::allocator_traits allocator_traits_type; Chris@16: Chris@16: public: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // types Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@16: typedef Key key_type; Chris@16: typedef T mapped_type; Chris@16: typedef std::pair value_type; Chris@16: typedef typename boost::container::allocator_traits::pointer pointer; Chris@16: typedef typename boost::container::allocator_traits::const_pointer const_pointer; Chris@16: typedef typename boost::container::allocator_traits::reference reference; Chris@16: typedef typename boost::container::allocator_traits::const_reference const_reference; Chris@16: typedef typename boost::container::allocator_traits::size_type size_type; Chris@16: typedef typename boost::container::allocator_traits::difference_type difference_type; Chris@16: typedef Allocator allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type; Chris@16: typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare; Chris@16: typedef Compare key_compare; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator; Chris@16: typedef std::pair nonconst_value_type; Chris@16: typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl) movable_value_type; Chris@16: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // construct/copy/destroy Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@16: //! Effects: Default constructs an empty multimap. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: multimap() Chris@101: : base_t() Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty multimap using the specified allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit multimap(const Compare& comp, const allocator_type& a = allocator_type()) Chris@101: : base_t(comp, a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty multimap using the specified comparison Chris@16: //! object and allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit multimap(const allocator_type& a) Chris@101: : base_t(a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty multimap using the specified comparison object Chris@16: //! and allocator, and inserts elements from the range [first ,last ). Chris@16: //! Chris@16: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@16: //! comp and otherwise N logN, where N is last - first. Chris@16: template Chris@16: multimap(InputIterator first, InputIterator last, Chris@16: const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(false, first, last, comp, a) Chris@16: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty multimap using the specified Chris@101: //! allocator, and inserts elements from the range [first ,last ). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is last - first. Chris@101: template Chris@101: multimap(InputIterator first, InputIterator last, const allocator_type& a) Chris@101: : base_t(false, first, last, Compare(), a) Chris@101: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Constructs an empty multimap using the specified comparison object and Chris@16: //! allocator, and inserts elements from the ordered range [first ,last). This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Requires: [first ,last) must be ordered according to the predicate. Chris@16: //! Chris@16: //! Complexity: Linear in N. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@16: template Chris@16: multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, first, last, comp, a) Chris@16: {} Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Constructs an empty multimap using the specified comparison object and Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.first() - il.end(). Chris@101: multimap(std::initializer_list il, const Compare& comp = Compare(), Chris@101: const allocator_type& a = allocator_type()) Chris@101: : base_t(false, il.begin(), il.end(), comp, a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty multimap using the specified Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.first() - il.end(). Chris@101: multimap(std::initializer_list il, const allocator_type& a) Chris@101: : base_t(false, il.begin(), il.end(), Compare(), a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: Chris@101: //! Effects: Constructs an empty set using the specified comparison object and Chris@101: //! allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function Chris@101: //! is more efficient than the normal range creation for ordered ranges. Chris@101: //! Chris@101: //! Requires: [il.begin(), il.end()) must be ordered according to the predicate. Chris@101: //! Chris@101: //! Complexity: Linear in N. Chris@101: //! Chris@101: //! Note: Non-standard extension. Chris@101: multimap(ordered_range_t, std::initializer_list il, const Compare& comp = Compare(), Chris@101: const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, il.begin(), il.end(), comp, a) Chris@101: { Chris@101: //A type must be std::pair Chris@101: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@101: } Chris@101: #endif Chris@101: Chris@16: //! Effects: Copy constructs a multimap. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: multimap(const multimap& x) Chris@101: : base_t(static_cast(x)) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Move constructs a multimap. Constructs *this using x's resources. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Postcondition: x is emptied. Chris@16: multimap(BOOST_RV_REF(multimap) x) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x)) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Copy constructs a multimap. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: multimap(const multimap& x, const allocator_type &a) Chris@101: : base_t(static_cast(x), a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Move constructs a multimap using the specified allocator. Chris@16: //! Constructs *this using x's resources. Chris@16: //! Complexity: Constant if a == x.get_allocator(), linear otherwise. Chris@16: //! Chris@16: //! Postcondition: x is emptied. Chris@16: multimap(BOOST_RV_REF(multimap) x, const allocator_type &a) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x), a) Chris@16: { Chris@101: //A type must be std::pair Chris@16: BOOST_STATIC_ASSERT((container_detail::is_same, typename Allocator::value_type>::value)); Chris@16: } Chris@16: Chris@16: //! Effects: Makes *this a copy of x. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: multimap& operator=(BOOST_COPY_ASSIGN_REF(multimap) x) Chris@101: { return static_cast(this->base_t::operator=(static_cast(x))); } Chris@16: Chris@16: //! Effects: this->swap(x.get()). Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: multimap& operator=(BOOST_RV_REF(multimap) x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_move_assignable::value ) Chris@101: { return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Assign content of il to *this. Chris@16: //! Chris@101: multimap& operator=(std::initializer_list il) Chris@101: { Chris@101: this->clear(); Chris@101: insert(il.begin(), il.end()); Chris@101: return *this; Chris@101: } Chris@101: #endif Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@101: //! @copydoc ::boost::container::set::get_allocator() Chris@101: allocator_type get_allocator() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::get_stored_allocator() Chris@101: stored_allocator_type &get_stored_allocator(); Chris@16: Chris@101: //! @copydoc ::boost::container::set::get_stored_allocator() const Chris@101: const stored_allocator_type &get_stored_allocator() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::begin() Chris@101: iterator begin(); Chris@16: Chris@101: //! @copydoc ::boost::container::set::begin() const Chris@101: const_iterator begin() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::cbegin() const Chris@101: const_iterator cbegin() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::end() Chris@101: iterator end() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::end() const Chris@101: const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::cend() const Chris@101: const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::rbegin() Chris@101: reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::rbegin() const Chris@101: const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::crbegin() const Chris@101: const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::rend() Chris@101: reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::rend() const Chris@101: const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::crend() const Chris@101: const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::empty() const Chris@101: bool empty() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::size() const Chris@101: size_type size() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::max_size() const Chris@101: size_type max_size() const; Chris@16: Chris@101: #endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Effects: Inserts an object of type T constructed with Chris@16: //! std::forward(args)... in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@16: template Chris@101: iterator emplace(BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_equal(boost::forward(args)...); } Chris@16: Chris@16: //! Effects: Inserts an object of type T constructed with Chris@16: //! std::forward(args)... in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@16: template Chris@101: iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_hint_equal(p, boost::forward(args)...); } Chris@16: Chris@101: #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@101: #define BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE(N) \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace(BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_equal(BOOST_MOVE_FWD##N); }\ Chris@101: \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\ Chris@101: // Chris@101: BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE) Chris@101: #undef BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE Chris@16: Chris@101: #endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@16: //! Effects: Inserts x and returns the iterator pointing to the Chris@16: //! newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: iterator insert(const value_type& x) Chris@101: { return this->base_t::insert_equal(x); } Chris@16: Chris@16: //! Effects: Inserts a new value constructed from x and returns Chris@16: //! the iterator pointing to the newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: iterator insert(const nonconst_value_type& x) Chris@101: { return this->base_t::insert_equal(x); } Chris@16: Chris@16: //! Effects: Inserts a new value move-constructed from x and returns Chris@16: //! the iterator pointing to the newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: iterator insert(BOOST_RV_REF(nonconst_value_type) x) Chris@101: { return this->base_t::insert_equal(boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a new value move-constructed from x and returns Chris@16: //! the iterator pointing to the newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@16: iterator insert(BOOST_RV_REF(movable_value_type) x) Chris@101: { return this->base_t::insert_equal(boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a copy of x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, const value_type& x) Chris@101: { return this->base_t::insert_equal(p, x); } Chris@16: Chris@16: //! Effects: Inserts a new value constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, const nonconst_value_type& x) Chris@101: { return this->base_t::insert_equal(p, x); } Chris@16: Chris@16: //! Effects: Inserts a new value move constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, BOOST_RV_REF(nonconst_value_type) x) Chris@101: { return this->base_t::insert_equal(p, boost::move(x)); } Chris@16: Chris@16: //! Effects: Inserts a new value move constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic in general, but amortized constant if t Chris@16: //! is inserted right before p. Chris@101: iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x) Chris@101: { return this->base_t::insert_equal(p, boost::move(x)); } Chris@16: Chris@16: //! Requires: first, last are not iterators into *this. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) . Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: template Chris@16: void insert(InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_equal(first, last); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end(). Chris@16: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) Chris@101: void insert(std::initializer_list il) Chris@101: { this->base_t::insert_equal(il.begin(), il.end()); } Chris@101: #endif Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@101: //! @copydoc ::boost::container::set::erase(const_iterator) Chris@101: iterator erase(const_iterator p); Chris@16: Chris@101: //! @copydoc ::boost::container::set::erase(const key_type&) Chris@101: size_type erase(const key_type& x); Chris@16: Chris@101: //! @copydoc ::boost::container::set::erase(const_iterator,const_iterator) Chris@101: iterator erase(const_iterator first, const_iterator last); Chris@16: Chris@101: //! @copydoc ::boost::container::set::swap Chris@101: void swap(multiset& x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_swappable::value ); Chris@16: Chris@101: //! @copydoc ::boost::container::set::clear Chris@101: void clear() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::set::key_comp Chris@101: key_compare key_comp() const; Chris@16: Chris@101: //! @copydoc ::boost::container::set::value_comp Chris@101: value_compare value_comp() const; Chris@16: Chris@16: //! Returns: An iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: iterator find(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: const_iterator find(const key_type& x) const; Chris@16: Chris@16: //! Returns: The number of elements with key equivalent to x. Chris@16: //! Chris@16: //! Complexity: log(size())+count(k) Chris@101: size_type count(const key_type& x) const; Chris@16: Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator lower_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator lower_bound(const key_type& x) const; Chris@16: Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator upper_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator upper_bound(const key_type& x) const; Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: std::pair equal_range(const key_type& x); Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: std::pair equal_range(const key_type& x) const; Chris@16: Chris@101: //! Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees. Chris@101: //! Chris@101: //! Complexity: Linear Chris@101: void rebalance(); Chris@16: Chris@101: //! Effects: Returns true if x and y are equal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator==(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: Returns true if x and y are unequal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator!=(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: Returns true if x is less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: Returns true if x is greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<=(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>=(const multimap& x, const multimap& y); Chris@101: Chris@101: //! Effects: x.swap(y) Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: friend void swap(multimap& x, multimap& y); Chris@101: Chris@101: #endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: }; Chris@16: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: } //namespace container { Chris@16: Chris@16: //!has_trivial_destructor_after_move<> == true_type Chris@16: //!specialization for optimizations Chris@101: template Chris@101: struct has_trivial_destructor_after_move > Chris@16: { Chris@101: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@101: static const bool value = ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value; Chris@16: }; Chris@16: Chris@16: namespace container { Chris@16: Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: }} Chris@16: Chris@16: #include Chris@16: Chris@101: #endif // BOOST_CONTAINER_MAP_HPP Chris@16: