aboutsummaryrefslogtreecommitdiff
path: root/tests/Tests.hs
diff options
context:
space:
mode:
authorGravatar Benjamin Barenblat <bbaren@google.com>2018-03-23 18:34:42 -0400
committerGravatar Benjamin Barenblat <bbaren@google.com>2018-03-23 18:34:42 -0400
commit0ed87caa3481cbb6f8c2e809e5ec7df6f6245406 (patch)
treee7267e4b7996920577aa556ff7a67a312a271216 /tests/Tests.hs
parent3e898da300395bc3e63780b8d27a97fd4a9c375c (diff)
Data.Digest: Reify hash algorithms
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.
Diffstat (limited to 'tests/Tests.hs')
-rw-r--r--tests/Tests.hs13
1 files changed, 2 insertions, 11 deletions
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]