CacheKeyComputer: re-use dict hash logic for morphology hashing

CacheKeyComputer already re-invents the wheel for hashing a dict,
so re-use that logic rather than re-implement it as creating a
huge string.

1 files changed, 0 insertions, 13 deletions

diff --git a/morphlib/cachekeycomputer_tests.py b/morphlib/cachekeycomputer_tests.py
index 32aef02e..807fbe89 100644
--- a/morphlib/cachekeycomputer_tests.py
+++ b/morphlib/cachekeycomputer_tests.py
@@ -166,17 +166,4 @@ class CacheKeyComputerTests(unittest.TestCase):
         old_sha = self.ckc.compute_key(old_artifact)
         new_sha = self.ckc.compute_key(new_artifact)
         self.assertEqual(old_sha, new_sha)
-        
-    def test_stringifies_string(self):
-        self.assertEqual(self.ckc._stringify('foo'), 'foo')
-        
-    def test_stringifies_integer(self):
-        self.assertEqual(self.ckc._stringify(12765), '12765')
-        
-    def test_stringifies_dict(self):
-        self.assertEqual(self.ckc._stringify({'foo': 'bar', 'yo': 'foobar' }),
-                         '{foo:bar,yo:foobar}')
-        
-    def test_stringifies_list(self):
-        self.assertEqual(self.ckc._stringify(['foo', 'bar']), '[foo,bar]')