Mailman 3 January 2006 - pypy-dev

Re: [pypy-dev] Fw: [pypy-svn] r21739 - in pypy/dist/pypy/lib/pyontology: . test
by Ben.Young＠risk.sungard.com Jan. 8, 2006

Jan. 8, 2006

Anders Lehmann <anders.lehmann(a)dfki.de> wrote on 06/01/2006 16:21:42: > Sorry for not sending the first answer to the list, please read below. > > Den 06/01/2006 kl. 17.11 skrev Ben.Young(a)risk.sungard.com: > > > Thanks for the info Anders. > > > > What I don't understand is what the relation of this all is with PyPy. > > Will it eventually be somehow integrated with python itself rather > > than a > > library? What benefits will this … [View More]

2 1

Re: [pypy-dev] Fw: [pypy-svn] r21739 - in pypy/dist/pypy/lib/pyontology: . test
by Ben.Young＠risk.sungard.com Jan. 6, 2006

Jan. 6, 2006

Thanks for the info Anders. What I don't understand is what the relation of this all is with PyPy. Will it eventually be somehow integrated with python itself rather than a library? What benefits will this bring? Cheers, Ben Anders Lehmann <anders.lehmann(a)dfki.de> wrote on 06/01/2006 16:03:20: > It is part of what we have promised to deliver in the eu-project, in > the the workpackage about Semantic web and Logic (WP9). It is > supposed to become an parser/reasoner of … [View More]

1 0

Fw: [pypy-svn] r21739 - in pypy/dist/pypy/lib/pyontology: . test
by Ben.Young＠risk.sungard.com Jan. 6, 2006

Jan. 6, 2006

Hi Everyone, Just a quick question. What is all this pyontology stuff? Is there any docs explaining what it is, what it's used for, and why pypy is a good match for it? I'm sure I could find out with some google'ing, but I'm feeling a bit lazy! Hope you all had a good Christmas/New Year. I see you are all still recovering by the lack of pypy action :-) Cheers, Ben ----- Forwarded by Ben Young/Infinity on 06/01/2006 15:24 ----- pypy-svn-bounces(a)codespeak.net wrote on 06/01/2006 14:48:… [View More]58: > Author: ale > Date: Fri Jan 6 15:48:57 2006 > New Revision: 21739 > > Modified: > pypy/dist/pypy/lib/pyontology/pyontology.py > pypy/dist/pypy/lib/pyontology/test/test_ontology.py > Log: > Lots of small changes and refactorings, I probably should commit more often > > Modified: pypy/dist/pypy/lib/pyontology/pyontology.py > ============================================================================== > --- pypy/dist/pypy/lib/pyontology/pyontology.py (original) > +++ pypy/dist/pypy/lib/pyontology/pyontology.py Fri Jan 6 15:48:57 2006 > @@ -1,4 +1,4 @@ > -from rdflib import Graph, URIRef, BNode > +from rdflib import Graph, URIRef, BNode, Literal > from logilab.constraint import Repository, Solver > from logilab.constraint.fd import Equals, AllDistinct, > BinaryExpression, Expression > from logilab.constraint.fd import FiniteDomain as fd > @@ -71,23 +71,25 @@ > > class Property(ClassDomain): > # Property contains the relationship between a class instance and a value > - # - a pair. To accomodate global assertions like 'range' and > 'domain' anonymous > - # pairs are allowed, ie None as key > + # - a pair. To accomodate global assertions like 'range' and > 'domain' attributes > + # for range and domain must be filled in by rdfs:range and rdfs:domain > + > def __init__(self, name='', values=[], bases = []): > ClassDomain.__init__(self, name, values, bases) > - self._dict = {} > + self._dict = Linkeddict() > + self.range = [] > + self.domain = [] > > def getValues(self): > - return self._dict.items() > + items = self._dict.items() > + res = [] > + for k,v in items: > + for i in v: > + res.append((k,i)) > + return res > > def setValues(self, values): > - for k,v in values: > - self._dict.setdefault(k,[]) > - if type(v) == list: > - self._dict[k] = v > - else: > - if not v in self._dict[k]: > - self._dict[k].append(v) > + self._dict = Linkeddict(values) > > def removeValues(self, values): > for k,v in values: > @@ -124,13 +126,13 @@ > > def __init__(self, name='', values=[], bases = []): > Property.__init__(self, name, values, bases) > - self.constraint = FunctionalCardinality(name, 1) > + self.constraint = FunctionalCardinality(name) > > class InverseFunctionalProperty(Property): > > def __init__(self, name='', values=[], bases = []): > Property.__init__(self, name, values, bases) > - self.constraint = InverseFunctionalCardinality(name, 1) > + self.constraint = InverseFunctionalCardinality(name) > > class TransitiveProperty(Property): > > @@ -192,25 +194,22 @@ > ns ='' > func = p > if ns in namespaces.values(): > + #predicate is one of builtin OWL predicates > pred = getattr(self, func) > res = pred(s, p, o) > if not res : > continue > if type(res) != list : > res = [res] > - avar = self.make_var(fd, s) > + avar = self.make_var(ClassDomain, s) > else: > res = [o] > avar = self.make_var(Property, p) > # Set the values of the property p to o > - sub = self.make_var(fd, s) > - obj = self.make_var(fd, o) > + sub = self.make_var(ClassDomain, s) > + obj = self.make_var(Thing, o) > res = self.variables[avar].getValues() > - self.variables[avar].setValues(res + ((sub, obj),)) > - if self.variables.get(avar) and type(self.variables[avar]) == fd: > - self.variables[avar] = fd(list(self. > variables[avar].getValues()) + res) > - else: > - self.variables[avar] = fd(res) > + self.variables[avar].setValues(res + [(sub, obj)]) > > def merge_constraints(self): > # Make the intersection of multiple rdfs:range constraints > on the same variable > @@ -240,9 +239,7 @@ > first = list(self.objects(subject, rdf_first)) > assert len(first) == 1 > if type(first[0]) == URIRef: > - var = self.make_var(fd, first[0]) > - if var not in self.variables.keys(): > - self.variables[var] = ClassDomain(var) > + var = self.make_var(ClassDomain, first[0]) > res += first > > rest = list(self.objects(subject, rdf_rest)) > @@ -252,24 +249,25 @@ > res += self.get_list(rest[0]) > return res > > - def make_var(self, cls=fd, *args): > - res = [] > - for a in args: > - if type(a) == URIRef: > - if a.find('#') != -1: > - ns,name = a.split('#') > - else: > - ns,name = a,'' > - if ns not in uris.keys(): > - uris[ns] = ns.split('/')[-1] > - namespaces[uris[ns]] = ns > - mangle_name = uris[ns] + '_' + name > - res.append(mangle_name) > + def make_var(self, cls=fd, a=''): > + if type(a) == URIRef: > + if a.find('#') != -1: > + ns,name = a.split('#') > else: > - res.append(a) > - var = '.'.join([str(a.replace('-','_')) for a in res]) > + ns,name = a,'' > + if ns not in uris.keys(): > + uris[ns] = ns.split('/')[-1] > + a = uris[ns] + '_' + name > + var = str(a.replace('-','_')) > + if not cls: > + return var > if not var in self.variables.keys(): > self.variables[var] = cls(var) > + elif type(self.variables[var]) != cls: > + olddom = self.variables[var] > + newdom = cls(var) > + newdom.setValues(olddom.getValues()) > + self.variables[var] = newdom > return var > > def find_prop(self, s): > @@ -284,7 +282,7 @@ > if type(s) == BNode: > pr = list( self.subjects(p,s) ) > if len(pr) == 0: > - return > + pr = list( self.subjects(r,s) ) > return pr[0] > else: > return s > @@ -296,37 +294,25 @@ > > def find_property(self, s): > prop = self.find_prop(s) > - cls = self.find_cls(s) > - if cls : > - avar = self.make_var(ClassDomain, cls, prop) > - else: > - avar = self.make_var(ClassDomain, prop) > - if not self.variables.get(avar): > - self.variables[avar] = ClassDomain(avar) > + avar = self.make_var(Property, prop) > return avar > > #---------------- Implementation ---------------- > > def type(self, s, p, var): > - > - #if (type(var) == URIRef and not > - if not (var in [URIRef(namespaces['owl']+'#'+x) for x in > builtin_voc]): > + if not (var in [URIRef(namespaces[ns]+'#'+x) for x in > builtin_voc for ns in namespaces]): > # var is not one of the builtin classes > - svar = self.make_var(ClassDomain, s) > avar = self.make_var(ClassDomain, var) > - self.variables[svar].setValues(self.variables[avar].getValues()) > + svar = self.make_var(self.variables[avar].__class__, s) > constrain = BinaryExpression([svar, avar],"%s in %s" % > (svar, avar)) > self.constraints.append(constrain) > - else: # type(s) != BNode: > + else: > # var is a builtin class > - svar = self.make_var(ClassDomain, s) > - print "===",var > - cls =builtin_voc[var.split('#')[-1]](name=svar) > + cls =builtin_voc[var.split('#')[-1]] > + svar = self.make_var(cls, s) > + cls = self.variables[svar] > if hasattr(cls, 'constraint'): > self.constraints.append(cls.constraint) > - vals = self.variables[svar].getValues() > - cls.setValues(vals) > - self.variables[svar] = cls > > def first(self, s, p, var): > pass > @@ -334,14 +320,17 @@ > def rest(self, s, p, var): > pass > > + def onProperty(self, s, p, var): > + pass > + > #---Class Axioms--- > #000000#FFFFFF----------------------------------------------- > > def subClassOf(self, s, p, var): > # s is a subclass of var means that the > # class extension of s is a subset of the > # class extension of var. > - avar = self.make_var(ClassDomain, var) > - svar = self.make_var(ClassDomain, s) > + avar = self.make_var(None, var) > + svar = self.make_var(None, s) > cons = SubClassConstraint( svar, avar) > self.constraints.append(cons) > > @@ -350,21 +339,22 @@ > self.subClassOf(var, p, s) > > def disjointWith(self, s, p, var): > - avar = self.make_var(ClassDomain, var) > - svar = self.make_var(ClassDomain, s) > + avar = self.make_var(None, var) > + svar = self.make_var(None, s) > constrain = DisjointClassConstraint(svar, avar) > self.constraints.append(constrain) > > def complementOf(self, s, p, var): > # add constraint of not var > # TODO: implementthis for OWL DL > - avar = self.make_var(ClassDomain, var) > - svar = self.make_var(ClassDomain, s) > +## avar = self.make_var(ClassDomain, var) > +## svar = self.make_var(ClassDomain, s) > + pass > > def oneOf(self, s, p, var): > res = self.get_list(var) > - prop = self.find_uriref(s) > - avar = self.make_var(fd, prop) > + #prop = self.find_uriref(s) > + avar = self.make_var(None, s) > if self.variables.get(avar) and type(self.variables[avar]) == fd: > self.variables[avar] = fd(list(self.variables[avar]. > getValues()) + res) > else: > @@ -388,13 +378,6 @@ > def range(self, s, p, var): > avar = self.make_var(ClassDomain, var) > svar = self.make_var(Property, s) > - vals = get_values(self.variables[avar], self.variables) > - for k,v in self.variables[svar].getValues(): > - for x in v: > - if not x in vals: > - vals.append(x) > - vals =[(None,val) for val in vals] > - self.variables[svar].setValues(vals) > cons = RangeConstraint(svar, avar) > self.constraints.append(cons) > > @@ -424,37 +407,42 @@ > def equivalentProperty(self, s, p, var): > avar = self.make_var(Property, var) > svar = self.make_var(Property, s) > - cons = EquivalentConstraint( svar, avar) > + cons = EquivalentPropertyConstraint( svar, avar) > self.constraints.append(cons) > > def inverseOf(self, s, p, var): > - # TODO: implement this > - pass > + avar = self.make_var(Property, var) > + svar = self.make_var(Property, s) > + con = InverseofConstraint(svar, avar) > + self.constraints.append(con) > > #---Property > restrictions------------------------------------------------------ > > def maxCardinality(self, s, p, var): > """ Len of finite domain of the property shall be less than > or equal to var""" > avar = self.find_property(s) > - constrain = MaxCardinality(avar,int(var)) > + cls =self.make_var(None, self.find_cls(s)) > + constrain = MaxCardinality(avar, cls, int(var)) > self.constraints.append(constrain) > > def minCardinality(self, s, p, var): > """ Len of finite domain of the property shall be greater > than or equal to var""" > avar = self.find_property(s) > - constrain = MinCardinality(avar,int(var)) > + cls =self.make_var(None, self.find_cls(s)) > + constrain = MinCardinality(avar, cls, int(var)) > self.constraints.append(constrain) > > def cardinality(self, s, p, var): > """ Len of finite domain of the property shall be equal to var""" > avar = self.find_property(s) > + cls =self.make_var(None, self.find_cls(s)) > # Check if var is an int, else find the int buried in the structure > - constrain = Cardinality(avar,int(var)) > + constrain = Cardinality(avar, cls, int(var)) > self.constraints.append(constrain) > > def differentFrom(self, s, p, var): > s_var = self.make_var(ClassDomain, s) > - var_var = self.make_var(fd, var) > + var_var = self.make_var(Thing, var) > constrain = BinaryExpression([s_var, var_var],"%s != %s" % > (s_var, var_var)) > self.constraints.append(constrain) > > @@ -464,14 +452,12 @@ > return res > > def sameAs(self, s, p, var): > - constrain = BinaryExpression([self.make_var(ClassDomain, > s), self.make_var(ClassDomain, var)], > - "%s == %s" %(self.make_var(ClassDomain, s), self. > make_var(ClassDomain, var))) > + s_var = self.make_var(None, s) > + var_var = self.make_var(None, var) > + constrain = BinaryExpression([s_var, var_var], > + "%s == %s" %(s_var, var_var)) > self.constraints.append(constrain) > > - def onProperty(self, s, p, var): > - # TODO: implement this > - pass > - > def hasValue(self, s, p, var): > # TODO: implement this > pass > @@ -485,7 +471,7 @@ > pass > > def imports(self, s, p, var): > - # TODO: implement this > + # PP TODO: implement this > pass > > # ----------------- Helper classes ---------------- > @@ -507,17 +493,19 @@ > class MaxCardinality(OwlConstraint): > """Contraint: all values must be distinct""" > > - def __init__(self, variable, cardinality): > + def __init__(self, variable, cls, cardinality): > OwlConstraint.__init__(self, variable) > self.__cost = 1 > self.cardinality = cardinality > + self.cls = cls > > def __repr__(self): > return '<%s %s %i>' % (self.__class__.__name__, str(self. > _variables[0]), self.cardinality) > > def narrow(self, domains): > """narrowing algorithm for the constraint""" > - if len(domains[self._variables[0]]) > self.cardinality: > + prop = Linkeddict(domains[self.variable].getValues()) > + if len(prop[self.cls]) > self.cardinality: > raise ConsistencyFailure("Maxcardinality exceeded") > else: > return 1 > @@ -526,8 +514,8 @@ > > def narrow(self, domains): > """narrowing algorithm for the constraint""" > - > - if len(domains[self._variables[0]]) < self.cardinality: > + prop = Linkeddict(domains[self.variable].getValues()) > + if len(prop[self.cls]) < self.cardinality: > raise ConsistencyFailure("MinCardinality not accomplished") > else: > return 1 > @@ -536,8 +524,8 @@ > > def narrow(self, domains): > """narrowing algorithm for the constraint""" > - > - if len(domains[self._variables[0]]) != self.cardinality: > + prop = Linkeddict(domains[self.variable].getValues()) > + if len(prop[self.cls]) != self.cardinality: > raise ConsistencyFailure("Cardinality constraint not met") > else: > return 1 > @@ -545,12 +533,14 @@ > > def get_values(dom, domains, attr = 'getValues'): > res = [] > + if type(dom) == Literal: > + return [dom] > for val in getattr(dom, attr)(): > res.append(val) > if type(val) == tuple: > val = val[0] > if val in domains.keys(): > - res.extend(get_values(val, domains, attr)) > + res.extend(get_values(domains[val], domains, attr)) > #res[dom] = 1 > return res > > @@ -558,15 +548,15 @@ > > def __init__(self, variable, cls_or_restriction): > OwlConstraint.__init__(self, variable) > - self.super = cls_or_restriction > + self.object = cls_or_restriction > self.variable = variable > > def __repr__(self): > - return '<%s %s %s>' % (self.__class__.__name__, str(self. > _variables[0]), self.super) > + return '<%s %s %s>' % (self.__class__.__name__, str(self. > _variables[0]), self.object) > > def narrow(self, domains): > subdom = domains[self.variable] > - superdom = domains[self.super] > + superdom = domains[self.object] > bases = get_values(superdom, domains, 'getBases') > subdom.bases += [bas for bas in bases if bas not in subdom.bases] > vals = get_values(subdom, domains, 'getValues') > @@ -576,11 +566,11 @@ > > def narrow(self, domains): > subdom = domains[self.variable] > - superdom = domains[self.super] > + superdom = domains[self.object] > bases = get_values(superdom, domains, 'getBases') > subdom.bases += [bas for bas in bases if bas not in subdom.bases] > vals1 = get_values(superdom, domains, 'getValues') > - vals2 = get_values(variable, domains, 'getValues') > + vals2 = get_values(subdom, domains, 'getValues') > for i in vals1: > if i in vals2: > raise ConsistencyFailure() > @@ -589,39 +579,46 @@ > > def narrow(self, domains): > subdom = domains[self.variable] > - superdom = domains[self.super] > + superdom = domains[self.object] > > class RangeConstraint(SubClassConstraint): > > def narrow(self, domains): > - subdom = domains[self.variable] > - superdom = domains[self.super] > - vals = get_values(superdom, domains, 'getValues') > - res = [] > - svals = get_values(subdom, domains, 'getValues') > - for k,val in svals: > - for v in val: > - if not v in vals: > - res.append((k,v)) > - subdom.removeValues(res) > + propdom = domains[self.variable] > + rangedom = domains[self.object] > + newrange = get_values(rangedom, domains, 'getValues') > + range = [] > + prop = Linkeddict(propdom.getValues()) > + oldrange = propdom.range#get(None) > + if oldrange: > + for v in oldrange: > + if v in newrange: > + range.append(v) > + else: > + range = newrange > + propdom.range = range > +# propdom.setValues(prop.items()) > + for pval in sum(prop.values(),[]): > + if pval not in range: > + raise ConsistencyFailure("Value %r not in range % > r"%(pval,range)) > > class DomainConstraint(SubClassConstraint): > > def narrow(self, domains): > - subdom = domains[self.variable] > - superdom = domains[self.super] > - vals = get_values(superdom, domains, 'getValues') > + propdom = domains[self.variable] > + domaindom = domains[self.object] > + vals = get_values(domaindom, domains, 'getValues') > res = [] > - for k,val in get_values(subdom, domains, 'getValues'): > - if not k in vals and k != superdom: > + for k,val in get_values(propdom, domains, 'getValues'): > + if not k in vals and k != domaindom: > res.append((k,val)) > - subdom.removeValues(res) > + propdom.removeValues(res) > > class SubPropertyConstraint(SubClassConstraint): > > def narrow(self, domains): > subdom = domains[self.variable] > - superdom = domains[self.super] > + superdom = domains[self.object] > vals = get_values(superdom, domains, 'getValues') > for val in subdom.getValues(): > if not val in vals: > @@ -632,25 +629,26 @@ > > def narrow(self, domains): > subdom = domains[self.variable] > - superdom = domains[self.super] > + superdom = domains[self.object] > vals = get_values(superdom, domains, 'getValues') > for val in subdom.getValues(): > if not val in vals: > raise ConsistencyFailure("Value not in prescribed range") > > -class FunctionalCardinality(MaxCardinality): > +class FunctionalCardinality(OwlConstraint): > """Contraint: all values must be distinct""" > > def narrow(self, domains): > """narrowing algorithm for the constraint""" > domain = domains[self.variable].getValues() > - for cls, val in domain: > - if len(val) != self.cardinality: > + domain_dict = Linkeddict(domain) > + for cls, val in domain_dict.items(): > + if len(val) != 1: > raise ConsistencyFailure("Maxcardinality exceeded") > else: > return 0 > > -class InverseFunctionalCardinality(MaxCardinality): > +class InverseFunctionalCardinality(OwlConstraint): > """Contraint: all values must be distinct""" > > def narrow(self, domains): > @@ -658,27 +656,36 @@ > domain = domains[self.variable].getValues() > vals = {} > for cls, val in domain: > - for v in val: > - if vals.has_key(v): > - raise ConsistencyFailure("Maxcardinality exceeded") > - else: > - vals[v] = 1 > + if vals.has_key(val): > + raise ConsistencyFailure("Maxcardinality exceeded") > + else: > + vals[val] = 1 > else: > return 0 > > +class Linkeddict(dict): > + def __init__(self, values=()): > + for k,v in values: > + dict.setdefault(self,k,[]) > + if type(v) == list: > + dict.__setitem__(self, k, v) > + else: > + if not v in dict.__getitem__(self,k): > + dict.__getitem__(self,k).append(v) > +## dict.__getitem__(self,k).append(v) > + > class TransitiveConstraint(OwlConstraint): > """Contraint: all values must be distinct""" > > def narrow(self, domains): > """narrowing algorithm for the constraint""" > domain = domains[self.variable].getValues() > - domain_dict = dict( domain ) > + domain_dict = Linkeddict(domain) > for cls, val in domain: > - for v in val: > - if v in domain_dict: > - val.extend(domain_dict[v]) > - domain_dict[cls] = val > - domains[self.variable].setValues(domain_dict.items()) > + if val in domain_dict: > + for v in domain_dict[val]: > + domain.append((cls,v)) > + domains[self.variable].setValues(domain) > > class SymmetricConstraint(OwlConstraint): > """Contraint: all values must be distinct""" > @@ -686,9 +693,24 @@ > def narrow(self, domains): > """narrowing algorithm for the constraint""" > domain = domains[self.variable].getValues() > - domain_dict = dict( domain ) > for cls, val in domain: > - for v in val: > - domain_dict.setdefault(v, []) > - domain_dict[v].append(cls) > - domains[self.variable].setValues(domain_dict.items()) > + if not (val, cls) in domain: > + domain.append((val,cls)) > + domains[self.variable].setValues(domain) > + > +class InverseofConstraint(SubClassConstraint): > + """Contraint: all values must be distinct""" > + > + def narrow(self, domains): > + """narrowing algorithm for the constraint""" > + obj_domain = domains[self.object].getValues() > + sub_domain = domains[self.variable].getValues() > + res = [] > + for cls, val in obj_domain: > + if not (val,cls) in sub_domain: > + raise ConsistencyFailure("Inverseof failed") > + for cls, val in sub_domain: > + if not (val,cls) in obj_domain: > + raise ConsistencyFailure("Inverseof failed") > +## res.append((val, cls)) > +## domains[self.variable].setValues(res) > > Modified: pypy/dist/pypy/lib/pyontology/test/test_ontology.py > ============================================================================== > --- pypy/dist/pypy/lib/pyontology/test/test_ontology.py (original) > +++ pypy/dist/pypy/lib/pyontology/test/test_ontology.py Fri Jan 6 > 15:48:57 2006 > @@ -17,7 +17,7 @@ > name = O.make_var(ClassDomain, var) > cod = name+' = 1' > exec cod > - assert O.make_var(ClassDomain, var) in locals() > + assert O.make_var(None, var) in locals() > assert isinstance(O.variables[name], ClassDomain) > > def test_subClassof(): > @@ -25,10 +25,11 @@ > a = URIRef(u'http://www.w3.org/2002/03owlt/unionOf/premises004#A') > b = URIRef(u'http://www.w3.org/2002/03owlt/unionOf/premises004#B') > c = URIRef(u'http://www.w3.org/2002/03owlt/unionOf/premises004#C') > - O.subClassOf(b, None, a) > - O.subClassOf(c, None, b) > A = O.make_var(ClassDomain, a) > C = O.make_var(ClassDomain, c) > + C = O.make_var(ClassDomain, b) > + O.subClassOf(b, None, a) > + O.subClassOf(c, None, b) > for con in O.constraints: > con.narrow(O.variables) > assert len(O.variables) == 3 > @@ -100,8 +101,10 @@ > pred = URIRef('type') > obj = URIRef('o') > O = Ontology() > + O.make_var(ClassDomain, obj) > O.type(sub, pred , obj) > - assert O.variables[O.make_var(ClassDomain, sub)].__class__ == > ClassDomain > + > + assert O.variables[O.make_var(None, sub)].__class__ == ClassDomain > > def test_ObjectProperty(): > sub = URIRef('a') > @@ -109,7 +112,7 @@ > obj = URIRef(namespaces['owl']+'#ObjectProperty') > O = Ontology() > O.type(sub, pred , obj) > - assert O.variables[O.make_var(ClassDomain, sub)].__class__ == > ObjectProperty > + assert O.variables[O.make_var(None, sub)].__class__ == ObjectProperty > > def test_range(): > O = Ontology() > @@ -123,7 +126,7 @@ > O.type(sub, pred , obj) > assert len(O.constraints) == 1 > O.constraints[0].narrow(O.variables) > - assert O.variables['a_'].getValues() == [(None,[1,2,3,4]),] > + assert O.variables['a_'].range == [1,2,3,4] > > def test_merge(): > O = Ontology() > @@ -140,7 +143,7 @@ > O.type(sub, pred , obj) > assert len(O.constraints) == 2 > O.consistency() > - assert O.variables['a_'].getValues() == [(None, [3,4]),] > + assert O.variables['a_'].range == [ 3,4] > > def test_domain(): > O = Ontology() > @@ -154,7 +157,7 @@ > O.type(sub, pred , obj) > assert len(O.constraints) == 1 > O.constraints[0].narrow(O.variables) > - assert O.variables['a_'].getValues() == [(O.variables['b_'], [None]),] > + assert O.variables['a_'].getValues() == [(O.variables['b_'], None),] > > def test_domain_merge(): > O = Ontology() > @@ -165,9 +168,8 @@ > obj = URIRef('c') > O.variables['c_'] = ClassDomain('c') > O.domain(sub, None , obj) > - pred = URIRef('type') > obj = URIRef(namespaces['owl']+'#ObjectProperty') > - O.type(sub, pred , obj) > + O.type(sub, None , obj) > > assert len(O.constraints) == 2 > for con in O.constraints: > @@ -204,7 +206,7 @@ > obj = URIRef('c') > O.type(sub, None, obj) > O.variables['p_'].setValues([('individ_',42)]) > - assert len(O.constraints) == 2 > + #assert len(O.constraints) == 2 > #add another valueof the property > O.variables['p_'].setValues([('individ_',42),('individ_',43)]) > #check that consistency raises > @@ -226,12 +228,12 @@ > obj = URIRef('c') > O.type(sub, None, obj) > O.variables['p_'].setValues([('individ_',42)]) > - assert len(O.constraints) == 2 > + #assert len(O.constraints) == 2 > #add another individual with the same value for the property > sub = URIRef('individ2') > obj = URIRef('c') > O.type(sub, None, obj) > - O.variables['p_'].setValues([('individ2_',42)]) > + O.variables['p_'].setValues([('individ_',42),('individ2_',42)]) > #check that consistency raises > py.test.raises(ConsistencyFailure, O.consistency) > > @@ -256,7 +258,7 @@ > O.type(sub, None, obj) > O.variables['subRegionOf_'].setValues([('Italy_','Tuscanny_'), > ('Tuscanny_','Chianti_')]) > O.consistency() > - assert ('Italy_', ['Tuscanny_', 'Chianti_']) in O. > variables['subRegionOf_'].getValues() > + assert ('Italy_', 'Chianti_') in O.variables['subRegionOf_'].getValues() > > def test_symmetricproperty(): > > @@ -265,6 +267,7 @@ > sub = URIRef('friend') > obj = URIRef(namespaces['owl']+'#SymmetricProperty') > O.type(sub, None, obj) > + assert O.variables[O.make_var(None, sub)].__class__. > __name__=='SymmetricProperty' > #Make class > sub = URIRef('c') > obj = URIRef(namespaces['owl']+'#Class') > @@ -276,8 +279,9 @@ > sub = URIRef('Alice') > O.type(sub, None, obj) > O.variables['friend_'].setValues([('Bob_','Alice_')]) > + print O.variables['friend_']._dict > O.consistency() > - assert ('Alice_', ['Bob_']) in O.variables['friend_'].getValues() > + assert ('Alice_', 'Bob_') in O.variables['friend_'].getValues() > > def no_test_maxcardinality(): > > @@ -301,6 +305,4 @@ > O.maxCardinality(sub, None, 1) > O.variables['friend_'].setValues([('Bob_',['Alice_','Finn_'])]) > O.consistency(verbose=5) > - print O.variables > - print O.constraints > assert not '_anon' in O.variables > \ No newline at end of file > _______________________________________________ > pypy-svn mailing list > pypy-svn(a)codespeak.net > http://codespeak.net/mailman/listinfo/pypy-svn > [View Less]

1 0

Re: [pypy-dev] OCSCON 2006 in Portland again, paper deadline Feb 13
by Laura Creighton Jan. 6, 2006

Jan. 6, 2006

In a message of Fri, 30 Dec 2005 00:16:09 +0100, Beatrice During writes: >Hi there > >We have such a calendar on codespeak - Michael have informed about it on >pypy-funding. You can find it: > >http://codespeak.net/pypy/dist/pypy/doc/contact.html > >or directly at: > >http://pypycal.sabi.net/. What program is this? how to add a new entry ... ie OSCON ... is not obvious for this bear of very little brain. What doc need I read? I still think a nice link on … [View More]

3 2

EU reports
by Carl Friedrich Bolz Jan. 5, 2006

Jan. 5, 2006

Hi PyPy-dev! I just checked in a new doc page containing short descriptions and links of/to the preliminary EU reports. The page is at: http://codespeak.net/pypy/dist/pypy/doc/index-report.html These reports (for all the people that did not help prepare them :-) ) contain big parts of our documentation but also quite a lot of new interesting content that supplements the regular Python documentation. Also: should I add a news item to make the reports more visible than just the links to … [View More]

2 1

impressions from CCC congress last week
by hpk＠trillke.net Jan. 4, 2006

Jan. 4, 2006

Hey there, here are some impressions from the Chaos Communication Congress in Berlin end last year (a few days ago). It again was a rather wild session of some 3000 hackers from various areas ... with higher broadband connectivity than the whole of Africa (10 Gbit) i heart. Only 1Gbit was actually used, though, including free VOIP-phoning to all of germany. This year i didn't attend so many talks also because they regularly lasted 1 hour - usually too much - but hardly enough for our … [View More]current PyPy talks :) Carl and me had some 350 listeners. It was a rather concentrated and nice atmosphere - despite our JIT preparation style. We had one guy from the Dylan group (Andreas Bogk) who involved Carl and me in a number of discussions where i wished that Samuele had been there :) The other talk about "EU-funding, Open Source and Agility" with Bea went very well and also brought some new contacts, among them a press guy who wants to report about PyPy on a suitable occassion. There apparently was some article about PyPy in a Linux magazine in November or December, btw, somebody told me. The two PyPy talks were filmed and we can probably provide mpeg's somewhere if there is interest. Also the 22C3 organisers themselves want to provide films+sounds from many talks, i think. What else? For example, "How to get a free parking license for Europe including all areas nobody is usually allowed to park on" - for purposes of "measuring networks". The successful solution is actually quite pythonic and was presented in a 5 minute lightning talk. Or how to use google maps to discover military airbases and nuclear power plants including number of trucks, airplane types and position and whatnot. Or on how to use Google to find lots of mp3's or other interesting content left by people in their public_html directories ... All easy stuff but with impressive results :) As always, the "trifinite" group and friends presented new ways to remote-control many of today's mobile phones, including complete surveilance and calling/SMSing on the owner's behalf etc. They had done that two years ago already when they analyzed the situation within the British Parliament ... but it seems the issues keep popping up. There are really many "interesting" examples of what you can do with control over mobile phones ... i find a funny one letting everyone in a tube station ring up their neighbour ... should feel a bit like being in the matrix. Some guys from Austria demonstrated a hack surveilling surveillance cameras and thus presenting the focus of police activities: randomly scanning around at windows to glimpse into rooms ... Carl and Bea went to more talks than me so they might have some funny ones to add. We also met Bert and Michael from Impara who are doing Smalltalk/Squeak stuff and some PyPy glue experiments. Christian was often around as well as was Stephan Diel and Boris Feigin, earlier PyPy sprint attenders. Nice chatting. All in all, this chaos communication conference is quite a rush and it is impossible to catch everything - so it's often a good idea to hang around in the large cafeteria area with some music and arts going on. Or to step outside into a snowy Berlin to breath different air ... cheers, holger [View Less]

1 0

pypy-sync announcement
by Eric van Riet Paap Jan. 4, 2006

Jan. 4, 2006

Hello, For tomorrow's #pypy-sync meeting at the regular time of 1PM we need someone to moderate. I will probably not be able to do it this time. Who wants to volunteer? cheers Eric

2 1

pypy and the singularity
by Carl Friedrich Bolz Jan. 3, 2006

Jan. 3, 2006

Hi all! Sorry, just had to post this: Hans Nowak wrote on comp.lang.python: > Robert Kern wrote: >> PyPy will not bring about the Singularity. > But if it did, imagine how cool that would look on the developers > resumes... :-) :-) Cheers, Carl Friedrich

1 0

Chalmers Winter Meeting paper
by Armin Rigo Jan. 2, 2006

Jan. 2, 2006

Hi all, For the Winter Meeting of the Chalmers technical university of Gothenburg, I've taken the architecture.txt document again, copied from its CCC version. I'll submit it tomorrow. It's checked in in http://codespeak.net/svn/pypy/extradoc/talk/chalmers . I had to decide how to attribute authors properly, which of course is not a trivial task. I've settled for putting only my own name under the title (as the presenter of the paper), with a footnote that lists all svn authors that have … [View More]

3 2

RE: [pypy-dev] Thread/gil/java question
by Drumheller, Michael Jan. 1, 2006

Jan. 1, 2006

Thank you for the quick response. Let me get this straight: If I use Jython instead of CPython, then my Python threads can migrate to different CPUs? Not sure what you meant by "... granularity is such that not much could be assumed for user programs..."--could you clarify that a bit? Thank you again. Mike D. -----Original Message----- From: Samuele Pedroni [mailto:pedronis@strakt.com] Sent: Thursday, December 29, 2005 10:40 AM To: Drumheller, Michael Cc: pypy-dev(a)codespeak.net Subject: … [View More]

3 2