FastLED 3.9.7
|
Public Types | |
typedef T * | iterator |
typedef const T * | const_iterator |
Public Member Functions | |
HeapVector (size_t size=0, const T &value=T()) | |
HeapVector (const HeapVector< T > &other) | |
HeapVector & | operator= (const HeapVector< T > &other) |
void | ensure_size (size_t n) |
void | reserve (size_t n) |
void | resize (size_t n) |
void | resize (size_t n, const T &value) |
T & | operator[] (size_t index) |
const T & | operator[] (size_t index) const |
size_t | size () const |
bool | empty () const |
size_t | capacity () const |
void | push_back (const T &value) |
void | pop_back () |
void | clear () |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
T & | front () |
const T & | front () const |
T & | back () |
const T & | back () const |
iterator | find (const T &value) |
const_iterator | find (const T &value) const |
template<typename Predicate > | |
iterator | find_if (Predicate pred) |
bool | has (const T &value) const |
bool | erase (iterator pos, T *out_value=nullptr) |
void | erase (const T &value) |
void | swap (HeapVector< T > &other) |
void | swap (iterator a, iterator b) |
bool | full () const |
bool | insert (iterator pos, const T &value) |
void | assign (const T *values, size_t count) |
void | assign (const_iterator begin, const_iterator end) |
T * | data () |
const T * | data () const |
typedef const T* fl::HeapVector< T >::const_iterator |
typedef T* fl::HeapVector< T >::iterator |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |