Robert Bradshaw wrote:
> On Mar 21, 2009, at 9:06 AM, Jason Bandlow wrote:
>
>> Hi all,
>>
>> Is the following missing coercion known? I couldn't find anything on
>> trac, but there's a lot there related to coercion, so I may have
>> missed it.
>>
>> sage: a = float(1.0)
>> sage: QQ(
On Mar 21, 2009, at 9:06 AM, Jason Bandlow wrote:
>
> Hi all,
>
> Is the following missing coercion known? I couldn't find anything on
> trac, but there's a lot there related to coercion, so I may have
> missed it.
>
> sage: a = float(1.0)
> sage: QQ(a)
> TypeError: Unable to
On Mon, Jun 2, 2008 at 7:18 PM, Robert Bradshaw
<[EMAIL PROTECTED]> wrote:
>
> On Jun 2, 2008, at 6:43 PM, Mike Hansen wrote:
>
>> Hello,
>>
>> This is definitely not a problem with coercion -- it's a problem with
>> the iterator for G.
>
> Coercion...always the scapegoat :-)
>
I made several opt
On Jun 2, 2008, at 6:43 PM, Mike Hansen wrote:
> Hello,
>
> This is definitely not a problem with coercion -- it's a problem with
> the iterator for G.
Coercion...always the scapegoat :-)
- Robert
--~--~-~--~~~---~--~~
To post to this group, send email to sage-
On Jun 3, 3:49 am, "David Joyner" <[EMAIL PROTECTED]> wrote:
Hi,
> Thanks. I reported this ashttp://trac.sagemath.org/sage_trac/ticket/3353
prun indicates that we are calling GAP in z.next() somewhere, so due
to pexpect overhead this also should suck. "prun z.next()" took *35*
CPU seconds on s
Thanks. I reported this as http://trac.sagemath.org/sage_trac/ticket/3353
On Mon, Jun 2, 2008 at 9:43 PM, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> Hello,
>
> This is definitely not a problem with coercion -- it's a problem with
> the iterator for G. For example. try this:
>
> sage: z = iter(G
Hello,
This is definitely not a problem with coercion -- it's a problem with
the iterator for G. For example. try this:
sage: z = iter(G)
sage: z
sage: z.next()
[0 1]
[1 0]
sage: z.next()
[0 1]
[1 1]
It takes quite a bit of time to do each .next() which makes me suspect
that something silly i
