5 #include <libutl/BidIt.h> 47 virtual void forward(
size_t dist = 1);
49 virtual Object*
get()
const;
72 virtual void reverse(
size_t dist = 1);
74 virtual void set(
const Object* object);
124 Hashtable::end()
const size_t getIdx() const
Get the index of the hash chain.
void deInit()
De-initialize UTL++.
Hashtable * getHashtable() const
Get the associated Hashtable.
#define UTL_CLASS_DECL(DC, BC)
Declaration of standard UTL++ functionality for a non-template class.
void reverse(const BidIt &begin, const BidIt &end)
Reverse a sequence.
const size_t size_t_max
Maximum size_t value.
HashtableIt(const Hashtable *ht, size_t idx, ListNode *node)
Constructor.
#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.
const ListNode * getNode() const
Get the hash chain node.
void setConst(bool p_const)
Set the const flag.
Bi-directional Hashtable iterator.
Bi-directional iterator abstraction.
Chained hashing collection.
Root of UTL++ class hierarchy.
int compare(bool lhs, bool rhs)
Compare two boolean values.
void init()
Initialize UTL++.