Correct some typos (#491)

Signed-off-by: Alexander Seiler <[email protected]>

README.md

@@ -319,7 +319,7 @@ Polynomial objects also have other methods:
 
 ## Legacy code
 
-As of v0.7, the internals of this package were greatly generalized and new types and method names were introduced. For compatability purposes, legacy code can be run after issuing `using Polynomials.PolyCompat`.
+As of v0.7, the internals of this package were greatly generalized and new types and method names were introduced. For compatibility purposes, legacy code can be run after issuing `using Polynomials.PolyCompat`.
 
 ## Contributing
 

src/compat.jl

@@ -1,7 +1,7 @@
 ## We have renamed the MATLAB/numpy type names to more Julian names
 ## How to keep the old names during a transition is the question.
 ## The plan: keep these to ensure underlying changes are not disruptive
-## For now  we ensure compatability by defining these for `Poly` objects such
+## For now  we ensure compatibility by defining these for `Poly` objects such
 ## that they do not signal a deprecation (save polyfit)),
 ## but  do for other `AbstractPolynomial` types.
 ## At v1.0, these will be opt-in via `using Polynomials.PolyCompat`

src/polynomials/standard-basis.jl

@@ -284,7 +284,7 @@ Base.gcd(::Val{:noda_sasaki}, p, q; kwargs...) = gcd_noda_sasaki(p,q; kwargs...)
 
 Greatest common divisor of two polynomials.
 Compute the greatest common divisor `d` of two polynomials `a` and `b` using
-the Euclidian Algorithm with scaling as of [1].
+the Euclidean Algorithm with scaling as of [1].
 
 References:
 

src/rational-functions/fit.jl

@@ -33,7 +33,7 @@ Fit a rational function of the form `pq = (a₀ + a₁x¹ + … + aₘxᵐ) / (1
 
     The [RationalApproximations](https://github.com/billmclean/RationalApproximations) package also has implementations of the AAA algorithm.
 
-    A python libary, [polyrat](https://github.com/jeffrey-hokanson/polyrat), has implementations of other algorithms.
+    A python library, [polyrat](https://github.com/jeffrey-hokanson/polyrat), has implementations of other algorithms.
 
 ## Example
 ```

src/rational-functions/plot-recipes.jl

@@ -1,5 +1,5 @@
 ## Plot recipe
-## define a hueristic to work around asymptotes
+## define a heuristic to work around asymptotes
 ## just sort of successful
 @recipe function f(pq::AbstractRationalFunction{T}, a=nothing, b=nothing) where {T}
 

test/ChebyshevT.jl

@@ -201,7 +201,7 @@ end
         @test degree(truncate(p - derivative(integrate(p)), atol=1e-8)) <= 0
     end
 
-    ## issue SpeicalPolynomials #56
+    ## issue SpecialPolynomials #56
     coeffs  = [3 // 4, -2 // 1, 1 // 1]
     p = ChebyshevT(coeffs)
     @test derivative(p) ≈ convert(ChebyshevT, derivative(convert(Polynomial, p)))

test/Poly.jl

@@ -1,4 +1,4 @@
-## Tests for compatiability with the old form
+## Tests for compatibility with the old form
 # Create a separate module so that include(file) doesn't import PolyCompat to Main
 module PolyTests
 
@@ -17,7 +17,7 @@ using ..SpecialFunctions
 a = Polynomial(1 .//convert(Vector{BigInt},map(gamma,BigFloat(1):BigFloat(17))),"x")
 @test_throws UndefVarError Pade(a,8,8)
 
-# must load the compatability module to have access
+# must load the compatibility module to have access
 using Polynomials.PolyCompat
 
 ## the methods  `polyval`, `polyint` and `polyder` are only for the

test/StandardBasis.jl

@@ -187,7 +187,7 @@ end
             # poly powers
             @test p^2 == p * p
 
-            # evalution
+            # evaluation
             @test p(s) == a + b * s + c * s * s
             @test p(c) == a + b * c + c * c * c
 
@@ -237,7 +237,7 @@ end
             # poly powers
             @test p^2 == p * p
 
-            # evalution
+            # evaluation
             @test p(s) == a + b * s + c * s * s
             @test p(c) == a + b * c + c * c * c
 
@@ -286,7 +286,7 @@ end
             # poly powers
             @test_throws MethodError p^2 == p * p # Ok, no * for T
 
-            # evalution
+            # evaluation
             @test p(s) == a + b * s + c * s * s
             @test_throws MethodError p(c) == a + b * c + c * c * c # OK, no b * c
 
@@ -340,7 +340,7 @@ end
                 @test p^2 == p * p
 
 
-                # evalution
+                # evaluation
                 @test p(s) == a + b * s + c * s * s
                 @test p(c) == a + b * c + c * c * c
 
@@ -1133,7 +1133,7 @@ end
         @test [λ 1] + [1 λ] == (λ+1) .* [1 1] # (λ+1) not a number, so we broadcast
     end
 
-    # issue 312; using mixed polynomial types withing arrays and promotion
+    # issue 312; using mixed polynomial types within arrays and promotion
     P′ = Polynomial
     r,s = P′([1,2], :x), P′([1,2],:y)
     function _test(x, T,X)

test/runtests.jl

@@ -11,7 +11,7 @@ using OffsetArrays
 @testset "Standard basis" begin include("StandardBasis.jl") end
 @testset "ChebyshevT" begin include("ChebyshevT.jl") end
 @testset "Rational functions" begin include("rational-functions.jl") end
-@testset "Poly, Pade (compatability)" begin include("Poly.jl") end
+@testset "Poly, Pade (compatibility)" begin include("Poly.jl") end
 if VERSION >= v"1.9.0-"
     @testset "MutableArithmetics" begin include("mutable-arithmetics.jl") end
 end