author | Alberto Bertogli
<albertito@blitiri.com.ar> 2008-10-24 03:59:04 UTC |
committer | Alberto Bertogli
<albertito@blitiri.com.ar> 2008-10-24 03:59:04 UTC |
parent | 6d7683db3da5aa79d23e693c61f269fd92fd11a4 |
pfunctional.py | +5 | -6 |
diff --git a/pfunctional.py b/pfunctional.py index 95e3603..cf2222a 100644 --- a/pfunctional.py +++ b/pfunctional.py @@ -1,16 +1,15 @@ """ -Paralell implementation of some functional functions +Parallel implementation of some functional functions Alberto Bertogli (albertito@blitiri.com.ar) ---------------------------------------------------- The functions work by partitioning the sequence passed to them, and running -the function over the items of each part in paralell. The number of threads to +the function over the items of each part in parallel. The number of threads to use is determined by the 'workers' parameter, which defaults to 2. - Be aware that due to Python's internal threading implementation, purely CPU -bound paralell runs are probably not going to run faster than sequential runs. +bound parallel runs are probably not going to run faster than sequential runs. Google for "GIL" (as in Global Interpreter Lock) for more information. """ @@ -65,7 +64,7 @@ class Holder (object): def pmap(func, seq, workers = 2): """pmap(function, sequence, workers = 2) -> generator - This is a paralell version of map(). It takes a function and a + This is a parallel version of map(). It takes a function and a sequence, and returns a generator over the results. """ @@ -95,7 +94,7 @@ def pmap(func, seq, workers = 2): def pfilter(func, seq, workers = 2): """filter(function or None, sequence) -> generator - This is a paralell version of filter(). It takes a function (or None) + This is a parallel version of filter(). It takes a function (or None) and a sequence, and returns a generator over the results. """ # we use the same code structure than pmap