#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 | 6153cf8d39dc23cb41a3d0c2ea66ba5dc3abd2c0
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> This takes forever, even though the list trivially contains just one
element:
> {{{
> sage: IntegerListsLex(10^100, max_length=1).list()
> }}}
This answers a question I had about the first paragraph in the description
of this code
{{{
A combinatorial class `C` for integer lists satisfying certain
sum, length, upper/lower bound and regularity constraints. The
purpose of this tool is mostly to provide a Constant Amortized
Time iterator through these lists, in lexicographic order.
}}}
Could you remove the claim that this is a Constant Amortized Time
iterator? Jeroen's example illustrates that it is not one.
Thanks,
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:43>
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.
