Forward iterator over occupied map entries.
More...
#include <RADDataStructures.h>
template<typename K, typename V, typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
class RADData::RADFlatHashMap< K, V, Hash, Eq >::iterator
Forward iterator over occupied map entries.
◆ iterator()
template<typename K , typename V , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
Creates an iterator over an entry range.
◆ operator!=()
template<typename K , typename V , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
Compares iterator position.
◆ operator*()
template<typename K , typename V , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
Returns current key/value pair.
◆ operator++()
template<typename K , typename V , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
Advances to the next occupied entry.
◆ operator->()
template<typename K , typename V , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
Returns current key/value pair pointer.
The documentation for this class was generated from the following file: