a simple example of Stackless Python

[June Kim]

"Cameron Laird" <claird at starbase.neosoft.com> wrote in message
news:DAEAF4B05119C86F.FE16138511F8AD32.83B7222CAD0234D3 at lp.airnews.net...
> In article <8tjrn2$esm$1 at news.nuri.net>,
> June Kim <junaftnoon at nospamplzyahoo.com> wrote:
> >def looptest(n):
> >    this = continuation.current()
> >    k = this.update(n)
> >      # continuation at "="
> >    if k:
> >        this(k-1)
> >        # resuming at "="
> >    else:
> >        del this.link
> >
> >Above is a simple example of continuation from Christian Tismer's
> >paper. (http://www.stackless.com/spcpaper.htm)
> >It seems like there are few people who understand Stackless Python
> >and the stuffs, and I'm not one of them. Can anyone explain me
> >this simple code? The paper was not very helpful for me to understand.
> >(esp, what does "this.update" do, and where does it mean exactly
> >by "at ="?)
> .
> .
> .
> Does <URL:http://
> www.oreillynet.com/pub/a/python/2000/10/11/stackless-programming.html>
> help?  In any case, I'm planning an upgrade to

I tried it before, but it wasn't much of help ; for those who are not from
the Scheme background, it's so hard to get the exact picture of the concept.

> <URL:http://starbase.neosoft.com/~claird/comp.lang.python/stackless.html>
> for late this week that aims to help with exactly
> this question.

Great. I'm really looking forward to reading it.
Thanks.

Best regards,

June