use super::{joining_table, Joining};
#[must_use]
pub fn joining(c: char) -> Joining {
let key = c as u32;
let r = joining_table::RANGES;
let mut lo = 0usize;
let mut hi = r.len();
while lo < hi {
let mid = lo + (hi - lo) / 2;
let (first, last, k) = r[mid];
if key < first {
hi = mid;
} else if key > last {
lo = mid + 1;
} else {
return k;
}
}
Joining::NonJoining
}
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum Form {
Isolated,
Initial,
Medial,
Final,
}
impl Form {
#[must_use]
pub fn tag(self) -> [u8; 4] {
match self {
Self::Isolated => *b"isol",
Self::Initial => *b"init",
Self::Medial => *b"medi",
Self::Final => *b"fina",
}
}
}
#[must_use]
pub fn forms(text: &[char]) -> Vec<Form> {
let kinds: Vec<Joining> = text.iter().copied().map(joining).collect();
let prev = |i: usize| -> Option<Joining> {
(0..i)
.rev()
.map(|j| kinds[j])
.find(|k| *k != Joining::Transparent)
};
let next = |i: usize| -> Option<Joining> {
kinds[i + 1..]
.iter()
.copied()
.find(|k| *k != Joining::Transparent)
};
(0..text.len())
.map(|i| {
if matches!(kinds[i], Joining::Transparent | Joining::NonJoining) {
return Form::Isolated;
}
let can_right = matches!(
kinds[i],
Joining::DualJoining | Joining::RightJoining | Joining::JoinCausing
);
let can_left = matches!(
kinds[i],
Joining::DualJoining | Joining::LeftJoining | Joining::JoinCausing
);
let joined_right = can_right
&& matches!(
prev(i),
Some(Joining::DualJoining | Joining::LeftJoining | Joining::JoinCausing)
);
let joined_left = can_left
&& matches!(
next(i),
Some(Joining::DualJoining | Joining::RightJoining | Joining::JoinCausing)
);
match (joined_right, joined_left) {
(true, true) => Form::Medial,
(true, false) => Form::Final,
(false, true) => Form::Initial,
(false, false) => Form::Isolated,
}
})
.collect()
}
#[cfg(test)]
mod tests {
use super::*;
fn forms_of(s: &str) -> Vec<Form> {
forms(&s.chars().collect::<Vec<char>>())
}
#[test]
fn the_joining_types_are_what_unicode_says() {
assert_eq!(joining('\u{628}'), Joining::DualJoining); assert_eq!(joining('\u{627}'), Joining::RightJoining); assert_eq!(joining('\u{62F}'), Joining::RightJoining); assert_eq!(joining('\u{64B}'), Joining::Transparent); assert_eq!(joining('\u{640}'), Joining::JoinCausing); assert_eq!(joining('a'), Joining::NonJoining);
assert_eq!(joining(' '), Joining::NonJoining);
}
#[test]
fn a_lone_letter_is_isolated() {
assert_eq!(forms_of("\u{628}"), vec![Form::Isolated]);
assert_eq!(forms_of("\u{627}"), vec![Form::Isolated]);
}
#[test]
fn three_dual_joining_letters_make_an_initial_a_medial_and_a_final() {
assert_eq!(
forms_of("\u{628}\u{628}\u{628}"),
vec![Form::Initial, Form::Medial, Form::Final]
);
}
#[test]
fn a_right_joining_letter_stops_the_chain() {
assert_eq!(
forms_of("\u{628}\u{627}\u{628}"),
vec![Form::Initial, Form::Final, Form::Isolated]
);
}
#[test]
fn a_mark_is_transparent_and_the_letters_join_across_it() {
assert_eq!(
forms_of("\u{628}\u{64E}\u{628}"),
vec![Form::Initial, Form::Isolated, Form::Final]
);
}
#[test]
fn a_space_breaks_the_chain() {
assert_eq!(
forms_of("\u{628}\u{628} \u{628}\u{628}"),
vec![
Form::Initial,
Form::Final,
Form::Isolated,
Form::Initial,
Form::Final
]
);
}
#[test]
fn tatweel_causes_a_join_without_being_a_letter() {
assert_eq!(
forms_of("\u{628}\u{640}\u{628}"),
vec![Form::Initial, Form::Medial, Form::Final]
);
}
#[test]
fn the_table_covers_every_codepoint_without_gaps() {
let mut next = 0u32;
for (first, last, _) in joining_table::RANGES {
assert_eq!(*first, next, "a gap or overlap before {first:#X}");
next = last + 1;
}
assert_eq!(next, 0x11_0000);
}
}