Boost C++ Libraries Home Libraries People FAQ More

PrevUpHomeNext

Class template flat_multiset

boost::container::flat_multiset

Synopsis

// In header: <boost/container/flat_set.hpp>

template<typename Key, typename Compare = Key>, 
         typename AllocatorOrContainer = new_allocator<Key> > 
class flat_multiset {
public:
  // types
  typedef Key                                                    ;              
  typedef Compare                                                ;           
  typedef Key                                                    ;            
  typedef implementation_defined                                 ;         
  typedef                           ;        
  typedef ::boost::container::allocator_traits<  ; 
  typedef sequence_type::pointer                                 ;               
  typedef sequence_type::const_pointer                           ;         
  typedef sequence_type::reference                               ;             
  typedef sequence_type::const_reference                         ;       
  typedef                                ;             
  typedef                          ;       
  typedef implementation_defined                                 ; 
  typedef implementation_defined                                 ;         
  typedef                                 ;              
  typedef                           ;        
  typedef                         ;      
  typedef                   ;

  // construct/copy/destruct
  () ;
  (const Compare &);
  (const );
  (const Compare &, const );
  template<typename InputIterator> (InputIterator, InputIterator);
  template<typename InputIterator> 
    (InputIterator, InputIterator, const );
  template<typename InputIterator> 
    (InputIterator, InputIterator, const Compare &);
  template<typename InputIterator> 
    (InputIterator, InputIterator, const Compare &, 
                  const );
  template<typename InputIterator> 
    (ordered_range_t, InputIterator, InputIterator);
  template<typename InputIterator> 
    (ordered_range_t, InputIterator, InputIterator, 
                  const Compare &);
  template<typename InputIterator> 
    (ordered_range_t, InputIterator, InputIterator, 
                  const Compare &, const );
  template<typename InputIterator> 
    (ordered_range_t, InputIterator, InputIterator, 
                  const );
  ();
  (, const );
  (, const Compare &);
  (, const Compare &, 
                const );
  (ordered_range_t, );
  (ordered_range_t, , 
                const Compare &);
  (ordered_range_t, , 
                const Compare &, const );
  (const flat_multiset &);
  (flat_multiset &&) ;
  (const flat_multiset &, const );
  (flat_multiset &&, const );
  flat_multiset & (const flat_multiset &);
  flat_multiset & 
  (flat_multiset &&) ;
  flat_multiset & ();

  // public member functions
   () ;
  stored_allocator_type & () ;
  const stored_allocator_type & () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
  bool () ;
   () ;
   () ;
   () ;
  void ();
  void ();
  template< Args>  (Args &&...);
  template< Args>  (, Args &&...);
   (const );
   ();
   (, const );
   (, );
  template<typename InputIterator> void (InputIterator, InputIterator);
  template<typename InputIterator> 
    void (ordered_range_t, InputIterator, InputIterator);
  void ();
  void (ordered_range_t, );
  template<typename C2> 
    void (flat_multiset< Key, C2, AllocatorOrContainer > &);
  template<typename C2> 
    void (flat_multiset< Key, C2, AllocatorOrContainer > &&);
  template<typename C2> 
    void (flat_set< Key, C2, AllocatorOrContainer > &);
  template<typename C2> 
    void (flat_set< Key, C2, AllocatorOrContainer > &&);
   ();
   (const );
   (, );
  void (flat_multiset &) ;
  void () ;
  key_compare () ;
  value_compare () ;
   (const );
   (const ) ;
   () ;
   () ;
   () ;
   () ;
   (const ) ;
  bool (const ) ;
  template<typename K> bool (const K &) ;
   (const );
   (const ) ;
   (const );
   (const ) ;
   
  (const ) ;
   (const );
  sequence_type ();
  void (sequence_type &&);
  void (ordered_range_t, sequence_type &&);
  const sequence_type & () ;

  // friend functions
  bool (const flat_multiset &, const flat_multiset &);
  bool (const flat_multiset &, const flat_multiset &);
  bool (const flat_multiset &, const flat_multiset &);
  bool (const flat_multiset &, const flat_multiset &);
  bool (const flat_multiset &, const flat_multiset &);
  bool (const flat_multiset &, const flat_multiset &);
  void (flat_multiset &, flat_multiset &) ;
};

Description

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.

Template Parameters

  1. typename Key

    is the type to be inserted in the multiset, which is also the key_type

  2. typename Compare = Key>

    is the comparison functor used to order keys

  3. typename AllocatorOrContainer = new_allocator<Key>

    is either:

    • The allocator to allocate value_types (e.g. allocator< std::pair<Key, T> > ). (in this case sequence_type will be vector<value_type, AllocatorOrContainer>)

    • The SequenceContainer to be used as the underlying sequence_type. It must be a vector-like sequence container with random-access iterators.

flat_multiset public construct/copy/destruct

  1. () ;

    Effects: Default constructs an empty container.

    Complexity: Constant.

  2. (const Compare & comp);

    Effects: Constructs an empty container using the specified comparison object.

    Complexity: Constant.

  3. (const  a);

    Effects: Constructs an empty container using the specified allocator.

    Complexity: Constant.

  4. (const Compare & comp, const  a);

    Effects: Constructs an empty container using the specified comparison object and allocator.

    Complexity: Constant.

  5. template<typename InputIterator> 
      (InputIterator first, InputIterator last);

    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.

  6. template<typename InputIterator> 
      (InputIterator first, InputIterator last, 
                    const  a);

    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.

  7. template<typename InputIterator> 
      (InputIterator first, InputIterator last, const Compare & comp);

    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.

  8. template<typename InputIterator> 
      (InputIterator first, InputIterator last, const Compare & comp, 
                    const  a);

    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.

  9. template<typename InputIterator> 
      (ordered_range_t, InputIterator first, InputIterator last);

    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.

  10. template<typename InputIterator> 
      (ordered_range_t, InputIterator first, InputIterator last, 
                    const Compare & comp);

    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.

  11. template<typename InputIterator> 
      (ordered_range_t, InputIterator first, InputIterator last, 
                    const Compare & comp, const  a);

    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.

  12. template<typename InputIterator> 
      (ordered_range_t, InputIterator first, InputIterator last, 
                    const  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.

  13. ( il);

    Effects: Default constructs an empty container.

    Complexity: Constant.

  14. ( il, 
                  const  a);

    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().

  15. ( il, const Compare & comp);

    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().

  16. ( il, const Compare & comp, 
                  const  a);

    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().

  17. (ordered_range_t,  il);

    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.

  18. (ordered_range_t,  il, 
                  const Compare & comp);

    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.

  19. (ordered_range_t,  il, 
                  const Compare & comp, const  a);

    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.

  20. (const flat_multiset & x);

    Effects: Copy constructs the container.

    Complexity: Linear in x.size().

  21. (flat_multiset && x) ;

    Effects: Move constructs thecontainer. Constructs *this using x's resources.

    Complexity: Constant.

    Postcondition: x is emptied.

  22. (const flat_multiset & x, const  a);

    Effects: Copy constructs a container using the specified allocator.

    Complexity: Linear in x.size().

  23. (flat_multiset && x, const  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

  24. flat_multiset & (const flat_multiset & x);

    Effects: Makes *this a copy of x.

    Complexity: Linear in x.size().

  25. flat_multiset & 
    (flat_multiset && 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.

  26. flat_multiset & ( il);

    Effects: Copy all elements from il to *this.

    Complexity: Linear in il.size().

flat_multiset public member functions

  1.  () ;

    Effects: Returns a copy of the allocator that was passed to the object's constructor.

    Complexity: Constant.

  2. stored_allocator_type & () ;

    Effects: Returns a reference to the internal allocator.

    Throws: Nothing

    Complexity: Constant.

    Note: Non-standard extension.

  3. const stored_allocator_type & () ;

    Effects: Returns a reference to the internal allocator.

    Throws: Nothing

    Complexity: Constant.

    Note: Non-standard extension.

  4.  () ;

    Effects: Returns an iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant.

  5.  () ;

    Effects: Returns a const_iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant.

  6.  () ;

    Effects: Returns a const_iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant.

  7.  () ;

    Effects: Returns an iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

  8.  () ;

    Effects: Returns a const_iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

  9.  () ;

    Effects: Returns a const_iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

  10.  () ;

    Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  11.  () ;

    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  12.  () ;

    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  13.  () ;

    Effects: Returns a reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  14.  () ;

    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  15.  () ;

    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

  16. bool () ;

    Effects: Returns true if the container contains no elements.

    Throws: Nothing.

    Complexity: Constant.

  17.  () ;

    Effects: Returns the number of the elements contained in the container.

    Throws: Nothing.

    Complexity: Constant.

  18.  () ;

    Effects: Returns the largest possible size of the container.

    Throws: Nothing.

    Complexity: Constant.

  19.  () ;

    Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

    Throws: Nothing.

    Complexity: Constant.

  20. void ( cnt);

    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.

  21. void ();
    Effects: Tries to deallocate the excess of memory created

    Throws: If memory allocation throws, or Key's copy constructor throws.

    Complexity: Linear to size().

  22. template< Args>  (Args &&... args);

    Effects: Inserts an object of type Key constructed with std::forward<Args>(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.

  23. template< Args> 
       ( p, Args &&... args);

    Effects: Inserts an object of type Key constructed with std::forward<Args>(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.

  24.  (const  x);

    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.

  25.  ( 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.

  26.  ( p, const  x);

    Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic 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.

  27.  ( p,  x);

    Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic 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.

  28. template<typename InputIterator> 
      void (InputIterator first, InputIterator last);

    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.

  29. template<typename InputIterator> 
      void (ordered_range_t, InputIterator first, InputIterator 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.

  30. void ( il);

    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.

  31. void (ordered_range_t,  il);

    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.

  32. template<typename C2> 
      void (flat_multiset< Key, C2, AllocatorOrContainer > & source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Move-inserts each element from source into *this a using the comparison object of *this.

    Complexity: Linear in this->size() + source.size().

    Note: Invalidates all iterators and references.

  33. template<typename C2> 
      void (flat_multiset< Key, C2, AllocatorOrContainer > && source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Move-inserts each element from source into *this a using the comparison object of *this.

    Complexity: Linear in this->size() + source.size().

    Note: Invalidates all iterators and references.

  34. template<typename C2> 
      void (flat_set< Key, C2, AllocatorOrContainer > & source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Move-inserts each element from source into *this a using the comparison object of *this.

    Complexity: Linear in this->size() + source.size().

    Note: Invalidates all iterators and references.

  35. template<typename C2> 
      void (flat_set< Key, C2, AllocatorOrContainer > && source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Move-inserts each element from source into *this a using the comparison object of *this.

    Complexity: Linear in this->size() + source.size().

    Note: Invalidates all iterators and references.

  36.  ( p);

    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.

  37.  (const  x);

    Effects: If present, erases the element in the container with key equivalent to x.

    Returns: Returns the number of erased elements (0/1).

    Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

  38.  ( first,  last);

    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.

  39. void (flat_multiset & x) ;

    Effects: Swaps the contents of *this and x.

    Throws: Nothing.

    Complexity: Constant.

  40. void () ;

    Effects: erase(begin(),end()).

    Postcondition: size() == 0.

    Complexity: linear in size().

  41. key_compare () ;

    Effects: Returns the comparison object out of which a was constructed.

    Complexity: Constant.

  42. value_compare () ;

    Effects: Returns an object of value_compare constructed out of the comparison object.

    Complexity: Constant.

  43.  (const  x);

    Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

    Complexity: Logarithmic.

  44.  (const  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.

  45.  ( n) ;

    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

  46.  ( n) ;

    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

  47.  ( p) ;

    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

  48.  ( p) ;

    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

  49.  (const  x) ;

    Returns: The number of elements with key equivalent to x.

    Complexity: log(size())+count(k)

  50. bool (const  x) ;

    Returns: Returns true if there is an element with key equivalent to key in the container, otherwise false.

    Complexity: log(size()).

  51. template<typename K> bool (const K & x) ;

    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()).

  52.  (const  x);

    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

  53.  (const  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

  54.  (const  x);

    Returns: An iterator pointing to the first element with key greater than x, or end() if such an element is not found.

    Complexity: Logarithmic

  55.  (const  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

  56.  
    (const  x) ;

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

  57.  (const  x);

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

  58. sequence_type ();

    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

  59. void (sequence_type && seq);

    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

  60. void (ordered_range_t, sequence_type && 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

  61. const sequence_type & () ;

    Effects: Returns a const view of the underlying sequence.

    Complexity: Constant

    Throws: Nothing

flat_multiset friend functions

  1. bool (const flat_multiset & x, const flat_multiset & y);

    Effects: Returns true if x and y are equal

    Complexity: Linear to the number of elements in the container.

  2. bool (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.

  3. bool (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.

  4. bool (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.

  5. bool (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.

  6. bool (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.

  7. void (flat_multiset & x, flat_multiset & y) ;

    Effects: x.swap(y)

    Complexity: Constant.


PrevUpHomeNext