use crate::Id;
use std::collections::HashSet;
pub(crate) const ROOT: u64 = 1;
pub(crate) const ANNOUNCE_POLITE: u64 = 2;
pub(crate) const ANNOUNCE_ASSERTIVE: u64 = 3;
const RESERVED: u64 = 16;
fn outside_reserved(value: u64) -> u64 {
if value < RESERVED {
value | 1 << 63
} else {
value
}
}
fn mix(mut value: u64) -> u64 {
value = (value ^ (value >> 30)).wrapping_mul(0xbf58_476d_1ce4_e5b9);
value = (value ^ (value >> 27)).wrapping_mul(0x94d0_49bb_1331_11eb);
value ^ (value >> 31)
}
pub(crate) fn node(id: Id) -> u64 {
outside_reserved(id.value())
}
pub(crate) fn run(owner: u64, run: usize) -> u64 {
outside_reserved(mix(owner ^ mix(run as u64 ^ 0x7a61_7869_735f_7275)))
}
pub(crate) fn alternate(id: u64, attempt: u64) -> u64 {
outside_reserved(mix(id ^ mix(attempt)))
}
pub(crate) fn unique(base: u64, used: &mut HashSet<u64>) -> u64 {
let (mut id, mut attempt) = (base, 0);
while !used.insert(id) {
attempt += 1;
id = alternate(base, attempt);
}
id
}