#18411: get rid of CartesianProduct
-------------------------+-------------------------------------------------
Reporter: | Owner:
vdelecroix | Status: needs_work
Type: | Milestone: sage-6.7
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 8a5ca0185dc3d46b7c62429b3d60ccccb485c0c4
Vincent Delecroix | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18411 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by vdelecroix):
* status: needs_review => needs_work
Old description:
> The features of `sage.combinat.cartesian_product.CartesianProduct` are
> now completely integrated into the category framework (see #18290). We
> remove most occurrences of `CartesianProduct` to either
> `cartesian_product` or `itertools.product`.
>
> We also:
> - move the `__iter__` from
> `EnumeratedSets.CartesianProducts.ParentMethods` category to `Sets`
> - allows `cartesian_product` to be called with `list`, `tuple`, `set`,
> `frozenset`
> - introduce a function `bounded_number_of_tuples` in `sage.misc.misc`
> that is intensively used in the testing framework
> - refine the category of `Set([1,2,3])` to be finite
> - implement a (very naive) `random_element` for `Set([1,2,3])`
>
> follow up: #19192
New description:
The features of `sage.combinat.cartesian_product.CartesianProduct` are now
completely integrated into the category framework (see #18290). We remove
all occurrences of `CartesianProduct` to either `cartesian_product` or
`itertools.product`. We also deprecate the `CartesianProduct` from
`sage.combinat.cartesian_product`.
In order to support all features of the old class we also:
- move the `__iter__` from
`EnumeratedSets.CartesianProducts.ParentMethods` category to `Sets`
- allows `cartesian_product` to be called with `list`, `tuple`, `set`,
`frozenset`
- introduce a function `bounded_number_of_tuples` in `sage.misc.misc`
that is intensively used in the testing framework
- refine the category of `Set([1,2,3])` to be finite
- implement a (very naive) `random_element` for `Set([1,2,3])`
follow up: #19192
--
Comment:
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=af2c289346678ff7772a005b19881b81a3ac1d56
af2c289]||{{{Trac 18411: use cartesian_product in
CombinatorialFreeModule}}}||
||[http://git.sagemath.org/sage.git/commit/?id=8a5ca0185dc3d46b7c62429b3d60ccccb485c0c4
8a5ca01]||{{{Trac 18411: remove two final occurrences}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/18411#comment:17>
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.
