TABLE_

DISPENSER_

index

contents

structure


Containers: functionality

LIST_

allows storing objects. Retrieving is mainly by using iterators or cursors. The programmer will use containers mainly if she/he is not interested in retrieving objects by using a key or in a special sequence. A container just allows storing and performing some actions with the elements. Note that traversing a list is always done following the same rule, i.e. that two iterations through one list are performed in the same way - provided the fact that between the two iterations no element has been removed or inserted. More ...

TABLE_

allows storing objects and retrieving them by using keys. In addition one has the possibility to traverse a table like a list. In this case a possible constraint (comparable or hashable) has consequences for the sequence of the elements are visited by a cursor. The programmer will use tables if he/she has a meaningful key. Please note that a table with a INTEGER key can be used like a ARRAY (this has no relation to the implementation). More ...

Both containers can be traversed using special objects, cursors. Beside this it is possible to perform some actions with special classes - called iterators.

DISPENSER_

is a non-traversable container. Objects are stored and retrieved following special rules dependent on the dispenser type. The programmer will use dispensers if these rules are the most important criteria. More ...

There is some limited possibility to transform one container type into another type.

top

index

contents

structure


© Object Tools -- info@object-tools.com -- December 1999