Miko/LSL-PyOptimizer
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Use CompareTrees to optimize the == operator.

Browse Source 
Now we can.
This commit is contained in:
Sei Lisa
2017-10-21 11:02:38 +02:00
parent e6b23a2d7a
commit dc117c2cbf
1 changed files with 5 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
lslopt/lslfoldconst.py
View File

@@ -1084,15 +1084,11 @@ class foldconst(object):
del child del child
self.FoldTree(parent, index) self.FoldTree(parent, index)
return return
# While this is tempting, it can only be done for identifiers. if self.CompareTrees(child[0], child[1]):
# Counterexample: llFrand(1) == llFrand(1) would # a == a -> 1
# almost always return FALSE. After CompareTrees is fixed, parent[index] = {'nt':'CONST', 't':'integer', 'value':1,
# we can reinstate it. 'SEF':True}
#if self.CompareTrees(child[0], child[1]): return
# # a == a -> 1
# parent[index] = {'nt':'CONST', 't':'integer', 'value':1,
# 'SEF':True}
# return
return return
if nt in ('<=', '>=') or nt == '!=' and child[0]['t'] != 'list': if nt in ('<=', '>=') or nt == '!=' and child[0]['t'] != 'list':