#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 | 0beb0422ac4482d67e670340ce7c26b2a927d916
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by git):
* commit: 1a1a6ccc6c1e731c2506cd527c7de6e331af4b0a =>
0beb0422ac4482d67e670340ce7c26b2a927d916
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=0beb0422ac4482d67e670340ce7c26b2a927d916
0beb042]||{{{trac #16352 more 'graded' in
root_lattice_realizations.py}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/16352#comment:31>
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.
