#[cfg(test)]
pub(super) const COUNT: usize = PROVIDERS.len();
const PROVIDERS: [&str; 28] = [
"aol.com",
"fastmail.com",
"gmail.com",
"gmx.com",
"gmx.net",
"hey.com",
"hotmail.co.uk",
"hotmail.com",
"icloud.com",
"live.co.uk",
"live.com",
"mail.com",
"me.com",
"msn.com",
"outlook.co.uk",
"outlook.com",
"pm.me",
"proton.me",
"protonmail.com",
"tuta.com",
"tutanota.com",
"yahoo.co.in",
"yahoo.co.jp",
"yahoo.co.uk",
"yahoo.com",
"yandex.com",
"yandex.ru",
"zoho.com",
];
pub(super) fn suggest(domain: &str) -> Option<&'static str> {
if PROVIDERS.binary_search(&domain).is_ok() {
return None;
}
PROVIDERS
.iter()
.copied()
.find(|candidate| adjacent_transposition(domain.as_bytes(), candidate.as_bytes()))
}
fn adjacent_transposition(left: &[u8], right: &[u8]) -> bool {
if left.len() != right.len() {
return false;
}
let mut differences = left
.iter()
.zip(right)
.enumerate()
.filter_map(|(index, (left, right))| (left != right).then_some(index));
let (Some(first), Some(second), None) =
(differences.next(), differences.next(), differences.next())
else {
return false;
};
second == first + 1 && left[first] == right[second] && left[second] == right[first]
}