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

solve bug in polynom with 0 and reduce

Browse Source
This commit is contained in:
Lafrite 2014-12-22 14:20:56 +01:00
parent 7498127e48
commit c35ca2f2a8
1 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
pymath/polynom.py
View File

@ -246,7 +246,7 @@ class Polynom(object):
coef_steps = [] coef_steps = []
if type(coef) == list: if type(coef) == list:
# On converti en postfix avec une addition # On converti en postfix avec une addition
postfix_add = self.postfix_add(coef) postfix_add = self.postfix_add([i for i in coef if i!=0])
# On converti en Expression # On converti en Expression
coef_exp = Expression(postfix_add) coef_exp = Expression(postfix_add)
@ -408,10 +408,15 @@ def test(p,q):
if __name__ == '__main__': if __name__ == '__main__':
from .fraction import Fraction #from .fraction import Fraction
#p = Polynom([1, -2 ]) p = Polynom([0, -2 ])
#q = Polynom([4, 7, 4]) q = Polynom([4, 0, 4])
#test(p,q) test(p,q)
print("\n")
p = Polynom([[1,0], [2,3,0]])
for i in p.simplify():
print(i)
#q = Polynom([0, Fraction(1,2), 0, Fraction(-4,3)]) #q = Polynom([0, Fraction(1,2), 0, Fraction(-4,3)])
#test(p,q) #test(p,q)
@ -420,9 +425,9 @@ if __name__ == '__main__':
#p = Polynom([-1,-2,-3]) #p = Polynom([-1,-2,-3])
#print(p) #print(p)
p = Polynom([-2]) #p = Polynom([-2])
q = Polynom([0,0,Fraction(1,2)]) #q = Polynom([0,0,Fraction(1,2)])
test(p,q) #test(p,q)
#p = Polynom([1, 1, 1 ]) #p = Polynom([1, 1, 1 ])
#print(p) #print(p)