#7580: bugs in infinite polynomial ring
--------------------------+-------------------------------------------------
Reporter: was | Owner: SimonKing
Type: defect | Status: needs_work
Priority: major | Milestone: sage-4.3.2
Component: algebra | Keywords: infinite polynomial ring coercion
Author: Simon King | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
--------------------------+-------------------------------------------------
Comment(by SimonKing):
Replying to [comment:34 cremona]:
> The new patch applies fine to 4.3.1, and *almost* all tests pass. (I
tested the whole Sage library):
As I explained above, the "unique key" in the ring constructor has
completely changed: It used to be a base ring plus the list of variable
names plus a descriptor of the monomial order and of the implementation
(dense vs. sparse); now, it is a ring plus a construction functor. I guess
this explains the error.
But there is a version number passed to the construction factory, in
addition to the unique key. Probably that allows to transform old pickles
into shiny new rings.
I did not know that there existed old pickles. Thank you for pointing it
out!
Best regards,
Simon
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:35>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
