5 #include <libutl/BidIt.h> 33 : _heap(const_cast<
Heap*>(heap))
36 IFDEBUG(FwdIt::setOwner(_heap));
45 virtual void forward(
size_t dist = 1);
47 virtual Object*
get()
const;
63 virtual void reverse(
size_t dist = 1);
65 virtual void set(
const Object* object);
115 iterator it(
this, 0);
125 return iterator(
this, 0);
131 Heap::beginNew()
const void deInit()
De-initialize UTL++.
#define UTL_CLASS_DECL(DC, BC)
Declaration of standard UTL++ functionality for a non-template class.
HeapIt(const Heap *heap, size_t idx)
Constructor.
size_t getIdx() const
Get the heap index.
void reverse(const BidIt &begin, const BidIt &end)
Reverse a sequence.
Templated proxy for BidIt.
const size_t size_t_max
Maximum size_t value.
#define IFDEBUG(x)
Do x in DEBUG mode only.
void copy(T *dest, const T *src, size_t len)
Copy one array of objects to another.
Heap * getHeap() const
Get the associated Heap.
void setConst(bool p_const)
Set the const flag.
Bi-directional Heap iterator.
Bi-directional iterator abstraction.
Root of UTL++ class hierarchy.
int compare(bool lhs, bool rhs)
Compare two boolean values.
void init()
Initialize UTL++.