, including all inherited members.
| append(void) | UT_PtrArray< GB_Element * > | [inline] |
| append(GB_Element *t) | UT_PtrArray< GB_Element * > | [inline] |
| append(GB_Element *t, unsigned short checkForDup) | UT_PtrArray< GB_Element * > | [inline] |
| apply(int(*fcn)(GB_Element *t, void *d), void *d) | UT_PtrArray< GB_Element * > | [inline] |
| capacity(void) const | UT_PtrArray< GB_Element * > | [inline] |
| clearAndDestroy() | GB_ElementList | [inline] |
| collapse() | UT_PtrArray< GB_Element * > | [inline] |
| Comparator typedef | UT_PtrArray< GB_Element * > | |
| concat(const UT_PtrArray< GB_Element * > &a) | UT_PtrArray< GB_Element * > | [inline] |
| cycle(int howMany) | UT_PtrArray< GB_Element * > | [inline] |
| entries(void) const | UT_PtrArray< GB_Element * > | [inline] |
| entries(unsigned int ne) | UT_PtrArray< GB_Element * > | [inline] |
| find(GB_Element *t, unsigned int s=0) const | UT_PtrArray< GB_Element * > | [inline] |
| find(GB_Element *t, Comparator compare) const | UT_PtrArray< GB_Element * > | [inline] |
| findString(const char *str) const | UT_PtrArray< GB_Element * > | [inline] |
| GB_ElementList(unsigned size=0) | GB_ElementList | [inline] |
| getArray(void) const | UT_PtrArray< GB_Element * > | [inline] |
| getMemoryUsage() const | UT_PtrArray< GB_Element * > | [inline] |
| getRawArray() | UT_PtrArray< GB_Element * > | [inline] |
| getRawArray() const | UT_PtrArray< GB_Element * > | [inline] |
| hasSortedSubset(UT_PtrArray< GB_Element * > const &other, Comparator compare=(Comparator)&UTcomparePointers) const | UT_PtrArray< GB_Element * > | [inline] |
| heapMax() const | UT_PtrArray< GB_Element * > | [inline] |
| heapPop(Comparator compare) | UT_PtrArray< GB_Element * > | [inline] |
| heapPush(GB_Element *t, Comparator compare) | UT_PtrArray< GB_Element * > | [inline] |
| insert(unsigned idx) | UT_PtrArray< GB_Element * > | [inline] |
| insert(GB_Element *t, unsigned index) | UT_PtrArray< GB_Element * > | [inline] |
| insertAt(GB_Element *t, unsigned int index) | UT_PtrArray< GB_Element * > | [inline] |
| isEmpty(void) const | UT_PtrArray< GB_Element * > | [inline] |
| isEqual(const UT_PtrArray< GB_Element * > &a, int(*compare)(const void *t1, const void *t2)) const | UT_PtrArray< GB_Element * > | [inline] |
| last() | UT_PtrArray< GB_Element * > | [inline] |
| last() const | UT_PtrArray< GB_Element * > | [inline] |
| move(int srcIdx, int destIdx, int howMany) | UT_PtrArray< GB_Element * > | [inline] |
| multipleInsert(unsigned int index, unsigned int count) | UT_PtrArray< GB_Element * > | [inline] |
| operator!=(const UT_PtrArray< GB_Element * > &a) const | UT_PtrArray< GB_Element * > | [inline] |
| operator()(unsigned int i) | UT_PtrArray< GB_Element * > | [inline] |
| operator()(unsigned int i) const | UT_PtrArray< GB_Element * > | [inline] |
| operator=(const UT_PtrArray< GB_Element * > &a) | UT_PtrArray< GB_Element * > | [inline] |
| operator==(const UT_PtrArray< GB_Element * > &a) const | UT_PtrArray< GB_Element * > | [inline] |
| operator[](unsigned int i) | UT_PtrArray< GB_Element * > | [inline] |
| operator[](unsigned int i) const | UT_PtrArray< GB_Element * > | [inline] |
| rawEntry(unsigned n) const | GB_ElementList | [inline] |
| rawEntry(unsigned n) | GB_ElementList | [inline] |
| rawHead() const | GB_ElementList | [inline] |
| rawHead() | GB_ElementList | [inline] |
| rawHead(const GB_Group &group) const | GB_ElementList | |
| rawHead(const GB_Group &group) | GB_ElementList | |
| rawHeadMix(const GB_Group &group, const GB_Element *&elem, const GB_Element *&sec) const | GB_ElementList | |
| rawNext(const GB_Element *item) const | GB_ElementList | [inline] |
| rawNext(GB_Element *item) | GB_ElementList | [inline] |
| rawNext(const GB_Element *, const GB_Group &) const | GB_ElementList | |
| rawNext(GB_Element *item, const GB_Group &group) | GB_ElementList | |
| rawNextMix(const GB_Group &group, const GB_Element *&elem, const GB_Element *&sec, const GB_Element *&newelem, const GB_Element *&newsec) const | GB_ElementList | |
| rawPrev(const GB_Element *item) const | GB_ElementList | [inline] |
| rawPrev(GB_Element *item) | GB_ElementList | [inline] |
| rawPrev(const GB_Element *, const GB_Group &) const | GB_ElementList | |
| rawPrev(GB_Element *item, const GB_Group &group) | GB_ElementList | |
| rawPrevMix(const GB_Group &group, const GB_Element *&elem, const GB_Element *&sec, const GB_Element *&newelem, const GB_Element *&newsec) const | GB_ElementList | |
| rawTail() const | GB_ElementList | [inline] |
| rawTail() | GB_ElementList | [inline] |
| rawTail(const GB_Group &group) const | GB_ElementList | |
| rawTail(const GB_Group &group) | GB_ElementList | |
| rawTailMix(const GB_Group &group, const GB_Element *&elem, const GB_Element *&sec) const | GB_ElementList | |
| remove(GB_Element *t) | UT_PtrArray< GB_Element * > | [inline] |
| remove(unsigned int index) | UT_PtrArray< GB_Element * > | [inline] |
| removeLast() | UT_PtrArray< GB_Element * > | [inline] |
| removeZeros() | UT_PtrArray< GB_Element * > | [inline] |
| resize(unsigned int sz, unsigned short copyFlag=1) | UT_PtrArray< GB_Element * > | [inline] |
| resizeIfNeeded(uint sz, bool copyFlag=true) | UT_PtrArray< GB_Element * > | [inline] |
| reverse() | UT_PtrArray< GB_Element * > | [inline] |
| setSize(unsigned int sz) | UT_PtrArray< GB_Element * > | [inline, protected] |
| shift(unsigned int srcIdx, unsigned int destIdx, unsigned int howMany) | UT_PtrArray< GB_Element * > | [inline] |
| sort(Comparator compare=(Comparator)&UTcomparePointers) | UT_PtrArray< GB_Element * > | [inline] |
| sortAndRemoveDuplicates() | UT_PtrArray< GB_Element * > | [inline] |
| sortedInsert(GB_Element *t, Comparator compare) | UT_PtrArray< GB_Element * > | [inline] |
| sortedIntersection(UT_PtrArray< GB_Element * > const &other, Comparator compare=(Comparator)&UTcomparePointers) | UT_PtrArray< GB_Element * > | [inline] |
| sortedIntersection(UT_PtrArray< GB_Element * > const &other, UT_PtrArray< GB_Element * > &result, Comparator compare=(Comparator)&UTcomparePointers) const | UT_PtrArray< GB_Element * > | [inline] |
| sortedUnion(UT_PtrArray< GB_Element * > const &other, Comparator compare=(Comparator)&UTcomparePointers) | UT_PtrArray< GB_Element * > | [inline] |
| sortedUnion(UT_PtrArray< GB_Element * > const &other, UT_PtrArray< GB_Element * > &result, Comparator compare=(Comparator)&UTcomparePointers) const | UT_PtrArray< GB_Element * > | [inline] |
| swap(UT_PtrArray< GB_Element * > &other) | UT_PtrArray< GB_Element * > | [inline] |
| uniqueSortedInsert(GB_Element *t, Comparator compare) | UT_PtrArray< GB_Element * > | [inline] |
| uniqueSortedInsert(GB_Element *t) | UT_PtrArray< GB_Element * > | [inline] |
| UT_PtrArray(unsigned int sz=0) | UT_PtrArray< GB_Element * > | [inline, explicit] |
| UT_PtrArray(const UT_PtrArray< GB_Element * > &a) | UT_PtrArray< GB_Element * > | [inline] |
| ~GB_ElementList() | GB_ElementList | [virtual] |
| ~UT_PtrArray() | UT_PtrArray< GB_Element * > | [inline, virtual] |
