fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::const_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 >::const_iterator

Definition at line 242 of file unordered_map.h.

#include <unordered_map.h>

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

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

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

Private Attributes
fl::size	_idx
const unordered_map *	_map

Friends
class	unordered_map

---

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

• fl/stl/unordered_map.h