fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::iterator Struct Reference

Detailed Description

template<typename Key, typename T, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>, int INLINED_COUNT = FASTLED_HASHMAP_INLINED_COUNT>
struct fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::iterator

Definition at line 187 of file unordered_map.h.

#include <unordered_map.h>

Collaboration diagram for fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::iterator:

Public Types
using	iterator_category = fl::forward_iterator_tag
using	pointer = value_type *
using	reference = value_type &
using	value_type = pair<const Key, T>

Public Member Functions
	iterator () FL_NOEXCEPT
	iterator (unordered_map *m, fl::size idx)
void	advance_to_occupied ()
bool	operator!= (const iterator &o) const
reference	operator* () const
iterator &	operator++ ()
iterator	operator++ (int)
pointer	operator-> () const
bool	operator== (const iterator &o) const

Private Attributes
fl::size	_idx
unordered_map *	_map

Friends
class	unordered_map

---

The documentation for this struct was generated from the following file:

• fl/stl/unordered_map.h