aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMateusz Piotrowski <0mp@FreeBSD.org>2020-07-27 11:42:22 +0000
committerMateusz Piotrowski <0mp@FreeBSD.org>2020-07-27 11:42:22 +0000
commit58f5de0d8afaf8423b87a613a4a0772e56f8f72a (patch)
treea3fd3ac9f480d003d1033952c43b2de968fe9064
parentd421b01028513e4e25230445a4d6f9206a77dbd3 (diff)
downloadsrc-58f5de0d8afaf8423b87a613a4a0772e56f8f72a.tar.gz
src-58f5de0d8afaf8423b87a613a4a0772e56f8f72a.zip
tree.3: Bump date after 363450 (WAVL)
While here: - Address whitespace warnings. - Start sentences on a new line.
Notes
Notes: svn path=/head/; revision=363599
-rw-r--r--share/man/man3/tree.37
1 files changed, 4 insertions, 3 deletions
diff --git a/share/man/man3/tree.3 b/share/man/man3/tree.3
index e6ecc6e44237..a29f06d3c21e 100644
--- a/share/man/man3/tree.3
+++ b/share/man/man3/tree.3
@@ -30,7 +30,7 @@
.\"
.\" $FreeBSD$
.\"
-.Dd February 25, 2020
+.Dd July 27, 2020
.Dt TREE 3
.Os
.Sh NAME
@@ -371,7 +371,7 @@ Each tree node has an associated rank.
Balance conditions are expressed by conditions on the differences in
rank between any node and its children.
Rank differences are stored in each tree node.
-.Pp
+.Pp
The balance conditions implemented by the RB macros lead to weak AVL
(wavl) trees, which combine the best aspects of AVL and red-black
trees.
@@ -380,7 +380,8 @@ with the same worst-case time as red-black trees offer, and with
better balance in the resulting tree.
Wavl trees rebalance after a removal in a way that requires less
restructuring, in the worst case, than either AVL or red-black trees
-do. Removals can lead to a tree almost as unbalanced as a red-black
+do.
+Removals can lead to a tree almost as unbalanced as a red-black
tree; insertions lead to a tree becoming as balanced as an AVL tree.
.Pp
A rank-balanced tree is headed by a structure defined by the