Mercurial > repos > public > sbplib_julia

comparison LazyTensors/test/runtests.jl @ 237:1c6afdcfd657 boundary_conditions

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Regretsies on the CartesianIndex stuff. Use Vararg instead
author Jonatan Werpers <jonatan@werpers.com>
date Wed, 26 Jun 2019 19:51:36 +0200
parents 856caf960d89
children d4cd4882ee9f
comparison
equal deleted inserted replaced
236:856caf960d89 237:1c6afdcfd657
1 using Test 1 using Test
2 using LazyTensors 2 using LazyTensors
3 3
4 @testset "Generic Mapping methods" begin 4 @testset "Generic Mapping methods" begin
5 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end 5 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end
6 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i::CartesianIndex{R}) where {T,R,D} = :apply 6 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i::NTuple{R,Int}) where {T,R,D} = :apply
7 @test range_dim(DummyMapping{Int,2,3}()) == 2 7 @test range_dim(DummyMapping{Int,2,3}()) == 2
8 @test domain_dim(DummyMapping{Int,2,3}()) == 3 8 @test domain_dim(DummyMapping{Int,2,3}()) == 3
9 @test apply(DummyMapping{Int,2,3}(), zeros(Int, (0,0,0)),CartesianIndex(0,0)) == :apply 9 @test apply(DummyMapping{Int,2,3}(), zeros(Int, (0,0,0)),(0,0)) == :apply
10 end 10 end
11 11
12 @testset "Generic Operator methods" begin 12 @testset "Generic Operator methods" begin
13 struct DummyOperator{T,D} <: TensorOperator{T,D} end 13 struct DummyOperator{T,D} <: TensorOperator{T,D} end
14 @test range_size(DummyOperator{Int,2}(), (3,5)) == (3,5) 14 @test range_size(DummyOperator{Int,2}(), (3,5)) == (3,5)
16 end 16 end
17 17
18 @testset "Mapping transpose" begin 18 @testset "Mapping transpose" begin
19 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end 19 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end
20 20
21 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i::CartesianIndex{R}) where {T,R,D} = :apply 21 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i::NTuple{R,Int}) where {T,R,D} = :apply
22 LazyTensors.apply_transpose(m::DummyMapping{T,R,D}, v, i::CartesianIndex{D}) where {T,R,D} = :apply_transpose 22 LazyTensors.apply_transpose(m::DummyMapping{T,R,D}, v, i::NTuple{D,Int}) where {T,R,D} = :apply_transpose
23 23
24 LazyTensors.range_size(m::DummyMapping{T,R,D}, domain_size::NTuple{D,Integer}) where {T,R,D} = :range_size 24 LazyTensors.range_size(m::DummyMapping{T,R,D}, domain_size::NTuple{D,Integer}) where {T,R,D} = :range_size
25 LazyTensors.domain_size(m::DummyMapping{T,R,D}, range_size::NTuple{R,Integer}) where {T,R,D} = :domain_size 25 LazyTensors.domain_size(m::DummyMapping{T,R,D}, range_size::NTuple{R,Integer}) where {T,R,D} = :domain_size
26 26
27 m = DummyMapping{Float64,2,3}() 27 m = DummyMapping{Float64,2,3}()
28 @test m' isa TensorMapping{Float64, 3,2} 28 @test m' isa TensorMapping{Float64, 3,2}
29 @test m'' == m 29 @test m'' == m
30 @test apply(m',zeros(Float64,(0,0)),CartesianIndex(0,0,0)) == :apply_transpose 30 @test apply(m',zeros(Float64,(0,0)), (0,0,0)) == :apply_transpose
31 @test apply(m'',zeros(Float64,(0,0,0)),CartesianIndex(0,0)) == :apply 31 @test apply(m'',zeros(Float64,(0,0,0)),(0,0)) == :apply
32 @test apply_transpose(m', zeros(Float64,(0,0,0)),CartesianIndex(0,0)) == :apply 32 @test apply_transpose(m', zeros(Float64,(0,0,0)),(0,0)) == :apply
33 33
34 @test range_size(m', (0,0)) == :domain_size 34 @test range_size(m', (0,0)) == :domain_size
35 @test domain_size(m', (0,0,0)) == :range_size 35 @test domain_size(m', (0,0,0)) == :range_size
36 end 36 end
37 37
38 @testset "TensorApplication" begin 38 @testset "TensorApplication" begin
39 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end 39 struct DummyMapping{T,R,D} <: TensorMapping{T,R,D} end
40 40
41 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i) where {T,R,D} = (:apply,v,i) 41 LazyTensors.apply(m::DummyMapping{T,R,D}, v, i::NTuple{R,Int}) where {T,R,D} = (:apply,v,i)
42 LazyTensors.apply_transpose(m::DummyMapping{T,R,D}, v, i) where {T,R,D} = :apply_transpose 42 LazyTensors.apply_transpose(m::DummyMapping{T,R,D}, v, i::NTuple{D,Int}) where {T,R,D} = :apply_transpose
43 43
44 LazyTensors.range_size(m::DummyMapping{T,R,D}, domain_size::NTuple{D,Integer}) where {T,R,D} = 2 .* domain_size 44 LazyTensors.range_size(m::DummyMapping{T,R,D}, domain_size::NTuple{D,Integer}) where {T,R,D} = 2 .* domain_size
45 LazyTensors.domain_size(m::DummyMapping{T,R,D}, range_size::NTuple{R,Integer}) where {T,R,D} = range_size.÷2 45 LazyTensors.domain_size(m::DummyMapping{T,R,D}, range_size::NTuple{R,Integer}) where {T,R,D} = range_size.÷2
46 46
47 47
48 m = DummyMapping{Int, 1, 1}() 48 m = DummyMapping{Int, 1, 1}()
49 v = [0,1,2] 49 v = [0,1,2]
50 @test m*v isa AbstractVector{Int} 50 @test m*v isa AbstractVector{Int}
51 @test size(m*v) == 2 .*size(v) 51 @test size(m*v) == 2 .*size(v)
52 @test (m*v)[0] == (:apply,v,0) 52 @test (m*v)[0] == (:apply,v,(0,))
53 @test m*m*v isa AbstractVector{Int} 53 @test m*m*v isa AbstractVector{Int}
54 @test (m*m*v)[1] == (:apply,m*v,1) 54 @test (m*m*v)[1] == (:apply,m*v,(1,))
55 @test (m*m*v)[3] == (:apply,m*v,3) 55 @test (m*m*v)[3] == (:apply,m*v,(3,))
56 @test (m*m*v)[6] == (:apply,m*v,6) 56 @test (m*m*v)[6] == (:apply,m*v,(6,))
57 @test_broken BoundsError == (m*m*v)[0] 57 @test_broken BoundsError == (m*m*v)[0]
58 @test_broken BoundsError == (m*m*v)[7] 58 @test_broken BoundsError == (m*m*v)[7]
59 end 59 end
60 60
61 @testset "TensorMapping binary operations" begin 61 @testset "TensorMapping binary operations" begin
87 @testset "LazyArray" begin 87 @testset "LazyArray" begin
88 struct DummyArray{T,D, T1<:AbstractArray{T,D}} <: LazyArray{T,D} 88 struct DummyArray{T,D, T1<:AbstractArray{T,D}} <: LazyArray{T,D}
89 data::T1 89 data::T1
90 end 90 end
91 Base.size(v::DummyArray) = size(v.data) 91 Base.size(v::DummyArray) = size(v.data)
92 Base.getindex(v::DummyArray, I...) = v.data[I...] 92 Base.getindex(v::DummyArray{T,D}, I::Vararg{Int,D}) where {T,D} = v.data[I...]
93 93
94 # Test lazy operations 94 # Test lazy operations
95 v1 = [1, 2.3, 4] 95 v1 = [1, 2.3, 4]
96 v2 = [1., 2, 3] 96 v2 = [1., 2, 3]
97 r_add = v1 .+ v2 97 r_add = v1 .+ v2