lafrite/Mapytex
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix(Core): refact MO, clean import and fix renders

Browse Source 
Split MO in 2 categories Atoms and Molecules
This commit is contained in:
Bertrand Benjamin
2018-12-21 11:26:37 +01:00
parent 80305671de
commit f51ffbbe8b
20 changed files with 616 additions and 413 deletions
Download Patch File Download Diff File Expand all files Collapse all files

146
mapytex/calculus/core/renders/tree2txt.py
View File

@@ -6,45 +6,38 @@
#
# Distributed under terms of the MIT license.
from mapytex.calculus.core.operator import OPERATORS
from ..operator import OPERATORS
__all__ = ['tree2txt']
def plus2txt(left, right):
""" + rendering
>>> from ..MO import mo
>>> plus2txt(mo.MOnumber(2), mo.MOnumber(3))
>>> from ..MO import MO
>>> plus2txt(MO.factory(2), MO.factory(3))
'2 + 3'
>>> from ..tree import Tree
>>> t = Tree.from_str("1+2")
>>> plus2txt(t, mo.MOnumber(3))
>>> plus2txt(t, MO.factory(3))
'1 + 2 + 3'
>>> plus2txt(t, mo.MOnumber(-3))
>>> plus2txt(t, MO.factory(-3))
'1 + 2 - 3'
>>> plus2txt(mo.MOnumber(-3), t)
>>> plus2txt(MO.factory(-3), t)
'- 3 + 1 + 2'
>>> t = Tree.from_str("-2*3")
>>> plus2txt(mo.MOnumber(3), t)
>>> plus2txt(MO.factory(3), t)
'3 - 2 * 3'
"""
display_plus = True
try:
left.node
except AttributeError:
left_ = left.__txt__
else:
left_ = tree2txt(left)
left_ = render_with_parenthesis(left, "+")
try:
right.node
except AttributeError:
right_ = right.__txt__
else:
right_ = tree2txt(right)
finally:
if right_.startswith("-"):
display_plus = False
right_ = render_with_parenthesis(right, "+")
except ValueError:
raise TypeError(f"right -> {type(right)} {right}")
display_plus = True
if right_.startswith("-"):
display_plus = False
if display_plus:
return f"{left_} + {right_}"
@@ -54,8 +47,8 @@ def plus2txt(left, right):
def minus2txt(left, right):
""" - rendering
>>> from ..MO import mo
>>> minus2txt(None, mo.MO(3))
>>> from ..MO import MO
>>> minus2txt(None, MO.factory(3))
'- 3'
>>> from ..tree import Tree
>>> t = Tree.from_str("1+2")
@@ -79,55 +72,32 @@ def minus2txt(left, right):
def mul2txt(left, right):
""" * rendering
>>> from ..MO import mo
>>> mul2txt(mo.MO(2), mo.MO(3))
>>> from ..MO import MO
>>> mul2txt(MO.factory(2), MO.factory(3))
'2 * 3'
>>> from ..tree import Tree
>>> t = Tree.from_str("1*2")
>>> mul2txt(t, mo.MO(3))
>>> mul2txt(t, MO.factory(3))
'1 * 2 * 3'
>>> t = Tree.from_str("1+2")
>>> mul2txt(t, mo.MO(3))
>>> mul2txt(t, MO.factory(3))
'(1 + 2) * 3'
>>> mul2txt(mo.MO(3), t)
>>> mul2txt(MO.factory(3), t)
'3(1 + 2)'
>>> a = mo.MOstr('x')
>>> mul2txt(mo.MO(3), a)
>>> a = MO.factory('x')
>>> mul2txt(MO.factory(3), a)
'3x'
>>> mul2txt(a, a)
'x * x'
"""
display_time = True
try:
left_need_parenthesis = False
if OPERATORS[left.node]["precedence"] < OPERATORS['*']["precedence"]:
left_need_parenthesis = True
except AttributeError:
left_ = left.__txt__
else:
if left_need_parenthesis:
left_ = f"({tree2txt(left)})"
else:
left_ = tree2txt(left)
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['*']["precedence"]:
right_need_parenthesis = True
except AttributeError:
try:
right_ = right.__txt__
except AttributeError:
right_ = right
else:
if right_need_parenthesis:
display_time = False
right_ = f"({tree2txt(right)})"
else:
right_ = tree2txt(right)
finally:
if right_[0].isalpha() and (left_.isnumeric() or left_.isdecimal()):
display_time = False
left_ = render_with_parenthesis(left, "*")
right_ = render_with_parenthesis(right, "*")
if (right_[0].isalpha() and (left_.isnumeric() or left_.isdecimal())) or \
right_[0] == '(':
display_time = False
if display_time:
return f"{left_} * {right_}"
@@ -137,18 +107,18 @@ def mul2txt(left, right):
def div2txt(left, right):
""" / rendering
>>> from ..MO import mo
>>> div2txt(mo.MO(2), mo.MO(3))
>>> from ..MO import MO
>>> div2txt(MO.factory(2), MO.factory(3))
'2 / 3'
>>> from ..tree import Tree
>>> t = Tree.from_str("1/2")
>>> div2txt(t, mo.MO(3))
>>> div2txt(t, MO.factory(3))
'1 / 2 / 3'
>>> t = Tree.from_str("1+2")
>>> div2txt(t, mo.MO(3))
>>> div2txt(t, MO.factory(3))
'(1 + 2) / 3'
>>> t = Tree.from_str("1*2")
>>> div2txt(mo.MO(3), t)
>>> div2txt(MO.factory(3), t)
'3 / (1 * 2)'
"""
try:
@@ -179,31 +149,22 @@ def div2txt(left, right):
def pow2txt(left, right):
""" ^ rendering
>>> from ..MO import mo
>>> pow2txt(mo.MO(2), mo.MO(3))
>>> from ..MO import MO
>>> pow2txt(MO.factory(2), MO.factory(3))
'2^3'
>>> from ..tree import Tree
>>> t = Tree.from_str("1^2")
>>> pow2txt(t, mo.MO(3))
>>> pow2txt(t, MO.factory(3))
'1^2^3'
>>> t = Tree.from_str("1+2")
>>> pow2txt(t, mo.MO(3))
>>> pow2txt(t, MO.factory(3))
'(1 + 2)^3'
>>> t = Tree.from_str("1*2")
>>> pow2txt(mo.MO(3), t)
>>> pow2txt(MO.factory(3), t)
'3^(1 * 2)'
"""
try:
left_need_parenthesis = False
if OPERATORS[left.node]["precedence"] < OPERATORS['^']["precedence"]:
left_need_parenthesis = True
except AttributeError:
left_ = left.__txt__
else:
if left_need_parenthesis:
left_ = f"({tree2txt(left)})"
else:
left_ = tree2txt(left)
left_ = render_with_parenthesis(left, "^")
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['^']["precedence"]:
@@ -218,6 +179,26 @@ def pow2txt(left, right):
return f"{left_}^{right_}"
def render_with_parenthesis(subtree, operator):
subtree_need_parenthesis = False
try:
subtree.node
except AttributeError:
try:
if OPERATORS[subtree.MAINOP]["precedence"] < OPERATORS[operator]["precedence"]:
subtree_need_parenthesis = True
except (AttributeError, KeyError):
pass
subtree_ = subtree.__txt__
else:
if OPERATORS[subtree.node]["precedence"] < OPERATORS[operator]["precedence"]:
subtree_need_parenthesis = True
subtree_ = tree2txt(subtree)
if subtree_need_parenthesis:
return f"({subtree_})"
return subtree_
OPERATOR2TXT = {
"+": plus2txt,
"-": minus2txt,
@@ -240,6 +221,9 @@ def tree2txt(tree):
>>> tree2txt(t)
'2 + 3 * 4'
"""
from ..tree import Tree
if not isinstance(tree, Tree):
raise ValueError(f"Can only render a Tree (got {type(tree).__name__}: {tree})")
return OPERATOR2TXT[tree.node](tree.left_value, tree.right_value)