Fix typos in comments and docstrings (#691)

* Fix typos in comments and docstrings

Comment-only changes, except for the signature line in the docstring for
`Integral()`, which read `Intergral()`.

Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>

* Fix beyound in the resize error messages

These are user-visible strings, and the same message in
src/Caching/ragged.jl already spells it correctly.

Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>

---------

Co-authored-by: Claude Opus 5 (1M context) <noreply@anthropic.com>

Author: jishnub

src/Caching/bandedblockbanded.jl

@@ -14,7 +14,7 @@ end
 #
 function resizedata!(B::CachedOperator{T,<:BandedBlockBandedMatrix{T}}, ::Colon, col::Integer) where {T<:Number}
     if col > size(B,2)
-        throw(ArgumentError("Cannot resize beyound size of operator"))
+        throw(ArgumentError("Cannot resize beyond size of operator"))
     end
 
     if col > B.datasize[2]

src/Caching/blockbanded.jl

@@ -18,7 +18,7 @@ end
 # that is, trace an operator down the diagonal.  What blocks correspond to the
 # block diagonal?
 # this is used to determine how many blocks to pad in the QR decomposition, as
-# every lower block gets added to the upper daigonal
+# every lower block gets added to the upper diagonal
 
 diagblockshift(a,b) = error("Developer: Not implemented for blocklengths $a, $b")
 
@@ -88,7 +88,7 @@ end
 #
 function resizedata!(B::CachedOperator{T,BlockBandedMatrix{T}},::Colon,col::Integer) where {T<:Number}
     if col > size(B,2)
-        throw(ArgumentError("Cannot resize beyound size of operator"))
+        throw(ArgumentError("Cannot resize beyond size of operator"))
     end
 
     if col > B.datasize[2]

src/Caching/matrix.jl

@@ -6,7 +6,7 @@ CachedOperator(::Type{Matrix},op::Operator;padding::Bool=false) =
 
 function resizedata!(B::CachedOperator{T,Matrix{T}},n::Integer,m::Integer) where T<:Number
     if n > size(B,1) || m > size(B,2)
-        throw(ArgumentError("Cannot resize beyound size of operator"))
+        throw(ArgumentError("Cannot resize beyond size of operator"))
     end
 
     # this does nothing if already in dimensions

src/Caching/ragged.jl

@@ -13,7 +13,7 @@ function resizedata!(B::CachedOperator{T,RaggedMatrix{T}},::Colon,n::Integer) wh
         resize!(B.data.cols,n+1)
 
         if B.padding
-            # K is largest colstop.  We get previous largest by looking at precalulated
+            # K is largest colstop.  We get previous largest by looking at precalculated
             # cols
             K = B.datasize[2]==0 ? 0 : B.data.cols[B.datasize[2]+1]-B.data.cols[B.datasize[2]]
 

src/Domain.jl

@@ -65,7 +65,7 @@ domainscompatible(a,b) = domainscompatible(domain(a),domain(b))
 _isapprox(a, b) = isapprox(a,b)
 function _isapprox(a::Interval, b::Interval)
     # hacky compat for DomainSets v0.6,
-    # where comparing open and closed intevals throws an error
+    # where comparing open and closed intervals throws an error
     # However, we don't need to compare at all if the endpoints differ
     # this introduces a duplicate check, but that's probably ok
     isapprox(leftendpoint(a), leftendpoint(b), atol=100eps(prectype(a))) &&
@@ -90,7 +90,7 @@ function indomain(x,d::SegmentDomain)
     y=tocanonical(d,x)
     ry=real(y)
     iy=imag(y)
-    sc=norm(fromcanonicalD(d,ry<-1 ? -one(ry) : (ry>1 ? one(ry) : ry)))  # scale based on stretch of map on projection to interal
+    sc=norm(fromcanonicalD(d,ry<-1 ? -one(ry) : (ry>1 ? one(ry) : ry)))  # scale based on stretch of map on projection to interval
     dy=fromcanonical(d,y)
     # TODO: use isapprox once keywords are fast
     ((isinf(norm(dy)) && isinf(norm(x))) ||  norm(dy-x) ≤ 1000eps(T)*max(norm(x),1)) &&
@@ -101,7 +101,7 @@ end
 issubcomponent(a::Domain,b::Domain) = a in components(b)
 
 
-##### canoncial
+##### canonical
 """
     tocanonical(d, x)
 
@@ -120,7 +120,7 @@ function tocanonical end
 
 const 𝑪 = tocanonical
 
-## conveninece routines
+## convenience routines
 
 ones(d::Domain) = ones(prectype(d),Space(d))
 zeros(d::Domain) = zeros(prectype(d),Space(d))
@@ -179,7 +179,7 @@ invfromcanonicalD(d::Domain,x...) = 1/fromcanonicalD(d,x...)
 
 
 ## sorting
-# we sort spaces lexigraphically by default
+# we sort spaces lexicographically by default
 
 for OP in (:<,:(<=),:(isless))
     @eval $OP(a::Domain,b::Domain)=$OP(string(a),string(b))

src/Domains/Domains.jl

@@ -36,7 +36,7 @@ end
 
 
 
-# multivariate domainxs
+# multivariate domains
 
 include("multivariate.jl")
 

src/Fun.jl

@@ -778,7 +778,7 @@ iszero(f::Fun)    = all(iszero, coefficients(f)) || all(iszero, values(f))
 # Deliberately not named isconst or isconstant to avoid conflicts with Base or DomainSets
 isconstantfun(f::Fun) = iszero(f - first(f))
 
-# sum, integrate, and idfferentiate are in CalculusOperator
+# sum, integrate, and differentiate are in CalculusOperator
 
 """
     reverseorientation(f::Fun)
@@ -827,11 +827,11 @@ end
 #   exp.( [x,x]) is equivalent to [exp(x),exp(x)]
 #
 # does not throw the same error. When array values are mixed with arrays, the Array
-# takes presidence:
+# takes precedence:
 #
 #   exp.([x;x] .+ [x,x]) is equivalent to exp.(Array([x;x]) .+ [x,x])
 #
-# This presidence is picked by the `promote_containertype` overrides.
+# This precedence is picked by the `promote_containertype` overrides.
 
 struct FunStyle <: BroadcastStyle end
 

src/LinearAlgebra/RaggedMatrix.jl

@@ -11,7 +11,7 @@ struct RaggedMatrix{T} <: AbstractMatrix{T}
     cols::Vector{Int} # a Vector specifying the first index of each column
     m::Int #Number of rows
     function RaggedMatrix{T}(data::Vector{T}, cols::Vector{Int}, m::Int) where T
-        # make sure the cols are monitonically increasing
+        # make sure the cols are monotonically increasing
         @assert 1==cols[1]
         for j=1:length(cols)-1
             @assert cols[j] ≤ cols[j+1]

src/LinearAlgebra/rowvector.jl

@@ -64,7 +64,7 @@ to_vec(x) = x
 # expects to operate within the transposed domain, so to_vec transposes the elements
 @inline map(f, rowvecs::RowVector...) = RowVector(map(f, to_vecs(rowvecs...)...))
 
-# broacast (other combinations default to higher-dimensional array)
+# broadcast (other combinations default to higher-dimensional array)
 @inline broadcast(f, rowvecs::Union{Number,RowVector}...) =
     RowVector(broadcast(f, to_vecs(rowvecs...)...))
 

src/Multivariate/ProductFun.jl

@@ -306,7 +306,7 @@ function canonicalevaluate(f::ProductFun{S,V,SS,T},x::Number,::Colon) where {S,V
 end
 canonicalevaluate(f::ProductFun,x::Number,y::Number) = canonicalevaluate(f,x,:)(y)
 canonicalevaluate(f::ProductFun{S,V,SS},x::Colon,y::Number) where {S,V,SS<:TensorSpace} =
-    evaluate(transpose(f),y,:)  # doesn't make sense For general product fon without specifying space
+    evaluate(transpose(f),y,:)  # doesn't make sense For general product fun without specifying space
 
 canonicalevaluate(f::ProductFun,xx::AbstractVector,yy::AbstractVector) =
     transpose(hcat([evaluate(f,x,:)(yy) for x in xx]...))