ANN: parley 0.3

. Code samples, documentation, and source code can be found at the PARLEY home page: http://osl.cs.uiuc.edu/parley/ PARLEY is licensed under the LGPL. -- Jacob Lee <[EMAIL PROTECTED]> -- http://mail.python.org/mailman/listinfo/python-list

Re: Erlang style processes for Python

t;> to use either tasklets or threads. My next goal is to figure out I/O, at >> which point I get to tackle the fun question of distribution. >> >> So far, I've not run into any cases where I've wanted to change the >> interpreter, though I'd be intereste

Re: Erlang style processes for Python

only works with threads and doesn't communicate across processes. I definitely used Candygram as a reference point when determining what features to hoist from Erlang. -- Jacob Lee <[EMAIL PROTECTED]> -- http://mail.python.org/mailman/listinfo/python-list

ANN: parley 0.2

de samples, documentation, and source code can be found at the PARLEY home page: http://osl.cs.uiuc.edu/parley/ PARLEY is licensed under the LGPL. -- Jacob Lee <[EMAIL PROTECTED]> -- http://mail.python.org/mailman/listinfo/python-list

Re: Erlang style processes for Python

s within a single process, though one can choose to use either tasklets or threads. My next goal is to figure out I/O, at which point I get to tackle the fun question of distribution. So far, I've not run into any cases where I've wanted to change the interpreter, though I'd be interested in hearing ideas in this direction (especially with PyPy as such a tantalizing platform!). -- Jacob Lee <[EMAIL PROTECTED]> -- http://mail.python.org/mailman/listinfo/python-list

Host resolution problems with socket module

resentative of some lower-level subtlety (e.g. in the C libraries) that I'm unaware of? Has anyone else run into this before? -- Jacob Lee [EMAIL PROTECTED] | www.nearestneighbor.net -- http://mail.python.org/mailman/listinfo/python-list

Re: Grouping code by indentation - feature or ******?

llows you to set upper and lower bounds, and he combines this with for loops that usually start at one but don't always. I doubt he was trying to get this point across, but the lesson I've learned is to always start at zero and count to less than the length of the list (in c, the idi

Re: code for Computer Language Shootout

> > This is my shorter and faster version of Harmonic (I hope the use of > sum instead of the for is okay for the Shootout rules): > http://shootout.alioth.debian.org/benchmark.php?test=harmonic&lang=python&id=0&sort=fullcpu > > import sys > print sum(

Re: code for Computer Language Shootout

'TGVHCDM\nKNSYAAWBRTGVHCDMKNSYAAWBR')): seq = seq.translate(table)[::-1] for i in range(0, len(seq), 60): print seq[i:i+60] def main(): seq = [] for line in sys.stdin: if line[0] in ';>': show(''.join(seq)) print line, del seq[:] else: seq.append(line[:-1]) show(''.join(seq)) main() -- Jacob Lee [EMAIL PROTECTED] | www.nearestneighbor.net -- http://mail.python.org/mailman/listinfo/python-list

Re: code for Computer Language Shootout

uirements. What if your last line is less than 60 characters long? You no longer will be displaying the input in reverse order. Otherwise you'd be right - my solution would be unnecessarily unwieldy (and the problem would be much simpler...) . -- Jacob Lee [EMAIL PROTECTED] | www.nearestneighbor.net -- http://mail.python.org/mailman/listinfo/python-list

code for Computer Language Shootout

ode? By the way - is there a good way to find out the maximum memory a program used (in the manner of the "time" command)? Other than downloading and running the shootout benchmark scripts, of course. -- Jacob Lee [EMAIL PROTECTED] | www.nearestneighbor.net -- http://mail.python.org/mailman/listinfo/python-list