Typedef for allocator used by the container.

Typedef for const Val *.

Typedef for const Val &.

Typedef for an STL style const reverse iterator.

Typedef for integral type used to represent the distance between two elements.

Typedef for the key lessthan comparison object type.

Typedef for Key.

Typedef for Val.

Typedef for Val *.

Typedef for Val &.

Typedef for an STL style reverse iterator.

Typedef for a signed integer of the appropriate size for your platform.

Typedef for Val.

Constructs an empty QMultiMap.

Copy constructs a new QMultiMap from other.

Move constructs a new QMultiMap from other.

Constructs a multimap with a copy of each of the elements in the initializer list.

If the function object compare is passed it will be called when sorting keys in the container. Refer to Overriding Sort Order for more information about this template parameter.

Constructs an empty multimap using the function object compare. Refer to Overriding Sort Order for more information about this parameter.

Constructs a copy of other.

See also

toStdMultiMap()

Constructs a multimap containing copies of the elements between first and last.

If the function object compare is passed it will be called when sorting keys in the container. Refer to Overriding Sort Order for more information about this template parameter.

Destroys the multimap.

Returns an STL style iterator pointing to the first item in the multimap.

See also

constBegin(), end()

Returns a const STL style iterator pointing to the first item in the multimap.

Returns a const STL style iterator pointing to the first item in the multimap.

See also

begin(), cend()

Returns a const STL style iterator pointing to the imaginary item after the last item in the multimap.

See also

cbegin(), end()

Removes all items from the multimap.

See also

remove()

Returns a const STL style iterator pointing to the first item in the multimap.

See also

begin(), constEnd()

Returns a const STL style iterator pointing to the imaginary item after the last item in the multimap.

See also

constBegin(), end()

Returns an const iterator pointing to the item with key in the multimap. If the multimap contains no item with key this method returns constEnd().

See also

find()

Returns an iterator pointing to the item with key and the given value in the multimap. If the multimap contains no such item the method returns constEnd().

See also

find()

Returns true if the multimap contains an item with given key, otherwise it returns false.

See also

count()

Returns true if the multimap contains an item with the given key and value, otherwise it returns false.

See also

contains()

Equivalent to calling size().

Returns the number of items associated with the given key.

See also

contains(), insertMulti()

Returns the number of items with the given key and value.

Returns a const STL-style reverse iterator pointing to the first item in the multimap, in reverse order.

See also

begin(), rbegin(), rend()

Returns a const STL style reverse iterator pointing to one past the last item in the multimap, in reverse order.

See also

end(), rend(), rbegin()

Equivalent to calling isEmpty().

Returns an STL style iterator pointing to the imaginary item after the last item in the multimap.

See also

begin(), constEnd()

Returns a const STL style iterator pointing to the imaginary item after the last item in the multimap.

Returns a pair of iterators corresponding to the range of items [first, second) which have the given key. If the range is empty then both iterators will be equal to end().

Returns a pair of iterators corresponding to the range of items [first, second) which have the given key. If the range is empty then both iterators will be equal to end().

Removes the (key, value) pair pointed to by the iterator iter from the multimap and returns an iterator to the next item in the multimap.

This method assumes the iterator is valid and refers to an element in the multimap. It will not check if iter points past the end of the multimap or is equal to the end() iterator.

See also

remove()

Returns an iterator pointing to the item with key in the multimap. If the multimap contains no item with key, the method returns end().

See also

constFind(), value(), values(), lowerBound(), upperBound()

This is an overloaded method.

Returns an iterator pointing to the item with key and value in the multimap. If the multimap contains no such item, the method returns end().

If the multimap contains multiple items with key this method returns an iterator that points to the most recently inserted value.

Returns a const iterator pointing to the item with the given key and value in the multimap. If the multimap contains no such item, the method returns end().

If the multimap contains multiple items with the specified key this method returns a const iterator that points to the most recently inserted value.

Returns a reference to the first value in the multimap. This method assumes the multimap is not empty.

Returns a const reference to the first value in the multimap. This method assumes the multimap is not empty.

Returns a const reference to the first key in the multimap. This method assumes the multimap is not empty.

Inserts a new item with the given key and a value. If there is already an item with the same key in the multimap, this method will create a new item.

This behavior is different from replace() which overwrites the value of an existing item.

See also

replace()

Inserts a new item with key and value from data, which is an std::pair. If there is already an item with the same key in the multimap, this method will create a new item.

This behavior is different from replace() which overwrites the value of an existing item.

Inserts a new item with the given key and value using hint as a suggestion about where to do the insert. If there is already an item with the same key in the multimap, this method will create a new item.

See also

insertMulti()

Inserts a new item with the given key and value. If there is already an item with the same key, a new one will still be added.

See also

insert(), values()

Inserts a new item with the given key and value using hint as a suggestion about where to do the insert. If there is already an item with the same key, a new one will still be added.

See also

insertMulti()

Returns true if the multimap contains no items, otherwise it returns false.

See also

size()

Returns the first key with value. If the multimap contains no item with value then defaultKey is returned. If no defaultKey was passed it will be value initialized using the data type of Key. Refer to default constructed elements for additional information.

This method can be slow (linear time), because the internal data structure is optimized for fast lookup by key, not by value.

See also

value(), keys()

Returns a list containing all the keys in the multimap in ascending order. To obtain a list of unique keys, where each key from the multimap only occurs once use uniqueKeys(). The order is guaranteed to be the same as returned by values().

Keys which occur multiple times in the multimap (because items were inserted with insertMulti() or unite()) will also occur multiple times in this list.

See also

uniqueKeys(), values(), key()

Returns a list containing all the keys associated with the given value in ascending order.

This method can be slow because the internal data structure is optimized for fast lookup by key, not by value. Refer to linear time.

Returns a reference to the last value in the multimap. This method assumes the map is not empty.

Returns a const reference to the last value in the multimap. This method assumes the map is not empty.

Returns a const reference to the last key in the multimap. This method assumes the map is not empty.

Returns an iterator pointing to the first item with key in the multimap. If the multimap contains no item with key then the method returns an iterator to the nearest item with a greater key.

If the multimap contains multiple items with the same key then this method will return an iterator which points to the most recently inserted value. The other values are accessible by incrementing the iterator. For example, the following code iterates over all the items with the same key.

See also

upperBound(), find()

This is an overloaded method.

Returns true if other is not equal to this multimap, otherwise it returns false. Two multimaps are considered equal if they contain the same (key, value) pairs.

This method requires the type T to support operator==().

See also

operator==()

Returns a multimap that contains all the items in this multimap in addition to all the items in other. If a key is common to both multimaps the resulting multimap will contain the key multiple times.

See also

operator+=()

Inserts all the items in the other multimap into this map and returns a reference to this multimap.

See also

insert(), operator+()

Copy assigns from other and returns a reference to this object.

Move assigns from other and returns a reference to this object.

Returns true if other is equal to this multimap, otherwise it returns false. Two multimaps are considered equal if they contain the same (key, value) pairs.

This method requires the type T to support operator==().

See also

operator!=()

Returns a reference to the value for the item with the given key. If no item with key is found, a new value initialized object of type Val with the given key is inserted. Refer to default constructed elements for additional information.

See also

insert(), value()

Returns a copy of the value associated with the key. If the key was not found, then a value initialized object of type Val will be returned. Refer to default constructed elements for additional information.

See also

insert(), value()

This is an overloaded method.

Returns a STL style reverse iterator pointing to the first item in the multimap, in reverse order.

See also

begin(), crbegin(), rend()

Removes all the items which have the given key. Returns the number of items removed which is usually 1, however this will be 0 if the key is not in the multimap, or greater than 1 if insertMulti() has been used with the key.

See also

clear(), take()

Removes all the items which have the given key and value. Returns the number of items removed.

Returns a STL style reverse iterator pointing to one past the last item in the multimap, in reverse order.

See also

end(), crend(), rbegin()

This is an overloaded method.

Inserts a new item with the given key and value. If there is already an item with the key key, that item's value is replaced with value.

If there are multiple items with the key, the most recently inserted item's value is replaced with value.

See also

insert()

Returns the number of (key, value) pairs in the multimap.

See also

isEmpty(), count()

Swaps multimap other with this multimap. This operation is very fast and never fails.

Removes the item with the given key from the multimap and returns the value which was associated with it. If there are multiple items for key in the multimap, the most recently inserted one is removed and returned. If you do not use the return value remove() is more efficient.

If the multimap contains no item with key, then a value initialized object of type Val is returned. Refer to default constructed elements for additional information.

See also

remove()

Returns an STL multimap equivalent to this QMultiMap.

Returns a list containing all the keys in the multimap in ascending order. Keys that occur multiple times in the multimap (because items were inserted with insertMulti(), or unite() was used) occur only once in the returned list.

See also

keys(), values()

Inserts all the items in the other multimap into this multimap. If a key is common to both multimaps, the resulting map will contain the key multiple times.

See also

insertMulti()

Returns an iterator pointing to the item which immediately follows the last item with key in the multimap. If the map contains no item with key, the method returns an iterator to the nearest item with a greater key.

See also

lowerBound(), find()

This is an overloaded method.

Returns the value associated with the given key. If there are multiple items for key in the multimap, the value of the most recently inserted one is returned. If no item with key is found then a value initialized object is returned. Refer to default constructed elements for additional information.

See also

key(), values(), contains(), operator[]()

Returns the value associated with the key. If the multimap contains no item with key then the defaultValue is returned.

Returns a list containing all the values in the multimap, in ascending order of their keys. If a key is associated with multiple values then all of its values will be in the list.

See also

keys(), value()

Returns a list containing all the values associated with key, from the most recently inserted to the least recently inserted one.

See also

count(), insertMulti()

Writes the given map to the stream. Returns a reference to the stream. This function requires the key and value types to implement operator<<().

Refer to Serializing Data Types for additional information.

Reads from the stream into the given map. Returns a reference to the stream. This function requires the key and value types to implement operator>>().

Refer to Serializing Data Types for additional information.