Lines Matching refs:object

28 This associative array implementation is an object container with the following
37      permits an object to be located in multiple arrays simultaneously.
42  (4) Index keys must be unique.  Inserting an object with the same key as one
43      already in the array will replace the old object.
70 pack leaf object pointers into spare space in the node rather than making an
71 extra branch until as such time an object needs to be added to a full node.
122      this was for insertion, the new object is _not_ released by this function,
149  (2) Get a chunk of an object's index key.
151 	unsigned long (*get_object_key_chunk)(const void *object, int level);
153      As the previous function, but gets its data from an object in the array
157  (3) See if this is the object we're looking for.
159 	bool (*compare_object)(const void *object, const void *index_key);
161      Compare the object against an index key and return true if it matches and
167 	int (*diff_objects)(const void *object, const void *index_key);
169      Return the bit position at which the index key of the specified object
173  (5) Free an object.
175 	void (*free_object)(void *object);
177      Free the specified object.  Note that this may be called an RCU grace
195  (2) Insert/replace an object in an associative array.
201 			   void *object);
203      This inserts the given object into the array.  Note that the least
207      If an object already exists for that key then it will be replaced with the
208      new object and the old one will be freed automatically.
220  (3) Delete an object from an associative array.
227      This deletes an object that matches the specified data from the array.
234      an out-of-memory error.  NULL will be returned if the specified object is
275 			   bool (*iterator)(void *object, void *iterator_data),
279      to iterator().  If iterator() returns true, the object is kept.  If it
280      returns false, the object will be freed.  If the iterator() function
282      object before returning.
306 				int (*iterator)(const void *object,
310      This passes each object in the array to the iterator callback function.
325  (2) Find an object in an associative array.
331      This walks through the array's internal tree directly to the object
337      The function will return the object if found (and set *_type to the object
338      type) or will return NULL if the object was not found.
378  (*) A pointer to an object (a leaf).
498 insertion algorithm finds that it is trying to insert a 17th object into a