#include <UT_IntArray.h>

Public Member Functions | |
| UT_IntArray (const UT_IntArray &a) | |
| UT_IntArray (unsigned int sz=0, unsigned int count=0) | |
| ~UT_IntArray (void) | |
| void | swap (UT_IntArray &other) |
| void | merge (const UT_IntArray &other, int direction, bool allow_dups) |
| void | sortedUnion (const UT_IntArray &other) |
| void | sortedUnion (const UT_IntArray &other, UT_IntArray &result) const |
| void | sortedIntersection (const UT_IntArray &other) |
| void | sortedIntersection (const UT_IntArray &other, UT_IntArray &result) const |
| void | sortedSetDifference (const UT_IntArray &other) |
| void | sortedSetDifference (const UT_IntArray &other, UT_IntArray &result) const |
| void | fromStdVectorOfInts (const std::vector< int > &vec) |
| void | toStdVectorOfInts (std::vector< int > &vec) const |
| unsigned int | uniqueSortedInsertAscending (int item) |
| int | uniqueSortedFindAscending (int item) const |
| unsigned int | heapPush (int t) |
| int | heapPop () |
| int | heapMax () const |
| unsigned int | append (void) |
| unsigned int | append (int t) |
| unsigned int | insert (unsigned index) |
| unsigned int | insert (int t, unsigned index) |
| unsigned int | concat (const UT_IntArray &a) |
| unsigned int | multipleInsert (unsigned int index, unsigned int count) |
| unsigned int | insertAt (int t, unsigned int index) |
| int | findAndRemove (int t) |
| int | removeIndex (unsigned int index) |
| int | removeLast () |
| void | reverse () |
| int | shift (unsigned int srcIdx, unsigned int destIdx, unsigned int howMany) |
| void | cycle (int howMany) |
| void | constant (int v=0) |
| int | find (int t, unsigned int s=0) const |
| int | find (int t, int(*compare)(const int *, const int *)) const |
| void | sort (int(*compare)(const int *t1, const int *t2)) |
| void | sortAscending () |
| 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 (uint ne) |
| UT_IntArray & | operator= (const UT_IntArray &a) |
| bool | operator!= (const UT_IntArray &a) const |
| int | operator== (const UT_IntArray &a) const |
| int | isEqual (const UT_IntArray &a, int(*compare)(const int *t1, const int *t2)) const |
| int & | operator() (unsigned int i) |
| int | operator() (unsigned int i) const |
| int & | operator[] (unsigned int i) |
| int | operator[] (unsigned int i) const |
| int & | last () |
| int | last () const |
| void | copyMemory (const UT_IntArray &from) |
| unsigned int | apply (int(*applyFct)(int &t, void *d), void *d) |
| const int * | getRawArray (void) const |
| int * | array (void) |
| void | setCapacity (unsigned int sz) |
| void | display () const |
Definition at line 31 of file UT_IntArray.h.
| UT_IntArray::UT_IntArray | ( | const UT_IntArray & | a | ) |
| UT_IntArray::UT_IntArray | ( | unsigned int | sz = 0, |
|
| unsigned int | count = 0 | |||
| ) | [inline, explicit] |
Definition at line 36 of file UT_IntArray.h.
| UT_IntArray::~UT_IntArray | ( | void | ) |
| unsigned int UT_IntArray::append | ( | int | t | ) |
| unsigned int UT_IntArray::append | ( | void | ) | [inline] |
| unsigned int UT_IntArray::apply | ( | int(*)(int &t, void *d) | applyFct, | |
| void * | d | |||
| ) |
| int* UT_IntArray::array | ( | void | ) | [inline] |
Definition at line 235 of file UT_IntArray.h.
| uint UT_IntArray::capacity | ( | void | ) | const [inline] |
Definition at line 168 of file UT_IntArray.h.
| unsigned int UT_IntArray::concat | ( | const UT_IntArray & | a | ) |
| void UT_IntArray::constant | ( | int | v = 0 |
) |
| void UT_IntArray::copyMemory | ( | const UT_IntArray & | from | ) | [inline] |
Definition at line 226 of file UT_IntArray.h.
| void UT_IntArray::cycle | ( | int | howMany | ) |
| void UT_IntArray::display | ( | ) | const |
| void UT_IntArray::entries | ( | unsigned int | ne | ) | [inline] |
Definition at line 174 of file UT_IntArray.h.
| uint UT_IntArray::entries | ( | void | ) | const [inline] |
| int UT_IntArray::find | ( | int | t, | |
| int(*)(const int *, const int *) | compare | |||
| ) | const |
| int UT_IntArray::find | ( | int | t, | |
| unsigned int | s = 0 | |||
| ) | const |
| int UT_IntArray::findAndRemove | ( | int | t | ) |
| void UT_IntArray::fromStdVectorOfInts | ( | const std::vector< int > & | vec | ) |
| int64 UT_IntArray::getMemoryUsage | ( | void | ) | const [inline] |
Definition at line 169 of file UT_IntArray.h.
| const int* UT_IntArray::getRawArray | ( | void | ) | const [inline] |
Definition at line 234 of file UT_IntArray.h.
| int UT_IntArray::heapMax | ( | ) | const [inline] |
Definition at line 88 of file UT_IntArray.h.
| int UT_IntArray::heapPop | ( | ) |
| unsigned int UT_IntArray::heapPush | ( | int | t | ) |
| unsigned int UT_IntArray::insert | ( | int | t, | |
| unsigned | index | |||
| ) |
| unsigned int UT_IntArray::insert | ( | unsigned | index | ) |
| unsigned int UT_IntArray::insertAt | ( | int | t, | |
| unsigned int | index | |||
| ) |
| bool UT_IntArray::isEmpty | ( | void | ) | const [inline] |
Definition at line 171 of file UT_IntArray.h.
| int UT_IntArray::isEqual | ( | const UT_IntArray & | a, | |
| int(*)(const int *t1, const int *t2) | compare | |||
| ) | const |
| int UT_IntArray::last | ( | ) | const [inline] |
Definition at line 221 of file UT_IntArray.h.
| int& UT_IntArray::last | ( | ) | [inline] |
Definition at line 216 of file UT_IntArray.h.
| void UT_IntArray::merge | ( | const UT_IntArray & | other, | |
| int | direction, | |||
| bool | allow_dups | |||
| ) |
| unsigned int UT_IntArray::multipleInsert | ( | unsigned int | index, | |
| unsigned int | count | |||
| ) |
| bool UT_IntArray::operator!= | ( | const UT_IntArray & | a | ) | const |
| int UT_IntArray::operator() | ( | unsigned int | i | ) | const [inline] |
Definition at line 200 of file UT_IntArray.h.
| int& UT_IntArray::operator() | ( | unsigned int | i | ) | [inline] |
Definition at line 195 of file UT_IntArray.h.
| UT_IntArray& UT_IntArray::operator= | ( | const UT_IntArray & | a | ) |
| int UT_IntArray::operator== | ( | const UT_IntArray & | a | ) | const |
| int UT_IntArray::operator[] | ( | unsigned int | i | ) | const [inline] |
Definition at line 211 of file UT_IntArray.h.
| int& UT_IntArray::operator[] | ( | unsigned int | i | ) | [inline] |
Definition at line 205 of file UT_IntArray.h.
| int UT_IntArray::removeIndex | ( | unsigned int | index | ) | [inline] |
Definition at line 126 of file UT_IntArray.h.
| int UT_IntArray::removeLast | ( | void | ) | [inline] |
Definition at line 128 of file UT_IntArray.h.
| void UT_IntArray::resize | ( | unsigned int | sz, | |
| unsigned short | copyFlag = 1 | |||
| ) |
| void UT_IntArray::resizeIfNeeded | ( | uint | sz, | |
| bool | copyFlag = true | |||
| ) | [inline] |
Definition at line 160 of file UT_IntArray.h.
| void UT_IntArray::reverse | ( | ) |
| void UT_IntArray::setCapacity | ( | unsigned int | sz | ) | [inline] |
Definition at line 236 of file UT_IntArray.h.
| int UT_IntArray::shift | ( | unsigned int | srcIdx, | |
| unsigned int | destIdx, | |||
| unsigned int | howMany | |||
| ) |
| void UT_IntArray::sort | ( | int(*)(const int *t1, const int *t2) | compare | ) |
| void UT_IntArray::sortAscending | ( | ) |
| void UT_IntArray::sortedIntersection | ( | const UT_IntArray & | other, | |
| UT_IntArray & | result | |||
| ) | const |
| void UT_IntArray::sortedIntersection | ( | const UT_IntArray & | other | ) |
| void UT_IntArray::sortedSetDifference | ( | const UT_IntArray & | other, | |
| UT_IntArray & | result | |||
| ) | const |
| void UT_IntArray::sortedSetDifference | ( | const UT_IntArray & | other | ) |
| void UT_IntArray::sortedUnion | ( | const UT_IntArray & | other, | |
| UT_IntArray & | result | |||
| ) | const |
| void UT_IntArray::sortedUnion | ( | const UT_IntArray & | other | ) |
| void UT_IntArray::swap | ( | UT_IntArray & | other | ) |
| void UT_IntArray::toStdVectorOfInts | ( | std::vector< int > & | vec | ) | const |
| void UT_IntArray::truncate | ( | uint | ne | ) | [inline] |
Definition at line 175 of file UT_IntArray.h.
| int UT_IntArray::uniqueSortedFindAscending | ( | int | item | ) | const |
| unsigned int UT_IntArray::uniqueSortedInsertAscending | ( | int | item | ) |
1.5.9