```6498 typo in libavl(3LIB) man page
Reviewed by: Marcel Telka <marcel@telka.sk>
Reviewed by: Yuri Pankov <yuri.pankov@nexenta.com>
```

 Split Close Expand all Collapse all
```          --- old/usr/src/man/man3lib/libavl.3lib.man.txt
+++ new/usr/src/man/man3lib/libavl.3lib.man.txt
```
 ↓ open down ↓ 46 lines elided ↑ open up ↑
```  47   47               order is required, then the time to do the insertion into a
48   48               linked list will depend on the time of the search algorithm being
49   49               employed to find the place to insert at.
50   50
51   51       Delete One Node
52   52               Deleting a single node from a linked list is O(1), whereas
53   53               deleting a single node from an AVL tree takes O(log(n)) time.
54   54
55   55       Delete All Nodes
56   56               Deleting all nodes from a linked list is O(n).  With an AVL tree,
57      -             if using the avl_delete_nodes(3AVL) function then deleting all
57 +             if using the avl_destroy_nodes(3AVL) function then deleting all
58   58               nodes is O(n).  However, if iterating over each entry in the tree
59   59               and then removing it using a while loop, avl_first(3AVL) and
60   60               avl_remove(3AVL) then the time to remove all nodes is
61   61               O(n * log(n)).
62   62
63   63       Visit the Next or Previous Node
64   64               Visiting the next or previous node in a linked list is O(1),
65   65               whereas going from the next to the previous node in an AVL tree
66   66               will take between O(1) and O(log(n)).
67   67
```
 ↓ open down ↓ 291 lines elided ↑ open up ↑
``` 359  359       avl_add(3AVL), avl_create(3AVL), avl_destroy(3AVL),
360  360       avl_destroy_nodes(3AVL), avl_find(3AVL), avl_first(3AVL),
361  361       avl_insert(3AVL), avl_insert_here(3AVL), avl_is_empty(3AVL),
362  362       avl_last(3AVL), avl_nearest(3AVL), avl_numnodes(3AVL), avl_remove(3AVL),
363  363       avl_swap(3AVL),
364  364
365  365       Adel'son-Vel'skiy, G. M. and Landis, Ye. M., An Algorithm for the
366  366       Organization of Information, No. 2, Vol. 16, 263-266, Deklady Akademii
367  367       Nauk, USSR, Moscow, 1962.
368  368
369      -illumos                           May 7, 2015                          illumos
369 +illumos                        December 4, 2015                        illumos
```
`XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX`