summaryrefslogtreecommitdiffstats
path: root/util/generic/hash_ut.cpp
diff options
context:
space:
mode:
authormihaild <[email protected]>2022-02-10 16:46:59 +0300
committerDaniil Cherednik <[email protected]>2022-02-10 16:46:59 +0300
commit55fa8c7df8dba9a6fda8a807e529a9d04bd88580 (patch)
treeb83306b6e37edeea782e9eed673d89286c4fef35 /util/generic/hash_ut.cpp
parent246417ad6168d3f7ab4a0cf1c79ba4259f7c45ae (diff)
Restoring authorship annotation for <[email protected]>. Commit 2 of 2.
Diffstat (limited to 'util/generic/hash_ut.cpp')
-rw-r--r--util/generic/hash_ut.cpp12
1 files changed, 6 insertions, 6 deletions
diff --git a/util/generic/hash_ut.cpp b/util/generic/hash_ut.cpp
index 2a7eba2f49c..0551d587708 100644
--- a/util/generic/hash_ut.cpp
+++ b/util/generic/hash_ut.cpp
@@ -295,13 +295,13 @@ void THashTest::TestHMMap1() {
mmap m;
UNIT_ASSERT(m.count('X') == 0);
- m.insert(std::pair<const char, int>('X', 10)); // Standard way.
+ m.insert(std::pair<const char, int>('X', 10)); // Standard way.
UNIT_ASSERT(m.count('X') == 1);
- m.insert(std::pair<const char, int>('X', 20)); // jbuck: standard way
+ m.insert(std::pair<const char, int>('X', 20)); // jbuck: standard way
UNIT_ASSERT(m.count('X') == 2);
- m.insert(std::pair<const char, int>('Y', 32)); // jbuck: standard way
+ m.insert(std::pair<const char, int>('Y', 32)); // jbuck: standard way
mmap::iterator i = m.find('X'); // Find first match.
UNIT_ASSERT((*i).first == 'X');
@@ -358,9 +358,9 @@ void THashTest::TestHMMap1() {
void THashTest::TestHMMapHas() {
using mmap = THashMultiMap<char, int, THash<char>, TEqualTo<char>>;
mmap m;
- m.insert(std::pair<const char, int>('X', 10));
- m.insert(std::pair<const char, int>('X', 20));
- m.insert(std::pair<const char, int>('Y', 32));
+ m.insert(std::pair<const char, int>('X', 10));
+ m.insert(std::pair<const char, int>('X', 20));
+ m.insert(std::pair<const char, int>('Y', 32));
UNIT_ASSERT(m.contains('X'));
UNIT_ASSERT(m.contains('Y'));
UNIT_ASSERT(!m.contains('Z'));