FastLED 3.9.15
Loading...
Searching...
No Matches
Classes | Public Types | Public Member Functions | Private Attributes | List of all members
fl::SortedHeapMap< Key, Value, Less > Class Template Reference

Detailed Description

template<typename Key, typename Value, typename Less = fl::less<Key>>
class fl::SortedHeapMap< Key, Value, Less >

Definition at line 270 of file map.h.

#include <map.h>

+ Inheritance diagram for fl::SortedHeapMap< Key, Value, Less >:
+ Collaboration diagram for fl::SortedHeapMap< Key, Value, Less >:

Classes

struct  PairLess
 
class  value_compare
 

Public Types

typedef SortedHeapVector< value_type, PairLess >::const_iterator const_iterator
 
using const_pointer = const value_type*
 
using const_reference = const value_type&
 
using difference_type = ptrdiff_t
 
typedef SortedHeapVector< value_type, PairLess >::iterator iterator
 
using key_compare = Less
 
using key_type = Key
 
using mapped_type = Value
 
using pointer = value_type*
 
using reference = value_type&
 
using size_type = fl::size
 
using value_type = fl::pair<Key, Value>
 

Public Member Functions

 SortedHeapMap (const SortedHeapMap &other)=default
 
 SortedHeapMap (Less less=Less())
 
Value & at (const Key &key)
 
const Value & at (const Key &key) const
 
value_type & back ()
 
const value_type & back () const
 
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
 
fl::size count (const Key &key) const
 
template<class... Args>
fl::pair< iterator, bool > emplace (Args &&... args)
 
bool empty () const
 
iterator end ()
 
const_iterator end () const
 
fl::pair< iterator, iterator > equal_range (const Key &key)
 
fl::pair< const_iterator, const_iterator > equal_range (const Key &key) const
 
fl::size erase (const Key &key)
 
iterator erase (const_iterator pos)
 
bool erase (iterator it)
 
iterator find (const Key &key)
 
const_iterator find (const Key &key) const
 
value_type & front ()
 
const value_type & front () const
 
bool full () const
 
bool get (const Key &key, Value *value) const
 
bool has (const Key &key) const
 
bool insert (const Key &key, const Value &value, InsertResult *result=nullptr)
 
fl::pair< iterator, bool > insert (const value_type &value)
 
bool insert (Key &&key, Value &&value, InsertResult *result=nullptr)
 
fl::pair< iterator, bool > insert (value_type &&value)
 
key_compare key_comp () const
 
iterator lower_bound (const Key &key)
 
const_iterator lower_bound (const Key &key) const
 
fl::size max_size () const
 
bool operator!= (const SortedHeapMap &other) const
 
SortedHeapMap & operator= (const SortedHeapMap &other)=default
 
bool operator== (const SortedHeapMap &other) const
 
Value & operator[] (const Key &key)
 
void reserve (fl::size n)
 
void setMaxSize (fl::size n)
 
fl::size size () const
 
void swap (SortedHeapMap &other)
 
void update (const Key &key, const Value &value)
 
void update (const Key &key, Value &&value)
 
iterator upper_bound (const Key &key)
 
const_iterator upper_bound (const Key &key) const
 
value_compare value_comp () const
 

Private Attributes

SortedHeapVector< value_type, PairLess > data
 
The documentation for this class was generated from the following file: