Eltype fix; use T[] for 0-polynomial; speed up LaurentPolynomial operations #487
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
more generic
T[]
for the coefficients of a 0 polynomial, notT[0]
, which requireszero(T)
. This led to some fixes on evaluation and changed some testshasone(T)
) allows a few other polynomial constructions to be displayedSpeedups
LaurentPolynomials.jl
package suggested performance problems with theLaurentPolynomial
type. New approaches for*
and+
were added. Also,gcdx
andpowermod
were borrowed from that package.ImmutablePolynomial
type