affine setdiff

Author: dlfivefifty

README.md

@@ -10,4 +10,4 @@ Support for orthogonal polynomial-based spaces in ApproxFun
 
 
 
-[ApproxFun.jl](https://github.com/JuliaApproximation/ApproxFun.jl) is a package for approximating functions. This package implements Fourier based spaces to ApproxFun. 
+[ApproxFun.jl](https://github.com/JuliaApproximation/ApproxFun.jl) is a package for approximating functions. This package implements orthogonal polynomial based spaces to ApproxFun, including Chebyshev, Jacobi, 

REQUIRE

@@ -3,15 +3,14 @@ Reexport v0.2.0
 ApproxFunBase
 FastGaussQuadrature 0.3.2
 FastTransforms 0.4.2
-RecipesBase 0.5
 DualNumbers 0.4
 ToeplitzMatrices 0.4
 Calculus 0.1.15
 DomainSets 0.0.1
 IntervalSets 0.3.1
 StaticArrays 0.8.3
 BlockArrays 0.8
-BlockBandedMatrices 0.3.5
+BlockBandedMatrices 0.4
 BandedMatrices 0.9
 AbstractFFTs 0.3.1
 FFTW 0.2.4

src/ApproxFunOrthogonalPolynomials.jl

@@ -34,7 +34,7 @@ import ApproxFunBase: normalize!, flipsign, FiniteRange, Fun, MatrixFun, UnsetSp
                     Segment, IntervalOrSegmentDomain, PiecewiseSegment, isambiguous, Vec, eps, isperiodic,
                     arclength, complexlength,
                     invfromcanonicalD, fromcanonical, tocanonical, fromcanonicalD, tocanonicalD, canonicaldomain, setcanonicaldomain, mappoint,
-                    reverseorientation, checkpoints, evaluate, mul_coefficients, coefficients, isconvertible,
+                    reverseorientation, checkpoints, evaluate, extrapolate, mul_coefficients, coefficients, isconvertible,
                     clenshaw, ClenshawPlan, sineshaw,
                     toeplitz_getindex, toeplitz_axpy!, sym_toeplitz_axpy!, hankel_axpy!, ToeplitzOperator, SymToeplitzOperator, hankel_getindex, 
                     SpaceOperator, ZeroOperator, InterlaceOperator,
@@ -43,7 +43,7 @@ import ApproxFunBase: normalize!, flipsign, FiniteRange, Fun, MatrixFun, UnsetSp
                     chebmult_getindex, intpow, alternatingsum,
                     domaintype, diagindshift, rangetype, weight, isapproxinteger, default_Dirichlet, scal!, dotu,
                     components, promoterangespace, promotedomainspace,
-                    block, blockstart, blockstop, blocklengths, isblockbanded, pointscompatible
+                    block, blockstart, blockstop, blocklengths, isblockbanded, pointscompatible, affine_setdiff, complexroots
 
 import DomainSets: Domain, indomain, UnionDomain, ProductDomain, FullSpace, Point, elements, DifferenceDomain,
             Interval, ChebyshevInterval, boundary, ∂, rightendpoint, leftendpoint,

src/Domains/Domains.jl

@@ -10,28 +10,6 @@ isless(d2::Ray{true,T2},d1::IntervalOrSegment{T1}) where {T1<:Real,T2<:Real} = d
 
 
 ## set minus
-function Base.setdiff(d::Union{AbstractInterval,Segment,Ray,Line}, ptsin::UnionDomain{AS}) where {AS <: AbstractVector{P}} where {P <: Point}
-    pts=Number.(elements(ptsin))
-    isempty(pts) && return d
-    tol=sqrt(eps(arclength(d)))
-    da=leftendpoint(d)
-    isapprox(da,pts[1];atol=tol) && popfirst!(pts)
-    isempty(pts) && return d
-    db=rightendpoint(d)
-    isapprox(db,pts[end];atol=tol) && pop!(pts)
+Base.setdiff(d::Union{AbstractInterval,Segment,Ray,Line}, ptsin::UnionDomain{AS}) where {AS <: AbstractVector{P}} where {P <: Point} =
+    affine_setdiff(d, ptsin)
 
-    sort!(pts)
-    leftendpoint(d) > rightendpoint(d) && reverse!(pts)
-    filter!(p->p ∈ d,pts)
-
-    isempty(pts) && return d
-    length(pts) == 1 && return d \ pts[1]
-
-    ret = Array{Domain}(undef, length(pts)+1)
-    ret[1] = Domain(leftendpoint(d) .. pts[1])
-    for k = 2:length(pts)
-        ret[k] = Domain(pts[k-1]..pts[k])
-    end
-    ret[end] = Domain(pts[end] .. rightendpoint(d))
-    UnionDomain(ret)
-end

src/Spaces/Singularities/LogWeight.jl

@@ -1,3 +1,5 @@
+export LogWeight
+
 """
     LogWeight(β,α,s::Space)