Function test_map_insert_erase_iterators

tests/test_container_helpers.h:964–987

// Verifies: insert returns valid iterator, erase returns next iterator
template<template<typename, typename> class MapTemplate>
void test_map_insert_erase_iterators() {
    using MapContainer = MapTemplate<int, fl::shared_ptr<int>>;

    MapContainer m;
    populate_map(m, 5, make_shared_int(50));
    populate_map(m, 15, make_shared_int(150));

    // Insert and get iterator
    auto result = m.insert(fl::pair<int, fl::shared_ptr<int>>(10, make_shared_int(100)));
    FL_CHECK(result.second == true);  // insertion took place
    FL_CHECK(result.first != m.end());
    FL_CHECK(result.first->first == 10);

    // Erase and verify next iterator
    auto erase_result = m.erase(result.first);
    // After erase, either at end or the key should be > 10
    bool valid = (erase_result == m.end());
    if (!valid) {
        valid = erase_result->first > 10;
    }
    FL_CHECK(valid);

    FL_CHECK(m.size() == 2);  // Two elements left
}

// Test count and contains
// Verifies: key lookup operations work correctly