![]() |
Home | Libraries | People | FAQ | More |
boost::container::flat_multimap
// In header: <boost/container/flat_map.hpp> template<typename Key, typename T, typename Compare = Key>, typename AllocatorOrContainer = new_allocator< Key, T> > > class flat_multimap { public: // types typedef Key ; typedef T ; typedef Compare ; typedef Key, T > ; 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 ; typedef implementation_defined ; // construct/copy/destruct () ; (const ); (const Compare &); (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_multimap &); (flat_multimap &&) ; (const flat_multimap &, const ); (flat_multimap &&, const ); flat_multimap & (const flat_multimap &); flat_multimap & (flat_multimap &&) ; flat_multimap & (); // public member functions ((Key, T >, ); () ; stored_allocator_type & () ; const stored_allocator_type & () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; bool () ; () ; () ; () ; void (); void (); () ; () ; () ; () ; template< Args> (Args &&...); template< Args> (, Args &&...); (const ); template<typename Pair> (Pair &&); (, const ); template<typename Pair> (, Pair &&); 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_multimap< Key, T, C2, AllocatorOrContainer > &); template<typename C2> void (flat_multimap< Key, T, C2, AllocatorOrContainer > &&); template<typename C2> void (flat_map< Key, T, C2, AllocatorOrContainer > &); template<typename C2> void (flat_map< Key, T, C2, AllocatorOrContainer > &&); (); (const key_type &); (, ); void (flat_multimap &) ; void () ; key_compare () ; value_compare () ; (const key_type &); (const key_type &) ; template<typename K> (const K &); template<typename K> (const K &) ; (const key_type &) ; template<typename K> (const K &) ; bool (const key_type &) ; template<typename K> bool (const K &) ; (const key_type &); (const key_type &) ; template<typename K> (const K &); template<typename K> (const K &) ; (const key_type &); (const key_type &) ; template<typename K> (const K &); template<typename K> (const K &) ; (const key_type &); (const key_type &) ; template<typename K> (const K &); template<typename K> (const K &) ; sequence_type (); void (sequence_type &&); void (ordered_range_t, sequence_type &&); const sequence_type & () ; // friend functions bool (const flat_multimap &, const flat_multimap &); bool (const flat_multimap &, const flat_multimap &); bool (const flat_multimap &, const flat_multimap &); bool (const flat_multimap &, const flat_multimap &); bool (const flat_multimap &, const flat_multimap &); bool (const flat_multimap &, const flat_multimap &); void (flat_multimap &, flat_multimap &) ; };
A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys.
A flat_multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. For a flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::multimap<Key, T> which value_type is std::pair<const Key, T>).
flat_multimap is similar to std::multimap 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_multimap 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.
typename Key
is the key_type of the map
typename T
typename Compare = Key>
is the ordering function for Keys (e.g. std::less<Key>).
typename AllocatorOrContainer = new_allocator< Key, T> >
is either:
The allocator to allocate value_type
s (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_multimap
public
construct/copy/destruct() ;
Effects: Default constructs an empty flat_map
.
Complexity: Constant.
(const a);
Effects: Constructs an empty flat_multimap
using the specified allocator.
Complexity: Constant.
(const Compare & comp);
Effects: Constructs an empty flat_multimap
using the specified comparison object .
Complexity: Constant.
(const Compare & comp, const a);
Effects: Constructs an empty flat_multimap
using the specified comparison object and allocator.
Complexity: Constant.
template<typename InputIterator> (InputIterator first, InputIterator last);
Effects: Constructs an empty flat_multimap
and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.
template<typename InputIterator> (InputIterator first, InputIterator last, const a);
Effects: Constructs an empty flat_multimap
using the specified allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.
template<typename InputIterator> (InputIterator first, InputIterator last, const Compare & comp);
Effects: Constructs an empty flat_multimap
using the specified comparison object and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.
template<typename InputIterator> (InputIterator first, InputIterator last, const Compare & comp, const a);
Effects: Constructs an empty flat_multimap
using the specified comparison object and allocator, and inserts elements from the range [first ,last ).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.
template<typename InputIterator> (ordered_range_t, InputIterator first, InputIterator last);
Effects: Constructs an empty flat_multimap
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<typename InputIterator> (ordered_range_t, InputIterator first, InputIterator last, const Compare & comp);
Effects: Constructs an empty flat_multimap
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<typename InputIterator> (ordered_range_t, InputIterator first, InputIterator last, const Compare & comp, const a);
Effects: Constructs an empty flat_multimap
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<typename InputIterator> (ordered_range_t, InputIterator first, InputIterator last, const a);
Effects: Constructs an empty flat_multimap
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.
( il);
Effects: Constructs an empty flat_map
and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
( il, const a);
Effects: Constructs an empty flat_map
using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
( il, const Compare & comp);
Effects: Constructs an empty flat_map
using the specified comparison object and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
( il, const Compare & comp, const a);
Effects: Constructs an empty flat_map
using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
(ordered_range_t, il);
Effects: Constructs an empty flat_multimap
and inserts elements from the ordered 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.
(ordered_range_t, il, const Compare & comp);
Effects: Constructs an empty flat_multimap
using the specified comparison object and inserts elements from the ordered 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.
(ordered_range_t, il, const Compare & comp, const a);
Effects: Constructs an empty flat_multimap
using the specified comparison object and allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
Requires: [il.begin(), il.end()) must be ordered according to the predicate.
Complexity: Linear in N.
Note: Non-standard extension.
(const flat_multimap & x);
Effects: Copy constructs a flat_multimap
.
Complexity: Linear in x.size().
(flat_multimap && x) ;
Effects: Move constructs a flat_multimap
. Constructs *this using x's resources.
Complexity: Constant.
Postcondition: x is emptied.
(const flat_multimap & x, const a);
Effects: Copy constructs a flat_multimap
using the specified allocator.
Complexity: Linear in x.size().
(flat_multimap && x, const a);
Effects: Move constructs a flat_multimap
using the specified allocator. Constructs *this using x's resources.
Complexity: Constant if a == x.get_allocator(), linear otherwise.
flat_multimap & (const flat_multimap & x);
Effects: Makes *this a copy of x.
Complexity: Linear in x.size().
flat_multimap & (flat_multimap && x) ;
Effects: this->swap(x.get()).
Complexity: Constant.
flat_multimap & ( il);
Effects: Assign content of il to *this
Complexity: Linear in il.size().
flat_multimap
public member functions((Key, T >, );
() ;
Effects: Returns a copy of the allocator that was passed to the object's constructor.
Complexity: Constant.
stored_allocator_type & () ;
Effects: Returns a reference to the internal allocator.
Throws: Nothing
Complexity: Constant.
Note: Non-standard extension.
const stored_allocator_type & () ;
Effects: Returns a reference to the internal allocator.
Throws: Nothing
Complexity: Constant.
Note: Non-standard extension.
() ;
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
bool () ;
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().
Throws: Nothing.
Complexity: Constant.
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.
void ();Effects: Tries to deallocate the excess of memory created
Throws: If memory allocation throws, or T's copy constructor throws.
Complexity: Linear to size().
( 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
( 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
( 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
( 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
template< Args> (Args &&... args);
Effects: Inserts an object of type T 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.
template< Args> ( hint, Args &&... args);
Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.
Returns: An iterator pointing to the element with key equivalent to the key of x.
Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element is inserted it might invalidate elements.
(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.
template<typename Pair> (Pair && x);
Effects: Inserts a new value 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.
( 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 time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element is inserted it might invalidate elements.
template<typename Pair> ( p, Pair && x);
Effects: Inserts a value 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 time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.
Note: If an element is inserted it might invalidate elements.
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.
template<typename InputIterator> void (ordered_range_t, InputIterator first, InputIterator last);
Requires: first, last are not iterators into *this.
Requires: [first ,last) must be ordered according to the predicate.
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. This function is more efficient than the normal range creation for ordered ranges.
Complexity: Linear.
Note: If an element is inserted it might invalidate elements.
Note: Non-standard extension.
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.
void (ordered_range_t, il);
Requires: [il.begin(), il.end()) must be ordered according to the predicate.
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. This function is more efficient than the normal range creation for ordered ranges.
Complexity: Linear.
Note: If an element is inserted it might invalidate elements.
Note: Non-standard extension.
template<typename C2> void (flat_multimap< Key, T, 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.
template<typename C2> void (flat_multimap< Key, T, 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.
template<typename C2> void (flat_map< Key, T, 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.
template<typename C2> void (flat_map< Key, T, 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.
( 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.
(const key_type & x);
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.
( 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.
void (flat_multimap & x) ;
Effects: Swaps the contents of *this and x.
Throws: Nothing.
Complexity: Constant.
void () ;
Effects: erase(begin(),end()).
Postcondition: size() == 0.
Complexity: linear in size().
key_compare () ;
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant.
value_compare () ;
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant.
(const key_type & 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.
(const key_type & x) ;
Returns: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic.
template<typename K> (const K & x);
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<typename K> (const K & x) ;
Requires: This overload is available only if key_compare::is_transparent exists.
Returns: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.
Complexity: Logarithmic.
(const key_type & x) ;
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k)
template<typename K> (const K & x) ;
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)
bool (const key_type & x) ;
Returns: Returns true if there is an element with key equivalent to key in the container, otherwise false.
Complexity: log(size()).
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()).
(const key_type & 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
(const key_type & 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
template<typename K> (const K & x);
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<typename K> (const K & x) ;
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
(const key_type & 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
(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
template<typename K> (const K & x);
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<typename K> (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
(const key_type & x);
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic
(const key_type & x) ;
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic
template<typename K> (const K & 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<typename K> (const K & 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
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
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
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
const sequence_type & () ;
Effects: Returns a const view of the underlying sequence.
Complexity: Constant
Throws: Nothing
flat_multimap
friend functionsbool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x and y are equal
Complexity: Linear to the number of elements in the container.
bool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x and y are unequal
Complexity: Linear to the number of elements in the container.
bool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x is less than y
Complexity: Linear to the number of elements in the container.
bool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x is greater than y
Complexity: Linear to the number of elements in the container.
bool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x is equal or less than y
Complexity: Linear to the number of elements in the container.
bool (const flat_multimap & x, const flat_multimap & y);
Effects: Returns true if x is equal or greater than y
Complexity: Linear to the number of elements in the container.
void (flat_multimap & x, flat_multimap & y) ;
Effects: x.swap(y)
Complexity: Constant.