comparison service/mqtt_to_rdf/inference_test.py @ 1666:4fd9fdfcf16a

clean up dead tests
author drewp@bigasterisk.com
date Mon, 20 Sep 2021 23:20:46 -0700
parents 1a7c1261302c
children 23beadd3e83a
comparison
equal deleted inserted replaced
1665:82ddd3e6b227 1666:4fd9fdfcf16a
388 388
389 # def testList4(self): 389 # def testList4(self):
390 # inf = makeInferenceWithRules("{ :a :b (:e0 :e1 :e2 :e3) . } => { :new :stmt :here } .") 390 # inf = makeInferenceWithRules("{ :a :b (:e0 :e1 :e2 :e3) . } => { :new :stmt :here } .")
391 # implied = inf.infer(N3(":a :b (:e0 :e1 :e2 :e3) .")) 391 # implied = inf.infer(N3(":a :b (:e0 :e1 :e2 :e3) ."))
392 # self.assertGraphEqual(implied, N3(":new :stmt :here .")) 392 # self.assertGraphEqual(implied, N3(":new :stmt :here ."))
393
394
395 # def fakeStats():
396 # return defaultdict(lambda: 0)
397
398 # class TestLhsFindCandidateBindings(WithGraphEqual):
399
400 # def testBnodeMatchesStmt(self):
401 # l = Lhs(N3("[] :a :b ."))
402 # ws = ReadOnlyGraphAggregate([N3("[] :a :b .")])
403 # cands = list(l.findCandidateBindings(ws, fakeStats()))
404 # self.assertEqual(len(cands), 1)
405
406 # def testVarMatchesStmt(self):
407 # l = Lhs(N3("?x :a :b ."))
408 # ws = ReadOnlyGraphAggregate([N3("[] :a :b .")])
409 # cands = list(l.findCandidateBindings(ws, fakeStats()))
410 # self.assertEqual(len(cands), 1)
411
412 # def testListsOnlyMatchEachOther(self):
413 # l = Lhs(N3(":a :b (:e0 :e1) ."))
414 # ws = ReadOnlyGraphAggregate([N3(":a :b (:e0 :e1) .")])
415 # stats = fakeStats()
416 # cands = list(l.findCandidateBindings(ws, stats))
417 # self.assertLess(stats['permCountFailingVerify'], 20)