unicode-lang 1.0.0

//! Unicode normalization: the four forms of [UAX #15].
//!
//! Normalization rewrites a string into a canonical shape so that sequences
//! which are *meant* to be equal compare byte-for-byte equal. The classic case
//! is `é`, which can be one precomposed scalar (`U+00E9`) or a base letter plus
//! a combining accent (`U+0065 U+0301`); both name the same character, and
//! normalization forces one spelling.
//!
//! Two axes give the four forms:
//!
//! - *Composition* vs *decomposition* — whether the result prefers precomposed
//!   scalars ([`Form::Nfc`], [`Form::Nfkc`]) or fully decomposed base + marks
//!   ([`Form::Nfd`], [`Form::Nfkd`]).
//! - *Canonical* vs *compatibility* — canonical forms preserve visual identity;
//!   the compatibility forms ([`Form::Nfkc`], [`Form::Nfkd`]) additionally fold
//!   formatting distinctions, mapping e.g. the ligature `fi` to `fi` and
//!   fullwidth `Ａ` to `A`.
//!
//! For identifiers, [UAX #31] recommends NFC. For fold-and-compare tasks
//! (case-insensitive-style matching of visually similar text) NFKC is the usual
//! choice. When in doubt, NFC is the safe default.
//!
//! The implementation handles Hangul algorithmically (per UAX #15) and every
//! other scalar through the generated decomposition, combining-class, and
//! composition tables. It is verified against the official
//! `NormalizationTest.txt` conformance suite.
//!
//! [UAX #15]: https://www.unicode.org/reports/tr15/
//! [UAX #31]: https://www.unicode.org/reports/tr31/

extern crate alloc;

use alloc::string::String;
use alloc::vec::Vec;

use crate::lookup::range_value;
use crate::tables;

/// A Unicode normalization form, selecting the target shape for [`normalize`]
/// and [`is_normalized`].
///
/// # Examples
///
/// ```
/// use unicode_lang::{normalize, Form};
///
/// // NFC composes; NFD decomposes. Both round-trip the same text.
/// let composed = normalize("e\u{0301}", Form::Nfc);
/// assert_eq!(composed, "é");
/// let decomposed = normalize("é", Form::Nfd);
/// assert_eq!(decomposed, "e\u{0301}");
/// ```
#[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub enum Form {
    /// Normalization Form C — canonical decomposition followed by canonical
    /// composition. The most compact canonical form; the identifier default.
    Nfc,
    /// Normalization Form D — canonical decomposition only.
    Nfd,
    /// Normalization Form KC — compatibility decomposition followed by
    /// canonical composition. Folds compatibility distinctions.
    Nfkc,
    /// Normalization Form KD — compatibility decomposition only.
    Nfkd,
}

impl Form {
    /// Whether this form recomposes after decomposing (NFC / NFKC).
    #[inline]
    const fn composes(self) -> bool {
        matches!(self, Form::Nfc | Form::Nfkc)
    }

    /// Whether this form uses compatibility decomposition (NFKC / NFKD).
    #[inline]
    const fn compat(self) -> bool {
        matches!(self, Form::Nfkc | Form::Nfkd)
    }
}

// Hangul jamo composition parameters (UAX #15, "Hangul").
const S_BASE: u32 = 0xAC00;
const L_BASE: u32 = 0x1100;
const V_BASE: u32 = 0x1161;
const T_BASE: u32 = 0x11A7;
const L_COUNT: u32 = 19;
const V_COUNT: u32 = 21;
const T_COUNT: u32 = 28;
const N_COUNT: u32 = V_COUNT * T_COUNT; // 588
const S_COUNT: u32 = L_COUNT * N_COUNT; // 11172

/// Returns `s` normalized to `form`.
///
/// When `s` is already in the requested form this returns it unchanged after a
/// fast allocation-free scan (the Unicode quick-check), so passing text that is
/// already normalized — the common case for ASCII and most well-formed input —
/// costs one linear pass and a single allocation for the returned `String`.
///
/// # Examples
///
/// ```
/// use unicode_lang::{normalize, Form};
///
/// // Compatibility composition folds a ligature and a fullwidth digit.
/// assert_eq!(normalize("file", Form::Nfkc), "file");
/// assert_eq!(normalize("\u{FF11}", Form::Nfkc), "1");
///
/// // Canonical decomposition splits a precomposed character and orders marks.
/// assert_eq!(normalize("ǭ", Form::Nfd), "o\u{0328}\u{0304}");
///
/// // ASCII is returned untouched.
/// assert_eq!(normalize("plain ascii", Form::Nfc), "plain ascii");
/// ```
#[must_use]
pub fn normalize(s: &str, form: Form) -> String {
    if let Quick::Yes = quick_check(s, form) {
        return String::from(s);
    }
    let mut buf = decompose(s, form.compat());
    if form.composes() {
        compose(&mut buf);
    }
    buf.into_iter().collect()
}

/// Returns `true` if `s` is already in normalization form `form`.
///
/// The check begins with the allocation-free Unicode quick-check. Most inputs
/// are decided there; only genuinely ambiguous input triggers a full
/// normalization to resolve, and even then no `String` is allocated — the
/// normalized scalars are compared against `s` directly.
///
/// # Examples
///
/// ```
/// use unicode_lang::{is_normalized, Form};
///
/// assert!(is_normalized("é", Form::Nfc));            // precomposed: already NFC
/// assert!(!is_normalized("e\u{0301}", Form::Nfc));   // decomposed: not NFC
/// assert!(is_normalized("e\u{0301}", Form::Nfd));    // ...but it is NFD
///
/// assert!(is_normalized("ascii only", Form::Nfkc));
/// assert!(!is_normalized("fi", Form::Nfkc));          // ligature folds under NFKC
/// ```
#[must_use]
pub fn is_normalized(s: &str, form: Form) -> bool {
    match quick_check(s, form) {
        Quick::Yes => true,
        Quick::No => false,
        Quick::Maybe => {
            // Resolve the ambiguous case by normalizing and comparing scalars,
            // without materialising an intermediate `String`.
            let mut buf = decompose(s, form.compat());
            if form.composes() {
                compose(&mut buf);
            }
            buf.into_iter().eq(s.chars())
        }
    }
}

/// Outcome of the Unicode quick-check: definitely normalized, definitely not,
/// or requires a full pass to decide.
enum Quick {
    Yes,
    No,
    Maybe,
}

/// The [quick-check algorithm][qc]: scans `s` once, consulting the per-form
/// `*_QC` property and the canonical ordering of combining marks.
///
/// [qc]: https://www.unicode.org/reports/tr15/#Detecting_Normalization_Forms
fn quick_check(s: &str, form: Form) -> Quick {
    let qc = match form {
        Form::Nfc => tables::NFC_QC,
        Form::Nfd => tables::NFD_QC,
        Form::Nfkc => tables::NFKC_QC,
        Form::Nfkd => tables::NFKD_QC,
    };
    let mut last_ccc = 0u8;
    let mut result = Quick::Yes;
    for c in s.chars() {
        let cc = ccc(c);
        // Marks out of canonical order prove the string is not normalized.
        if last_ccc > cc && cc != 0 {
            return Quick::No;
        }
        match range_value(c as u32, qc) {
            1 => return Quick::No,
            2 => result = Quick::Maybe,
            _ => {}
        }
        last_ccc = cc;
    }
    result
}

/// Canonical combining class of `c` (0 for the vast majority of scalars).
#[inline]
fn ccc(c: char) -> u8 {
    range_value(c as u32, tables::CCC)
}

/// Fully decompose `s` (canonical, or compatibility when `compat`) and place
/// the result in canonical order.
fn decompose(s: &str, compat: bool) -> Vec<char> {
    let mut out: Vec<char> = Vec::with_capacity(s.len());
    for c in s.chars() {
        decompose_char(c, compat, &mut out);
    }
    canonical_order(&mut out);
    out
}

/// Append the full decomposition of one scalar to `out`.
fn decompose_char(c: char, compat: bool, out: &mut Vec<char>) {
    let cp = c as u32;
    if (S_BASE..S_BASE + S_COUNT).contains(&cp) {
        hangul_decompose(cp, out);
        return;
    }
    let (index, data): (&[(u32, u32, u32)], &[u32]) = if compat {
        (tables::COMPAT_DECOMP, tables::COMPAT_DATA)
    } else {
        (tables::CANON_DECOMP, tables::CANON_DATA)
    };
    if let Ok(i) = index.binary_search_by_key(&cp, |&(key, _, _)| key) {
        let (_, off, len) = index[i];
        let (off, len) = (off as usize, len as usize);
        out.extend(
            data[off..off + len]
                .iter()
                .filter_map(|&d| char::from_u32(d)),
        );
    } else {
        out.push(c);
    }
}

/// Algorithmic Hangul syllable decomposition (LV or LVT jamo).
fn hangul_decompose(cp: u32, out: &mut Vec<char>) {
    let s = cp - S_BASE;
    push_scalar(out, L_BASE + s / N_COUNT);
    push_scalar(out, V_BASE + (s % N_COUNT) / T_COUNT);
    let t = s % T_COUNT;
    if t != 0 {
        push_scalar(out, T_BASE + t);
    }
}

#[inline]
fn push_scalar(out: &mut Vec<char>, cp: u32) {
    if let Some(c) = char::from_u32(cp) {
        out.push(c);
    }
}

/// Reorder combining marks into canonical order: a stable sort by combining
/// class within each run of non-starter scalars. Starters (class 0) are fixed
/// points and act as barriers, so this is an insertion sort that never moves a
/// mark past a starter.
fn canonical_order(chars: &mut [char]) {
    let n = chars.len();
    let mut i = 1;
    while i < n {
        let cc = ccc(chars[i]);
        if cc != 0 {
            let mut j = i;
            while j > 0 && ccc(chars[j - 1]) > cc {
                chars.swap(j - 1, j);
                j -= 1;
            }
        }
        i += 1;
    }
}

/// Canonically compose a decomposed, canonically ordered scalar buffer in
/// place (the recomposition step of NFC / NFKC).
fn compose(chars: &mut Vec<char>) {
    if chars.len() < 2 {
        return;
    }
    let mut out: Vec<char> = Vec::with_capacity(chars.len());
    // Index in `out` of the most recent starter that can still absorb a
    // following combining mark, and the combining class of the last scalar
    // pushed (0 while the starter is still bare).
    let mut starter: Option<usize> = None;
    let mut last_ccc = 0u8;

    for &c in chars.iter() {
        let cc = ccc(c);
        if let Some(sp) = starter {
            // A combining mark is blocked from the starter if some scalar
            // between them has an equal-or-greater class. Because the buffer is
            // canonically ordered, tracking only the previous class suffices.
            if last_ccc == 0 || last_ccc < cc {
                if let Some(composite) = primary_composite(out[sp], c) {
                    out[sp] = composite;
                    continue;
                }
            }
        }
        out.push(c);
        if cc == 0 {
            starter = Some(out.len() - 1);
            last_ccc = 0;
        } else {
            last_ccc = cc;
        }
    }
    *chars = out;
}

/// The primary composite of a starter `a` and following scalar `b`, if one
/// exists: Hangul jamo by formula, everything else by table.
fn primary_composite(a: char, b: char) -> Option<char> {
    let (ca, cb) = (a as u32, b as u32);

    // Hangul: leading + vowel jamo -> LV syllable.
    if (L_BASE..L_BASE + L_COUNT).contains(&ca) && (V_BASE..V_BASE + V_COUNT).contains(&cb) {
        let li = ca - L_BASE;
        let vi = cb - V_BASE;
        return char::from_u32(S_BASE + (li * V_COUNT + vi) * T_COUNT);
    }
    // Hangul: LV syllable + trailing jamo -> LVT syllable.
    if (S_BASE..S_BASE + S_COUNT).contains(&ca)
        && (ca - S_BASE) % T_COUNT == 0
        && (T_BASE + 1..T_BASE + T_COUNT).contains(&cb)
    {
        return char::from_u32(ca + (cb - T_BASE));
    }

    let key = (u64::from(ca) << 32) | u64::from(cb);
    match tables::COMPOSE.binary_search_by_key(&key, |&(k, _)| k) {
        Ok(i) => char::from_u32(tables::COMPOSE[i].1),
        Err(_) => None,
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_nfc_composes_base_and_mark() {
        assert_eq!(normalize("e\u{0301}", Form::Nfc), "é");
    }

    #[test]
    fn test_nfd_decomposes_precomposed() {
        assert_eq!(normalize("é", Form::Nfd), "e\u{0301}");
    }

    #[test]
    fn test_nfd_orders_marks_by_class() {
        // Two marks given out of canonical order (class 230 then 220) must be
        // reordered (220 before 230).
        let input = "a\u{0301}\u{0323}"; // acute (230) then dot-below (220)
        assert_eq!(normalize(input, Form::Nfd), "a\u{0323}\u{0301}");
    }

    #[test]
    fn test_nfkc_folds_ligature() {
        assert_eq!(normalize("fi", Form::Nfkc), "fi");
        assert_eq!(normalize("\u{FF21}", Form::Nfkc), "A"); // fullwidth A
    }

    #[test]
    fn test_nfkd_expands_compatibility() {
        assert_eq!(normalize("½", Form::Nfkd), "1\u{2044}2");
    }

    #[test]
    fn test_hangul_roundtrip() {
        let syllable = "\u{AC00}"; // 가
        let decomposed = normalize(syllable, Form::Nfd);
        assert_eq!(decomposed, "\u{1100}\u{1161}");
        assert_eq!(normalize(&decomposed, Form::Nfc), syllable);
    }

    #[test]
    fn test_hangul_lvt() {
        let syllable = "\u{AC01}"; // 각 (LVT)
        assert_eq!(normalize(syllable, Form::Nfd), "\u{1100}\u{1161}\u{11A8}");
        assert_eq!(normalize("\u{1100}\u{1161}\u{11A8}", Form::Nfc), syllable);
    }

    #[test]
    fn test_ascii_unchanged() {
        for form in [Form::Nfc, Form::Nfd, Form::Nfkc, Form::Nfkd] {
            assert_eq!(normalize("hello world 123", form), "hello world 123");
        }
    }

    #[test]
    fn test_idempotent() {
        let samples = ["e\u{0301}", "fi", "가", "½", "Ａ", "a\u{0323}\u{0301}"];
        for s in samples {
            for form in [Form::Nfc, Form::Nfd, Form::Nfkc, Form::Nfkd] {
                let once = normalize(s, form);
                let twice = normalize(&once, form);
                assert_eq!(once, twice, "not idempotent: {s:?} {form:?}");
            }
        }
    }

    #[cfg(feature = "serde")]
    #[test]
    #[allow(clippy::unwrap_used)] // serde_json in a test; failure is a test failure
    fn test_form_serde_roundtrip() {
        for form in [Form::Nfc, Form::Nfd, Form::Nfkc, Form::Nfkd] {
            let json = serde_json::to_string(&form).unwrap();
            let back: Form = serde_json::from_str(&json).unwrap();
            assert_eq!(form, back);
        }
        assert_eq!(serde_json::to_string(&Form::Nfkc).unwrap(), "\"Nfkc\"");
    }

    #[test]
    fn test_is_normalized_agrees_with_normalize() {
        let samples = [
            "",
            "abc",
            "é",
            "e\u{0301}",
            "fi",
            "가",
            "½",
            "a\u{0323}\u{0301}",
        ];
        for s in samples {
            for form in [Form::Nfc, Form::Nfd, Form::Nfkc, Form::Nfkd] {
                let expected = normalize(s, form) == s;
                assert_eq!(is_normalized(s, form), expected, "{s:?} {form:?}");
            }
        }
    }
}