tg_windows5.12.6/Telegram/lib_base/base/flat_map_tests.cpp

// This file is part of Desktop App Toolkit,
// a set of libraries for developing nice desktop applications.
//
// For license and copyright information please follow this link:
// https://github.com/desktop-app/legal/blob/master/LEGAL
//
#include <catch.hpp>

#include "base/flat_map.h"
#include <string>

struct int_wrap {
	int value;
};
struct int_wrap_comparator {
	inline bool operator()(const int_wrap &a, const int_wrap &b) const {
		return a.value < b.value;
	}
};

using namespace std;

TEST_CASE("flat_maps should keep items sorted by key", "[flat_map]") {
	base::flat_map<int, string> v;
	v.emplace(0, "a");
	v.emplace(5, "b");
	v.emplace(4, "d");
	v.emplace(2, "e");

	auto checkSorted = [&] {
		auto prev = v.begin();
		REQUIRE(prev != v.end());
		for (auto i = prev + 1; i != v.end(); prev = i, ++i) {
			REQUIRE(prev->first < i->first);
		}
	};
	REQUIRE(v.size() == 4);
	checkSorted();

	SECTION("adding item puts it in the right position") {
		v.emplace(3, "c");
		REQUIRE(v.size() == 5);
		REQUIRE(v.find(3) != v.end());
		checkSorted();
	}
}

TEST_CASE("simple flat_maps tests", "[flat_map]") {
	SECTION("copy constructor") {
		base::flat_map<int, string> v;
		v.emplace(0, "a");
		v.emplace(2, "b");
		auto u = v;
		REQUIRE(u.size() == 2);
		REQUIRE(u.find(0) == u.begin());
		REQUIRE(u.find(2) == u.end() - 1);
	}
	SECTION("assignment") {
		base::flat_map<int, string> v, u;
		v.emplace(0, "a");
		v.emplace(2, "b");
		u = v;
		REQUIRE(u.size() == 2);
		REQUIRE(u.find(0) == u.begin());
		REQUIRE(u.find(2) == u.end() - 1);
	}
}

TEST_CASE("flat_maps custom comparator", "[flat_map]") {
	base::flat_map<int_wrap, string, int_wrap_comparator> v;
	v.emplace(int_wrap{ 0 }, "a");
	v.emplace(int_wrap{ 5 }, "b");
	v.emplace(int_wrap{ 4 }, "d");
	v.emplace(int_wrap{ 2 }, "e");

	auto checkSorted = [&] {
		auto prev = v.begin();
		REQUIRE(prev != v.end());
		for (auto i = prev + 1; i != v.end(); prev = i, ++i) {
			REQUIRE(int_wrap_comparator()(prev->first, i->first));
		}
	};
	REQUIRE(v.size() == 4);
	checkSorted();

	SECTION("adding item puts it in the right position") {
		v.emplace(int_wrap{ 3 }, "c");
		REQUIRE(v.size() == 5);
		REQUIRE(v.find({ 3 }) != v.end());
		checkSorted();
	}
}

TEST_CASE("flat_maps structured bindings", "[flat_map]") {
	base::flat_map<int, std::unique_ptr<double>> v;
	v.emplace(0, std::make_unique<double>(0.));
	v.emplace(1, std::make_unique<double>(1.));

	SECTION("structred binded range-based for loop") {
		for (const auto &[key, value] : v) {
			REQUIRE(key == int(std::round(*value)));
		}
	}

	SECTION("non-const structured binded range-based for loop") {
		base::flat_map<int, int> second = {
			{ 1, 1 },
			{ 2, 2 },
			{ 2, 3 },
			{ 3, 3 },
		};
		REQUIRE(second.size() == 3);
		//for (auto [a, b] : second) { // #MSVC Bug, reported
		//	REQUIRE(a == b);
		//}
		for (const auto [a, b] : second) {
			REQUIRE(a == b);
		}
	}
}