Another approach is to call find to get the STL-style iterator for the first item with a key and iterate from there:. If you only need to extract the values from a map not the keys , you can also use foreach :. Items can be removed from the map in several ways. One way is to call remove ; this will remove any item with the given key. Another way is to use QMutableMapIterator::remove. In addition, you can clear the entire map using clear.
QMap's key and value data types must be assignable data types. In the example, we start by comparing the employees' names. If they're equal, we compare their dates of birth to break the tie. Move-constructs a QMap instance, making it point at the same object that other was pointing to. This operation occurs in constant time , because QMap is implicitly shared.
This makes returning a QMap from a function very fast. If a shared instance is modified, it will be copied copy-on-write , and this takes linear time. Destroys the map. References to the values in the map, and all iterators over this map, become invalid. Returns an STL-style iterator pointing to the first item in the map. See also constBegin and end.
Returns a const STL-style iterator pointing to the first item in the map. Returns a const STL-style iterator pointing to the imaginary item after the last item in the map.
See also begin and constEnd. If the map contains no item with key key , the function returns constEnd. See also find and QMultiMap::constFind. Returns a const STL-style iterator pointing to the first entry in the map. Returns a const STL-style iterator pointing to the imaginary entry after the last entry in the map. Returns true if the map contains an item with key key ; otherwise returns false. See also count and QMultiMap::contains. See also contains and QMultiMap::count.
This function is provided for STL compatibility. It is equivalent to isEmpty , returning true if the map is empty; otherwise returning false. Returns an STL-style iterator pointing to the imaginary item after the last item in the map. Returns a pair of iterators delimiting the range of values [first, second , that are stored under key. Removes the key, value pair pointed to by the iterator pos from the map, and returns an iterator to the next item in the map. If the map contains no item with key key , the function returns end.
If the map contains multiple items with key key , this function returns an iterator that points to the most recently inserted value. The other values are accessible by incrementing the iterator. For example, here's some code that iterates over all the items with the same key:. Returns a reference to the first value in the map, that is the value mapped to the smallest key. This function assumes that the map is not empty. When unshared or const version is called , this executes in constant time.
See also last , firstKey , and isEmpty. Returns a reference to the smallest key in the map. See also lastKey , first , keyBegin , and isEmpty. 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 key , the most recently inserted item's value is replaced with value. Inserts a new item with the key key and value value and with hint pos suggesting where to do the insert.
Training needs to comply with the regulations and is provided by agencies, associations, facilities, individuals, institutions or organizations have been reviewed and approved by the department.
Maintain proper documentation of the administration of both prescription and non-prescription drugs. Use proper techniques when administering medications by various routes. Safely and accurately fill and administer medications to and from medication reminder boxes with oversight from a licensed person or qualified manager. Administer medications only in authorized settings:. Information and other QMAP programs Qualified medication administration personnel QMAP classes teach unlicensed staff members to safely administer medications in certain settings where it's authorized by law.
If the map contains multiple items with key key , this function returns an iterator that points to the most recently inserted value. The other values are accessible by incrementing the iterator. For example, here's some code that iterates over all the items with the same key:.
Returns a reference to the first value in the map, that is the value mapped to the smallest key. This function assumes that the map is not empty.
When unshared or const version is called , this executes in constant time. See also last , firstKey , and isEmpty. Returns a reference to the smallest key in the map. See also lastKey , first , keyBegin , and isEmpty. 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 key , the most recently inserted item's value is replaced with value. Inserts a new item with the key key and value value and with hint pos suggesting where to do the insert.
If constBegin is used as hint it indicates that the key is less than any key in the map while constEnd suggests that the key is strictly larger than any key in the map. Otherwise the hint should meet the condition pos - 1. If the hint pos is wrong it is ignored and a regular insert is done. If there are multiple items with the key key , then exactly one of them is replaced with value.
If the hint is correct and the map is unshared, the insert executes in amortized constant time. When creating a map from sorted data inserting the largest key first with constBegin is faster than inserting in sorted order with constEnd , since constEnd - 1 which is needed to check if the hint is valid needs logarithmic time. Note: Be careful with the hint. Providing an iterator from an older shared instance might crash but there is also a risk that it will silently corrupt both the map and the pos map.
If there is already an item with the same key in the map, this function will simply create a new one. This behavior is different from insert , which overwrites the value of an existing item. See also insert and values. If constBegin is used as hint it indicates that the key is less than any key in the map while constEnd suggests that the key is larger than any key in the map. If the hint pos is wrong it is ignored and a regular insertMulti is done. Returns the first key with value value , or defaultKey if the map contains no item with value value.
If no defaultKey is provided the function returns a default-constructed key. This function can be slow linear time , because QMap 's internal data structure is optimized for fast lookup by key, not by value. Returns a const STL-style iterator pointing to the first key in the map. See also keyEnd and firstKey.
Returns a const STL-style iterator pointing to the imaginary item after the last key in the map. See also keyBegin and lastKey. Returns a list containing all the keys in the map in ascending order. Keys that occur multiple times in the map because items were inserted with insertMulti , or unite was used also occur multiple times in the list.
To obtain a list of unique keys, where each key from the map only occurs once, use uniqueKeys. See also uniqueKeys , values , and key. Returns a reference to the last value in the map, that is the value mapped to the largest key. When unshared or const version is called , this executes in logarithmic time. See also first , lastKey , and isEmpty. Returns a reference to the largest key in the map.
See also firstKey , last , keyEnd , and isEmpty. Returns an iterator pointing to the first item with key key in the map. If the map contains no item with key key , the function returns an iterator to the nearest item with a greater key.
See also upperBound and find. Removes all the items that have the key key from the map. See also clear , take , and QMultiMap::remove. See also isEmpty and count. If the item does not exist in the map, the function simply returns a default-constructed value.
If there are multiple items for key in the map, only the most recently inserted one is removed and returned. Keys that occur multiple times in the map because items were inserted with insertMulti , or unite was used occur only once in the returned list. Inserts all the items in the other map into this map.
0コメント