Lines Matching refs:objects

34      [!] NOTE: Pointers to objects _must_ be zero in the least significant bit.
38      Rather, the array is made up of metadata blocks that point to objects.
50  (7) Index keys can include a hash to scatter objects throughout the array.
52  (8) The array can iterated over.  The objects will not necessarily come out in
57      circumstances, some objects may be seen more than once.  If this is a
97 This is also used to keep track of dead blocks and dead objects after the
165  (4) Diff the index keys of two objects.
240  (4) Delete all objects from an associative array.
246      This deletes all the objects from an associative array and leaves it
256  (5) Destroy an associative array, deleting all objects.
278      This iterates over the objects in an associative array and passes each one
303  (1) Iterate over all the objects in an associative array.
315      it is possible for the iteration function to see some objects twice.  If
317      iteration algorithm should not, however, miss any objects.
319      The function will return 0 if no objects were in the array or else it will
506 When the number of objects in the subtree rooted at a node falls to 16 or