| |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
This library defines an "iterator" (as much as one can emulate a real iterator in a language such as TSL) for data tables (ddt-interface). The main benefits of this iterator are: 1.) you can loop through any table in an uniform way, 2.) you can choose one of four algorithms to iterate through the range: * sequntial (forward) * sequential (reverse) * random (values may get repeated) * random (values will not be repeated) 3.) you can simultaneously have iterators for multiple data tables (ane at a time per table!) 4.) you can use it to iterate any range of numbers (unrelated to data tables).
NOTE!
from
and to
parameters. It would
be great if someone could find time to implement this.Method Summary | |
int | DDT_ACCESS_clean_range(in table) Removes range-access for given table and frees the internal buffers. |
int | DDT_ACCESS_get_next_in_range(in table) Returns the index of the next test to be processed. |
int | DDT_ACCESS_has_more_in_range(in table) Indicates whether there subsequent call to DDT_get_next_in_range() is about to succeed. |
int | DDT_ACCESS_init_range(in table, in from, in to, in mode) Initialises the range-access algorithm. |
Method Detail |
public int DDT_ACCESS_clean_range(in table)
public int DDT_ACCESS_get_next_in_range(in table)
public int DDT_ACCESS_has_more_in_range(in table)
public int DDT_ACCESS_init_range(in table, in from, in to, in mode)
| |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |