Yes, running on pure python has the same issue (but overall only a factor 3
away):
i = 0
x = 1.0
while i < 10000000:
x *= 0.8
#x += 0.01
i += 1
print x
On Tue, Apr 26, 2011 at 1:44 PM, Philip Semanchuk <phi...@semanchuk.com>wrote:
>
> On Apr 26, 2011, at 1:34 PM, Mihai Badoiu wrote:
>
> > Already did. They suggested the python list, because the asm generated
> code
> > is really correct and the problem might be with the python running on
> top.
>
> Does the same timing in consistency appear when you use pure Python?
>
> bye
> Philip
>
>
> >
> > On Tue, Apr 26, 2011 at 1:04 PM, Chris Colbert <sccolb...@gmail.com>
> wrote:
> >
> >>
> >>
> >> On Tue, Apr 26, 2011 at 8:40 AM, Mihai Badoiu <mbad...@gmail.com>
> wrote:
> >>
> >>> Hi,
> >>>
> >>> I have terrible performance for multiplication when one number gets
> very
> >>> close to zero. I'm using cython by writing the following code:
> >>>
> >>>
> >> You should ask this question on the Cython users mailing list.
> >>
> >>
> > --
> > http://mail.python.org/mailman/listinfo/python-list
>
> --
> http://mail.python.org/mailman/listinfo/python-list
>
--
http://mail.python.org/mailman/listinfo/python-list
