From e5d4b0bddc75eda1ad3445d7164171c0a6e8bbf6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Bj=C3=B6rn=20Gustavsson?=
Date: Fri, 5 Feb 2010 08:33:57 +0000
Subject: OTP-8404: Doc: some corrections and improvements in STDLIB
---
lib/stdlib/doc/src/gb_trees.xml | 8 +++++---
1 file changed, 5 insertions(+), 3 deletions(-)
(limited to 'lib/stdlib/doc/src/gb_trees.xml')
diff --git a/lib/stdlib/doc/src/gb_trees.xml b/lib/stdlib/doc/src/gb_trees.xml
index 2bf18138c0..94f40c28bd 100644
--- a/lib/stdlib/doc/src/gb_trees.xml
+++ b/lib/stdlib/doc/src/gb_trees.xml
@@ -4,7 +4,7 @@
- 20012009
+ 20012010
Ericsson AB. All Rights Reserved.
@@ -13,12 +13,12 @@
compliance with the License. You should have received a copy of the
Erlang Public License along with this software. If not, it can be
retrieved online at http://www.erlang.org/.
-
+
Software distributed under the License is distributed on an "AS IS"
basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
the License for the specific language governing rights and limitations
under the License.
-
+
gb_trees
@@ -34,6 +34,8 @@
Balanced Trees. These have no storage overhead compared to
unbalanced binary trees, and their performance is in general
better than AVL trees.
+ This module considers two keys as different if and only if
+ they do not compare equal (==).