Function FL_TEST_FILE

tests/fl/stl/unordered_map.cpp:22–1687

#include "fl/stl/int.h"

FL_TEST_FILE(FL_FILEPATH) {

using namespace fl;

FL_TEST_CASE("Empty map properties") {
    fl::unordered_map<int, int> m;
    FL_REQUIRE_EQ(m.size(), 0u);
    FL_REQUIRE(!m.find_value(42));
    // begin()==end() on empty
    FL_REQUIRE(m.begin() == m.end());
}

FL_TEST_CASE("Single insert, lookup & operator[]") {
    fl::unordered_map<int, int> m;
    m.insert(10, 20);
    FL_REQUIRE_EQ(m.size(), 1u);
    auto *v = m.find_value(10);
    FL_REQUIRE(v);
    FL_REQUIRE_EQ(*v, 20);

    // operator[] default-construct & assignment
    fl::unordered_map<int, fl::string> ms;
    auto &ref = ms[5];
    FL_REQUIRE(ref.empty()); // default-constructed
    FL_REQUIRE_EQ(ms.size(), 1u);
    ref = "hello";
    FL_REQUIRE_EQ(*ms.find_value(5), "hello");

    // operator[] overwrite existing
    ms[5] = "world";
    FL_REQUIRE_EQ(ms.size(), 1u);
    FL_REQUIRE_EQ(*ms.find_value(5), "world");
}

FL_TEST_CASE("Insert duplicate key overwrites without growing") {
    fl::unordered_map<int, fl::string> m;
    m.insert(1, "foo");
    FL_REQUIRE_EQ(m.size(), 1u);
    FL_REQUIRE_EQ(*m.find_value(1), "foo");

    m.insert(1, "bar");
    FL_REQUIRE_EQ(m.size(), 1u);
    FL_REQUIRE_EQ(*m.find_value(1), "bar");
}

FL_TEST_CASE("Multiple distinct inserts & lookups") {
    fl::unordered_map<char, int> m;
    int count = 0;
    for (char c = 'a'; c < 'a' + 10; ++c) {
        FL_MESSAGE("insert " << count++);
        m.insert(c, c - 'a');
    }
    FL_REQUIRE_EQ(m.size(), 10u);
    for (char c = 'a'; c < 'a' + 10; ++c) {
        auto *v = m.find_value(c);
        FL_REQUIRE(v);
        FL_REQUIRE_EQ(*v, static_cast<int>(c - 'a'));
    }