/usr/include/boost/container
Edit: /usr/include/boost/container/flat_set.hpp (84601B)
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/container for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_CONTAINER_FLAT_SET_HPP
#define BOOST_CONTAINER_FLAT_SET_HPP
#ifndef BOOST_CONFIG_HPP
# include
#endif
#if defined(BOOST_HAS_PRAGMA_ONCE)
# pragma once
#endif
#include
#include
// container
#include
#include
#include //new_allocator
// container/detail
#include
#include
// move
#include
#include
// move/detail
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#include
#endif
#include
// intrusive/detail
#include //pair
#include //less, equal
// std
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
#include
#endif
namespace boost {
namespace container {
#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
template
class flat_multiset;
#endif
//! flat_set is a Sorted Associative Container that stores objects of type Key.
//! It is also a Unique Associative Container, meaning that no two elements are the same.
//!
//! flat_set is similar to std::set but it's implemented by as an ordered sequence container.
//! The underlying sequence container is by default vector but it can also work
//! user-provided vector-like SequenceContainers (like static_vector or small_vector).
//!
//! Using vector-like sequence containers means that inserting a new element into a flat_set might invalidate
//! previous iterators and references (unless that sequence container is stable_vector or a similar
//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
//!
//! This container provides random-access iterators.
//!
//! \tparam Key is the type to be inserted in the set, which is also the key_type
//! \tparam Compare is the comparison functor used to order keys
//! \tparam AllocatorOrContainer is either:
//! - The allocator to allocate value_types (e.g. allocator< std::pair > ).
//! (in this case sequence_type will be vector)
//! - The SequenceContainer to be used as the underlying sequence_type. It must be a vector-like
//! sequence container with random-access iterators.
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template , class AllocatorOrContainer = new_allocator >
#else
template
#endif
class flat_set
///@cond
: public dtl::flat_tree, Compare, AllocatorOrContainer>
///@endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(flat_set)
typedef dtl::flat_tree, Compare, AllocatorOrContainer> tree_t;
public:
tree_t &tree()
{ return *this; }
const tree_t &tree() const
{ return *this; }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef Compare key_compare;
typedef Key value_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;
typedef typename sequence_type::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename sequence_type::pointer pointer;
typedef typename sequence_type::const_pointer const_pointer;
typedef typename sequence_type::reference reference;
typedef typename sequence_type::const_reference const_reference;
typedef typename sequence_type::size_type size_type;
typedef typename sequence_type::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;
typedef typename sequence_type::iterator iterator;
typedef typename sequence_type::const_iterator const_iterator;
typedef typename sequence_type::reverse_iterator reverse_iterator;
typedef typename sequence_type::const_reverse_iterator const_reverse_iterator;
public:
//////////////////////////////////////////////
//
// construct/copy/destroy
//
//////////////////////////////////////////////
//! Effects: Default constructs an empty container.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE
flat_set() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: tree_t()
{}
//! Effects: Constructs an empty container using the specified
//! comparison object.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE
explicit flat_set(const Compare& comp)
: tree_t(comp)
{}
//! Effects: Constructs an empty container using the specified allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE
explicit flat_set(const allocator_type& a)
: tree_t(a)
{}
//! Effects: Constructs an empty container using the specified
//! comparison object and allocator.
//!
//! Complexity: Constant.
BOOST_CONTAINER_FORCEINLINE
flat_set(const Compare& comp, const allocator_type& a)
: tree_t(comp, a)
{}
//! Effects: Constructs an empty container and
//! inserts elements from the range [first ,last ).
//!
//! Complexity: Linear in N if the range [first ,last ) is already sorted using
//! comp and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE
flat_set(InputIterator first, InputIterator last)
: tree_t(true, first, last)
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE
flat_set(InputIterator first, InputIterator last, const allocator_type& a)
: tree_t(true, first, last, a)
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE
flat_set(InputIterator first, InputIterator last, const Compare& comp)
: tree_t(true, first, last, comp)
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is last - first.
template
BOOST_CONTAINER_FORCEINLINE
flat_set(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: tree_t(true, first, last, comp, a)
{}
//! Effects: Constructs an empty container 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
flat_set(ordered_unique_range_t, InputIterator first, InputIterator last)
: tree_t(ordered_unique_range, first, last)
{}
//! Effects: Constructs an empty container 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
flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
: tree_t(ordered_unique_range, first, last, comp)
{}
//! Effects: Constructs an empty container 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
flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: tree_t(ordered_unique_range, first, last, comp, a)
{}
//! Effects: Constructs an empty container 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
flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
: tree_t(ordered_unique_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE flat_set(std::initializer_list il)
: tree_t(true, il.begin(), il.end())
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE flat_set(std::initializer_list il, const allocator_type& a)
: tree_t(true, il.begin(), il.end(), a)
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE flat_set(std::initializer_list il, const Compare& comp)
: tree_t(true, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty container 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
//! comp and otherwise N logN, where N is il.begin() - il.end().
BOOST_CONTAINER_FORCEINLINE flat_set(std::initializer_list il, const Compare& comp, const allocator_type& a)
: tree_t(true, il.begin(), il.end(), comp, a)
{}
//! Effects: Constructs an empty container 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 flat_set(ordered_unique_range_t, std::initializer_list il)
: tree_t(ordered_unique_range, il.begin(), il.end())
{}
//! Effects: Constructs an empty container 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 flat_set(ordered_unique_range_t, std::initializer_list il, const Compare& comp)
: tree_t(ordered_unique_range, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty container 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 flat_set(ordered_unique_range_t, std::initializer_list il, const Compare& comp, const allocator_type& a)
: tree_t(ordered_unique_range, il.begin(), il.end(), comp, a)
{}
#endif
//! Effects: Copy constructs the container.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE flat_set(const flat_set& x)
: tree_t(static_cast(x))
{}
//! Effects: Move constructs thecontainer. Constructs *this using x's resources.
//!
//! Complexity: Constant.
//!
//! Postcondition: x is emptied.
BOOST_CONTAINER_FORCEINLINE flat_set(BOOST_RV_REF(flat_set) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: tree_t(BOOST_MOVE_BASE(tree_t, x))
{}
//! Effects: Copy constructs a container using the specified allocator.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE flat_set(const flat_set& x, const allocator_type &a)
: tree_t(static_cast(x), a)
{}
//! Effects: Move constructs a container using the specified allocator.
//! Constructs *this using x's resources.
//!
//! Complexity: Constant if a == x.get_allocator(), linear otherwise
BOOST_CONTAINER_FORCEINLINE flat_set(BOOST_RV_REF(flat_set) x, const allocator_type &a)
: tree_t(BOOST_MOVE_BASE(tree_t, x), a)
{}
//! Effects: Makes *this a copy of x.
//!
//! Complexity: Linear in x.size().
BOOST_CONTAINER_FORCEINLINE flat_set& operator=(BOOST_COPY_ASSIGN_REF(flat_set) x)
{ return static_cast(this->tree_t::operator=(static_cast(x))); }
//! 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 flat_set& operator=(BOOST_RV_REF(flat_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->tree_t::operator=(BOOST_MOVE_BASE(tree_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: Copy all elements from il to *this.
//!
//! Complexity: Linear in il.size().
flat_set& operator=(std::initializer_list il)
{
this->clear();
this->insert(il.begin(), il.end());
return *this;
}
#endif
#ifdef 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 BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a reference to the internal allocator.
//!
//! Throws: Nothing
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension.
stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a reference to the internal allocator.
//!
//! Throws: Nothing
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension.
const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns an iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
iterator begin() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns an iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the first element contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_iterator to the end of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_reverse_iterator pointing to the beginning
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns a const_reverse_iterator pointing to the end
//! of the reversed container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns true if the container contains no elements.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
bool empty() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the number of the elements contained in the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type size() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the largest possible size of the container.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Number of elements for which memory has been allocated.
//! capacity() is always greater than or equal to size().
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: If n is less than or equal to capacity(), or the
//! underlying container has no `reserve` member, this call has no
//! effect. Otherwise, it is a request for allocation of additional memory.
//! If the request is successful, then capacity() is greater than or equal to
//! n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
//!
//! Throws: If memory allocation allocation throws or T's copy constructor throws.
//!
//! Note: If capacity() is less than "cnt", iterators and references to
//! to values might be invalidated.
void reserve(size_type cnt);
//! Effects: Tries to deallocate the excess of memory created
// with previous allocations. The size of the vector is unchanged
//!
//! Throws: If memory allocation throws, or Key's copy constructor throws.
//!
//! Complexity: Linear to size().
void shrink_to_fit();
#endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//////////////////////////////////////////////
//
// modifiers
//
//////////////////////////////////////////////
#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 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 search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE std::pair emplace(BOOST_FWD_REF(Args)... args)
{ return this->tree_t::emplace_unique(boost::forward(args)...); }
//! Effects: Inserts an object of type Key constructed with
//! std::forward(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.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->tree_t::emplace_hint_unique(p, boost::forward(args)...); }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_FLAT_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->tree_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->tree_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_SET_EMPLACE_CODE)
#undef BOOST_CONTAINER_FLAT_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 search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
std::pair insert(const value_type &x);
//! Effects: Inserts a new value_type move constructed from the pair if and
//! only if there is no element in the container with key equivalent to the key of x.
//!
//! Returns: The bool component of the returned pair is true if and only
//! if the insertion takes place, and the iterator component of the pair
//! points to the element with key equivalent to the key of x.
//!
//! Complexity: Logarithmic search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
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 search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
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 search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
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: N log(N).
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->tree_t::insert_unique(first, last); }
//! Requires: first, last are not iterators into *this and
//! must be ordered according to the predicate and must be
//! unique values.
//!
//! Effects: inserts each element from the range [first,last) .This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Complexity: Linear.
//!
//! Note: Non-standard extension. If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, InputIterator first, InputIterator last)
{ this->tree_t::insert_unique(ordered_unique_range, 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: N log(N).
//!
//! Note: If an element is inserted it might invalidate elements.
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->tree_t::insert_unique(il.begin(), il.end()); }
//! Requires: Range [il.begin(), il.end()) must be ordered according to the predicate
//! and must be unique values.
//!
//! Effects: inserts each element from the range [il.begin(), il.end()) .This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Complexity: Linear.
//!
//! Note: Non-standard extension. If an element is inserted it might invalidate elements.
BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, std::initializer_list il)
{ this->tree_t::insert_unique(ordered_unique_range, il.begin(), il.end()); }
#endif
//! @copydoc ::boost::container::flat_map::merge(flat_map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(flat_set& source)
{ this->tree_t::merge_unique(source.tree()); }
//! @copydoc ::boost::container::flat_set::merge(flat_set&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_set BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::flat_map::merge(flat_multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(flat_multiset& source)
{ this->tree_t::merge_unique(source.tree()); }
//! @copydoc ::boost::container::flat_set::merge(flat_multiset&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_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: Linear to the elements with keys bigger than p
//!
//! Note: Invalidates elements with keys
//! not less than the erased element.
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: Logarithmic search time plus erasure time
//! linear to the elements with bigger keys.
size_type erase(const key_type& x);
//! Effects: Erases all the elements in the range [first, last).
//!
//! Returns: Returns last.
//!
//! Complexity: size()*N where N is the distance from first to last.
//!
//! Complexity: Logarithmic search time plus erasure time
//! linear to the elements with bigger keys.
iterator erase(const_iterator first, const_iterator last);
//! Effects: Swaps the contents of *this and x.
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
void swap(flat_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() BOOST_NOEXCEPT_OR_NOTHROW;
//! Effects: Returns the comparison object out
//! of which a was constructed.
//!
//! Complexity: Constant.
key_compare key_comp() const;
//! Effects: Returns an object of value_compare constructed out
//! of the comparison object.
//!
//! Complexity: Constant.
value_compare value_comp() const;
//! Returns: An iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
iterator find(const key_type& x);
//! Returns: A const_iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
const_iterator find(const key_type& x) const;
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: An iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
iterator find(const K& x);
//! Requires: This overload is available only if
//! key_compare::is_transparent exists.
//!
//! Returns: A const_iterator pointing to an element with the key
//! equivalent to x, or end() if such an element is not found.
//!
//! Complexity: Logarithmic.
template
const_iterator find(const K& x) const;
//! Requires: size() >= n.
//!
//! Effects: Returns an iterator to the nth element
//! from the beginning of the container. Returns end()
//! if n == size().
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension
iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW;
//! Requires: size() >= n.
//!
//! Effects: Returns a const_iterator to the nth element
//! from the beginning of the container. Returns end()
//! if n == size().
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension
const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW;
//! Requires: begin() <= p <= end().
//!
//! Effects: Returns the index of the element pointed by p
//! and size() if p == end().
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension
size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW;
//! Requires: begin() <= p <= end().
//!
//! Effects: Returns the index of the element pointed by p
//! and size() if p == end().
//!
//! Throws: Nothing.
//!
//! Complexity: Constant.
//!
//! Note: Non-standard extension
size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW;
#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->tree_t::find(x) != this->tree_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
//Don't use find() != end optimization here as transparent comparators with key K might
//return a different range than key_type (which can only return a single element range)
{ return this->tree_t::count(x); }
#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) const
{ return this->tree_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)
{ return this->tree_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
std::pair equal_range(const K& x)
//Don't use lower_bound_range optimization here as transparent comparators with key K might
//return a different range than key_type (which can only return a single element range)
{ return this->tree_t::equal_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
std::pair equal_range(const K& x) const
//Don't use lower_bound_range optimization here as transparent comparators with key K might
//return a different range than key_type (which can only return a single element range)
{ return this->tree_t::equal_range(x); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! Effects: Returns true if x and y are equal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator==(const flat_set& x, const flat_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 flat_set& x, const flat_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 flat_set& x, const flat_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 flat_set& x, const flat_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 flat_set& x, const flat_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 flat_set& x, const flat_set& y);
//! Effects: x.swap(y)
//!
//! Complexity: Constant.
friend void swap(flat_set& x, flat_set& y);
//! Effects: Extracts the internal sequence container.
//!
//! Complexity: Same as the move constructor of sequence_type, usually constant.
//!
//! Postcondition: this->empty()
//!
//! Throws: If secuence_type's move constructor throws
sequence_type extract_sequence();
#endif //#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! Effects: Discards the internally hold sequence container and adopts the
//! one passed externally using the move assignment. Erases non-unique elements.
//!
//! Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
//!
//! Throws: If the comparison or the move constructor throws
BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
{ this->tree_t::adopt_sequence_unique(boost::move(seq)); }
//! Requires: seq shall be ordered according to this->compare()
//! and shall contain unique elements.
//!
//! Effects: Discards the internally hold sequence container and adopts the
//! one passed externally using the move assignment.
//!
//! Complexity: Assuming O(1) move assignment, O(1)
//!
//! Throws: If the move assignment throws
BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_unique_range_t, BOOST_RV_REF(sequence_type) seq)
{ this->tree_t::adopt_sequence_unique(ordered_unique_range_t(), boost::move(seq)); }
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
template
BOOST_CONTAINER_FORCEINLINE std::pair priv_insert(BOOST_FWD_REF(KeyType) x)
{ return this->tree_t::insert_unique(::boost::forward(x)); }
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x)
{ return this->tree_t::insert_unique(p, ::boost::forward(x)); }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
template
flat_set(InputIterator, InputIterator) ->
flat_set< it_based_value_type_t >;
template < typename InputIterator, typename AllocatorOrCompare>
flat_set(InputIterator, InputIterator, AllocatorOrCompare const&) ->
flat_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>
flat_set(InputIterator, InputIterator, Compare const&, Allocator const&) ->
flat_set< it_based_value_type_t
, Compare
, Allocator>;
template
flat_set(ordered_unique_range_t, InputIterator, InputIterator) ->
flat_set< it_based_value_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
flat_set(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
flat_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>
flat_set(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
flat_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::flat_tree, Compare, AllocatorOrContainer> tree;
static const bool value = ::boost::has_trivial_destructor_after_move::value;
};
namespace container {
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
//! flat_multiset is a Sorted Associative Container that stores objects of type Key and
//! can store multiple copies of the same key value.
//!
//! flat_multiset is similar to std::multiset but it's implemented by as an ordered sequence container.
//! The underlying sequence container is by default vector but it can also work
//! user-provided vector-like SequenceContainers (like static_vector or small_vector).
//!
//! Using vector-like sequence containers means that inserting a new element into a flat_multiset might invalidate
//! previous iterators and references (unless that sequence container is stable_vector or a similar
//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
//!
//! This container provides random-access iterators.
//!
//! \tparam Key is the type to be inserted in the multiset, which is also the key_type
//! \tparam Compare is the comparison functor used to order keys
//! \tparam AllocatorOrContainer is either:
//! - The allocator to allocate value_types (e.g. allocator< std::pair > ).
//! (in this case sequence_type will be vector)
//! - The SequenceContainer to be used as the underlying sequence_type. It must be a vector-like
//! sequence container with random-access iterators.
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template , class AllocatorOrContainer = new_allocator >
#else
template
#endif
class flat_multiset
///@cond
: public dtl::flat_tree, Compare, AllocatorOrContainer>
///@endcond
{
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
BOOST_COPYABLE_AND_MOVABLE(flat_multiset)
typedef dtl::flat_tree, Compare, AllocatorOrContainer> tree_t;
public:
tree_t &tree()
{ return *this; }
const tree_t &tree() const
{ return *this; }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
public:
//////////////////////////////////////////////
//
// types
//
//////////////////////////////////////////////
typedef Key key_type;
typedef Compare key_compare;
typedef Key value_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;
typedef typename sequence_type::allocator_type allocator_type;
typedef ::boost::container::allocator_traits allocator_traits_type;
typedef typename sequence_type::pointer pointer;
typedef typename sequence_type::const_pointer const_pointer;
typedef typename sequence_type::reference reference;
typedef typename sequence_type::const_reference const_reference;
typedef typename sequence_type::size_type size_type;
typedef typename sequence_type::difference_type difference_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;
typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;
typedef typename sequence_type::iterator iterator;
typedef typename sequence_type::const_iterator const_iterator;
typedef typename sequence_type::reverse_iterator reverse_iterator;
typedef typename sequence_type::const_reverse_iterator const_reverse_iterator;
//! @copydoc ::boost::container::flat_set::flat_set()
BOOST_CONTAINER_FORCEINLINE flat_multiset() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible::value &&
dtl::is_nothrow_default_constructible::value)
: tree_t()
{}
//! @copydoc ::boost::container::flat_set::flat_set(const Compare&)
BOOST_CONTAINER_FORCEINLINE explicit flat_multiset(const Compare& comp)
: tree_t(comp)
{}
//! @copydoc ::boost::container::flat_set::flat_set(const allocator_type&)
BOOST_CONTAINER_FORCEINLINE explicit flat_multiset(const allocator_type& a)
: tree_t(a)
{}
//! @copydoc ::boost::container::flat_set::flat_set(const Compare&, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE flat_multiset(const Compare& comp, const allocator_type& a)
: tree_t(comp, a)
{}
//! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator)
template
BOOST_CONTAINER_FORCEINLINE flat_multiset(InputIterator first, InputIterator last)
: tree_t(false, first, last)
{}
//! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator, const allocator_type&)
template
BOOST_CONTAINER_FORCEINLINE flat_multiset(InputIterator first, InputIterator last, const allocator_type& a)
: tree_t(false, first, last, a)
{}
//! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator, const Compare& comp)
template
BOOST_CONTAINER_FORCEINLINE flat_multiset(InputIterator first, InputIterator last, const Compare& comp)
: tree_t(false, first, last, comp)
{}
//! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator, const Compare& comp, const allocator_type&)
template
BOOST_CONTAINER_FORCEINLINE flat_multiset(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: tree_t(false, first, last, comp, a)
{}
//! Effects: Constructs an empty flat_multiset 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 flat_multiset(ordered_range_t, InputIterator first, InputIterator last)
: tree_t(ordered_range, first, last)
{}
//! Effects: Constructs an empty flat_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 flat_multiset(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
: tree_t(ordered_range, first, last, comp)
{}
//! Effects: Constructs an empty flat_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 flat_multiset(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
: tree_t(ordered_range, first, last, comp, a)
{}
//! Effects: Constructs an empty flat_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 flat_multiset(ordered_range_t, InputIterator first, InputIterator last, const allocator_type &a)
: tree_t(ordered_range, first, last, Compare(), a)
{}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list il)
: tree_t(false, il.begin(), il.end())
{}
//! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE flat_multiset(std::initializer_list il, const allocator_type& a)
: tree_t(false, il.begin(), il.end(), a)
{}
//! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list, const Compare& comp)
BOOST_CONTAINER_FORCEINLINE flat_multiset(std::initializer_list il, const Compare& comp)
: tree_t(false, il.begin(), il.end(), comp)
{}
//! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list, const Compare& comp, const allocator_type&)
BOOST_CONTAINER_FORCEINLINE flat_multiset(std::initializer_list il, const Compare& comp, const allocator_type& a)
: tree_t(false, il.begin(), il.end(), comp, a)
{}
//! Effects: Constructs an empty containerand
//! 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.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE flat_multiset(ordered_range_t, std::initializer_list il)
: tree_t(ordered_range, il.begin(), il.end())
{}
//! Effects: Constructs an empty container 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.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE flat_multiset(ordered_range_t, std::initializer_list il, const Compare& comp)
: tree_t(ordered_range, il.begin(), il.end(), comp)
{}
//! Effects: Constructs an empty container 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.
//!
//! Complexity: Linear in N.
//!
//! Note: Non-standard extension.
BOOST_CONTAINER_FORCEINLINE flat_multiset(ordered_range_t, std::initializer_list il, const Compare& comp, const allocator_type& a)
: tree_t(ordered_range, il.begin(), il.end(), comp, a)
{}
#endif
//! @copydoc ::boost::container::flat_set::flat_set(const flat_set &)
BOOST_CONTAINER_FORCEINLINE flat_multiset(const flat_multiset& x)
: tree_t(static_cast(x))
{}
//! @copydoc ::boost::container::flat_set::flat_set(flat_set &&)
BOOST_CONTAINER_FORCEINLINE flat_multiset(BOOST_RV_REF(flat_multiset) x)
BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible::value)
: tree_t(boost::move(static_cast(x)))
{}
//! @copydoc ::boost::container::flat_set::flat_set(const flat_set &, const allocator_type &)
BOOST_CONTAINER_FORCEINLINE flat_multiset(const flat_multiset& x, const allocator_type &a)
: tree_t(static_cast(x), a)
{}
//! @copydoc ::boost::container::flat_set::flat_set(flat_set &&, const allocator_type &)
BOOST_CONTAINER_FORCEINLINE flat_multiset(BOOST_RV_REF(flat_multiset) x, const allocator_type &a)
: tree_t(BOOST_MOVE_BASE(tree_t, x), a)
{}
//! @copydoc ::boost::container::flat_set::operator=(const flat_set &)
BOOST_CONTAINER_FORCEINLINE flat_multiset& operator=(BOOST_COPY_ASSIGN_REF(flat_multiset) x)
{ return static_cast(this->tree_t::operator=(static_cast(x))); }
//! @copydoc ::boost::container::flat_set::operator=(flat_set &&)
BOOST_CONTAINER_FORCEINLINE flat_multiset& operator=(BOOST_RV_REF(flat_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->tree_t::operator=(BOOST_MOVE_BASE(tree_t, x))); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! @copydoc ::boost::container::flat_set::operator=(std::initializer_list)
flat_multiset& operator=(std::initializer_list il)
{
this->clear();
this->insert(il.begin(), il.end());
return *this;
}
#endif
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::flat_set::get_allocator()
allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::get_stored_allocator()
stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::get_stored_allocator() const
const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::begin()
iterator begin() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::begin() const
const_iterator begin() const;
//! @copydoc ::boost::container::flat_set::cbegin() const
const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::end()
iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::end() const
const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::cend() const
const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::rbegin()
reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::rbegin() const
const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::crbegin() const
const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::rend()
reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::rend() const
const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::crend() const
const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::empty() const
bool empty() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::size() const
size_type size() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::max_size() const
size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::capacity() const
size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::reserve(size_type)
void reserve(size_type cnt);
//! @copydoc ::boost::container::flat_set::shrink_to_fit()
void shrink_to_fit();
#endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//////////////////////////////////////////////
//
// modifiers
//
//////////////////////////////////////////////
#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 search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_FWD_REF(Args)... args)
{ return this->tree_t::emplace_equal(boost::forward(args)...); }
//! Effects: Inserts an object of type Key constructed with
//! std::forward(args)... in the container.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
{ return this->tree_t::emplace_hint_equal(p, boost::forward(args)...); }
#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#define BOOST_CONTAINER_FLAT_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->tree_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->tree_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
//
BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MULTISET_EMPLACE_CODE)
#undef BOOST_CONTAINER_FLAT_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 search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
iterator insert(const value_type &x);
//! Effects: Inserts a new value_type move constructed from x
//! and returns the iterator pointing to the newly inserted element.
//!
//! Complexity: Logarithmic search time plus linear insertion
//! to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
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 search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
iterator insert(const_iterator p, const value_type &x);
//! Effects: Inserts a new value move constructed from x in the container.
//! p is a hint pointing to where the insert should start to search.
//!
//! Returns: An iterator pointing to the element with key equivalent
//! to the key of x.
//!
//! Complexity: Logarithmic search time (constant if x is inserted
//! right before p) plus insertion linear to the elements with bigger keys than x.
//!
//! Note: If an element is inserted it might invalidate elements.
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: N log(N).
//!
//! Note: If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
{ this->tree_t::insert_equal(first, last); }
//! Requires: first, last are not iterators into *this and
//! must be ordered according to the predicate.
//!
//! Effects: inserts each element from the range [first,last) .This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Complexity: Linear.
//!
//! Note: Non-standard extension. If an element is inserted it might invalidate elements.
template
BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, InputIterator first, InputIterator last)
{ this->tree_t::insert_equal(ordered_range, first, last); }
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
//! Effects: inserts each element from the range [il.begin(), il.end()).
//!
//! Complexity: N log(N).
//!
//! Note: If an element is inserted it might invalidate elements.
BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list il)
{ this->tree_t::insert_equal(il.begin(), il.end()); }
//! Requires: Range [il.begin(), il.end()) must be ordered according to the predicate.
//!
//! Effects: inserts each element from the range [il.begin(), il.end()). This function
//! is more efficient than the normal range creation for ordered ranges.
//!
//! Complexity: Linear.
//!
//! Note: Non-standard extension. If an element is inserted it might invalidate elements.
BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, std::initializer_list il)
{ this->tree_t::insert_equal(ordered_range, il.begin(), il.end()); }
#endif
//! @copydoc ::boost::container::flat_multimap::merge(flat_multimap&)
template
BOOST_CONTAINER_FORCEINLINE void merge(flat_multiset& source)
{ this->tree_t::merge_equal(source.tree()); }
//! @copydoc ::boost::container::flat_multiset::merge(flat_multiset&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multiset BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
//! @copydoc ::boost::container::flat_multimap::merge(flat_map&)
template
BOOST_CONTAINER_FORCEINLINE void merge(flat_set& source)
{ this->tree_t::merge_equal(source.tree()); }
//! @copydoc ::boost::container::flat_multiset::merge(flat_set&)
template
BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_set BOOST_RV_REF_END source)
{ return this->merge(static_cast&>(source)); }
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
//! @copydoc ::boost::container::flat_set::erase(const_iterator)
iterator erase(const_iterator p);
//! @copydoc ::boost::container::flat_set::erase(const key_type&)
size_type erase(const key_type& x);
//! @copydoc ::boost::container::flat_set::erase(const_iterator,const_iterator)
iterator erase(const_iterator first, const_iterator last);
//! @copydoc ::boost::container::flat_set::swap
void swap(flat_multiset& x)
BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
&& boost::container::dtl::is_nothrow_swappable::value );
//! @copydoc ::boost::container::flat_set::clear
void clear() BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::key_comp
key_compare key_comp() const;
//! @copydoc ::boost::container::flat_set::value_comp
value_compare value_comp() const;
//! @copydoc ::boost::container::flat_set::find(const key_type& )
iterator find(const key_type& x);
//! @copydoc ::boost::container::flat_set::find(const key_type& ) const
const_iterator find(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::nth(size_type)
iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::nth(size_type) const
const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::index_of(iterator)
size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW;
//! @copydoc ::boost::container::flat_set::count(const key_type& ) const
size_type count(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::contains(const key_type& ) const
bool contains(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::contains(const K& ) const
template
bool contains(const K& x) const;
//! @copydoc ::boost::container::flat_set::lower_bound(const key_type& )
iterator lower_bound(const key_type& x);
//! @copydoc ::boost::container::flat_set::lower_bound(const key_type& ) const
const_iterator lower_bound(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::upper_bound(const key_type& )
iterator upper_bound(const key_type& x);
//! @copydoc ::boost::container::flat_set::upper_bound(const key_type& ) const
const_iterator upper_bound(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::equal_range(const key_type& ) const
std::pair equal_range(const key_type& x) const;
//! @copydoc ::boost::container::flat_set::equal_range(const key_type& )
std::pair equal_range(const key_type& x);
//! Effects: Returns true if x and y are equal
//!
//! Complexity: Linear to the number of elements in the container.
friend bool operator==(const flat_multiset& x, const flat_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 flat_multiset& x, const flat_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 flat_multiset& x, const flat_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 flat_multiset& x, const flat_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 flat_multiset& x, const flat_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 flat_multiset& x, const flat_multiset& y);
//! Effects: x.swap(y)
//!
//! Complexity: Constant.
friend void swap(flat_multiset& x, flat_multiset& y);
//! Effects: Extracts the internal sequence container.
//!
//! Complexity: Same as the move constructor of sequence_type, usually constant.
//!
//! Postcondition: this->empty()
//!
//! Throws: If secuence_type's move constructor throws
sequence_type extract_sequence();
#endif //#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
//! Effects: Discards the internally hold sequence container and adopts the
//! one passed externally using the move assignment.
//!
//! Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
//!
//! Throws: If the comparison or the move constructor throws
BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
{ this->tree_t::adopt_sequence_equal(boost::move(seq)); }
//! Requires: seq shall be ordered according to this->compare()
//!
//! Effects: Discards the internally hold sequence container and adopts the
//! one passed externally using the move assignment.
//!
//! Complexity: Assuming O(1) move assignment, O(1)
//!
//! Throws: If the move assignment throws
BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_range_t, BOOST_RV_REF(sequence_type) seq)
{ this->tree_t::adopt_sequence_equal(ordered_range_t(), boost::move(seq)); }
#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
private:
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(BOOST_FWD_REF(KeyType) x)
{ return this->tree_t::insert_equal(::boost::forward(x)); }
template
BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x)
{ return this->tree_t::insert_equal(p, ::boost::forward(x)); }
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
template
flat_multiset(InputIterator, InputIterator) ->
flat_multiset< it_based_value_type_t >;
template < typename InputIterator, typename AllocatorOrCompare>
flat_multiset(InputIterator, InputIterator, AllocatorOrCompare const&) ->
flat_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>
flat_multiset(InputIterator, InputIterator, Compare const&, Allocator const&) ->
flat_multiset< it_based_value_type_t
, Compare
, Allocator>;
template
flat_multiset(ordered_range_t, InputIterator, InputIterator) ->
flat_multiset< it_based_value_type_t>;
template < typename InputIterator, typename AllocatorOrCompare>
flat_multiset(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
flat_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>
flat_multiset(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
flat_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::flat_tree, Compare, AllocatorOrContainer> tree;
static const bool value = ::boost::has_trivial_destructor_after_move::value;
};
namespace container {
#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
}}
#include
#endif // BOOST_CONTAINER_FLAT_SET_HPP