#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:
Report Upstream: N/A | Commit:
Branch: | 1a1fac1f7de8d5ae8d45138c594f7c8531024cbb
public/ticket/17979 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
I just finished reading the iterator part of that patch, and it looks
solid.
Just a couple of details:
- Shouldn't `i in ZZ` appear before the others in the following line ?
{{{return lambda i: l[i] if (i >= 0 and i < len(l) and i in ZZ) else
default}}}
- The documentation reads that `n` can be an iterable, but the code of
`__contains__` does not agree.
What features would be needed in this new version of `integer_list` to get
rid of the `_old` one? We would be better without it.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:117>
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.
