Fix deprecations

Author: femtocleaner[bot]

src/array_partition.jl

@@ -4,7 +4,7 @@ end
 
 ## constructors
 
-ArrayPartition(x...) = ArrayPartition((x...))
+ArrayPartition(x...) = ArrayPartition((x...,))
 
 function ArrayPartition(x::S, ::Type{Val{copy_x}}=Val{false}) where {S<:Tuple,copy_x}
   T = promote_type(eltype.(x)...)
@@ -145,12 +145,8 @@ end
 ## indexing
 
 # Interface for the linear indexing. This is just a view of the underlying nested structure
-@static if VERSION >= v"0.7-"
-  @inline Base.firstindex(A::ArrayPartition) = 1
-  @inline Base.lastindex(A::ArrayPartition) = length(A)
-else
-  @inline Base.endof(A::ArrayPartition) = length(A)
-end
+@inline Base.firstindex(A::ArrayPartition) = 1
+@inline Base.lastindex(A::ArrayPartition) = length(A)
 
 @inline function Base.getindex(A::ArrayPartition, i::Int)
   @boundscheck checkbounds(A, i)

src/utils.jl

@@ -100,9 +100,9 @@ recursive_unitless_bottom_eltype(a) = recursive_unitless_bottom_eltype(eltype(a)
 recursive_unitless_bottom_eltype(a::Type{T}) where {T<:Number} = typeof(one(eltype(a)))
 
 Base.@pure recursive_unitless_eltype(a) = recursive_unitless_eltype(eltype(a))
-Base.@pure recursive_unitless_eltype{T<:StaticArray}(a::Type{T}) = similar_type(a,recursive_unitless_eltype(eltype(a)))
-Base.@pure recursive_unitless_eltype{T<:Array}(a::Type{T}) = Array{recursive_unitless_eltype(eltype(a)),ndims(a)}
-Base.@pure recursive_unitless_eltype{T<:Number}(a::Type{T}) = typeof(one(eltype(a)))
+Base.@pure recursive_unitless_eltype(a::Type{T}) where {T<:StaticArray} = similar_type(a,recursive_unitless_eltype(eltype(a)))
+Base.@pure recursive_unitless_eltype(a::Type{T}) where {T<:Array} = Array{recursive_unitless_eltype(eltype(a)),ndims(a)}
+Base.@pure recursive_unitless_eltype(a::Type{T}) where {T<:Number} = typeof(one(eltype(a)))
 
 recursive_mean(x...) = mean(x...)
 function recursive_mean(vecvec::Vector{T}) where T<:AbstractArray

src/vector_of_array.jl

@@ -18,12 +18,8 @@ DiffEqArray(vec::AbstractVector,ts::AbstractVector) = DiffEqArray(vec, ts, (size
 
 
 # Interface for the linear indexing. This is just a view of the underlying nested structure
-@static if VERSION >= v"0.7-"
-  @inline Base.firstindex(VA::AbstractVectorOfArray) = firstindex(VA.u)
-  @inline Base.lastindex(VA::AbstractVectorOfArray) = lastindex(VA.u)
-else
-  @inline Base.endof(VA::AbstractVectorOfArray) = endof(VA.u)
-end
+@inline Base.firstindex(VA::AbstractVectorOfArray) = firstindex(VA.u)
+@inline Base.lastindex(VA::AbstractVectorOfArray) = lastindex(VA.u)
 
 @inline Base.length(VA::AbstractVectorOfArray) = length(VA.u)
 @inline Base.eachindex(VA::AbstractVectorOfArray) = Base.OneTo(length(VA.u))

test/copy_static_array_test.jl

@@ -1,4 +1,4 @@
-using Base.Test, RecursiveArrayTools, StaticArrays
+using Test, RecursiveArrayTools, StaticArrays
 
 struct ImmutableFV <: FieldVector{2,Float64}
     a::Float64

test/interface_tests.jl

@@ -1,4 +1,4 @@
-using RecursiveArrayTools, Base.Test
+using RecursiveArrayTools, Test
 
 recs = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
 testva = VectorOfArray(recs)

test/partitions_test.jl

@@ -1,4 +1,4 @@
-using RecursiveArrayTools, Base.Test
+using RecursiveArrayTools, Test
 A = (rand(5),rand(5))
 p = ArrayPartition(A)
 @test (p.x[1][1],p.x[2][1]) == (p[1],p[6])

test/runtests.jl

@@ -1,5 +1,5 @@
 using RecursiveArrayTools
-using Base.Test
+using Test
 
 tic()
 @time @testset "Utils Tests" begin include("utils_test.jl") end

test/utils_test.jl

@@ -1,7 +1,7 @@
 using RecursiveArrayTools, Unitful, StaticArrays
-using Base.Test
+using Test
 
-t = collect(linspace(0,10,200))
+t = collect(range(0, stop=10, length=200))
 randomized = VectorOfArray([.01randn(2) for i in 1:10])
 data = convert(Array,randomized)
 @test typeof(data) <: Matrix{Float64}