#16352: TransitiveIdeal -> RecursivelyEnumeratedSet in the sage library
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_work
Type: | Milestone: sage-6.6
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers: Vincent Delecroix
combinatorics | Work issues:
Keywords: sd66 | Commit:
Authors: | cecda3246fdbbf96cfb8461ee426dc9d079910ec
Sébastien Labbé | Stopgaps:
Report Upstream: N/A |
Branch: |
u/slabbe/16352 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by git):
* commit: 0832bbc90db342d49171de443e1de1bed839e02a =>
cecda3246fdbbf96cfb8461ee426dc9d079910ec
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=cecda3246fdbbf96cfb8461ee426dc9d079910ec
cecda32]||{{{Trac #16352: solving conflicts with 6.7.beta0 in
categories/finite_semigroups.py}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/16352#comment:16>
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.
