From d5d4eae28d15b6ab3ec24d0516fc109692a5e3c9 Mon Sep 17 00:00:00 2001 From: Josef Zlomek Date: Wed, 7 May 2003 20:19:36 +0200 Subject: [PATCH] splay-tree.c (splay_tree_predecessor): Fix comment. * splay-tree.c (splay_tree_predecessor): Fix comment. (splay_tree_successor): Fix comment. From-SVN: r66569 --- libiberty/ChangeLog | 5 +++++ libiberty/splay-tree.c | 4 ++-- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/libiberty/ChangeLog b/libiberty/ChangeLog index 90f51febccf..5498f112156 100644 --- a/libiberty/ChangeLog +++ b/libiberty/ChangeLog @@ -1,3 +1,8 @@ +2003-05-07 Josef Zlomek + + * splay-tree.c (splay_tree_predecessor): Fix comment. + (splay_tree_successor): Fix comment. + 2003-05-07 Jason Merrill * hashtab.c (burtle_hash): New fn. diff --git a/libiberty/splay-tree.c b/libiberty/splay-tree.c index 6f90fde05fb..fc98db167f3 100644 --- a/libiberty/splay-tree.c +++ b/libiberty/splay-tree.c @@ -472,7 +472,7 @@ splay_tree_predecessor (sp, key) if (comparison < 0) return sp->root; - /* Otherwise, find the leftmost element of the right subtree. */ + /* Otherwise, find the rightmost element of the left subtree. */ node = sp->root->left; if (node) while (node->right) @@ -505,7 +505,7 @@ splay_tree_successor (sp, key) if (comparison > 0) return sp->root; - /* Otherwise, find the rightmost element of the left subtree. */ + /* Otherwise, find the leftmost element of the right subtree. */ node = sp->root->right; if (node) while (node->left) -- 2.30.2