Searched refs:dlist (Results 1 – 6 of 6) sorted by relevance
29 A dlist can be modified in constant time by removing a node with34 As for slist, each node in a dlist can be processed in a natural code42 Convenience utilities provided by dlist include47 not a node is currently linked into a dlist or not (via an53 Internally, the dlist implementation is minimal: the :c:type:`sys_dlist_t`71 Effectively, a dlist of N nodes can be thought of as a "ring" of "N+1"74 .. figure:: dlist.png76 :alt: dlist example79 A dlist containing three elements. Note that the list struct82 .. figure:: dlist-single.png[all …]
34 dlist.rst
28 As with the slist and dlist containers, nodes within an rbtree are111 implemented with no more runtime storage overhead than a dlist.
5 project(dlist) project
13 dlist.c
237 /* <375> [...]/zephyr/include/zephyr/sys/dlist.h:37 */243 /* <397> [...]/zephyr/include/zephyr/sys/dlist.h:36 */258 /* <3b7> [...]/zephyr/include/zephyr/sys/dlist.h:41 */
