Fix typos

README.md

@@ -530,7 +530,7 @@ See also: [`-remove`](#-remove-pred-list), [`-map-last`](#-map-last-pred-rep-lis
 
 #### -remove-item `(item list)`
 
-Remove all occurences of `item` from `list`.
+Remove all occurrences of `item` from `list`.
 
 Comparison is done with `equal`.
 
@@ -751,7 +751,7 @@ See also: [`-replace-at`](#-replace-at-n-x-list)
 
 #### -replace-first `(old new list)`
 
-Replace the first occurence of `old` with `new` in `list`.
+Replace the first occurrence of `old` with `new` in `list`.
 
 Elements are compared using `equal`.
 
@@ -765,7 +765,7 @@ See also: [`-map-first`](#-map-first-pred-rep-list)
 
 #### -replace-last `(old new list)`
 
-Replace the last occurence of `old` with `new` in `list`.
+Replace the last occurrence of `old` with `new` in `list`.
 
 Elements are compared using `equal`.
 
@@ -2801,13 +2801,13 @@ Return a function that computes the (least) fixpoint of `fn`.
 
 `fn` must be a unary function. The returned lambda takes a single
 argument, `x`, the initial value for the fixpoint iteration. The
-iteration halts when either of the following conditions is satisified:
+iteration halts when either of the following conditions is satisfied:
 
  1. Iteration converges to the fixpoint, with equality being
       tested using `equal-test`. If `equal-test` is not specified,
       `equal` is used. For functions over the floating point
       numbers, it may be necessary to provide an appropriate
-      appoximate comparsion test.
+      appoximate comparison test.
 
  2. `halt-test` returns a non-nil value. `halt-test` defaults to a
       simple counter that returns t after `-fixfn-max-iterations`,

dash-functional.el

@@ -163,13 +163,13 @@ The closure accepts any number of arguments, which are discarded."
 
 FN must be a unary function. The returned lambda takes a single
 argument, X, the initial value for the fixpoint iteration. The
-iteration halts when either of the following conditions is satisified:
+iteration halts when either of the following conditions is satisfied:
 
  1. Iteration converges to the fixpoint, with equality being
     tested using EQUAL-TEST. If EQUAL-TEST is not specified,
     `equal' is used. For functions over the floating point
     numbers, it may be necessary to provide an appropriate
-    appoximate comparsion test.
+    appoximate comparison test.
 
  2. HALT-TEST returns a non-nil value. HALT-TEST defaults to a
     simple counter that returns t after `-fixfn-max-iterations',

dash.el

@@ -403,7 +403,7 @@ See also: `-remove', `-map-last'"
 (defalias '--reject-last '--remove-last)
 
 (defun -remove-item (item list)
-  "Remove all occurences of ITEM from LIST.
+  "Remove all occurrences of ITEM from LIST.
 
 Comparison is done with `equal'."
   (declare (pure t) (side-effect-free t))
@@ -503,7 +503,7 @@ See also: `-replace-at'"
   (--map-when (equal it old) new list))
 
 (defun -replace-first (old new list)
-  "Replace the first occurence of OLD with NEW in LIST.
+  "Replace the first occurrence of OLD with NEW in LIST.
 
 Elements are compared using `equal'.
 
@@ -512,7 +512,7 @@ See also: `-map-first'"
   (--map-first (equal old it) new list))
 
 (defun -replace-last (old new list)
-  "Replace the last occurence of OLD with NEW in LIST.
+  "Replace the last occurrence of OLD with NEW in LIST.
 
 Elements are compared using `equal'.
 
@@ -1284,7 +1284,7 @@ Alias: `-zip-pair'"
         (setq lists (mapcar 'cdr lists)))
       (setq results (nreverse results))
       (if (= (length lists) 2)
-          ;; to support backward compatability, return
+          ;; to support backward compatibility, return
           ;; a cons cell if two lists were provided
           (--map (cons (car it) (cadr it)) results)
         results))))

dash.info

@@ -396,7 +396,7 @@ Functions returning a sublist of the original list.
               ⇒ '(1 2 3 4 5 6 7 8 9)
 
  -- Function: -remove-item (item list)
-     Remove all occurences of ITEM from LIST.
+     Remove all occurrences of ITEM from LIST.
 
      Comparison is done with ‘equal’.
 
@@ -622,7 +622,7 @@ Functions returning a modified copy of the input list.
               ⇒ nil
 
  -- Function: -replace-first (old new list)
-     Replace the first occurence of OLD with NEW in LIST.
+     Replace the first occurrence of OLD with NEW in LIST.
 
      Elements are compared using ‘equal’.
 
@@ -636,7 +636,7 @@ Functions returning a modified copy of the input list.
               ⇒ nil
 
  -- Function: -replace-last (old new list)
-     Replace the last occurence of OLD with NEW in LIST.
+     Replace the last occurrence of OLD with NEW in LIST.
 
      Elements are compared using ‘equal’.
 
@@ -2720,12 +2720,12 @@ offered in a separate package: ‘dash-functional‘.
      FN must be a unary function.  The returned lambda takes a single
      argument, X, the initial value for the fixpoint iteration.  The
      iteration halts when either of the following conditions is
-     satisified:
+     satisfied:
 
      1.  Iteration converges to the fixpoint, with equality being
      tested using EQUAL-TEST.  If EQUAL-TEST is not specified, ‘equal’
      is used.  For functions over the floating point numbers, it may
-     be necessary to provide an appropriate appoximate comparsion
+     be necessary to provide an appropriate appoximate comparison
      test.
 
      2.  HALT-TEST returns a non-nil value.  HALT-TEST defaults to a

dash.texi

@@ -529,7 +529,7 @@ See also: @code{-remove} (@pxref{-remove}), @code{-map-last} (@pxref{-map-last})
 
 @anchor{-remove-item}
 @defun -remove-item (item list)
-Remove all occurences of @var{item} from @var{list}.
+Remove all occurrences of @var{item} from @var{list}.
 
 Comparison is done with @code{equal}.
 
@@ -901,7 +901,7 @@ See also: @code{-replace-at} (@pxref{-replace-at})
 
 @anchor{-replace-first}
 @defun -replace-first (old new list)
-Replace the first occurence of @var{old} with @var{new} in @var{list}.
+Replace the first occurrence of @var{old} with @var{new} in @var{list}.
 
 Elements are compared using @code{equal}.
 
@@ -925,7 +925,7 @@ See also: @code{-map-first} (@pxref{-map-first})
 
 @anchor{-replace-last}
 @defun -replace-last (old new list)
-Replace the last occurence of @var{old} with @var{new} in @var{list}.
+Replace the last occurrence of @var{old} with @var{new} in @var{list}.
 
 Elements are compared using @code{equal}.
 
@@ -4285,13 +4285,13 @@ Return a function that computes the (least) fixpoint of @var{fn}.
 
 @var{fn} must be a unary function. The returned lambda takes a single
 argument, @var{x}, the initial value for the fixpoint iteration. The
-iteration halts when either of the following conditions is satisified:
+iteration halts when either of the following conditions is satisfied:
 
  1. Iteration converges to the fixpoint, with equality being
       tested using @var{equal-test}. If @var{equal-test} is not specified,
       @code{equal} is used. For functions over the floating point
       numbers, it may be necessary to provide an appropriate
-      appoximate comparsion test.
+      appoximate comparison test.
 
  2. @var{halt-test} returns a non-nil value. @var{halt-test} defaults to a
       simple counter that returns t after @code{-fixfn-max-iterations},