Home
last modified time | relevance | path

Searched refs:Dir (Results 1 – 3 of 3) sorted by relevance

/l4re-core-master/cxx/lib/tl/include/bits/
A Dbst.h43 typedef Direction Dir; typedef
121 Dir d(cmp(r, l)); in dir()
160 if (Bst_node *n = Bst_node::next(head, Dir::L)) in remove_tree()
278 Dir d; in find_node()
283 if (d == Dir::N) in find_node()
294 Dir d; in lower_bound_node()
300 if (d == Dir::L) in lower_bound_node()
302 else if (d == Dir::N) in lower_bound_node()
317 for (Dir d; q; q = Bst_node::next(q, d)) in find()
320 if (d == Dir::N) in find()
[all …]
A Dbst_iter.h43 typedef Direction Dir; typedef
141 Node *n = Node_op::child(_n, Dir::L); in _downmost()
157 _r = _n = Node_op::child(_r, Dir::R); in inc()
162 if (Node_op::child(_n, Dir::R)) in inc()
164 _n = Node_op::child(_n, Dir::R); in inc()
176 q = Node_op::child(q, Dir::L); in inc()
178 else if (_n == q || Node_op::child(q, Dir::R) == _n) in inc()
184 q = Node_op::child(q, Dir::R); in inc()
/l4re-core-master/cxx/lib/tl/include/
A Davl_tree47 typedef Bits::Direction Dir;
73 explicit Avl_tree_node(bool) : Bits::Bst_node(true), _balance(Dir::N) {}
121 typedef typename Avl_tree_node::Bal Dir;
238 Dir b = this->dir(new_key, p);
239 if (b == Dir::N)
298 Dir dir;
303 dir = Dir(this->greater(key, n));
304 if (dir == Dir::L && !this->greater(k(n), key))
324 dir = Dir(this->greater(key, n));
380 res = rec_dump(n->next<A>(Dir::R), depth + 1, dpx + 1, print, '/');
[all …]

Completed in 5 milliseconds