fixes for 0.7

Author: fredrikekre

.travis.yml

@@ -4,17 +4,17 @@ os:
   - linux
   - osx
 julia:
-  - 0.6
+  - 0.7
   - nightly
 notifications:
   email: false
 branches:
   only:
     - master
     - /^v[0-9]+\.[0-9]+\.[0-9]+$/ # version tags for Documenter.jl, see # 298
-matrix:
-  allow_failures:
-    - julia: nightly
+# matrix:
+#   allow_failures:
+#     - julia: nightly
     # - os: osx
 # uncomment the following lines to override the default test script
 #script:

REQUIRE

@@ -1,2 +1 @@
-julia 0.6.0
-Compat 0.66
+julia 0.7-alpha

appveyor.yml

@@ -1,14 +1,14 @@
 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:
-  allow_failures:
-    - 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:
+#   allow_failures:
+#     - 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"
 
 branches:
   only:

docs/src/pages/api.md

@@ -63,7 +63,7 @@ the dimensions of a static array. An array `sa::SA` of size `(dims...)` is
 associated with `Size{(dims...)}()`. The following are equivalent (`@pure`)
 constructors:
 ```julia
-Size{(dims...)}()
+Size{(dims...,)}()
 Size(dims...)
 Size(sa::StaticArray)
 Size(SA) # SA <: StaticArray

perf/benchmark-qr.jl

@@ -1,5 +1,5 @@
 using StaticArrays
-using BenchmarkTools, Compat
+using BenchmarkTools
 
 a = m = 0
 for K = 1:22

perf/benchmark_matrix_ops.jl

@@ -1,7 +1,7 @@
 using StaticArrays, BenchmarkTools, DataFrames, DataStructures
 
 Nmax = 20
-unary = (det, inv, expm)
+unary = (det, inv, exp)
 binary = (\,)
 
 data = OrderedDict{Symbol,Any}()

src/SDiagonal.jl

@@ -85,18 +85,14 @@ eye(::Type{SDiagonal{N,T}}) where {N,T} = SDiagonal(ones(SVector{N,T}))
 one(::Type{SDiagonal{N,T}}) where {N,T} = SDiagonal(ones(SVector{N,T}))
 one(::SDiagonal{N,T}) where {N,T} = SDiagonal(ones(SVector{N,T}))
 Base.zero(::SDiagonal{N,T}) where {N,T} = SDiagonal(zeros(SVector{N,T}))
-if VERSION < v"0.7-"
-    expm(D::SDiagonal) = SDiagonal(exp.(D.diag))
-    logm(D::SDiagonal) = SDiagonal(log.(D.diag))
-    sqrtm(D::SDiagonal) = SDiagonal(sqrt.(D.diag))
-else
-    exp(D::SDiagonal) = SDiagonal(exp.(D.diag))
-    log(D::SDiagonal) = SDiagonal(log.(D.diag))
-    sqrt(D::SDiagonal) = SDiagonal(sqrt.(D.diag))
+exp(D::SDiagonal) = SDiagonal(exp.(D.diag))
+log(D::SDiagonal) = SDiagonal(log.(D.diag))
+sqrt(D::SDiagonal) = SDiagonal(sqrt.(D.diag))
+function LinearAlgebra.cholesky(D::SDiagonal)
+    any(x -> x < 0, D.diag) && throw(LinearAlgebra.PosDefException(1))
+    C = sqrt.(D.diag)
+    return Cholesky(SDiagonal(C), 'U', 0)
 end
-LinearAlgebra.chol(D::SDiagonal) = SDiagonal(chol.(D.diag))
-LinearAlgebra.chol(D::SDiagonal{N, T}) where {N, T <: Number} = SDiagonal(sqrt.(D.diag))
-LinearAlgebra._chol!(D::SDiagonal, ::Type{UpperTriangular}) = chol(D)
 
 \(D::SDiagonal, B::StaticMatrix) = scalem(1 ./ D.diag, B)
 /(B::StaticMatrix, D::SDiagonal) = scalem(1 ./ D.diag, B)

src/StaticArrays.jl

@@ -10,42 +10,17 @@ import Base: getindex, setindex!, size, similar, vec, show, length, convert, pro
              iszero, sum, prod, count, any, all, minimum, maximum, extrema, mean,
              copy, read, read!, write
 
-if VERSION < v"0.7-"
-    using Compat
-
-    using Base.Random
-    import Base: rand, randn, randexp, rand!, randn!, randexp!
-    using Core.Inference.return_type
-
-    import Base.LinAlg: transpose, ctranspose, eye, vecdot, eig, eigvals, eigfact, expm,
-                        logm, sqrtm, lyap, trace, kron, diag, vecnorm, norm, dot, diagm, lu,
-                        svd, svdvals, svdfact, factorize, ishermitian, issymmetric,
-                        isposdef, normalize, normalize!, Eigen, det, logdet, cross, diff, qr
-    const LinearAlgebra = Base.LinAlg
-
-    const TransposeVector{T, V<:AbstractVector{T}} = RowVector{T, V}
-    const AdjointVector{T, V<:AbstractVector{T}} = RowVector{T, ConjVector{T, V}}
-
-    const adjoint = ctranspose
-    const tr = trace
-else
-    using Compat
-
-    using Random
-    import Random: rand, randn, randexp, rand!, randn!, randexp!
-    using Core.Compiler: return_type
-
-    import Base: sqrt, exp, log
-
-    using LinearAlgebra
-    import LinearAlgebra: transpose, adjoint, eye, vecdot, eig, eigvals, eigfact, lyap, tr,
-                          kron, diag, vecnorm, norm, dot, diagm, lu, svd, svdvals, svdfact,
-                          factorize, ishermitian, issymmetric, isposdef, normalize,
-                          normalize!, Eigen, det, logdet, cross, diff, qr
-
-    const TransposeVector{T, V<:AbstractVector{T}} = Transpose{T, V}
-    const AdjointVector{T, V<:AbstractVector{T}} = Adjoint{T, V}
-end
+using Random
+import Random: rand, randn, randexp, rand!, randn!, randexp!
+using Core.Compiler: return_type
+import Base: sqrt, exp, log
+using LinearAlgebra
+import LinearAlgebra: transpose, adjoint, eye, vecdot, eigvals, eigen, lyap, tr,
+                      kron, diag, norm, dot, diagm, lu, svd, svdvals, svdfact,
+                      factorize, ishermitian, issymmetric, isposdef, normalize,
+                      normalize!, Eigen, det, logdet, cross, diff, qr
+const TransposeVector{T, V<:AbstractVector{T}} = Transpose{T, V}
+const AdjointVector{T, V<:AbstractVector{T}} = Adjoint{T, V}
 
 export StaticScalar, StaticArray, StaticVector, StaticMatrix
 export Scalar, SArray, SVector, SMatrix
@@ -60,7 +35,7 @@ export @SVector, @SMatrix, @SArray
 export @MVector, @MMatrix, @MArray
 
 export similar_type
-export push, pop, shift, unshift, insert, deleteat, setindex
+export push, pop, pushfirst, popfirst, insert, deleteat, setindex
 
 const _module_arg = isdefined(Base, Symbol("@__MODULE__"))
 

src/abstractarray.jl

@@ -125,42 +125,9 @@ reshape(a::Array, s::Size{S}) where {S} = s(a)
 
 # TODO permutedims?
 
-# TODO perhaps could move `Symmetric`, etc into seperate files.
-
-# This is used in Base.LinAlg quite a lot, and it impacts type stability
-# since some functions like expm() branch on a check for Hermitian or Symmetric
-# TODO much more work on type stability. Base functions are using similar() with
-# size, which poses difficulties!!
-@inline Base.full(sym::Symmetric{T,SM}) where {T,SM <: StaticMatrix} = _full(Size(SM), sym)
-
-@generated function _full(::Size{S}, sym::Symmetric{T,SM}) where {S, T, SM <: StaticMatrix}
-    exprs_up = [i <= j ? :(m[$(LinearIndices(S)[i, j])]) : :(m[$(LinearIndices(S)[j, i])]) for i = 1:S[1], j=1:S[2]]
-    exprs_lo = [i >= j ? :(m[$(LinearIndices(S)[i, j])]) : :(m[$(LinearIndices(S)[j, i])]) for i = 1:S[1], j=1:S[2]]
-
-    return quote
-        @_inline_meta
-        m = sym.data
-        if sym.uplo == 'U'
-            @inbounds return SM(tuple($(exprs_up...)))
-        else
-            @inbounds return SM(tuple($(exprs_lo...)))
-        end
-    end
-end
-
-@inline Base.full(herm::Hermitian{T,SM}) where {T,SM <: StaticMatrix} = _full(Size(SM), herm)
-
-@generated function _full(::Size{S}, herm::Hermitian{T,SM}) where {S, T, SM <: StaticMatrix}
-    exprs_up = [i <= j ? :(m[$(LinearIndices(S)[i, j])]) : :(conj(m[$(LinearIndices(S)[j, i])])) for i = 1:S[1], j=1:S[2]]
-    exprs_lo = [i >= j ? :(m[$(LinearIndices(S)[i, j])]) : :(conj(m[$(LinearIndices(S)[j, i])])) for i = 1:S[1], j=1:S[2]]
-
-    return quote
-        @_inline_meta
-        m = herm.data
-        if herm.uplo == 'U'
-            @inbounds return SM(tuple($(exprs_up...)))
-        else
-            @inbounds return SM(tuple($(exprs_lo...)))
-        end
-    end
+# full deprecated in Base
+if isdefined(Base, :full)
+    import Base: full
+    @deprecate full(sym::Symmetric{T,SM}) where {T,SM <: StaticMatrix} SMatrix(sym)
+    @deprecate full(herm::Hermitian{T,SM}) where {T,SM <: StaticMatrix} SMatrix(sym)
 end

src/arraymath.jl

@@ -38,13 +38,9 @@ end
 
 # Also consider randcycle, randperm? Also faster rand!(staticarray, collection)
 
-@static if VERSION >= v"0.7.0-DEV.3406"
-    using Random: SamplerType
-    @inline rand(rng::AbstractRNG, ::Type{SA}, dims::Dims) where {SA <: StaticArray} = rand!(rng, Array{SA}(undef, dims), SA)
-    @inline rand(rng::AbstractRNG, ::SamplerType{SA}) where {SA <: StaticArray} = _rand(rng, Size(SA), SA)
-else
-    @inline rand(rng::AbstractRNG, ::Type{SA}) where {SA <: StaticArray} = _rand(rng, Size(SA), SA)
-end
+using Random: SamplerType
+@inline rand(rng::AbstractRNG, ::Type{SA}, dims::Dims) where {SA <: StaticArray} = rand!(rng, Array{SA}(undef, dims), SA)
+@inline rand(rng::AbstractRNG, ::SamplerType{SA}) where {SA <: StaticArray} = _rand(rng, Size(SA), SA)
 
 @generated function _rand(rng::AbstractRNG, ::Size{s}, ::Type{SA}) where {s, SA <: StaticArray}
     T = eltype(SA)