pub const GLYPHS: [char; 26] = [
' ', '\'', '-', '/', '|', '\\', '.', '=', '<', '>', ':', 'o', 'x', 'O', '#', 'X', '%', '@',
'+', '^', '~', '`', ',', '*', ';', '"',
];
pub const EMPTY: u8 = 0;
pub const fn id(c: char) -> u8 {
let mut i = 0;
while i < GLYPHS.len() {
if GLYPHS[i] == c {
return i as u8;
}
i += 1;
}
panic!("glyph missing from GLYPHS")
}
pub fn char_of(glyph: u8) -> char {
GLYPHS[glyph as usize]
}
pub const FAR_LEFT: [u8; 4] = [id('\''), id('-'), id('/'), id('|')];
pub const FAR_RIGHT: [u8; 4] = [id('\''), id('-'), id('\\'), id('|')];
pub const MID_LEFT: [u8; 5] = [id('.'), id('-'), id('='), id('\\'), id('<')];
pub const MID_RIGHT: [u8; 5] = [id('.'), id('-'), id('='), id('/'), id('>')];
pub const NEAR: [u8; 10] = [
id('.'),
id(':'),
id('o'),
id('x'),
id('='),
id('O'),
id('#'),
id('X'),
id('%'),
id('@'),
];
pub const PLATFORM: [u8; 8] = [
id('='),
id('o'),
id('+'),
id('x'),
id('#'),
id('X'),
id('%'),
id('@'),
];
pub const PLATFORM_TOP: u8 = id('^');
pub const SKY_DUST: [u8; 4] = [id('.'), id('\''), id('`'), id(',')];
pub const STARS: [u8; 6] = [id('.'), id('`'), id('\''), id(','), id(':'), id('*')];
pub const EMBERS: [u8; 5] = [id('*'), id('+'), id('\''), id('.'), id('`')];
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn table_has_no_duplicates() {
for (i, a) in GLYPHS.iter().enumerate() {
for b in &GLYPHS[i + 1..] {
assert_ne!(a, b);
}
}
assert_eq!(char_of(EMPTY), ' ');
}
}