Lines Matching refs:an

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
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.
91 The insertion and deletion functions produce an 'edit script' that can later be
99 after an RCU grace period has passed - thus allowing access functions to
108  (1) Apply an edit script.
117  (2) Cancel an edit script.
149  (2) Get a chunk of an object's index key.
153      As the previous function, but gets its data from an object in the array
161      Compare the object against an index key and return true if it matches and
173  (5) Free an object.
177      Free the specified object.  Note that this may be called an RCU grace
185 There are a number of functions for manipulating an associative array:
187  (1) Initialise an associative array.
191      This initialises the base structure for an associative array.  It can't
195  (2) Insert/replace an object in an associative array.
207      If an object already exists for that key then it will be replaced with the
214      an edit script that must be applied.  -ENOMEM is returned in the case of
215      an out-of-memory error.
220  (3) Delete an object from an associative array.
227      This deletes an object that matches the specified data from the array.
233      an edit script that must be applied.  -ENOMEM is returned in the case of
234      an out-of-memory error.  NULL will be returned if the specified object is
240  (4) Delete all objects from an associative array.
246      This deletes all the objects from an associative array and leaves it
250      an edit script that must be applied.  -ENOMEM is returned in the case of
251      an out-of-memory error.
256  (5) Destroy an associative array, deleting all objects.
271  (6) Garbage collect an associative array.
278      This iterates over the objects in an associative array and passes each one
301 There are two functions for accessing an associative array:
303  (1) Iterate over all the objects in an associative array.
313      This may be used on an array at the same time as the array is being
325  (2) Find an object in an associative array.
334      This may be used on an array at the same time as the array is being
346 very early on before any variation due to the length would have an effect on
371 The associative array data structure has an internal tree.  This tree is
374 A node is an array of slots.  Each slot can contain one of four things:
378  (*) A pointer to an object (a leaf).
532  (2) Simple delete.  This involves just clearing an old matching leaf.  The
572 Obsolete blocks and leaves are freed up after an RCU grace period has passed,