-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathBinaryNodes.jl
223 lines (177 loc) · 4.5 KB
/
BinaryNodes.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
"""
struct Add <: BinaryNode
x::Payoff
y::Payoff
end
Addition of payoffs.
"""
struct Add <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Sub <: BinaryNode
x::Payoff
y::Payoff
end
Subtraction of payoffs.
"""
struct Sub <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Mul <: BinaryNode
x::Payoff
y::Payoff
end
Multiplication of payoffs.
"""
struct Mul <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Div <: BinaryNode
x::Payoff
y::Payoff
end
Division of payoffs.
"""
struct Div <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Max <: BinaryNode
x::Payoff
y::Payoff
end
Path-wise maximum
"""
struct Max <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Min <: BinaryNode
x::Payoff
y::Payoff
end
Path-wise minimum
"""
struct Min <: BinaryNode
x::Payoff
y::Payoff
end
"""
struct Logical <: BinaryNode
x::Payoff
y::Payoff
op::String
end
Logical operations
"""
struct Logical <: BinaryNode
x::Payoff
y::Payoff
op::String
end
"""
## Implementations
"""
"Addition."
at(p::Add, path::AbstractPath) = at(p.x, path) .+ at(p.y, path)
"Subtraction."
at(p::Sub, path::AbstractPath) = at(p.x, path) .- at(p.y, path)
"Multiplication."
at(p::Mul, path::AbstractPath) = at(p.x, path) .* at(p.y, path)
"Division."
at(p::Div, path::AbstractPath) = at(p.x, path) ./ at(p.y, path)
"Maximum"
at(p::Max, path::AbstractPath) = max.(at(p.x, path), at(p.y, path))
"Minimum"
at(p::Min, path::AbstractPath) = min.(at(p.x, path), at(p.y, path))
"Logical"
function at(p::Logical, path::AbstractPath)
if p.op == "<"
return at(p.x, path) .< at(p.y, path)
elseif p.op == "<="
return at(p.x, path) .<= at(p.y, path)
elseif p.op == "=="
return at(p.x, path) .== at(p.y, path)
elseif p.op == "!="
return at(p.x, path) .!= at(p.y, path)
elseif p.op == ">="
return at(p.x, path) .>= at(p.y, path)
elseif p.op == ">"
return at(p.x, path) .> at(p.y, path)
end
error("Unknown logical operation.")
end
"""
## String output
"""
"Formatted addition."
string(p::Add) = @sprintf("(%s + %s)", string(p.x), string(p.y))
"Formatted subtraction."
string(p::Sub) = @sprintf("(%s - %s)", string(p.x), string(p.y))
"Formatted multiplication."
string(p::Mul) = @sprintf("%s * %s", string(p.x), string(p.y))
"Formatted division."
string(p::Div) = @sprintf("(%s / %s)", string(p.x), string(p.y))
"Formatted maximum."
string(p::Max) = @sprintf("Max(%s, %s)", string(p.x), string(p.y))
"Formatted minimum."
string(p::Min) = @sprintf("Min(%s, %s)", string(p.x), string(p.y))
"Formatted logical."
string(p::Logical) = @sprintf("(%s %s %s)", string(p.x), p.op, string(p.y))
"""
## Operator notation
"""
import Base.+
(+)(x::Payoff,y::Payoff) = Add(x,y)
(+)(x::Payoff,y) = Add(x,ScalarValue(y))
(+)(x,y::Payoff) = Add(ScalarValue(x),y)
import Base.-
(-)(x::Payoff,y::Payoff) = Sub(x,y)
(-)(x::Payoff,y) = Sub(x,ScalarValue(y))
(-)(x,y::Payoff) = Sub(ScalarValue(x),y)
import Base.*
(*)(x::Payoff,y::Payoff) = Mul(x,y)
(*)(x::Payoff,y) = Mul(x,ScalarValue(y))
(*)(x,y::Payoff) = Mul(ScalarValue(x),y)
import Base./
(/)(x::Payoff,y::Payoff) = Div(x,y)
(/)(x::Payoff,y) = Div(x,ScalarValue(y))
(/)(x,y::Payoff) = Div(ScalarValue(x),y)
#import Base.%
#(%)(x::Payoff,t) = Pay(x,t)
import Base.<
(<)(x::Payoff,y::Payoff) = Logical(x,y,"<")
(<)(x::Payoff,y) = Logical(x,ScalarValue(y),"<")
(<)(x,y::Payoff) = Logical(ScalarValue(x),y,"<")
import Base.<=
(<=)(x::Payoff,y::Payoff) = Logical(x,y,"<=")
(<=)(x::Payoff,y) = Logical(x,ScalarValue(y),"<=")
(<=)(x,y::Payoff) = Logical(ScalarValue(x),y,"<=")
import Base.==
(==)(x::Payoff,y::Payoff) = Logical(x,y,"==")
(==)(x::Payoff,y) = Logical(x,ScalarValue(y),"==")
(==)(x,y::Payoff) = Logical(ScalarValue(x),y,"==")
import Base.!=
(!=)(x::Payoff,y::Payoff) = Logical(x,y,"!=")
(!=)(x::Payoff,y) = Logical(x,ScalarValue(y),"!=")
(!=)(x,y::Payoff) = Logical(ScalarValue(x),y,"!=")
import Base.>=
(>=)(x::Payoff,y::Payoff) = Logical(x,y,">=")
(>=)(x::Payoff,y) = Logical(x,ScalarValue(y),">=")
(>=)(x,y::Payoff) = Logical(ScalarValue(x),y,">=")
import Base.>
(>)(x::Payoff,y::Payoff) = Logical(x,y,">")
(>)(x::Payoff,y) = Logical(x,ScalarValue(y),">")
(>)(x,y::Payoff) = Logical(ScalarValue(x),y,">")
Max(x::Payoff,y) = Max(x,ScalarValue(y))
Max(x,y::Payoff) = Max(ScalarValue(x),y)
Min(x::Payoff,y) = Min(x,ScalarValue(y))
Min(x,y::Payoff) = Min(ScalarValue(x),y)