typos

Author: Eric Lindblad

containers-tests/tests/IntSetValidity.hs

@@ -84,6 +84,6 @@ validTipPrefix :: Prefix -> Bool
 -- Last 5 bits of the prefix must be zero for 32 bit arches.
 validTipPrefix p = (0x0000001F .&. p) == 0
 #else
--- Last 6 bits of the prefix must be zero 64 bit anches.
+-- Last 6 bits of the prefix must be zero for 64 bit arches.
 validTipPrefix p = (0x000000000000003F .&. p) == 0
 #endif

containers/src/Data/Set/Internal.hs

@@ -682,7 +682,7 @@ isSubsetOf t1 t2
 --
 -- This function is structured very much like `difference`, `union`,
 -- and `intersection`. Whereas the bounds proofs for those in Blelloch
--- et al needed to accound for both "split work" and "merge work", we
+-- et al needed to account for both "split work" and "merge work", we
 -- only have to worry about split work here, which is the same as in
 -- those functions.
 isSubsetOfX :: Ord a => Set a -> Set a -> Bool

containers/src/Utils/Containers/Internal/BitQueue.hs

@@ -96,7 +96,7 @@ buildQ (BQB hi lo) = BQ (BQB hi' lo') where
   lo' = (lo1 `shiftRL` zeros) .|. (hi1 `shiftLL` (wordSize - zeros))
   hi' = hi1 `shiftRL` zeros
 
--- Test if the queue is empty, which occurs when theres
+-- Test if the queue is empty, which occurs when there's
 -- nothing left but a guard bit in the least significant
 -- place.
 nullQ :: BitQueue -> Bool