From 9ecf132d64d35e5997c12286f509b2f8d7f2a7ef Mon Sep 17 00:00:00 2001 From: dons Date: Wed, 23 Feb 2005 06:31:22 +0000 Subject: [PATCH] [project @ 2005-02-23 06:31:22 by dons] Typo in comment only. Spotted by sjanssen on #haskell. --- Data/Map.hs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Data/Map.hs b/Data/Map.hs index a76b62b..92cf158 100644 --- a/Data/Map.hs +++ b/Data/Map.hs @@ -1232,7 +1232,7 @@ deleteFindMax t - A lower [delta] leads to a more 'perfectly' balanced tree. - A higher [delta] performs less rebalancing. - - Balancing is automaic for random data and a balancing + - Balancing is automatic for random data and a balancing scheme is only necessary to avoid pathological worst cases. Almost any choice will do, and in practice, a rather large [delta] may perform better than smaller one. -- 1.7.10.4