#13979: CartesianProduct.cardinality can't handle infinite sets
------------------------------------+---------------------------------------
Reporter: cnassau | Owner: sage-combinat
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.6
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Christian Nassau | Merged in:
Dependencies: | Stopgaps:
------------------------------------+---------------------------------------
Changes (by {'newvalue': u'Christian Nassau', 'oldvalue': ''}):
* author: => Christian Nassau
Old description:
> The following breaks:
>
> {{{#!python
> M=CombinatorialFreeModule(GF(3),Integers())
> N=tensor((M,))
> print N
> cartesian_product((N,N))
> Traceback (most recent call last):
> ...
> TypeError: len() of unsized object
> }}}
>
> The attach patch fixes this.
New description:
The following breaks:
{{{#!python
M=CombinatorialFreeModule(GF(3),Integers())
N=tensor((M,))
print N
cartesian_product((N,N))
Traceback (most recent call last):
...
TypeError: len() of unsized object
}}}
The attached patch fixes this.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13979#comment:2>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
