From 2f5bf602269f058edb24c9e5010c5a288fd7e5b7 Mon Sep 17 00:00:00 2001
From: simonmar <unknown>
Date: Thu, 17 Apr 2003 13:26:59 +0000
Subject: [PATCH] [project @ 2003-04-17 13:26:59 by simonmar] Doc wibbles

---
 Data/HashTable.hs |    4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Data/HashTable.hs b/Data/HashTable.hs
index 5211f90..917daab 100644
--- a/Data/HashTable.hs
+++ b/Data/HashTable.hs
@@ -101,7 +101,7 @@ data HashTable key val
 --
 -- This implementation of hash tables uses the low-order /n/ bits of the hash
 -- value for a key, where /n/ varies as the hash table grows.  A good hash
--- function therefore will give a good distribution regardless of /n/.
+-- function therefore will give an even distribution regardless of /n/.
 --
 -- If your keyspace is integrals such that the low-order bits between
 -- keys are highly variable, then you could get away with using 'id'
@@ -117,7 +117,7 @@ data HashTable key val
 hashInt :: Int -> Int32
 hashInt = (`rem` prime) . fromIntegral
 
--- | A sample hash fucntion for 'String's.  The implementation is:
+-- | A sample hash function for 'String's.  The implementation is:
 --
 -- >    hashString = fromIntegral . foldr f 0
 -- >      where f c m = ord c + (m * 128) `rem` 1500007
-- 
1.7.10.4