xfnw/plan9fox
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

libavl: lookup can return the closest match

Browse source
This commit is contained in:
spew 2017-04-22 13:59:37 -05:00
parent f2b7f24e4e
commit 9cf5198145
9 changed files with 34 additions and 25 deletions
Download patch file Download diff file Expand all files Collapse all files

14
sys/man/2/avl
View file

@ -30,7 +30,7 @@ struct Avltree {
Avltree *avlcreate(int(*cmp)(Avl*, Avl*));
Avl *avlinsert(Avltree *tree, Avl *new);
Avl *avldelete(Avltree *tree, Avl *key);
Avl *avllookup(Avltree *tree, Avl *key);
Avl *avllookup(Avltree *tree, Avl *key, int dir);
Avl *avlnext(Avl *n);
Avl *avlprev(Avl *n);
@ -55,13 +55,15 @@ node into the tree and returns an existing
node with the same key that has been removed
from the tree and may be freed.
.I Avllookup
returns the
node that matches the key or
.B nil
if no node matches.
searches for a given key and returns
the closest node less than the given key,
.BR nil ,
or the closest node greater than the key depending on whether
.I dir
is less than, equal to, or greater than zero, respectively.
.I Avldelete
removes the node matching the key from the tree and returns
it. It returns nil of no matching key is found.
it. It returns nil if no matching key is found.
.PP
.I Avlnext
returns the next