Mercurial > code > home > repos > homeauto

annotate service/mqtt_to_rdf/candidate_binding.py @ 1640:4bb6f593ebf3

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
speedups: abort some rules faster
author drewp@bigasterisk.com
date Wed, 15 Sep 2021 23:56:02 -0700
parents 0ba1625037ae
children 20474ad4968e
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
1632
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
1 import logging
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
2 from dataclasses import dataclass
1615
bcfa368e5498 change a Graph.__sub__ to Set.difference in verify() for a big speedup
drewp@bigasterisk.com
parents: 1607
diff changeset
3 from typing import Dict, Iterable, Iterator, Union
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
4
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
5 from prometheus_client import Summary
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
6 from rdflib import BNode, Graph
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
7 from rdflib.term import Node, Variable
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
8
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
9 from inference_types import BindableTerm, BindingUnknown, Triple
1638
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
10
1634
ba59cfc3c747 hack math:sum in there. Test suite is passing except some slow performers
drewp@bigasterisk.com
parents: 1632
diff changeset
11 log = logging.getLogger('cbind')
1632
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
12 INDENT = ' '
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
13
1638
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
14
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
15 class BindingConflict(ValueError):
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
16 pass
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
17
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
18
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
19 @dataclass
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
20 class CandidateBinding:
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
21 binding: Dict[BindableTerm, Node]
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
22
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
23 def __repr__(self):
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
24 b = " ".join("%s=%s" % (k, v) for k, v in sorted(self.binding.items()))
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
25 return f'CandidateBinding({b})'
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
26
1619
e24058ae4806 support CB.apply(returnBoundStatementsOnly)
drewp@bigasterisk.com
parents: 1615
diff changeset
27 def apply(self, g: Union[Graph, Iterable[Triple]], returnBoundStatementsOnly=True) -> Iterator[Triple]:
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
28 for stmt in g:
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
29 try:
1638
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
30 bound = (self.applyTerm(stmt[0], returnBoundStatementsOnly), self.applyTerm(stmt[1], returnBoundStatementsOnly),
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
31 self.applyTerm(stmt[2], returnBoundStatementsOnly))
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
32 except BindingUnknown:
1632
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
33 log.debug(f'{INDENT*7} CB.apply cant bind {stmt} using {self.binding}')
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
34
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
35 continue
1632
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
36 log.debug(f'{INDENT*7} CB.apply took {stmt} to {bound}')
bd79a2941cab just (a lot of) debug changes
drewp@bigasterisk.com
parents: 1619
diff changeset
37
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
38 yield bound
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
39
1635
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
40 def applyTerm(self, term: Node, failUnbound=True):
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
41 if isinstance(term, (Variable, BNode)):
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
42 if term in self.binding:
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
43 return self.binding[term]
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
44 else:
1619
e24058ae4806 support CB.apply(returnBoundStatementsOnly)
drewp@bigasterisk.com
parents: 1615
diff changeset
45 if failUnbound:
e24058ae4806 support CB.apply(returnBoundStatementsOnly)
drewp@bigasterisk.com
parents: 1615
diff changeset
46 raise BindingUnknown()
1607
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
47 return term
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
48
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
49 def addNewBindings(self, newBindings: 'CandidateBinding'):
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
50 for k, v in newBindings.binding.items():
b21885181e35 more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff changeset
51 if k in self.binding and self.binding[k] != v:
1638
0ba1625037ae don't crash, just skip the rule if there's a BindingConflict (no clear test case yet)
drewp@bigasterisk.com
parents: 1635
diff changeset
52 raise BindingConflict(f'thought {k} would be {self.binding[k]} but another Evaluation said it should be {v}')
1615
bcfa368e5498 change a Graph.__sub__ to Set.difference in verify() for a big speedup
drewp@bigasterisk.com
parents: 1607
diff changeset
53 self.binding[k] = v
1635
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
54
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
55 def copy(self):
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
56 return CandidateBinding(self.binding.copy())
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
57
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
58 def contains(self, term: BindableTerm):
22d481f0a924 refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents: 1634
diff changeset
59 return term in self.binding