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

Detailed Description

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

Definition at line 243 of file map.h.

Public Types

typedef SortedHeapVector< Pair, PairLess >::iterator iterator
 
typedef SortedHeapVector< Pair, PairLess >::const_iterator const_iterator
 

Public Member Functions

 SortedHeapMap (Less less=Less())
 
void setMaxSize (size_t n)
 
void reserve (size_t n)
 
bool insert (const Key &key, const Value &value, InsertResult *result=nullptr)
 
bool has (const Key &key) const
 
size_t size () const
 
bool empty () const
 
bool full () const
 
size_t capacity () const
 
void clear ()
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
iterator find (const Key &key)
 
const_iterator find (const Key &key) const
 
bool erase (const Key &key)
 
bool erase (iterator it)
 
iterator lower_bound (const Key &key)
 
const_iterator lower_bound (const Key &key) const
 
iterator upper_bound (const Key &key)
 
const_iterator upper_bound (const Key &key) const
 
Pair & front ()
 
const Pair & front () const
 
Pair & back ()
 
const Pair & back () const
 

Member Typedef Documentation

◆ const_iterator

template<typename Key , typename Value , typename Less >
typedef SortedHeapVector<Pair,PairLess>::const_iterator fl::SortedHeapMap< Key, Value, Less >::const_iterator

Definition at line 265 of file map.h.

◆ iterator

template<typename Key , typename Value , typename Less >
typedef SortedHeapVector<Pair,PairLess>::iterator fl::SortedHeapMap< Key, Value, Less >::iterator

Definition at line 264 of file map.h.

Constructor & Destructor Documentation

◆ SortedHeapMap()

template<typename Key , typename Value , typename Less >
fl::SortedHeapMap< Key, Value, Less >::SortedHeapMap ( Less less = Less())
inline

Definition at line 267 of file map.h.

Member Function Documentation

◆ back() [1/2]

template<typename Key , typename Value , typename Less >
Pair & fl::SortedHeapMap< Key, Value, Less >::back ( )
inline

Definition at line 339 of file map.h.

◆ back() [2/2]

template<typename Key , typename Value , typename Less >
const Pair & fl::SortedHeapMap< Key, Value, Less >::back ( ) const
inline

Definition at line 340 of file map.h.

◆ begin() [1/2]

template<typename Key , typename Value , typename Less >
iterator fl::SortedHeapMap< Key, Value, Less >::begin ( )
inline

Definition at line 294 of file map.h.

◆ begin() [2/2]

template<typename Key , typename Value , typename Less >
const_iterator fl::SortedHeapMap< Key, Value, Less >::begin ( ) const
inline

Definition at line 296 of file map.h.

◆ capacity()

template<typename Key , typename Value , typename Less >
size_t fl::SortedHeapMap< Key, Value, Less >::capacity ( ) const
inline

Definition at line 290 of file map.h.

◆ clear()

template<typename Key , typename Value , typename Less >
void fl::SortedHeapMap< Key, Value, Less >::clear ( )
inline

Definition at line 291 of file map.h.

◆ empty()

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::empty ( ) const
inline

Definition at line 288 of file map.h.

◆ end() [1/2]

template<typename Key , typename Value , typename Less >
iterator fl::SortedHeapMap< Key, Value, Less >::end ( )
inline

Definition at line 295 of file map.h.

◆ end() [2/2]

template<typename Key , typename Value , typename Less >
const_iterator fl::SortedHeapMap< Key, Value, Less >::end ( ) const
inline

Definition at line 297 of file map.h.

◆ erase() [1/2]

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::erase ( const Key & key)
inline

Definition at line 306 of file map.h.

◆ erase() [2/2]

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::erase ( iterator it)
inline

Definition at line 309 of file map.h.

◆ find() [1/2]

template<typename Key , typename Value , typename Less >
iterator fl::SortedHeapMap< Key, Value, Less >::find ( const Key & key)
inline

Definition at line 299 of file map.h.

◆ find() [2/2]

template<typename Key , typename Value , typename Less >
const_iterator fl::SortedHeapMap< Key, Value, Less >::find ( const Key & key) const
inline

Definition at line 302 of file map.h.

◆ front() [1/2]

template<typename Key , typename Value , typename Less >
Pair & fl::SortedHeapMap< Key, Value, Less >::front ( )
inline

Definition at line 337 of file map.h.

◆ front() [2/2]

template<typename Key , typename Value , typename Less >
const Pair & fl::SortedHeapMap< Key, Value, Less >::front ( ) const
inline

Definition at line 338 of file map.h.

◆ full()

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::full ( ) const
inline

Definition at line 289 of file map.h.

◆ has()

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::has ( const Key & key) const
inline

Definition at line 283 of file map.h.

◆ insert()

template<typename Key , typename Value , typename Less >
bool fl::SortedHeapMap< Key, Value, Less >::insert ( const Key & key,
const Value & value,
InsertResult * result = nullptr )
inline

Definition at line 279 of file map.h.

◆ lower_bound() [1/2]

template<typename Key , typename Value , typename Less >
iterator fl::SortedHeapMap< Key, Value, Less >::lower_bound ( const Key & key)
inline

Definition at line 313 of file map.h.

◆ lower_bound() [2/2]

template<typename Key , typename Value , typename Less >
const_iterator fl::SortedHeapMap< Key, Value, Less >::lower_bound ( const Key & key) const
inline

Definition at line 317 of file map.h.

◆ reserve()

template<typename Key , typename Value , typename Less >
void fl::SortedHeapMap< Key, Value, Less >::reserve ( size_t n)
inline

Definition at line 275 of file map.h.

◆ setMaxSize()

template<typename Key , typename Value , typename Less >
void fl::SortedHeapMap< Key, Value, Less >::setMaxSize ( size_t n)
inline

Definition at line 271 of file map.h.

◆ size()

template<typename Key , typename Value , typename Less >
size_t fl::SortedHeapMap< Key, Value, Less >::size ( ) const
inline

Definition at line 287 of file map.h.

◆ upper_bound() [1/2]

template<typename Key , typename Value , typename Less >
iterator fl::SortedHeapMap< Key, Value, Less >::upper_bound ( const Key & key)
inline

Definition at line 321 of file map.h.

◆ upper_bound() [2/2]

template<typename Key , typename Value , typename Less >
const_iterator fl::SortedHeapMap< Key, Value, Less >::upper_bound ( const Key & key) const
inline

Definition at line 329 of file map.h.

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