5 #include <libutl/BidIt.h> 34 : _deque(const_cast<
Deque*>(deque))
38 IFDEBUG(FwdIt::setOwner(deque));
47 virtual void forward(
size_t dist = 1);
49 virtual void reverse(
size_t dist = 1);
51 virtual Object*
get()
const;
60 virtual void set(
const Object* object);
71 _deque =
const_cast<Deque*
>(deque);
74 IFDEBUG(FwdIt::setOwner(deque));
104 bool isValid(
const utl::Object* owner =
nullptr)
const;
131 DequeIt it(
this, _beginBlock, _beginPos);
141 return DequeIt(
this, _beginBlock, _beginPos);
147 Deque::beginNew()
const 159 return new DequeIt(
this, _beginBlock, _beginPos);
167 DequeIt it(
this, _endBlock, _endPos);
177 return DequeIt(
this, _endBlock, _endPos);
183 Deque::endNew()
const 195 return new DequeIt(
this, _endBlock, _endPos);
void deInit()
De-initialize UTL++.
#define UTL_CLASS_DECL(DC, BC)
Declaration of standard UTL++ functionality for a non-template class.
const uint32_t uint32_t_max
Maximum uint32_t value.
void reverse(const BidIt &begin, const BidIt &end)
Reverse a sequence.
#define IFDEBUG(x)
Do x in DEBUG mode only.
unsigned int uint32_t
Unsigned 32-bit integer.
void copy(T *dest, const T *src, size_t len)
Copy one array of objects to another.
Deque * deque() const
Get the associated Deque.
DequeIt(const Deque *deque, Object ***blockPtr, uint32_t blockPos)
Constructor.
void setConst(bool p_const)
Set the const flag.
Bi-directional iterator abstraction.
A sequence of objects permitting efficient insertion and removal at either end.
Root of UTL++ class hierarchy.
int compare(bool lhs, bool rhs)
Compare two boolean values.
void init()
Initialize UTL++.