summaryrefslogtreecommitdiff
path: root/usr/src/uts/common/sys/avl.h
diff options
context:
space:
mode:
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))
*