summaryrefslogtreecommitdiff
path: root/usr/src/uts/common/sys/avl.h
diff options
context:
space:
mode:
authorJerry Jelinek <jerry.jelinek@joyent.com>2015-08-17 13:01:59 +0000
committerJerry Jelinek <jerry.jelinek@joyent.com>2015-08-17 13:01:59 +0000
commit13fcc76fc02e61f38bddf48bd6ea621c69dff932 (patch)
tree5387d51d872b8d7dd94aba146d9fea2ed368b1ba /usr/src/uts/common/sys/avl.h
parent9108c5e07330cfd63586277125b19ee25d543d94 (diff)
parent67b886e08e73a289a63ea9a98920f9ff423d1881 (diff)
downloadillumos-joyent-13fcc76fc02e61f38bddf48bd6ea621c69dff932.tar.gz
[illumos-gate merge]
commit 67b886e08e73a289a63ea9a98920f9ff423d1881 5934 localedef needs a native build (fix lint) commit fa9922c2be34868be01989cef133828185b5c0bc 5935 libavl should be a public interface 5936 AVL trees should be part of the DDI commit 7de0ac867568af5d9b8a9d8f8c82fd5fc12c6bfa 5934 localedef needs a native build commit 25b86e8fb6a2b50f929d8492cbac5d4eb5c2009a 5933 Makefile.man should take care of directory creation commit 22ff04516c85a5caac614d46031edbc085ba3a9e 6113 cpqary3: add support for hp gen9 smart array controllers commit d05c2e387bac9df4515e8771dbee0ef3f5fe121a 6121 Copy-paste bug in mac_init_rings() Conflicts: usr/src/man/Makefile.man usr/src/cmd/localedef/Makefile
Diffstat (limited to 'usr/src/uts/common/sys/avl.h')
-rw-r--r--usr/src/uts/common/sys/avl.h13
1 files changed, 4 insertions, 9 deletions
diff --git a/usr/src/uts/common/sys/avl.h b/usr/src/uts/common/sys/avl.h
index 10e0ddaeef..cc4af828e6 100644
--- a/usr/src/uts/common/sys/avl.h
+++ b/usr/src/uts/common/sys/avl.h
@@ -30,11 +30,6 @@
#ifndef _AVL_H
#define _AVL_H
-/*
- * This is a private header file. Applications should not directly include
- * this file.
- */
-
#ifdef __cplusplus
extern "C" {
#endif
@@ -43,9 +38,9 @@ extern "C" {
#include <sys/avl_impl.h>
/*
- * This is a generic implementation of AVL trees for use in the Solaris kernel.
- * The interfaces provide an efficient way of implementing an ordered set of
- * data structures.
+ * This is a generic implementation of AVL trees for use in the illumos. The
+ * interfaces provide an efficient way of implementing an ordered set of data
+ * structures.
*
* AVL trees provide an alternative to using an ordered linked list. Using AVL
* trees will usually be faster, however they requires more storage. An ordered
@@ -57,7 +52,7 @@ extern "C" {
* --------- -------- --------
* lookup O(n) O(log(n))
*
- * insert 1 node constant constant
+ * insert 1 node constant O(log(n))
*
* delete 1 node constant between constant and O(log(n))
*