Fix typos

Found by codespell
marcosh · Mar 30, 2023 · f6c6ce7 · f6c6ce7
1 parent 3fd6b22
commit f6c6ce7
Show file tree

Hide file tree

Showing 8 changed files with 11 additions and 11 deletions.
diff --git a/README.md b/README.md
@@ -18,7 +18,7 @@ Additional packages in this repository:
 * [chunked-data](https://github.com/snoyberg/mono-traversable/tree/master/chunked-data#readme),
   providing typeclasses for dealing with various chunked data representations
 * [mutable-containers](https://github.com/snoyberg/mono-traversable/tree/master/mutable-containers#readme),
-  abstactions and concrete implementations of mutable containers
+  abstractions and concrete implementations of mutable containers
 * [conduit-combinators](https://github.com/snoyberg/mono-traversable/tree/master/conduit-combinators#readme),
   commonly used conduit functions, for both chunked and unchunked data
 * [classy-prelude](https://github.com/snoyberg/mono-traversable/tree/master/classy-prelude#readme),

diff --git a/classy-prelude/ChangeLog.md b/classy-prelude/ChangeLog.md
@@ -5,7 +5,7 @@
 
 ## 1.5.0.1
 
-* Export a compatiblity shim for `parseTime` as it has been removed in `time-1.10`.
+* Export a compatibility shim for `parseTime` as it has been removed in `time-1.10`.
   See <https://hackage.haskell.org/package/time-1.12/changelog>
 
 ## 1.5.0

diff --git a/mono-traversable/ChangeLog.md b/mono-traversable/ChangeLog.md
@@ -173,7 +173,7 @@ A new MonoFoldableEq class that takes `elem` and `notElem` from `EqSequence`.
 `EqSequence` now inherits from `MonoFoldableEq`.
 
 For most users that do not define instances this should not be a breaking change.
-However, any instance of `EqSequence` now needs to definie `MonoFoldableEq`.
+However, any instance of `EqSequence` now needs to define `MonoFoldableEq`.
 
 
 ## 0.7.0

diff --git a/mono-traversable/src/Data/MonoTraversable.hs b/mono-traversable/src/Data/MonoTraversable.hs
@@ -426,7 +426,7 @@ class MonoFoldable mono where
     -- Note: this is a partial function. On an empty 'MonoFoldable', it will
     -- throw an exception.
     --
-    -- /See 'Data.NonNull.maximiumBy' from "Data.NonNull" for a total version of this function./
+    -- /See 'Data.NonNull.maximumBy' from "Data.NonNull" for a total version of this function./
     maximumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono
     maximumByEx f =
         ofoldl1Ex' go

diff --git a/mono-traversable/src/Data/NonNull.hs b/mono-traversable/src/Data/NonNull.hs
@@ -145,11 +145,11 @@ toMinList = fromNonEmpty
 --
 -- * if you don't need to cons, use 'fromNullable' or 'nonNull' if you can create your structure in one go.
 -- * if you need to cons, you might be able to start off with an efficient data structure such as a 'NonEmpty' List.
---     'fronNonEmpty' will convert that to your data structure using the structure's fromList function.
+--     'fromNonEmpty' will convert that to your data structure using the structure's fromList function.
 ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq
 ncons x xs = nonNull $ cons x xs
 
--- | Extract the first element of a sequnce and the rest of the non-null sequence if it exists.
+-- | Extract the first element of a sequence and the rest of the non-null sequence if it exists.
 nuncons :: IsSequence seq => NonNull seq -> (Element seq, Maybe (NonNull seq))
 nuncons xs =
   second fromNullable

diff --git a/mono-traversable/src/Data/Sequences.hs b/mono-traversable/src/Data/Sequences.hs
@@ -42,7 +42,7 @@ import Data.Word (Word8)
 -- | 'SemiSequence' was created to share code between 'IsSequence' and 'NonNull'.
 --
 -- @Semi@ means 'SemiGroup'
--- A 'SemiSequence' can accomodate a 'SemiGroup' such as 'NonEmpty' or 'NonNull'
+-- A 'SemiSequence' can accommodate a 'SemiGroup' such as 'NonEmpty' or 'NonNull'
 -- A Monoid should be able to fill out 'IsSequence'.
 --
 -- 'SemiSequence' operations maintain the same type because they all maintain the same number of elements or increase them.
@@ -151,7 +151,7 @@ class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => Is
     lengthIndex :: seq -> Index seq;
     lengthIndex = fromIntegral . olength64;
 
-    -- below functions change type fron the perspective of NonEmpty
+    -- below functions change type from the perspective of NonEmpty
 
     -- | 'break' applies a predicate to a sequence, and returns a tuple where
     -- the first element is the longest prefix (possibly empty) of elements that
@@ -1477,7 +1477,7 @@ class (IsSequence t, IsString t, Element t ~ Char) => Textual t where
     -- @
     words :: t -> [t]
 
-    -- | Join a list of textual sequences using seperating spaces.
+    -- | Join a list of textual sequences using separating spaces.
     --
     -- @
     -- > 'unwords' ["abc","def","ghi"]

diff --git a/mutable-containers/mutable-containers.cabal b/mutable-containers/mutable-containers.cabal
@@ -6,7 +6,7 @@ cabal-version: 1.12
 
 name:           mutable-containers
 version:        0.3.4.1
-synopsis:       Abstactions and concrete implementations of mutable containers
+synopsis:       Abstractions and concrete implementations of mutable containers
 description:    See docs and README at <http://www.stackage.org/package/mutable-containers>
 category:       Data
 homepage:       https://github.com/snoyberg/mono-traversable#readme

diff --git a/mutable-containers/package.yaml b/mutable-containers/package.yaml
@@ -1,6 +1,6 @@
 name:        mutable-containers
 version:     0.3.4.1
-synopsis:    Abstactions and concrete implementations of mutable containers
+synopsis:    Abstractions and concrete implementations of mutable containers
 description: See docs and README at <http://www.stackage.org/package/mutable-containers>
 category:    Data
 author:      Michael Snoyman