/usr/include/boost/container
Edit: /usr/include/boost/container/set.hpp (71409B)
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/container for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_CONTAINER_SET_HPP
#define BOOST_CONTAINER_SET_HPP
#ifndef BOOST_CONFIG_HPP
# include
#endif
#if defined(BOOST_HAS_PRAGMA_ONCE)
# pragma once
#endif
#include
#include
// container
#include
// container/detail
#include
#include
#include //new_allocator
// intrusive/detail
#include //pair
#include //less, equal
// move
#include
#include
// move/detail
#include
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#include
#endif
// std
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
#include
#endif
namespace boost {
namespace container {
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! A set is a kind of associative container that supports unique keys (contains at
//! most one of each key value) and provides for fast retrieval of the keys themselves.
//! Class set supports bidirectional iterators.
//!
//! A set satisfies all of the requirements of a container and of a reversible container
//! , and of an associative container. A set also provides most operations described in
//! for unique keys.
//!
//! \tparam Key is the type to be inserted in the set, which is also the key_type
//! \tparam Compare is the comparison functor used to order keys
//! \tparam Allocator is the allocator to be used to allocate memory for this container
//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
template , class Allocator = new_allocator, class Options = void>
#else
template
#endif
class set
///@cond
: public dtl::tree
< Key, void, Compare, Allocator, Options>
///@endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(set)
typedef dtl::tree
< Key, void, Compare, Allocator, Options> base_t;
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef Key value_type;
typedef Compare key_compare;
typedef key_compare value_compare;
typedef typename base_t::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename ::boost::container::allocator_traits::pointer pointer;
typedef typename ::boost::container::allocator_traits::const_pointer const_pointer;
typedef typename ::boost::container::allocator_traits::reference reference;
typedef typename ::boost::container::allocator_traits::const_reference const_reference;
typedef typename ::boost::container::allocator_traits::size_type size_type;
typedef typename ::boost::container::allocator_traits::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::node_type) node_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::insert_return_type) insert_return_type;
//////////////////////////////////////////////
//
// construct/copy/destroy
//
//////////////////////////////////////////////
//! Effects: Default constructs an empty set.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE set()
BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: base_t()
{}
//! Effects: Constructs an empty set using the specified allocator object.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit set(const allocator_type& a)
: base_t(a)
{}
//! Effects: Constructs an empty set using the specified comparison object.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE explicit set(const Compare& comp)
: base_t(comp)
{}
//! Effects: Constructs an empty set using the specified comparison object
//! and allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE set(const Compare& comp, const allocator_type& a)
: base_t(comp, a)
{}
//! Effects: Constructs an empty set using and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE set(InputIterator first, InputIterator last)
: base_t(true, first, last)
{}
//! Effects: Constructs an empty set using the specified
//! allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE set(InputIterator first, InputIterator last, const allocator_type& a)
: base_t(true, first, last, key_compare(), a)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE set(InputIterator first, InputIterator last, const Compare& comp)
: base_t(true, first, last, comp)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! allocator, and inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! the predicate and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE set(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: base_t(true, first, last, comp, a)
{}
//! Effects: Constructs an empty set and
//! inserts elements from the ordered unique range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, InputIterator first, InputIterator last)
: base_t(ordered_range, first, last)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! inserts elements from the ordered unique range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp )
: base_t(ordered_range, first, last, comp)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! allocator, and inserts elements from the ordered unique range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, InputIterator first, InputIterator last
, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, first, last, comp, a)
{}
//! Effects: Constructs an empty set using the specified allocator and
//! inserts elements from the ordered unique range [first ,last). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE set(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
: base_t(ordered_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Constructs an empty set and
//! inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
//! the predicate and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE set(std::initializer_list il)
: base_t(true, il.begin(), il.end())
{}
//! Effects: Constructs an empty set using the specified
//! allocator, and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
//! the predicate and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE set(std::initializer_list il, const allocator_type& a)
: base_t(true, il.begin(), il.end(), Compare(), a)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
//! the predicate and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE set(std::initializer_list il, const Compare& comp )
: base_t(true, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! allocator, and inserts elements from the range [il.begin(), il.end()).
//!
//! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
//! the predicate and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE set(std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(true, il.begin(), il.end(), comp, a)
{}
//! Effects: Constructs an empty set and
//! inserts elements from the ordered unique range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, std::initializer_list il)
: base_t(ordered_range, il.begin(), il.end())
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! inserts elements from the ordered unique range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, std::initializer_list il, const Compare& comp)
: base_t(ordered_range, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty set using the specified comparison object and
//! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
//! unique values.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE set( ordered_unique_range_t, std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, il.begin(), il.end(), comp, a)
{}
#endif
//! Effects: Copy constructs a set.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE set(const set& x)
: base_t(static_cast(x))
{}
//! Effects: Move constructs a set. Constructs *this using x's resources.
//!
//! Complexity: Constant.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE set(BOOST_RV_REF(set) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: base_t(BOOST_MOVE_BASE(base_t, x))
{}
//! Effects: Copy constructs a set using the specified allocator.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE set(const set& x, const allocator_type &a)
: base_t(static_cast(x), a)
{}
//! Effects: Move constructs a set using the specified allocator.
//! Constructs *this using x's resources.
//!
//! Complexity: Constant if a == x.get_allocator(), linear otherwise.
BOOST_CONTAINER_FORCEINLINE set(BOOST_RV_REF(set) x, const allocator_type &a)
: base_t(BOOST_MOVE_BASE(base_t, x), a)
{}
//! Effects: Makes *this a copy of x.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE set& operator=(BOOST_COPY_ASSIGN_REF(set) x)
{ return static_cast(this->base_t::operator=(static_cast(x))); }
//! Effects: this->swap(x.get()).
//!
//! Throws: If allocator_traits_type::propagate_on_container_move_assignment
//! is false and (allocation throws or value_type's move constructor throws)
//!
//! Complexity: Constant if allocator_traits_type::
//! propagate_on_container_move_assignment is true or
//! this->get>allocator() == x.get_allocator(). Linear otherwise.
BOOST_CONTAINER_FORCEINLINE set& operator=(BOOST_RV_REF(set) x)
BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
allocator_traits_type::is_always_equal::value) &&
boost::container::dtl::is_nothrow_move_assignable::value)
{ return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Copy all elements from il to *this.
//!
//! Complexity: Linear in il.size().
set& operator=(std::initializer_list il)
{
this->clear();
insert(il.begin(), il.end());
return *this;
}
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Returns a copy of the allocator that
//! was passed to the object's constructor.
//!
//! Complexity: Constant.
allocator_type get_allocator() const;
//! Effects: Returns a reference to the internal allocator.
//!
//! Throws: Nothing
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension.
stored_allocator_type &get_stored_allocator();
//! Effects: Returns a reference to the internal allocator.
//!
//! Throws: Nothing
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension.
const stored_allocator_type &get_stored_allocator() const;
//! Effects: Returns an iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant
iterator begin();
//! Effects: Returns a const_iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator begin() const;
//! Effects: Returns a const_iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator cbegin() const;
//! Effects: Returns an iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
iterator end();
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator end() const;
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator cend() const;
//! Effects: Returns a reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rbegin();
//! Effects: Returns a const_reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator rbegin() const;
//! Effects: Returns a const_reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator crbegin() const;
//! Effects: Returns a reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rend();
//! Effects: Returns a const_reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator rend() const;
//! Effects: Returns a const_reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator crend() const;
//! Effects: Returns true if the container contains no elements.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
bool empty() const;
//! Effects: Returns the number of the elements contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type size() const;
//! Effects: Returns the largest possible size of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type max_size() const;
#endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts an object x of type Key constructed with
//! std::forward(args)... if and only if there is
//! no element in the container with equivalent value.
//! and returns the iterator pointing to the
//! newly inserted element.
//!
//! Returns: The bool component of the returned pair is true if and only
//! if the insertion takes place, and the iterator component of the pair
//! points to the element with key equivalent to the key of x.
//!
//! Throws: If memory allocation throws or
//! Key's in-place constructor throws.
//!
//! Complexity: Logarithmic.
template
BOOST_CONTAINER_FORCEINLINE std::pair emplace(BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_unique(boost::forward(args)...); }
//! Effects: Inserts an object of type Key constructed with
//! std::forward(args)... if and only if there is
//! no element in the container with equivalent value.
//! p is a hint pointing to where the insert
//! should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent to the key of x.
//!
//! Complexity: Logarithmic.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_hint_unique(p, boost::forward(args)...); }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_SET_EMPLACE_CODE(N) \
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE std::pair emplace(BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_unique(BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_SET_EMPLACE_CODE)
#undef BOOST_CONTAINER_SET_EMPLACE_CODE
#endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts x if and only if there is no element in the container
//! with key equivalent to the key of x.
//!
//! Returns: The bool component of the returned pair is true if and only
//! if the insertion takes place, and the iterator component of the pair
//! points to the element with key equivalent to the key of x.
//!
//! Complexity: Logarithmic.
std::pair insert(const value_type &x);
//! Effects: Move constructs a new value from x if and only if there is
//! no element in the container with key equivalent to the key of x.
//!
//! Returns: The bool component of the returned pair is true if and only
//! if the insertion takes place, and the iterator component of the pair
//! points to the element with key equivalent to the key of x.
//!
//! Complexity: Logarithmic.
std::pair insert(value_type &&x);
#else
private:
typedef std::pair insert_return_pair;
public:
BOOST_MOVE_CONVERSION_AWARE_CATCH(insert, value_type, insert_return_pair, this->priv_insert)
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts a copy of x in the container if and only if there is
//! no element in the container with key equivalent to the key of x.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic in general, but amortized constant if t
//! is inserted right before p.
iterator insert(const_iterator p, const value_type &x);
//! Effects: Inserts an element move constructed from x in the container.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent to the key of x.
//!
//! Complexity: Logarithmic.
iterator insert(const_iterator p, value_type &&x);
#else
BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert, value_type, iterator, this->priv_insert, const_iterator, const_iterator)
#endif
//! Requires: first, last are not iterators into *this.
//!
//! Effects: inserts each element from the range [first,last) if and only
//! if there is no element with key equivalent to the key of that element.
//!
//! Complexity: At most N log(size()+N) (N is the distance from first to last)
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->base_t::insert_unique(first, last); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: inserts each element from the range [il.begin(),il.end()) if and only
//! if there is no element with key equivalent to the key of that element.
//!
//! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->base_t::insert_unique(il.begin(), il.end()); }
#endif
//! @copydoc ::boost::container::map::insert(node_type&&)
BOOST_CONTAINER_FORCEINLINE insert_return_type insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{ return this->base_t::insert_unique_node(boost::move(nh)); }
//! @copydoc ::boost::container::map::insert(const_iterator, node_type&&)
BOOST_CONTAINER_FORCEINLINE insert_return_type insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{ return this->base_t::insert_unique_node(hint, boost::move(nh)); }
//! @copydoc ::boost::container::map::merge(map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(set& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_unique(static_cast(source));
}
//! @copydoc ::boost::container::set::merge(set&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG set BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::map::merge(multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(multiset& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_unique(static_cast(source));
}
//! @copydoc ::boost::container::set::merge(multiset&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multiset BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Erases the element pointed to by p.
//!
//! Returns: Returns an iterator pointing to the element immediately
//! following q prior to the element being erased. If no such element exists,
//! returns end().
//!
//! Complexity: Amortized constant time
iterator erase(const_iterator p);
//! Effects: Erases all elements in the container with key equivalent to x.
//!
//! Returns: Returns the number of erased elements.
//!
//! Complexity: log(size()) + count(k)
size_type erase(const key_type& x);
//! Effects: Erases all the elements in the range [first, last).
//!
//! Returns: Returns last.
//!
//! Complexity: log(size())+N where N is the distance from first to last.
iterator erase(const_iterator first, const_iterator last);
//! @copydoc ::boost::container::map::extract(const_iterator)
node_type extract(const_iterator p);
//! @copydoc ::boost::container::map::extract(const key_type&)
node_type extract(const key_type& x);
//! Effects: Swaps the contents of *this and x.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
void swap(set& x)
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable::value );
//! Effects: erase(begin(),end()).
//!
//! Postcondition: size() == 0.
//!
//! Complexity: linear in size().
void clear();
//! Effects: Returns the comparison object out
//! of which a was constructed.
//!
//! Complexity: Constant.
key_compare key_comp() const;
//! Effects: Returns an object of value_compare constructed out
//! of the comparison object.
//!
//! Complexity: Constant.
value_compare value_comp() const;
//! Returns: An iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
iterator find(const key_type& x);
//! Returns: A const_iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
const_iterator find(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
iterator find(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const_iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
const_iterator find(const K& x) const;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Returns: The number of elements with key equivalent to x.
//!
//! Complexity: log(size())+count(k)
BOOST_CONTAINER_FORCEINLINE size_type count(const key_type& x) const
{ return static_cast(this->base_t::find(x) != this->base_t::cend()); }
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: The number of elements with key equivalent to x.
//!
//! Complexity: log(size())+count(k)
template
BOOST_CONTAINER_FORCEINLINE size_type count(const K& x) const
{ return static_cast(this->find(x) != this->cend()); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Returns: Returns true if there is an element with key
//! equivalent to key in the container, otherwise false.
//!
//! Complexity: log(size()).
bool contains(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: Returns true if there is an element with key
//! equivalent to key in the container, otherwise false.
//!
//! Complexity: log(size()).
template
bool contains(const K& x) const;
//! Returns: An iterator pointing to the first element with key not less
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
iterator lower_bound(const key_type& x);
//! Returns: A const iterator pointing to the first element with key not
//! less than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
const_iterator lower_bound(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to the first element with key not less
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
iterator lower_bound(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const iterator pointing to the first element with key not
//! less than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
const_iterator lower_bound(const K& x) const;
//! Returns: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
iterator upper_bound(const key_type& x);
//! Returns: A const iterator pointing to the first element with key
//! greater than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
const_iterator upper_bound(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to the first element with key greater
//! than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
iterator upper_bound(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const iterator pointing to the first element with key
//! greater than x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic
template
const_iterator upper_bound(const K& x) const;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
BOOST_CONTAINER_FORCEINLINE std::pair equal_range(const key_type& x)
{ return this->base_t::lower_bound_range(x); }
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
BOOST_CONTAINER_FORCEINLINE std::pair equal_range(const key_type& x) const
{ return this->base_t::lower_bound_range(x); }
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
template
BOOST_CONTAINER_FORCEINLINE std::pair equal_range(const K& x)
{ return this->base_t::lower_bound_range(x); }
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
//!
//! Complexity: Logarithmic
template
BOOST_CONTAINER_FORCEINLINE std::pair equal_range(const K& x) const
{ return this->base_t::lower_bound_range(x); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.
//!
//! Complexity: Linear
void rebalance();
//! Effects: Returns true if x and y are equal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator==(const set& x, const set& y);
//! Effects: Returns true if x and y are unequal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator!=(const set& x, const set& y);
//! Effects: Returns true if x is less than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator<(const set& x, const set& y);
//! Effects: Returns true if x is greater than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator>(const set& x, const set& y);
//! Effects: Returns true if x is equal or less than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator<=(const set& x, const set& y);
//! Effects: Returns true if x is equal or greater than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator>=(const set& x, const set& y);
//! Effects: x.swap(y)
//!
//! Complexity: Constant.
friend void swap(set& x, set& y);
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
template
BOOST_CONTAINER_FORCEINLINE std::pair priv_insert(BOOST_FWD_REF(KeyType) x)
{ return this->base_t::insert_unique(::boost::forward(x)); }
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x)
{ return this->base_t::insert_unique(p, ::boost::forward(x)); }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
template
set(InputIterator, InputIterator) ->
set< it_based_value_type_t >;
template < typename InputIterator, typename AllocatorOrCompare>
set(InputIterator, InputIterator, AllocatorOrCompare const&) ->
set< it_based_value_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
set(InputIterator, InputIterator, Compare const&, Allocator const&) ->
set< it_based_value_type_t
, Compare
, Allocator>;
template
set(ordered_unique_range_t, InputIterator, InputIterator) ->
set< it_based_value_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
set(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
set< it_based_value_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
set(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
set< it_based_value_type_t
, Compare
, Allocator>;
#endif
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
} //namespace container {
//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template
struct has_trivial_destructor_after_move >
{
typedef ::boost::container::dtl::tree tree;
static const bool value = ::boost::has_trivial_destructor_after_move::value;
};
namespace container {
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! A multiset is a kind of associative container that supports equivalent keys
//! (possibly contains multiple copies of the same key value) and provides for
//! fast retrieval of the keys themselves. Class multiset supports bidirectional iterators.
//!
//! A multiset satisfies all of the requirements of a container and of a reversible
//! container, and of an associative container). multiset also provides most operations
//! described for duplicate keys.
//!
//! \tparam Key is the type to be inserted in the set, which is also the key_type
//! \tparam Compare is the comparison functor used to order keys
//! \tparam Allocator is the allocator to be used to allocate memory for this container
//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
template , class Allocator = new_allocator, class Options = tree_assoc_defaults >
#else
template
#endif
class multiset
/// @cond
: public dtl::tree
/// @endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(multiset)
typedef dtl::tree
base_t;
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef Key value_type;
typedef Compare key_compare;
typedef key_compare value_compare;
typedef typename base_t::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename ::boost::container::allocator_traits::pointer pointer;
typedef typename ::boost::container::allocator_traits::const_pointer const_pointer;
typedef typename ::boost::container::allocator_traits::reference reference;
typedef typename ::boost::container::allocator_traits::const_reference const_reference;
typedef typename ::boost::container::allocator_traits::size_type size_type;
typedef typename ::boost::container::allocator_traits::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator;
typedef typename BOOST_CONTAINER_IMPDEF(base_t::node_type) node_type;
//////////////////////////////////////////////
//
// construct/copy/destroy
//
//////////////////////////////////////////////
//! @copydoc ::boost::container::set::set()
BOOST_CONTAINER_FORCEINLINE multiset()
BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: base_t()
{}
//! @copydoc ::boost::container::set::set(const allocator_type&)
BOOST_CONTAINER_FORCEINLINE explicit multiset(const allocator_type& a)
: base_t(a)
{}
//! @copydoc ::boost::container::set::set(const Compare&)
BOOST_CONTAINER_FORCEINLINE explicit multiset(const Compare& comp)
: base_t(comp)
{}
//! @copydoc ::boost::container::set::set(const Compare&, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE multiset(const Compare& comp, const allocator_type& a)
: base_t(comp, a)
{}
//! @copydoc ::boost::container::set::set(InputIterator, InputIterator)
template
BOOST_CONTAINER_FORCEINLINE multiset(InputIterator first, InputIterator last)
: base_t(false, first, last)
{}
//! @copydoc ::boost::container::set::set(InputIterator, InputIterator, const allocator_type&)
template
BOOST_CONTAINER_FORCEINLINE multiset(InputIterator first, InputIterator last, const allocator_type& a)
: base_t(false, first, last, key_compare(), a)
{}
//! @copydoc ::boost::container::set::set(InputIterator, InputIterator, const Compare&)
template
BOOST_CONTAINER_FORCEINLINE multiset(InputIterator first, InputIterator last, const Compare& comp)
: base_t(false, first, last, comp)
{}
//! @copydoc ::boost::container::set::set(InputIterator, InputIterator, const Compare&, const allocator_type&)
template
BOOST_CONTAINER_FORCEINLINE multiset(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: base_t(false, first, last, comp, a)
{}
//! Effects: Constructs an empty multiset and
//! and inserts elements from the ordered range [first ,last ). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multiset( ordered_range_t, InputIterator first, InputIterator last )
: base_t(ordered_range, first, last)
{}
//! Effects: Constructs an empty multiset using the specified comparison object and
//! inserts elements from the ordered range [first ,last ). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multiset( ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
: base_t(ordered_range, first, last, comp)
{}
//! Effects: Constructs an empty multiset using the specified comparison object and
//! allocator, and inserts elements from the ordered range [first ,last ). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multiset( ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, first, last, comp, a)
{}
//! Effects: Constructs an empty multiset using the specified allocator and
//! inserts elements from the ordered range [first ,last ). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Requires: [first ,last) must be ordered according to the predicate.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
template
BOOST_CONTAINER_FORCEINLINE multiset(ordered_range_t, InputIterator first, InputIterator last, const allocator_type &a)
: base_t(ordered_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! @copydoc ::boost::container::set::set(std::initializer_list)
BOOST_CONTAINER_FORCEINLINE multiset(std::initializer_list il)
: base_t(false, il.begin(), il.end())
{}
//! @copydoc ::boost::container::set::set(std::initializer_list, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE multiset(std::initializer_list il, const allocator_type& a)
: base_t(false, il.begin(), il.end(), Compare(), a)
{}
//! @copydoc ::boost::container::set::set(std::initializer_list, const Compare&)
BOOST_CONTAINER_FORCEINLINE multiset(std::initializer_list il, const Compare& comp)
: base_t(false, il.begin(), il.end(), comp)
{}
//! @copydoc ::boost::container::set::set(std::initializer_list, const Compare&, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE multiset(std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(false, il.begin(), il.end(), comp, a)
{}
//! @copydoc ::boost::container::set::set(ordered_unique_range_t, std::initializer_list)
BOOST_CONTAINER_FORCEINLINE multiset(ordered_range_t, std::initializer_list il)
: base_t(ordered_range, il.begin(), il.end())
{}
//! @copydoc ::boost::container::set::set(ordered_unique_range_t, std::initializer_list, const Compare&)
BOOST_CONTAINER_FORCEINLINE multiset(ordered_range_t, std::initializer_list il, const Compare& comp)
: base_t(ordered_range, il.begin(), il.end(), comp)
{}
//! @copydoc ::boost::container::set::set(ordered_unique_range_t, std::initializer_list, const Compare&, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE multiset(ordered_range_t, std::initializer_list il, const Compare& comp, const allocator_type& a)
: base_t(ordered_range, il.begin(), il.end(), comp, a)
{}
#endif
//! @copydoc ::boost::container::set::set(const set &)
BOOST_CONTAINER_FORCEINLINE multiset(const multiset& x)
: base_t(static_cast(x))
{}
//! @copydoc ::boost::container::set::set(set &&)
BOOST_CONTAINER_FORCEINLINE multiset(BOOST_RV_REF(multiset) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: base_t(BOOST_MOVE_BASE(base_t, x))
{}
//! @copydoc ::boost::container::set::set(const set &, const allocator_type &)
BOOST_CONTAINER_FORCEINLINE multiset(const multiset& x, const allocator_type &a)
: base_t(static_cast(x), a)
{}
//! @copydoc ::boost::container::set::set(set &&, const allocator_type &)
BOOST_CONTAINER_FORCEINLINE multiset(BOOST_RV_REF(multiset) x, const allocator_type &a)
: base_t(BOOST_MOVE_BASE(base_t, x), a)
{}
//! @copydoc ::boost::container::set::operator=(const set &)
BOOST_CONTAINER_FORCEINLINE multiset& operator=(BOOST_COPY_ASSIGN_REF(multiset) x)
{ return static_cast(this->base_t::operator=(static_cast(x))); }
//! @copydoc ::boost::container::set::operator=(set &&)
BOOST_CONTAINER_FORCEINLINE multiset& operator=(BOOST_RV_REF(multiset) x)
BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
allocator_traits_type::is_always_equal::value) &&
boost::container::dtl::is_nothrow_move_assignable::value)
{ return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! @copydoc ::boost::container::set::operator=(std::initializer_list)
multiset& operator=(std::initializer_list il)
{
this->clear();
insert(il.begin(), il.end());
return *this;
}
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::set::get_allocator()
allocator_type get_allocator() const;
//! @copydoc ::boost::container::set::get_stored_allocator()
stored_allocator_type &get_stored_allocator();
//! @copydoc ::boost::container::set::get_stored_allocator() const
const stored_allocator_type &get_stored_allocator() const;
//! @copydoc ::boost::container::set::begin()
iterator begin();
//! @copydoc ::boost::container::set::begin() const
const_iterator begin() const;
//! @copydoc ::boost::container::set::cbegin() const
const_iterator cbegin() const;
//! @copydoc ::boost::container::set::end()
iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::end() const
const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::cend() const
const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rbegin()
reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rbegin() const
const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::crbegin() const
const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rend()
reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::rend() const
const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::crend() const
const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::empty() const
bool empty() const;
//! @copydoc ::boost::container::set::size() const
size_type size() const;
//! @copydoc ::boost::container::set::max_size() const
size_type max_size() const;
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts an object of type Key constructed with
//! std::forward(args)... and returns the iterator pointing to the
//! newly inserted element.
//!
//! Complexity: Logarithmic.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_equal(boost::forward(args)...); }
//! Effects: Inserts an object of type Key constructed with
//! std::forward(args)...
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic in general, but amortized constant if t
//! is inserted right before p.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->base_t::emplace_hint_equal(p, boost::forward(args)...); }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_MULTISET_EMPLACE_CODE(N) \
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_equal(BOOST_MOVE_FWD##N); }\
\
BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
{ return this->base_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MULTISET_EMPLACE_CODE)
#undef BOOST_CONTAINER_MULTISET_EMPLACE_CODE
#endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts x and returns the iterator pointing to the
//! newly inserted element.
//!
//! Complexity: Logarithmic.
iterator insert(const value_type &x);
//! Effects: Inserts a copy of x in the container.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic in general, but amortized constant if t
//! is inserted right before p.
iterator insert(value_type &&x);
#else
BOOST_MOVE_CONVERSION_AWARE_CATCH(insert, value_type, iterator, this->priv_insert)
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Inserts a copy of x in the container.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic in general, but amortized constant if t
//! is inserted right before p.
iterator insert(const_iterator p, const value_type &x);
//! Effects: Inserts a value move constructed from x in the container.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic in general, but amortized constant if t
//! is inserted right before p.
iterator insert(const_iterator p, value_type &&x);
#else
BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert, value_type, iterator, this->priv_insert, const_iterator, const_iterator)
#endif
//! Requires: first, last are not iterators into *this.
//!
//! Effects: inserts each element from the range [first,last) .
//!
//! Complexity: At most N log(size()+N) (N is the distance from first to last)
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->base_t::insert_equal(first, last); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! @copydoc ::boost::container::set::insert(std::initializer_list)
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->base_t::insert_equal(il.begin(), il.end()); }
#endif
//! @copydoc ::boost::container::multimap::insert(node_type&&)
BOOST_CONTAINER_FORCEINLINE iterator insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{ return this->base_t::insert_equal_node(boost::move(nh)); }
//! @copydoc ::boost::container::multimap::insert(const_iterator, node_type&&)
BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
{ return this->base_t::insert_equal_node(hint, boost::move(nh)); }
//! @copydoc ::boost::container::multimap::merge(multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(multiset& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_equal(static_cast(source));
}
//! @copydoc ::boost::container::multiset::merge(multiset&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multiset BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::multimap::merge(map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(set& source)
{
typedef dtl::tree
base2_t;
this->base_t::merge_equal(static_cast(source));
}
//! @copydoc ::boost::container::multiset::merge(set&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG set BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::set::erase(const_iterator)
iterator erase(const_iterator p);
//! @copydoc ::boost::container::set::erase(const key_type&)
size_type erase(const key_type& x);
//! @copydoc ::boost::container::set::erase(const_iterator,const_iterator)
iterator erase(const_iterator first, const_iterator last);
//! @copydoc ::boost::container::multimap::extract(const_iterator)
node_type extract(const_iterator p);
//! @copydoc ::boost::container::multimap::extract(const key_type&)
node_type extract(const key_type& x);
//! @copydoc ::boost::container::set::swap
void swap(multiset& x)
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable::value );
//! @copydoc ::boost::container::set::clear
void clear() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::set::key_comp
key_compare key_comp() const;
//! @copydoc ::boost::container::set::value_comp
value_compare value_comp() const;
//! @copydoc ::boost::container::set::find(const key_type& )
iterator find(const key_type& x);
//! @copydoc ::boost::container::set::find(const key_type& ) const
const_iterator find(const key_type& x) const;
//! @copydoc ::boost::container::set::find(const K& )
template
iterator find(const K& x);
//! @copydoc ::boost::container::set::find(const K& )
template
const_iterator find(const K& x) const;
//! @copydoc ::boost::container::set::count(const key_type& ) const
size_type count(const key_type& x) const;
//! @copydoc ::boost::container::set::count(const K& ) const
template
size_type count(const K& x) const;
//! @copydoc ::boost::container::set::contains(const key_type& ) const
bool contains(const key_type& x) const;
//! @copydoc ::boost::container::set::contains(const K& ) const
template
bool contains(const K& x) const;
//! @copydoc ::boost::container::set::lower_bound(const key_type& )
iterator lower_bound(const key_type& x);
//! @copydoc ::boost::container::set::lower_bound(const key_type& ) const
const_iterator lower_bound(const key_type& x) const;
//! @copydoc ::boost::container::set::lower_bound(const K& )
template
iterator lower_bound(const K& x);
//! @copydoc ::boost::container::set::lower_bound(const K& ) const
template
const_iterator lower_bound(const K& x) const;
//! @copydoc ::boost::container::set::upper_bound(const key_type& )
iterator upper_bound(const key_type& x);
//! @copydoc ::boost::container::set::upper_bound(const key_type& ) const
const_iterator upper_bound(const key_type& x) const;
//! @copydoc ::boost::container::set::upper_bound(const K& )
template
iterator upper_bound(const K& x);
//! @copydoc ::boost::container::set::upper_bound(const K& ) const
template
const_iterator upper_bound(const K& x) const;
//! @copydoc ::boost::container::set::equal_range(const key_type& ) const
std::pair equal_range(const key_type& x) const;
//! @copydoc ::boost::container::set::equal_range(const key_type& )
std::pair equal_range(const key_type& x);
//! @copydoc ::boost::container::set::equal_range(const K& ) const
template
std::pair equal_range(const K& x) const;
//! @copydoc ::boost::container::set::equal_range(const K& )
template
std::pair equal_range(const K& x);
//! @copydoc ::boost::container::set::rebalance()
void rebalance();
//! Effects: Returns true if x and y are equal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator==(const multiset& x, const multiset& y);
//! Effects: Returns true if x and y are unequal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator!=(const multiset& x, const multiset& y);
//! Effects: Returns true if x is less than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator<(const multiset& x, const multiset& y);
//! Effects: Returns true if x is greater than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator>(const multiset& x, const multiset& y);
//! Effects: Returns true if x is equal or less than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator<=(const multiset& x, const multiset& y);
//! Effects: Returns true if x is equal or greater than y
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator>=(const multiset& x, const multiset& y);
//! Effects: x.swap(y)
//!
//! Complexity: Constant.
friend void swap(multiset& x, multiset& y);
#endif //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(BOOST_FWD_REF(KeyType) x)
{ return this->base_t::insert_equal(::boost::forward(x)); }
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x)
{ return this->base_t::insert_equal(p, ::boost::forward(x)); }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
template
multiset(InputIterator, InputIterator) ->
multiset< it_based_value_type_t >;
template < typename InputIterator, typename AllocatorOrCompare>
multiset(InputIterator, InputIterator, AllocatorOrCompare const&) ->
multiset < it_based_value_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
multiset(InputIterator, InputIterator, Compare const&, Allocator const&) ->
multiset< it_based_value_type_t
, Compare
, Allocator>;
template
multiset(ordered_range_t, InputIterator, InputIterator) ->
multiset< it_based_value_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
multiset(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
multiset < it_based_value_type_t
, typename dtl::if_c< // Compare
dtl::is_allocator::value
, std::less>
, AllocatorOrCompare
>::type
, typename dtl::if_c< // Allocator
dtl::is_allocator::value
, AllocatorOrCompare
, new_allocator>
>::type
>;
template < typename InputIterator, typename Compare, typename Allocator
, typename = dtl::require_nonallocator_t
, typename = dtl::require_allocator_t>
multiset(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
multiset< it_based_value_type_t
, Compare
, Allocator>;
#endif
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
} //namespace container {
//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template
struct has_trivial_destructor_after_move >
{
typedef ::boost::container::dtl::tree tree;
static const bool value = ::boost::has_trivial_destructor_after_move::value;
};
namespace container {
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
}}
#include
#endif // BOOST_CONTAINER_SET_HPP