Merge pull request #254 from araujoms/linearalgebra

more dead code removal

Author: JeffreySarnoff

Project.toml

@@ -9,26 +9,21 @@ version = "1.6.0"
 [deps]
 GenericLinearAlgebra = "14197337-ba66-59df-a3e3-ca00e7dcff7a"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
-Polynomials = "f27b6e38-b328-58d1-80ce-0feddd5e7a45"
 Printf = "de0858da-6303-5e67-8744-51eddeeeb8d7"
 Quadmath = "be4d8f0f-7fa4-5f49-b795-2f01399ab2dd"
 Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
-Requires = "ae029012-a4dd-5104-9daa-d747884805df"
 SpecialFunctions = "276daf66-3868-5448-9aa4-cd146d93841b"
 
 [compat]
 GenericLinearAlgebra = "0.2.5 - 0.3"
-Polynomials = "1 - 4"
 Quadmath = "0.5.10"
-Requires = "1"
 SpecialFunctions = "1 - 2"
 julia = "1.6"
 
 [extras]
 GenericLinearAlgebra = "14197337-ba66-59df-a3e3-ca00e7dcff7a"
 GenericSchur = "c145ed77-6b09-5dd9-b285-bf645a82121e"
-SpecialFunctions = "276daf66-3868-5448-9aa4-cd146d93841b"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
 
 [targets]
-test = ["Test", "SpecialFunctions", "GenericLinearAlgebra", "GenericSchur"]
+test = ["Test", "GenericLinearAlgebra", "GenericSchur"]

src/DoubleFloats.jl

@@ -35,7 +35,6 @@ export DoubleFloat,
 
 using Base.MathConstants: pi, golden, ℯ, eulergamma, catalan
 
-using Requires
 using Printf
 using Random
 import Random: rand, randn

src/math/linearalgebra/matmul.jl

@@ -1,79 +1,3 @@
-"""
-    *(a, b)
-
-A more performant version of `a * b` where a, b are matrices
-"""
-function Base.:(*)(a::Array{DoubleFloat{T},2}, b::Array{DoubleFloat{T},2}) where {T<:IEEEFloat}
-    arows, acols = size(a)
-    brows, bcols = size(b)
-    if  acols != brows
-        throw(DimensionMismatch(string("size(a,1) != size(b,2): ",size(a,1), " != ", size(b,2))))
-    end
-
-    result_rows, result_cols = arows, bcols
-    result = reshape(Array{DoubleFloat{T}, 1}(undef, result_rows*result_cols), (result_rows, result_cols))
-
-    for bcol = 1:bcols
-        for arow=1:arows
-            asum = zero(DoubleFloat{T})
-            for acol=1:acols
-                @inbounds asum = fma(a[arow,acol], b[acol,bcol], asum)
-            end
-            @inbounds result[arow,bcol] = asum
-        end
-    end
-
-    return result
-end
-
-
-function Base.:(*)(a::Array{DoubleFloat{T},2}, b::Array{T,2}) where {T<:IEEEFloat}
-    arows, acols = size(a)
-    brows, bcols = size(b)
-    if  acols != brows
-        throw(DimensionMismatch(string("size(a,1) != size(b,2): ",size(a,1), " != ", size(b,2))))
-    end
-
-    result_rows, result_cols = arows, bcols
-    result = reshape(Array{DoubleFloat{T}, 1}(undef, result_rows*result_cols), (result_rows, result_cols))
-
-    for bcol = 1:bcols
-        for arow=1:arows
-            asum = zero(DoubleFloat{T})
-            for acol=1:acols
-                @inbounds asum = fma(a[arow,acol], b[acol,bcol], asum)
-            end
-            @inbounds result[arow,bcol] = asum
-        end
-    end
-
-    return result
-end
-
-
-function Base.:(*)(a::Array{T,2}, b::Array{DoubleFloat{T},2}) where {T<:IEEEFloat}
-    arows, acols = size(a)
-    brows, bcols = size(b)
-    if  acols != brows
-        throw(DimensionMismatch(string("size(a,1) != size(b,2): ",size(a,1), " != ", size(b,2))))
-    end
-
-    result_rows, result_cols = arows, bcols
-    result = reshape(Array{DoubleFloat{T}, 1}(undef, result_rows*result_cols), (result_rows, result_cols))
-
-    for bcol = 1:bcols
-        for arow=1:arows
-            asum = zero(DoubleFloat{T})
-            for acol=1:acols
-                @inbounds asum = fma(a[arow,acol], b[acol,bcol], asum)
-            end
-            @inbounds result[arow,bcol] = asum
-        end
-    end
-
-    return result
-end
-
 """
     mul!(c, a, b)
 A more performant version of `c = a * b` where a, b, c are matrices

src/math/linearalgebra/support.jl

@@ -2,36 +2,3 @@
     r, c = size(m)
     return r === c
 end
-
-@inline function issquare(m::Array{DoubleFloat{T},2}) where {T<:IEEEFloat}
-    r, c = size(m)
-    return r === c
-end
-
-function LinearAlgebra.norm(v::Array{DoubleFloat{T},N}, p::Real=2.0) where {N, T<:IEEEFloat}
-    isempty(v) && return zero(DoubleFloat{T})
-
-    if isinf(p)
-        return signbit(p) ? minimum(abs.(v)) : maximum(abs.(v))
-    elseif p==2
-        return vp = sqrt(sum(v .* v))
-    else    
-        vp = sum(abs.(v).^(p))
-        r = inv(DoubleFloat{T}(p))
-        return vp^r
-    end    
-end
-
-function LinearAlgebra.norm(v::Array{Complex{DoubleFloat{T}},N}, p::Real=2.0) where {N, T<:IEEEFloat}
-    isempty(v) && return zero(DoubleFloat{T})
-
-    if isinf(p)
-        return signbit(p) ? minimum(abs.(real.(v))) : maximum(abs.(real.(v)))
-    elseif p==2
-        return vp = sqrt(real(sum(conj.(v) .* v)))
-    else    
-        vp = sum(abs.(v).^(p))
-        r = inv(DoubleFloat{T}(p))
-        return vp^r
-    end    
-end