|
HDK
|
#include <UT_RLEArray.h>
Classes | |
| class | iterator |
| struct | Run |
Public Types | |
| using | value_type = T |
| using | const_iterator = iterator |
Public Member Functions | |
| UT_RLEArray () | |
| UT_RLEArray (const T *data, exint size) | |
| UT_RLEArray (const UT_Array< T > &arr) | |
| SYS_FORCE_INLINE bool | isEmpty () const |
| SYS_FORCE_INLINE exint | size () const |
| SYS_FORCE_INLINE exint | numRuns () const |
| SYS_FORCE_INLINE const Run & | run (exint i) const |
| SYS_FORCE_INLINE void | clear () |
| SYS_FORCE_INLINE exint | countSize () const |
| SYS_FORCE_INLINE exint | getMemoryUsage () const |
| SYS_FORCE_INLINE bool | isUniform () const |
| SYS_FORCE_INLINE const T & | uniformItem () const |
| SYS_FORCE_INLINE const T & | findItem (exint idx) const |
| Note that finding an item is O(log(N)) - where N is the number of runs. More... | |
| SYS_FORCE_INLINE void | appendRun (const T &item, exint n) |
| SYS_FORCE_INLINE void | concat (UT_RLEArray< T > &&src) |
| Move and concatenate another UT_RLEArray at the end. More... | |
| SYS_FORCE_INLINE void | append (const T &item) |
| SYS_FORCE_INLINE iterator | begin () const |
| SYS_FORCE_INLINE iterator | end () const |
Appending elements to this array will build up a run-length encoded compressed array. Random access may not be fast.
Definition at line 26 of file UT_RLEArray.h.
| using UT_RLEArray< T >::const_iterator = iterator |
Definition at line 379 of file UT_RLEArray.h.
| using UT_RLEArray< T >::value_type = T |
Definition at line 29 of file UT_RLEArray.h.
|
inline |
Definition at line 126 of file UT_RLEArray.h.
|
inline |
Definition at line 131 of file UT_RLEArray.h.
|
inline |
Definition at line 138 of file UT_RLEArray.h.
|
inline |
Definition at line 266 of file UT_RLEArray.h.
|
inline |
Definition at line 200 of file UT_RLEArray.h.
|
inline |
Definition at line 381 of file UT_RLEArray.h.
|
inline |
Definition at line 150 of file UT_RLEArray.h.
|
inline |
Move and concatenate another UT_RLEArray at the end.
Definition at line 224 of file UT_RLEArray.h.
|
inline |
This is a slow way of computing the size of the array but can be used for debugging.
Definition at line 158 of file UT_RLEArray.h.
|
inline |
Definition at line 382 of file UT_RLEArray.h.
|
inline |
Note that finding an item is O(log(N)) - where N is the number of runs.
Definition at line 185 of file UT_RLEArray.h.
|
inline |
Definition at line 166 of file UT_RLEArray.h.
|
inline |
Definition at line 146 of file UT_RLEArray.h.
|
inline |
Definition at line 175 of file UT_RLEArray.h.
|
inline |
Definition at line 148 of file UT_RLEArray.h.
|
inline |
Definition at line 149 of file UT_RLEArray.h.
|
inline |
Definition at line 147 of file UT_RLEArray.h.
|
inline |
Definition at line 179 of file UT_RLEArray.h.