#19319: iterator over pairs on diagonals a la Cantor pairing
-------------------------------------+-------------------------------------
Reporter: dkrenn | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: misc | Resolution:
Keywords: | Merged in:
Authors: Daniel Krenn | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dkrenn/product_cantor_pairing | 70185c3a13f573cf1eacbec2eb2122082e6c375f
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dkrenn):
Replying to [comment:17 cheuberg]:
> A few comments on Daniel's code:
> 1. Does not terminate if `A` is empty and `B` is infinite, thus I'd
simply try to yield A[0], B[0] initially and then start `s` at `1`.
> 2. `try:` `except:` block in `iter_as_list` can be removed
Both changed.
--
Ticket URL: <http://trac.sagemath.org/ticket/19319#comment:19>
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.
