|
libUTL++
|
This is the complete list of members for utl::Queue< T >, including all inherited members.
| _isA(const RunTimeClass *runTimeClass) const | utl::Object | inline |
| utl::Deque::add(const Object *object) | utl::Deque | virtual |
| addIt(const Object *object) | utl::Collection | virtual |
| addOrFind(const Object *object) | utl::SortedCollection | virtual |
| addOrUpdate(const Object *object) | utl::SortedCollection | virtual |
| utl::Object::addOwnedIt(const class FwdIt *it) const | utl::Object | virtual |
| allocatedSize() const | utl::Object | |
| assertOwner() | utl::Collection | |
| beginNew() const | utl::Deque | inlinevirtual |
| beginNew() | utl::Deque | inlinevirtual |
| clear() | utl::Deque | virtual |
| clobber(const SortedCollection *rhs) | utl::SortedCollection | |
| compare(const Object &rhs) const | utl::SortedCollection | virtual |
| contains(const Object *key) const | utl::Collection | inline |
| contains(const Object &key) const | utl::Collection | |
| copy(const Object &rhs) | utl::Collection | virtual |
| copyFlags(const FlagsMI &rhs) | utl::FlagsMI | inlineprotected |
| copyFlags(const FlagsMI &rhs, uint_t lsb, uint_t msb) | utl::FlagsMI | inlineprotected |
| copyFlags(uint64_t flags, uint_t lsb, uint_t msb) | utl::FlagsMI | inlineprotected |
| copyItems(const Collection *src, const Predicate *pred=nullptr, bool predVal=true) | utl::Collection | |
| copyItems(const ListNode *src, const Predicate *pred=nullptr, bool predVal=true) | utl::Collection | |
| copyItems(const SlistNode *src, const Predicate *pred=nullptr, bool predVal=true) | utl::Collection | |
| count(const Predicate *pred=nullptr, bool predVal=true) const | utl::Collection | |
| createIt() const | utl::Collection | virtual |
| createIt() | utl::Collection | virtual |
| deQ() | utl::Queue< T > | inline |
| utl::Deque::Deque(bool owner, Ordering *ordering=nullptr) | utl::Deque | |
| difference(const SortedCollection *rhs, Collection *out=nullptr) const | utl::SortedCollection | |
| dump(Stream &os, uint_t level=uint_t_max) const | utl::Collection | virtual |
| dump(Stream &os, uint_t level, bool key, bool printClassName, uint_t indent, const char *separator) const | utl::Collection | |
| dumpWithClassName(Stream &os, uint_t indent=4, uint_t level=uint_t_max) const | utl::Object | |
| empty() const | utl::Collection | inline |
| endNew() const | utl::Deque | inlinevirtual |
| endNew() | utl::Deque | inlinevirtual |
| enQ(const T &object) | utl::Queue< T > | inline |
| enQ(const T *object) | utl::Queue< T > | inline |
| find(const Object *key) const | utl::Collection | inline |
| find(const Object &key) const | utl::Collection | virtual |
| findEqualRange(const Object &key, BidIt &begin, BidIt &end) const | utl::SortedCollection | inline |
| findEqualRange(const Object &key, BidIt &begin, BidIt &end) | utl::SortedCollection | virtual |
| findFirstIt(const Object &key, BidIt &it, bool insert=false) const | utl::SortedCollection | inline |
| findFirstIt(const Object &key, BidIt &it, bool insert=false) | utl::SortedCollection | virtual |
| utl::Deque::findIt(const Object &key, BidIt &it) | utl::Deque | virtual |
| findLastIt(const Object &key, BidIt &it) const | utl::SortedCollection | inline |
| findLastIt(const Object &key, BidIt &it) | utl::SortedCollection | virtual |
| findLinear(const Object &key) const | utl::SortedCollection | |
| findLinearSorted(const Object &key) const | utl::SortedCollection | |
| findT(const Object &key) const | utl::TDeque< T > | inline |
| first() const | utl::Collection | |
| FlagsMI() | utl::FlagsMI | inlineprotected |
| getFlag(uint_t flagNum) const | utl::FlagsMI | inlineprotected |
| getFlags() const | utl::FlagsMI | inlineprotected |
| getFlagsNumber(uint64_t mask, uint64_t shift=0) | utl::FlagsMI | inlineprotected |
| getKey() const | utl::Object | virtual |
| getProxiedObject() const | utl::Object | virtual |
| getProxiedObject() | utl::Object | virtual |
| has(const Object *key) const | utl::Collection | inline |
| has(const Object &key) const | utl::Collection | inline |
| hash(size_t size) const | utl::Object | virtual |
| hasKey() const | utl::Object | inline |
| innerAllocatedSize() const | utl::Deque | virtual |
| insert(const Object &object, const BidIt &it) | utl::SortedCollection | inline |
| insert(const Object *object, const BidIt &it) | utl::SortedCollection | virtual |
| intersect(const SortedCollection *rhs) | utl::SortedCollection | inline |
| intersectCard(const SortedCollection *rhs) const | utl::SortedCollection | |
| intersection(const SortedCollection *rhs, Collection *out=nullptr, bool multiSet=false) const | utl::SortedCollection | |
| intersects(const SortedCollection *rhs) const | utl::SortedCollection | |
| isMarked() const | utl::Collection | inline |
| isMultiSet() const | utl::Collection | inline |
| isOwner() const | utl::Collection | inline |
| isSubSet(const SortedCollection *rhs) const | utl::SortedCollection | |
| isSuperSet(const SortedCollection *rhs) const | utl::SortedCollection | inline |
| items() const | utl::Collection | inline |
| last() const | utl::Collection | |
| merge(const SortedCollection *rhs, Collection *out=nullptr) const | utl::SortedCollection | |
| multiKeyQuickSort(bool key=true, bool reverse=false) | utl::SortedCollection | |
| operator &=(const SortedCollection *rhs) | utl::SortedCollection | inline |
| operator String() const | utl::Object | |
| operator!=(const Object &rhs) const | utl::Object | inline |
| operator()(const Object *object) | utl::Collection | inline |
| operator+=(const Object &rhs) | utl::Collection | inline |
| operator+=(const Object *rhs) | utl::Collection | inline |
| operator+=(const Collection &rhs) | utl::Collection | inline |
| operator-=(const SortedCollection &rhs) | utl::SortedCollection | inline |
| utl::Collection::operator-=(const Object &rhs) | utl::Collection | inline |
| operator<(const Object &rhs) const | utl::Object | inline |
| operator<=(const SortedCollection *rhs) | utl::SortedCollection | inline |
| utl::Collection::operator<=(const Object &rhs) const | utl::Object | inline |
| operator==(const Object &rhs) const | utl::Object | inline |
| operator>(const Object &rhs) const | utl::Object | inline |
| operator>=(const SortedCollection *rhs) | utl::SortedCollection | inline |
| utl::Collection::operator>=(const Object &rhs) const | utl::Object | inline |
| operator[](const Object *object) | utl::Collection | inline |
| ordering() const | utl::Collection | inline |
| ordering() | utl::Collection | inline |
| popBack() | utl::Deque | |
| popFront() | utl::Deque | |
| pushBack(const Object &object) | utl::Deque | inline |
| pushBack(const Object *object) | utl::Deque | |
| pushFront(const Object &object) | utl::Deque | inline |
| pushFront(const Object *object) | utl::Deque | |
| Queue(bool owner) | utl::Queue< T > | inline |
| remove(const Object &key) | utl::SortedCollection | inlinevirtual |
| remove(const SortedCollection *rhs) | utl::SortedCollection | inline |
| removeBack() | utl::Deque | |
| removeFront() | utl::Deque | |
| removeIt(BidIt &it) | utl::SortedCollection | inlinevirtual |
| removeIt(BidIt &begin, const BidIt &end) | utl::SortedCollection | virtual |
| utl::Object::removeOwnedIt(const class FwdIt *it) const | utl::Object | virtual |
| reverse() | utl::SortedCollection | |
| serialize(Stream &stream, uint_t io, uint_t mode=ser_default) | utl::Collection | inlinevirtual |
| serialize(const RunTimeClass *rtc, Stream &stream, uint_t io, uint_t mode=ser_default) | utl::Collection | |
| serializeBoxed(Object *&object, Stream &stream, uint_t io, uint_t mode=ser_default) | utl::Object | inlinestatic |
| serializeIn(Stream &is, uint_t mode=ser_default) | utl::Object | inline |
| serializeInBoxed(Stream &is, uint_t mode=ser_default) | utl::Object | static |
| serializeInNullable(Stream &is, uint_t mode=ser_default) | utl::Object | static |
| serializeNullable(Object *&object, Stream &stream, uint_t io, uint_t mode=ser_default) | utl::Object | static |
| serializeOut(Stream &os, uint_t mode=ser_default) const | utl::Object | inline |
| serializeOutBoxed(Stream &os, uint_t mode=ser_default) const | utl::Object | |
| serializeOutNullable(const Object *object, Stream &os, uint_t mode=ser_default) | utl::Object | static |
| setFlag(uint_t flagNum, bool val) | utl::FlagsMI | inlineprotected |
| setFlags(uint64_t flags) | utl::FlagsMI | inlineprotected |
| setFlagsNumber(uint64_t mask, uint64_t shift, uint64_t num) | utl::FlagsMI | inlineprotected |
| setMarked(bool marked=true) | utl::Collection | inline |
| setMultiSet(bool multiSet) | utl::Collection | inline |
| setOrdering(const Ordering &ordering, uint_t algorithm=sort_quickSort) | utl::SortedCollection | inline |
| setOrdering(Ordering *ordering, uint_t algorithm=sort_quickSort) | utl::SortedCollection | virtual |
| setOwner(bool owner) | utl::Collection | inline |
| size() const | utl::Collection | inline |
| sort() | utl::SortedCollection | inline |
| sort(uint_t algorithm) | utl::SortedCollection | virtual |
| steal(Object &rhs) | utl::Deque | virtual |
| stealItems(Collection *src) | utl::Collection | |
| symmetricDifference(const SortedCollection *rhs, Collection *out=nullptr) const | utl::SortedCollection | |
| symmetricDifference(const SortedCollection *rhs, Collection *lhsOut, Collection *rhsOut) const | utl::SortedCollection | |
| take(BidIt &it) | utl::Collection | |
| testSorted() const | utl::SortedCollection | |
| toString() const | utl::Collection | virtual |
| toString(bool key) const | utl::Collection | |
| toString(const char *sep, bool key=false) const | utl::Collection | inline |
| toString(const String &sep, bool key=false) const | utl::Collection | |
| unique(Collection *out=nullptr) | utl::SortedCollection | |
| update(const Object *object) | utl::Collection | virtual |
| vclone(const Object &rhs) | utl::Collection | virtual |
| ~FlagsMI() | utl::FlagsMI | inlineprotectedvirtual |