Print this page
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
          +++ new/usr/src/man/man3lib/libavl.3lib
↓ open down ↓ 3 lines elided ↑ open up ↑
   4    4  .\" You may only use this file in accordance with the terms of version
   5    5  .\" 1.0 of the CDDL.
   6    6  .\"
   7    7  .\" A full copy of the text of the CDDL should have accompanied this
   8    8  .\" source.  A copy of the CDDL is also available via the Internet at
   9    9  .\" http://www.illumos.org/license/CDDL.
  10   10  .\"
  11   11  .\"
  12   12  .\" Copyright 2015 Joyent, Inc.
  13   13  .\"
  14      -.Dd May 07, 2015
       14 +.Dd Dec 04, 2015
  15   15  .Dt LIBAVL 3LIB
  16   16  .Os
  17   17  .Sh NAME
  18   18  .Nm libavl
  19   19  .Nd generic self-balancing binary search tree library
  20   20  .Sh SYNOPSIS
  21   21  .Lb libavl
  22   22  .In sys/avl.h
  23   23  .Sh DESCRIPTION
  24   24  The
↓ open down ↓ 52 lines elided ↑ open up ↑
  77   77  .Sy O(1),
  78   78  whereas deleting a single node from an AVL tree takes
  79   79  .Sy O(log(n))
  80   80  time.
  81   81  .Ed
  82   82  .It Sy Delete All Nodes
  83   83  .Bd -filled -compact
  84   84  Deleting all nodes from a linked list is
  85   85  .Sy O(n) .
  86   86  With an AVL tree, if using the
  87      -.Xr avl_delete_nodes 3AVL
       87 +.Xr avl_destroy_nodes 3AVL
  88   88  function then deleting all nodes
  89   89  is
  90   90  .Sy O(n) .
  91   91  However, if iterating over each entry in the tree and then removing it using
  92   92  a while loop,
  93   93  .Xr avl_first 3AVL
  94   94  and
  95   95  .Xr avl_remove 3AVL
  96   96  then the time to remove all nodes is
  97   97  .Sy O(n\ *\ log(n)).
↓ open down ↓ 351 lines elided ↑ open up ↑
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX