Mailman 3 September 2009 - pypy-dev

Re: [pypy-dev] Improving the pypy website (and benchmarks)
by Laura Creighton 28 Sep '09

28 Sep '09

In a message of Mon, 28 Sep 2009 14:23:16 +0200, Laura Creighton writes: >In a message of Mon, 28 Sep 2009 11:22:35 +0200, Miquel Torres writes: > >>We should definitely have a chat "meeting", with those interested in an >e >>nd >>user's web page. >>Time? >> >>Miquel > >I am interested and I am pretty flexible about time, though >_not this week, please_ (new product release, unrelated to >PyPy on Thursday). > >Laura Well, if tomorrow is what people want, I can sort of be there at 9.30 tomorrow. Bea cannot, she is teaching in Stockholm at the time. And I expect to be way distracted by other things tomorrow. Laura

1 0

Re: [pypy-dev] Improving the pypy website (and benchmarks)
by Laura Creighton 28 Sep '09

28 Sep '09

In a message of Mon, 28 Sep 2009 11:22:35 +0200, Miquel Torres writes: >We should definitely have a chat "meeting", with those interested in an e >nd >user's web page. >Time? > >Miquel I am interested and I am pretty flexible about time, though _not this week, please_ (new product release, unrelated to PyPy on Thursday). Laura

1 0

Improving the pypy website (and benchmarks)
by Miquel Torres 28 Sep '09

28 Sep '09

Hi, this is my first post on the pypy-dev mailing list. I've commented on the pypy blog, and was encouraged by fijal to continue here. My daily job involves some web coding (HTML, javascript, Django...), python coding (frameworks, scipts), usability analysis, and opensource project management among other tasks, so I have some ideas on how to improve pypy's website, as well as the project's visibility. I find the pypy project extremely interesting (and important!), and I think that once a version of the JIT gets into a release the project will get a lot more attention. There are two things I want to discuss: One is improving pypy's main website. While the current site has served its purpose, it is mostly a pypy developers site. Better structure and navigation would be desirable when pypy becomes popular among mainstream python developers. So there are two options: to keep the current http://codespeak.net/pypy/dist/pypy/doc/index.html site for developers and develop a new www.pypy.org site, or improve the current one. The tasks to perform would be: - Agree on a new website or keeping and improving the current one - Choose a CMS (or hand-code or whatever) to craft the website - Define a navigation menu with key areas (about, download, news, roadmap, benchmarks, developement...) - Visual design - Code ;.) I can help with some (or all) of these tasks. Another matter are benchmarks. Because it is the project's most visible "feature" or "result", it would be great to publish a set of benchmarks so that python users can keep track of performance across different versions (cpython 2.6 vs pypy1.1, Jython, etc...). That way they can keep track of performance improvements as well as decide when it becomes attractive for them to make the switch from cpython. It would be the best advertisement for the project. The best case would be if you internally perform performance test to prevent performance regression on new releases, and that same data could be also be automatically published on the web, in the dev pages during development, and .in the "public" pages for final releases. So the tasks here would be: - Define a set of standard benchmarks that will serve as performance tests for every new release (including alphas and betas) - Create a script that gathers all the data for developers to analyse and spot performance regressions and bugs AND outputs the data in such a way that it can be automatically published on the website (so no extra maintenance workload) - Code the web page that beautifully shows the data in a suitable format (tables, graphs) I have recently done some work on dynamic javascript (or python) plotting, so I can take care of the last part relatively easily. I could also help with the second task. So I leave it there for you to discuss. What do you think of it all? Cheers, Miquel

5 11

new tool I hadn't seen before for realtime collaboration of text documents
by Laura Creighton 25 Sep '09

25 Sep '09

http://etherpad.com/ Could possibly be useful in the future, especially if we want to collaborate writing docs with people who don't have a codespeak account. Laura

2 1

PyPy Sprint Announcement, Duesseldorf 6 Nov- 13 Nov
by Carl Friedrich 24 Sep '09

24 Sep '09

Düsseldorf PyPy sprint November 6 - November 13 2009 ===================================================== The next PyPy sprint will be held in the Computer Science department of Heinrich-Heine Universität Düsseldorf from the 6th to the 13th of November 2009. This is a fully public sprint, everyone is welcome to join us. Topics and goals ---------------- At the sprint we intend to work on the JIT generator in PyPy and on applying it to PyPy Python interpreter. The precise work that will be done is not fixed, as we don't know in which state the JIT will be in November. However, possible areas of work might include: - tweaking the interpreter/objspace to be more JIT-friendly, e.g. instance implementation code, call code - if there is interest starting non x86-32 JIT backends - trying out existing software to find features where the optimizations of the JIT could be improved - improving our benchmarking infrastructure We will give special priority to topics that "non-core" people find interesting (as long as they are somehow JIT-related). For an introduction of how our JIT-generation process works, please refer to our blog: http://morepypy.blogspot.com/2009/03/jit-bit-of-look-inside.html There is also a more dense academic paper about the subject: http://codespeak.net/svn/pypy/extradoc/talk/icooolps2009/bolz-tracing-jit-f… Location -------- The sprint will take place in a seminar room of the computer science department. It is in the building 25.12 of the university campus. For travel instructions see http://stups.cs.uni-duesseldorf.de/anreise/esbahn.php Registration ------------ If you'd like to come, please subscribe to the `pypy-sprint mailing list`_ and drop a note about your interests and post any questions. More organisational information will be send to that list. We'll keep a list of `people`_ which we'll update (which you can do so yourself if you have codespeak commit rights). .. _`pypy-sprint mailing list`: http://codespeak.net/mailman/listinfo/pypy-sprint .. _`people`: http://codespeak.net/pypy/extradoc/sprintinfo/ddorf2009/people.txt

1 0

ANN: psyco V2
by Christian Tismer 15 Sep '09

15 Sep '09

Announcing Psyco V2 source release ---------------------------------- This is the long awaited announcement of Psyco V2. Psyco V2 is a continuation of the well-known psyco project, which was called finished and was dis-continued by its author Armin Rigo in 2005, in favor of the PyPy project. This is a new project, using Psyco's code base with permission of Armin. Questions and complaints should go to me (tismer(a)stackless.com) or the mailing list (psyco-devel(a)lists.sourceforge.net); Armin is explicitly not in charge of (t)his project any longer! As one of the founders and an active member of the PyPy project, I was very happy to be invited to work on Psyco V2, by FATTOC, LLC. Psyco V2 tries to extend on the original Psyco approach "an extension module that just makes Python faster". Psyco is a just-in-time compiler that accelerates arbitrary Python code by specialization. We believe that Psyco's approach can be carried out much further than it was tried so far, when it's first version was abandoned. This first V2 release is source-only. There is no web-site, yet, and there are no binaries for download. These will be available in a few days on http://www.psyco.org . For the time being, please stick with subversion access, building the extension module from source code. The repository is here: http://codespeak.net/svn/psyco/v2/dist Check-out the repository, and run the setup.py script, given that you have access to a C compiler. Psyco V2 will run on X86 based 32 bit Linux, 32 bit Windows, and Mac OS X. Psyco is not supporting 64 bit, yet. But it is well being considered. The current improvements are, shortly: - Support for Python 2.4, 2.5 and 2.6 - a lot of new builtins - generators, fast and fully supported. More information is coming soon on http://www.psyco.org . This is the beginning of a series of new Psyco versions. Many more improvements are prepared and about to be published, soon, starting with the current version 2.0.0 . Stay tuned, this is just the beginning of psyco's re-birth! For questions about Psyco V2, please join the mailing list psyco-devel(a)lists.sourceforge.net or contact me on IRC: #psyco on irc.freenode.net . Psyco V2 is fundamentally supported by FATTOC, LLC. See http://www.fattoc.com . Without their continuous support, this work would not have been possible at all. I wish to express my deepest thanks to FATTOC, for allowing me to continue on Psyco with all the energy that this ambitious project needs, and will need. Further special thanks are going to Armin Rigo, John Benediktsson, David Salomon, Miki Tebeka, Raymond Hettinger, Fabrizio Milo, Michael Foord, Dinu Gherman, Stephan Diehl, Laura Creighton and Andrea Tismer, for all the support and discussions. Looking forward to a great future of Psyco! July 17, 2009 -- Christian Tismer :^) <mailto:tismer@stackless.com> tismerysoft GmbH : Have a break! Take a ride on Python's Johannes-Niemeyer-Weg 9A : *Starship* http://starship.python.net/ 14109 Berlin : PGP key -> http://wwwkeys.pgp.net/ work +49 30 802 86 56 mobile +49 173 24 18 776 fax +49 30 80 90 57 05 PGP 0x57F3BF04 9064 F4E1 D754 C2FF 1619 305B C09C 5A3B 57F3 BF04 whom do you want to sponsor today? http://www.stackless.com/

3 2

Grand Central like multiprocessing?
by Florian Schulze 15 Sep '09

15 Sep '09

Hi! I wondered whether it would make sense to have multiprocessing implemented the way Grand Central from Apple is done. With the 'with' statement this could be very nicely supported in Python and would make it very easy to use. If PyPy supported something like this and could take advantage of the OS level on OS X 10.6 and maybe future implementations of similar technology on other OSes then Python could get another boost, for example in the scientific and super computing communities. Thoughts? Regards, Florian Schulze

2 1

Re: [pypy-dev] [pypy-svn] r67547 - pypy/trunk/pypy/module/__builtin__
by Samuele Pedroni 07 Sep '09

07 Sep '09

this broke the pickling of enumerate: http://codespeak.net:8099/summary/longrepr?testname=AppTestInterpObjectPick… I suppose reversed should to be pickable too. benjamin(a)codespeak.net wrote: > Author: benjamin > Date: Sun Sep 6 22:28:16 2009 > New Revision: 67547 > > Modified: > pypy/trunk/pypy/module/__builtin__/__init__.py > pypy/trunk/pypy/module/__builtin__/app_functional.py > pypy/trunk/pypy/module/__builtin__/functional.py > Log: > reimplement min, max, reduce, sum, filter, map, zip, enumerate, and reversed on > the interp level for speed > > > Modified: pypy/trunk/pypy/module/__builtin__/__init__.py > ============================================================================== > --- pypy/trunk/pypy/module/__builtin__/__init__.py (original) > +++ pypy/trunk/pypy/module/__builtin__/__init__.py Sun Sep 6 22:28:16 2009 > @@ -27,23 +27,11 @@ > 'raw_input' : 'app_io.raw_input', > 'input' : 'app_io.input', > > - 'sum' : 'app_functional.sum', > 'apply' : 'app_functional.apply', > - 'map' : 'app_functional.map', > - 'filter' : 'app_functional.filter', > - 'zip' : 'app_functional.zip', > - 'reduce' : 'app_functional.reduce', > #'range' : 'app_functional.range', > # redirected to functional.py, applevel version > # is still needed and should stay where it is. > - 'min' : 'app_functional.min', > - 'max' : 'app_functional.max', > - 'enumerate' : 'app_functional.enumerate', > 'sorted' : 'app_functional.sorted', > - 'reversed' : 'app_functional.reversed', > - '_install_pickle_support_for_reversed_iterator': > - 'app_functional._install_pickle_support_for_reversed_iterator', > - > 'globals' : 'app_inspect.globals', > 'locals' : 'app_inspect.locals', > 'vars' : 'app_inspect.vars', > @@ -106,8 +94,17 @@ > > 'range' : 'functional.range_int', > 'xrange' : 'functional.W_XRange', > + 'enumerate' : 'functional.W_Enumerate', > 'all' : 'functional.all', > 'any' : 'functional.any', > + 'min' : 'functional.min', > + 'max' : 'functional.max', > + 'sum' : 'functional.sum', > + 'map' : 'functional.map', > + 'zip' : 'functional.zip', > + 'reduce' : 'functional.reduce', > + 'reversed' : 'functional.reversed', > + 'filter' : 'functional.filter', > 'super' : 'descriptor.W_Super', > 'staticmethod' : 'descriptor.StaticMethod', > 'classmethod' : 'descriptor.ClassMethod', > > Modified: pypy/trunk/pypy/module/__builtin__/app_functional.py > ============================================================================== > --- pypy/trunk/pypy/module/__builtin__/app_functional.py (original) > +++ pypy/trunk/pypy/module/__builtin__/app_functional.py Sun Sep 6 22:28:16 2009 > @@ -3,151 +3,12 @@ > functional programming. > """ > > - > -def sum(sequence, total=0): > - """sum(sequence, start=0) -> value > - > -Returns the sum of a sequence of numbers (NOT strings) plus the value > -of parameter 'start'. When the sequence is empty, returns start.""" > - # must forbid "summing" strings, per specs of built-in 'sum' > - if isinstance(total, str): raise TypeError > - for item in sequence: > - total = total + item > - return total > - > # ____________________________________________________________ > > def apply(function, args=(), kwds={}): > """call a function (or other callable object) and return its result""" > return function(*args, **kwds) > > -def map(function, *collections): > - """does 3 separate things, hence this enormous docstring. > - 1. if function is None, return a list of tuples, each with one > - item from each collection. If the collections have different > - lengths, shorter ones are padded with None. > - > - 2. if function is not None, and there is only one collection, > - apply function to every item in the collection and return a > - list of the results. > - > - 3. if function is not None, and there are several collections, > - repeatedly call the function with one argument from each > - collection. If the collections have different lengths, > - shorter ones are padded with None > - """ > - > - if len(collections) == 0: > - raise TypeError, "map() requires at least one sequence" > - > - if len(collections) == 1: > - #it's the most common case, so make it faster > - if function is None: > - return list(collections[0]) > - return [function(x) for x in collections[0]] > - > - iterators = [ iter(collection) for collection in collections ] > - res = [] > - while 1: > - cont = False #is any collection not empty? > - args = [] > - for iterator in iterators: > - try: > - elem = iterator.next() > - cont = True > - except StopIteration: > - elem = None > - args.append(elem) > - if cont: > - if function is None: > - res.append(tuple(args)) > - else: > - res.append(function(*args)) > - else: > - return res > - > -def filterstring(function, collection, str_type): > - if function is None and type(collection) is str_type: > - return collection > - res = [] > - for i in xrange(len(collection)): > - c = collection[i] > - if function is None or function(c): > - if not isinstance(c, str_type): > - raise TypeError("can't filter %s to %s: __getitem__ returned different type", str_type.__name__, str_type.__name__) > - res.append(c) > - return str_type().join(res) > - > -def filtertuple(function, collection): > - if function is None: > - function = bool > - res = [] > - for i in xrange(len(collection)): > - c = collection[i] > - if function(c): > - res.append(c) > - return tuple(res) > - > -def filter(function, collection): > - """construct a list of those elements of collection for which function > - is True. If function is None, then return the items in the sequence > - which are True.""" > - if isinstance(collection, str): > - return filterstring(function, collection, str) > - elif isinstance(collection, unicode): > - return filterstring(function, collection, unicode) > - elif isinstance(collection, tuple): > - return filtertuple(function, collection) > - > - if function is None: > - return [item for item in collection if item] > - else: > - return [item for item in collection if function(item)] > - > -def zip(*collections): > - """return a list of tuples, where the nth tuple contains every > - nth item of each collection. If the collections have different > - lengths, zip returns a list as long as the shortest collection, > - ignoring the trailing items in the other collections.""" > - > - if len(collections) == 0: > - import sys > - if sys.version_info < (2,4): > - raise TypeError("zip() requires at least one sequence") > - return [] > - res = [] > - iterators = [ iter(collection) for collection in collections ] > - while 1: > - try: > - elems = [] > - for iterator in iterators: > - elems.append(iterator.next()) > - res.append(tuple(elems)) > - except StopIteration: > - return res > - > -def reduce(function, seq, *initialt): > - """ Apply function of two arguments cumulatively to the items of > - sequence, from left to right, so as to reduce the sequence to a > - single value. Optionally begin with an initial value.""" > - > - seqiter = iter(seq) > - if initialt: > - initial, = initialt > - else: > - try: > - initial = seqiter.next() > - except StopIteration: > - raise TypeError, "reduce() of empty sequence with no initial value" > - while 1: > - try: > - arg = seqiter.next() > - except StopIteration: > - break > - initial = function(initial, arg) > - > - return initial > - > # ____________________________________________________________ > > """ > @@ -206,135 +67,10 @@ > > # ____________________________________________________________ > > - > -def _identity(arg): > - return arg > - > - > -def min(*arr, **kwargs): > - """return the smallest number in a list, > - or its smallest argument if more than one is given.""" > - from operator import gt > - > - return min_max(gt, "min", *arr, **kwargs) > - > -def min_max(comp, funcname, *arr, **kwargs): > - key = kwargs.pop("key", _identity) > - if len(kwargs): > - raise TypeError, '%s() got an unexpected keyword argument' % funcname > - > - if not arr: > - raise TypeError, '%s() takes at least one argument' % funcname > - > - if len(arr) == 1: > - arr = arr[0] > - > - iterator = iter(arr) > - try: > - min_max_val = iterator.next() > - except StopIteration: > - raise ValueError, '%s() arg is an empty sequence' % funcname > - > - keyed_min_max_val = key(min_max_val) > - > - for i in iterator: > - keyed = key(i) > - if comp(keyed_min_max_val, keyed): > - min_max_val = i > - keyed_min_max_val = keyed > - return min_max_val > - > -def max(*arr, **kwargs): > - """return the largest number in a list, > - or its largest argument if more than one is given.""" > - from operator import lt > - > - return min_max(lt, "max", *arr, **kwargs) > - > -class enumerate(object): > - """enumerate(iterable) -> iterator for (index, value) of iterable. > - > -Return an enumerate object. iterable must be an other object that supports > -iteration. The enumerate object yields pairs containing a count (from > -zero) and a value yielded by the iterable argument. enumerate is useful > -for obtaining an indexed list: (0, seq[0]), (1, seq[1]), (2, seq[2]), ...""" > - > - def __init__(self, collection): > - self._iter = iter(collection) > - self._index = 0 > - > - def next(self): > - try: > - next = self._iter.next > - except AttributeError: > - # CPython raises a TypeError when next() is not defined > - raise TypeError('%s object has no next() method' % > - (type(self._iter).__name__,)) > - result = self._index, next() > - self._index += 1 > - return result > - > - def __iter__(self): > - return self > - > - > -# ____________________________________________________________ > - > def sorted(lst, cmp=None, key=None, reverse=None): > "sorted(iterable, cmp=None, key=None, reverse=False) --> new sorted list" > sorted_lst = list(lst) > sorted_lst.sort(cmp, key, reverse) > return sorted_lst > > -def reversed(sequence): > - "reversed(sequence) -> reverse iterator over values of the sequence" > - if hasattr(sequence, '__reversed__'): > - return sequence.__reversed__() > - if not hasattr(sequence, '__getitem__'): > - raise TypeError("argument to reversed() must be a sequence") > - return reversed_iterator(sequence) > - > - > -class reversed_iterator(object): > - > - def __init__(self, seq): > - self.seq = seq > - self.remaining = len(seq) > - > - def __iter__(self): > - return self > - > - def next(self): > - if self.remaining > len(self.seq): > - self.remaining = 0 > - i = self.remaining > - if i > 0: > - i -= 1 > - item = self.seq[i] > - self.remaining = i > - return item > - raise StopIteration > - > -# XXX __length_hint__() > -## def __len__(self): > -## if self.remaining > len(self.seq): > -## self.remaining = 0 > -## return self.remaining > - > - def __reduce__(self): > - tup = (self.seq, self.remaining) > - return (make_reversed_iterator, tup) > - > -def make_reversed_iterator(seq, remaining): > - ri = reversed_iterator.__new__(reversed_iterator) > - ri.seq = seq > - #or "ri = reversed_iterator(seq)" but that executes len(seq) > - ri.remaining = remaining > - return ri > - > -def _install_pickle_support_for_reversed_iterator(): > - import _pickle_support > - make_reversed_iterator.__module__ = '_pickle_support' > - _pickle_support.make_reversed_iterator = make_reversed_iterator > - > > > Modified: pypy/trunk/pypy/module/__builtin__/functional.py > ============================================================================== > --- pypy/trunk/pypy/module/__builtin__/functional.py (original) > +++ pypy/trunk/pypy/module/__builtin__/functional.py Sun Sep 6 22:28:16 2009 > @@ -8,7 +8,9 @@ > from pypy.interpreter.gateway import interp2app > from pypy.interpreter.typedef import TypeDef > from pypy.interpreter.baseobjspace import Wrappable > +from pypy.interpreter.argument import Arguments > from pypy.rlib.rarithmetic import r_uint, intmask > +from pypy.rlib.objectmodel import specialize > from pypy.module.__builtin__.app_functional import range as app_range > from inspect import getsource, getfile > > @@ -100,7 +102,244 @@ > return W_ListMultiObject(space, impl) > > > +(a)specialize.arg(2) > +def min_max(space, arguments, implementation_of): > + if implementation_of == "max": > + compare = space.gt > + else: > + compare = space.lt > + args, kwargs = arguments.unpack() > + if len(args) > 1: > + w_sequence = space.newtuple(args) > + elif len(args): > + w_sequence = args[0] > + else: > + msg = "%s() expects at least one argument" % (implementation_of,) > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + try: > + w_key = kwargs["key"] > + except KeyError: > + w_key = None > + else: > + del kwargs["key"] > + if kwargs: > + msg = "%s() got unexpected keyword argument" % (implementation_of,) > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + w_iter = space.iter(w_sequence) > + w_max_item = None > + w_max_val = None > + while True: > + try: > + w_item = space.next(w_iter) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + break > + if w_key is not None: > + w_compare_with = space.call_function(w_key, w_item) > + else: > + w_compare_with = w_item > + if w_max_item is None or \ > + space.is_true(compare(w_compare_with, w_max_val)): > + w_max_item = w_item > + w_max_val = w_compare_with > + if w_max_item is None: > + msg = "arg is an empty sequence" > + raise OperationError(space.w_ValueError, space.wrap(msg)) > + return w_max_item > > +def max(space, __args__): > + """Return the largest item in a sequence. > + > + If more than one argument is passed, return the maximum of them. > + """ > + return min_max(space, __args__, "max") > +max.unwrap_spec = [ObjSpace, Arguments] > + > +def min(space, __args__): > + """Return the smallest item in a sequence. > + > + If more than one argument is passed, return the minimum of them. > + """ > + return min_max(space, __args__, "min") > +min.unwrap_spec = [ObjSpace, Arguments] > + > +def map(space, w_func, collections_w): > + """does 3 separate things, hence this enormous docstring. > + 1. if function is None, return a list of tuples, each with one > + item from each collection. If the collections have different > + lengths, shorter ones are padded with None. > + > + 2. if function is not None, and there is only one collection, > + apply function to every item in the collection and return a > + list of the results. > + > + 3. if function is not None, and there are several collections, > + repeatedly call the function with one argument from each > + collection. If the collections have different lengths, > + shorter ones are padded with None > + """ > + if not collections_w: > + msg = "map() requires at least two arguments" > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + num_collections = len(collections_w) > + none_func = space.is_w(w_func, space.w_None) > + if none_func and num_collections == 1: > + return space.call_function(space.w_list, collections_w[0]) > + result_w = [] > + iterators_w = [space.iter(w_seq) for w_seq in collections_w] > + num_iterators = len(iterators_w) > + while True: > + cont = False > + args_w = [space.w_None] * num_iterators > + for i in range(len(iterators_w)): > + try: > + args_w[i] = space.next(iterators_w[i]) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + else: > + cont = True > + w_args = space.newtuple(args_w) > + if cont: > + if none_func: > + result_w.append(w_args) > + else: > + w_res = space.call(w_func, w_args) > + result_w.append(w_res) > + else: > + return space.newlist(result_w) > +map.unwrap_spec = [ObjSpace, W_Root, "args_w"] > + > +def sum(space, w_sequence, w_start=None): > + if space.is_w(w_start, space.w_None): > + w_start = space.wrap(0) > + elif space.is_true(space.isinstance(w_start, space.w_basestring)): > + msg = "sum() can't sum strings" > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + w_iter = space.iter(w_sequence) > + w_last = w_start > + while True: > + try: > + w_next = space.next(w_iter) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + break > + w_last = space.add(w_last, w_next) > + return w_last > +sum.unwrap_spec = [ObjSpace, W_Root, W_Root] > + > +def zip(space, sequences_w): > + """Return a list of tuples, where the nth tuple contains every nth item of > + each collection. > + > + If the collections have different lengths, zip returns a list as long as the > + shortest collection, ignoring the trailing items in the other collections. > + """ > + if not sequences_w: > + return space.newlist([]) > + result_w = [] > + iterators_w = [space.iter(w_seq) for w_seq in sequences_w] > + while True: > + try: > + items_w = [space.next(w_it) for w_it in iterators_w] > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + return space.newlist(result_w) > + result_w.append(space.newtuple(items_w)) > +zip.unwrap_spec = [ObjSpace, "args_w"] > + > +def reduce(space, w_func, w_sequence, rest_w): > + """ Apply function of two arguments cumulatively to the items of sequence, > + from left to right, so as to reduce the sequence to a single value. > + Optionally begin with an initial value. > + """ > + w_iter = space.iter(w_sequence) > + if rest_w: > + if len(rest_w) > 1: > + msg = "reduce() takes only 3 possible arguments" > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + w_initial, = rest_w > + else: > + try: > + w_initial = space.next(w_iter) > + except OperationError, e: > + if e.match(space, space.w_StopIteration): > + msg = "reduce() of empty sequence with no initial value" > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + raise > + w_result = w_initial > + while True: > + try: > + w_next = space.next(w_iter) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + break > + w_result = space.call_function(w_func, w_result, w_next) > + return w_result > +reduce.unwrap_spec = [ObjSpace, W_Root, W_Root, "args_w"] > + > +def filter(space, w_func, w_seq): > + """construct a list of those elements of collection for which function > + is True. If function is None, then return the items in the sequence > + which are True. > + """ > + if space.is_true(space.isinstance(w_seq, space.w_str)): > + return _filter_string(space, w_func, w_seq, space.w_str) > + if space.is_true(space.isinstance(w_seq, space.w_unicode)): > + return _filter_string(space, w_func, w_seq, space.w_unicode) > + if space.is_true(space.isinstance(w_seq, space.w_tuple)): > + return _filter_tuple(space, w_func, w_seq) > + w_iter = space.iter(w_seq) > + result_w = [] > + none_func = space.is_w(w_func, space.w_None) > + while True: > + try: > + w_next = space.next(w_iter) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + break > + if none_func: > + w_keep = w_next > + else: > + w_keep = space.call_function(w_func, w_next) > + if space.is_true(w_keep): > + result_w.append(w_next) > + return space.newlist(result_w) > + > +def _filter_tuple(space, w_func, w_tuple): > + none_func = space.is_w(w_func, space.w_None) > + length = space.int_w(space.len(w_tuple)) > + result_w = [] > + for i in range(length): > + w_item = space.getitem(w_tuple, space.wrap(i)) > + if none_func: > + w_keep = w_item > + else: > + w_keep = space.call_function(w_func, w_item) > + if space.is_true(w_keep): > + result_w.append(w_item) > + return space.newtuple(result_w) > + > +def _filter_string(space, w_func, w_string, w_str_type): > + none_func = space.is_w(w_func, space.w_None) > + if none_func and space.is_w(space.type(w_string), w_str_type): > + return w_string > + length = space.int_w(space.len(w_string)) > + result_w = [] > + for i in range(length): > + w_item = space.getitem(w_string, space.wrap(i)) > + if none_func or space.is_true(space.call_function(w_func, w_item)): > + if not space.is_true(space.isinstance(w_item, w_str_type)): > + msg = "__getitem__ returned a non-string type" > + raise OperationError(space.w_TypeError, space.wrap(msg)) > + result_w.append(w_item) > + w_empty = space.call_function(w_str_type) > + return space.call_method(w_empty, "join", space.newlist(result_w)) > > def all(space, w_S): > """all(iterable) -> bool > @@ -138,6 +377,77 @@ > any.unwrap_spec = [ObjSpace, W_Root] > > > +class W_Enumerate(Wrappable): > + > + def __init__(self, w_iter, w_start): > + self.w_iter = w_iter > + self.w_index = w_start > + > + def descr___new__(space, w_subtype, w_iterable): > + self = space.allocate_instance(W_Enumerate, w_subtype) > + self.__init__(space.iter(w_iterable), space.wrap(0)) > + return space.wrap(self) > + > + def descr___iter__(self, space): > + return space.wrap(self) > + descr___iter__.unwrap_spec = ["self", ObjSpace] > + > + def descr_next(self, space): > + w_item = space.next(self.w_iter) > + w_index = self.w_index > + self.w_index = space.add(w_index, space.wrap(1)) > + return space.newtuple([w_index, w_item]) > + descr_next.unwrap_spec = ["self", ObjSpace] > + > + > +W_Enumerate.typedef = TypeDef("enumerate", > + __new__=interp2app(W_Enumerate.descr___new__.im_func), > + __iter__=interp2app(W_Enumerate.descr___iter__), > + next=interp2app(W_Enumerate.descr_next), > +) > + > + > +def reversed(space, w_sequence): > + """Return a iterator that yields items of sequence in reverse.""" > + w_reversed_descr = space.lookup(w_sequence, "__reversed__") > + if w_reversed_descr is None: > + return space.wrap(W_ReversedIterator(space, w_sequence)) > + return space.get_and_call_function(w_reversed_descr, w_sequence) > +reversed.unwrap_spec = [ObjSpace, W_Root] > + > +class W_ReversedIterator(Wrappable): > + > + def __init__(self, space, w_sequence): > + self.remaining = space.int_w(space.len(w_sequence)) - 1 > + self.w_sequence = w_sequence > + > + def descr___iter__(self, space): > + return space.wrap(self) > + descr___iter__.unwrap_spec = ["self", ObjSpace] > + > + def descr_next(self, space): > + if self.remaining >= 0: > + w_index = space.wrap(self.remaining) > + try: > + w_item = space.getitem(self.w_sequence, w_index) > + except OperationError, e: > + if not e.match(space, space.w_StopIteration): > + raise > + else: > + self.remaining -= 1 > + return w_item > + > + # Done > + self.remaining = -1 > + raise OperationError(space.w_StopIteration, space.w_None) > + descr_next.unwrap_spec = ["self", ObjSpace] > + > +W_ReversedIterator.typedef = TypeDef("reversed", > + __iter__=interp2app(W_ReversedIterator.descr___iter__), > + next=interp2app(W_ReversedIterator.descr_next), > +) > + > + > class W_XRange(Wrappable): > def __init__(self, space, start, len, step): > self.space = space > _______________________________________________ > pypy-svn mailing list > pypy-svn(a)codespeak.net > http://codespeak.net/mailman/listinfo/pypy-svn >

1 0

Re: [pypy-dev] Jesse Noller tried to invite us to something and was rudely rejected...
by Laura Creighton 04 Sep '09

04 Sep '09

In a message of Fri, 04 Sep 2009 13:41:57 BST, Michael Foord writes: >--001485e36bef6120af0472bfd3cb >Content-Type: text/plain; charset=ISO-8859-1 > >Most mailing lists I'm on these days ban posts from non-members, otherwis >e >they get overwhelmed with spam unfortunately. :-( > >Michael python.org mailing lists are pretty good at catching the spam before they show up on your lists which is why I can let most of the lists I run just let email from non-members get moderated in or out. Maybe that software that python.org is running needs to be packaged up to make it easier for other mailman lists to install and use it? Laura

1 0

Jesse Noller tried to invite us to something and was rudely rejected...
by Laura Creighton 04 Sep '09

04 Sep '09

Are we rejecting messages from non-members of the list automatically these days? And if so, is this really necessary? And shouldn't we change the reject message to indicate that? Or is jnoller(a)gmail.com on some special 'banned from posting' list, and if so, why? Laura ------- Forwarded Message Return-Path: jnoller(a)gmail.com Delivery-Date: Fri Sep 4 12:20:35 2009 From: Jesse Noller <jnoller(a)gmail.com> To: Laura Creighton <lac(a)openend.se> Content-Type: multipart/alternative; Hmm Begin forwarded message: > From: pypy-dev-owner(a)codespeak.net > Date: September 3, 2009 10:13:08 PM EDT > To: jnoller(a)python.org > Subject: PyCon 2010: Plenary talk invite > > You are not allowed to post to this mailing list, and your message has > been automatically rejected. If you think that your messages are > being rejected in error, contact the mailing list owner at > pypy-dev-owner(a)codespeak.net. > > Hello there PyPy! > > I am reaching out to you today as the PyCon 2010 Program Committee > Chair, and on the behalf of the committee as a whole. Part of the > conference is the keynote/plenary talks - these talks range in time > length and are presented to the conference as a whole. > > We're planning out PyCon 2010 - and in discussions, we felt that an > excellent addition to PyCon would be a series of plenary talks (15 > minutes in length) on showcasing the state of the various > implementations of Python. I'd like to extend an invitation to one > of you > to act as the "lead" for PyPy and do one of these for us. > > Python is so much more than one implementation - and I know that > I, and the community as a whole would love to hear anything you had to > offer about your implementation. You can do something as simple as a > state of the union talk, things you would like to see from > python-core, or even encourage people to help contribute to your > project. Anything directly related to your implementation is fair > game. > > If you are interested in presenting, please get back to me as soon > as possible indicating your acceptance. If you do not want to do this, > and possibly have someone else in mind to present for you - by all > means please feel free to send me their contact information. > > The PyCon conference days will be February 19-21, 2010 in Atlanta, > Georgia, preceded by the tutorial days (February 17-18), and followed > by four days of development sprints (February 22-25). > > I look forward to hearing from you. If you have any questions, > please feel free to contact me (jnoller(a)python.org), or you can reach > out to the PyCon Chair - Van Lindberg (van(a)python.org) > > Jesse Noller > jnoller(a)python.org > Program Committee Chair ------- End of Forwarded Message

4 3