iterator() [2/2]

template<typename Key, typename T, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>, int INLINED_COUNT = FASTLED_HASHMAP_INLINED_COUNT>

fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::iterator::iterator ( unordered_map * m, fl::size idx )

inline

Definition at line 197 of file unordered_map.h.

                                                            : _map(m), _idx(idx) {
            advance_to_occupied();
        }

References _idx, _map, advance_to_occupied(), fl::FL_NO_EXCEPT, and unordered_map.

Here is the call graph for this function: