On Tue, May 01, 2007 at 10:28:08PM -0700, Michele Simionato wrote:
> >while i < n:
> >latest = (latest[1], latest[0] + latest[1])
> >yield # cooperative yield
> There is an infinite loop here!
Whoops. To much editing, not enough actual
[EMAIL PROTECTED] wrote:
> PEP: XXX
> Title: Standard Microthreading Pattern
You've reinvented Modula processes.
Except that Wirth did it better in Modula I.
John Nagle
--
http://mail.python.org/mailman/listinfo/python-list
On May 1, 10:58 pm, [EMAIL PROTECTED] wrote:
>def fibonacci(n):
>latest, i = (1, 1), 2
>if n < 1:
>raise ValueError# raise exception
>while i < n:
>latest = (latest[1], latest[0] + latest[1])
>yield
On Tue, May 01, 2007 at 08:34:39PM -0400, Terry Reedy wrote:
> Sounds like a good idea to me. Travis Oliphant has spent over a year on
> http://www.python.org/dev/peps/pep-3118/
> so array-making-using programs can better operate together. I hope you
> have the same patience and persistance.
I
<[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
Sounds like a good idea to me. Travis Oliphant has spent over a year on
http://www.python.org/dev/peps/pep-3118/
so array-making-using programs can better operate together. I hope you
have the same patience and persistance.
| .. [2]
On May 1, 3:58 pm, [EMAIL PROTECTED] wrote:
> I've been hacking away on this PEP for a while, and there has been some
> related discussion on python-dev that went into the PEP:
>
> http://mail.python.org/pipermail/python-dev/2007-February/070921.html
> http://mail.python.org/pipermail/python-dev/
