Parse and mul functions#6
Conversation
|
ok, sorry I had exams so did't have time to properly look at this. This only test that now fails is Would be happy to extend the test suit to properly test infinite values if you are happy with the new behaviour. |
|
I like your pull request and I think I'm happy with the change. The question I'm still struggling with is how we should represent complex infinity. I think INF/INF isn't the best implementation for that. What do you think? From my perspective, it's totally fine to make How does make any difference? Am I missing something? |
INF/INF
|
INF/INF
i*InfinityMakes sense ParsingMakes sense. Could you please add a small comment on the reasoning to the code? |
|
At the moment 0/INF represents imaginary infinity.
Values like As far as I can tell, most functions do handle it correctly. Trig is tricky. |
|
I have entirely re-written the mul function. Now:
|
|
This is pretty nice! Thanks for the heavy work on this subject. I really like the current version :) |
A possible solution to multiplication of infinite numbers and extensions to the parse function to support infinity better.
See issue #5