Merge branch 'dl/scalarldiv' of https://github.com/JuliaApproximation/ContinuumArrays.jl into dl/scalarldiv

Author: dlfivefifty

src/bases/bases.jl

@@ -119,6 +119,9 @@ function _broadcast_mul_ldiv(::Tuple{ScalarLayout,Any}, A, B)
     a,b = arguments(B)
     a * (A \ b)
 end
+
+_broadcast_mul_ldiv(::Tuple{ScalarLayout,AbstractBasisLayout}, A, B) =
+    _broadcast_mul_ldiv((ScalarLayout(),UnknownLayout()), A, B)
 _broadcast_mul_ldiv(_, A, B) = copy(Ldiv{typeof(MemoryLayout(A)),UnknownLayout}(A,B))
 
 copy(L::Ldiv{<:AbstractBasisLayout,BroadcastLayout{typeof(*)}}) = _broadcast_mul_ldiv(map(MemoryLayout,arguments(L.B)), L.A, L.B)

test/runtests.jl

@@ -470,6 +470,11 @@ end
     @test_throws BoundsError K[Inclusion(0..0.5), Inclusion(0..0.5)][1,1]
 end
 
+@testset "A \\ ( c .* B) == c .* (A\\B) #101" begin
+    L = LinearSpline(0:5)
+    @test L \ (2L) == 2(L\L)
+end
+
 """
 This is a simple implementation of Chebyshev for testing. Use ClassicalOrthogonalPolynomials
 for the real implementation.