comparison: test/test_map.cpp
test/test_map.cpp
- changeset 556
- 3d19cae7e924
- child 561
- bb17790af41e
equal
deleted
inserted
replaced
| 555:d79fbd028e26 | 556:3d19cae7e924 |
|---|---|
| 1 /* | |
| 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. | |
| 3 * | |
| 4 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. | |
| 5 * | |
| 6 * Redistribution and use in source and binary forms, with or without | |
| 7 * modification, are permitted provided that the following conditions are met: | |
| 8 * | |
| 9 * 1. Redistributions of source code must retain the above copyright | |
| 10 * notice, this list of conditions and the following disclaimer. | |
| 11 * | |
| 12 * 2. Redistributions in binary form must reproduce the above copyright | |
| 13 * notice, this list of conditions and the following disclaimer in the | |
| 14 * documentation and/or other materials provided with the distribution. | |
| 15 * | |
| 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
| 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE | |
| 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
| 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
| 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
| 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
| 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
| 26 * POSSIBILITY OF SUCH DAMAGE. | |
| 27 */ | |
| 28 | |
| 29 #include "cx/hash_map.h" | |
| 30 #include "cx/utils.h" | |
| 31 #include "util_allocator.h" | |
| 32 | |
| 33 #include <gtest/gtest.h> | |
| 34 #include <unordered_map> | |
| 35 #include <unordered_set> | |
| 36 | |
| 37 struct map_operation { | |
| 38 enum { | |
| 39 put, rm | |
| 40 } op; | |
| 41 char const *key; | |
| 42 char const *value; | |
| 43 }; | |
| 44 | |
| 45 auto generate_map_operations() -> std::vector<map_operation> { | |
| 46 return { | |
| 47 {map_operation::put, "key 1", "test"}, | |
| 48 {map_operation::put, "key 2", "blub"}, | |
| 49 {map_operation::put, "key 3", "hallo"}, | |
| 50 {map_operation::put, "key 2", "foobar"}, | |
| 51 {map_operation::put, "key 4", "value 4"}, | |
| 52 {map_operation::put, "key 5", "value 5"}, | |
| 53 {map_operation::put, "key 6", "value 6"}, | |
| 54 {map_operation::rm, "key 4", nullptr}, | |
| 55 {map_operation::put, "key 7", "value 7"}, | |
| 56 {map_operation::put, "key 8", "value 8"}, | |
| 57 {map_operation::rm, "does not exist", nullptr}, | |
| 58 {map_operation::put, "key 9", "value 9"}, | |
| 59 {map_operation::put, "key 6", "other value"}, | |
| 60 {map_operation::put, "key 7", "something else"}, | |
| 61 {map_operation::rm, "key 8", nullptr}, | |
| 62 {map_operation::rm, "key 2", nullptr}, | |
| 63 {map_operation::put, "key 8", "new value"}, | |
| 64 }; | |
| 65 } | |
| 66 | |
| 67 static void verify_map_contents( | |
| 68 CxMap *map, | |
| 69 std::unordered_map<std::string, std::string> const &refmap | |
| 70 ) { | |
| 71 // verify key iterator | |
| 72 { | |
| 73 auto keyiter = cxMapIteratorKeys(map); | |
| 74 std::unordered_set<std::string> keys; | |
| 75 cx_foreach(CxDataPtr*, elem, keyiter) { | |
| 76 // we use that our test keys contain NULL-terminated strings | |
| 77 keys.insert(std::string(reinterpret_cast<const char *>(elem->data))); | |
| 78 } | |
| 79 ASSERT_EQ(keys.size(), map->size); | |
| 80 for (auto &&k: keys) { | |
| 81 EXPECT_NE(refmap.find(k), refmap.end()); | |
| 82 } | |
| 83 } | |
| 84 | |
| 85 // verify value iterator | |
| 86 { | |
| 87 auto valiter = cxMapIteratorValues(map); | |
| 88 std::unordered_set<std::string> values; // we use that the values in our test data are unique strings | |
| 89 cx_foreach(char const*, elem, valiter) { | |
| 90 values.insert(std::string(elem)); | |
| 91 } | |
| 92 ASSERT_EQ(values.size(), map->size); | |
| 93 for (auto &&v: values) { | |
| 94 EXPECT_NE(std::find_if(refmap.begin(), refmap.end(), | |
| 95 [v](auto const &e) { return e.second == v; }), refmap.end()); | |
| 96 } | |
| 97 } | |
| 98 | |
| 99 // verify pair iterator | |
| 100 { | |
| 101 auto pairiter = cxMapIterator(map); | |
| 102 std::unordered_map<std::string, std::string> pairs; | |
| 103 cx_foreach(CxMapEntry*, entry, pairiter) { | |
| 104 pairs[std::string((char const *) entry->key->data)] = std::string((char *) entry->value); | |
| 105 } | |
| 106 ASSERT_EQ(pairs.size(), refmap.size()); | |
| 107 for (auto &&p: pairs) { | |
| 108 ASSERT_EQ(p.second, refmap.at(p.first)); | |
| 109 } | |
| 110 } | |
| 111 } | |
| 112 | |
| 113 TEST(CxHashMap, Create) { | |
| 114 CxTestingAllocator allocator; | |
| 115 auto map = cxHashMapCreate(&allocator, 0); | |
| 116 auto hmap = reinterpret_cast<struct cx_hash_map_s *>(map); | |
| 117 EXPECT_GT(hmap->bucket_count, 0); | |
| 118 cx_for_n(i, hmap->bucket_count) { | |
| 119 EXPECT_EQ(hmap->buckets[i], nullptr); | |
| 120 } | |
| 121 EXPECT_EQ(map->size, 0); | |
| 122 EXPECT_EQ(map->allocator, &allocator); | |
| 123 | |
| 124 cxMapDestroy(map); | |
| 125 EXPECT_TRUE(allocator.verify()); | |
| 126 } | |
| 127 | |
| 128 TEST(CxHashMap, BasicOperations) { | |
| 129 // create the map | |
| 130 CxTestingAllocator allocator; | |
| 131 auto map = cxHashMapCreate(&allocator, 8); | |
| 132 | |
| 133 // create a reference map | |
| 134 std::unordered_map<std::string, std::string> refmap; | |
| 135 | |
| 136 // generate operations | |
| 137 auto ops = generate_map_operations(); | |
| 138 | |
| 139 // verify iterators for empty map | |
| 140 verify_map_contents(map, refmap); | |
| 141 | |
| 142 // execute operations and verify results | |
| 143 for (auto &&op: ops) { | |
| 144 CxDataPtr key = {reinterpret_cast<const unsigned char *>(op.key), 1 + strlen(op.key)}; | |
| 145 if (op.op == map_operation::put) { | |
| 146 // execute a put operation and verify that the exact value can be read back | |
| 147 refmap[std::string(op.key)] = std::string(op.value); | |
| 148 int result = cxMapPut(map, key, (void *) op.value); | |
| 149 EXPECT_EQ(result, 0); | |
| 150 auto added = cxMapGet(map, key); | |
| 151 EXPECT_EQ(memcmp(op.value, added, strlen(op.value)), 0); | |
| 152 } else { | |
| 153 // execute a remove and verify that the removed element was returned (or nullptr) | |
| 154 auto found = refmap.find(op.key); | |
| 155 auto removed = cxMapRemove(map, key); | |
| 156 if (found == refmap.end()) { | |
| 157 EXPECT_EQ(removed, nullptr); | |
| 158 } else { | |
| 159 EXPECT_EQ(std::string((char *) removed), found->second); | |
| 160 refmap.erase(found); | |
| 161 } | |
| 162 } | |
| 163 // compare the current map state with the reference map | |
| 164 verify_map_contents(map, refmap); | |
| 165 } | |
| 166 | |
| 167 // destroy the map and verify the memory (de)allocations | |
| 168 cxMapDestroy(map); | |
| 169 EXPECT_TRUE(allocator.verify()); | |
| 170 } |
