Merge pull request #2243 from vaerksted/master

fix typos

Author: ChrisRackauckas

CONTRIBUTING.md

@@ -1,3 +1,3 @@
   - This repository follows the [SciMLStyle](https://github.com/SciML/SciMLStyle) and the SciML [ColPrac](https://github.com/SciML/ColPrac).
-  - Please run `using JuliaFormatter, ModelingToolkit; format(joinpath(dirname(pathof(ModelingToolkit)), ".."))` before commiting.
+  - Please run `using JuliaFormatter, ModelingToolkit; format(joinpath(dirname(pathof(ModelingToolkit)), ".."))` before committing.
   - Add tests for any new features.

docs/src/basics/FAQ.md

@@ -120,7 +120,7 @@ We can solve this problem by using the `missing_variable_defaults()` function
 prob = ODEProblem(sys, ModelingToolkit.missing_variable_defaults(sys), (0,1))
 ```
 
-This function provides 0 for the default values, which is a safe assumption for dummy derivatives of most models.  However, the 2nd arument allows for a different default value or values to be used if needed.
+This function provides 0 for the default values, which is a safe assumption for dummy derivatives of most models.  However, the 2nd argument allows for a different default value or values to be used if needed.
 
 ```
 julia> ModelingToolkit.missing_variable_defaults(sys, [1,2,3])

src/ModelingToolkit.jl

@@ -106,7 +106,7 @@ abstract type AbstractOptimizationSystem <: AbstractTimeIndependentSystem end
 
 function independent_variable end
 
-# this has to be included early to deal with depency issues
+# this has to be included early to deal with dependency issues
 include("structural_transformation/bareiss.jl")
 function complete end
 function var_derivative! end

src/bipartite_graph.jl

@@ -618,7 +618,7 @@ Essentially the graph adapter performs two largely orthogonal functions
  1. It pairs an undirected bipartite graph with a matching of the destination vertex.
 
     This matching is used to induce an orientation on the otherwise undirected graph:
-    Matched edges pass from destination to source [source to desination], all other edges
+    Matched edges pass from destination to source [source to destination], all other edges
     pass in the opposite direction.
 
  2. It exposes the graph view obtained by contracting the destination [source] vertices
@@ -632,7 +632,7 @@ graph is acyclic.
 # Hypergraph interpretation
 
 Consider the bipartite graph `B` as the incidence graph of some hypergraph `H`.
-Note that a maching `M` on `B` in the above sense is equivalent to determining
+Note that a matching `M` on `B` in the above sense is equivalent to determining
 an (1,n)-orientation on the hypergraph (i.e. each directed hyperedge has exactly
 one head, but any arbitrary number of tails). In this setting, this is simply
 the graph formed by expanding each directed hyperedge into `n` ordinary edges
@@ -685,7 +685,7 @@ function Base.iterate(c::CMONeighbors{false}, (l, state...))
         r === nothing && return nothing
         # If this is a matched edge, skip it, it's reversed in the induced
         # directed graph. Otherwise, if there is no matching for this destination
-        # edge, also skip it, since it got delted in the contraction.
+        # edge, also skip it, since it got deleted in the contraction.
         vsrc = c.g.matching[r[1]]
         if vsrc === c.v || !isa(vsrc, Int)
             state = (r[2],)

src/inputoutput.jl

@@ -112,13 +112,13 @@ end
     same_or_inner_namespace(u, var)
 
 Determine whether `var` is in the same namespace as `u`, or a namespace internal to the namespace of `u`.
-Example: `sys.u ~ sys.inner.u` will bind `sys.inner.u`, but `sys.u` remains an unbound, external signal. The namepsaced signal `sys.inner.u` lives in a namspace internal to `sys`.
+Example: `sys.u ~ sys.inner.u` will bind `sys.inner.u`, but `sys.u` remains an unbound, external signal. The namespaced signal `sys.inner.u` lives in a namespace internal to `sys`.
 """
 function same_or_inner_namespace(u, var)
     nu = get_namespace(u)
     nv = get_namespace(var)
     nu == nv ||           # namespaces are the same
-        startswith(nv, nu) || # or nv starts with nu, i.e., nv is an inner namepsace to nu
+        startswith(nv, nu) || # or nv starts with nu, i.e., nv is an inner namespace to nu
         occursin('₊', string(getname(var))) &&
             !occursin('₊', string(getname(u))) # or u is top level but var is internal
 end
@@ -127,7 +127,7 @@ function inner_namespace(u, var)
     nu = get_namespace(u)
     nv = get_namespace(var)
     nu == nv && return false
-    startswith(nv, nu) || # or nv starts with nu, i.e., nv is an inner namepsace to nu
+    startswith(nv, nu) || # or nv starts with nu, i.e., nv is an inner namespace to nu
         occursin('₊', string(getname(var))) &&
             !occursin('₊', string(getname(u))) # or u is top level but var is internal
 end
@@ -177,7 +177,7 @@ f_ip  : (xout,x,u,p,t) -> nothing
 
 The return values also include the remaining states and parameters, in the order they appear as arguments to `f`.
 
-If `disturbance_inputs` is an array of variables, the generated dynamics function will preserve any state and dynamics associated with distrubance inputs, but the distrubance inputs themselves will not be included as inputs to the generated function. The use case for this is to generate dynamics for state observers that estimate the influence of unmeasured disturbances, and thus require state variables for the disturbance model, but without disturbance inputs since the disturbances are not available for measurement.
+If `disturbance_inputs` is an array of variables, the generated dynamics function will preserve any state and dynamics associated with disturbance inputs, but the disturbance inputs themselves will not be included as inputs to the generated function. The use case for this is to generate dynamics for state observers that estimate the influence of unmeasured disturbances, and thus require state variables for the disturbance model, but without disturbance inputs since the disturbances are not available for measurement.
 See [`add_input_disturbance`](@ref) for a higher-level interface to this functionality.
 
 # Example

src/structural_transformation/bareiss.jl

@@ -34,7 +34,7 @@ else
     function Base.swapcols!(A::AbstractSparseMatrixCSC, i, j)
         i == j && return
 
-        # For simplicitly, let i denote the smaller of the two columns
+        # For simplicity, let i denote the smaller of the two columns
         j < i && @swap(i, j)
 
         colptr = getcolptr(A)
@@ -72,7 +72,7 @@ else
         return nothing
     end
     function swaprows!(A::AbstractSparseMatrixCSC, i, j)
-        # For simplicitly, let i denote the smaller of the two rows
+        # For simplicity, let i denote the smaller of the two rows
         j < i && @swap(i, j)
 
         rows = rowvals(A)
@@ -184,7 +184,7 @@ const bareiss_virtcolswap = ((M, i, j) -> nothing, swaprows!,
 Perform Bareiss's fraction-free row-reduction algorithm on the matrix `M`.
 Optionally, a specific pivoting method may be specified.
 
-swap_strategy is an optional argument that determines how the swapping of rows and coulmns is performed.
+swap_strategy is an optional argument that determines how the swapping of rows and columns is performed.
 bareiss_colswap (the default) swaps the columns and rows normally.
 bareiss_virtcolswap pretends to swap the columns which can be faster for sparse matrices.
 """

src/structural_transformation/partial_state_selection.jl

@@ -209,7 +209,7 @@ function dummy_derivative_graph!(structure::SystemStructure, var_eq_matching, ja
             J = nothing
         else
             _J = jac(eqs, vars)
-            # only accecpt small intergers to avoid overflow
+            # only accept small integers to avoid overflow
             is_all_small_int = all(_J) do x′
                 x = unwrap(x′)
                 x isa Number || return false

src/structural_transformation/symbolics_tearing.jl

@@ -103,7 +103,7 @@ function full_equations(sys::AbstractSystem; simplify = false)
             if rhs isa Symbolic
                 return 0 ~ rhs
             else # a number
-                error("tearing failled because the system is singular")
+                error("tearing failed because the system is singular")
             end
         end
         eq
@@ -194,7 +194,7 @@ function to_mass_matrix_form(neweqs, ieq, graph, fullvars, isdervar::F,
         return (new_lhs ~ new_rhs), invview(var_to_diff)[dervar]
     else # a number
         if abs(rhs) > 100eps(float(rhs))
-            @warn "The equation $eq is not consistent. It simplifed to 0 == $rhs."
+            @warn "The equation $eq is not consistent. It simplified to 0 == $rhs."
         end
         return nothing
     end

src/systems/alias_elimination.jl

@@ -200,7 +200,7 @@ count_nonzeros(a::CLILVector) = nnz(a)
 
 # Linear variables are highest order differentiated variables that only appear
 # in linear equations with only linear variables. Also, if a variable's any
-# derivaitves is nonlinear, then all of them are not linear variables.
+# derivatives is nonlinear, then all of them are not linear variables.
 function find_linear_variables(graph, linear_equations, var_to_diff, irreducibles)
     stack = Int[]
     linear_variables = falses(length(var_to_diff))
@@ -273,7 +273,7 @@ function aag_bareiss!(structure, mm_orig::SparseMatrixCLIL{T, Ti}) where {T, Ti}
     # linear algebraic equations can be set to 0.
     #
     # For all the other variables, we can update the original system with
-    # Bareiss'ed coefficients as Gaussian elimination is nullspace perserving
+    # Bareiss'ed coefficients as Gaussian elimination is nullspace preserving
     # and we are only working on linear homogeneous subsystem.
 
     is_algebraic = let var_to_diff = var_to_diff

src/systems/diffeqs/modelingtoolkitize.jl

@@ -37,7 +37,7 @@ function modelingtoolkitize(prob::DiffEqBase.ODEProblem; kwargs...)
             elseif v in var_set
                 D(v)
             else
-                error("Non-permuation mass matrix is not supported.")
+                error("Non-permutation mass matrix is not supported.")
             end
         end
     end