Function TEST

ExcaliburHashTest03.cpp:28–62

} // namespace Excalibur

TEST(SmFlatHashMap, BadHashFunction)
{
    Excalibur::HashTable<CustomStruct, int> ht;
    EXPECT_TRUE(ht.empty());
    EXPECT_EQ(ht.size(), 0u);
    EXPECT_GE(ht.capacity(), 0u);

    const int kNumElements = 500;
    for (int i = 0; i < kNumElements; i++)
    {
        int v = 3 + i;
        auto it = ht.emplace(CustomStruct{256 * i + 1}, v);
        EXPECT_TRUE(it.second);
    }

    for (int i = 0; i < kNumElements; i++)
    {
        auto v = ht.find(CustomStruct{256 * i + 1});
        ASSERT_NE(v, ht.iend());
        int refVal = 3 + i;
        EXPECT_EQ(v.value(), refVal);
    }

    // search for non-existing keys
    auto f0 = ht.find(CustomStruct{-3});
    EXPECT_EQ(f0, ht.iend());
    auto f1 = ht.find(CustomStruct{-13});
    EXPECT_EQ(f1, ht.iend());

    // erase non-existing keys
    bool e0 = ht.erase(CustomStruct{-3});
    EXPECT_FALSE(e0);
    bool e1 = ht.erase(CustomStruct{-13});
    EXPECT_FALSE(e1);
}

TEST(SmFlatHashMap, EmplaceEdgeCase)
{