Fix adaptivetransform with maps

Author: dlfivefifty

Project.toml

@@ -1,6 +1,6 @@
 name = "ContinuumArrays"
 uuid = "7ae1f121-cc2c-504b-ac30-9b923412ae5c"
-version = "0.4.0"
+version = "0.4.1"
 
 [deps]
 ArrayLayouts = "4c555306-a7a7-4459-81d9-ec55ddd5c99a"

src/ContinuumArrays.jl

@@ -130,6 +130,11 @@ end
     findall(isequal(invmap(d)[f.x]), union(d))
 end
 
+function Base.getindex(d::Map, x::Inclusion)
+    x == axes(d,1) || throw(BoundsError(d, x))
+    d
+end
+
 # Affine map represents A*x .+ b
 abstract type AbstractAffineQuasiVector{T,AA,X,B} <: Map{T} end
 

test/runtests.jl

@@ -488,8 +488,6 @@ end
 This is a simple implementation of Chebyshev for testing. Use OrthogonalPolynomialsQuasi
 for the real implementation.
 """
-
-
 struct Chebyshev <: Basis{Float64}
     n::Int
 end
@@ -571,9 +569,12 @@ ContinuumArrays.invmap(::InvQuadraticMap{T}) where T = QuadraticMap{T}()
             @test m[findlast(isequal(0.1), m)] ≈ 0.1
             @test m[findall(isequal(0.1), m)] ≈ [0.1]
 
+            @test m[Inclusion(0..1)] ≡ m
+            @test_throws BoundsError m[Inclusion(-1..1)]
             T = Chebyshev(5)
             M = T[m,:]
             @test MemoryLayout(M) isa MappedBasisLayout
+            @test MemoryLayout(M[:,1:3]) isa MappedBasisLayout
             @test M[0.1,:] ≈ T[2*0.1^2-1,:]
             x = axes(M,1)
             @test x == Inclusion(0..1)