FastLED 3.9.12
Loading...
Searching...
No Matches
fl::SortedHeapVector< T, LessThan > Class Template Reference

Detailed Description

template<typename T, typename LessThan>
class fl::SortedHeapVector< T, LessThan >

Definition at line 492 of file vector.h.

Public Types

typedef HeapVector< T >::iterator iterator
 
typedef HeapVector< T >::const_iterator const_iterator
 

Public Member Functions

 SortedHeapVector (LessThan less=LessThan())
 
void setMaxSize (size_t n)
 
void reserve (size_t n)
 
bool insert (const T &value, InsertResult *result=nullptr)
 
iterator lower_bound (const T &value)
 
const_iterator lower_bound (const T &value) const
 
iterator find (const T &value)
 
void swap (SortedHeapVector &other)
 
const_iterator find (const T &value) const
 
bool has (const T &value) const
 
bool erase (const T &value)
 
bool erase (iterator pos)
 
size_t size () const
 
bool empty () const
 
size_t capacity () const
 
void clear ()
 
bool full () const
 
T & operator[] (size_t index)
 
const T & operator[] (size_t index) const
 
T & front ()
 
const T & front () const
 
T & back ()
 
const T & back () const
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
T * data ()
 
const T * data () const
 

Member Typedef Documentation

◆ const_iterator

template<typename T , typename LessThan >
typedef HeapVector<T>::const_iterator fl::SortedHeapVector< T, LessThan >::const_iterator

Definition at line 500 of file vector.h.

◆ iterator

template<typename T , typename LessThan >
typedef HeapVector<T>::iterator fl::SortedHeapVector< T, LessThan >::iterator

Definition at line 499 of file vector.h.

Constructor & Destructor Documentation

◆ SortedHeapVector()

template<typename T , typename LessThan >
fl::SortedHeapVector< T, LessThan >::SortedHeapVector ( LessThan less = LessThan())
inline

Definition at line 502 of file vector.h.

◆ ~SortedHeapVector()

template<typename T , typename LessThan >
fl::SortedHeapVector< T, LessThan >::~SortedHeapVector ( )
inline

Definition at line 517 of file vector.h.

Member Function Documentation

◆ back() [1/2]

template<typename T , typename LessThan >
T & fl::SortedHeapVector< T, LessThan >::back ( )
inline

Definition at line 627 of file vector.h.

◆ back() [2/2]

template<typename T , typename LessThan >
const T & fl::SortedHeapVector< T, LessThan >::back ( ) const
inline

Definition at line 628 of file vector.h.

◆ begin() [1/2]

template<typename T , typename LessThan >
iterator fl::SortedHeapVector< T, LessThan >::begin ( )
inline

Definition at line 631 of file vector.h.

◆ begin() [2/2]

template<typename T , typename LessThan >
const_iterator fl::SortedHeapVector< T, LessThan >::begin ( ) const
inline

Definition at line 632 of file vector.h.

◆ capacity()

template<typename T , typename LessThan >
size_t fl::SortedHeapVector< T, LessThan >::capacity ( ) const
inline

Definition at line 611 of file vector.h.

◆ clear()

template<typename T , typename LessThan >
void fl::SortedHeapVector< T, LessThan >::clear ( )
inline

Definition at line 612 of file vector.h.

◆ data() [1/2]

template<typename T , typename LessThan >
T * fl::SortedHeapVector< T, LessThan >::data ( )
inline

Definition at line 637 of file vector.h.

◆ data() [2/2]

template<typename T , typename LessThan >
const T * fl::SortedHeapVector< T, LessThan >::data ( ) const
inline

Definition at line 638 of file vector.h.

◆ empty()

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::empty ( ) const
inline

Definition at line 610 of file vector.h.

◆ end() [1/2]

template<typename T , typename LessThan >
iterator fl::SortedHeapVector< T, LessThan >::end ( )
inline

Definition at line 633 of file vector.h.

◆ end() [2/2]

template<typename T , typename LessThan >
const_iterator fl::SortedHeapVector< T, LessThan >::end ( ) const
inline

Definition at line 634 of file vector.h.

◆ erase() [1/2]

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::erase ( const T & value)
inline

Definition at line 596 of file vector.h.

◆ erase() [2/2]

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::erase ( iterator pos)
inline

Definition at line 604 of file vector.h.

◆ find() [1/2]

template<typename T , typename LessThan >
iterator fl::SortedHeapVector< T, LessThan >::find ( const T & value)
inline

Definition at line 575 of file vector.h.

◆ find() [2/2]

template<typename T , typename LessThan >
const_iterator fl::SortedHeapVector< T, LessThan >::find ( const T & value) const
inline

Definition at line 587 of file vector.h.

◆ front() [1/2]

template<typename T , typename LessThan >
T & fl::SortedHeapVector< T, LessThan >::front ( )
inline

Definition at line 624 of file vector.h.

◆ front() [2/2]

template<typename T , typename LessThan >
const T & fl::SortedHeapVector< T, LessThan >::front ( ) const
inline

Definition at line 625 of file vector.h.

◆ full()

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::full ( ) const
inline

Definition at line 613 of file vector.h.

◆ has()

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::has ( const T & value) const
inline

Definition at line 591 of file vector.h.

◆ insert()

template<typename T , typename LessThan >
bool fl::SortedHeapVector< T, LessThan >::insert ( const T & value,
InsertResult * result = nullptr )
inline

Definition at line 526 of file vector.h.

◆ lower_bound() [1/2]

template<typename T , typename LessThan >
iterator fl::SortedHeapVector< T, LessThan >::lower_bound ( const T & value)
inline

Definition at line 554 of file vector.h.

◆ lower_bound() [2/2]

template<typename T , typename LessThan >
const_iterator fl::SortedHeapVector< T, LessThan >::lower_bound ( const T & value) const
inline

Definition at line 570 of file vector.h.

◆ operator[]() [1/2]

template<typename T , typename LessThan >
T & fl::SortedHeapVector< T, LessThan >::operator[] ( size_t index)
inline

Definition at line 621 of file vector.h.

◆ operator[]() [2/2]

template<typename T , typename LessThan >
const T & fl::SortedHeapVector< T, LessThan >::operator[] ( size_t index) const
inline

Definition at line 622 of file vector.h.

◆ reserve()

template<typename T , typename LessThan >
void fl::SortedHeapVector< T, LessThan >::reserve ( size_t n)
inline

Definition at line 521 of file vector.h.

◆ setMaxSize()

template<typename T , typename LessThan >
void fl::SortedHeapVector< T, LessThan >::setMaxSize ( size_t n)
inline

Definition at line 504 of file vector.h.

◆ size()

template<typename T , typename LessThan >
size_t fl::SortedHeapVector< T, LessThan >::size ( ) const
inline

Definition at line 609 of file vector.h.

◆ swap()

template<typename T , typename LessThan >
void fl::SortedHeapVector< T, LessThan >::swap ( SortedHeapVector< T, LessThan > & other)
inline

Definition at line 583 of file vector.h.


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