From 0ed87caa3481cbb6f8c2e809e5ec7df6f6245406 Mon Sep 17 00:00:00 2001
From: Benjamin Barenblat <bbaren@google.com>
Date: Fri, 23 Mar 2018 18:34:42 -0400
Subject: Data.Digest: Reify hash algorithms
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Eliminate the functional interface for hashing. Hashing now occurs
exclusively through the `hash` function, which accepts a
`Data.Digest.Algorithm`. This makes btls somewhat less extensible, but
it’s the most elegant way to support HMACs.
---
 tests/Tests.hs | 13 ++-----------
 1 file changed, 2 insertions(+), 11 deletions(-)

(limited to 'tests/Tests.hs')

diff --git a/tests/Tests.hs b/tests/Tests.hs
index caec20a..565ab16 100644
--- a/tests/Tests.hs
+++ b/tests/Tests.hs
@@ -4,16 +4,7 @@ module Main
 
 import Test.Tasty (defaultMain, testGroup)
 
-import qualified Data.Digest.Md5Tests
-import qualified Data.Digest.Sha1Tests
-import qualified Data.Digest.Sha2Tests
+import qualified Data.DigestTests
 
 main :: IO ()
-main =
-  defaultMain $
-  testGroup
-    "btls"
-    [ Data.Digest.Md5Tests.tests
-    , Data.Digest.Sha1Tests.tests
-    , Data.Digest.Sha2Tests.tests
-    ]
+main = defaultMain $ testGroup "btls" [Data.DigestTests.tests]
-- 
cgit v1.2.3