prolog::rb_visit/3¶

case 1: x moves down, so we have to try to fix it again.

% case 1 -> 2,3,4 -> done% case 1: x moves down, so we have to try to fix it again.% case 1 -> 2,3,4 -> done% whole list%

rb_visit(+ Tree,- Pairs)*

Pairs is an infix visit of tree Tree, where each element of Pairs is of the form K- Val.

Private-func:¶

1. prolog::rb_visit_3::rb_visit/3(int ARG1, int ARG2, int ARG3)():