mathai 0.2.5__tar.gz → 0.2.8__tar.gz

{mathai-0.2.5 → mathai-0.2.8}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: mathai
-Version: 0.2.5
+Version: 0.2.8
 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.2.5 → mathai-0.2.8}/mathai/base.py

@@ -164,7 +164,7 @@ def factor_generation(eq):
                 if child.children[1].name[:2] != "d_":
                     output.append(child)
                     continue
-                if child.children[1].name[2:].isdigit():
+                if frac(child.children[1]) is not None and frac(child.children[1]).denominator == 1:
                     n = int(child.children[1].name[2:])
                     if n < 0:
                         for i in range(-n):
@@ -176,6 +176,7 @@ def factor_generation(eq):
                     output.append(child)
             else:
                 output.append(child)
+                
     return output
 import math
 

{mathai-0.2.5 → mathai-0.2.8}/mathai/univariate_inequality.py

@@ -212,7 +212,6 @@ def helper(eq, var="v_0"):
     
     eq.children[0] = factor2(eq.children[0])
     
-    
     for item in factor_generation(eq.children[0]):
         item = simplify(expand(item))
         
@@ -221,48 +220,45 @@ def helper(eq, var="v_0"):
                 sign = not sign
             continue
         v = vlist(item)[0]
-       
+        
         if item.name == "f_pow" and item.children[1].name== "d_-1":
             
             item = item.children[0]
-
-            tmp2 = diff(copy.deepcopy(item))
-            if "v_" in str_form(tmp2):
-                return None
-
             
             if diff(diff(item, v), v) != tree_form("d_0"):
                 
                 a = replace(diff(diff(item, v), v), tree_form(v), tree_form("d_0"))/tree_form("d_2")
+                if "v_" in str_form(a):
+                    return None
                 if compute(a) < 0:
                     sign = not sign
                 continue
-            
-            
-            if compute(tmp2)<0:
-                sign = not sign
-                item = simplify(item * tree_form("d_-1"))
-            out = inverse(item, vlist(item)[0])
-            critical.append(out)
+            else:
+                tmp2 = diff(copy.deepcopy(item))
+                if compute(tmp2)<0:
+                    sign = not sign
+                    item = simplify(item * tree_form("d_-1"))
+                out = inverse(item, vlist(item)[0])
+                critical.append(out)
         else:
-            tmp2 = diff(copy.deepcopy(item))
-            if "v_" in str_form(tmp2):
-                return None
+            
             
             if diff(diff(item, v), v) != tree_form("d_0"):
                 a = replace(diff(diff(item, v), v), tree_form(v), tree_form("d_0"))/tree_form("d_2")
+                if "v_" in str_form(a):
+                    return None
                 if compute(a) < 0:
                     sign = not sign
                 continue
-            
-            
-            if compute(tmp2)<0:
-                sign = not sign
-                item = simplify(item * tree_form("d_-1"))
-            out = inverse(item, vlist(item)[0])
-            critical.append(out)
-            if equ:
-                equal.append(out)
+            else:
+                tmp2 = diff(copy.deepcopy(item))
+                if compute(tmp2)<0:
+                    sign = not sign
+                    item = simplify(item * tree_form("d_-1"))
+                out = inverse(item, vlist(item)[0])
+                critical.append(out)
+                if equ:
+                    equal.append(out)
     equal = list(set([simplify(item) for item in equal]))
     more = list(set([simplify(item) for item in more]))
     critical = [simplify(item) for item in critical]
@@ -365,9 +361,8 @@ def absolute(equation):
         equation = TreeNode("f_or", out2)
     return equation
 def handle_sqrt(eq):
-    eq = domain(eq)
     def helper2(eq):
-        if eq.name in ["f_lt", "f_gt", "f_le", "f_ge"]:
+        if eq.name in ["f_lt", "f_gt", "f_le", "f_ge","f_eq"]:
             out = []
             def helper(eq):
                 nonlocal out
@@ -376,15 +371,15 @@ def handle_sqrt(eq):
                 x = [helper(child) for child in eq.children]
             helper(eq)
             for item in out:
-                
-                eq2, sgn = inverse(simplify(eq.children[0]), str_form(item), True)
                 n = tree_form("d_1")
-                if sgn == False:
-                    n = tree_form("d_-1")
+                if eq.name == "f_eq":
+                    eq2 = inverse(simplify(eq.children[0]), str_form(item))
+                else:
+                    eq2, sgn = inverse(simplify(eq.children[0]), str_form(item), True)
+                    if sgn == False:
+                        n = tree_form("d_-1")
                 eq3 = simplify(expand(simplify(eq2**2)))
-                eq2 = simplify(eq2)
-                if "v_" in str_form(eq3) and not (eq2.name == "f_pow" and frac(eq2.children[1]) == Fraction(1,2)):
-                    return simplify(TreeNode(eq.name, [simplify(n*item.children[0]-eq3*n), tree_form("d_0")])) & TreeNode("f_ge", [eq2, tree_form("d_0")])
+                
                 return simplify(TreeNode(eq.name, [simplify(n*item.children[0]-eq3*n), tree_form("d_0")]))
         return TreeNode(eq.name, [helper2(child) for child in eq.children])
     return helper2(eq)
@@ -394,9 +389,13 @@ def domain(eq):
     def helper2(eq):
         nonlocal out
         if eq.name == "f_pow" and frac(eq.children[1]) is not None and frac(eq.children[1]).denominator == 2:
-            out.append(TreeNode("f_ge", [eq.children[0], tree_form("d_0")]))
+            if "v_" in str_form(eq.children[0]):
+                out.append(TreeNode("f_ge", [eq.children[0], tree_form("d_0")]))
+                out.append(TreeNode("f_ge", [eq, tree_form("d_0")]))
         if eq.name == "f_pow" and frac(eq.children[1]) is not None and frac(eq.children[1]) <0:
-            out.append(TreeNode("f_eq", [eq.children[0], tree_form("d_0")]).fx("not"))
+            tmp = TreeNode("f_eq", [eq.children[0], tree_form("d_0")]).fx("not")
+            if "v_" in str_form(tmp):
+                out.append(tmp)
         x = [helper2(child) for child in eq.children]
     helper2(eq)
     out = list(set([simplify(item) for item in out]))

{mathai-0.2.5 → mathai-0.2.8}/mathai.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: mathai
-Version: 0.2.5
+Version: 0.2.8
 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.2.5 → mathai-0.2.8}/setup.py

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