CCF_100/relational
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

More isinstance

Browse Source
This commit is contained in:
Salvo 'LtWorf' Tomaselli 2020-08-12 15:26:41 +02:00
parent bd58442912
commit be932abcaa
No known key found for this signature in database
GPG Key ID: B3A7CF0C801886CF
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
relational/optimizations.py
View File

@ -107,7 +107,7 @@ def futile_union_intersection_subtraction(n: parser.Node) -> Tuple[parser.Node,
# selection and intersection of the same thing # selection and intersection of the same thing
elif n.name == INTERSECTION: elif n.name == INTERSECTION:
if n.left.name == SELECTION and n.left.child == n.right: if n.left.name == SELECTION and isinstance(n.left, Unary) and n.left.child == n.right:
return n.left, 1 return n.left, 1
elif n.right.name == SELECTION and \ elif n.right.name == SELECTION and \
isinstance(n.right, Unary) and \ isinstance(n.right, Unary) and \
@ -128,7 +128,7 @@ def futile_union_intersection_subtraction(n: parser.Node) -> Tuple[parser.Node,
# Subtraction of the same thing or with selection on the left child # Subtraction of the same thing or with selection on the left child
elif n.name == DIFFERENCE and \ elif n.name == DIFFERENCE and \
isinstance(n, Binary) and \ isinstance(n, Binary) and \
(n.left == n.right or (n.left.name == SELECTION and n.left.child == n.right)): (n.left == n.right or (n.left.name == SELECTION and isinstance(n.left, Unary) and n.left.child == n.right)):
return Unary( return Unary(
SELECTION, SELECTION,
'False', 'False',