Add a few benchmarks (#116)

Author: dkarrasch

test/functionmap.jl

@@ -62,6 +62,7 @@ using Test, LinearMaps, LinearAlgebra, BenchmarkTools
     @test_throws ErrorException mul!(similar(v), CS!', v)
     @test_throws ErrorException mul!(similar(v), transpose(CS!), v)
     CS! = LinearMap{ComplexF64}(cumsum!, (y, x) -> (copyto!(y, x); reverse!(y); cumsum!(y, y); reverse!(y)), 10; ismutating=true)
+    M = Matrix(CS!)
     @inferred adjoint(CS!)
     @test @inferred LinearMaps.ismutating(CS!)
     @test @inferred CS! * v == cv
@@ -75,6 +76,19 @@ using Test, LinearMaps, LinearAlgebra, BenchmarkTools
     @test run(b, samples=3).allocs == 0
     b = @benchmarkable mul!($u, $(3*CS!'), $v)
     @test run(b, samples=3).allocs == 0
+    u = rand(ComplexF64, 10)
+    v = rand(ComplexF64, 10)
+    for α in (false, true, rand(ComplexF64)), β in (false, true, rand(ComplexF64))
+        for transform in (identity, adjoint, transpose)
+            @test mul!(copy(v), transform(CS!), u, α, β) ≈ transform(M)*u*α + v*β
+            @test mul!(copy(v), transform(LinearMap(CS!)), u, α, β) ≈ transform(M)*u*α + v*β
+            @test mul!(copy(v), LinearMap(transform(CS!)), u, α, β) ≈ transform(M)*u*α + v*β
+            if transform != transpose
+                bm = @benchmarkable mul!($(copy(v)), $(transform(CS!)), $u, $α, $β)
+                @test run(bm, samples=3).allocs <= 1
+            end
+        end
+    end
 
     # Test fallback methods:
     L = @inferred LinearMap(x -> x, x -> x, 10)

test/linearcombination.jl

@@ -1,15 +1,17 @@
-using Test, LinearMaps, LinearAlgebra, BenchmarkTools
+using Test, LinearMaps, LinearAlgebra, SparseArrays, BenchmarkTools
 
 @testset "linear combinations" begin
     CS! = LinearMap{ComplexF64}(cumsum!,
-                                (y, x) -> (copyto!(y, x); reverse!(y); cumsum!(y, y)), 10;
+                                (y, x) -> (copyto!(y, x); reverse!(cumsum!(y, reverse!(y)))), 10;
                                 ismutating=true)
     v = rand(ComplexF64, 10)
     u = similar(v)
     b = @benchmarkable mul!($u, $CS!, $v)
     @test run(b, samples=3).allocs == 0
     n = 10
     L = sum(fill(CS!, n))
+    M = Matrix(L)
+    @test M == LowerTriangular(fill(n, size(L)))
     @test_throws AssertionError LinearMaps.LinearCombination{Float64}((CS!, CS!))
     @test occursin("10×10 LinearMaps.LinearCombination{$(eltype(L))}", sprint((t, s) -> show(t, "text/plain", s), L))
     @test occursin("10×10 LinearMaps.LinearCombination{$(eltype(L))}", sprint((t, s) -> show(t, "text/plain", s), L+CS!))
@@ -18,7 +20,9 @@ using Test, LinearMaps, LinearAlgebra, BenchmarkTools
     b = @benchmarkable mul!($u, $L, $v, 2, 2)
     @test run(b, samples=5).allocs <= 1
     for α in (false, true, rand(ComplexF64)), β in (false, true, rand(ComplexF64))
-        @test mul!(copy(u), L, v, α, β) ≈ Matrix(L)*v*α + u*β
+        for transform in (identity, adjoint, transpose)
+            @test mul!(copy(u), transform(L), v, α, β) ≈ transform(M)*v*α + u*β
+        end
     end
     V = rand(ComplexF64, 10, 3)
     U = similar(V)

test/runtests.jl

@@ -3,7 +3,7 @@ import LinearMaps: FiveArg, ThreeArg
 
 const matrixstyle = VERSION ≥ v"1.3.0-alpha.115" ? FiveArg() : ThreeArg()
 
-const testallocs = true
+const testallocs = VERSION ≥ v"1.4-"
 
 include("linearmaps.jl")
 

test/uniformscalingmap.jl

@@ -27,10 +27,10 @@ using Test, LinearMaps, LinearAlgebra, BenchmarkTools
     @test (3 * I - 2 * M') * v == -2 * A'v + 3v
     @test transpose(LinearMap(2 * M' + 3 * I)) * v ≈ transpose(2 * A' + 3 * I) * v
     @test LinearMap(2 * M' + 0I)' * v ≈ (2 * A')' * v
-    for λ in (0, 1, rand()), α in (0, 1, rand()), β in (0, 1, rand())
+    for λ in (0, 1, rand()), α in (0, 1, rand()), β in (0, 1, rand()), sz in (10, (10,5))
         Λ = @inferred LinearMap(λ*I, 10)
-        x = rand(10)
-        y = rand(10)
+        x = rand(Float64, sz)
+        y = rand(Float64, sz)
         if testallocs
             b = @benchmarkable mul!($y, $Λ, $x, $α, $β)
             @test run(b, samples=3).allocs == 0