remove some functions that have become redundant in the meantime

Author: jop611

src/PartitionedArrays.jl

@@ -6,6 +6,7 @@ using LinearAlgebra
 using Printf
 using CircularArrays
 using StaticArrays
+import Base: +,-,*,/
 import MPI
 import IterativeSolvers
 import Distances
@@ -189,7 +190,6 @@ include("gallery.jl")
 
 export ascsc
 export ascsr
-export copy
 export similar
 export sparsecsr
 export strictly_equivalent
@@ -198,7 +198,6 @@ export pointer_array
 export index_array
 include("sparse_helpers.jl")
 
-import Base: +,-,*,/
 export RAP
 export RAP!
 export RAPadd!
@@ -208,5 +207,4 @@ export mul!
 export mul_search!
 include("sequential_implementations.jl")
 
-
 end # module

src/sparse_helpers.jl

@@ -97,18 +97,6 @@ function counts_to_ptrs!(v)
     v[1] = 1
 end
 
-function Base.similar(A::SparseMatrixCSR{Bi}, m::Integer, n::Integer) where Bi
-    return SparseMatrixCSR{1}(m, n, ones(eltype(A.rowptr), m+1), eltype(A.colval)[], eltype(A.nzval)[])
-end
-
-function Base.similar(A::SparseMatrixCSR{Bi}) where Bi
-    return SparseMatrixCSR{Bi}(size(A)..., copy(A.rowptr), copy(colvals(A)), similar(nonzeros(A)))
-end
-
-function Base.copy(A::SparseMatrixCSR{Bi}) where Bi
-    return SparseMatrixCSR{Bi}(size(A)..., copy(A.rowptr), copy(colvals(A)), copy(nonzeros(A)))
-end
-
 function SparseMatricesCSR.sparsecsr(A::SparseMatrixCSC)
     sparsecsr(findnz(A)..., size(A)...)
 end
@@ -155,9 +143,6 @@ function strictly_equivalent(A::SparseMatrixCSR, B::SparseMatrixCSR)
 end
 
 function strictly_equivalent(A::SparseMatrixCSR,B::SparseMatrixCSC) strictly_equivalent(B,A) end
-function ==(A::SparseMatrixCSC,B::SparseMatrixCSR) strictly_equivalent(A,B) end
-function ==(A::SparseMatrixCSR,B::SparseMatrixCSC) strictly_equivalent(B,A) end
-function ==(A::SparseMatrixCSR,B::SparseMatrixCSR) strictly_equivalent(A,B) end
 
 # Equality definition for SparseCSC and SparseCSR. If the size and lengths match, the CSR matrix is converted.
 function approx_equivalent(A::SparseMatrixCSC, B::SparseMatrixCSR,args...)
@@ -191,9 +176,6 @@ function approx_equivalent(A::SparseMatrixCSR, B::SparseMatrixCSR,args...)
 end
 
 function approx_equivalent(A::SparseMatrixCSR,B::SparseMatrixCSC) approx_equivalent_equivalent(B,A) end
-function ≈(A::SparseMatrixCSC,B::SparseMatrixCSR) approx_equivalent(A,B) end
-function ≈(A::SparseMatrixCSR,B::SparseMatrixCSC) approx_equivalent(B,A) end
-function ≈(A::SparseMatrixCSR,B::SparseMatrixCSR) approx_equivalent(A,B) end
 
 function copy(At::Transpose{Tv,SparseMatrixCSR{Bi,Tv,Ti}}) where {Bi,Tv,Ti}
     A = At.parent

times.txt

@@ -1 +1 @@
-Dict{String, @NamedTuple{min::Float64, max::Float64, avg::Float64}}("Phase 143" => (min = 0.2188811, max = 0.2188811, avg = 0.2188811), "Phase 3" => (min = 0.0, max = 0.0, avg = 0.0), "Matrix Assembly" => (min = 0.4098738, max = 0.4098738, avg = 0.4098738), "Phase 1" => (min = 5.0e-7, max = 5.0e-7, avg = 5.0e-7))
+Dict{String, @NamedTuple{min::Float64, max::Float64, avg::Float64}}("Phase 143" => (min = 0.2013603, max = 0.2013603, avg = 0.2013603), "Phase 3" => (min = 0.0, max = 0.0, avg = 0.0), "Matrix Assembly" => (min = 0.4048329, max = 0.4048329, avg = 0.4048329), "Phase 1" => (min = 1.2e-6, max = 1.2e-6, avg = 1.2e-6))