mathai 0.2.3__tar.gz → 0.2.5__tar.gz

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

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

@@ -23,19 +23,22 @@ def subslimit(equation, var):
 def check(num, den, var):
     n, d = None, None
     
-    n, d = (dowhile(replace(e, var, tree_form("d_0")), lambda x: trig0(simplify(x))) for e in (num, den))
+    n, d = (dowhile(replace(e, tree_form(var), tree_form("d_0")), lambda x: trig0(simplify(x))) for e in (num, den))
+
     if n is None or d is None:
         return False
     if n == 0 and d == 0: return True
-    if d != 0: return simplify(num/den)
+    if d != 0:
+        return simplify(n/d)
     return False
 def lhospital(num, den, steps,var):
     logs = []
+    
     out = check(num, den, var)
     if isinstance(out, TreeNode):
         return out,[]
     for _ in range(steps):
-        num2, den2 = map(lambda e: simplify(diff(e, var.name)), (num, den))
+        num2, den2 = map(lambda e: simplify(diff(e, var)), (num, den))
         out = check(num2, den2, var)
         if out is True:
             num, den = num2, den2
@@ -49,7 +52,7 @@ def lhospital2(eq, var):
     eq=  simplify(eq)
     if eq is None:
         return None
-    if not contain(eq, var):
+    if not contain(eq, tree_form(var)):
         return eq,[]
     num, dem = [simplify(item) for item in num_dem(eq)]
     if num is None or dem is None:
@@ -110,14 +113,15 @@ def approx(eq, var):
 def approx_limit(equation, var):
     return dowhile(equation, lambda x: approx(x, var))
 
-def limit(equation, var=tree_form("v_0")):
+def limit(equation, var="v_0"):
     logs = [(0,"lim x->0 "+printeq_str(simplify(equation)))]
-    eq2 = dowhile(replace(equation, var, tree_form("d_0")), lambda x: trig0(simplify(x)))
-    if eq2 is not None and not contain(equation, var):
+    eq2 = dowhile(replace(equation, tree_form(var), tree_form("d_0")), lambda x: trig0(simplify(x)))
+    if eq2 is not None and not contain(equation, tree_form(var)):
         return eq2,logs
+    
     equation, tmp = lhospital2(equation, var)
     equation = simplify(expand(simplify(equation)))
-    if not contain(equation, var):
+    if not contain(equation, tree_form(var)):
         return equation,logs+tmp
     '''
     if equation.name == "f_add":

{mathai-0.2.3 → mathai-0.2.5}/mathai/simplify.py

@@ -146,14 +146,17 @@ def solve(eq, specialfx=False):
     return dowhile(eq, _solve)
 def solve2(eq):
     return solve(eq, True)    
-def clear_div(eq):
+def clear_div(eq, denom=False):
     lst = factor_generation(eq)
     if tree_form("d_0") in lst:
         return tree_form("d_0")
     lst3 = [item for item in lst if "v_" not in str_form(item) and compute(item) < 0]
+    
     sign = True
     if len(lst3) % 2 == 1:
         sign = False
+    if denom:
+        return eq if sign else -eq, sign
     lst = [item for item in lst if not(item.name == "f_pow" and frac(item.children[1]) is not None and frac(item.children[1]) == -1)]
 
     lst2 = [item for item in lst if "v_" in str_form(item)]
@@ -168,7 +171,7 @@ def simplify(eq):
         return TreeNode(eq.name, [simplify(child) for child in eq.children])
         
     if eq.name in ["f_lt", "f_gt", "f_le", "f_ge", "f_eq"]:
-        tmp, sign = clear_div(simplify(eq.children[0]-eq.children[1]))
+        tmp, sign = clear_div(simplify(eq.children[0]-eq.children[1]), eq.name != "f_eq")
         name2 = eq.name
         if not sign:
             name2 = {"f_lt":"f_gt", "f_gt":"f_lt", "f_eq":"f_eq", "f_le":"f_ge", "f_ge":"f_le"}[name2]

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

@@ -262,9 +262,9 @@ def helper(eq, var="v_0"):
             out = inverse(item, vlist(item)[0])
             critical.append(out)
             if equ:
-                equal.append(str_form(out))
-    equal = list(set([simplify(tree_form(item)) for item in equal]))
-    more = list(set([simplify(tree_form(item)) for item in more]))
+                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]
     critical = Counter(critical)
     

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

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

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