Function FL_TEST_FILE

tests/fl/stl/multi_map.cpp:6–515

#include "test.h"

FL_TEST_FILE(FL_FILEPATH) {

using namespace fl;

FL_TEST_CASE("fl::multi_map basic operations") {
    fl::multi_map<int, fl::string> mm;

    FL_SUBCASE("Empty multimap") {
        FL_CHECK(mm.empty());
        FL_CHECK(mm.size() == 0);
    }

    FL_SUBCASE("Insert single element") {
        auto it = mm.insert({1, "one"});
        FL_CHECK(mm.size() == 1);
        FL_CHECK(mm.contains(1));
        FL_CHECK(it->first == 1);
        FL_CHECK(it->second == "one");
    }

    FL_SUBCASE("Insert duplicate keys") {
        mm.insert({1, "first"});
        mm.insert({1, "second"});
        mm.insert({1, "third"});

        FL_CHECK(mm.size() == 3);
        FL_CHECK(mm.count(1) == 3);

        // All values should be findable
        auto range = mm.equal_range(1);
        int count = 0;
        for (auto it = range.first; it != range.second; ++it) {
            count++;
        }
        FL_CHECK(count == 3);
    }

    FL_SUBCASE("Insert different keys") {
        mm.insert({1, "one"});
        mm.insert({2, "two"});
        mm.insert({3, "three"});

        FL_CHECK(mm.size() == 3);
        FL_CHECK(mm.count(1) == 1);
        FL_CHECK(mm.count(2) == 1);
        FL_CHECK(mm.count(3) == 1);
    }

    FL_SUBCASE("Find operations") {
        mm.insert({10, "ten"});
        mm.insert({20, "twenty"});

        auto it = mm.find(10);
        FL_CHECK(it != mm.end());
        FL_CHECK(it->first == 10);
        FL_CHECK(it->second == "ten");

        auto missing = mm.find(999);