pub const JUMP_KEYS: &[char] = &[
'a', 's', 'd', 'f', 'g', 'e', 'r', 't', 'u', 'i', 'w', 'n', 'm', 'c', 'v', 'b', 'x', 'z', 'y',
'p',
];
pub fn jump_codes(n: usize) -> Vec<String> {
let k = JUMP_KEYS.len();
let mut len = 1usize;
let mut cap = k;
while cap < n {
len += 1;
cap = cap.saturating_mul(k);
}
(0..n)
.map(|mut i| {
let mut code = vec![' '; len];
for slot in code.iter_mut().rev() {
*slot = JUMP_KEYS[i % k];
i /= k;
}
code.into_iter().collect()
})
.collect()
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn jump_codes_are_unique_and_avoid_nav_keys() {
for n in [1, 5, 20, 21, 100, 400, 401, 1000] {
let codes = jump_codes(n);
assert_eq!(codes.len(), n);
let unique: std::collections::HashSet<_> = codes.iter().collect();
assert_eq!(unique.len(), codes.len());
for code in &codes {
assert!(
!code.chars().any(|c| "hjkloq".contains(c)),
"code {code:?} collides with overview navigation"
);
}
}
}
#[test]
fn jump_codes_shape() {
assert_eq!(jump_codes(3), vec!["a", "s", "d"]);
let codes = jump_codes(21);
assert!(codes.iter().all(|c| c.chars().count() == 2));
assert_eq!(codes[0], "aa");
assert_eq!(jump_codes(25)[1], "as");
assert_eq!(jump_codes(25)[20], "sa");
let codes = jump_codes(500);
assert!(codes.iter().all(|c| c.chars().count() == 3));
assert_eq!(codes[0], "aaa");
}
}