Lines Matching full:list
3 Single-linked List
7 singly-linked list data (i.e. data where each list element stores a
10 the list, insertion before the head and after the tail of the list and
13 performed in linear time by searching the list.
21 The end nodes of a list may be retrieved with
23 return NULL if the list is empty, otherwise a pointer to a
28 usually embedded within a struct which is to be added to the list.
29 The container struct pointer may be retrieved from a list node using
43 list. :c:func:`sys_slist_merge_slist` will append an entire list to an
45 subset of an existing list in constant time. And
46 :c:func:`sys_slist_find_and_remove` will search a list (in linear time)
50 that allows for iterating over a list in a natural way without needing
52 will enumerate every node in a list given a local variable to store
63 of the list.
65 Single-linked List Internals
87 The specific implementation of the list code, however, is done with an
91 single-linked list variants using the same basic primitives. The
101 Flagged List
110 "flags" with each list node. These can be accessed and modified with
117 Single-linked List API Reference
122 Flagged List API Reference