#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 | 39d1993d70a837967109be12de261f4f504901cc
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nthiery):
Replying to [comment:45 jdemeyer]:
> Replying to [comment:8 nthiery]:
> > And we will reuse everything we can from your work!
>
> The following takes forever, which is a problem that I ''solved'' in
#17920, so I'm slightly disappointed this doesn't really work:
> {{{
> sage: IntegerListsLex(499499, length=1000, min_slope=1).list()
> }}}
Agreed. I am pretty sure that the lookahead could be improved to handle
this properly (Bryan: probably by doing some dichotomy in m_interval). I
am going to throw this in the examples as a reminder for further work on
this in later tickets.
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:97>
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.
