Mercurial > code > home > repos > homeauto
annotate service/mqtt_to_rdf/candidate_binding.py @ 1667:a2347393b43e
comments, debug, dead code
author | drewp@bigasterisk.com |
---|---|
date | Tue, 21 Sep 2021 22:19:11 -0700 |
parents | 1a7c1261302c |
children | 3cf7f313b285 |
rev | line source |
---|---|
1632 | 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 |
1651
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
3 from typing import Dict, Iterator |
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 | 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 |
1667 | 15 class BindingConflict(ValueError): # might be the same as `Inconsistent` |
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
|
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): |
1664
1a7c1261302c
logic fix- some bindings were being returned 2+; some 0 times
drewp@bigasterisk.com
parents:
1651
diff
changeset
|
24 b = " ".join("%r=%r" % (var, value) for var, value in sorted(self.binding.items())) |
1607
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 |
1651
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
27 def apply(self, g: Graph, 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: |
1651
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
30 bound = ( |
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
31 self.applyTerm(stmt[0], returnBoundStatementsOnly), # |
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
32 self.applyTerm(stmt[1], returnBoundStatementsOnly), # |
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
33 self.applyTerm(stmt[2], returnBoundStatementsOnly)) |
1607
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
34 except BindingUnknown: |
1664
1a7c1261302c
logic fix- some bindings were being returned 2+; some 0 times
drewp@bigasterisk.com
parents:
1651
diff
changeset
|
35 if log.isEnabledFor(logging.DEBUG): |
1a7c1261302c
logic fix- some bindings were being returned 2+; some 0 times
drewp@bigasterisk.com
parents:
1651
diff
changeset
|
36 log.debug(f'{INDENT*7} CB.apply cant bind {stmt} using {self.binding}') |
1632 | 37 |
1607
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
38 continue |
1664
1a7c1261302c
logic fix- some bindings were being returned 2+; some 0 times
drewp@bigasterisk.com
parents:
1651
diff
changeset
|
39 if log.isEnabledFor(logging.DEBUG): |
1a7c1261302c
logic fix- some bindings were being returned 2+; some 0 times
drewp@bigasterisk.com
parents:
1651
diff
changeset
|
40 log.debug(f'{INDENT*7} CB.apply took {stmt} to {bound}') |
1632 | 41 |
1607
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
42 yield bound |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
43 |
1635
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
44 def applyTerm(self, term: Node, failUnbound=True): |
1607
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
45 if isinstance(term, (Variable, BNode)): |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
46 if term in self.binding: |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
47 return self.binding[term] |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
48 else: |
1619
e24058ae4806
support CB.apply(returnBoundStatementsOnly)
drewp@bigasterisk.com
parents:
1615
diff
changeset
|
49 if failUnbound: |
e24058ae4806
support CB.apply(returnBoundStatementsOnly)
drewp@bigasterisk.com
parents:
1615
diff
changeset
|
50 raise BindingUnknown() |
1607
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
51 return term |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
52 |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
53 def addNewBindings(self, newBindings: 'CandidateBinding'): |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
54 for k, v in newBindings.binding.items(): |
b21885181e35
more modules, types. Maybe less repeated computation on BoundLhs
drewp@bigasterisk.com
parents:
diff
changeset
|
55 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
|
56 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
|
57 self.binding[k] = v |
1635
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
58 |
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
59 def copy(self): |
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
60 return CandidateBinding(self.binding.copy()) |
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
61 |
22d481f0a924
refactor: use CandidateBinding throughout, not loose dicts
drewp@bigasterisk.com
parents:
1634
diff
changeset
|
62 def contains(self, term: BindableTerm): |
1651
20474ad4968e
WIP - functions are broken as i move most layers to work in Chunks not Triples
drewp@bigasterisk.com
parents:
1638
diff
changeset
|
63 return term in self.binding |