Lines Matching full:as
11 conventional red/black tree as described by multiple academic sources.
19 within an rbtree must be provided as a predicate function by the user.
22 operations are attempted. This function should, as its name suggests,
28 As with the slist and dlist containers, nodes within an rbtree are
29 represented as a :c:struct:`rbnode` structure which exists in
33 the binary tree topology and "manually" traverse the tree as it is for
41 provided node pointer exists as an element within the tree. As
61 buffer instead where needed to avoid the dynamic allocation). As with
69 As described, the Zephyr rbtree implementation is a conventional
70 red/black tree as described pervasively in academic sources. Low
72 as they match existing conventions. This discussion will be limited
76 the tree to any leaf is no more than twice as long as the path to any
106 "upwards" from a node as well. It is very common for red/black trees
109 locally as it traverses downward through the tree and updating it
110 appropriately as modifications are made. So a Zephyr rbtree can be