Mercurial > repos > public > sbplib_julia
annotate src/LazyTensors/lazy_array.jl @ 371:241bd2512c20 feature/lazy_function
Add a LazyFunctionArray that evaluates a function for each index.
author | Jonatan Werpers <jonatan@werpers.com> |
---|---|
date | Wed, 30 Sep 2020 19:48:17 +0200 |
parents | 01b851161018 |
children | 33c360c3c6bc |
rev | line source |
---|---|
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
1 """ |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
2 LazyArray{T,D} <: AbstractArray{T,D} |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
3 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
4 Array which is calcualted lazily when indexing. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
5 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
6 A subtype of `LazyArray` will use lazy version of `+`, `-`, `*`, `/`. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
7 """ |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
8 abstract type LazyArray{T,D} <: AbstractArray{T,D} end |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
9 export LazyArray |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
10 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
11 struct LazyConstantArray{T,D} <: LazyArray{T,D} |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
12 val::T |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
13 size::NTuple{D,Int} |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
14 end |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
15 |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
16 Base.size(lca::LazyConstantArray) = lca.size |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
17 Base.getindex(lca::LazyConstantArray{T,D}, I::Vararg{Int,D}) where {T,D} = lca.val |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
18 |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
19 """ |
371
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
20 LazyFunctionArray{F<:Function,T, D} <: LazyArray{T,D} |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
21 |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
22 A lazy array where each element is defined by a function f(i,j,...) |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
23 """ |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
24 struct LazyFunctionArray{F<:Function,T, D} <: LazyArray{T,D} |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
25 f::F |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
26 size::NTuple{D,Int} |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
27 end |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
28 export LazyFunctionArray |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
29 |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
30 function LazyFunctionArray(f::F, size::NTuple{D,Int}) where {F<:Function,D} |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
31 T = typeof(f(ones(D)...)) |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
32 return LazyFunctionArray{F,T,D}(f,size) |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
33 end |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
34 |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
35 Base.size(lfa::LazyFunctionArray) = lfa.size |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
36 function Base.getindex(lfa::LazyFunctionArray{F,T,D}, I::Vararg{Int,D}) where {F,T,D} |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
37 @boundscheck checkbounds(lfa, I...) |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
38 return lfa.f(I...) |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
39 end |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
40 |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
41 |
241bd2512c20
Add a LazyFunctionArray that evaluates a function for each index.
Jonatan Werpers <jonatan@werpers.com>
parents:
333
diff
changeset
|
42 """ |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
43 LazyElementwiseOperation{T,D,Op} <: LazyArray{T,D} |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
44 Struct allowing for lazy evaluation of elementwise operations on AbstractArrays. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
45 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
46 A LazyElementwiseOperation contains two arrays together with an operation. |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
47 The operations are carried out when the LazyElementwiseOperation is indexed. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
48 """ |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
49 struct LazyElementwiseOperation{T,D,Op} <: LazyArray{T,D} |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
50 a::AbstractArray{T,D} |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
51 b::AbstractArray{T,D} |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
52 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
53 function LazyElementwiseOperation{T,D,Op}(a::AbstractArray{T,D},b::AbstractArray{T,D}) where {T,D,Op} |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
54 @boundscheck if size(a) != size(b) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
55 throw(DimensionMismatch("dimensions must match")) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
56 end |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
57 return new{T,D,Op}(a,b) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
58 end |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
59 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
60 LazyElementwiseOperation{T,D,Op}(a::AbstractArray{T,D},b::T) where {T,D,Op} = new{T,D,Op}(a, LazyConstantArray(b, size(a))) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
61 LazyElementwiseOperation{T,D,Op}(a::T,b::AbstractArray{T,D}) where {T,D,Op} = new{T,D,Op}(LazyConstantArray(a, size(b)), b) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
62 end |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
63 # TODO: Move Op to be the first parameter? Compare to Binary operations |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
64 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
65 Base.size(v::LazyElementwiseOperation) = size(v.a) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
66 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
67 evaluate(leo::LazyElementwiseOperation{T,D,:+}, I::Vararg{Int,D}) where {T,D} = leo.a[I...] + leo.b[I...] |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
68 evaluate(leo::LazyElementwiseOperation{T,D,:-}, I::Vararg{Int,D}) where {T,D} = leo.a[I...] - leo.b[I...] |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
69 evaluate(leo::LazyElementwiseOperation{T,D,:*}, I::Vararg{Int,D}) where {T,D} = leo.a[I...] * leo.b[I...] |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
70 evaluate(leo::LazyElementwiseOperation{T,D,:/}, I::Vararg{Int,D}) where {T,D} = leo.a[I...] / leo.b[I...] |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
71 |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
72 # TODO: Make sure boundschecking is done properly and that the lenght of the vectors are equal |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
73 # NOTE: Boundschecking in getindex functions now assumes that the size of the |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
74 # vectors in the LazyElementwiseOperation are the same size. If we remove the |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
75 # size assertion in the constructor we might have to handle |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
76 # boundschecking differently. |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
77 Base.@propagate_inbounds @inline function Base.getindex(leo::LazyElementwiseOperation{T,D}, I::Vararg{Int,D}) where {T,D} |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
78 @boundscheck if !checkbounds(Bool, leo.a, I...) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
79 throw(BoundsError([leo], I...)) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
80 end |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
81 return evaluate(leo, I...) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
82 end |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
83 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
84 # Define lazy operations for AbstractArrays. Operations constructs a LazyElementwiseOperation which |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
85 # can later be indexed into. Lazy operations are denoted by the usual operator followed by a tilde |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
86 Base.@propagate_inbounds +̃(a::AbstractArray{T,D}, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:+}(a,b) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
87 Base.@propagate_inbounds -̃(a::AbstractArray{T,D}, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:-}(a,b) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
88 Base.@propagate_inbounds *̃(a::AbstractArray{T,D}, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:*}(a,b) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
89 Base.@propagate_inbounds /̃(a::AbstractArray{T,D}, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:/}(a,b) |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
90 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
91 Base.@propagate_inbounds +̃(a::AbstractArray{T,D}, b::T) where {T,D} = LazyElementwiseOperation{T,D,:+}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
92 Base.@propagate_inbounds -̃(a::AbstractArray{T,D}, b::T) where {T,D} = LazyElementwiseOperation{T,D,:-}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
93 Base.@propagate_inbounds *̃(a::AbstractArray{T,D}, b::T) where {T,D} = LazyElementwiseOperation{T,D,:*}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
94 Base.@propagate_inbounds /̃(a::AbstractArray{T,D}, b::T) where {T,D} = LazyElementwiseOperation{T,D,:/}(a,b) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
95 |
325
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
96 Base.@propagate_inbounds +̃(a::T, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:+}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
97 Base.@propagate_inbounds -̃(a::T, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:-}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
98 Base.@propagate_inbounds *̃(a::T, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:*}(a,b) |
41c3c25e4e3b
LazyTensors: Simplify the LazyElementwiseOperation type by restricting it and introducing a LazyConstantArray to handle scalars.
Jonatan Werpers <jonatan@werpers.com>
parents:
267
diff
changeset
|
99 Base.@propagate_inbounds /̃(a::T, b::AbstractArray{T,D}) where {T,D} = LazyElementwiseOperation{T,D,:/}(a,b) |
267
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
100 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
101 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
102 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
103 # NOTE: Är det knas att vi har till exempel * istället för .* ?? |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
104 # Oklart om det ens går att lösa.. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
105 Base.@propagate_inbounds Base.:+(a::LazyArray{T,D}, b::LazyArray{T,D}) where {T,D} = a +̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
106 Base.@propagate_inbounds Base.:+(a::LazyArray{T,D}, b::AbstractArray{T,D}) where {T,D} = a +̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
107 Base.@propagate_inbounds Base.:+(a::AbstractArray{T,D}, b::LazyArray{T,D}) where {T,D} = a +̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
108 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
109 Base.@propagate_inbounds Base.:-(a::LazyArray{T,D}, b::LazyArray{T,D}) where {T,D} = a -̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
110 Base.@propagate_inbounds Base.:-(a::LazyArray{T,D}, b::AbstractArray{T,D}) where {T,D} = a -̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
111 Base.@propagate_inbounds Base.:-(a::AbstractArray{T,D}, b::LazyArray{T,D}) where {T,D} = a -̃ b |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
112 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
113 # Element wise operation for `*` and `\` are not overloaded due to conflicts with the behavior |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
114 # of regular `*` and `/` for AbstractArrays. Use tilde versions instead. |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
115 |
634453a4e1d8
Restructure code in LazyTensors
Vidar Stiernström <vidar.stiernstrom@it.uu.se>
parents:
diff
changeset
|
116 export +̃, -̃, *̃, /̃ |