5 #include <libutl/SortedCollection.h> 44 virtual void steal(
Object& rhs);
46 virtual size_t innerAllocatedSize()
const;
64 Object*
get(
size_t idx)
const;
69 iterator findIt(
const Object& key)
const;
71 iterator findIt(
const Object& key);
88 return super::add(
object);
91 virtual bool add(
const Object*
object);
96 super::add(collection);
103 return isOwner() ? pushFront(
object.
clone()) : pushFront(&
object);
110 return isOwner() ? pushBack(
object.
clone()) : pushBack(&
object);
114 bool pushFront(
const Object*
object);
117 bool pushBack(
const Object*
object);
123 virtual void clear();
140 inline iterator begin()
const;
142 inline iterator begin();
144 inline virtual BidIt* beginNew()
const;
146 inline virtual BidIt* beginNew();
148 inline iterator end()
const;
150 inline iterator end();
152 inline virtual BidIt* endNew()
const;
154 inline virtual BidIt* endNew();
158 void init(
bool owner =
true,
Ordering* ordering =
nullptr);
181 #include <libutl/TDeque.h> bool pushFront(const Object &object)
Add the given object at the front end.
T * clone(const T *object)
Create a clone of the given object.
#define const_cast_this
Pointer to the object the method was invoked on (casting away const).
void deInit()
De-initialize UTL++.
Object * back() const
Return the object at the back end (nullptr if none).
Object comparison abstraction.
#define UTL_CLASS_DECL(DC, BC)
Declaration of standard UTL++ functionality for a non-template class.
Templated proxy for BidIt.
#define IFDEBUG(x)
Do x in DEBUG mode only.
unsigned int uint32_t
Unsigned 32-bit integer.
bool pushBack(const Object &object)
Add the given object at the back end.
Abstraction for a Collection whose objects may be sorted.
void setConst(bool p_const)
Set the const flag.
Bi-directional iterator abstraction.
Object * front() const
Return the object at the front end (nullptr if none).
A sequence of objects permitting efficient insertion and removal at either end.
Root of UTL++ class hierarchy.
void init()
Initialize UTL++.