1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
// Copyright (C) 2010-2020 Joel Rosdahl and other contributors
//
// See doc/AUTHORS.adoc for a complete list of contributors.
//
// This program is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the Free
// Software Foundation; either version 3 of the License, or (at your option)
// any later version.
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
// more details.
//
// You should have received a copy of the GNU General Public License along with
// this program; if not, write to the Free Software Foundation, Inc., 51
// Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
#include "../src/Hash.hpp"
#include "third_party/doctest.h"
TEST_SUITE_BEGIN("Hash");
TEST_CASE("known strings")
{
SUBCASE("initial state")
{
CHECK(Hash().digest().to_string() == "af1396svbud1kqg40jfa6reciicrpcisi");
}
SUBCASE("empty string")
{
CHECK(Hash().hash("").digest().to_string()
== "af1396svbud1kqg40jfa6reciicrpcisi");
}
SUBCASE("a")
{
CHECK(Hash().hash("a").digest().to_string()
== "17765vetiqd4ae95qpbhfb1ut8gj42r6m");
}
SUBCASE("message digest")
{
CHECK(Hash().hash("message digest").digest().to_string()
== "7bc2kbnbinerv6ruptldpdrb8ko93hcdo");
}
SUBCASE("long string")
{
const char long_string[] =
"123456789012345678901234567890123456789012345678901234567890"
"12345678901234567890";
CHECK(Hash().hash(long_string).digest().to_string()
== "f263ljqhc8co1ee8rpeq98bt654o9o2qm");
}
}
TEST_CASE("Hash::digest should not alter state")
{
Hash h;
h.hash("message");
h.digest();
h.hash(" digest");
CHECK(h.digest().to_string() == "7bc2kbnbinerv6ruptldpdrb8ko93hcdo");
}
TEST_CASE("Hash::digest should be idempotent")
{
Hash h;
CHECK(h.digest().to_string() == "af1396svbud1kqg40jfa6reciicrpcisi");
CHECK(h.digest().to_string() == "af1396svbud1kqg40jfa6reciicrpcisi");
}
TEST_CASE("Digest::bytes")
{
Digest d = Hash().hash("message digest").digest();
uint8_t expected[Digest::size()] = {
0x7b, 0xc2, 0xa2, 0xee, 0xb9, 0x5d, 0xdb, 0xf9, 0xb7, 0xec,
0xf6, 0xad, 0xcb, 0x76, 0xb4, 0x53, 0x09, 0x1c, 0x58, 0xdc,
};
CHECK(memcmp(d.bytes(), expected, Digest::size()) == 0);
}
TEST_SUITE_END();
|
