compat fixes for 0.7 (#214)

Author: mlubin

src/HighLevelInterface/quadprog.jl

@@ -34,8 +34,8 @@ function quadprog(c::InputVector, Q::AbstractMatrix, A::AbstractMatrix, rowlb::I
         rhs = rowubtmp
         @assert realtype <: Real
         warn_no_inf(realtype)
-        rowlb = Array{realtype}(nrow)
-        rowub = Array{realtype}(nrow)
+        rowlb = Array{realtype}(undef, nrow)
+        rowub = Array{realtype}(undef, nrow)
         for i in 1:nrow
             if sense[i] == '<'
                 rowlb[i] = typemin(realtype)

src/SolverInterface/nonlinear_to_lpqp.jl

@@ -188,8 +188,8 @@ function jac_structure(d::LPQPEvaluator)
         jac_nnz += 2*length(d.Qconstr[i].quadrowidx)
     end
 
-    I = Vector{Int}(jac_nnz)
-    J = Vector{Int}(jac_nnz)
+    I = Vector{Int}(undef, jac_nnz)
+    J = Vector{Int}(undef, jac_nnz)
     idx = 1
     for col = 1:size(d.A,2)
         for pos = d.A.colptr[col]:(d.A.colptr[col+1]-1)
@@ -244,8 +244,8 @@ function hesslag_structure(d::LPQPEvaluator)
         hess_nnz += length(d.Qconstr[i].quadrowidx)
     end
 
-    I = Vector{Int}(hess_nnz)
-    J = Vector{Int}(hess_nnz)
+    I = Vector{Int}(undef, hess_nnz)
+    J = Vector{Int}(undef, hess_nnz)
 
     for k in 1:length(d.Qi)
         I[k] = d.Qi[k]

test/nlp.jl

@@ -1,5 +1,6 @@
 using Base.Test
 using MathProgBase
+using Compat
 
 # Here the type represents the complete instance, but it
 # could also store instance data.
@@ -114,7 +115,7 @@ function nlptest(solver)
         MathProgBase.optimize!(m)
         stat = MathProgBase.status(m)
         @test stat == :Optimal
-        if method_exists(MathProgBase.freemodel!, Tuple{typeof(m)})
+        if hasmethod(MathProgBase.freemodel!, Tuple{typeof(m)})
             MathProgBase.freemodel!(m)
         end
     end
@@ -180,7 +181,7 @@ function nlptest_nohessian(solver)
         MathProgBase.optimize!(m)
         stat = MathProgBase.status(m)
         @test stat == :Optimal
-        if method_exists(MathProgBase.freemodel!, Tuple{typeof(m)})
+        if hasmethod(MathProgBase.freemodel!, Tuple{typeof(m)})
             MathProgBase.freemodel!(m)
         end
     end
@@ -262,7 +263,7 @@ function convexnlptest(solver)
         MathProgBase.optimize!(m)
         stat = MathProgBase.status(m)
         @test stat == :Optimal
-        if method_exists(MathProgBase.freemodel!, Tuple{typeof(m)})
+        if hasmethod(MathProgBase.freemodel!, Tuple{typeof(m)})
             MathProgBase.freemodel!(m)
         end
     end
@@ -333,7 +334,7 @@ function rosenbrocktest(solver)
         MathProgBase.optimize!(m)
         stat = MathProgBase.status(m)
         @test stat == :Optimal
-        if method_exists(MathProgBase.freemodel!, Tuple{typeof(m)})
+        if hasmethod(MathProgBase.freemodel!, Tuple{typeof(m)})
             MathProgBase.freemodel!(m)
         end
     end

test/quadprog.jl

@@ -13,7 +13,7 @@ function quadprogtest(solver)
             m = MathProgBase.LinearQuadraticModel(solver)
             MathProgBase.loadproblem!(m, [1. 2. 3.; 1. 1. 0.],[-Inf,-Inf,-Inf],[Inf,Inf,Inf],[0.,0.,0.],[4., 1.],[Inf,Inf], :Min)
 
-            MathProgBase.setquadobj!(m,diagm([10.0,10.0,10.0]))
+            MathProgBase.setquadobj!(m,diagm(0 => [10.0,10.0,10.0]))
             rows = [1, 2, 2, 2, 3, 3, 3]
             cols = [1, 1, 1, 2, 2, 3, 3]
             vals = Float64[2, 0.5, 0.5, 2, 1, 1, 1]
@@ -44,7 +44,7 @@ function qpdualtest(solver)
         # s.t. x^2 <= 2
         @testset "QP1" begin
             m = MathProgBase.LinearQuadraticModel(solver)
-            MathProgBase.loadproblem!(m, Array{Float64}(0,1), [-Inf], [Inf], [1.0], Float64[], Float64[], :Max)
+            MathProgBase.loadproblem!(m, zeros(0,1), [-Inf], [Inf], [1.0], Float64[], Float64[], :Max)
             MathProgBase.addquadconstr!(m, [], [], [1], [1], [1.0], '<', 2.0)
             MathProgBase.optimize!(m)
             stat = MathProgBase.status(m)
@@ -62,7 +62,7 @@ function qpdualtest(solver)
         # s.t. x^2 <= 2
         @testset "QP2" begin
             m = MathProgBase.LinearQuadraticModel(solver)
-            MathProgBase.loadproblem!(m, Array{Float64}(0,1), [-Inf], [Inf], [-1.0], Float64[], Float64[], :Min)
+            MathProgBase.loadproblem!(m, zeros(0,1), [-Inf], [Inf], [-1.0], Float64[], Float64[], :Min)
             MathProgBase.addquadconstr!(m, [], [], [1], [1], [1.0], '<', 2.0)
             MathProgBase.optimize!(m)
             stat = MathProgBase.status(m)