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

Add more results of operating an expression with itself.

Browse source 
Implemented a<a=0, a^a=0, a+-a=0, -a+a=0, a|a=a, a&a=a
This commit is contained in:
Sei Lisa 2017-11-03 00:45:11 +01:00
parent 4251d4c7f9
commit 0b1ad7c110
1 changed files with 28 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

29
lslopt/lslfoldconst.py
View file

@ -820,6 +820,17 @@ class foldconst(object):
# Tough one. Remove neutral elements for the diverse types, # Tough one. Remove neutral elements for the diverse types,
# and more. # and more.
# expr + -expr -> 0
# -expr + expr -> 0
if (child[0]['nt'] == 'NEG'
and self.CompareTrees(child[0]['ch'][0], child[1])
or child[1]['nt'] == 'NEG'
and self.CompareTrees(child[1]['ch'][0], child[0])
):
parent[index] = {'nt':'CONST', 't':'integer', 'value':0,
'SEF':True}
return
# Addition of integers, strings, and lists is associative. # Addition of integers, strings, and lists is associative.
# Addition of floats, vectors and rotations would be, except # Addition of floats, vectors and rotations would be, except
# for FP precision. # for FP precision.
@ -1156,7 +1167,7 @@ class foldconst(object):
self.FoldTree(parent, index) self.FoldTree(parent, index)
return return
if self.CompareTrees(child[0], child[1]): if self.CompareTrees(child[0], child[1]):
# a == a -> 1 # expr == expr -> 1
parent[index] = {'nt':'CONST', 't':'integer', 'value':1, parent[index] = {'nt':'CONST', 't':'integer', 'value':1,
'SEF':True} 'SEF':True}
return return
@ -1182,6 +1193,11 @@ class foldconst(object):
# fall through to check for '<' # fall through to check for '<'
if nt == '<': if nt == '<':
# expr < expr -> 0
if self.CompareTrees(child[0], child[1]):
parent[index] = {'nt':'CONST', 't':'integer', 'value':0,
'SEF':True}
return
if child[0]['t'] == child[1]['t'] in ('integer', 'float'): if child[0]['t'] == child[1]['t'] in ('integer', 'float'):
if (child[0]['nt'] == 'CONST' if (child[0]['nt'] == 'CONST'
and child[1]['nt'] == 'FNCALL' and child[1]['nt'] == 'FNCALL'
@ -1243,6 +1259,12 @@ class foldconst(object):
return return
if nt in ('&', '|'): if nt in ('&', '|'):
# expr & expr -> expr
# expr | expr -> expr
if self.CompareTrees(child[0], child[1]):
parent[index] = child[0]
return
# Deal with operands in any order # Deal with operands in any order
a, b = 0, 1 a, b = 0, 1
# Put constant in child[b] # Put constant in child[b]
@ -1300,6 +1322,11 @@ class foldconst(object):
return return
if nt == '^': if nt == '^':
# expr ^ expr -> 0
if self.CompareTrees(child[0], child[1]):
parent[index] = {'nt':'CONST', 't':'integer', 'value':0,
'SEF':True}
return
a, b = 0, 1 a, b = 0, 1
if child[a]['nt'] == 'CONST': if child[a]['nt'] == 'CONST':
a, b = 1, 0 a, b = 1, 0