AriasCreations/LSL-PyOptimizer
3
0
Fork 0
mirror of https://github.com/Sei-Lisa/LSL-PyOptimizer synced 2025-07-03 00:18:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Don't fall through after optimizing a negable comparison, as it's folded already and the variables were incorrectly set and broke our invariants.

Browse source
This commit is contained in:
Sei Lisa 2015-04-21 06:09:57 +02:00
parent d58bc2d350
commit 4302ea846d
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
lslopt/lslfoldconst.py
View file

@ -769,9 +769,9 @@ class foldconst(object):
# the number of cases to check. # the number of cases to check.
# a<=b --> !(a>b); a>=b --> !(a<b); a!=b --> !(a==b) # a<=b --> !(a>b); a>=b --> !(a<b); a!=b --> !(a==b)
node['nt'] = {'<=':'>', '>=':'<', '!=':'=='}[nt] node['nt'] = {'<=':'>', '>=':'<', '!=':'=='}[nt]
node = parent[index] = {'nt':'!', 't':node['t'], 'ch':[node]} parent[index] = {'nt':'!', 't':node['t'], 'ch':[node]}
self.FoldTree(parent, index) self.FoldTree(parent, index)
# Fall through to optimize as '<' or '>' or '==' return
if nt == '>': if nt == '>':
# Invert the inequalities to avoid doubling the cases to check. # Invert the inequalities to avoid doubling the cases to check.