Finish Julia v0.7

Author: dlfivefifty

REQUIRE

@@ -7,3 +7,4 @@ FastGaussQuadrature 0.3
 RecipesBase 0.5.0
 FastTransforms 0.4.1
 StaticArrays 0.3
+SpecialFunctions 0.6

src/DiskSpace.jl

@@ -4,7 +4,7 @@ export DiskSpace
 
 
 
-struct DiskSpace{m,a,b,JS,S} <: AbstractProductSpace{Tuple{JS,S},Complex128,2}
+struct DiskSpace{m,a,b,JS,S} <: AbstractProductSpace{Tuple{JS,S},ComplexF64,2}
     domain::Disk
     spacet::S
     DiskSpace(d,sp)=new(d,sp)

src/MultivariateOrthogonalPolynomials.jl

@@ -3,7 +3,7 @@ __precompile__()
 module MultivariateOrthogonalPolynomials
 using Base, RecipesBase, ApproxFun, BandedMatrices, BlockArrays,
     FastTransforms, FastGaussQuadrature, StaticArrays, FillArrays,
-    Libdl
+    Libdl, SpecialFunctions
 
 # package code goes here
 import Base: values,getindex,setindex!,*,.*,+,.+,-,.-,==,<,<=,>,
@@ -40,7 +40,7 @@ import ApproxFun: PolynomialSpace, ConstantSpace, NoSpace, prectype,
                     isambiguous, fromcanonical, tocanonical, checkpoints, ∂, spacescompatible,
                     mappoint, UnivariateSpace, setdomain, setcanonicaldomain, canonicaldomain,
                     Space, points, space, conversion_rule, maxspace_rule,
-                    union_rule, coefficients, RealUnivariateSpace, PiecewiseSegment, rangetype
+                    union_rule, coefficients, RealUnivariateSpace, PiecewiseSegment, rangetype, cfstype
 
 # Multivariate import
 import ApproxFun: BivariateDomain,DirectSumSpace, AbstractProductSpace, factor,

src/Triangle.jl

@@ -135,7 +135,7 @@ DuffyTriangle(S::KoornwinderTriangle) = DuffyTriangle(Chebyshev(0..1)*Jacobi(S.
 
 function points(S::DuffyTriangle, N)
     pts = points(S.space, N)
-    fromcanonical.(S.domain, iduffy.(pts))
+    fromcanonical.(Ref(S.domain), iduffy.(pts))
 end
 
 plan_transform(S::DuffyTriangle, n::AbstractVector) = TransformPlan(S, plan_transform(S.space,n), Val{false})
@@ -195,7 +195,7 @@ end
 
 function trivec(F̌)
     N = size(F̌,1)
-    v = Array{eltype(F̌)}(N*(N+1) ÷2)
+    v = Array{eltype(F̌)}(undef, N*(N+1) ÷2)
     j = 1
     for n=0:N-1, k=0:n
         v[j] = F̌[n-k+1,k+1]
@@ -424,7 +424,7 @@ end
 # TODO: replace with RaggedMatrix
 function totree(S,f::Fun)
     N=block(S,ncoefficients(f))
-    ret = Array{Vector{eltype(f)}}(Int(N))
+    ret = Array{Vector{cfstype(f)}}(undef,Int(N))
     for K=Block(1):N
         ret[Int(K)]=coefficient(f,K)
     end
@@ -552,8 +552,8 @@ function Base.convert(::Type{BandedBlockBandedMatrix},
     D = parent(S)
     sp=domainspace(D)
     α,β,γ = sp.α,sp.β,sp.γ
-    K_sh = first(parentindexes(S)[1])-1
-    J_sh = first(parentindexes(S)[2])-1
+    K_sh = first(parentindices(S)[1])-1
+    J_sh = first(parentindices(S)[2])-1
     N,M=nblocks(ret)::Tuple{Int,Int}
 
     if D.order == [1,0]
@@ -715,8 +715,8 @@ function Base.convert(::Type{BandedBlockBandedMatrix},S::SubOperator{T,ConcreteC
     K1=domainspace(parent(S))
     K2=rangespace(parent(S))
     α,β,γ = K1.α,K1.β,K1.γ
-    K_sh = first(parentindexes(S)[1])-1
-    J_sh = first(parentindexes(S)[2])-1
+    K_sh = first(parentindices(S)[1])-1
+    J_sh = first(parentindices(S)[2])-1
     N,M=nblocks(ret)::Tuple{Int,Int}
 
     if K2.α == α+1 && K2.β == β && K2.γ == γ
@@ -855,8 +855,8 @@ struct Lowering{k,S,T} <: Operator{T}
     space::S
 end
 
-Base.convert(::Type{Lowering{k}},sp) where k = Lowering{k,typeof(sp),prectype(sp)}(sp)
-Base.convert(::Type{Operator{T}},J::Lowering{x,S}) where {x,T,S} = Lowering{x,S,T}(J.space)
+Lowering{k}(sp) where k = Lowering{k,typeof(sp),prectype(sp)}(sp)
+Base.convert(::Type{Operator{T}}, J::Lowering{x,S}) where {x,T,S} = Lowering{x,S,T}(J.space)
 
 
 domainspace(R::Lowering) = R.space
@@ -951,8 +951,8 @@ function Base.convert(::Type{BandedBlockBandedMatrix},S::SubOperator{T,Lowering{
     ret = BandedBlockBandedMatrix(Zeros, S)
     R = parent(S)
     α,β,γ=R.space.α,R.space.β,R.space.γ
-    K_sh = first(parentindexes(S)[1])-1
-    J_sh = first(parentindexes(S)[2])-1
+    K_sh = first(parentindices(S)[1])-1
+    J_sh = first(parentindices(S)[2])-1
     N,M=nblocks(ret)::Tuple{Int,Int}
 
     for KK=Block.(1:N)
@@ -984,8 +984,8 @@ function Base.convert(::Type{BandedBlockBandedMatrix},S::SubOperator{T,Lowering{
     ret = BandedBlockBandedMatrix(Zeros,S)
     R = parent(S)
     α,β,γ=R.space.α,R.space.β,R.space.γ
-    K_sh = first(parentindexes(S)[1])-1
-    J_sh = first(parentindexes(S)[2])-1
+    K_sh = first(parentindices(S)[1])-1
+    J_sh = first(parentindices(S)[2])-1
     N,M = nblocks(ret)::Tuple{Int,Int}
 
 
@@ -1022,8 +1022,8 @@ function Base.convert(::Type{BandedBlockBandedMatrix},S::SubOperator{T,Lowering{
     ret = BandedBlockBandedMatrix(Zeros,S)
     R = parent(S)
     α,β,γ=R.space.α,R.space.β,R.space.γ
-    K_sh = first(parentindexes(S)[1])-1
-    J_sh = first(parentindexes(S)[2])-1
+    K_sh = first(parentindices(S)[1])-1
+    J_sh = first(parentindices(S)[2])-1
     N,M=nblocks(ret)::Tuple{Int,Int}
 
     for KK=Block.(1:N)

src/c_tri2cheb.jl

@@ -1,20 +1,25 @@
-const libfasttransforms = "/Users/solver/Projects/FastTransforms/libfasttransforms"
+const libfasttransforms = homedir() * "/Projects/FastTransforms/libfasttransforms"
 
 struct ft_plan_struct end
 const PlanPtr = Ptr{ft_plan_struct}
 
+function c_plan_tri2cheb end
+function c_tri2cheb end
+function c_cheb2tri end
 
 if Libdl.find_library(libfasttransforms) ≡ libfasttransforms
     c_plan_sph2fourier(n::Int) = ccall((:plan_sph2fourier, libfasttransforms), PlanPtr, (Int64, ), n)
-    fc_sph2fourier(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_sph2fourier, libfasttransforms), Void, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
+    fc_sph2fourier(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_sph2fourier, libfasttransforms), Nothing, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
 
     c_plan_rottriangle(n::Int, α::Float64, β::Float64, γ::Float64) = ccall((:plan_rottriangle, libfasttransforms), PlanPtr, (Int64, Float64, Float64, Float64), n, α, β, γ)
-    c_execute_tri_hi2lo(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri_hi2lo, libfasttransforms), Void, (PlanPtr, Ptr{Float64}, Int64), P, A, size(A, 2))
-    c_execute_tri_lo2hi(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri_lo2hi, libfasttransforms), Void, (PlanPtr, Ptr{Float64}, Int64), P, A, size(A, 2))
+    c_execute_tri_hi2lo(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri_hi2lo, libfasttransforms), Nothing, (PlanPtr, Ptr{Float64}, Int64), P, A, size(A, 2))
+    c_execute_tri_lo2hi(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri_lo2hi, libfasttransforms), Nothing, (PlanPtr, Ptr{Float64}, Int64), P, A, size(A, 2))
 
     c_plan_tri2cheb(n::Int, α::Float64, β::Float64, γ::Float64) = ccall((:plan_tri2cheb, libfasttransforms), PlanPtr, (Int64, Float64, Float64, Float64), n, α, β, γ)
-    c_tri2cheb(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri2cheb, libfasttransforms), Void, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
-    c_cheb2tri(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_cheb2tri, libfasttransforms), Void, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
+    c_tri2cheb(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_tri2cheb, libfasttransforms), Nothing, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
+    c_cheb2tri(P::PlanPtr, A::Matrix{Float64}) = ccall((:execute_cheb2tri, libfasttransforms), Nothing, (PlanPtr, Ptr{Float64}, Int64, Int64), P, A, size(A, 1), size(A, 2))
+else
+    warn("Cannot load FastTransforms Dylib")
 end
 
 struct CTri2ChebPlan