#include "net/first_party_sets/sets_mutation.h"
#include <algorithm>
#include <map>
#include <utility>
#include "base/containers/map_util.h"
#include "net/base/schemeful_site.h"
#include "net/first_party_sets/first_party_set_entry.h"
namespace net {
SetsMutation::SetsMutation(
std::vector<base::flat_map<SchemefulSite, FirstPartySetEntry>>
replacement_sets,
std::vector<base::flat_map<SchemefulSite, FirstPartySetEntry>>
addition_sets,
base::flat_map<SchemefulSite, SchemefulSite> aliases)
: replacements_(std::move(replacement_sets)),
additions_(std::move(addition_sets)),
aliases_(std::move(aliases)) {
std::map<SchemefulSite, int> site_counts;
for (const auto& set : replacements_) {
for (const auto& [site, unused_entry] : set) {
site_counts[site]++;
}
}
for (const auto& set : additions_) {
for (const auto& [site, unused_entry] : set) {
site_counts[site]++;
}
}
CHECK(std::ranges::all_of(site_counts,
[](const std::pair<const SchemefulSite, int>& p) {
return p.second == 1;
}));
CHECK(std::ranges::all_of(aliases_, [&](const auto& pair) -> bool {
const auto contains_entries = [&](const auto& set) -> bool {
const FirstPartySetEntry* alias_entry = base::FindOrNull(set, pair.first);
const FirstPartySetEntry* canonical_entry =
base::FindOrNull(set, pair.second);
return alias_entry && canonical_entry && *alias_entry == *canonical_entry;
};
return std::ranges::any_of(replacements_, contains_entries) ||
std::ranges::any_of(additions_, contains_entries);
}));
}
SetsMutation::SetsMutation() = default;
SetsMutation::SetsMutation(SetsMutation&&) = default;
SetsMutation& SetsMutation::operator=(SetsMutation&&) = default;
SetsMutation::SetsMutation(const SetsMutation&) = default;
SetsMutation& SetsMutation::operator=(const SetsMutation&) = default;
SetsMutation::~SetsMutation() = default;
bool SetsMutation::operator==(const SetsMutation& other) const = default;
std::ostream& operator<<(std::ostream& os, const SetsMutation& mutation) {
os << "replacements: {";
for (const auto& set : mutation.replacements()) {
for (const auto& pair : set) {
os << pair.first << " -> " << pair.second << ", ";
}
}
os << "}, additions: {";
for (const auto& set : mutation.additions()) {
for (const auto& pair : set) {
os << pair.first << " -> " << pair.second << ", ";
}
}
os << "}";
return os;
}
}
