Typedef for const Val *.

Typedef for const Val &.

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

Typedef for the multihash object type.

Typedef for the key equality comparison object type.

Typedef for Key.

Typedef for Val.

Typedef for Val *.

Typedef for Val &.

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

Typedef for Val.

Constructs an empty QMultiHash.

Copy constructs a new QMultiHash from other.

Move constructs a new QMultiHash from other.

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

Constructs a multihash using the given hash and keyEqual.

Constructs a new QMultiHash which contains copies of the items in other.

Move constructs a new QMultiHash using the items in other.

Constructs a multihash containing copies of the items between the first and last iterators.

Destroys the QMultiHash.

Returns a STL-style iterator pointing to the first item in the multihash.

See also

constBegin(), end()

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

Returns the number of buckets in the QHash's internal hash table.

The purpose of this method is to provide a means of fine tuning QHash's memory usage. In general, you will rarely ever need to call this method. If you want to know how many items are in the hash call size().

See also

reserve(), squeeze()

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

See also

begin(), cend()

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

See also

cbegin(), end()

Removes all items in this multihash.

See also

remove()

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

See also

begin(), constEnd()

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

See also

constBegin(), end()

Returns a const iterator pointing to the item with the given key. If the multihash contains no matching items, returns constEnd().

See also

find()

Returns a const iterator pointing to the item with the given key and the value. If the multihash contains no matching items, returns constEnd().

See also

constFind()

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

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

Returns the number of items in this multihash. Equivalent to calling size().

Returns the number of items which have the given key.

See also

contains(), insertMulti()

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

Equivalent to calling isEmpty().

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

See also

begin(), constEnd()

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

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 const 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 multihash and returns an iterator to the next item in the multihash.

This method assumes the iterator is valid and refers to an element in the multihash. It will not check if iter points past the end or is equal to the end() iterator. This method does not cause QMultiHash to rehash its internal data structure. This means the method can safely be called while iterating and will not affect the order of items in the multihash.

See also

remove(), take(), find()

Returns an iterator pointing to the item with the key in the multihash. If the multihash contains no matching items, returns end().

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

See also

value(), values()

Returns a const iterator pointing to the item with the key. If the multihash contains no matching item, returns end().

Returns an iterator pointing to the item with the given key and value. If the multihash contains no matching items, returns end(). If the multihash contains multiple items with the same key and value, the iterator returned points to some matching item.

See also

QMultiHash::find()

Returns a const iterator pointing to the item with the given key and value. If the multihash contains no matching items, returns end(). If the multihash contains multiple items with the same key and value, the iterator returned points to some matching item.

Inserts a new item with the key and a value of value. If there is already an item with the same key this method will create a new entry. This behavior is very 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 this method will create a new entry. This behavior is very different from replace() which overwrites the value of an existing item.

Inserts a new item with the key and a value of value. If there is already an item with the same key this method will create a new entry. This behavior is very different from insert() which overwrites the value of an existing item.

See also

insert(), values()

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

See also

size()

Returns the first key mapped to value. If no item with the given value is found then a new value initialized object of type Key is returned. 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 the key of the first item matching the given value. Otherwise, returns the given defaultKey.

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

Returns a list containing all the keys in the multihash in an arbitrary order. Keys which occur multiple times, will also occur multiple times in the list. To obtain a list of unique keys, where each key from the multihash only occurs once, use uniqueKeys().

The order is guaranteed to be the same as when calling values().

See also

uniqueKeys(), values(), key()

Returns a list containing all the keys matching the given value in an arbitrary order.

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

Returns true if other is not equal to this hash otherwise it returns false. Two hashes 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 multihash which contains all of the items in this multihash plus all the items in other. If a key is common to both, the new multihash will contain the key multiple times.

See also

operator+=()

Inserts all the items in the given other multihash into this multihash, returns a reference to this multihash.

See also

insert()

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 hash, otherwise it returns false. Two hashes 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 element with the given key. If the multihash contains multiple items with the same key, this method will return a reference to the most recently inserted value. If the key was not found then a new value initialized object of type Val with the given key is inserted. A reference to the new element will be returned. Refer to default constructed elements for additional information.

See also

insert(), value()

Equivalent to calling value().

Removes all the items matching the given key. Returns the number of items removed.

See also

clear(), take(), QMultiHash::remove()

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

See also

QMultiHash::remove()

Inserts a new item with the given key and value.

If there is already an item with the same key, then the value is replaced with the new given value. If there are multiple items with the same key, only the most recently inserted item's value is replaced with the given value.

See also

insert()

Ensures the internal hash table consists of at least size buckets. This method is useful for code which needs to build a huge hash and wants to avoid repeated reallocation.

Ideally, size should be slightly more than the maximum number of items expected in the hash. The size does not have to be prime, because QMultiHash will use a prime number internally. If size is an underestimate, the worst that will happen is that the QMultiHash will be a bit slower. You will rarely need to call this method. The internal hash table automatically shrinks or grows to provide good performance without wasting too much memory.

See also

squeeze(), capacity()

Returns the number of items in the multihash.

See also

isEmpty(), count()

Reduces the size of the internal multihash table to save memory. The sole purpose of this method is to provide a means of fine tuning the memory usage. You will rarely need to call this method.

See also

reserve(), capacity()

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

Removes the item with the given key and returns the value. If there are multiple items for the given key, the most recently inserted one is removed. If you do not use the return value remove() is more efficient. If the key was not found then a new value initialized object of type Val with the given key is returned. Refer to default constructed elements for additional information.

See also

remove()

Returns a list containing all the keys. Any key which occurs multiple times in the multihash will occur only once in the returned list.

See also

keys(), values()

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

See also

insertMulti()

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

See also

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

Returns the value matching the given key. Otherwise, returns the defaultValue. If there are multiple items for the given key, the value of the most recently inserted item is returned.

Returns a list containing all the values in the multihash in an arbitrary order. For keys which occur multiple times all of the values will occur in the list.

The order is guaranteed to be the same as that used by keys().

See also

keys(), value()

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

See also

count(), insertMulti()

Writes the given hash to the stream. Returns a reference to the stream. This function requires the type T to support operator<<().

Refer to Serializing Data Types for additional information.

Reads from the stream into the given hash. Returns a reference to the stream. This function requires the type T to support operator>>().

Refer to Serializing Data Types for additional information.