Lines Matching full:list
2 * list.c: lists handling implementation
24 #include <libxml/list.h>
53 * @l: a list
56 * Unlink and deallocate @lk from list @l
90 * @l: a list
93 * Search data in the ordered list walking from the beginning
110 * @l: a list
113 * Search data in the ordered list walking backward from the end
130 * @l: a list
133 * Search data in the list
155 * @l: a list
158 * Search data in the list processing backward
183 * Create a new list
185 * Returns the new list or NULL in case of error
193 "Cannot initialize memory for list");
196 /* Initialize the list to NULL */
223 * @l: a list
226 * Search the list for an existing value of @data
244 * @l: a list
247 * Search the list in reverse order for an existing value of @data
265 * @l: a list
268 * Insert data in the ordered list at the beginning for this value
298 * @l: a list
301 * Insert data in the ordered list at the end for this value
329 * @l: a list
331 * Deletes the list and its associated data
345 * @l: a list
346 * @data: list data
348 * Remove the first instance associated to data in the list
370 * @l: a list
371 * @data: list data
373 * Remove the last instance associated to data in the list
395 * @l: a list
396 * @data: list data
398 * Remove the all instance associated to data in the list
417 * @l: a list
419 * Remove the all data in the list
439 * @l: a list
441 * Is the list empty ?
443 * Returns 1 if the list is empty, 0 if not empty and -1 in case of error
455 * @l: a list
457 * Get the first element in the list
459 * Returns the first element in the list, or NULL
471 * @l: a list
473 * Get the last element in the list
475 * Returns the last element in the list, or NULL
487 * @l: a list
489 * Get the number of elements in the list
491 * Returns the number of elements in the list or -1 in case of error
508 * @l: a list
510 * Removes the first element in the list
521 * @l: a list
523 * Removes the last element in the list
534 * @l: a list
537 * add the new data at the beginning of the list
566 * @l: a list
569 * add the new data at the end of the list
613 * @l: a list
615 * Reverse the order of the elements in the list
638 * @l: a list
640 * Sort all the elements in the list
653 * alternative is to implement some list copying procedure which
654 * would be based on a list copy followed by a clear followed by
668 * @l: a list
689 * @l: a list
693 * Walk all the element of the list in reverse order and
710 * @l1: the original list
711 * @l2: the new list
713 * include all the elements of the second list in the first one and
714 * clear the second list
725 * @old: the list
727 * Duplicate the list
729 * Returns a new copy of the list or NULL in case of error
740 * the new list or the old list. Surely not both. I'll arbitrarily
741 * set it to be the old list for the time being whilst I work out
753 * @cur: the new list
754 * @old: the old list
756 * Move all the element from the old list in the new list
