Searched refs:Bst_node (Results 1 – 3 of 3) sorted by relevance
| /l4re-core-master/cxx/lib/tl/include/bits/ |
| A D | bst_base.h | 77 class Bst_node
94 static Bst_node *next(Bst_node const *p, Direction d) in next()
98 static void next(Bst_node *p, Direction d, Bst_node *n) in next()
102 static Bst_node **next_p(Bst_node *p, Direction d) in next_p()
107 Node *next(Bst_node const *p, Direction d) in next()
111 static void rotate(Bst_node **t, Direction idir);
115 Bst_node *_c[2];
119 Bst_node() {} in Bst_node() function
122 explicit Bst_node(bool) { _c[0] = _c[1] = 0; } in Bst_node() function
127 Bst_node::rotate(Bst_node **t, Direction idir) in rotate()
[all …]
|
| A D | bst.h | 98 Bst_node *_head;
147 static bool greater(Bst_node const *l, Bst_node const *r) in greater()
160 if (Bst_node *n = Bst_node::next(head, Dir::L)) in remove_tree()
163 if (Bst_node *n = Bst_node::next(head, Dir::R)) in remove_tree()
263 Bst_node *head = _head; in remove_all()
280 for (Bst_node *q = _head; q; q = Bst_node::next(q, d)) in find_node()
295 Bst_node *r = 0; in lower_bound_node()
297 for (Bst_node *q = _head; q; q = Bst_node::next(q, d)) in lower_bound_node()
314 Bst_node *q = _head; in find()
315 Bst_node *r = q; in find()
[all …]
|
| /l4re-core-master/cxx/lib/tl/include/ |
| A D | avl_tree | 38 class Avl_tree_node : public Bits::Bst_node
51 using Bits::Bst_node::next;
52 using Bits::Bst_node::next_p;
53 using Bits::Bst_node::rotate;
73 explicit Avl_tree_node(bool) : Bits::Bst_node(true), _balance(Dir::N) {}
76 static Bits::Bst_node *rotate2(Bst_node **t, Bal idir, Bal pre);
192 Bits::Bst_node *
193 Avl_tree_node::rotate2(Bst_node **t, Bal idir, Bal pre)
195 typedef Bits::Bst_node N;
230 typedef Bits::Bst_node N;
[all …]
|
Completed in 5 milliseconds