#8920: Factor code between words's alphabets and sets/enumerated sets/ordered
sets
------------------------------------------------------+---------------------
Reporter: hivert | Owner:
sage-combinat
Type: defect | Status:
needs_review
Priority: major | Milestone:
sage-5.7
Component: combinatorics | Resolution:
Keywords: Words, Sets, Cernay2012 | Work issues:
Report Upstream: N/A | Reviewers: Travis
Scrimshaw
Authors: Vincent Delecroix, Stepan Starosta | Merged in:
Dependencies: #13801 | Stopgaps:
------------------------------------------------------+---------------------
Description changed by vdelecroix:
Old description:
> Delete the different classes for alphabets (in
> sage.combinat.words.alphabet) and use the code of sets, enumerated sets
> and ordered sets. The classes sage.sets.FiniteEnumeratedSet and
> sage.sets.IntegerRange are slightly modified by the patch.
New description:
Create a class `TotallyOrderedFiniteSet` in sage.sets. Delete the
different classes for alphabets (in sage.combinat.words.alphabet) and use
the one in Sage (included the freshly created `TotallyOrderedFiniteSet`).
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8920#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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
