#17979: Reimplementation of IntegerListsLex
-------------------------------------+-------------------------------------
Reporter: aschilling | Owner:
Type: defect | Status: needs_work
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: days64 | Merged in:
Authors: Bryan Gillespie, | Reviewers:
Anne Schilling, Nicolas M. Thiery | Work issues: support n in an
Report Upstream: N/A | iterable
Branch: | Commit:
public/ticket/17979 | cb18ced22db714063e744bb907a035b4fe3afa24
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by bgillespie):
Replying to [comment:59 jdemeyer]:
> What's the point of setting `self.floor_type` if you don't use it?
I have plans to use it in an upcoming update which determines, in cases
where a user doesn't specify custom functions, whether the set is
finite/infinite, and if it can be enumerated in Lex ordering. (In
particular this will be useful for properly setting the Category of the
object, which currently defaults to `FiniteEnumeratedSets`.
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:77>
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.
