v0.6 backward compatibility 2

Author: mohamed82008

REQUIRE

@@ -1,3 +1,3 @@
 julia 0.6
-IterativeSolvers 0.7.0
+IterativeSolvers 0.6.0
 Compat 1.0.0

src/AMG.jl

@@ -5,6 +5,8 @@ using Compat, Compat.LinearAlgebra
 using Compat.SparseArrays, Compat.Printf
 using Base.Threads
 
+using Compat: rmul!
+
 const MT = false
 
 include("utils.jl")

src/preconditioner.jl

@@ -1,13 +1,18 @@
-import LinearAlgebra: \, *, ldiv!, mul!
-
 struct Preconditioner
     ml::MultiLevel
 end
 
 aspreconditioner(ml::MultiLevel) = Preconditioner(ml)
 
+@static if VERSION < v"0.7-"
+    import Base: \, *, A_ldiv_B!, A_mul_B!
+    A_ldiv_B!(x, p::Preconditioner, b) = copyto!(x, p \ b)
+    A_mul_B!(b, p::Preconditioner, x) = A_mul_B!(b, p.ml.levels[1].A, x)
+else
+    import Compat.LinearAlgebra: \, *, ldiv!, mul!
+    ldiv!(x, p::Preconditioner, b) = copyto!(x, p \ b)
+    mul!(b, p::Preconditioner, x) = mul!(b, p.ml.levels[1].A, x)
+end
+
 \(p::Preconditioner, b) = solve(p.ml, b, maxiter = 1, tol = 1e-12)
 *(p::Preconditioner, b) = p.ml.levels[1].A * x
-
-ldiv!(x, p::Preconditioner, b) = copyto!(x, p \ b)
-mul!(b, p::Preconditioner, x) = mul!(b, p.ml.levels[1].A, x)

src/utils.jl

@@ -21,19 +21,19 @@ function approximate_spectral_radius(A, tol = 0.01,
         # m, max_index = findmax(abs.(ev))
         m, max_index = findmaxabs(ev)
         error = H[nvecs, nvecs-1] * evect[end, max_index]
+        @static if VERSION < v"0.7-"
+            @views A_mul_B!(v0, X, evect[:, max_index])
+        else
+            @views mul!(v0, X, evect[:, max_index])
+        end
         if (abs(error) / abs(ev[max_index]) < tol) || flag
             # v0 = X * evect[:, max_index]
-            mul!(v0, X, evect[:, max_index])
             break
-        else
-            # v0 = X * evect[:, max_index]
-            mul!(v0, X, evect[:, max_index])
         end
     end
-
     ρ = abs(ev[max_index])
-
 end
+
 function findmaxabs(arr)
     m = abs(arr[1])
     m_i = 1