#16352: TransitiveIdeal -> RecursivelyEnumeratedSet in the sage library
-------------------------------------+-------------------------------------
Reporter: slabbe | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: sd66 | Merged in:
Authors: Sébastien Labbé | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/16352 | 1a1a6ccc6c1e731c2506cd527c7de6e331af4b0a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by chapoton):
I can now confirm that the each of the two remaining instances runs into
infinite loops
when given the 'graded' argument.
Therefore this ticket is good to go.
If you agree, set this to positive review.
--
Ticket URL: <http://trac.sagemath.org/ticket/16352#comment:25>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
