|
FastLED 3.9.15
|
Definition at line 12 of file hash_set.h.
#include <hash_set.h>
Inheritance diagram for fl::HashSet< Key, Hash, KeyEqual >:
Collaboration diagram for fl::HashSet< Key, Hash, KeyEqual >:Public Types | |
| using | Base = HashMap<Key, bool, Hash, KeyEqual> |
| using | const_iterator = typename Base::const_iterator |
| using | iterator = typename Base::iterator |
Public Member Functions | |
| HashSet (fl::size initial_capacity=8, float max_load=0.7f) | |
| void | erase (const Key &key) |
| iterator | find (const Key &key) |
| void | insert (const Key &key) |
Public Member Functions inherited from fl::HashMap< Key, T, Hash, KeyEqual, INLINED_COUNT > | |
| HashMap () | |
| HashMap (fl::size initial_capacity) | |
| HashMap (fl::size initial_capacity, float max_load) | |
| iterator | begin () |
| const_iterator | begin () const |
| fl::size | capacity () const |
| const_iterator | cbegin () const |
| const_iterator | cend () const |
| void | clear () |
| bool | contains (const Key &key) const |
| bool | empty () const |
| iterator | end () |
| const_iterator | end () const |
| bool | erase (const Key &key) |
| iterator | erase (iterator it) |
| iterator | find (const Key &key) |
| const_iterator | find (const Key &key) const |
| T * | find_value (const Key &key) |
| const T * | find_value (const Key &key) const |
| void | insert (const Key &key, const T &value) |
| void | insert (Key &&key, T &&value) |
| bool | needs_rehash () const |
| T & | operator[] (const Key &key) |
| bool | remove (const Key &key) |
| void | setLoadFactor (float f) |
| fl::size | size () const |
Additional Inherited Members | |
Static Public Member Functions inherited from fl::HashMap< Key, T, Hash, KeyEqual, INLINED_COUNT > | |
| static bool | NeedsRehash (fl::size size, fl::size bucket_size, fl::size tombstones, u8 load_factor) |