@@ -110,7 +110,7 @@ move_fixed(x::AbstractSparseMatrixCSC) = FixedSparseCSC(size(x)..., getcolptr(x)
110
110
"""
111
111
`_unsafe_unfix(x)`
112
112
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.
114
114
"""
115
115
_unsafe_unfix (x:: FixedSparseCSC ) = SparseMatrixCSC (size (x)... , parent (getcolptr (x)), parent (rowvals (x)), nonzeros (x))
116
116
_unsafe_unfix (x:: SparseMatrixCSC ) = x
@@ -697,7 +697,7 @@ the original sparse matrix, except in the case where dimensions of the
697
697
output matrix are different from the output.
698
698
699
699
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.
701
701
"""
702
702
similar (S:: AbstractSparseMatrixCSC{<:Any,Ti} , :: Type{TvNew} ) where {Ti,TvNew} =
703
703
@if_move_fixed S _sparsesimilar (S, TvNew, Ti)
@@ -1361,7 +1361,7 @@ end
1361
1361
1362
1362
Transpose `A` and store it in `X` while applying the function `f` to the non-zero elements.
1363
1363
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.
1365
1365
1366
1366
See `halfperm!`
1367
1367
"""
@@ -1382,7 +1382,7 @@ end
1382
1382
1383
1383
Transpose the matrix `A` and stores it in the matrix `X`.
1384
1384
`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.
1386
1386
1387
1387
See `halfperm!`
1388
1388
"""
@@ -1393,7 +1393,7 @@ transpose!(X::AbstractSparseMatrixCSC{Tv,Ti}, A::AbstractSparseMatrixCSC{Tv,Ti})
1393
1393
1394
1394
Transpose the matrix `A` and stores the adjoint of the elements in the matrix `X`.
1395
1395
`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.
1397
1397
1398
1398
See `halfperm!`
1399
1399
"""
@@ -4273,7 +4273,7 @@ end
4273
4273
function Base. swapcols! (A:: AbstractSparseMatrixCSC , i, j)
4274
4274
i == j && return
4275
4275
4276
- # For simplicitly , let i denote the smaller of the two columns
4276
+ # For simplicity , let i denote the smaller of the two columns
4277
4277
j < i && @swap (i, j)
4278
4278
4279
4279
colptr = getcolptr (A)
@@ -4312,7 +4312,7 @@ function Base.swapcols!(A::AbstractSparseMatrixCSC, i, j)
4312
4312
end
4313
4313
4314
4314
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
4316
4316
j < i && @swap (i, j)
4317
4317
4318
4318
rows = rowvals (A)
0 commit comments