#19555: Implement a containment for cartesian_product
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Travis Scrimshaw | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/sets/contains_cartesian_product-19555|
6a440d55060e2a7debbed41b22990951d8a3c6a5
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by vdelecroix):
* status: needs_review => positive_review
* reviewer: => Vincent Delecroix
Comment:
Replying to [comment:19 tscrim]:
> As suggested in the parenthetical, if you wanted this to be a facade
parent for tuples, which is I think what you would end up with, then you
likely could just use `itertools`.
But itertools does not care about `rank`, `unrank`, `__contains__`. Python
iterators might not be rich enough.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/19555#comment:20>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
