diff options
Diffstat (limited to 'boost/container/flat_map.hpp')
-rw-r--r-- | boost/container/flat_map.hpp | 1342 |
1 files changed, 826 insertions, 516 deletions
diff --git a/boost/container/flat_map.hpp b/boost/container/flat_map.hpp index 0142500860..e7ff31a30b 100644 --- a/boost/container/flat_map.hpp +++ b/boost/container/flat_map.hpp @@ -1,6 +1,6 @@ ////////////////////////////////////////////////////////////////////////////// // -// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost +// (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) // @@ -11,7 +11,7 @@ #ifndef BOOST_CONTAINER_FLAT_MAP_HPP #define BOOST_CONTAINER_FLAT_MAP_HPP -#if (defined _MSC_VER) && (_MSC_VER >= 1200) +#if defined(_MSC_VER) # pragma once #endif @@ -22,37 +22,24 @@ #include <utility> #include <functional> #include <memory> -#include <stdexcept> #include <boost/container/detail/flat_tree.hpp> #include <boost/type_traits/has_trivial_destructor.hpp> #include <boost/container/detail/mpl.hpp> #include <boost/container/allocator_traits.hpp> -#include <boost/move/move.hpp> +#include <boost/container/throw_exception.hpp> +#include <boost/move/utility_core.hpp> +#include <boost/move/detail/move_helpers.hpp> +#include <boost/move/traits.hpp> +#include <boost/core/no_exceptions_support.hpp> + +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) +#include <initializer_list> +#endif -#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED -namespace boost { -namespace container { -#else namespace boost { namespace container { -#endif - -/// @cond -// Forward declarations of operators == and <, needed for friend declarations. -#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED -template <class Key, class T, class Pred = std::less< std::pair< Key, T> >, class A = std::allocator<T> > -#else -template <class Key, class T, class Pred, class A> -#endif -class flat_map; -template <class Key, class T, class Pred, class A> -inline bool operator==(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y); - -template <class Key, class T, class Pred, class A> -inline bool operator<(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y); +#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED namespace container_detail{ @@ -69,8 +56,7 @@ static D force_copy(S s) } //namespace container_detail{ - -/// @endcond +#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED //! A flat_map is a kind of associative container that supports unique keys (contains at //! most one of each key value) and provides for fast retrieval of values of another @@ -82,109 +68,132 @@ static D force_copy(S s) //! flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T> //! (unlike std::map<Key, T> which value_type is std::pair<<b>const</b> Key, T>). //! -//! Pred is the ordering function for Keys (e.g. <i>std::less<Key></i>). +//! Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>). //! -//! A is the allocator to allocate the value_types +//! Allocator is the allocator to allocate the value_types //! (e.g. <i>allocator< std::pair<Key, T> ></i>). //! //! flat_map is similar to std::map but it's implemented like an ordered vector. //! This means that inserting a new element into a flat_map invalidates //! previous iterators and references //! -//! Erasing an element of a flat_map invalidates iterators and references +//! Erasing an element invalidates iterators and references //! pointing to elements that come after (their keys are bigger) the erased element. +//! +//! This container provides random-access iterators. +//! +//! \tparam Key is the key_type of the map +//! \tparam Value is the <code>mapped_type</code> +//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>). +//! \tparam Allocator is the allocator to allocate the <code>value_type</code>s +//! (e.g. <i>allocator< std::pair<Key, T> > </i>). #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED -template <class Key, class T, class Pred = std::less< std::pair< Key, T> >, class A = std::allocator<T> > +template <class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator< std::pair< Key, T> > > #else -template <class Key, class T, class Pred, class A> +template <class Key, class T, class Compare, class Allocator> #endif class flat_map { - /// @cond + #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED private: BOOST_COPYABLE_AND_MOVABLE(flat_map) //This is the tree that we should store if pair was movable typedef container_detail::flat_tree<Key, std::pair<Key, T>, container_detail::select1st< std::pair<Key, T> >, - Pred, - A> tree_t; + Compare, + Allocator> tree_t; //This is the real tree stored here. It's based on a movable pair typedef container_detail::flat_tree<Key, container_detail::pair<Key, T>, container_detail::select1st<container_detail::pair<Key, T> >, - Pred, - typename allocator_traits<A>::template portable_rebind_alloc + Compare, + typename allocator_traits<Allocator>::template portable_rebind_alloc <container_detail::pair<Key, T> >::type> impl_tree_t; impl_tree_t m_flat_tree; // flat tree representing flat_map typedef typename impl_tree_t::value_type impl_value_type; - typedef typename impl_tree_t::pointer impl_pointer; - typedef typename impl_tree_t::const_pointer impl_const_pointer; - typedef typename impl_tree_t::reference impl_reference; - typedef typename impl_tree_t::const_reference impl_const_reference; - typedef typename impl_tree_t::value_compare impl_value_compare; - typedef typename impl_tree_t::iterator impl_iterator; typedef typename impl_tree_t::const_iterator impl_const_iterator; - typedef typename impl_tree_t::reverse_iterator impl_reverse_iterator; - typedef typename impl_tree_t::const_reverse_iterator impl_const_reverse_iterator; typedef typename impl_tree_t::allocator_type impl_allocator_type; - typedef allocator_traits<A> allocator_traits_type; - - - - /// @endcond + typedef container_detail::flat_tree_value_compare + < Compare + , container_detail::select1st< std::pair<Key, T> > + , std::pair<Key, T> > value_compare_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::iterator iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::const_iterator const_iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::reverse_iterator reverse_iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::const_reverse_iterator const_reverse_iterator_impl; + #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED public: - // typedefs: - typedef Key key_type; - typedef T mapped_type; - typedef typename std::pair<key_type, mapped_type> value_type; - typedef typename allocator_traits_type::pointer pointer; - typedef typename allocator_traits_type::const_pointer const_pointer; - typedef typename allocator_traits_type::reference reference; - typedef typename allocator_traits_type::const_reference const_reference; - typedef typename impl_tree_t::size_type size_type; - typedef typename impl_tree_t::difference_type difference_type; - - typedef container_detail::flat_tree_value_compare - < Pred - , container_detail::select1st< std::pair<Key, T> > - , std::pair<Key, T> > value_compare; - typedef Pred key_compare; - typedef typename container_detail:: - get_flat_tree_iterators<pointer>::iterator iterator; - typedef typename container_detail:: - get_flat_tree_iterators<pointer>::const_iterator const_iterator; - typedef typename container_detail:: - get_flat_tree_iterators - <pointer>::reverse_iterator reverse_iterator; - typedef typename container_detail:: - get_flat_tree_iterators - <pointer>::const_reverse_iterator const_reverse_iterator; - typedef A allocator_type; - - //!Standard extension - typedef A stored_allocator_type; - - //!Standard extension for C++03 compilers with non-movable std::pair - typedef impl_value_type movable_value_type; + ////////////////////////////////////////////// + // + // types + // + ////////////////////////////////////////////// + typedef Key key_type; + typedef T mapped_type; + typedef std::pair<Key, T> value_type; + typedef ::boost::container::allocator_traits<Allocator> allocator_traits_type; + typedef typename boost::container::allocator_traits<Allocator>::pointer pointer; + typedef typename boost::container::allocator_traits<Allocator>::const_pointer const_pointer; + typedef typename boost::container::allocator_traits<Allocator>::reference reference; + typedef typename boost::container::allocator_traits<Allocator>::const_reference const_reference; + typedef typename boost::container::allocator_traits<Allocator>::size_type size_type; + typedef typename boost::container::allocator_traits<Allocator>::difference_type difference_type; + typedef Allocator allocator_type; + typedef BOOST_CONTAINER_IMPDEF(Allocator) stored_allocator_type; + typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare; + typedef Compare key_compare; + typedef BOOST_CONTAINER_IMPDEF(iterator_impl) iterator; + typedef BOOST_CONTAINER_IMPDEF(const_iterator_impl) const_iterator; + typedef BOOST_CONTAINER_IMPDEF(reverse_iterator_impl) reverse_iterator; + typedef BOOST_CONTAINER_IMPDEF(const_reverse_iterator_impl) const_reverse_iterator; + typedef BOOST_CONTAINER_IMPDEF(impl_value_type) movable_value_type; public: + ////////////////////////////////////////////// + // + // construct/copy/destroy + // + ////////////////////////////////////////////// + //! <b>Effects</b>: Default constructs an empty flat_map. //! //! <b>Complexity</b>: Constant. flat_map() - : m_flat_tree() {} + : m_flat_tree() + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_map using the specified //! comparison object and allocator. //! //! <b>Complexity</b>: Constant. - explicit flat_map(const Pred& comp, const allocator_type& a = allocator_type()) - : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) {} + explicit flat_map(const Compare& comp, const allocator_type& a = allocator_type()) + : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + + //! <b>Effects</b>: Constructs an empty flat_map using the specified allocator. + //! + //! <b>Complexity</b>: Constant. + explicit flat_map(const allocator_type& a) + : m_flat_tree(container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and //! allocator, and inserts elements from the range [first ,last ). @@ -192,10 +201,13 @@ class flat_map //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using //! comp and otherwise N logN, where N is last - first. template <class InputIterator> - flat_map(InputIterator first, InputIterator last, const Pred& comp = Pred(), + flat_map(InputIterator first, InputIterator last, const Compare& comp = Compare(), const allocator_type& a = allocator_type()) - : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) - { m_flat_tree.insert_unique(first, last); } + : m_flat_tree(true, first, last, comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and //! allocator, and inserts elements from the ordered unique range [first ,last). This function @@ -209,15 +221,55 @@ class flat_map //! <b>Note</b>: Non-standard extension. template <class InputIterator> flat_map( ordered_unique_range_t, InputIterator first, InputIterator last - , const Pred& comp = Pred(), const allocator_type& a = allocator_type()) + , const Compare& comp = Compare(), const allocator_type& a = allocator_type()) : m_flat_tree(ordered_range, first, last, comp, a) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and + //! allocator, and inserts elements from the range [il.begin() ,il.end()). + //! + //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using + //! comp and otherwise N logN, where N is last - first. + flat_map(std::initializer_list<value_type> il, const Compare& comp = Compare(), + const allocator_type& a = allocator_type()) + : m_flat_tree(true, il.begin(), il.end(), comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + + //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and + //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function + //! is more efficient than the normal range creation for ordered ranges. + //! + //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be + //! unique values. + //! + //! <b>Complexity</b>: Linear in N. + //! + //! <b>Note</b>: Non-standard extension. + flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp = Compare(), + const allocator_type& a = allocator_type()) + : m_flat_tree(ordered_range, il.begin(), il.end(), comp, a) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } +#endif //! <b>Effects</b>: Copy constructs a flat_map. //! //! <b>Complexity</b>: Linear in x.size(). flat_map(const flat_map& x) - : m_flat_tree(x.m_flat_tree) {} + : m_flat_tree(x.m_flat_tree) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Move constructs a flat_map. //! Constructs *this using x's resources. @@ -227,14 +279,20 @@ class flat_map //! <b>Postcondition</b>: x is emptied. flat_map(BOOST_RV_REF(flat_map) x) : m_flat_tree(boost::move(x.m_flat_tree)) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Copy constructs a flat_map using the specified allocator. //! //! <b>Complexity</b>: Linear in x.size(). flat_map(const flat_map& x, const allocator_type &a) : m_flat_tree(x.m_flat_tree, a) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Move constructs a flat_map using the specified allocator. //! Constructs *this using x's resources. @@ -242,7 +300,10 @@ class flat_map //! <b>Complexity</b>: Constant if x.get_allocator() == a, linear otherwise. flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a) : m_flat_tree(boost::move(x.m_flat_tree), a) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Makes *this a copy of x. //! @@ -253,45 +314,65 @@ class flat_map //! <b>Effects</b>: Move constructs a flat_map. //! Constructs *this using x's resources. //! - //! <b>Complexity</b>: Construct. + //! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment + //! is false and (allocation throws or value_type's move constructor throws) //! - //! <b>Postcondition</b>: x is emptied. - flat_map& operator=(BOOST_RV_REF(flat_map) mx) - { m_flat_tree = boost::move(mx.m_flat_tree); return *this; } + //! <b>Complexity</b>: Constant if allocator_traits_type:: + //! propagate_on_container_move_assignment is true or + //! this->get>allocator() == x.get_allocator(). Linear otherwise. + flat_map& operator=(BOOST_RV_REF(flat_map) x) + BOOST_CONTAINER_NOEXCEPT_IF(allocator_traits_type::propagate_on_container_move_assignment::value) + { m_flat_tree = boost::move(x.m_flat_tree); return *this; } - //! <b>Effects</b>: Returns the comparison object out - //! of which a was constructed. - //! - //! <b>Complexity</b>: Constant. - key_compare key_comp() const - { return container_detail::force_copy<key_compare>(m_flat_tree.key_comp()); } - - //! <b>Effects</b>: Returns an object of value_compare constructed out - //! of the comparison object. - //! - //! <b>Complexity</b>: Constant. - value_compare value_comp() const - { return value_compare(container_detail::force_copy<key_compare>(m_flat_tree.key_comp())); } +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: Assign elements from il to *this + flat_map& operator=(std::initializer_list<value_type> il) + { + this->clear(); + this->insert(il.begin(), il.end()); + return *this; + } +#endif //! <b>Effects</b>: Returns a copy of the Allocator that //! was passed to the object's constructor. //! //! <b>Complexity</b>: Constant. - allocator_type get_allocator() const + allocator_type get_allocator() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<allocator_type>(m_flat_tree.get_allocator()); } - const stored_allocator_type &get_stored_allocator() const + //! <b>Effects</b>: Returns a reference to the internal allocator. + //! + //! <b>Throws</b>: Nothing + //! + //! <b>Complexity</b>: Constant. + //! + //! <b>Note</b>: Non-standard extension. + stored_allocator_type &get_stored_allocator() BOOST_CONTAINER_NOEXCEPT { return container_detail::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); } - stored_allocator_type &get_stored_allocator() + //! <b>Effects</b>: Returns a reference to the internal allocator. + //! + //! <b>Throws</b>: Nothing + //! + //! <b>Complexity</b>: Constant. + //! + //! <b>Note</b>: Non-standard extension. + const stored_allocator_type &get_stored_allocator() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); } + ////////////////////////////////////////////// + // + // iterators + // + ////////////////////////////////////////////// + //! <b>Effects</b>: Returns an iterator to the first element contained in the container. //! //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - iterator begin() + iterator begin() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<iterator>(m_flat_tree.begin()); } //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container. @@ -299,7 +380,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator begin() const + const_iterator begin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.begin()); } //! <b>Effects</b>: Returns an iterator to the end of the container. @@ -307,7 +388,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - iterator end() + iterator end() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<iterator>(m_flat_tree.end()); } //! <b>Effects</b>: Returns a const_iterator to the end of the container. @@ -315,7 +396,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator end() const + const_iterator end() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.end()); } //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning @@ -324,7 +405,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - reverse_iterator rbegin() + reverse_iterator rbegin() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<reverse_iterator>(m_flat_tree.rbegin()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning @@ -333,7 +414,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator rbegin() const + const_reverse_iterator rbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); } //! <b>Effects</b>: Returns a reverse_iterator pointing to the end @@ -342,7 +423,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - reverse_iterator rend() + reverse_iterator rend() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<reverse_iterator>(m_flat_tree.rend()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end @@ -351,7 +432,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator rend() const + const_reverse_iterator rend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.rend()); } //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container. @@ -359,7 +440,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator cbegin() const + const_iterator cbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.cbegin()); } //! <b>Effects</b>: Returns a const_iterator to the end of the container. @@ -367,7 +448,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator cend() const + const_iterator cend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.cend()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning @@ -376,7 +457,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator crbegin() const + const_reverse_iterator crbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end @@ -385,15 +466,21 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator crend() const + const_reverse_iterator crend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crend()); } + ////////////////////////////////////////////// + // + // capacity + // + ////////////////////////////////////////////// + //! <b>Effects</b>: Returns true if the container contains no elements. //! //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - bool empty() const + bool empty() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.empty(); } //! <b>Effects</b>: Returns the number of the elements contained in the container. @@ -401,7 +488,7 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - size_type size() const + size_type size() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.size(); } //! <b>Effects</b>: Returns the largest possible size of the container. @@ -409,14 +496,50 @@ class flat_map //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - size_type max_size() const + size_type max_size() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.max_size(); } + //! <b>Effects</b>: Number of elements for which memory has been allocated. + //! capacity() is always greater than or equal to size(). + //! + //! <b>Throws</b>: Nothing. + //! + //! <b>Complexity</b>: Constant. + size_type capacity() const BOOST_CONTAINER_NOEXCEPT + { return m_flat_tree.capacity(); } + + //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no + //! effect. Otherwise, it is a request for allocation of additional memory. + //! If the request is successful, then capacity() is greater than or equal to + //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged. + //! + //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws. + //! + //! <b>Note</b>: If capacity() is less than "cnt", iterators and references to + //! to values might be invalidated. + void reserve(size_type cnt) + { m_flat_tree.reserve(cnt); } + + //! <b>Effects</b>: Tries to deallocate the excess of memory created + // with previous allocations. The size of the vector is unchanged + //! + //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws. + //! + //! <b>Complexity</b>: Linear to size(). + void shrink_to_fit() + { m_flat_tree.shrink_to_fit(); } + + ////////////////////////////////////////////// + // + // element access + // + ////////////////////////////////////////////// + #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) //! Effects: If there is no key equivalent to x in the flat_map, inserts //! value_type(x, T()) into the flat_map. //! - //! Returns: A reference to the mapped_type corresponding to x in *this. + //! Returns: Allocator reference to the mapped_type corresponding to x in *this. //! //! Complexity: Logarithmic. mapped_type &operator[](const key_type& k); @@ -424,46 +547,106 @@ class flat_map //! Effects: If there is no key equivalent to x in the flat_map, inserts //! value_type(move(x), T()) into the flat_map (the key is move-constructed) //! - //! Returns: A reference to the mapped_type corresponding to x in *this. + //! Returns: Allocator reference to the mapped_type corresponding to x in *this. //! //! Complexity: Logarithmic. mapped_type &operator[](key_type &&k) ; #else - BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, priv_subscript) + BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript) #endif - //! Returns: A reference to the element whose key is equivalent to x. + //! Returns: Allocator 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 std::out_of_range("key not found"); + throw_out_of_range("flat_map::at key not found"); } return i->second; } - //! Returns: A reference to the element whose key is equivalent to x. + //! Returns: Allocator 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 std::out_of_range("key not found"); + throw_out_of_range("flat_map::at key not found"); } return i->second; } - //! <b>Effects</b>: Swaps the contents of *this and x. + ////////////////////////////////////////////// + // + // modifiers + // + ////////////////////////////////////////////// + + #if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) + + //! <b>Effects</b>: Inserts an object x of type T constructed with + //! std::forward<Args>(args)... if and only if there is no element in the container + //! with key equivalent to the key of x. //! - //! <b>Throws</b>: Nothing. + //! <b>Returns</b>: The bool component of the returned pair is true if and only + //! if the insertion takes place, and the iterator component of the pair + //! points to the element with key equivalent to the key of x. //! - //! <b>Complexity</b>: Constant. - void swap(flat_map& x) - { m_flat_tree.swap(x.m_flat_tree); } + //! <b>Complexity</b>: Logarithmic search time plus linear insertion + //! to the elements with bigger keys than x. + //! + //! <b>Note</b>: If an element is inserted it might invalidate elements. + template <class... Args> + std::pair<iterator,bool> emplace(Args&&... args) + { return container_detail::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); } + + //! <b>Effects</b>: Inserts an object of type T constructed with + //! std::forward<Args>(args)... in the container if and only if there is + //! no element in the container with key equivalent to the key of x. + //! p is a hint pointing to where the insert should start to search. + //! + //! <b>Returns</b>: An iterator pointing to the element with key equivalent + //! to the key of x. + //! + //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted + //! right before p) plus insertion linear to the elements with bigger keys than x. + //! + //! <b>Note</b>: If an element is inserted it might invalidate elements. + template <class... Args> + iterator emplace_hint(const_iterator hint, Args&&... args) + { + return container_detail::force_copy<iterator> + (m_flat_tree.emplace_hint_unique( container_detail::force_copy<impl_const_iterator>(hint) + , boost::forward<Args>(args)...)); + } + + #else //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING + + #define BOOST_PP_LOCAL_MACRO(n) \ + BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ + std::pair<iterator,bool> emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ + { return container_detail::force_copy< std::pair<iterator, bool> > \ + (m_flat_tree.emplace_unique(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ + \ + BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ + iterator emplace_hint(const_iterator hint \ + BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ + { return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_unique \ + (container_detail::force_copy<impl_const_iterator>(hint) \ + BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ + //! + #define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS) + #include BOOST_PP_LOCAL_ITERATE() + + #endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING //! <b>Effects</b>: Inserts x if and only if there is no element in the container //! with key equivalent to the key of x. @@ -523,10 +706,10 @@ class flat_map //! right before p) plus insertion linear to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, const value_type& x) + iterator insert(const_iterator p, const value_type& x) { return container_detail::force_copy<iterator>( - m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(position) + m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(p) , container_detail::force<impl_value_type>(x))); } @@ -539,10 +722,10 @@ class flat_map //! right before p) plus insertion linear to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, BOOST_RV_REF(value_type) x) + iterator insert(const_iterator p, BOOST_RV_REF(value_type) x) { return container_detail::force_copy<iterator> - (m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(position) + (m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(p) , boost::move(container_detail::force<impl_value_type>(x)))); } @@ -555,10 +738,10 @@ class flat_map //! right before p) plus insertion linear to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, BOOST_RV_REF(movable_value_type) x) + iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x) { return container_detail::force_copy<iterator>( - m_flat_tree.insert_unique(container_detail::force_copy<impl_const_iterator>(position), boost::move(x))); + m_flat_tree.insert_unique(container_detail::force_copy<impl_const_iterator>(p), boost::move(x))); } //! <b>Requires</b>: first, last are not iterators into *this. @@ -587,82 +770,54 @@ class flat_map //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. + //! + //! <b>Note</b>: Non-standard extension. template <class InputIterator> void insert(ordered_unique_range_t, InputIterator first, InputIterator last) { m_flat_tree.insert_unique(ordered_unique_range, first, last); } - #if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) - - //! <b>Effects</b>: Inserts an object x of type T constructed with - //! std::forward<Args>(args)... if and only if there is no element in the container - //! with key equivalent to the key of x. - //! - //! <b>Returns</b>: The bool component of the returned pair is true if and only - //! if the insertion takes place, and the iterator component of the pair - //! points to the element with key equivalent to the key of x. +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: 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. //! - //! <b>Complexity</b>: Logarithmic search time plus linear insertion - //! to the elements with bigger keys than x. + //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from il.first() to il.end()) + //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - template <class... Args> - std::pair<iterator,bool> emplace(Args&&... args) - { return container_detail::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); } + void insert(std::initializer_list<value_type> il) + { m_flat_tree.insert_unique(il.begin(), il.end()); } - //! <b>Effects</b>: Inserts an object of type T constructed with - //! std::forward<Args>(args)... in the container if and only if there is - //! no element in the container with key equivalent to the key of x. - //! p is a hint pointing to where the insert should start to search. + //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be + //! unique values. //! - //! <b>Returns</b>: An iterator pointing to the element with key equivalent - //! to the key of x. + //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only + //! if there is no element with key equivalent to the key of that element. This + //! function is more efficient than the normal range creation for ordered ranges. //! - //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted - //! right before p) plus insertion linear to the elements with bigger keys than x. + //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from first to last) + //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - template <class... Args> - iterator emplace_hint(const_iterator hint, Args&&... args) - { - return container_detail::force_copy<iterator> - (m_flat_tree.emplace_hint_unique( container_detail::force_copy<impl_const_iterator>(hint) - , boost::forward<Args>(args)...)); - } - - #else //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING - - #define BOOST_PP_LOCAL_MACRO(n) \ - BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ - std::pair<iterator,bool> emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ - { return container_detail::force_copy< std::pair<iterator, bool> > \ - (m_flat_tree.emplace_unique(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ - \ - BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ - iterator emplace_hint(const_iterator hint \ - BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ - { return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_unique \ - (container_detail::force_copy<impl_const_iterator>(hint) \ - BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ //! - #define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS) - #include BOOST_PP_LOCAL_ITERATE() - - #endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING + //! <b>Note</b>: Non-standard extension. + void insert(ordered_unique_range_t, std::initializer_list<value_type> il) + { m_flat_tree.insert_unique(ordered_unique_range, il.begin(), il.end()); } +#endif - //! <b>Effects</b>: Erases the element pointed to by position. + //! <b>Effects</b>: Erases the element pointed to by p. //! //! <b>Returns</b>: Returns an iterator pointing to the element immediately //! following q prior to the element being erased. If no such element exists, //! returns end(). //! - //! <b>Complexity</b>: Linear to the elements with keys bigger than position + //! <b>Complexity</b>: Linear to the elements with keys bigger than p //! //! <b>Note</b>: Invalidates elements with keys //! not less than the erased element. - iterator erase(const_iterator position) + iterator erase(const_iterator p) { return container_detail::force_copy<iterator> - (m_flat_tree.erase(container_detail::force_copy<impl_const_iterator>(position))); + (m_flat_tree.erase(container_detail::force_copy<impl_const_iterator>(p))); } //! <b>Effects</b>: Erases all elements in the container with key equivalent to x. @@ -689,22 +844,47 @@ class flat_map , container_detail::force_copy<impl_const_iterator>(last))); } + //! <b>Effects</b>: Swaps the contents of *this and x. + //! + //! <b>Throws</b>: Nothing. + //! + //! <b>Complexity</b>: Constant. + void swap(flat_map& x) + { m_flat_tree.swap(x.m_flat_tree); } + //! <b>Effects</b>: erase(a.begin(),a.end()). //! //! <b>Postcondition</b>: size() == 0. //! //! <b>Complexity</b>: linear in size(). - void clear() + void clear() BOOST_CONTAINER_NOEXCEPT { m_flat_tree.clear(); } - //! <b>Effects</b>: Tries to deallocate the excess of memory created - // with previous allocations. The size of the vector is unchanged + ////////////////////////////////////////////// + // + // observers + // + ////////////////////////////////////////////// + + //! <b>Effects</b>: Returns the comparison object out + //! of which a was constructed. //! - //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws. + //! <b>Complexity</b>: Constant. + key_compare key_comp() const + { return container_detail::force_copy<key_compare>(m_flat_tree.key_comp()); } + + //! <b>Effects</b>: Returns an object of value_compare constructed out + //! of the comparison object. //! - //! <b>Complexity</b>: Linear to size(). - void shrink_to_fit() - { m_flat_tree.shrink_to_fit(); } + //! <b>Complexity</b>: Constant. + value_compare value_comp() const + { return value_compare(container_detail::force_copy<key_compare>(m_flat_tree.key_comp())); } + + ////////////////////////////////////////////// + // + // map operations + // + ////////////////////////////////////////////// //! <b>Returns</b>: An iterator pointing to an element with the key //! equivalent to x, or end() if such an element is not found. @@ -713,7 +893,7 @@ class flat_map iterator find(const key_type& x) { return container_detail::force_copy<iterator>(m_flat_tree.find(x)); } - //! <b>Returns</b>: A const_iterator pointing to an element with the key + //! <b>Returns</b>: Allocator const_iterator pointing to an element with the key //! equivalent to x, or end() if such an element is not found. //! //! <b>Complexity</b>: Logarithmic.s @@ -724,7 +904,7 @@ class flat_map //! //! <b>Complexity</b>: log(size())+count(k) size_type count(const key_type& x) const - { return m_flat_tree.find(x) == m_flat_tree.end() ? 0 : 1; } + { return static_cast<size_type>(m_flat_tree.find(x) != m_flat_tree.end()); } //! <b>Returns</b>: An iterator pointing to the first element with key not less //! than k, or a.end() if such an element is not found. @@ -733,7 +913,7 @@ class flat_map iterator lower_bound(const key_type& x) { return container_detail::force_copy<iterator>(m_flat_tree.lower_bound(x)); } - //! <b>Returns</b>: A const iterator pointing to the first element with key not + //! <b>Returns</b>: Allocator const iterator pointing to the first element with key not //! less than k, or a.end() if such an element is not found. //! //! <b>Complexity</b>: Logarithmic @@ -747,7 +927,7 @@ class flat_map iterator upper_bound(const key_type& x) { return container_detail::force_copy<iterator>(m_flat_tree.upper_bound(x)); } - //! <b>Returns</b>: A const iterator pointing to the first element with key not + //! <b>Returns</b>: Allocator const iterator pointing to the first element with key not //! less than x, or end() if such an element is not found. //! //! <b>Complexity</b>: Logarithmic @@ -758,43 +938,57 @@ class flat_map //! //! <b>Complexity</b>: Logarithmic std::pair<iterator,iterator> equal_range(const key_type& x) - { return container_detail::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); } + { return container_detail::force_copy<std::pair<iterator,iterator> >(m_flat_tree.lower_bound_range(x)); } //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). //! //! <b>Complexity</b>: Logarithmic std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const - { return container_detail::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); } + { return container_detail::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.lower_bound_range(x)); } - //! <b>Effects</b>: Number of elements for which memory has been allocated. - //! capacity() is always greater than or equal to size(). + //! <b>Effects</b>: Returns true if x and y are equal //! - //! <b>Throws</b>: Nothing. + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator==(const flat_map& x, const flat_map& y) + { return x.size() == y.size() && std::equal(x.begin(), x.end(), y.begin()); } + + //! <b>Effects</b>: Returns true if x and y are unequal //! - //! <b>Complexity</b>: Constant. - size_type capacity() const - { return m_flat_tree.capacity(); } + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator!=(const flat_map& x, const flat_map& y) + { return !(x == y); } - //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no - //! effect. Otherwise, it is a request for allocation of additional memory. - //! If the request is successful, then capacity() is greater than or equal to - //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged. + //! <b>Effects</b>: Returns true if x is less than y //! - //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws. + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator<(const flat_map& x, const flat_map& y) + { return std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); } + + //! <b>Effects</b>: Returns true if x is greater than y //! - //! <b>Note</b>: If capacity() is less than "count", iterators and references to - //! to values might be invalidated. - void reserve(size_type count) - { m_flat_tree.reserve(count); } + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator>(const flat_map& x, const flat_map& y) + { return y < x; } - /// @cond - template <class K1, class T1, class C1, class A1> - friend bool operator== (const flat_map<K1, T1, C1, A1>&, - const flat_map<K1, T1, C1, A1>&); - template <class K1, class T1, class C1, class A1> - friend bool operator< (const flat_map<K1, T1, C1, A1>&, - const flat_map<K1, T1, C1, A1>&); + //! <b>Effects</b>: Returns true if x is equal or less than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator<=(const flat_map& x, const flat_map& y) + { return !(y < x); } + //! <b>Effects</b>: Returns true if x is equal or greater than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator>=(const flat_map& x, const flat_map& y) + { return !(x < y); } + + //! <b>Effects</b>: x.swap(y) + //! + //! <b>Complexity</b>: Constant. + friend void swap(flat_map& x, flat_map& y) + { x.swap(y); } + + #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED private: mapped_type &priv_subscript(const key_type& k) { @@ -817,74 +1011,24 @@ class flat_map } return (*i).second; } - /// @endcond + #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED }; -template <class Key, class T, class Pred, class A> -inline bool operator==(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return x.m_flat_tree == y.m_flat_tree; } - -template <class Key, class T, class Pred, class A> -inline bool operator<(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return x.m_flat_tree < y.m_flat_tree; } - -template <class Key, class T, class Pred, class A> -inline bool operator!=(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return !(x == y); } - -template <class Key, class T, class Pred, class A> -inline bool operator>(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return y < x; } - -template <class Key, class T, class Pred, class A> -inline bool operator<=(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return !(y < x); } - -template <class Key, class T, class Pred, class A> -inline bool operator>=(const flat_map<Key,T,Pred,A>& x, - const flat_map<Key,T,Pred,A>& y) - { return !(x < y); } - -template <class Key, class T, class Pred, class A> -inline void swap(flat_map<Key,T,Pred,A>& x, - flat_map<Key,T,Pred,A>& y) - { x.swap(y); } - -/// @cond +#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED } //namespace container { -/* + //!has_trivial_destructor_after_move<> == true_type //!specialization for optimizations -template <class K, class T, class C, class A> -struct has_trivial_destructor_after_move<boost::container::flat_map<K, T, C, A> > +template <class K, class T, class C, class Allocator> +struct has_trivial_destructor_after_move<boost::container::flat_map<K, T, C, Allocator> > { - static const bool value = has_trivial_destructor<A>::value && has_trivial_destructor<C>::value; + static const bool value = has_trivial_destructor_after_move<Allocator>::value && has_trivial_destructor_after_move<C>::value; }; -*/ -namespace container { -// Forward declaration of operators < and ==, needed for friend declaration. -#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED -template <class Key, class T, class Pred = std::less< std::pair< Key, T> >, class A = std::allocator<T> > -#else -template <class Key, class T, class Pred, class A> -#endif -class flat_multimap; - -template <class Key, class T, class Pred, class A> -inline bool operator==(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y); +namespace container { -template <class Key, class T, class Pred, class A> -inline bool operator<(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y); -/// @endcond +#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED //! A flat_multimap is a kind of associative container that supports equivalent keys //! (possibly containing multiple copies of the same key value) and provides for @@ -896,96 +1040,130 @@ inline bool operator<(const flat_multimap<Key,T,Pred,A>& x, //! flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T> //! (unlike std::multimap<Key, T> which value_type is std::pair<<b>const</b> Key, T>). //! -//! Pred is the ordering function for Keys (e.g. <i>std::less<Key></i>). +//! Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>). //! -//! A is the allocator to allocate the value_types +//! Allocator is the allocator to allocate the value_types //! (e.g. <i>allocator< std::pair<Key, T> ></i>). +//! +//! flat_multimap is similar to std::multimap but it's implemented like an ordered vector. +//! This means that inserting a new element into a flat_map invalidates +//! previous iterators and references +//! +//! Erasing an element invalidates iterators and references +//! pointing to elements that come after (their keys are bigger) the erased element. +//! +//! This container provides random-access iterators. +//! +//! \tparam Key is the key_type of the map +//! \tparam Value is the <code>mapped_type</code> +//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>). +//! \tparam Allocator is the allocator to allocate the <code>value_type</code>s +//! (e.g. <i>allocator< std::pair<Key, T> > </i>). #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED -template <class Key, class T, class Pred = std::less< std::pair< Key, T> >, class A = std::allocator<T> > +template <class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator< std::pair< Key, T> > > #else -template <class Key, class T, class Pred, class A> +template <class Key, class T, class Compare, class Allocator> #endif class flat_multimap { - /// @cond + #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED private: BOOST_COPYABLE_AND_MOVABLE(flat_multimap) typedef container_detail::flat_tree<Key, std::pair<Key, T>, container_detail::select1st< std::pair<Key, T> >, - Pred, - A> tree_t; + Compare, + Allocator> tree_t; //This is the real tree stored here. It's based on a movable pair typedef container_detail::flat_tree<Key, container_detail::pair<Key, T>, container_detail::select1st<container_detail::pair<Key, T> >, - Pred, - typename allocator_traits<A>::template portable_rebind_alloc + Compare, + typename allocator_traits<Allocator>::template portable_rebind_alloc <container_detail::pair<Key, T> >::type> impl_tree_t; impl_tree_t m_flat_tree; // flat tree representing flat_map typedef typename impl_tree_t::value_type impl_value_type; - typedef typename impl_tree_t::pointer impl_pointer; - typedef typename impl_tree_t::const_pointer impl_const_pointer; - typedef typename impl_tree_t::reference impl_reference; - typedef typename impl_tree_t::const_reference impl_const_reference; - typedef typename impl_tree_t::value_compare impl_value_compare; - typedef typename impl_tree_t::iterator impl_iterator; typedef typename impl_tree_t::const_iterator impl_const_iterator; - typedef typename impl_tree_t::reverse_iterator impl_reverse_iterator; - typedef typename impl_tree_t::const_reverse_iterator impl_const_reverse_iterator; typedef typename impl_tree_t::allocator_type impl_allocator_type; - typedef allocator_traits<A> allocator_traits_type; - - /// @endcond + typedef container_detail::flat_tree_value_compare + < Compare + , container_detail::select1st< std::pair<Key, T> > + , std::pair<Key, T> > value_compare_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::iterator iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::const_iterator const_iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::reverse_iterator reverse_iterator_impl; + typedef typename container_detail::get_flat_tree_iterators + <typename allocator_traits<Allocator>::pointer>::const_reverse_iterator const_reverse_iterator_impl; + #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED public: - // typedefs: - typedef Key key_type; - typedef T mapped_type; - typedef Pred key_compare; - typedef typename std::pair<key_type, mapped_type> value_type; - typedef typename allocator_traits_type::pointer pointer; - typedef typename allocator_traits_type::const_pointer const_pointer; - typedef typename allocator_traits_type::reference reference; - typedef typename allocator_traits_type::const_reference const_reference; - typedef typename impl_tree_t::size_type size_type; - typedef typename impl_tree_t::difference_type difference_type; - typedef container_detail::flat_tree_value_compare - < Pred - , container_detail::select1st< std::pair<Key, T> > - , std::pair<Key, T> > value_compare; - - typedef typename container_detail:: - get_flat_tree_iterators<pointer>::iterator iterator; - typedef typename container_detail:: - get_flat_tree_iterators<pointer>::const_iterator const_iterator; - typedef typename container_detail:: - get_flat_tree_iterators - <pointer>::reverse_iterator reverse_iterator; - typedef typename container_detail:: - get_flat_tree_iterators - <pointer>::const_reverse_iterator const_reverse_iterator; - typedef A allocator_type; - //Non-standard extension - typedef A stored_allocator_type; - //!Standard extension for C++03 compilers with non-movable std::pair - typedef impl_value_type movable_value_type; + ////////////////////////////////////////////// + // + // types + // + ////////////////////////////////////////////// + typedef Key key_type; + typedef T mapped_type; + typedef std::pair<Key, T> value_type; + typedef ::boost::container::allocator_traits<Allocator> allocator_traits_type; + typedef typename boost::container::allocator_traits<Allocator>::pointer pointer; + typedef typename boost::container::allocator_traits<Allocator>::const_pointer const_pointer; + typedef typename boost::container::allocator_traits<Allocator>::reference reference; + typedef typename boost::container::allocator_traits<Allocator>::const_reference const_reference; + typedef typename boost::container::allocator_traits<Allocator>::size_type size_type; + typedef typename boost::container::allocator_traits<Allocator>::difference_type difference_type; + typedef Allocator allocator_type; + typedef BOOST_CONTAINER_IMPDEF(Allocator) stored_allocator_type; + typedef BOOST_CONTAINER_IMPDEF(value_compare_impl) value_compare; + typedef Compare key_compare; + typedef BOOST_CONTAINER_IMPDEF(iterator_impl) iterator; + typedef BOOST_CONTAINER_IMPDEF(const_iterator_impl) const_iterator; + typedef BOOST_CONTAINER_IMPDEF(reverse_iterator_impl) reverse_iterator; + typedef BOOST_CONTAINER_IMPDEF(const_reverse_iterator_impl) const_reverse_iterator; + typedef BOOST_CONTAINER_IMPDEF(impl_value_type) movable_value_type; + + ////////////////////////////////////////////// + // + // construct/copy/destroy + // + ////////////////////////////////////////////// //! <b>Effects</b>: Default constructs an empty flat_map. //! //! <b>Complexity</b>: Constant. flat_multimap() - : m_flat_tree() {} + : m_flat_tree() + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison //! object and allocator. //! //! <b>Complexity</b>: Constant. - explicit flat_multimap(const Pred& comp, + explicit flat_multimap(const Compare& comp, const allocator_type& a = allocator_type()) - : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) { } + : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + + //! <b>Effects</b>: Constructs an empty flat_multimap using the specified allocator. + //! + //! <b>Complexity</b>: Constant. + explicit flat_multimap(const allocator_type& a) + : m_flat_tree(container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object //! and allocator, and inserts elements from the range [first ,last ). @@ -994,10 +1172,13 @@ class flat_multimap //! comp and otherwise N logN, where N is last - first. template <class InputIterator> flat_multimap(InputIterator first, InputIterator last, - const Pred& comp = Pred(), + const Compare& comp = Compare(), const allocator_type& a = allocator_type()) - : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a)) - { m_flat_tree.insert_equal(first, last); } + : m_flat_tree(false, first, last, comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and //! allocator, and inserts elements from the ordered range [first ,last). This function @@ -1010,16 +1191,54 @@ class flat_multimap //! <b>Note</b>: Non-standard extension. template <class InputIterator> flat_multimap(ordered_range_t, InputIterator first, InputIterator last, - const Pred& comp = Pred(), + const Compare& comp = Compare(), const allocator_type& a = allocator_type()) : m_flat_tree(ordered_range, first, last, comp, a) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and + //! allocator, and inserts elements from the range [il.begin(), il.end()). + //! + //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using + //! comp and otherwise N logN, where N is last - first. + flat_multimap(std::initializer_list<value_type> il, const Compare& comp = Compare(), const allocator_type& a = allocator_type()) + : m_flat_tree(false, il.begin(), il.end(), comp, container_detail::force<impl_allocator_type>(a)) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } + + //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and + //! allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function + //! is more efficient than the normal range creation for ordered ranges. + //! + //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate. + //! + //! <b>Complexity</b>: Linear in N. + //! + //! <b>Note</b>: Non-standard extension. + flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp = Compare(), + const allocator_type& a = allocator_type()) + : m_flat_tree(ordered_range, il.begin(), il.end(), comp, a) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } +#endif //! <b>Effects</b>: Copy constructs a flat_multimap. //! //! <b>Complexity</b>: Linear in x.size(). flat_multimap(const flat_multimap& x) - : m_flat_tree(x.m_flat_tree) { } + : m_flat_tree(x.m_flat_tree) + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Move constructs a flat_multimap. Constructs *this using x's resources. //! @@ -1028,14 +1247,20 @@ class flat_multimap //! <b>Postcondition</b>: x is emptied. flat_multimap(BOOST_RV_REF(flat_multimap) x) : m_flat_tree(boost::move(x.m_flat_tree)) - { } + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Copy constructs a flat_multimap using the specified allocator. //! //! <b>Complexity</b>: Linear in x.size(). flat_multimap(const flat_multimap& x, const allocator_type &a) : m_flat_tree(x.m_flat_tree, a) - {} + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Move constructs a flat_multimap using the specified allocator. //! Constructs *this using x's resources. @@ -1043,7 +1268,10 @@ class flat_multimap //! <b>Complexity</b>: Constant if a == x.get_allocator(), linear otherwise. flat_multimap(BOOST_RV_REF(flat_multimap) x, const allocator_type &a) : m_flat_tree(boost::move(x.m_flat_tree), a) - { } + { + //Allocator type must be std::pair<Key, T> + BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); + } //! <b>Effects</b>: Makes *this a copy of x. //! @@ -1054,42 +1282,61 @@ class flat_multimap //! <b>Effects</b>: this->swap(x.get()). //! //! <b>Complexity</b>: Constant. - flat_multimap& operator=(BOOST_RV_REF(flat_multimap) mx) - { m_flat_tree = boost::move(mx.m_flat_tree); return *this; } - - //! <b>Effects</b>: Returns the comparison object out - //! of which a was constructed. - //! - //! <b>Complexity</b>: Constant. - key_compare key_comp() const - { return container_detail::force_copy<key_compare>(m_flat_tree.key_comp()); } + flat_multimap& operator=(BOOST_RV_REF(flat_multimap) x) + BOOST_CONTAINER_NOEXCEPT_IF(allocator_traits_type::propagate_on_container_move_assignment::value) + { m_flat_tree = boost::move(x.m_flat_tree); return *this; } - //! <b>Effects</b>: Returns an object of value_compare constructed out - //! of the comparison object. +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: Assign content of il to *this //! - //! <b>Complexity</b>: Constant. - value_compare value_comp() const - { return value_compare(container_detail::force_copy<key_compare>(m_flat_tree.key_comp())); } + //! <b>Complexity</b>: Linear in il.size(). + flat_multimap& operator=(std::initializer_list<value_type> il) + { + this->clear(); + this->insert(il.begin(), il.end()); + return *this; + } +#endif //! <b>Effects</b>: Returns a copy of the Allocator that //! was passed to the object's constructor. //! //! <b>Complexity</b>: Constant. - allocator_type get_allocator() const + allocator_type get_allocator() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<allocator_type>(m_flat_tree.get_allocator()); } - const stored_allocator_type &get_stored_allocator() const + //! <b>Effects</b>: Returns a reference to the internal allocator. + //! + //! <b>Throws</b>: Nothing + //! + //! <b>Complexity</b>: Constant. + //! + //! <b>Note</b>: Non-standard extension. + stored_allocator_type &get_stored_allocator() BOOST_CONTAINER_NOEXCEPT { return container_detail::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); } - stored_allocator_type &get_stored_allocator() + //! <b>Effects</b>: Returns a reference to the internal allocator. + //! + //! <b>Throws</b>: Nothing + //! + //! <b>Complexity</b>: Constant. + //! + //! <b>Note</b>: Non-standard extension. + const stored_allocator_type &get_stored_allocator() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); } + ////////////////////////////////////////////// + // + // iterators + // + ////////////////////////////////////////////// + //! <b>Effects</b>: Returns an iterator to the first element contained in the container. //! //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - iterator begin() + iterator begin() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<iterator>(m_flat_tree.begin()); } //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container. @@ -1097,7 +1344,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator begin() const + const_iterator begin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.begin()); } //! <b>Effects</b>: Returns an iterator to the end of the container. @@ -1105,7 +1352,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - iterator end() + iterator end() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<iterator>(m_flat_tree.end()); } //! <b>Effects</b>: Returns a const_iterator to the end of the container. @@ -1113,7 +1360,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator end() const + const_iterator end() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.end()); } //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning @@ -1122,7 +1369,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - reverse_iterator rbegin() + reverse_iterator rbegin() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<reverse_iterator>(m_flat_tree.rbegin()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning @@ -1131,7 +1378,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator rbegin() const + const_reverse_iterator rbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); } //! <b>Effects</b>: Returns a reverse_iterator pointing to the end @@ -1140,7 +1387,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - reverse_iterator rend() + reverse_iterator rend() BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<reverse_iterator>(m_flat_tree.rend()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end @@ -1149,7 +1396,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator rend() const + const_reverse_iterator rend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.rend()); } //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container. @@ -1157,7 +1404,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator cbegin() const + const_iterator cbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.cbegin()); } //! <b>Effects</b>: Returns a const_iterator to the end of the container. @@ -1165,7 +1412,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_iterator cend() const + const_iterator cend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_iterator>(m_flat_tree.cend()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning @@ -1174,7 +1421,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator crbegin() const + const_reverse_iterator crbegin() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); } //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end @@ -1183,15 +1430,21 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - const_reverse_iterator crend() const + const_reverse_iterator crend() const BOOST_CONTAINER_NOEXCEPT { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crend()); } + ////////////////////////////////////////////// + // + // capacity + // + ////////////////////////////////////////////// + //! <b>Effects</b>: Returns true if the container contains no elements. //! //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - bool empty() const + bool empty() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.empty(); } //! <b>Effects</b>: Returns the number of the elements contained in the container. @@ -1199,7 +1452,7 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - size_type size() const + size_type size() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.size(); } //! <b>Effects</b>: Returns the largest possible size of the container. @@ -1207,16 +1460,97 @@ class flat_multimap //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - size_type max_size() const + size_type max_size() const BOOST_CONTAINER_NOEXCEPT { return m_flat_tree.max_size(); } - //! <b>Effects</b>: Swaps the contents of *this and x. + //! <b>Effects</b>: Number of elements for which memory has been allocated. + //! capacity() is always greater than or equal to size(). //! //! <b>Throws</b>: Nothing. //! //! <b>Complexity</b>: Constant. - void swap(flat_multimap& x) - { m_flat_tree.swap(x.m_flat_tree); } + size_type capacity() const BOOST_CONTAINER_NOEXCEPT + { return m_flat_tree.capacity(); } + + //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no + //! effect. Otherwise, it is a request for allocation of additional memory. + //! If the request is successful, then capacity() is greater than or equal to + //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged. + //! + //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws. + //! + //! <b>Note</b>: If capacity() is less than "cnt", iterators and references to + //! to values might be invalidated. + void reserve(size_type cnt) + { m_flat_tree.reserve(cnt); } + + //! <b>Effects</b>: Tries to deallocate the excess of memory created + // with previous allocations. The size of the vector is unchanged + //! + //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws. + //! + //! <b>Complexity</b>: Linear to size(). + void shrink_to_fit() + { m_flat_tree.shrink_to_fit(); } + + ////////////////////////////////////////////// + // + // modifiers + // + ////////////////////////////////////////////// + + #if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) + + //! <b>Effects</b>: Inserts an object of type T constructed with + //! std::forward<Args>(args)... and returns the iterator pointing to the + //! newly inserted element. + //! + //! <b>Complexity</b>: Logarithmic search time plus linear insertion + //! to the elements with bigger keys than x. + //! + //! <b>Note</b>: If an element is inserted it might invalidate elements. + template <class... Args> + iterator emplace(Args&&... args) + { return container_detail::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Args>(args)...)); } + + //! <b>Effects</b>: Inserts an object of type T constructed with + //! std::forward<Args>(args)... in the container. + //! p is a hint pointing to where the insert should start to search. + //! + //! <b>Returns</b>: An iterator pointing to the element with key equivalent + //! to the key of x. + //! + //! <b>Complexity</b>: Logarithmic search time (constant time if the value + //! is to be inserted before p) plus linear insertion + //! to the elements with bigger keys than x. + //! + //! <b>Note</b>: If an element is inserted it might invalidate elements. + template <class... Args> + iterator emplace_hint(const_iterator hint, Args&&... args) + { + return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal + (container_detail::force_copy<impl_const_iterator>(hint), boost::forward<Args>(args)...)); + } + + #else //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING + + #define BOOST_PP_LOCAL_MACRO(n) \ + BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ + iterator emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ + { return container_detail::force_copy<iterator>(m_flat_tree.emplace_equal \ + (BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ + \ + BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ + iterator emplace_hint(const_iterator hint \ + BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ + { return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal \ + (container_detail::force_copy<impl_const_iterator>(hint) \ + BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ + //! + #define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS) + #include BOOST_PP_LOCAL_ITERATE() + + #endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING //! <b>Effects</b>: Inserts x and returns the iterator pointing to the //! newly inserted element. @@ -1262,10 +1596,10 @@ class flat_multimap //! to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, const value_type& x) + iterator insert(const_iterator p, const value_type& x) { return container_detail::force_copy<iterator> - (m_flat_tree.insert_equal( container_detail::force_copy<impl_const_iterator>(position) + (m_flat_tree.insert_equal( container_detail::force_copy<impl_const_iterator>(p) , container_detail::force<impl_value_type>(x))); } @@ -1280,10 +1614,10 @@ class flat_multimap //! to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, BOOST_RV_REF(value_type) x) + iterator insert(const_iterator p, BOOST_RV_REF(value_type) x) { return container_detail::force_copy<iterator> - (m_flat_tree.insert_equal(container_detail::force_copy<impl_const_iterator>(position) + (m_flat_tree.insert_equal(container_detail::force_copy<impl_const_iterator>(p) , boost::move(x))); } @@ -1298,10 +1632,10 @@ class flat_multimap //! to the elements with bigger keys than x. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - iterator insert(const_iterator position, BOOST_RV_REF(impl_value_type) x) + iterator insert(const_iterator p, BOOST_RV_REF(impl_value_type) x) { return container_detail::force_copy<iterator>( - m_flat_tree.insert_equal(container_detail::force_copy<impl_const_iterator>(position), boost::move(x))); + m_flat_tree.insert_equal(container_detail::force_copy<impl_const_iterator>(p), boost::move(x))); } //! <b>Requires</b>: first, last are not iterators into *this. @@ -1328,77 +1662,52 @@ class flat_multimap //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. + //! + //! <b>Note</b>: Non-standard extension. template <class InputIterator> void insert(ordered_range_t, InputIterator first, InputIterator last) { m_flat_tree.insert_equal(ordered_range, first, last); } - #if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) - - //! <b>Effects</b>: Inserts an object of type T constructed with - //! std::forward<Args>(args)... and returns the iterator pointing to the - //! newly inserted element. +#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) + //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) . //! - //! <b>Complexity</b>: Logarithmic search time plus linear insertion - //! to the elements with bigger keys than x. + //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from first to last) + //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - template <class... Args> - iterator emplace(Args&&... args) - { return container_detail::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Args>(args)...)); } + void insert(std::initializer_list<value_type> il) + { m_flat_tree.insert_equal(il.begin(), il.end()); } - //! <b>Effects</b>: Inserts an object of type T constructed with - //! std::forward<Args>(args)... in the container. - //! p is a hint pointing to where the insert should start to search. + //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate. //! - //! <b>Returns</b>: An iterator pointing to the element with key equivalent - //! to the key of x. + //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only + //! if there is no element with key equivalent to the key of that element. This + //! function is more efficient than the normal range creation for ordered ranges. //! - //! <b>Complexity</b>: Logarithmic search time (constant time if the value - //! is to be inserted before p) plus linear insertion - //! to the elements with bigger keys than x. + //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from first to last) + //! search time plus N*size() insertion time. //! //! <b>Note</b>: If an element is inserted it might invalidate elements. - template <class... Args> - iterator emplace_hint(const_iterator hint, Args&&... args) - { - return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal - (container_detail::force_copy<impl_const_iterator>(hint), boost::forward<Args>(args)...)); - } - - #else //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING - - #define BOOST_PP_LOCAL_MACRO(n) \ - BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ - iterator emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ - { return container_detail::force_copy<iterator>(m_flat_tree.emplace_equal \ - (BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ - \ - BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \ - iterator emplace_hint(const_iterator hint \ - BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \ - { return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal \ - (container_detail::force_copy<impl_const_iterator>(hint) \ - BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); } \ //! - #define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS) - #include BOOST_PP_LOCAL_ITERATE() - - #endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING + //! <b>Note</b>: Non-standard extension. + void insert(ordered_range_t, std::initializer_list<value_type> il) + { m_flat_tree.insert_equal(ordered_range, il.begin(), il.end()); } +#endif - //! <b>Effects</b>: Erases the element pointed to by position. + //! <b>Effects</b>: Erases the element pointed to by p. //! //! <b>Returns</b>: Returns an iterator pointing to the element immediately //! following q prior to the element being erased. If no such element exists, //! returns end(). //! - //! <b>Complexity</b>: Linear to the elements with keys bigger than position + //! <b>Complexity</b>: Linear to the elements with keys bigger than p //! //! <b>Note</b>: Invalidates elements with keys //! not less than the erased element. - iterator erase(const_iterator position) + iterator erase(const_iterator p) { return container_detail::force_copy<iterator>( - m_flat_tree.erase(container_detail::force_copy<impl_const_iterator>(position))); + m_flat_tree.erase(container_detail::force_copy<impl_const_iterator>(p))); } //! <b>Effects</b>: Erases all elements in the container with key equivalent to x. @@ -1425,22 +1734,47 @@ class flat_multimap , container_detail::force_copy<impl_const_iterator>(last))); } + //! <b>Effects</b>: Swaps the contents of *this and x. + //! + //! <b>Throws</b>: Nothing. + //! + //! <b>Complexity</b>: Constant. + void swap(flat_multimap& x) + { m_flat_tree.swap(x.m_flat_tree); } + //! <b>Effects</b>: erase(a.begin(),a.end()). //! //! <b>Postcondition</b>: size() == 0. //! //! <b>Complexity</b>: linear in size(). - void clear() + void clear() BOOST_CONTAINER_NOEXCEPT { m_flat_tree.clear(); } - //! <b>Effects</b>: Tries to deallocate the excess of memory created - // with previous allocations. The size of the vector is unchanged + ////////////////////////////////////////////// + // + // observers + // + ////////////////////////////////////////////// + + //! <b>Effects</b>: Returns the comparison object out + //! of which a was constructed. //! - //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws. + //! <b>Complexity</b>: Constant. + key_compare key_comp() const + { return container_detail::force_copy<key_compare>(m_flat_tree.key_comp()); } + + //! <b>Effects</b>: Returns an object of value_compare constructed out + //! of the comparison object. //! - //! <b>Complexity</b>: Linear to size(). - void shrink_to_fit() - { m_flat_tree.shrink_to_fit(); } + //! <b>Complexity</b>: Constant. + value_compare value_comp() const + { return value_compare(container_detail::force_copy<key_compare>(m_flat_tree.key_comp())); } + + ////////////////////////////////////////////// + // + // map operations + // + ////////////////////////////////////////////// //! <b>Returns</b>: An iterator pointing to an element with the key //! equivalent to x, or end() if such an element is not found. @@ -1467,9 +1801,9 @@ class flat_multimap //! //! <b>Complexity</b>: Logarithmic iterator lower_bound(const key_type& x) - {return container_detail::force_copy<iterator>(m_flat_tree.lower_bound(x)); } + { return container_detail::force_copy<iterator>(m_flat_tree.lower_bound(x)); } - //! <b>Returns</b>: A const iterator pointing to the first element with key + //! <b>Returns</b>: Allocator const iterator pointing to the first element with key //! not less than k, or a.end() if such an element is not found. //! //! <b>Complexity</b>: Logarithmic @@ -1483,7 +1817,7 @@ class flat_multimap iterator upper_bound(const key_type& x) {return container_detail::force_copy<iterator>(m_flat_tree.upper_bound(x)); } - //! <b>Returns</b>: A const iterator pointing to the first element with key + //! <b>Returns</b>: Allocator const iterator pointing to the first element with key //! not less than x, or end() if such an element is not found. //! //! <b>Complexity</b>: Logarithmic @@ -1499,93 +1833,69 @@ class flat_multimap //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). //! //! <b>Complexity</b>: Logarithmic - std::pair<const_iterator,const_iterator> - equal_range(const key_type& x) const + std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const { return container_detail::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); } - //! <b>Effects</b>: Number of elements for which memory has been allocated. - //! capacity() is always greater than or equal to size(). - //! - //! <b>Throws</b>: Nothing. + //! <b>Effects</b>: Returns true if x and y are equal //! - //! <b>Complexity</b>: Constant. - size_type capacity() const - { return m_flat_tree.capacity(); } + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator==(const flat_multimap& x, const flat_multimap& y) + { return x.size() == y.size() && std::equal(x.begin(), x.end(), y.begin()); } - //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no - //! effect. Otherwise, it is a request for allocation of additional memory. - //! If the request is successful, then capacity() is greater than or equal to - //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged. + //! <b>Effects</b>: Returns true if x and y are unequal //! - //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws. - //! - //! <b>Note</b>: If capacity() is less than "count", iterators and references to - //! to values might be invalidated. - void reserve(size_type count) - { m_flat_tree.reserve(count); } - - /// @cond - template <class K1, class T1, class C1, class A1> - friend bool operator== (const flat_multimap<K1, T1, C1, A1>& x, - const flat_multimap<K1, T1, C1, A1>& y); - - template <class K1, class T1, class C1, class A1> - friend bool operator< (const flat_multimap<K1, T1, C1, A1>& x, - const flat_multimap<K1, T1, C1, A1>& y); - /// @endcond -}; - -template <class Key, class T, class Pred, class A> -inline bool operator==(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) - { return x.m_flat_tree == y.m_flat_tree; } - -template <class Key, class T, class Pred, class A> -inline bool operator<(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) - { return x.m_flat_tree < y.m_flat_tree; } + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator!=(const flat_multimap& x, const flat_multimap& y) + { return !(x == y); } -template <class Key, class T, class Pred, class A> -inline bool operator!=(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) - { return !(x == y); } + //! <b>Effects</b>: Returns true if x is less than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator<(const flat_multimap& x, const flat_multimap& y) + { return std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); } -template <class Key, class T, class Pred, class A> -inline bool operator>(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) + //! <b>Effects</b>: Returns true if x is greater than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator>(const flat_multimap& x, const flat_multimap& y) { return y < x; } -template <class Key, class T, class Pred, class A> -inline bool operator<=(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) + //! <b>Effects</b>: Returns true if x is equal or less than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator<=(const flat_multimap& x, const flat_multimap& y) { return !(y < x); } -template <class Key, class T, class Pred, class A> -inline bool operator>=(const flat_multimap<Key,T,Pred,A>& x, - const flat_multimap<Key,T,Pred,A>& y) + //! <b>Effects</b>: Returns true if x is equal or greater than y + //! + //! <b>Complexity</b>: Linear to the number of elements in the container. + friend bool operator>=(const flat_multimap& x, const flat_multimap& y) { return !(x < y); } -template <class Key, class T, class Pred, class A> -inline void swap(flat_multimap<Key,T,Pred,A>& x, flat_multimap<Key,T,Pred,A>& y) + //! <b>Effects</b>: x.swap(y) + //! + //! <b>Complexity</b>: Constant. + friend void swap(flat_multimap& x, flat_multimap& y) { x.swap(y); } +}; }} -/// @cond +#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED namespace boost { -/* + //!has_trivial_destructor_after_move<> == true_type //!specialization for optimizations -template <class K, class T, class C, class A> -struct has_trivial_destructor_after_move< boost::container::flat_multimap<K, T, C, A> > +template <class K, class T, class C, class Allocator> +struct has_trivial_destructor_after_move< boost::container::flat_multimap<K, T, C, Allocator> > { - static const bool value = has_trivial_destructor<A>::value && has_trivial_destructor<C>::value; + static const bool value = has_trivial_destructor_after_move<Allocator>::value && has_trivial_destructor_after_move<C>::value; }; -*/ + } //namespace boost { -/// @endcond +#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED #include <boost/container/detail/config_end.hpp> |