Lines Matching full:list

36  *     notice, this list of conditions and the following disclaimer.
38  *     notice, this list of conditions and the following disclaimer in
60  * @brief This header file contains simple linked list manipulation macros.
62  *        an element from the list is O(n).
67  *           2) it is possible to detach the entire list from its anchor
71  *       random locations within the list use instead the SCI_FAST_LIST.
82  * Initialize the singely linked list anchor.  The other macros require the
83  * list anchor to be properly initialized.
93  * Initialze the singely linked list element. The other macros require the
94  * list element to be properly initialized.
103  * See if there are any list elements on this list.
108  * Return a pointer to the list element at the head of the list.  The list
109  * element is not removed from the list.
114  * Retuen a pointer to the lsit element at the tail of the list.  The list
115  * element is not removed from the list.
120  * Return the count of the number of elements in this list.
125  * Return a pointer to the list element following this list element.
126  * If this is the last element in the list then NULL is returned.
131  * Return the object represented by the list element.
145  * @brief This structure defines the list owner for singely linked list.
157  * @brief This structure defines what a singely linked list element contains.
166  * This method will insert the list element to the head of the list contained
169  * @note Pushing new elements onto a list is more efficient than inserting
170  *       them to the tail of the list though both are O(1) operations.
189  * This methos will insert the list element to the tail of the list contained
192  * @param[in, out] anchor this is the list into which the element is to be
194  * @param[in] element this is the element which to insert into the list.
196  * @note Pushing new elements onto a list is more efficient than inserting
197  *       them to the tail of the list though both are O(1) operations.
219  * This method will remove the list element from the anchor and return the
220  * object pointed to by that list element.
222  * @param[in, out] anchor this is the list into which the element is to be
225  * @return the list element at the head of the list.
252  * Move all the list elements from source anchor to the dest anchor.
254  * an empty list and the dest anchor will contain all of the source
255  * and dest list elements.
257  * @param[in, out] dest_anchor this is the list into which all elements from
258  *                 the source list are to be moved.
259  * @param[in, out] source_anchor this is the list which is to be moved to the
260  *                 destination list.  This list will be empty on return.
262  * @return the list element at the head of the list.
263  * @note If the destination has list elements use the insert at head
278  * This method will insert the list elements from the source anchor to the
279  * destination list before all previous elements on the destination list.
281  * @param[in, out] dest_anchor this is the list into which all elements from
282  *                 the source list are to be moved. The destination list will
283  *                 now contain both sets of list elements.
284  * @param[in, out] source_anchor this is the list which is to be moved to the
285  *                 destination list.  This list will be empty on return.
307       // Wipe the source list to make sure the list elements can not be accessed  in sci_simple_list_insert_list_at_head()
314  * This method will insert the list elements from the source anchor to the
315  * destination anchor after all list elements on the destination anchor.
317  * @param[in, out] dest_anchor this is the list into which all elements from
318  *                 the source list are to be moved. The destination list will
319  *                 contain both the source and destination list elements.
320  * @param[in, out] source_anchor this is the list which is to be moved to the
321  *                 destination list.  This list will be empty on return.
338          // If the source list is empty the desination list is the result.  in sci_simple_list_insert_list_at_tail()
344       // Wipe the source list to make sure the list elements can not be accessed  in sci_simple_list_insert_list_at_tail()