teaching/mtl-aas
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

lazily compute early termination boundary conditions

Browse source
This commit is contained in:
Marcell Vazquez-Chanlatte 2016-10-09 23:47:55 -07:00
parent da669f088d
commit 5970c77cb9
1 changed files with 2 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

8
synth.py
View file

@ -5,14 +5,10 @@ from lenses import lens
def binsearch(stleval, *, tol=1e-3, lo, hi, polarity): def binsearch(stleval, *, tol=1e-3, lo, hi, polarity):
"""Only run search if tightest robustness was positive.""" """Only run search if tightest robustness was positive."""
# Only check low since hi taken care of by precondition.
# TODO: allow for different polarities
rL, rH = stleval(lo), stleval(hi)
# Early termination via bounds checks # Early termination via bounds checks
posL, posH = rL > 0, rH > 0 if polarity and stleval(lo) > 0:
if polarity and posL:
return lo return lo
elif not polarity and posH: elif not polarity and stleval(hi) > 0:
return hi return hi
while hi - lo > tol: while hi - lo > tol: