libUTL++
|
This is the complete list of members for utl::TArray< T >, including all inherited members.
_isA(const RunTimeClass *runTimeClass) const | utl::Object | inline |
utl::Array::add(const Object *object) | utl::Array | inlinevirtual |
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 | |
utl::Array::Array(size_t size, size_t increment=size_t_max, bool owner=true, bool multiSet=true, bool keepSorted=false, Ordering *ordering=nullptr) | utl::Array | |
utl::Array::Array(bool owner, bool multiSet=true, bool keepSorted=false, Ordering *ordering=nullptr) | utl::Array | |
assertOwner() | utl::Collection | |
utl::SortedCollection::begin() | utl::Collection | |
beginNew() const | utl::Array | inlinevirtual |
beginNew() | utl::Array | inlinevirtual |
clear() | utl::Array | 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::Array | 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 |
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 | |
economize() | utl::Array | inline |
empty() const | utl::Collection | inline |
utl::SortedCollection::end() | utl::Collection | |
endNew() const | utl::Array | inlinevirtual |
endNew() | utl::Array | inlinevirtual |
excise() | utl::Array | inline |
find(const Object &key) const | utl::Array | virtual |
utl::SortedCollection::find(const Object *key) const | utl::Collection | inline |
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) | utl::TArray< T > | inlinevirtual |
utl::Array::findFirstIt(const Object &key, bool insert=false) const | utl::Array | |
findIndex(const Object &key, uint_t findType=uint_t_max, size_t low=0, size_t high=size_t_max) const | utl::Array | |
findIt(const Object &key, BidIt &it) | utl::TArray< T > | inlinevirtual |
findLastIt(const Object &key, BidIt &it) | utl::TArray< T > | inlinevirtual |
utl::Array::findLastIt(const Object &key) const | utl::Array | |
findLinear(const Object &key) const | utl::SortedCollection | |
findLinearSorted(const Object &key) const | utl::SortedCollection | |
first() const | utl::Collection | |
firstNull() const | utl::Array | inline |
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 |
hasHole() const | utl::Array | inline |
hasKey() const | utl::Object | inline |
innerAllocatedSize() const | utl::Array | virtual |
insert(const Object *object, const BidIt &it) | utl::TArray< T > | inlinevirtual |
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 | |
isKeptSorted() const | utl::Array | inline |
isMarked() const | utl::Collection | inline |
isMultiSet() const | utl::Collection | inline |
isOwner() const | utl::Collection | inline |
isSorted() const | utl::Array | 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 |
utl::Array::operator()(const Object *object) | utl::Array | 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 |
ordering() const | utl::Collection | inline |
ordering() | utl::Collection | inline |
remove(const Object &key) | utl::Array | inlinevirtual |
remove(const Object &key, bool relocate, bool preserveOrder=true) | utl::Array | |
remove(size_t idx, bool relocate=true, bool preserveOrder=true) | utl::Array | |
utl::SortedCollection::remove(const SortedCollection *rhs) | utl::SortedCollection | inline |
removeHoles(size_t low=0, size_t high=size_t_max) | utl::Array | |
removeIt(BidIt &it) | utl::TArray< T > | inlinevirtual |
utl::Array::removeIt(iterator it, bool relocate=true, bool preserveOrder=true) | utl::Array | |
utl::Array::removeIt(iterator begin, iterator end, bool relocate=true, bool preserveOrder=true) | utl::Array | |
utl::SortedCollection::removeIt(BidIt &begin, const BidIt &end) | utl::SortedCollection | virtual |
removeItems(size_t idx, size_t num, bool relocate=true, bool preserveOrder=true) | utl::Array | |
utl::Object::removeOwnedIt(const class FwdIt *it) const | utl::Object | virtual |
utl::Array::replace(iterator it, const Object *newObject, bool keepSorted=true) | utl::Array | |
utl::Array::replace(const Object &oldObject, const Object *newObject) | utl::Array | inline |
reserve(size_t minSize) | utl::Array | inline |
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 |
set(size_t idx, const Object &object, size_t firstNull=size_t_max) | utl::Array | inline |
set(size_t idx, const Object *object, size_t firstNull=size_t_max) | utl::Array | |
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 |
setIncrement(size_t increment) | utl::Array | inline |
setKeepSorted(bool keepSorted) | utl::Array | inline |
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 |
setSorted(bool sorted) | utl::Array | inline |
shuffle(size_t low=0, size_t high=size_t_max, randutils::mt19937_64_rng *rng=nullptr) | utl::Array | |
size() const | utl::Collection | inline |
sort(uint_t algorithm) | utl::Array | virtual |
steal(Object &rhs) | utl::Array | 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 | |
TArray(size_t size, size_t increment=uint_t_max, bool owner=true, bool multiSet=true, bool keepSorted=false, Ordering *ordering=nullptr) | utl::TArray< T > | inline |
TArray(bool owner, bool multiSet=true, bool keepSorted=false, Ordering *ordering=nullptr) | utl::TArray< T > | inline |
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 | |
totalSize() const | utl::Array | inline |
unique(Collection *out=nullptr) | utl::SortedCollection | |
update(const Object *object) | utl::Collection | virtual |
vclone(const Object &rhs) | utl::Collection | virtual |
~FlagsMI() | utl::FlagsMI | inlineprotectedvirtual |