Mailman 3 January 2006 - pypy-dev

Snake server downtime
by Armin Rigo Feb. 17, 2006

Feb. 17, 2006

Hi all, The "snake" server will be down during the next couple of days (Wed-Thu), apparently for a change of the cooling system of the server room. If anyone would really like the server around, I can try to negotiate to have other machines shut down in its place -- some machines can be left running, as long as the room doesn't heat up too much. A bientot, Armin

1 1

lambda-the-ultimate pypy discussion
by John Eikenberry Jan. 30, 2006

Jan. 30, 2006

In case anyone is interested and don't read lambda-the-ultimate.org, they have a pypy discussion on the front page right now. http://lambda-the-ultimate.org/ -- John Eikenberry [jae(a)zhar.net - http://zhar.net] ______________________________________________________________ "It is difficult to produce a television documentary that is both incisive and probing when every twelve minutes one is interrupted by twelve dancing rabbits singing about toilet paper." - Rod Serling

1 0

pypy mallorca sprint report 2
by Michael Hudson Jan. 28, 2006

Jan. 28, 2006

We greet you once again from the Aula Linux lab of the UIB in Palma de Mallorca. There is one more day of sprinting, but as many people have had to leave slightly early, it's probably safe to attempt some kind of summary. Thursday was the break day, which didn't stop some mad people from doing a little work on rctypes and the JIT. The sane ones among us went hiking or to artists' studios instead :) Friday was not the most productive of days, partly becase we gave a talk to some people from the university and the local free software user group in the afternoon. Also contributing to the lack of results were the general difficulty of the tasks and some amazing getting-lost skills ("getting lost" here refers to the physical world for a change). Armin, Arre and Samuele worked on the JIT, the idea being to write an "abstract abstract interpreter", which would specialize an abstract interpreter of low-level graphs for a particular set of low-level graphs. At lunch they told a hilarious joke that they weren't going to do this at all and would instead re-use the annotator to extract the needed information. This then turned out to not be a joke at all, and is exactly what they did for the next two days (apparently they plan to re-use the rtyper as well, but this is just preposterous). Christian worked on coroutines and other stackless-like functionality, with good results: you can now build a version of pypy that can use and freely intermingle raw coroutines, tasklets and greenlets all at once. Apparently this is all fairly natural in the implementation, but must allow for the possibility of some *deeply* obscure user code... (obfuscated pypy contests, anyone?) Michael and Carl repeatedly bashed their heads onto the topic of gc integration, the desk, reference counting details, walls, genc and so on. The basic goal was to express the logic behind placing incref and decref operations as a nice and fairly clear transformation of the flow graphs, as opposed to backend-specific incomprehensible hacks. This task was made considerably harder by exceptions (who uses them, anyway?) but hopefully by the time we've finished writing this report we'll have built a pypy-c in the new style. This work should allow (finally) the integration of the GC framework Carl wrote as his Summer of Code project, and mere mortals to understand genc. Gerald and Stephan continued to work on "rctypes" -- a static version of ctypes for RPython. Reasonably complex ctypes declarations can now be annotated. Eric and Richard worked on a transformation to replace some of the operation that can raise exceptions with direct_call operations -- something that will be very useful for the GC work mentioned above, because operations that can raise an exception need special treatment -- so the fewer the better! And finally, some really interesting news: Armin plans to release Bub-n-Bros 1.5, the play testing of which delayed this morning's status meeting considerably :) To sum up, this sprint has seen a fair amount of work on very challenging tasks. As usual we all need to sleep for a week, so it's time to leave this wonderful island (also, it's raining). Cheers, mwh and Carl Friedrich -- > It might get my attention if you'd spin around in your chair, > spoke in tongues, and puked jets of green goblin goo. I can arrange for this. ;-) -- Barry Warsaw & Fred Drake

1 1

Minisprint report Paris
by Anders Lehmann Jan. 27, 2006

Jan. 27, 2006

Hi Everyone! Here is a short report on how we spent our week in Paris Mini Sprint report Paris January 23-27 ================================ Logic programming ===================== Aurelien and Anders worked the whole week on trying to understand how Oz/Mozart works. After a lot of trials they achieved in implementing: Aurelien had already made basic single assignment store. The store was completed (with tests) They made the basic infrastructure for computation spaces based on the store. From Logilab they stole and adapted code for the FiniteDomain, Constraints and DichotomyDistributor. On the computation space they implemented the semantics of Choose, Commit, Ask and Clone. Some experiments on making these constructs concurrent were made (not finished). Aspects and contracts ======================== Annotation and cleanup/refactoring of the grammar/parser. Research of different implementations of aspects and contracts. One reference is here_ .. _here: http://aosd-europe.net/documents/aspLang.pdf Have a nice weekend/ Sprint Aurelien, Adrien, Ludovic, Nicolas, Anders

1 0

__new__ got multiple values for keyword argument 'type'
by Sanghyeon Seo Jan. 26, 2006

Jan. 26, 2006

With r22685, I get this error: $ py.py PyPy 0.8.0 in StdObjSpace on top of Python 2.3.5 (startuptime: 5.94 secs) >>>> class C: .... def __init__(self, **kw): .... pass .... >>>> c = C(type='test') Traceback (application-level): File "<inline>", line 1 in <interactive> c = C(type='test') TypeError: __new__() got multiple values for keyword argument 'type' >>>> Any idea? Seo Sanghyeon

1 1

Mallorca sprint days 1 - 3
by Carl Friedrich Bolz Jan. 25, 2006

Jan. 25, 2006

Hi all! This is the first report of the challenging Mallorca sprint. On the one hand getting here proved to be quite an ordeal for some of the sprinters due to bad weather at airports and uncooperative ferry companies. On the other hand it seems that we have finally run out of even vaguely easy tasks to do and are thus involved in serious head-scratching and the making of strange noises as we contemplate what we have to do. The sprint is hosted in the GNU/Linux lab of the Universitat de les Illes Balears in Palma de Mallorca. We are very thankful to them for letting us disturb their undergraduates in their attempts to use the computers. On the first day some of the strangest noises were produced by Samuele who started together with Gerald and Stephan to work on a static version of ctypes for rpython. On Tuesday evening, after lots of tedious work on all levels of the translation toolchain, they managed (with some cheating) to got an example calling atoi to run. Michael and Arre started extending the l3interpreter to support operations involving heap-structures in a way that could be run on top of the llinterpreter and after translation to C. After some argument with Samuele, who, as usual, turned out to be right, they were successful in their goals. This means that the l3intepreter can now perform reasonably complex operations involving pointers but not subtract two integers. Carl Friedrich and Richard started refactoring the gc framework to use the new facilities Michael and Arre had written. Progress there was extreeeemely slow, so that in the evening of the first day only marginal progress was achieved. Christian, Eric and later Jacob started exposing PyPy's stackless features to application level. While doing this they found a few problems in the interp-level code and refactored it a bit. On the second and third day Christian and Jacob continued with this. They managed to expose simple coroutines on Wednesday and are now continuing to create nicer interfaces following the stackless module of stackless Python. One of the problems there turned out to be testing turnaround time, since the functionality can only be tested after a full translation has been run. There might be some ways around this involving slimy hacks. On the second day most pairs continued as before. Armin and Carl Friedrich worked on the JIT. They started defining an interface to generate code at runtime (see http://codespeak.net/svn/pypy/dist/pypy/doc/discussion/draft-jit-ideas.txt) and then using this same interface in the low level abstract interpreter. This turned out to be quite difficult in the sense that most of the time was spent re-redesigning the interface yet another time. On the third day Armin swapped with Samuele and continued with Gerald and Stephan to work on rctypes, with slow but steady progress. They are now able to annotate simple cases that use structures. Arre and Samuele tied themselves to the JIT treadmill and continued the work of Armin and Carl. A lot of "wuah!"'s and "arrgh!"'s can be heared from their direction -- we assume they are having fun. Carl Friedrich and Michael thought about how to integrate the currently only simulated GC framework with the backends. This looked and still looks like it will be *a lot of* work but they were able to at least clarify some issues and get somewhat started. Eric and Richard tried to finally remove the dependency on pyrex (!) in genllvm which is a relict from the old days of the first LLVM backend (which was pre-rtyper!). They are also working on removing some hand-written C code from genllvm. So while we're not seeing super-rapid progress there are still interesting changes continuously arriving. Tomorrow is a day off, but given the bunch of obsessives we are there might still be some checkins. There will still be three full days of sprinting afterwards. Cheers from sunny Palma, Michael & Carl Friedrich

1 0

Support for pure functional types.
by Maciek Fijalkowski Jan. 25, 2006

Jan. 25, 2006

I've been wondering for some time why there is no support for pure functional types. Like function int -> int. In most type inference techniques, there is. I know, side effects. But usually we can tell that function has no side effects at all, so it would be nice to reduce it to lambda type, not just remember to enter it's block. It would make some things much easier. Anyway: when calling some lambda or local function not all bindings are clear (depends on context), but we can leave it and got bidings later and use it normal way (not degenerate return value to some-object, which happens usually)

2 1

Re: [pypy-svn] r22640 - pypy/dist/pypy/lib/logic
by Ben.Young＠risk.sungard.com Jan. 25, 2006

Jan. 25, 2006

Hi, Did you mean to put something GPL'd into PyPy? I thought PyPy has a licence equivalent to Python? Cheers, Ben pypy-svn-bounces(a)codespeak.net wrote on 25/01/2006 12:50:29: > Author: auc > Date: Wed Jan 25 13:50:25 2006 > New Revision: 22640 > > Added: > pypy/dist/pypy/lib/logic/distributor.py > Modified: > pypy/dist/pypy/lib/logic/computationspace.py > pypy/dist/pypy/lib/logic/test_computationspace.py > pypy/dist/pypy/lib/logic/test_unification.py > pypy/dist/pypy/lib/logic/test_variable.py > pypy/dist/pypy/lib/logic/unification.py > pypy/dist/pypy/lib/logic/variable.py > Log: > (ale, auc) > * add distributor from logilab constraint solver > * adapt it > * method to get vars by name > * tests > > > Modified: pypy/dist/pypy/lib/logic/computationspace.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/computationspace.py (original) > +++ pypy/dist/pypy/lib/logic/computationspace.py Wed Jan 25 13:50:25 2006 > @@ -141,15 +141,15 @@ > ## Choose > ## ------ > > -## Y=choose(N) waits until the current space becomes stable, blocks the > -## current thread, and then creates a choice point with N alternatives > -## in the current space. The blocked choose call waits for an > -## alternative to be chosen by a commit operation on the space. The > -## choose call only defines how many alternatives there are; it does > -## not specify what to do for an alternative. Eventually, choose > -## continues its execution with Y=I when alternative I (1=<I=<N) is > -## chosen. A maximum of one choice point may exist in a space at any > -## time. > +## Y=choose(N) waits until the current space becomes stable, blocks > +## the current thread, and then creates a choice point with N > +## alternatives in the current space. The blocked choose call waits > +## for an alternative to be chosen by a commit operation on the > +## space. The choose call only defines how many alternatives there > +## are; it does not specify what to do for an alternative. Eventually, > +## choose continues its execution with Y=I when alternative I > +## (1=<I=<N) is chosen. A maximum of one choice point may exist in a > +## space at any time. > > ## Ask > ## --- > @@ -180,6 +180,9 @@ > class Unprocessed: > pass > > +class Working: > + pass > + > class Failed: > pass > > @@ -200,20 +203,30 @@ > self.store = Store() > self.status = Unprocessed > self.root = self.store.var('root') > - self.store.bind(self.root, program(self.store)) > + self.store.bind(self.root, program(self)) > + > + def _stable(self): > + #XXX: really ? > + return self.status in (Failed, Succeeded, Merged) > + > + def _distributable(self): > + pass > + #return not self._stable > + > + def set_distributor(self, dist): > + self.distributor = dist > > def ask(self): > # XXX: block on status being not stable for threads > if self._stable(): > return self.status > + #return self.store.nb_candidates() > else: > #TBD > return self.status > > - def _stable(self): > - return self.status in (Failed, Succeeded, Merged) > - > def process(self): > + self.status = Working > try: > self.store.satisfy_all() > except ConsistencyFailure: > @@ -221,9 +234,10 @@ > else: > self.status = Succeeded > > - > - def branch(self): > + def make_child(self): > return ComputationSpace(self.program, parent=self) > > -# def choose(self, alternative): > - > + def choose(self, alternative): > + """distribute the domains to new spaces > + create the spaces""" > + > > Added: pypy/dist/pypy/lib/logic/distributor.py > ============================================================================== > --- (empty file) > +++ pypy/dist/pypy/lib/logic/distributor.py Wed Jan 25 13:50:25 2006 > @@ -0,0 +1,172 @@ > +# (c) 2000-2001 LOGILAB S.A. (Paris, FRANCE). > +# http://www.logilab.fr/ -- mailto:contact@logilab.fr > +# > +# This program is free software; you can redistribute it and/or > modify it under > +# the terms of the GNU General Public License as published by the > Free Software > +# Foundation; either version 2 of the License, or (at your option) any later > +# version. > +# > +# This program is distributed in the hope that it will be useful, but WITHOUT > +# ANY WARRANTY; without even the implied warranty of > MERCHANTABILITY or FITNESS > +# FOR A PARTICULAR PURPOSE. See the GNU General Public License for > more details. > +# > +# You should have received a copy of the GNU General Public Licensealong with > +# this program; if not, write to the Free Software Foundation, Inc., > +# 59 Temple Place - Suite 330, Boston, MA 02111-1307 > +# USA. > + > +""" > +distributors - part of Logilab's constraint satisfaction solver. > +""" > + > +__revision__ = '$Id: distributors.py,v 1.25 2005/01/14 15:16:21 alf Exp $' > + > +import math, random > + > +def make_new_domains(domains): > + """return a shallow copy of dict of domains passed in argument""" > + domain = {} > + for key, value in domains.items(): > + domain[key] = value.copy() > + return domain > + > +class AbstractDistributor(object): > + """_distribute is left unimplemented.""" > + > + def __init__(self, nb_subspaces=2): > + self.nb_subspaces = nb_subspaces > + self.verbose = 0 > + > + def findSmallestDomain(self, domains): > + """returns the variable having the smallest domain. > + (or one of such varibles if there is a tie) > + """ > + domlist = [(dom.size(), variable ) for variable, dom in > domains.items() > + if dom.size() > 1] > + domlist.sort() > + return domlist[0][1] > + > + def findLargestDomain(self, domains): > + """returns the variable having the largest domain. > + (or one of such variables if there is a tie) > + """ > + domlist = [(dom.size(), variable) for variable, dom in > domains.items() > + if dom.size() > 1] > + domlist.sort() > + return domlist[-1][1] > + > + def nb_subdomains(self, domains): > + """return number of sub domains to explore""" > + return self.nb_subspaces > + > + def distribute(self, domains, verbose=0): > + """do the minimal job and let concrete class distribute variables > + """ > + self.verbose = verbose > + replicas = [] > + for i in range(self.nb_subdomains(domains)): > + replicas.append(make_new_domains(domains)) > + modified_domains = self._distribute(*replicas) > + for domain in modified_domains: > + domain.reset_flags() > + return replicas > + > + def _distribute(self, *args): > + """ method to implement in concrete class > + > + take self.nb_subspaces copy of the original domains as argument > + distribute the domains and return each modified domain > + """ > + raise NotImplementedError("Use a concrete implementation of " > + "the Distributor interface") > + > +class NaiveDistributor(AbstractDistributor): > + """distributes domains by splitting the smallest domain in 2 new domains > + The first new domain has a size of one, > + and the second has all the other values""" > + > + def __init__(self): > + AbstractDistributor.__init__(self) > + > + def _distribute(self, dom1, dom2): > + """See AbstractDistributor""" > + variable = self.findSmallestDomain(dom1) > + values = dom1[variable].get_values() > + if self.verbose: > + print 'Distributing domain for variable', variable, \ > + 'at value', values[0] > + dom1[variable].remove_values(values[1:]) > + dom2[variable].remove_value(values[0]) > + return (dom1[variable], dom2[variable]) > + > + > +class RandomizingDistributor(AbstractDistributor): > + """distributes domains as the NaiveDistrutor, except that the unique > + value of the first domain is picked at random.""" > + > + def __init__(self): > + AbstractDistributor.__init__(self) > + > + def _distribute(self, dom1, dom2): > + """See AbstractDistributor""" > + variable = self.findSmallestDomain(dom1) > + values = dom1[variable].get_values() > + distval = random.choice(values) > + values.remove(distval) > + if self.verbose: > + print 'Distributing domain for variable', variable, \ > + 'at value', distval > + dom1[variable].remove_values(values) > + dom2[variable].remove_value(distval) > + return (dom1[variable], dom2[variable]) > + > + > +class SplitDistributor(AbstractDistributor): > + """distributes domains by splitting the smallest domain in > + nb_subspaces equal parts or as equal as possible. > + If nb_subspaces is 0, then the smallest domain is split in > + domains of size 1""" > + > + def __init__(self, nb_subspaces=3): > + AbstractDistributor.__init__(self, nb_subspaces) > + self.__to_split = None > + def nb_subdomains(self, domains): > + """See AbstractDistributor""" > + self.__to_split = self.findSmallestDomain(domains) > + if self.nb_subspaces: > + return min(self.nb_subspaces, domains[self.__to_split].size()) > + else: > + return domains[self.__to_split].size() > + > + def _distribute(self, *args): > + """See AbstractDistributor""" > + variable = self.__to_split > + nb_subspaces = len(args) > + values = args[0][variable].get_values() > + nb_elts = max(1, len(values)*1./nb_subspaces) > + slices = [(int(math.floor(index * nb_elts)), > + int(math.floor((index + 1) * nb_elts))) > + for index in range(nb_subspaces)] > + if self.verbose: > + print 'Distributing domain for variable', variable > + modified = [] > + for (dom, (end, start)) in zip(args, slices) : > + dom[variable].remove_values(values[:end]) > + dom[variable].remove_values(values[start:]) > + modified.append(dom[variable]) > + return modified > + > +class DichotomyDistributor(SplitDistributor): > + """distributes domains by splitting the smallest domain in > + two equal parts or as equal as possible""" > + def __init__(self): > + SplitDistributor.__init__(self, 2) > + > + > +class EnumeratorDistributor(SplitDistributor): > + """distributes domains by splitting the smallest domain > + in domains of size 1.""" > + def __init__(self): > + SplitDistributor.__init__(self, 0) > + > +DefaultDistributor = DichotomyDistributor > > Modified: pypy/dist/pypy/lib/logic/test_computationspace.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/test_computationspace.py (original) > +++ pypy/dist/pypy/lib/logic/test_computationspace.py Wed Jan 25 > 13:50:25 2006 > @@ -2,24 +2,27 @@ > import variable as v > import constraint as c > import computationspace as cs > +import distributor as di > from py.test import raises > > -def satisfiable_problem(store): > - s = store # i'm lazy > +def satisfiable_problem(computation_space): > + cs = computation_space > + s = cs.store > x, y, z, w = (s.var('x'), s.var('y'), > s.var('z'), s.var('w')) > s.set_domain(x, c.FiniteDomain([2, 6])) > s.set_domain(y, c.FiniteDomain([2, 3])) > s.set_domain(z, c.FiniteDomain([4, 5])) > - s.set_domain(w, c.FiniteDomain([1, 4, 5])) > + s.set_domain(w, c.FiniteDomain([1, 4, 5, 6, 7])) > s.add_constraint(c.Expression([x, y, z], 'x == y + z')) > s.add_constraint(c.Expression([z, w], 'z < w')) > - # we don't know yet how to > # set up a distribution strategy > + cs.set_distributor(di.DichotomyDistributor()) > return (x, w, y) > > -def unsatisfiable_problem(store): > - s = store # i'm lazy > +def unsatisfiable_problem(computation_space): > + cs = computation_space > + s = cs.store > x, y, z, w = (s.var('x'), s.var('y'), > s.var('z'), s.var('w')) > s.set_domain(x, c.FiniteDomain([2, 6])) > @@ -28,8 +31,8 @@ > s.set_domain(w, c.FiniteDomain([1])) > s.add_constraint(c.Expression([x, y, z], 'x == y + z')) > s.add_constraint(c.Expression([z, w], 'z < w')) > - # we don't know yet how to > # set up a distribution strategy > + cs.set_distributor(di.DichotomyDistributor()) > return (x, w, y) > > > @@ -56,5 +59,23 @@ > assert spc.ask() == cs.Unprocessed > spc.process() > assert spc.ask() == cs.Failed > - > - > + > + def test_distribute(self): > + spc = cs.ComputationSpace(satisfiable_problem) > + spc.process() > + domains = dict([(var, var.dom) for var in spc.store.vars > + if var.dom]) > + new_domains = spc.distributor.distribute(domains) > + x, y, z, w = (spc.store.get_var_by_name('x'), > + spc.store.get_var_by_name('y'), > + spc.store.get_var_by_name('z'), > + spc.store.get_var_by_name('w')) > + assert new_domains == [{x: c.FiniteDomain([6]), > + y: c.FiniteDomain([2]), > + z: c.FiniteDomain([4]), > + w: c.FiniteDomain([5])}, > + {x: c.FiniteDomain([6]), > + y: c.FiniteDomain([2]), > + z: c.FiniteDomain([4]), > + w: c.FiniteDomain([6, 7])}] > + > > Modified: pypy/dist/pypy/lib/logic/test_unification.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/test_unification.py (original) > +++ pypy/dist/pypy/lib/logic/test_unification.py Wed Jan 25 13:50:25 2006 > @@ -21,7 +21,7 @@ > > def test_already_in_store(self): > x = u.var('x') > - raises(v.AlreadyExists, u.var, 'x') > + raises(v.AlreadyInStore, u.var, 'x') > > def test_already_bound(self): > x = u.var('x') > > Modified: pypy/dist/pypy/lib/logic/test_variable.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/test_variable.py (original) > +++ pypy/dist/pypy/lib/logic/test_variable.py Wed Jan 25 13:50:25 2006 > @@ -24,10 +24,14 @@ > def setup_method(self, meth): > u._store = u.Store() > > - > def test_no_same_name(self): > x = u.var('x') > - raises(v.AlreadyExists, u.var, 'x') > + raises(u.AlreadyInStore, u.var, 'x') > + > + def test_get_by_name(self): > + x = u.var('x') > + assert x == u._store.get_var_by_name('x') > + raises(u.NotInStore, u._store.get_var_by_name, 'y') > > def test_one_thread_reading_one_var(self): > cons = Consumer() > > Modified: pypy/dist/pypy/lib/logic/unification.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/unification.py (original) > +++ pypy/dist/pypy/lib/logic/unification.py Wed Jan 25 13:50:25 2006 > @@ -120,7 +120,8 @@ > > import threading > > -from variable import EqSet, Var, VariableException, NotAVariable > +from variable import EqSet, Var, \ > + VariableException, NotAVariable, AlreadyInStore > from constraint import FiniteDomain, ConsistencyFailure > > #----------- Store Exceptions ---------------------------- > @@ -132,9 +133,9 @@ > def __str__(self): > return "%s is already bound" % self.name > > -class AlreadyInStore(VariableException): > +class NotInStore(VariableException): > def __str__(self): > - return "%s already in store" % self.name > + return "%s not in the store" % self.name > > class OutOfDomain(VariableException): > def __str__(self): > @@ -169,9 +170,9 @@ > (also called determined variables).""" > > def __init__(self): > - # mapping of names to vars (all of them) > self.vars = set() > - self.names = set() > + # mapping of names to vars (all of them) > + self.names = {} > # set of all constraints > self.constraints = set() > # consistency-preserving stuff > @@ -193,7 +194,7 @@ > raise AlreadyInStore(var.name) > print "adding %s to the store" % var > self.vars.add(var) > - self.names.add(var.name) > + self.names[var.name] = var > # put into new singleton equiv. set > var.val = EqSet([var]) > > @@ -203,6 +204,12 @@ > if var.is_bound(): > raise AlreadyBound > var.dom = FiniteDomain(dom) > + > + def get_var_by_name(self, name): > + try: > + return self.names[name] > + except KeyError: > + raise NotInStore(name) > > #-- Constraints ------------------------- > > > Modified: pypy/dist/pypy/lib/logic/variable.py > ============================================================================== > --- pypy/dist/pypy/lib/logic/variable.py (original) > +++ pypy/dist/pypy/lib/logic/variable.py Wed Jan 25 13:50:25 2006 > @@ -7,13 +7,13 @@ > def __init__(self, name): > self.name = name > > -class NotAVariable(VariableException): > +class AlreadyInStore(VariableException): > def __str__(self): > - return "%s is not a variable" % self.name > + return "%s already in store" % self.name > > -class AlreadyExists(VariableException): > +class NotAVariable(VariableException): > def __str__(self): > - return "%s already exists" % self.name > + return "%s is not a variable" % self.name > > #----------- Variables ---------------------------------- > class EqSet(set): > @@ -32,7 +32,7 @@ > > def __init__(self, name, store): > if name in store.names: > - raise AlreadyExists(name) > + raise AlreadyInStore(name) > self.name = name > self.store = store > # top-level 'commited' binding > @@ -98,16 +98,10 @@ > def add_constraint(self, constraint): > self.constraints.add(constraint) > > - #---- Concurrent public ops -------------------------- > + is_bound = _is_bound > > - def is_bound(self): > - try: > - self.mutex.acquire() > - res = self._is_bound() > - finally: > - self.mutex.release() > - return res > > + #---- Concurrent public ops -------------------------- > # should be used by threads that want to block on > # unbound variables > def get(self): > _______________________________________________ > pypy-svn mailing list > pypy-svn(a)codespeak.net > http://codespeak.net/mailman/listinfo/pypy-svn >

2 2

which file is connected to http://pypy.org/?
by Laura Creighton Jan. 22, 2006

Jan. 22, 2006

In any event it says 'The PyPy project have been an ongoing' rather than 'has been' probably because it said 'We have been' at some point in its lifetime. I'd fix it if I could find it. Laura

2 1

Heard the EU review went very well.
by Laura Creighton Jan. 21, 2006

Jan. 21, 2006

Congratulations, all. Laura

1 0