|
Developer Documentation |
|
Centre for Vision, Speech & Signal Processing |
Comments:
This iterator works with both HashC and HashARC.
Small object !
Parent Classes:
Derived Classes:
Variables:
- HashC HashTab;
-
Handle for table.
- HashC::HashElemConstIter LIt;
-
List iterator.
- UIndex Bin;
-
Current bin number.
Methods:
- HashIterC()
-
Don't use this if you can help it.
- HashIterC(const HashC<K,T> & nTab)
-
Normal constructor.
- HashIterC(const HashIterC<K,T> & Oth)
-
Copy constructor.
- BooleanT First(void)
-
Goto first item in table.
- BooleanT Next(void)
-
Goto next iterm in table.
Once this returns false (or IsElm() is false) this
should not be called again.
- void operator++(int)
-
Goto next element.
- BooleanT IsElm() const
-
Pointing to valid element ?
- operator BooleanT() const
-
At a valid element ?
- const K & Key(void) const
-
Key for current item. IsElm() Must be TRUE.
- const T & Data(void) const
-
Data for current item.IsElm() Must be TRUE.
- T & Data(void)
-
Data for current item.IsElm() Must be TRUE.
- T & operator*()
-
Access data.
- const T & operator*() const
-
Access data.
- void Del(void)
-
Delete current item from table, move to next.
-> this breaks HashAR, if required I'll
make a new non-constant iterator which can do this.
- HashIterC<K,T> & operator=(const HashC<K,T> & Oth)
-
Assign to another table.
- HashIterC<K,T> & operator=(const HashIterC<K,T> & Oth)
-
Assign to another iterator.
- const HashC<K,T> & GetTable() const
-
Which table ?
- BooleanT CheckValid(void)
-
|
Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001
|