len(mussa.paths()) should equal the number of found paths

[mussa.git] / py / test / TestMussa.py

diff --git a/py/test/TestMussa.py b/py/test/TestMussa.py
index 84062ae747eda7b5722219e688281df71cea55ca..953b334cbb412d6a056505416b29626c478a9dc9 100644 (file)
--- a/py/test/TestMussa.py
+++ b/py/test/TestMussa.py
@@ -10,20 +10,23 @@ import mussa
 class TestMussa(unittest.TestCase):
   def testSimple(self):
     s1 = mussa.Sequence("A"*10)
-    s2 = mussa.Sequence("GG"+"A"*8+"GG")
-    s3 = mussa.Sequence("T"*10)
+    s2 = mussa.Sequence("GG"+"A"*10)
+    s3 = mussa.Sequence("A"*10)
     m = mussa.Mussa()
     m.window = 10
-    m.threshold = 8
+    m.threshold = 10
     m.add_sequence(s1)
     m.add_sequence(s2)
     m.add_sequence(s3)
     m.analyze()
     # this could probably be a more thorough test
-    self.failUnless( len(m.paths()), 3 )
+    paths = m.paths()
+    self.failUnlessEqual( len(paths), 1 )
+    pathz_list = [ x for x in paths.pathz ]
+    self.failUnlessEqual( len(paths), len(pathz_list) )
 
 def suite():
   return unittest.makeSuite(TestMussa, 'test')
 
 if __name__ == "__main__":
-  sys.exit(unittest.main(defaultTest='suite'))
\ No newline at end of file
+  sys.exit(unittest.main(defaultTest='suite'))