Skip to content

Commit ecbd487

Browse files
committed
Better test coverage, and bsub(::Dual) specialization.
1 parent 5b05b9b commit ecbd487

2 files changed

Lines changed: 75 additions & 50 deletions

File tree

src/RecursiveTupleMath.jl

Lines changed: 24 additions & 26 deletions
Original file line numberDiff line numberDiff line change
@@ -27,12 +27,12 @@ using ForwardDiff: ≺, @define_binary_dual_op, Dual
2727
@inline lt_fast(a, b) = a < b
2828
@inline lt_fast(a::Float64, b::Float64) = Base.lt_float_fast(a, b)
2929
@inline lt_fast(a::Float32, b::Float32) = Base.lt_float_fast(a, b)
30-
@inline le_fast(a, b) = a <= b
31-
@inline le_fast(a::Float64, b::Float64) = Base.le_float_fast(a, b)
32-
@inline le_fast(a::Float32, b::Float32) = Base.le_float_fast(a, b)
33-
3430
@inline gt_fast(a, b) = lt_fast(b, a)
35-
@inline ge_fast(a, b) = le_fast(b, a)
31+
32+
# @inline le_fast(a, b) = a <= b
33+
# @inline le_fast(a::Float64, b::Float64) = Base.le_float_fast(a, b)
34+
# @inline le_fast(a::Float32, b::Float32) = Base.le_float_fast(a, b)
35+
# @inline ge_fast(a, b) = le_fast(b, a)
3636

3737
@inline badd(a, b) = Base.FastMath.add_fast(a, b)
3838
@inline bsub(a, b) = Base.FastMath.sub_fast(a, b)
@@ -47,8 +47,6 @@ for bf ∈ [:bmax, :bmin, :badd, :bsub, :bmul, :bdiv]
4747
# terminating case
4848
@inline $bf(::Number, ::Tuple{}) = ()
4949
@inline $bf(::Tuple{}, ::Number) = ()
50-
@inline $bf(::Number, ::Nothing) = nothing
51-
@inline $bf(::Nothing, ::Number) = nothing
5250

5351
# broadcast
5452
@inline $bf(x::Number, y::StaticArray{S}) where {S} = SArray{S}($bf(x, Tuple(y)))
@@ -87,60 +85,60 @@ end
8785
ntuple(Returns(v), Val(D))
8886
end
8987

90-
# @inline
88+
@inline bsub(x::Dual{T}) where {T} = Dual{T}(bsub(x.value), bsub(x.partials.values))
9189

9290
@define_binary_dual_op(
9391
RecursiveTupleMath.badd,
9492
begin
95-
Base.@_inline_meta
93+
@_inline
9694
Dual{Txy}(badd(x.value, y.value), badd(x.partials.values, y.partials.values))
9795
end,
9896
begin
99-
Base.@_inline_meta
97+
@_inline
10098
Dual{Tx}(badd(x.value, y), x.partials)
10199
end,
102100
begin
103-
Base.@_inline_meta
101+
@_inline
104102
Dual{Ty}(badd(x, y.value), y.partials.values)
105103
end,
106104
)
107105
@define_binary_dual_op(
108106
RecursiveTupleMath.bsub,
109107
begin
110-
Base.@_inline_meta
108+
@_inline
111109
Dual{Txy}(bsub(x.value, y.value), bsub(x.partials.values, y.partials.values))
112110
end,
113111
begin
114-
Base.@_inline_meta
112+
@_inline
115113
Dual{Tx}(bsub(x.value, y), x.partials)
116114
end,
117115
begin
118-
Base.@_inline_meta
116+
@_inline
119117
Dual{Ty}(bsub(x, y.value), bsub(y.partials.values))
120118
end
121119
)
122120
@define_binary_dual_op(
123121
RecursiveTupleMath.bmul,
124122
begin
125-
Base.@_inline_meta
123+
@_inline
126124
Dual{Txy}(
127125
bmul(x.value, y.value),
128126
badd(bmul(x.value, y.partials.values), bmul(x.partials.values, y.value)),
129127
)
130128
end,
131129
begin
132-
Base.@_inline_meta
130+
@_inline
133131
Dual{Tx}(bmul(x.value, y), bmul(x.partials.values, y))
134132
end,
135133
begin
136-
Base.@_inline_meta
134+
@_inline
137135
Dual{Ty}(bmul(x, y.value), bmul(x, y.partials.values))
138136
end
139137
)
140138
@define_binary_dual_op(
141139
RecursiveTupleMath.bdiv,
142140
begin
143-
Base.@_inline_meta
141+
@_inline
144142
Dual{Txy}(
145143
bdiv(x.value, y.value),
146144
bdiv(
@@ -150,11 +148,11 @@ end
150148
)
151149
end,
152150
begin
153-
Base.@_inline_meta
151+
@_inline
154152
Dual{Tx}(bdiv(x.value, y), bdiv(bmul(x.partials.values, y), bmul(y, y)))
155153
end,
156154
begin
157-
Base.@_inline_meta
155+
@_inline
158156
Dual{Ty}(
159157
bdiv(x, y.value),
160158
bdiv(bsub(bmul(x, y.partials.values)), bmul(y.value, y.value)),
@@ -164,15 +162,15 @@ end
164162
@define_binary_dual_op(
165163
RecursiveTupleMath.bmax,
166164
begin
167-
Base.@_inline_meta
165+
@_inline
168166
cmp = gt_fast(x.value, y.value)
169167
v = ifelse(cmp, x.value, y.value)
170168
bcmp = btuple(cmp, Val(length(x.partials)))
171169
p = map(ifelse, bcmp, x.partials.values, y.partials.values)
172170
Dual{Txy}(v, p)
173171
end,
174172
begin
175-
Base.@_inline_meta
173+
@_inline
176174
cmp = gt_fast(x.value, y)
177175
v = ifelse(cmp, x.value, y)
178176
bcmp = btuple(cmp, Val(length(x.partials)))
@@ -181,7 +179,7 @@ end
181179
Dual{Tx}(v, p)
182180
end,
183181
begin
184-
Base.@_inline_meta
182+
@_inline
185183
cmp = gt_fast(x, y.value)
186184
v = ifelse(cmp, x, y.value)
187185
bcmp = btuple(cmp, Val(length(y.partials)))
@@ -193,15 +191,15 @@ end
193191
@define_binary_dual_op(
194192
RecursiveTupleMath.bmin,
195193
begin
196-
Base.@_inline_meta
194+
@_inline
197195
cmp = lt_fast(x.value, y.value)
198196
v = ifelse(cmp, x.value, y.value)
199197
bcmp = btuple(cmp, Val(length(x.partials)))
200198
p = map(ifelse, bcmp, x.partials.values, y.partials.values)
201199
Dual{Txy}(v, p)
202200
end,
203201
begin
204-
Base.@_inline_meta
202+
@_inline
205203
cmp = lt_fast(x.value, y)
206204
v = ifelse(cmp, x.value, y)
207205
bcmp = btuple(cmp, Val(length(x.partials)))
@@ -210,7 +208,7 @@ end
210208
Dual{Tx}(v, p)
211209
end,
212210
begin
213-
Base.@_inline_meta
211+
@_inline
214212
cmp = lt_fast(x, y.value)
215213
v = ifelse(cmp, x, y.value)
216214
bcmp = btuple(cmp, Val(length(y.partials)))

test/runtests.jl

Lines changed: 51 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -2,32 +2,59 @@ using Base: Forward
22
using RecursiveTupleMath, StaticArrays, ForwardDiff
33
using Test
44

5-
foo(x, y, z) = sum(min.(z .+ x, (x .- y)) ./ max.(z .- y, (x .* y)))
6-
bar(x, y, z) = sum(bdiv(bmin(badd(z, x), bsub(x, y)), bmax(bsub(z, y), bmul(x, y))))
5+
abc(x::Number) = x
6+
abc(x::SVector{3}) = (a = x[1], b = x[2], c = x[3])
77

8-
@testset "RecursiveTupleMath.jl" begin
9-
x = rand()
10-
xv = @SVector rand(3)
11-
for y in (rand(), @SVector(rand(3))), z in (rand(), @SVector(rand(3)))
8+
foo0(x, y, z) = sum(min.(z .+ x, (x .- y)) ./ max.(z .- y, (x .* y)))
9+
bar0(x, y, z) = sum(bdiv(bmin(badd(z, x), bsub(x, y)), bmax(bsub(z, y), bmul(x, y))))
10+
11+
foo1(x, y, z) = sum((min.(x, y) ./ max.(x, y)) .* z .- z)
12+
bar1(x, y, z) = sum(bsub(bmul(bdiv(bmin(x, y), bmax(x, y)), z), z))
1213

13-
@test ForwardDiff.derivative(x -> foo(x, y, z), x)
14-
ForwardDiff.derivative(x -> bar(x, y, z), x)
15-
@test ForwardDiff.derivative(x -> foo(y, x, z), x)
16-
ForwardDiff.derivative(x -> bar(y, x, z), x)
17-
@test ForwardDiff.derivative(x -> foo(y, z, x), x)
18-
ForwardDiff.derivative(x -> bar(y, z, x), x)
14+
foo2(x, y, z) = sum((.-(x) ./ y) .+ (z ./ x))
15+
bar2(x, y, z) = sum(badd(bdiv(bsub(x), y), bdiv(z, x)))
1916

20-
@test ForwardDiff.gradient(x -> foo(x, y, z), xv)
21-
ForwardDiff.gradient(x -> bar(x, y, z), xv)
22-
@test ForwardDiff.gradient(x -> foo(y, x, z), xv)
23-
ForwardDiff.gradient(x -> bar(y, x, z), xv)
24-
@test ForwardDiff.gradient(x -> foo(y, z, x), xv)
25-
ForwardDiff.gradient(x -> bar(y, z, x), xv)
26-
@test ForwardDiff.hessian(x -> foo(x, y, z), xv)
27-
ForwardDiff.hessian(x -> bar(x, y, z), xv)
28-
@test ForwardDiff.hessian(x -> foo(y, x, z), xv)
29-
ForwardDiff.hessian(x -> bar(y, x, z), xv)
30-
@test ForwardDiff.hessian(x -> foo(y, z, x), xv)
31-
ForwardDiff.hessian(x -> bar(y, z, x), xv)
17+
struct Cycle{F,Y,Z}
18+
f::F
19+
y::Y
20+
z::Z
21+
n::Int
22+
end
23+
Cycle(f::F, y::Y, z::Z) where {F,Y,Z} = Cycle(f, y, z, 0)
24+
Cycle(c::Cycle, n::Int) = Cycle(c.f, c.y, c.z, n)
25+
function (f::Cycle)(x)
26+
y = f.y
27+
z = f.z
28+
if f.n == 0
29+
f.f(x, y, z)
30+
elseif f.n == 1
31+
f.f(y, x, z)
32+
else
33+
f.f(y, z, x)
34+
end
35+
end
36+
37+
@testset "RecursiveTupleMath.jl" begin
38+
for T (Float64, Float32)
39+
x = rand(T)
40+
xv = @SVector rand(T, 3)
41+
for (f, b) ((foo0, bar0), (foo1, bar1), (foo2, bar2))
42+
for y in (rand(T), @SVector(rand(T, 3))), z in (rand(T), @SVector(rand(T, 3)))
43+
let g = Cycle(f, y, z), h = Cycle(b, y, z), habc = Cycle(b, abc(y), abc(z))
44+
for n = 1:3
45+
@test ForwardDiff.derivative(g, x) ForwardDiff.derivative(h, x)
46+
@test ForwardDiff.gradient(g, xv)
47+
ForwardDiff.gradient(h, xv)
48+
ForwardDiff.gradient(habc abc, xv)
49+
@test ForwardDiff.hessian(g, xv)
50+
ForwardDiff.hessian(h, xv)
51+
ForwardDiff.hessian(habc abc, xv)
52+
g = Cycle(g, n)
53+
h = Cycle(h, n)
54+
habc = Cycle(habc, n)
55+
end
56+
end
57+
end
58+
end
3259
end
3360
end

0 commit comments

Comments
 (0)