#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 | 17229c620b4aff47161b725de2ebb4f890cfc2af
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dkrenn):
Replying to [comment:12 ncohen]:
> The question remains, though: is there a reason to insist on Kantor
ordering, or would any other order do the job?
In #19048 it does not really (except from aesthetic aspects) matter (but
it has to deal with the finite case as well and it would be nice if then
all pairs would occur). But I use the same code in some other Sage
projects as well (not public (yet)), where it matters: There I need an
order my the sums of the indices, which is Cantor.
Thus having this tool in !SageMath would be great.
--
Ticket URL: <http://trac.sagemath.org/ticket/19319#comment:13>
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.
