Fix more depwarns

Author: YingboMa

.travis.yml

@@ -3,7 +3,7 @@ language: julia
 os:
   - linux
 julia:
-  - 0.6
+  - 0.7
   - nightly
 matrix:
   allow_failures:

appveyor.yml

@@ -1,7 +1,7 @@
 environment:
   matrix:
-    - JULIA_URL: "https://julialang-s3.julialang.org/bin/winnt/x86/0.6/julia-0.6-latest-win32.exe"
-    - JULIA_URL: "https://julialang-s3.julialang.org/bin/winnt/x64/0.6/julia-0.6-latest-win64.exe"
+    - JULIA_URL: "https://julialang-s3.julialang.org/bin/winnt/x86/0.7/julia-0.7-latest-win32.exe"
+    - JULIA_URL: "https://julialang-s3.julialang.org/bin/winnt/x64/0.7/julia-0.7-latest-win64.exe"
     - JULIA_URL: "https://julialangnightlies-s3.julialang.org/bin/winnt/x86/julia-latest-win32.exe"
     - JULIA_URL: "https://julialangnightlies-s3.julialang.org/bin/winnt/x64/julia-latest-win64.exe"
 matrix:

src/array_partition.jl

@@ -124,7 +124,7 @@ end
 
 Base.mapreduce(f,op,A::ArrayPartition) = mapreduce(f,op,(mapreduce(f,op,x) for x in A.x))
 Base.any(f,A::ArrayPartition) = any(f,(any(f,x) for x in A.x))
-function Base.copy!(dest::Array,A::ArrayPartition)
+function Base.copyto!(dest::Array,A::ArrayPartition)
     @assert length(dest) == length(A)
     cur = 1
     @inbounds for i in 1:length(A.x)
@@ -133,7 +133,7 @@ function Base.copy!(dest::Array,A::ArrayPartition)
     end
 end
 
-function Base.copy!(A::ArrayPartition,src::ArrayPartition)
+function Base.copyto!(A::ArrayPartition,src::ArrayPartition)
     @assert length(src) == length(A)
     cur = 1
     @inbounds for i in 1:length(A.x)

src/utils.jl

@@ -26,7 +26,7 @@ function recursivecopy!(b::AbstractArray{T,N},a::AbstractArray{T2,N}) where {T<:
 end
 
 function recursivecopy!(b::AbstractArray{T,N},a::AbstractArray{T2,N}) where {T<:Number,T2<:Number,N}
-  copy!(b,a)
+  copyto!(b,a)
 end
 
 function recursivecopy!(b::AbstractArray{T,N},a::AbstractArray{T2,N}) where {T<:AbstractArray,T2<:AbstractArray,N}

test/basic_indexing.jl

@@ -2,7 +2,7 @@ using RecursiveArrayTools
 
 # Example Problem
 recs = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
-testa = cat(2, recs...)
+testa = cat(recs..., dims=2)
 testva = VectorOfArray(recs)
 t = [1,2,3]
 diffeq = DiffEqArray(recs,t)
@@ -13,7 +13,7 @@ testa[1:2, 1:2] == [1 4; 2 5]
 
 # # ndims == 2
 recs = [rand(8) for i in 1:10]
-testa = cat(2, recs...)
+testa = cat(recs...,dims=2)
 testva = VectorOfArray(recs)
 
 # ## Linear indexing
@@ -36,7 +36,7 @@ testva = VectorOfArray(recs)
 
 # # ndims == 3
 recs = recs = [rand(10, 8) for i in 1:15]
-testa = cat(3, recs...)
+testa = cat(recs...,dims=3)
 testva = VectorOfArray(recs)
 
 # ## (Int, Int, Int)

test/copy_static_array_test.jl

@@ -13,7 +13,7 @@ end
 # Immutable FieldVector
 vec = ImmutableFV(1.,2.)
 a = [vec]
-b = zeros(a)
+b = zero(a)
 recursivecopy!(b, a)
 @test a[1] == b[1]
 copyat_or_push!(a, 2, b[1])
@@ -25,7 +25,7 @@ copyat_or_push!(a, 2, b[1])
 # Mutable FieldVector
 vec = MutableFV(1.,2.)
 a = [vec]
-b = zeros(a)
+b = zero(a)
 recursivecopy!(b, a)
 @test a[1] == b[1]
 a[1][1] *= 5
@@ -41,7 +41,7 @@ copyat_or_push!(a, 2, b[1])
 # SArray
 vec = @SArray [1., 2.]
 a = [vec]
-b = zeros(a)
+b = zero(a)
 recursivecopy!(b, a)
 @test a[1] == b[1]
 copyat_or_push!(a, 2, b[1])
@@ -53,7 +53,7 @@ copyat_or_push!(a, 2, b[1])
 # MArray
 vec = @MArray [1., 2.]
 a = [vec]
-b = zeros(a)
+b = zero(a)
 recursivecopy!(b, a)
 a[1][1] *= 5
 @test a[1] != b[1]

test/interface_tests.jl

@@ -36,7 +36,7 @@ testva[4, 9] # == testva.data[9][4]
 # convert array from VectorOfArray
 recs = [rand(10, 7) for i = 1:8]
 testva = VectorOfArray(recs)
-testa = cat(3, recs...)
+testa = cat(recs...,dims=3)
 @test convert(Array,testva) == testa
 
 recs = [[1, 2, 3], [3 5; 6 7], [8, 9, 10, 11]]

test/partitions_test.jl

@@ -11,7 +11,7 @@ p2[1] = 1
 @test p2.x[1] != p.x[1]
 
 C = rand(10)
-p3 = similar(p,indices(p))
+p3 = similar(p,axes(p))
 @test length(p3.x[1]) == length(p3.x[2]) == 5
 @test length(p.x) == length(p2.x) == length(p3.x) == 2
 
@@ -21,20 +21,20 @@ B = (rand(5),rand(5))
 p2 = ArrayPartition(B)
 a = 5
 
-p .= (*).(p,5)
-p .= (*).(p,a)
-p .= (*).(p,p2)
-K = (*).(p,p2)
+@. p = p*5
+@. p = p*a
+@. p = p*p2
+K = p.*p2
 
 p.*rand(5)
 b = rand(10)
 c = rand(10)
-copy!(b,p)
+copyto!(b,p)
 
 @test b[1:5] == p.x[1]
 @test b[6:10] == p.x[2]
 
-copy!(p,c)
+copyto!(p,c)
 @test c[1:5] == p.x[1]
 @test c[6:10] == p.x[2]