#include <UT_ValArray.h>
Public Types | |
| typedef int(* | Comparator )(const T *, const T *) |
Public Member Functions | |
| UT_ValArray (const UT_ValArray< T > &a) | |
| UT_ValArray (unsigned int sz, unsigned int count) | |
| UT_ValArray (unsigned int sz=0) | |
| ~UT_ValArray (void) | |
| void | swap (UT_ValArray< T > &other) |
| unsigned int | append (void) |
| unsigned int | append (T t) |
| void | appendMultiple (T t, int count) |
| unsigned int | insert (unsigned index) |
| unsigned int | insert (T t, unsigned index) |
| unsigned int | sortedInsert (T t, Comparator compare) |
| unsigned int | sortedInsert (T t) |
| unsigned int | uniqueSortedInsert (T t, Comparator compare) |
| unsigned int | uniqueSortedInsert (T t) |
| unsigned int | uniqueSortedInsertAscending (T t) |
| int | uniqueSortedFind (T item) const |
| int | uniqueSortedFindAscending (T item) const |
| void | merge (const UT_ValArray< T > &other, int direction, bool allow_dups) |
| void | sortedUnion (const UT_ValArray< T > &other) |
| void | sortedUnion (const UT_ValArray< T > &other, UT_ValArray< T > &result) const |
| void | sortedIntersection (const UT_ValArray< T > &other) |
| void | sortedIntersection (const UT_ValArray< T > &other, UT_ValArray< T > &result) const |
| void | sortedSetDifference (const UT_ValArray< T > &other) |
| void | sortedSetDifference (const UT_ValArray< T > &other, UT_ValArray< T > &result) const |
| void | sortedRemoveDuplicates () |
| Assuming this array is sorted, remove all duplicate entries. | |
| void | fromStdVector (const std::vector< T > &vec) |
| void | toStdVector (std::vector< T > &vec) const |
| unsigned int | heapPush (T t, Comparator compare) |
| unsigned int | heapPush (T t) |
| T | heapPop (Comparator compare) |
| T | heapPop () |
| T | heapMax () const |
| unsigned int | concat (const UT_ValArray< T > &a) |
| unsigned int | multipleInsert (unsigned int index, unsigned int count) |
| unsigned int | insertAt (T t, unsigned int index) |
| int | findAndRemove (T t) |
| int | removeIndex (unsigned int index) |
| int | removeLast () |
| int | shift (unsigned int srcIdx, unsigned int destIdx, unsigned int howMany) |
| void | cycle (int howMany) |
| void | constant (T v) |
| void | constant () |
| void | zero () |
| int | find (T t, unsigned int s=0) const |
| int | find (T t, Comparator compare) const |
| void | reverse () |
| void | sort (Comparator compare) |
| void | sortAscending () |
| T | selectNthLargest (int idx) |
| void | resize (unsigned int sz, unsigned short copyFlag=1) |
| void | resizeIfNeeded (uint sz, bool copyFlag=true) |
| uint | capacity (void) const |
| int64 | getMemoryUsage () const |
| uint | entries (void) const |
| bool | isEmpty (void) const |
| void | entries (unsigned int ne) |
| void | truncate (unsigned int ne) |
| void | clear () |
| UT_ValArray< T > & | operator= (const UT_ValArray< T > &a) |
| bool | operator== (const UT_ValArray< T > &a) const |
| bool | operator!= (const UT_ValArray< T > &a) const |
| int | isEqual (const UT_ValArray< T > &a, Comparator compare) const |
| T & | operator() (unsigned int i) |
| const T & | operator() (unsigned int i) const |
| T & | operator[] (unsigned int i) |
| const T & | operator[] (unsigned int i) const |
| T & | last () |
| T | last () const |
| void | copyMemory (const UT_ValArray< T > &from) |
| unsigned int | apply (int(*applyFct)(T &t, void *d), void *d) |
| const T * | getRawArray (void) const |
| T * | array (void) |
| void | setCapacity (unsigned int sz) |
| T * | aliasArray (T *newdata) |
| T | sum () const |
| void | display () const |
| template<> | |
| UT_API void | display () const |
Definition at line 38 of file UT_ValArray.h.
| typedef int(* UT_ValArray< T >::Comparator)(const T *, const T *) |
Definition at line 40 of file UT_ValArray.h.
| UT_ValArray< T >::UT_ValArray | ( | const UT_ValArray< T > & | a | ) | [inline] |
Definition at line 32 of file UT_ValArrayImpl.h.
| UT_ValArray< T >::UT_ValArray | ( | unsigned int | sz, | |
| unsigned int | count | |||
| ) | [inline] |
Definition at line 43 of file UT_ValArray.h.
| UT_ValArray< T >::UT_ValArray | ( | unsigned int | sz = 0 |
) | [inline, explicit] |
Definition at line 50 of file UT_ValArray.h.
| UT_ValArray< T >::~UT_ValArray | ( | void | ) | [inline] |
Definition at line 47 of file UT_ValArrayImpl.h.
| T* UT_ValArray< T >::aliasArray | ( | T * | newdata | ) | [inline] |
Definition at line 274 of file UT_ValArray.h.
| unsigned int UT_ValArray< T >::append | ( | T | t | ) | [inline] |
Definition at line 83 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::append | ( | void | ) | [inline] |
Definition at line 69 of file UT_ValArray.h.
| void UT_ValArray< T >::appendMultiple | ( | T | t, | |
| int | count | |||
| ) | [inline] |
Definition at line 94 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::apply | ( | int(*)(T &t, void *d) | applyFct, | |
| void * | d | |||
| ) | [inline] |
Definition at line 572 of file UT_ValArrayImpl.h.
| T* UT_ValArray< T >::array | ( | void | ) | [inline] |
Definition at line 269 of file UT_ValArray.h.
| uint UT_ValArray< T >::capacity | ( | void | ) | const [inline] |
Definition at line 201 of file UT_ValArray.h.
| void UT_ValArray< T >::clear | ( | void | ) | [inline] |
Definition at line 211 of file UT_ValArray.h.
| unsigned int UT_ValArray< T >::concat | ( | const UT_ValArray< T > & | a | ) | [inline] |
Definition at line 299 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::constant | ( | ) | [inline] |
Definition at line 425 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::constant | ( | T | v | ) | [inline] |
Definition at line 415 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::copyMemory | ( | const UT_ValArray< T > & | from | ) | [inline] |
Definition at line 260 of file UT_ValArray.h.
| void UT_ValArray< T >::cycle | ( | int | howMany | ) | [inline] |
Definition at line 393 of file UT_ValArrayImpl.h.
| UT_API void UT_ValArray< fpreal64 >::display | ( | ) | const [inline] |
| void UT_ValArray< T >::display | ( | ) | const [inline] |
Definition at line 582 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::entries | ( | unsigned int | ne | ) | [inline] |
Definition at line 207 of file UT_ValArray.h.
| uint UT_ValArray< T >::entries | ( | void | ) | const [inline] |
Definition at line 203 of file UT_ValArray.h.
| int UT_ValArray< T >::find | ( | T | t, | |
| Comparator | compare | |||
| ) | const [inline] |
Definition at line 443 of file UT_ValArrayImpl.h.
| int UT_ValArray< T >::find | ( | T | t, | |
| unsigned int | s = 0 | |||
| ) | const [inline] |
Definition at line 432 of file UT_ValArrayImpl.h.
| int UT_ValArray< T >::findAndRemove | ( | T | t | ) | [inline] |
Definition at line 359 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::fromStdVector | ( | const std::vector< T > & | vec | ) | [inline] |
Definition at line 633 of file UT_ValArrayImpl.h.
| int64 UT_ValArray< T >::getMemoryUsage | ( | void | ) | const [inline] |
Definition at line 202 of file UT_ValArray.h.
| const T* UT_ValArray< T >::getRawArray | ( | void | ) | const [inline] |
Definition at line 268 of file UT_ValArray.h.
| T UT_ValArray< T >::heapMax | ( | ) | const [inline] |
Definition at line 126 of file UT_ValArray.h.
| T UT_ValArray< T >::heapPop | ( | ) | [inline] |
Definition at line 282 of file UT_ValArrayImpl.h.
| T UT_ValArray< T >::heapPop | ( | Comparator | compare | ) | [inline] |
Definition at line 266 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::heapPush | ( | T | t | ) | [inline] |
Definition at line 251 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::heapPush | ( | T | t, | |
| Comparator | compare | |||
| ) | [inline] |
Definition at line 236 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::insert | ( | T | t, | |
| unsigned | index | |||
| ) |
| unsigned int UT_ValArray< T >::insert | ( | unsigned | index | ) |
| unsigned int UT_ValArray< T >::insertAt | ( | T | t, | |
| unsigned int | index | |||
| ) | [inline] |
Definition at line 337 of file UT_ValArrayImpl.h.
| bool UT_ValArray< T >::isEmpty | ( | void | ) | const [inline] |
Definition at line 204 of file UT_ValArray.h.
| int UT_ValArray< T >::isEqual | ( | const UT_ValArray< T > & | a, | |
| Comparator | compare | |||
| ) | const [inline] |
Definition at line 558 of file UT_ValArrayImpl.h.
| T UT_ValArray< T >::last | ( | ) | const [inline] |
Definition at line 255 of file UT_ValArray.h.
| T& UT_ValArray< T >::last | ( | ) | [inline] |
Definition at line 250 of file UT_ValArray.h.
| void UT_ValArray< T >::merge | ( | const UT_ValArray< T > & | other, | |
| int | direction, | |||
| bool | allow_dups | |||
| ) | [inline] |
Definition at line 657 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::multipleInsert | ( | unsigned int | index, | |
| unsigned int | count | |||
| ) | [inline] |
Definition at line 315 of file UT_ValArrayImpl.h.
| bool UT_ValArray< T >::operator!= | ( | const UT_ValArray< T > & | a | ) | const [inline] |
Definition at line 551 of file UT_ValArrayImpl.h.
| const T& UT_ValArray< T >::operator() | ( | unsigned int | i | ) | const [inline] |
Definition at line 234 of file UT_ValArray.h.
| T& UT_ValArray< T >::operator() | ( | unsigned int | i | ) | [inline] |
Definition at line 229 of file UT_ValArray.h.
| UT_ValArray< T > & UT_ValArray< T >::operator= | ( | const UT_ValArray< T > & | a | ) | [inline] |
Definition at line 524 of file UT_ValArrayImpl.h.
| bool UT_ValArray< T >::operator== | ( | const UT_ValArray< T > & | a | ) | const [inline] |
Definition at line 540 of file UT_ValArrayImpl.h.
| const T& UT_ValArray< T >::operator[] | ( | unsigned int | i | ) | const [inline] |
Definition at line 245 of file UT_ValArray.h.
| T& UT_ValArray< T >::operator[] | ( | unsigned int | i | ) | [inline] |
Definition at line 239 of file UT_ValArray.h.
| int UT_ValArray< T >::removeIndex | ( | unsigned int | index | ) | [inline] |
Definition at line 148 of file UT_ValArray.h.
| int UT_ValArray< T >::removeLast | ( | void | ) | [inline] |
Definition at line 152 of file UT_ValArray.h.
| void UT_ValArray< T >::resize | ( | unsigned int | sz, | |
| unsigned short | copyFlag = 1 | |||
| ) | [inline] |
Definition at line 497 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::resizeIfNeeded | ( | uint | sz, | |
| bool | copyFlag = true | |||
| ) | [inline] |
Definition at line 193 of file UT_ValArray.h.
| void UT_ValArray< T >::reverse | ( | void | ) | [inline] |
Definition at line 456 of file UT_ValArrayImpl.h.
| T UT_ValArray< T >::selectNthLargest | ( | int | idx | ) | [inline] |
Definition at line 480 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::setCapacity | ( | unsigned int | sz | ) | [inline] |
Definition at line 270 of file UT_ValArray.h.
| int UT_ValArray< T >::shift | ( | unsigned int | srcIdx, | |
| unsigned int | destIdx, | |||
| unsigned int | howMany | |||
| ) | [inline] |
Definition at line 377 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sort | ( | Comparator | compare | ) | [inline] |
Definition at line 465 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortAscending | ( | ) | [inline] |
Definition at line 472 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::sortedInsert | ( | T | t | ) | [inline] |
Definition at line 143 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::sortedInsert | ( | T | t, | |
| Comparator | compare | |||
| ) | [inline] |
Definition at line 118 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedIntersection | ( | const UT_ValArray< T > & | other, | |
| UT_ValArray< T > & | result | |||
| ) | const [inline] |
Definition at line 789 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedIntersection | ( | const UT_ValArray< T > & | other | ) | [inline] |
Definition at line 780 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedRemoveDuplicates | ( | ) | [inline] |
Assuming this array is sorted, remove all duplicate entries.
Definition at line 852 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedSetDifference | ( | const UT_ValArray< T > & | other, | |
| UT_ValArray< T > & | result | |||
| ) | const [inline] |
Definition at line 820 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedSetDifference | ( | const UT_ValArray< T > & | other | ) | [inline] |
Definition at line 811 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedUnion | ( | const UT_ValArray< T > & | other, | |
| UT_ValArray< T > & | result | |||
| ) | const [inline] |
Definition at line 735 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::sortedUnion | ( | const UT_ValArray< T > & | other | ) | [inline] |
Definition at line 726 of file UT_ValArrayImpl.h.
| T UT_ValArray< T >::sum | ( | ) | const [inline] |
Definition at line 278 of file UT_ValArray.h.
| void UT_ValArray< T >::swap | ( | UT_ValArray< T > & | other | ) | [inline] |
Definition at line 54 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::toStdVector | ( | std::vector< T > & | vec | ) | const [inline] |
Definition at line 642 of file UT_ValArrayImpl.h.
| void UT_ValArray< T >::truncate | ( | unsigned int | ne | ) | [inline] |
Definition at line 209 of file UT_ValArray.h.
| int UT_ValArray< T >::uniqueSortedFind | ( | T | item | ) | const [inline] |
Definition at line 212 of file UT_ValArrayImpl.h.
| int UT_ValArray< T >::uniqueSortedFindAscending | ( | T | item | ) | const [inline] |
Definition at line 87 of file UT_ValArray.h.
| unsigned int UT_ValArray< T >::uniqueSortedInsert | ( | T | t | ) | [inline] |
Definition at line 190 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::uniqueSortedInsert | ( | T | t, | |
| Comparator | compare | |||
| ) | [inline] |
Definition at line 168 of file UT_ValArrayImpl.h.
| unsigned int UT_ValArray< T >::uniqueSortedInsertAscending | ( | T | t | ) | [inline] |
Definition at line 81 of file UT_ValArray.h.
| void UT_ValArray< T >::zero | ( | ) | [inline] |
Definition at line 168 of file UT_ValArray.h.
1.5.9