@@ -2102,10 +2102,9 @@ _mapreducerows!(pred::P, ::typeof(&), R::AbstractMatrix{Bool},
2102
2102
2103
2103
# findmax/min and argmax/min methods
2104
2104
# find first zero value in sparse matrix - return linear index in full matrix
2105
- # non-structural zeros are identified by x == 0 in line with the sparse constructors.
2105
+ # non-structural zeros are identified by `iszero` in line with the sparse constructors.
2106
2106
function _findz (A:: AbstractSparseMatrixCSC{Tv,Ti} , rows= 1 : size (A, 1 ), cols= 1 : size (A, 2 )) where {Tv,Ti}
2107
2107
colptr = getcolptr (A); rowval = rowvals (A); nzval = nonzeros (A)
2108
- zval = 0
2109
2108
row = 0
2110
2109
rowmin = rows[1 ]; rowmax = rows[end ]
2111
2110
allrows = (rows == 1 : size (A, 1 ))
@@ -2117,7 +2116,7 @@ function _findz(A::AbstractSparseMatrixCSC{Tv,Ti}, rows=1:size(A, 1), cols=1:siz
2117
2116
(r1 <= r2 ) && (r2 = searchsortedlast (rowval, rowmax, r1, r2, Forward))
2118
2117
end
2119
2118
row = rowmin
2120
- while (r1 <= r2) && (row == rowval[r1]) && (nzval[r1] != zval )
2119
+ while (r1 <= r2) && (row == rowval[r1]) && ! iszero (nzval[r1])
2121
2120
r1 += 1
2122
2121
row += 1
2123
2122
end
@@ -2723,7 +2722,7 @@ function Base.fill!(V::SubArray{Tv, <:Any, <:AbstractSparseMatrixCSC{Tv}, <:Tupl
2723
2722
if (I[1 ] < 1 || I[end ] > size (A, 1 )) || (J[1 ] < 1 || J[end ] > size (A, 2 ))
2724
2723
throw (BoundsError (A, (I, J)))
2725
2724
end
2726
- if x == 0
2725
+ if iszero (x)
2727
2726
_spsetz_setindex! (A, I, J)
2728
2727
else
2729
2728
_spsetnz_setindex! (A, convert (Tv, x), I, J)
@@ -3539,7 +3538,7 @@ function is_hermsym(A::AbstractSparseMatrixCSC, check::Function)
3539
3538
row = rowval[p]
3540
3539
3541
3540
# Ignore stored zeros
3542
- if val == 0
3541
+ if iszero ( val)
3543
3542
continue
3544
3543
end
3545
3544
0 commit comments