![]() |
Home | Libraries | People | FAQ | More |
boost::container::multimap
// In header: <boost/container/map.hpp> template<typename Key, typename T, typename Compare, typename Allocator = new_allocator< , typename Options> class multimap { public: // types typedef ; typedef ; typedef ; typedef ::boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef boost::container::allocator_traits< ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; // construct/copy/destruct () ; (); (); (, ); template<typename InputIterator> (, ); template<typename InputIterator> (, , ); template<typename InputIterator> (, , ); template<typename InputIterator> (, , , ); template<typename InputIterator> (ordered_range_t, , ); template<typename InputIterator> (ordered_range_t, , , ); template<typename InputIterator> (ordered_range_t, , , , ); template<typename InputIterator> (ordered_range_t, , , ); (); (, ); (, ); (, , ); (ordered_range_t, ); (ordered_range_t, , ); (ordered_range_t, , , ); (multimap &); (multimap &&) ; (multimap &, ); (multimap &&, ); multimap & (multimap &); multimap & (multimap &&) ; multimap & (); // public member functions ((); () ; (); () ; (); () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; template< Args> (); template< Args> (, ); (); (); (); (); (, ); (, ); (, ); (, ); template<typename InputIterator> (, ); (); (); (, ); (); (); (, ); (); (); template<typename C2> (multimap< ); template<typename C2> (multimap< ); template<typename C2> (map< ); template<typename C2> (map< ); (multiset &) ; () ; () ; () ; (); () ; template<typename K> (); template<typename K> () ; () ; template<typename K> () ; () ; template<typename K> () ; (); () ; template<typename K> (); template<typename K> () ; (); () ; template<typename K> (); template<typename K> () ; (); () ; template<typename K> (); template<typename K> () ; (); // friend functions (multimap &, multimap &); (multimap &, multimap &); (multimap &, multimap &); (multimap &, multimap &); (multimap &, multimap &); (multimap &, multimap &); (multimap &, multimap &); };
A 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. The multimap class supports bidirectional iterators.
A multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. The value_type
stored by this container is the value_type is std::pair<const Key, T>.
typename Key
is the key_type of the map
typename T
typename Compare
is the ordering function for Keys (e.g. std::less<Key>).
typename Allocator = new_allocator<
is the allocator to allocate the value_type
s (e.g. allocator< std::pair<const Key, T> > ).
typename Options
is an packed option type generated using using boost::container::tree_assoc_options
.
multimap
public
construct/copy/destruct() ;
Effects: Default constructs an empty multimap.
Complexity: Constant.
( a);
Effects: Constructs an empty multimap using the specified allocator object and allocator.
Complexity: Constant.
( comp);
Effects: Constructs an empty multimap using the specified comparison.
Complexity: Constant.
( comp, a);
Effects: Constructs an empty multimap using the specified comparison and allocator.
Complexity: Constant.
template<typename InputIterator> ( first, last);
Effects: Constructs an empty 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> ( first, last, a);
Effects: Constructs an empty 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> ( first, last, comp);
Effects: Constructs an empty 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> ( first, last, comp, a);
Effects: Constructs an empty 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, first, last);
Effects: Constructs an empty 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, first, last, comp);
Effects: Constructs an empty 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, first, last, comp, a);
Effects: Constructs an empty 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, first, last, a);
Effects: Constructs an empty multimap 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.
( il);
Effects: Constructs an empty multimap and and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
( il, a);
Effects: Constructs an empty multimap using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
( il, comp);
Effects: Constructs an empty multimap using the specified comparison object and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
( il, comp, a);
Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
(ordered_range_t, il);
Effects: Constructs an empty map 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, comp);
Effects: Constructs an empty map 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, comp, a);
Effects: Constructs an empty map 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.
(multimap & x);
Effects: Copy constructs a multimap.
Complexity: Linear in x.size().
(multimap && x) ;
Effects: Move constructs a multimap. Constructs *this using x's resources.
Complexity: Constant.
Postcondition: x is emptied.
(multimap & x, a);
Effects: Copy constructs a multimap.
Complexity: Linear in x.size().
(multimap && x, a);
Effects: Move constructs a multimap using the specified allocator. Constructs *this using x's resources. Complexity: Constant if a == x.get_allocator(), linear otherwise.
Postcondition: x is emptied.
multimap & (multimap & x);
Effects: Makes *this a copy of x.
Complexity: Linear in x.size().
multimap & (multimap && x) ;
Effects: this->swap(x.get()).
Complexity: Constant.
multimap & ( il);
Effects: Assign content of il to *this.
multimap
public member functions(();
() ;
Effects: Returns a copy of the allocator that was passed to the object's constructor.
Complexity: Constant.
();
Effects: Returns a reference to the internal allocator.
Throws: Nothing
Complexity: Constant.
Note: Non-standard extension.
() ;
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 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 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 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_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
() ;
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.
template< 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 in general, but amortized constant if t is inserted right before p.
template< Args> ( p, 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 in general, but amortized constant if t is inserted right before p.
( x);
Effects: Inserts x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic.
( x);
Effects: Inserts a new value constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic.
( x);
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic.
( x);
Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.
Complexity: Logarithmic.
( p, 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 in general, but amortized constant if t is inserted right before p.
( p, x);
Effects: Inserts a new 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 in general, but amortized constant if t is inserted right before p.
( 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 in general, but amortized constant if t is inserted right before p.
( 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 in general, but amortized constant if t is inserted right before p.
template<typename InputIterator> ( first, last);
Requires: first, last are not iterators into *this.
Effects: inserts each element from the range [first,last) .
Complexity: At most N log(size()+N) (N is the distance from first to last)
( il);
Effects: inserts each element from the range [il.begin(), il.end().
Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())
( nh);
Requires: nh is empty or this->get_allocator() == nh.get_allocator().
Effects/Returns: If nh is empty, has no effect and returns end(). Otherwise, inserts the element owned by nh and returns an iterator pointing to the newly inserted element. If a range containing elements with keys equivalent to nh.key() exists, the element is inserted at the end of that range. nh is always emptied.
Complexity: Logarithmic
( hint, nh);
Effects: Same as insert(node_type && nh)
but the element is inserted as close as possible to the position just prior to "hint".
Complexity: logarithmic in general, but amortized constant if the element is inserted right before "hint".
( 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: Amortized constant time
( x);
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k)
( first, last);
Effects: Erases all the elements in the range [first, last).
Returns: Returns last.
Complexity: log(size())+N where N is the distance from first to last.
( k);
Effects: Removes the first element in the container with key equivalent to k.
Returns: A node_type owning the element if found, otherwise an empty node_type.
Complexity: log(size()).
( position);
Effects: Removes the element pointed to by "position".
Returns: A node_type owning the element, otherwise an empty node_type.
Complexity: Amortized constant.
template<typename C2> (multimap< source);
Requires: this->get_allocator() == source.get_allocator().
Effects: Extracts each element in source and insert it into a using the comparison object of *this.
Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.
Throws: Nothing unless the comparison object throws.
Complexity: N log(size() + N) (N has the value source.size())
template<typename C2> (multimap< source);
Requires: this->get_allocator() == source.get_allocator().
Effects: Extracts each element in source and insert it into a using the comparison object of *this.
Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.
Throws: Nothing unless the comparison object throws.
Complexity: N log(size() + N) (N has the value source.size())
template<typename C2> (map< source);
Requires: this->get_allocator() == source.get_allocator().
Effects: Extracts each element in source and insert it into a using the comparison object of *this.
Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.
Throws: Nothing unless the comparison object throws.
Complexity: N log(size() + N) (N has the value source.size())
template<typename C2> (map< source);
Requires: this->get_allocator() == source.get_allocator().
Effects: Extracts each element in source and insert it into a using the comparison object of *this.
Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.
Throws: Nothing unless the comparison object throws.
Complexity: N log(size() + N) (N has the value source.size())
(multiset & x) ;
Effects: Swaps the contents of *this and x.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: erase(begin(),end()).
Postcondition: size() == 0.
Complexity: linear in size().
() ;
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant.
() ;
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant.
( 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.
( 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.
template<typename 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> ( 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.
( x) ;
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k)
template<typename 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)
( 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> ( 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()).
( 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
( 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
template<typename 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> ( 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
( 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
( 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> ( 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> ( 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
( x);
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic
( x) ;
Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
Complexity: Logarithmic
template<typename 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> ( 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
();
Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.
Complexity: Linear
multimap
friend functions(multimap & x, multimap & y);
Effects: Returns true if x and y are equal
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: Returns true if x and y are unequal
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: Returns true if x is less than y
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: Returns true if x is greater than y
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: Returns true if x is equal or less than y
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: Returns true if x is equal or greater than y
Complexity: Linear to the number of elements in the container.
(multimap & x, multimap & y);
Effects: x.swap(y)
Complexity: Constant.