compat.gtl

// compat.gtl — exercise the two container families that are the reason to pull
// gtl in: the Swiss-table flat_hash_map and the ordered btree_set. Every check
// asserts observable behaviour (contents, ordering, erasure), not just that the
// headers compile.
#include <gtl/phmap.hpp>
#include <gtl/btree.hpp>
import std;

int main() {
    bool ok = true;
    auto check = [&](bool cond, std::string_view what) {
        if (!cond) {
            std::println("FAIL: {}", what);
            ok = false;
        }
    };

    // ---- flat_hash_map ---------------------------------------------------
    gtl::flat_hash_map<std::string, int> m;
    for (int i = 0; i < 1000; ++i) m.emplace(std::format("k{}", i), i);
    check(m.size() == 1000, "flat_hash_map size after 1000 emplaces");
    check(m.at("k0") == 0 && m.at("k999") == 999, "lookup returns what was stored");
// …