Merge pull request #3389 from JuliaReach/schillic/spellcheck

Spell checker

.github/workflows/SpellCheck.yml

@@ -0,0 +1,13 @@
+name: Spell Check
+
+on: [pull_request]
+
+jobs:
+  typos-check:
+    name: check spelling
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout Actions Repository
+        uses: actions/checkout@v4
+      - name: Check spelling
+        uses: crate-ci/typos@master

.typos.toml

@@ -0,0 +1,6 @@
+[default.extend-words]
+# do not correct the following strings:
+Enew = "Enew"
+GIR = "GIR"
+nd = "nd"
+Singl = "Singl"

README.md

@@ -49,7 +49,7 @@ See the [Getting started](https://juliareach.github.io/LazySets.jl/dev/man/getti
 
 ## 📘 Publications
 
-This library has been applied in a number of scientic works.
+This library has been applied in a number of scientific works.
 
 <details>
 <summary>Click to see the full list of publications that use LazySets.</summary>

src/Interfaces/AbstractPolyhedron_functions.jl

@@ -535,7 +535,7 @@ The algorithm is described next. Assuming that the matrix ``M`` is invertible
 ``x = \\text{inv}(M) y`` and we can transform the polyhedron
 ``A x ≤ b`` to the polyhedron ``A \\text{inv}(M) y ≤ b``.
 
-If the dense condition on `M` is not fullfilled, there are two suggested
+If the dense condition on `M` is not satisfied, there are two suggested
 workarounds: either transform to a dense matrix, i.e., calling `linear_map` with
 `Matrix(M)`, or use the `"inverse_right"` algorithm, which does not compute the
 inverse matrix explicitly, but uses a polyalgorithm; see the documentation

src/Sets/BallInf.jl

@@ -227,7 +227,7 @@ Evaluation of the support function in the given direction.
 Let ``B`` be a ball in the infinity norm with center ``c`` and radius ``r`` and
 let ``d`` be the direction of interest.
 For balls with dimensions less than 30 we use the implementation for
-`AbstractHyperrectangle`, taylored to a `BallInf`, which computes
+`AbstractHyperrectangle`, tailored to a `BallInf`, which computes
 
 ```math
     ∑_{i=1}^n d_i (c_i + \\textrm{sgn}(d_i) · r)

test/LazyOperations/UnionSet.jl

@@ -11,7 +11,7 @@ for N in [Float64, Rational{Int}, Float32]
     # array type (union of a finite number of convex sets)
     Uarr = UnionSetArray([B1, B2])
 
-    # constructor without argumenst
+    # constructor without argument
     UnionSetArray()
 
     # getindex & length

test/Sets/Tetrahedron.jl

@@ -10,7 +10,7 @@ for N in [Float64, Float32, Rational{Int}]
     Tmat = Tetrahedron(vmat)
     @test Tmat == T
 
-    # suport vector
+    # support vector
     @test σ(ones(3), T) == N[0, 1, 1 / sqrt(2)]
 
     # membership