Skip to content

Commit 53179e1

Browse files
authored
Correct some typos (#375)
Signed-off-by: Alexander Seiler <[email protected]>
1 parent 994bca1 commit 53179e1

File tree

4 files changed

+14
-14
lines changed

4 files changed

+14
-14
lines changed

src/abstractsparse.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -145,7 +145,7 @@ is stored in `_restore_scalar_indexing` and a function that has the same definit
145145
returns an error is stored in `_destroy_scalar_indexing`.
146146
"""
147147
macro RCI(exp)
148-
# Evaluate to not push any broken code in the arrays when developping this package.
148+
# Evaluate to not push any broken code in the arrays when developing this package.
149149
# Ensures that restore has the exact same effect.
150150
# Expand macro so we can chain macros. Save the expanded version for speed
151151
exp = macroexpand(__module__, exp)

src/sparsematrix.jl

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,7 @@ move_fixed(x::AbstractSparseMatrixCSC) = FixedSparseCSC(size(x)..., getcolptr(x)
110110
"""
111111
`_unsafe_unfix(x)`
112112
113-
Experimental, unsafe. Returns a modifyable version of `x` for compatibility with this codebase.
113+
Experimental, unsafe. Returns a modifiable version of `x` for compatibility with this codebase.
114114
"""
115115
_unsafe_unfix(x::FixedSparseCSC) = SparseMatrixCSC(size(x)..., parent(getcolptr(x)), parent(rowvals(x)), nonzeros(x))
116116
_unsafe_unfix(x::SparseMatrixCSC) = x
@@ -697,7 +697,7 @@ the original sparse matrix, except in the case where dimensions of the
697697
output matrix are different from the output.
698698
699699
The output matrix has zeros in the same locations as the input, but
700-
unititialized values for the nonzero locations.
700+
uninitialized values for the nonzero locations.
701701
"""
702702
similar(S::AbstractSparseMatrixCSC{<:Any,Ti}, ::Type{TvNew}) where {Ti,TvNew} =
703703
@if_move_fixed S _sparsesimilar(S, TvNew, Ti)
@@ -1361,7 +1361,7 @@ end
13611361
13621362
Transpose `A` and store it in `X` while applying the function `f` to the non-zero elements.
13631363
Does not remove the zeros created by `f`. `size(X)` must be equal to `size(transpose(A))`.
1364-
No additonal memory is allocated other than resizing the rowval and nzval of `X`, if needed.
1364+
No additional memory is allocated other than resizing the rowval and nzval of `X`, if needed.
13651365
13661366
See `halfperm!`
13671367
"""
@@ -1382,7 +1382,7 @@ end
13821382
13831383
Transpose the matrix `A` and stores it in the matrix `X`.
13841384
`size(X)` must be equal to `size(transpose(A))`.
1385-
No additonal memory is allocated other than resizing the rowval and nzval of `X`, if needed.
1385+
No additional memory is allocated other than resizing the rowval and nzval of `X`, if needed.
13861386
13871387
See `halfperm!`
13881388
"""
@@ -1393,7 +1393,7 @@ transpose!(X::AbstractSparseMatrixCSC{Tv,Ti}, A::AbstractSparseMatrixCSC{Tv,Ti})
13931393
13941394
Transpose the matrix `A` and stores the adjoint of the elements in the matrix `X`.
13951395
`size(X)` must be equal to `size(transpose(A))`.
1396-
No additonal memory is allocated other than resizing the rowval and nzval of `X`, if needed.
1396+
No additional memory is allocated other than resizing the rowval and nzval of `X`, if needed.
13971397
13981398
See `halfperm!`
13991399
"""
@@ -4273,7 +4273,7 @@ end
42734273
function Base.swapcols!(A::AbstractSparseMatrixCSC, i, j)
42744274
i == j && return
42754275

4276-
# For simplicitly, let i denote the smaller of the two columns
4276+
# For simplicity, let i denote the smaller of the two columns
42774277
j < i && @swap(i, j)
42784278

42794279
colptr = getcolptr(A)
@@ -4312,7 +4312,7 @@ function Base.swapcols!(A::AbstractSparseMatrixCSC, i, j)
43124312
end
43134313

43144314
function Base.swaprows!(A::AbstractSparseMatrixCSC, i, j)
4315-
# For simplicitly, let i denote the smaller of the two rows
4315+
# For simplicity, let i denote the smaller of the two rows
43164316
j < i && @swap(i, j)
43174317

43184318
rows = rowvals(A)

src/sparsevector.jl

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1246,7 +1246,7 @@ promote_to_arrays_(n::Int, ::Type{SparseMatrixCSC}, J::UniformScaling) = sparse(
12461246
Concatenate along dimension 2. Return a SparseMatrixCSC object.
12471247
12481248
!!! compat "Julia 1.8"
1249-
This method was added in Julia 1.8. It mimicks previous concatenation behavior, where
1249+
This method was added in Julia 1.8. It mimics previous concatenation behavior, where
12501250
the concatenation with specialized "sparse" matrix types from LinearAlgebra.jl
12511251
automatically yielded sparse output even in the absence of any SparseArray argument.
12521252
"""
@@ -1261,7 +1261,7 @@ end
12611261
Concatenate along dimension 1. Return a SparseMatrixCSC object.
12621262
12631263
!!! compat "Julia 1.8"
1264-
This method was added in Julia 1.8. It mimicks previous concatenation behavior, where
1264+
This method was added in Julia 1.8. It mimics previous concatenation behavior, where
12651265
the concatenation with specialized "sparse" matrix types from LinearAlgebra.jl
12661266
automatically yielded sparse output even in the absence of any SparseArray argument.
12671267
"""
@@ -1278,7 +1278,7 @@ for block matrix syntax. The first argument specifies the number of
12781278
arguments to concatenate in each block row.
12791279
12801280
!!! compat "Julia 1.8"
1281-
This method was added in Julia 1.8. It mimicks previous concatenation behavior, where
1281+
This method was added in Julia 1.8. It mimics previous concatenation behavior, where
12821282
the concatenation with specialized "sparse" matrix types from LinearAlgebra.jl
12831283
automatically yielded sparse output even in the absence of any SparseArray argument.
12841284
"""
@@ -1919,7 +1919,7 @@ function mul!(y::AbstractVector, A::AbstractSparseMatrixCSC, x::AbstractSparseVe
19191919
return y
19201920
end
19211921

1922-
# * and *(Tranpose(A), B)
1922+
# * and *(Transpose(A), B)
19231923
mul!(y::AbstractVector, tA::Transpose{<:Any,<:AbstractSparseMatrixCSC}, x::AbstractSparseVector, α::Number, β::Number) =
19241924
_At_or_Ac_mul_B!((a,b) -> transpose(a) * b, y, tA.parent, x, α, β)
19251925

test/cholmod.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -807,7 +807,7 @@ end
807807
end
808808
end
809809

810-
@testset "Test sparse low rank update for cholesky decomposion" begin
810+
@testset "Test sparse low rank update for cholesky decomposition" begin
811811
A = SparseMatrixCSC{Float64,SuiteSparse_long}(10, 5, [1,3,6,8,10,13], [6,7,1,2,9,3,5,1,7,6,7,9],
812812
[-0.138843, 2.99571, -0.556814, 0.669704, -1.39252, 1.33814,
813813
1.02371, -0.502384, 1.10686, 0.262229, -1.6935, 0.525239])
@@ -923,7 +923,7 @@ end
923923
end
924924

925925
@testset "Check common is still in default state" begin
926-
# This test intentially depends on all the above tests!
926+
# This test intentionally depends on all the above tests!
927927
current_common = CHOLMOD.getcommon()
928928
default_common = Ref(cholmod_common())
929929
result = cholmod_l_start(default_common)

0 commit comments

Comments
 (0)