rb_tree_iterate(3) documentation vs. implementation

[David Young <dyoung%pobox.com@localhost>]

Regarding pr/46034, the manual describes one behavior for
rb_tree_iterate(3), while the implementation actually provides another.
The behavior described in the manual seems much more sensible and
useful, and I would like to change the implementation to match: see the
attached patch.

Dave

-- 
David Young
dyoung%pobox.com@localhost    Urbana, IL    (217) 721-9981

@@ -963,13 +963,13 @@ rb_tree_iterate(struct rb_tree *rbt, voi
 #ifndef RBSMALL
                if (RB_SENTINEL_P(rbt->rbt_root))
                        return NULL;
-               return RB_NODETOITEM(rbto, rbt->rbt_minmax[direction]);
+               return RB_NODETOITEM(rbto, rbt->rbt_minmax[other]);
 #else
                self = rbt->rbt_root;
                if (RB_SENTINEL_P(self))
                        return NULL;
-               while (!RB_SENTINEL_P(self->rb_nodes[direction]))
-                       self = self->rb_nodes[direction];
+               while (!RB_SENTINEL_P(self->rb_nodes[other]))
+                       self = self->rb_nodes[other];
                return RB_NODETOITEM(rbto, self);
 #endif /* !RBSMALL */
        }