#18109: Restructure IntegerListLex code
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jdemeyer/ticket/18109 | 9582a7a5248f609a2d2de02497b4b1d36d9dd96e
Dependencies: #18181, #18184 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nthiery):
Replying to [comment:47 vdelecroix]:
> A use case is in `MatrixSpace.__iter__` and I also have others intensive
usage for building so-called square tiled surfaces (if you care, look at
`u/vdelecroix/flat_surfaces-6.5`). I would be grateful if the iterator
could be accessible without initializing any parent.
Thanks for the feedback.
Do you mind running a concrete benchmark in one of those situations,
comparing a facade parent `IntegerListLex` and a non-parent
`IntegerListsLex` as provided by this ticket? Then we coud evaluate on
solid ground what the overhead actually is, and whether it's worth the
additional complexity?
--
Ticket URL: <http://trac.sagemath.org/ticket/18109#comment:49>
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.
