Mercurial > code > home > repos > homeauto

changeset 1625:64f4fb8c233f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
mostly cleanup; scraps of the next rewrite; unskip tests that are ok now
author drewp@bigasterisk.com
date Wed, 08 Sep 2021 23:22:45 -0700
parents 91e9d4eb612a
children 7b3656867185
files service/mqtt_to_rdf/inference_test.py
diffstat 1 files changed, 3 insertions(+), 7 deletions(-) [+]
line wrap: on
line diff
--- a/service/mqtt_to_rdf/inference_test.py	Wed Sep 08 18:59:21 2021 -0700
+++ b/service/mqtt_to_rdf/inference_test.py	Wed Sep 08 23:22:45 2021 -0700
@@ -6,7 +6,7 @@
 from typing import cast
 import unittest
 
-from rdflib import RDF, BNode, ConjunctiveGraph, Graph, Literal, Namespace
+from rdflib import ConjunctiveGraph, Graph, Literal, Namespace
 from rdflib.graph import ReadOnlyGraphAggregate
 from rdflib.parser import StringInputSource
 
@@ -245,7 +245,6 @@
         valueF = cast(Decimal, vlit.toPython())
         self.assertAlmostEqual(float(valueF), 75.02)
 
-    @unittest.skip("still too slow")
     def testPerformance1(self):
         inf = makeInferenceWithRules('''
             {
@@ -253,7 +252,7 @@
                 :topic ( "air_quality_indoor" "sensor" "bme280_temperature" "state" );
                 :bodyFloat ?valueC .
               ?valueC math:greaterThan -999 .
-              ?valueC :asFarenheit ?valueF .
+              ?valueC room:asFarenheit ?valueF .
             } => {
               :airQualityIndoorTemperature :temperatureF ?valueF .
             } .
@@ -287,7 +286,6 @@
         implied = inf.infer(N3(":a :b (:e0 :e1 :e2) ."))
         self.assertGraphEqual(implied, N3(":new :stmt :here ."))
 
-    @unittest.skip("still too slow")
     def testList4(self):
         inf = makeInferenceWithRules("{ :a :b (:e0 :e1 :e2 :e3) . } => { :new :stmt :here } .")
         implied = inf.infer(N3(":a :b (:e0 :e1 :e2 :e3) ."))
@@ -311,11 +309,9 @@
         cands = list(l.findCandidateBindings(ws, fakeStats()))
         self.assertEqual(len(cands), 1)
 
-    @unittest.skip("still too slow")
     def testListsOnlyMatchEachOther(self):
         l = Lhs(N3(":a :b (:e0 :e1) ."))
         ws = ReadOnlyGraphAggregate([N3(":a :b (:e0 :e1) .")])
         stats = fakeStats()
         cands = list(l.findCandidateBindings(ws, stats))
-        self.assertLess(stats['permCountFailingVerify'], 20)
-        self.fail(str(cands))
\ No newline at end of file
+        self.assertLess(stats['permCountFailingVerify'], 20)
\ No newline at end of file