template<typename
Key, typename Value, size_t N>
class fl::FixedMap< Key, Value, N >
Definition at line 20 of file map.h.
|
| iterator | begin () |
| |
| iterator | end () |
| |
| const_iterator | begin () const |
| |
| const_iterator | end () const |
| |
| iterator | find (const Key &key) |
| |
| const_iterator | find (const Key &key) const |
| |
| template<typename Less > |
| iterator | lowest (Less less_than=Less()) |
| |
| template<typename Less > |
| const_iterator | lowest (Less less_than=Less()) const |
| |
| template<typename Less > |
| iterator | highest (Less less_than=Less()) |
| |
| template<typename Less > |
| const_iterator | highest (Less less_than=Less()) const |
| |
| bool | get (const Key &key, Value *value) const |
| |
| Value | get (const Key &key, bool *has=nullptr) const |
| |
| Pair< bool, iterator > | insert (const Key &key, const Value &value, InsertResult *result=nullptr) |
| |
| bool | update (const Key &key, const Value &value, bool insert_if_missing=true) |
| |
| Value & | operator[] (const Key &key) |
| |
| const Value & | operator[] (const Key &key) const |
| |
| bool | next (const Key &key, Key *next_key, bool allow_rollover=false) const |
| |
| bool | prev (const Key &key, Key *prev_key, bool allow_rollover=false) const |
| |
| constexpr size_t | size () const |
| |
| constexpr bool | empty () const |
| |
| constexpr size_t | capacity () const |
| |
| void | clear () |
| |
| bool | has (const Key &it) const |
| |
1.11.0