Fix various spelling errors. (#1158)

jonathanknowles · web-flow · commit c1c5dee67a88 · 2025-09-01T00:02:45.000+05:30
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
@@ -1,6 +1,6 @@
 # Instructions for Contributors
 
-To report bugs, or propose enchancements or changes, please use the
+To report bugs, or propose enhancements or changes, please use the
 [GitHub issue tracker](https://github.com/haskell/containers/issues).
 
 You are also welcome to propose code changes in the form of
diff --git a/containers/docs/conf.py b/containers/docs/conf.py
@@ -12,7 +12,7 @@
 
 # -- General configuration ------------------------------------------------
 
-# Add the _extenions dir to the search path.
+# Add the _extensions dir to the search path.
 sys.path.insert(0, os.path.abspath('.') + '/_extensions')
 sys.path.insert(0, os.path.abspath('.') + '/_extensions/haddock-autolink')
 
diff --git a/containers/docs/map.rst b/containers/docs/map.rst
@@ -117,7 +117,7 @@ Common API Functions
    ``size`` which is O(1) for ``Map`` and O(n) for ``IntMap``.
 
 .. NOTE::
-   A ``Map`` is printed as an association list preceeded by ``fromList``. For
+   A ``Map`` is printed as an association list preceded by ``fromList``. For
    example, it might look like ``fromList [(Key1,True),(Key2,False)]``.
 
 
diff --git a/containers/docs/sequence.rst b/containers/docs/sequence.rst
@@ -81,7 +81,7 @@ Importing Sequence
 ------------------
 
 When using ``Sequence`` in a Haskell source file you should always use a
-``qualified`` import becasue it exports names that clash with the standard
+``qualified`` import because it exports names that clash with the standard
 Prelude (you can import the type constructor and some operators on their own
 though!).
 
diff --git a/containers/src/Data/IntMap/Internal.hs b/containers/src/Data/IntMap/Internal.hs
@@ -1326,7 +1326,7 @@ restrictBM t@(Bin p l r) !bm
     -- Here we care about the "submask" of bm corresponding the current Bin's
     -- range. So we create bm', where this submask is at the lowest position and
     -- and all other bits are set to the highest bit of the submask (using an
-    -- arithmetric shiftR). Now bm' is 0 when the submask is empty and -1 when
+    -- arithmetic shiftR). Now bm' is 0 when the submask is empty and -1 when
     -- the submask is full.
     px = IntSet.suffixOf (unPrefix p)
     px1 = px - 1
@@ -3612,7 +3612,7 @@ ascLinkStack stk !rk r = case stk of
 -- [zipper](https://en.wikipedia.org/wiki/Zipper_(data_structure)). It always
 -- has its "focus" at the last inserted entry. To insert a new entry, we need
 -- to move the focus to the new entry. To do this we move up the stack to the
--- lowest common ancestor of the currest position and the position of the
+-- lowest common ancestor of the current position and the position of the
 -- new key (implemented as moveUpB), then down to the position of the new key
 -- (implemented as moveDownB).
 --
diff --git a/containers/src/Data/Set/Internal.hs b/containers/src/Data/Set/Internal.hs
@@ -2335,8 +2335,8 @@ validsize t
 -- done in O(1) using `Bin`. The final linking of the stack is done in O(log n)
 -- using `link` (proof below). The total time is thus O(n).
 --
--- Additionally, the implemention is written using foldl' over the input list,
--- which makes it participate as a good consumer in list fusion.
+-- Additionally, the implementation is written using foldl' over the input
+-- list, which makes it participate as a good consumer in list fusion.
 --
 -- fromDistinctDescList is implemented similarly, adapted for left and right
 -- sides being swapped.
