#include <UT_PtrArrayRaw.h>
Public Types | |
| typedef int(* | Comparator )(const void *, const void *) |
| typedef bool(* | ComparatorBool )(const void *, const void *) |
Public Member Functions | |
| UT_PtrArrayRaw (unsigned int sz=0) | |
| ~UT_PtrArrayRaw (void) | |
| UT_PtrArrayRaw (const UT_PtrArrayRaw &a) | |
| void | swap (UT_PtrArrayRaw &other) |
| unsigned int | append (void) |
| unsigned int | append (const void *t) |
| unsigned int | append (const void *t, int checkForDup) |
| unsigned int | insert (unsigned index) |
| unsigned int | insert (const void *t, unsigned index) |
| unsigned int | sortedInsert (const void *t, Comparator compare) |
| unsigned int | uniqueSortedInsert (const void *t, Comparator compare) |
| bool | hasSortedSubset (UT_PtrArrayRaw const &other, Comparator compare) const |
| void | sortedIntersection (UT_PtrArrayRaw const &other, Comparator compare) |
| void | sortedIntersection (UT_PtrArrayRaw const &other, UT_PtrArrayRaw &result, Comparator compare) const |
| void | sortedUnion (UT_PtrArrayRaw const &other, Comparator compare) |
| void | sortedUnion (UT_PtrArrayRaw const &other, UT_PtrArrayRaw &result, Comparator compare) const |
| unsigned int | uniqueSortedInsert (const void *t) |
| unsigned int | heapPush (const void *t, Comparator compare) |
| void * | heapPop (Comparator compare) |
| void * | heapMax () const |
| unsigned int | concat (const UT_PtrArrayRaw &a) |
| unsigned int | multipleInsert (unsigned int index, unsigned int count) |
| unsigned int | insertAt (const void *t, unsigned int index) |
| int | remove (const void *t) |
| int | remove (unsigned int index) |
| int | removeZeros () |
| void * | removeLast () |
| void | sortAndRemoveDuplicates () |
| int | shift (unsigned int srcIdx, unsigned int destIdx, unsigned int howMany) |
| void | move (int srcIdx, int destIdx, int howMany) |
| void | collapse () |
| void | cycle (int howMany) |
| void | reverse () |
| int | find (const void *t, unsigned int s=0) const |
| int | find (const void *t, int(*compare)(const void *, const void *)) const |
| int | findString (const char *str) const |
| void | sort (Comparator compare) |
| void | resize (unsigned int sz, unsigned short copyFlag=1) |
| uint | capacity (void) const |
| int64 | getMemoryUsage () const |
| uint | entries (void) const |
| bool | isEmpty (void) const |
| void | entries (unsigned int ne) |
| UT_PtrArrayRaw & | assignSubset (const UT_PtrArrayRaw &a) |
| UT_PtrArrayRaw & | operator= (const UT_PtrArrayRaw &a) |
| int | operator== (const UT_PtrArrayRaw &a) const |
| int | isEqual (const UT_PtrArrayRaw &a, int(*compare)(const void *t1, const void *t2)) const |
| void *& | operator() (unsigned int i) |
| void * | operator() (unsigned int i) const |
| void *& | operator[] (unsigned int i) |
| void * | operator[] (unsigned int i) const |
| unsigned int | apply (int(*applyFct)(void *t, void *d), void *d) |
| void * | array (void) const |
| void | setCapacity (unsigned int sz) |
| int | removeAt (unsigned int index) |
| void | heapify (unsigned int index, Comparator compare) |
Public Attributes | |
| void ** | arr |
| unsigned int | arrSize |
| unsigned int | nbrEntries |
Definition at line 33 of file UT_PtrArrayRaw.h.
| typedef int(* UT_PtrArrayRaw::Comparator)(const void *, const void *) |
Definition at line 35 of file UT_PtrArrayRaw.h.
| typedef bool(* UT_PtrArrayRaw::ComparatorBool)(const void *, const void *) |
Definition at line 36 of file UT_PtrArrayRaw.h.
| UT_PtrArrayRaw::UT_PtrArrayRaw | ( | unsigned int | sz = 0 |
) | [inline, explicit] |
Definition at line 41 of file UT_PtrArrayRaw.h.
| UT_PtrArrayRaw::~UT_PtrArrayRaw | ( | void | ) |
| UT_PtrArrayRaw::UT_PtrArrayRaw | ( | const UT_PtrArrayRaw & | a | ) |
| unsigned int UT_PtrArrayRaw::append | ( | const void * | t, | |
| int | checkForDup | |||
| ) |
| unsigned int UT_PtrArrayRaw::append | ( | const void * | t | ) |
| unsigned int UT_PtrArrayRaw::append | ( | void | ) | [inline] |
Definition at line 64 of file UT_PtrArrayRaw.h.
| unsigned int UT_PtrArrayRaw::apply | ( | int(*)(void *t, void *d) | applyFct, | |
| void * | d | |||
| ) |
| void* UT_PtrArrayRaw::array | ( | void | ) | const [inline] |
Definition at line 242 of file UT_PtrArrayRaw.h.
| UT_PtrArrayRaw& UT_PtrArrayRaw::assignSubset | ( | const UT_PtrArrayRaw & | a | ) |
| uint UT_PtrArrayRaw::capacity | ( | void | ) | const [inline] |
Definition at line 181 of file UT_PtrArrayRaw.h.
| void UT_PtrArrayRaw::collapse | ( | ) |
| unsigned int UT_PtrArrayRaw::concat | ( | const UT_PtrArrayRaw & | a | ) |
| void UT_PtrArrayRaw::cycle | ( | int | howMany | ) |
| void UT_PtrArrayRaw::entries | ( | unsigned int | ne | ) | [inline] |
Definition at line 187 of file UT_PtrArrayRaw.h.
| uint UT_PtrArrayRaw::entries | ( | void | ) | const [inline] |
Definition at line 183 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::find | ( | const void * | t, | |
| int(*)(const void *, const void *) | compare | |||
| ) | const |
| int UT_PtrArrayRaw::find | ( | const void * | t, | |
| unsigned int | s = 0 | |||
| ) | const |
| int UT_PtrArrayRaw::findString | ( | const char * | str | ) | const |
| int64 UT_PtrArrayRaw::getMemoryUsage | ( | void | ) | const [inline] |
Definition at line 182 of file UT_PtrArrayRaw.h.
| bool UT_PtrArrayRaw::hasSortedSubset | ( | UT_PtrArrayRaw const & | other, | |
| Comparator | compare | |||
| ) | const |
| void UT_PtrArrayRaw::heapify | ( | unsigned int | index, | |
| Comparator | compare | |||
| ) |
| void* UT_PtrArrayRaw::heapMax | ( | ) | const [inline] |
Definition at line 103 of file UT_PtrArrayRaw.h.
| void* UT_PtrArrayRaw::heapPop | ( | Comparator | compare | ) |
| unsigned int UT_PtrArrayRaw::heapPush | ( | const void * | t, | |
| Comparator | compare | |||
| ) |
| unsigned int UT_PtrArrayRaw::insert | ( | const void * | t, | |
| unsigned | index | |||
| ) |
| unsigned int UT_PtrArrayRaw::insert | ( | unsigned | index | ) |
| unsigned int UT_PtrArrayRaw::insertAt | ( | const void * | t, | |
| unsigned int | index | |||
| ) |
| bool UT_PtrArrayRaw::isEmpty | ( | void | ) | const [inline] |
Definition at line 184 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::isEqual | ( | const UT_PtrArrayRaw & | a, | |
| int(*)(const void *t1, const void *t2) | compare | |||
| ) | const |
| void UT_PtrArrayRaw::move | ( | int | srcIdx, | |
| int | destIdx, | |||
| int | howMany | |||
| ) |
| unsigned int UT_PtrArrayRaw::multipleInsert | ( | unsigned int | index, | |
| unsigned int | count | |||
| ) |
| void* UT_PtrArrayRaw::operator() | ( | unsigned int | i | ) | const [inline] |
Definition at line 216 of file UT_PtrArrayRaw.h.
| void*& UT_PtrArrayRaw::operator() | ( | unsigned int | i | ) | [inline] |
Definition at line 211 of file UT_PtrArrayRaw.h.
| UT_PtrArrayRaw& UT_PtrArrayRaw::operator= | ( | const UT_PtrArrayRaw & | a | ) |
| int UT_PtrArrayRaw::operator== | ( | const UT_PtrArrayRaw & | a | ) | const |
| void* UT_PtrArrayRaw::operator[] | ( | unsigned int | i | ) | const [inline] |
Definition at line 227 of file UT_PtrArrayRaw.h.
| void*& UT_PtrArrayRaw::operator[] | ( | unsigned int | i | ) | [inline] |
Definition at line 221 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::remove | ( | unsigned int | index | ) | [inline] |
Definition at line 125 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::remove | ( | const void * | t | ) |
| int UT_PtrArrayRaw::removeAt | ( | unsigned int | index | ) |
| void* UT_PtrArrayRaw::removeLast | ( | void | ) | [inline] |
Definition at line 134 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::removeZeros | ( | ) |
| void UT_PtrArrayRaw::resize | ( | unsigned int | sz, | |
| unsigned short | copyFlag = 1 | |||
| ) |
| void UT_PtrArrayRaw::reverse | ( | ) |
| void UT_PtrArrayRaw::setCapacity | ( | unsigned int | sz | ) | [inline] |
Definition at line 243 of file UT_PtrArrayRaw.h.
| int UT_PtrArrayRaw::shift | ( | unsigned int | srcIdx, | |
| unsigned int | destIdx, | |||
| unsigned int | howMany | |||
| ) |
| void UT_PtrArrayRaw::sort | ( | Comparator | compare | ) |
| void UT_PtrArrayRaw::sortAndRemoveDuplicates | ( | ) |
| unsigned int UT_PtrArrayRaw::sortedInsert | ( | const void * | t, | |
| Comparator | compare | |||
| ) |
| void UT_PtrArrayRaw::sortedIntersection | ( | UT_PtrArrayRaw const & | other, | |
| UT_PtrArrayRaw & | result, | |||
| Comparator | compare | |||
| ) | const |
| void UT_PtrArrayRaw::sortedIntersection | ( | UT_PtrArrayRaw const & | other, | |
| Comparator | compare | |||
| ) |
| void UT_PtrArrayRaw::sortedUnion | ( | UT_PtrArrayRaw const & | other, | |
| UT_PtrArrayRaw & | result, | |||
| Comparator | compare | |||
| ) | const |
| void UT_PtrArrayRaw::sortedUnion | ( | UT_PtrArrayRaw const & | other, | |
| Comparator | compare | |||
| ) |
| void UT_PtrArrayRaw::swap | ( | UT_PtrArrayRaw & | other | ) |
| unsigned int UT_PtrArrayRaw::uniqueSortedInsert | ( | const void * | t | ) |
| unsigned int UT_PtrArrayRaw::uniqueSortedInsert | ( | const void * | t, | |
| Comparator | compare | |||
| ) |
| void** UT_PtrArrayRaw::arr |
Definition at line 246 of file UT_PtrArrayRaw.h.
| unsigned int UT_PtrArrayRaw::arrSize |
Definition at line 250 of file UT_PtrArrayRaw.h.
| unsigned int UT_PtrArrayRaw::nbrEntries |
Definition at line 251 of file UT_PtrArrayRaw.h.
1.5.9