Lines Matching full:object

8 This associative array implementation is an object container with the following
19    permits an object to be located in multiple arrays simultaneously.
24 4. Index keys must be unique.  Inserting an object with the same key as one
25    already in the array will replace the old object.
52 pack leaf object pointers into spare space in the node rather than making an
53 extra branch until as such time an object needs to be added to a full node.
105 this was for insertion, the new object is _not_ released by this function,
132 2. Get a chunk of an object's index key::
134     unsigned long (*get_object_key_chunk)(const void *object, int level);
136 As the previous function, but gets its data from an object in the array
140 3. See if this is the object we're looking for::
142     bool (*compare_object)(const void *object, const void *index_key);
144 Compare the object against an index key and return ``true`` if it matches and
150     int (*diff_objects)(const void *object, const void *index_key);
152 Return the bit position at which the index key of the specified object
156 5. Free an object::
158     void (*free_object)(void *object);
160 Free the specified object.  Note that this may be called an RCU grace period
177 2. Insert/replace an object in an associative array::
183                        void *object);
185 This inserts the given object into the array.  Note that the least
189 If an object already exists for that key then it will be replaced with the
190 new object and the old one will be freed automatically.
202 3. Delete an object from an associative array::
209 This deletes an object that matches the specified data from the array.
216 an out-of-memory error.  ``NULL`` will be returned if the specified object is
257                        bool (*iterator)(void *object, void *iterator_data),
261 ``iterator()``.  If ``iterator()`` returns ``true``, the object is kept.  If it
262 returns ``false``, the object will be freed.  If the ``iterator()`` function
264 object before returning.
288                             int (*iterator)(const void *object,
292 This passes each object in the array to the iterator callback function.
307 2. Find an object in an associative array::
313 This walks through the array's internal tree directly to the object
319 The function will return the object if found (and set ``*_type`` to the object
320 type) or will return ``NULL`` if the object was not found.
358 * A pointer to an object (a leaf).
478 insertion algorithm finds that it is trying to insert a 17th object into a