Skip to content

Commit

Permalink
Use correct latin plural infima and suprema
Browse files Browse the repository at this point in the history
  • Loading branch information
LuEdRaMo committed Apr 8, 2024
1 parent d656cc5 commit 79807f3
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions src/adsbinarynode.jl
Original file line number Diff line number Diff line change
Expand Up @@ -59,9 +59,9 @@ end
# Return the diameter of each direction in s
widths(s::ADSDomain{N, T}) where {N, T <: Real} = s.hi - s.lo
# Return the lower bounds in s
infimums(s::ADSDomain{N, T}) where {N, T <: Real} = s.lo
infima(s::ADSDomain{N, T}) where {N, T <: Real} = s.lo
# Return the upper bounds in s
supremums(s::ADSDomain{N, T}) where {N, T <: Real} = s.hi
suprema(s::ADSDomain{N, T}) where {N, T <: Real} = s.hi

Check warning on line 64 in src/adsbinarynode.jl

View check run for this annotation

Codecov / codecov/patch

src/adsbinarynode.jl#L64

Added line #L64 was not covered by tests
# Split s in half along direction i
function split(s::ADSDomain{N, T}, i::Int) where {N, T <: Real}
@assert 1 <= i <= N
Expand Down Expand Up @@ -371,7 +371,7 @@ function evaltree(n::ADSBinaryNode{N, M, T}, t::U,
loc = node.s
# Linear transformation
ms = widths(sup) ./ widths(loc)
ks = infimums(sup) - infimums(loc) .* ms
ks = infima(sup) - infima(loc) .* ms
_s_ = ms .* s .+ ks
# Eval p at transformed point
x = map(y -> y(_s_), p)
Expand Down

0 comments on commit 79807f3

Please sign in to comment.