mathai 0.6.1__tar.gz → 0.6.3__tar.gz

{mathai-0.6.1 → mathai-0.6.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mathai
-Version: 0.6.1
+Version: 0.6.3
 Summary: Mathematics solving Ai tailored to NCERT
 Home-page: https://github.com/infinity390/mathai4
 Author: educated indians are having a low iq and are good for nothing

{mathai-0.6.1 → mathai-0.6.3}/mathai/base.py

@@ -8,7 +8,7 @@ def contains_list_or_neg(node):
             return True
     return False
 class TreeNode:
-    matmul = True
+    matmul = None
 
     def __init__(self, name, children=None):
         if children is None:
@@ -18,11 +18,11 @@ class TreeNode:
         children = copy.deepcopy(children)
         self.name = name
 
-        if name == "f_add" or (name == "f_mul" and TreeNode.matmul):
+        if name == "f_add" or (name == "f_mul" and (TreeNode.matmul == True or TreeNode.matmul is None)):
             keyed = [(str_form(c), c) for c in children]
             self.children = [c for _, c in sorted(keyed)]
 
-        elif name == "f_mul":
+        elif name == "f_mul" and TreeNode.matmul == False:
             sortable = []
             fixed = []
             for c in children:
@@ -291,7 +291,7 @@ def compute(eq):
         return values[0] - values[1]
     elif eq.name == "f_rad":
         return values[0] * math.pi / 180
-    elif eq.name == "f_mul":
+    elif eq.name in ["f_wmul", "f_mul"]:
         result = 1.0
         for v in values:
             result *= v

{mathai-0.6.1 → mathai-0.6.3}/mathai/matrix.py

@@ -93,4 +93,9 @@ def fold_wmul(eq):
 def flat(eq):
     return flatten_tree(tree_form(str_form(eq).replace("f_w","f_")))
 def matrix_solve(eq):
-    return flat(dowhile(eq, lambda x: fold_wmul(flat(x))))
+    if TreeNode.matmul == True:
+        TreeNode.matmul = False
+        eq = simplify(eq)
+        eq = flat(dowhile(eq, lambda x: fold_wmul(flat(x))))
+        TreeNode.matmul = True
+    return eq

{mathai-0.6.1 → mathai-0.6.3}/mathai/parser.py

@@ -33,7 +33,7 @@ grammar = """
            | comparison "<=" arithmetic -> le
            | comparison ">=" arithmetic -> ge
 
-?arithmetic: arithmetic "+" term   -> wadd
+?arithmetic: arithmetic "+" term   -> add
            | arithmetic "-" term   -> sub
            | term
 
@@ -130,7 +130,7 @@ def parse(equation, funclist=None):
         if tree_node.name == "pass_through":
             return fxchange(tree_node.children[0])
         return TreeNode(
-            "f_" + tree_node.name if tree_node.name in tmp3 + ["limitpinf", "limit", "try", "ref", "sqrt","imply","forall","exist","exclude","union","intersection","len","index","angle","charge","sum2","electricfield","line","point","sum","transpose","equationrhs","equationlhs","equation","covariance","variance","expect","error","laplace","dot","curl","pdif","diverge","gradient","rad","ge","le","gt","lt","eqtri","linesegment","midpoint","mag","point1","point2","point3","line1","line2","line3","log10","arcsin","arccos","arctan","list","cosec","sec","cot","equiv","or","not","and","circumcenter","eq","sub","wadd","sin","cos","tan","wmul","integrate","dif","pow","div","log","abs"] else "d_" + tree_node.name,
+            "f_" + tree_node.name if tree_node.name in tmp3 + ["limitpinf", "limit", "try", "ref", "sqrt","imply","forall","exist","exclude","union","intersection","len","index","angle","charge","sum2","electricfield","line","point","sum","transpose","equationrhs","equationlhs","equation","covariance","variance","expect","error","laplace","dot","curl","pdif","diverge","gradient","rad","ge","le","gt","lt","eqtri","linesegment","midpoint","mag","point1","point2","point3","line1","line2","line3","log10","arcsin","arccos","arctan","list","cosec","sec","cot","equiv","or","not","and","circumcenter","eq","sub","add","sin","cos","tan","wmul","integrate","dif","pow","div","log","abs"] else "d_" + tree_node.name,
             [fxchange(child) for child in tree_node.children]
         )
 
@@ -153,6 +153,9 @@ def parse(equation, funclist=None):
         tree_node.children = [rfx(child) for child in tree_node.children]
         return tree_node
     tree_node = rfx(tree_node)
-    tree_node = flatten_tree(tree_node, ["f_wmul","f_wadd"])
-    tree_node = tree_form(str_form(tree_node).replace("f_w","f_"))
+    tree_node = flatten_tree(tree_node, ["f_wmul"])
+    if TreeNode.matmul == True:
+        TreeNode.matmul = False
+        tree_node = tree_form(str_form(tree_node).replace("f_w","f_"))
+        TreeNode.matmul = True
     return tree_node

{mathai-0.6.1 → mathai-0.6.3}/mathai/simplify.py

@@ -20,6 +20,7 @@ def clear_div(eq, denom):
         return tree_form("d_0"), True
     lst3 = []
     for item in lst:
+        print(str_form(item))
         if "v_" not in str_form(item) and compute(item) < 0:
             lst3.append(item)
     sign = denom

{mathai-0.6.1 → mathai-0.6.3}/mathai.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mathai
-Version: 0.6.1
+Version: 0.6.3
 Summary: Mathematics solving Ai tailored to NCERT
 Home-page: https://github.com/infinity390/mathai4
 Author: educated indians are having a low iq and are good for nothing

{mathai-0.6.1 → mathai-0.6.3}/setup.py

@@ -2,7 +2,7 @@ from setuptools import setup, find_packages
 
 setup(
     name="mathai",
-    version="0.6.1",
+    version="0.6.3",
     description="Mathematics solving Ai tailored to NCERT",
     long_description=open("README.md").read(),
     long_description_content_type="text/markdown",