Lines Matching refs:an

26     The high-resolution timer code uses an rbtree to organize outstanding
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
70 At the root of each rbtree is an rb_root structure, which is initialized to be
75 Searching for a value in an rbtree
103 Inserting data into an rbtree
140 Removing or replacing existing data in an rbtree
143 To remove an existing node from a tree, call:
156 To replace an existing node in a tree with a new one with the same key, call:
164 Iterating through the elements stored in an rbtree (in sort order)
167 Four functions are provided for iterating through an rbtree's contents in
196 Augmented rbtree is an rbtree with "some" additional data stored in
200 is an optional feature built on top of basic rbtree infrastructure.
246 Interval tree is an example of augmented rb tree. Reference -
252 lo:hi or to find whether there is an exact match for a new lo:hi.