Lines Matching full:objects

11 1. Objects are opaque pointers.  The implementation does not care where they
16       Pointers to objects _must_ be zero in the least significant bit.
18 2. Objects do not need to contain linkage blocks for use by the array.  This
20    Rather, the array is made up of metadata blocks that point to objects.
22 3. Objects require index keys to locate them within the array.
32 7. Index keys can include a hash to scatter objects throughout the array.
34 8. The array can iterated over.  The objects will not necessarily come out in
39    circumstances, some objects may be seen more than once.  If this is a
40    problem, the iterator should lock against modification.  Objects will not
43 10. Objects in the array can be looked up by means of their index key.
45 11. Objects can be looked up while the array is being modified, provided the
80 This is also used to keep track of dead blocks and dead objects after the
148 4. Diff the index keys of two objects::
222 4. Delete all objects from an associative array::
228 This deletes all the objects from an associative array and leaves it
238 5. Destroy an associative array, deleting all objects::
260 This iterates over the objects in an associative array and passes each one to
285 1. Iterate over all the objects in an associative array::
297 it is possible for the iteration function to see some objects twice.  If
299 iteration algorithm should not, however, miss any objects.
301 The function will return ``0`` if no objects were in the array or else it will
486 When the number of objects in the subtree rooted at a node falls to 16 or