splay-tree.c (splay_tree_predecessor): Fix comment.
* splay-tree.c (splay_tree_predecessor): Fix comment. (splay_tree_successor): Fix comment. From-SVN: r66569
This commit is contained in:
parent
5cc5a0d00d
commit
d5d4eae28d
|
@ -1,3 +1,8 @@
|
||||||
|
2003-05-07 Josef Zlomek <zlomekj@suse.cz>
|
||||||
|
|
||||||
|
* splay-tree.c (splay_tree_predecessor): Fix comment.
|
||||||
|
(splay_tree_successor): Fix comment.
|
||||||
|
|
||||||
2003-05-07 Jason Merrill <jason@redhat.com>
|
2003-05-07 Jason Merrill <jason@redhat.com>
|
||||||
|
|
||||||
* hashtab.c (burtle_hash): New fn.
|
* hashtab.c (burtle_hash): New fn.
|
||||||
|
|
|
@ -472,7 +472,7 @@ splay_tree_predecessor (sp, key)
|
||||||
if (comparison < 0)
|
if (comparison < 0)
|
||||||
return sp->root;
|
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;
|
node = sp->root->left;
|
||||||
if (node)
|
if (node)
|
||||||
while (node->right)
|
while (node->right)
|
||||||
|
@ -505,7 +505,7 @@ splay_tree_successor (sp, key)
|
||||||
if (comparison > 0)
|
if (comparison > 0)
|
||||||
return sp->root;
|
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;
|
node = sp->root->right;
|
||||||
if (node)
|
if (node)
|
||||||
while (node->left)
|
while (node->left)
|
||||||
|
|
Loading…
Reference in New Issue