miwa-cli 0.7.0

//! Block alignment and character-level diff used by `miwa site --diff`.

use std::collections::HashMap;
use std::ops::Range;

/// Minimum similarity for pairing a deleted block with an added block.
pub const SIMILARITY_THRESHOLD: f64 = 0.45;
/// Maximum number of equal blocks absorbed between changes.
pub const ABSORB_EQUAL_MAX: usize = 2;
/// Maximum combined chars for a character-level diff of a block pair.
pub const CHAR_DIFF_MAX_CHARS: usize = 4_000;
/// Maximum product of deleted and added block counts for pairing.
pub const PAIRING_MAX_PRODUCT: usize = 10_000;
/// Maximum number of blocks per document before falling back.
pub const DOC_MAX_BLOCKS: usize = 20_000;
/// Maximum edit distance accepted by Myers diff.
pub const MYERS_MAX_EDITS: usize = 2_000;

/// One edit-script operation over index ranges.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Op {
    Equal { a: Range<usize>, b: Range<usize> },
    Delete { a: Range<usize> },
    Insert { b: Range<usize> },
}

/// Myers diff. Returns None when the edit distance exceeds `max_edits`.
pub fn diff_ops<T: Eq>(a: &[T], b: &[T], max_edits: usize) -> Option<Vec<Op>> {
    let (n, m) = (a.len(), b.len());
    // v[k + offset] = furthest x reached on diagonal k (k = x - y).
    let offset = max_edits as isize + 1;
    let mut v = vec![0usize; 2 * max_edits + 3];
    // trace[d] holds v for diagonals -d..=d (step 2) after round d; index (k + d) / 2.
    let mut trace: Vec<Vec<usize>> = Vec::new();
    let idx = |k: isize| (k + offset) as usize;
    let mut found = false;
    for d in 0..=max_edits as isize {
        let mut k = -d;
        while k <= d {
            let mut x = if k == -d || (k != d && v[idx(k - 1)] < v[idx(k + 1)]) {
                v[idx(k + 1)]
            } else {
                v[idx(k - 1)] + 1
            };
            let mut y = (x as isize - k) as usize;
            // Follow the diagonal while elements match.
            while x < n && y < m && a[x] == b[y] {
                x += 1;
                y += 1;
            }
            v[idx(k)] = x;
            if x >= n && y >= m {
                found = true;
            }
            k += 2;
        }
        trace.push((-d..=d).step_by(2).map(|k| v[idx(k)]).collect());
        if found {
            break;
        }
    }
    if !found {
        return None;
    }

    // Walk back from (n, m), collecting elementary ops in reverse.
    let mut rev: Vec<Op> = Vec::new();
    let (mut x, mut y) = (n, m);
    for d in (0..trace.len() as isize).rev() {
        let k = x as isize - y as isize;
        if d == 0 {
            if x > 0 {
                rev.push(Op::Equal { a: 0..x, b: 0..y });
            }
            break;
        }
        let prev = &trace[(d - 1) as usize];
        let at = |kk: isize| prev[((kk + d - 1) / 2) as usize];
        let prev_k = if k == -d || (k != d && at(k - 1) < at(k + 1)) {
            k + 1
        } else {
            k - 1
        };
        let px = at(prev_k);
        let py = (px as isize - prev_k) as usize;
        // Position right after the single insert/delete step.
        let (mx, my) = if prev_k == k + 1 {
            (px, py + 1)
        } else {
            (px + 1, py)
        };
        if x > mx {
            rev.push(Op::Equal { a: mx..x, b: my..y });
        }
        if prev_k == k + 1 {
            rev.push(Op::Insert { b: py..my });
        } else {
            rev.push(Op::Delete { a: px..mx });
        }
        x = px;
        y = py;
    }

    // Reverse and merge adjacent ops of the same kind.
    let mut ops: Vec<Op> = Vec::new();
    for op in rev.into_iter().rev() {
        match (ops.last_mut(), &op) {
            (Some(Op::Equal { a, b }), Op::Equal { a: na, b: nb }) => {
                a.end = na.end;
                b.end = nb.end;
            }
            (Some(Op::Delete { a }), Op::Delete { a: na }) => a.end = na.end,
            (Some(Op::Insert { b }), Op::Insert { b: nb }) => b.end = nb.end,
            _ => ops.push(op),
        }
    }
    Some(ops)
}

/// Multiset character overlap: 2 * common / (len_a + len_b). Both empty -> 1.0.
pub fn similarity(a: &str, b: &str) -> f64 {
    let mut counts: HashMap<char, usize> = HashMap::new();
    let mut len_a = 0usize;
    for c in a.chars() {
        *counts.entry(c).or_insert(0) += 1;
        len_a += 1;
    }
    let mut len_b = 0usize;
    let mut common = 0usize;
    for c in b.chars() {
        len_b += 1;
        if let Some(n) = counts.get_mut(&c) {
            if *n > 0 {
                *n -= 1;
                common += 1;
            }
        }
    }
    if len_a + len_b == 0 {
        return 1.0;
    }
    2.0 * common as f64 / (len_a + len_b) as f64
}

/// Kind of a rendered block.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum BlockKind {
    Paragraph,
    Heading,
    Code,
    Table,
    ListItem,
    Quote,
    Rule,
    Footnote,
    Html,
    Other,
}

/// A block with its comparison key and similarity text.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct BlockKey {
    pub kind: BlockKind,
    /// Comparison key (unprefixed HTML + image hashes).
    pub key: String,
    /// Plain text used for similarity.
    pub text: String,
}

/// Row classification in the side-by-side view.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum RowKind {
    Same,
    Changed,
    Added,
    Deleted,
}

/// One aligned row; indices point into the left / right block sequences.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Row {
    pub kind: RowKind,
    pub left: Option<usize>,
    pub right: Option<usize>,
}

/// Aligns two block sequences per FR-117 (limits included).
pub fn align_blocks(a: &[BlockKey], b: &[BlockKey]) -> Vec<Row> {
    if a.len() + b.len() > DOC_MAX_BLOCKS {
        return all_deleted_then_added(0..a.len(), 0..b.len());
    }
    let ka: Vec<&str> = a.iter().map(|x| x.key.as_str()).collect();
    let kb: Vec<&str> = b.iter().map(|x| x.key.as_str()).collect();
    let Some(ops) = diff_ops(&ka, &kb, MYERS_MAX_EDITS) else {
        return all_deleted_then_added(0..a.len(), 0..b.len());
    };

    let mut rows = Vec::new();
    // Pending replacement region (consecutive Delete / Insert ops).
    let mut region: Option<(Range<usize>, Range<usize>)> = None;
    for op in ops {
        match op {
            Op::Equal { a: ra, b: rb } => {
                if let Some((da, ib)) = region.take() {
                    pair_region(a, b, da, ib, &mut rows);
                }
                for (i, j) in ra.zip(rb) {
                    rows.push(Row {
                        kind: RowKind::Same,
                        left: Some(i),
                        right: Some(j),
                    });
                }
            }
            Op::Delete { a: ra } => {
                let r = region.get_or_insert((ra.start..ra.start, 0..0));
                r.0.end = ra.end;
            }
            Op::Insert { b: rb } => {
                let r = region.get_or_insert((0..0, rb.start..rb.start));
                if r.1.is_empty() && r.1.start == 0 {
                    r.1.start = rb.start;
                }
                r.1.end = rb.end;
            }
        }
    }
    if let Some((da, ib)) = region.take() {
        pair_region(a, b, da, ib, &mut rows);
    }
    rows
}

/// All left blocks as Deleted, then all right blocks as Added.
fn all_deleted_then_added(da: Range<usize>, ib: Range<usize>) -> Vec<Row> {
    let deleted = da.map(|i| Row {
        kind: RowKind::Deleted,
        left: Some(i),
        right: None,
    });
    let added = ib.map(|j| Row {
        kind: RowKind::Added,
        left: None,
        right: Some(j),
    });
    deleted.chain(added).collect()
}

/// Character counts and total length of a text, computed once per block.
fn char_counts(text: &str) -> (HashMap<char, usize>, usize) {
    let mut counts = HashMap::new();
    let mut len = 0;
    for c in text.chars() {
        *counts.entry(c).or_insert(0) += 1;
        len += 1;
    }
    (counts, len)
}

/// Similarity of two blocks from precomputed counts; empty texts compare by block kind.
fn block_similarity(
    l: &BlockKey,
    lc: &(HashMap<char, usize>, usize),
    r: &BlockKey,
    rc: &(HashMap<char, usize>, usize),
) -> f64 {
    if lc.1 == 0 && rc.1 == 0 {
        return if l.kind == r.kind { 1.0 } else { 0.0 };
    }
    // Iterate the smaller map; the multiset overlap is the sum of per-char minima.
    let (small, large) = if lc.0.len() <= rc.0.len() {
        (&lc.0, &rc.0)
    } else {
        (&rc.0, &lc.0)
    };
    let common: usize = small
        .iter()
        .map(|(c, n)| large.get(c).map_or(0, |m| *n.min(m)))
        .sum();
    2.0 * common as f64 / (lc.1 + rc.1) as f64
}

/// Pairs blocks of one replacement region greedily, keeping order.
fn pair_region(
    a: &[BlockKey],
    b: &[BlockKey],
    da: Range<usize>,
    ib: Range<usize>,
    rows: &mut Vec<Row>,
) {
    if da.len() * ib.len() > PAIRING_MAX_PRODUCT {
        rows.extend(all_deleted_then_added(da, ib));
        return;
    }
    let (na, nb) = (da.len(), ib.len());
    let ca: Vec<_> = a[da.clone()].iter().map(|x| char_counts(&x.text)).collect();
    let cb: Vec<_> = b[ib.clone()].iter().map(|x| char_counts(&x.text)).collect();
    // sim[i * nb + j]: each pair is computed exactly once (na * nb is bounded).
    let mut sim = vec![0.0f64; na * nb];
    for i in 0..na {
        for j in 0..nb {
            sim[i * nb + j] = block_similarity(&a[da.start + i], &ca[i], &b[ib.start + j], &cb[j]);
        }
    }
    // Suffix maxima (0.0 past the end): right_max[i][j] = max sim[i][j..],
    // down_max[i][j] = max sim[i..][j]; both are (na + 1) x (nb + 1).
    let w = nb + 1;
    let mut right_max = vec![0.0f64; (na + 1) * w];
    let mut down_max = vec![0.0f64; (na + 1) * w];
    for i in (0..na).rev() {
        for j in (0..nb).rev() {
            let v = sim[i * nb + j];
            right_max[i * w + j] = v.max(right_max[i * w + j + 1]);
            down_max[i * w + j] = v.max(down_max[(i + 1) * w + j]);
        }
    }
    let (mut i, mut j) = (0, 0);
    while i < na && j < nb {
        let cur = sim[i * nb + j];
        // Best partner for the current left among remaining rights, and vice versa.
        let best_r = right_max[i * w + j + 1];
        let best_l = down_max[(i + 1) * w + j];
        if cur >= SIMILARITY_THRESHOLD && cur >= best_r && cur >= best_l {
            rows.push(Row {
                kind: RowKind::Changed,
                left: Some(da.start + i),
                right: Some(ib.start + j),
            });
            i += 1;
            j += 1;
        } else if best_r > best_l {
            rows.push(Row {
                kind: RowKind::Added,
                left: None,
                right: Some(ib.start + j),
            });
            j += 1;
        } else {
            rows.push(Row {
                kind: RowKind::Deleted,
                left: Some(da.start + i),
                right: None,
            });
            i += 1;
        }
    }
    rows.extend(all_deleted_then_added(
        da.start + i..da.end,
        ib.start + j..ib.end,
    ));
}

/// Character-level marks per FR-117: `Some((changed_in_a, changed_in_b))` with one bool per char,
/// or None when the pair exceeds CHAR_DIFF_MAX_CHARS or MYERS_MAX_EDITS (whole block changed, no highlight).
pub fn char_marks(a: &[char], b: &[char]) -> Option<(Vec<bool>, Vec<bool>)> {
    if a.len() + b.len() > CHAR_DIFF_MAX_CHARS {
        return None;
    }
    let ops = diff_ops(a, b, MYERS_MAX_EDITS)?;
    let mut ma = vec![false; a.len()];
    let mut mb = vec![false; b.len()];
    for (idx, op) in ops.iter().enumerate() {
        match op {
            Op::Delete { a: r } => ma[r.clone()].fill(true),
            Op::Insert { b: r } => mb[r.clone()].fill(true),
            // Short equal runs between two changes are absorbed into the change.
            Op::Equal { a: ra, b: rb }
                if idx > 0 && idx + 1 < ops.len() && ra.len() <= ABSORB_EQUAL_MAX =>
            {
                ma[ra.clone()].fill(true);
                mb[rb.clone()].fill(true);
            }
            Op::Equal { .. } => {}
        }
    }
    Some((ma, mb))
}

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

    fn rebuild<T: Clone + Eq + std::fmt::Debug>(a: &[T], b: &[T], ops: &[Op]) {
        let mut from_a = Vec::new();
        let mut from_b = Vec::new();
        for op in ops {
            match op {
                Op::Equal { a: ra, b: rb } => {
                    assert_eq!(a[ra.clone()], b[rb.clone()]);
                    from_a.extend_from_slice(&a[ra.clone()]);
                    from_b.extend_from_slice(&b[rb.clone()]);
                }
                Op::Delete { a: ra } => from_a.extend_from_slice(&a[ra.clone()]),
                Op::Insert { b: rb } => from_b.extend_from_slice(&b[rb.clone()]),
            }
        }
        assert_eq!(from_a, a);
        assert_eq!(from_b, b);
    }

    fn has_equal(ops: &[Op]) -> bool {
        ops.iter().any(|o| matches!(o, Op::Equal { .. }))
    }
    fn has_delete(ops: &[Op]) -> bool {
        ops.iter().any(|o| matches!(o, Op::Delete { .. }))
    }
    fn has_insert(ops: &[Op]) -> bool {
        ops.iter().any(|o| matches!(o, Op::Insert { .. }))
    }

    // ------------------------------------------------------------ diff_ops

    // [FR-117]
    #[test]
    fn diff_opsは両方空なら空の編集列を返す() {
        let ops = diff_ops::<i32>(&[], &[], 10).unwrap();
        assert!(!has_delete(&ops) && !has_insert(&ops));
        rebuild::<i32>(&[], &[], &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは同一列ならequalだけを返す() {
        let a = [1, 2, 3];
        let ops = diff_ops(&a, &a, 10).unwrap();
        assert!(has_equal(&ops));
        assert!(!has_delete(&ops) && !has_insert(&ops));
        rebuild(&a, &a, &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは全置換なら削除と挿入だけでequalを含まない() {
        let (a, b) = ([1, 2, 3], [4, 5, 6]);
        let ops = diff_ops(&a, &b, 100).unwrap();
        assert!(!has_equal(&ops));
        assert!(has_delete(&ops) && has_insert(&ops));
        rebuild(&a, &b, &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは挿入のみなら削除を含まない() {
        let (a, b) = ([1, 3], [1, 2, 3]);
        let ops = diff_ops(&a, &b, 100).unwrap();
        assert!(has_insert(&ops) && !has_delete(&ops));
        rebuild(&a, &b, &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは削除のみなら挿入を含まない() {
        let (a, b) = ([1, 2, 3], [1, 3]);
        let ops = diff_ops(&a, &b, 100).unwrap();
        assert!(has_delete(&ops) && !has_insert(&ops));
        rebuild(&a, &b, &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは編集距離がmax_editsを超えるとnoneで等しければsome() {
        let (a, b) = ([1, 2, 3], [4, 5, 6]);
        assert!(diff_ops(&a, &b, 5).is_none());
        let ops = diff_ops(&a, &b, 6).expect("distance 6 is within max_edits 6");
        rebuild(&a, &b, &ops);
    }

    // [FR-117]
    #[test]
    fn diff_opsは混在した変更でも両列を復元できる() {
        let a: Vec<char> = "kitten sitting".chars().collect();
        let b: Vec<char> = "sitting kitten".chars().collect();
        let ops = diff_ops(&a, &b, MYERS_MAX_EDITS).unwrap();
        rebuild(&a, &b, &ops);
    }

    // ---------------------------------------------------------- similarity

    // [FR-117]
    #[test]
    fn similarityは両方空なら1() {
        assert_eq!(similarity("", ""), 1.0);
    }

    // [FR-117]
    #[test]
    fn similarityは片側だけ空なら0() {
        assert_eq!(similarity("", "abc"), 0.0);
        assert_eq!(similarity("abc", ""), 0.0);
    }

    // [FR-117]
    #[test]
    fn similarityは同一文字列なら1で共通が無ければ0() {
        assert_eq!(similarity("abc", "abc"), 1.0);
        assert_eq!(similarity("abc", "xyz"), 0.0);
    }

    // [FR-117]
    #[test]
    fn similarityは文字の多重集合の重なりで定まる() {
        // a: {a:2, b:1}, b: {a:1, b:2} -> common 2 -> 2*2/6
        let v = similarity("aab", "abb");
        assert!((v - 4.0 / 6.0).abs() < 1e-9, "{v}");
        // order does not matter
        assert_eq!(similarity("abcd", "dcba"), 1.0);
        let w = similarity("abcd", "abxy");
        assert!((w - 0.5).abs() < 1e-9, "{w}");
    }

    // -------------------------------------------------------- align_blocks

    fn bk(kind: BlockKind, key: &str, text: &str) -> BlockKey {
        BlockKey {
            kind,
            key: key.to_string(),
            text: text.to_string(),
        }
    }

    fn para(key: &str, text: &str) -> BlockKey {
        bk(BlockKind::Paragraph, key, text)
    }

    fn count(rows: &[Row], kind: RowKind) -> usize {
        rows.iter().filter(|r| r.kind == kind).count()
    }

    /// 20 distinct chars, optionally with the first `keep` shared and the rest replaced.
    fn text20(keep: usize, other: bool) -> String {
        let base: Vec<char> = ('a'..='t').collect();
        let alt: Vec<char> = ('A'..='T').collect();
        (0..20)
            .map(|i| if i < keep || !other { base[i] } else { alt[i] })
            .collect()
    }

    // [FR-117]
    #[test]
    fn align_blocksは同一列ならすべてsameで添字が揃う() {
        let a = vec![para("1", "x"), para("2", "y"), para("3", "z")];
        let rows = align_blocks(&a, &a.clone());
        assert_eq!(rows.len(), 3);
        for (i, r) in rows.iter().enumerate() {
            assert_eq!(r.kind, RowKind::Same);
            assert_eq!((r.left, r.right), (Some(i), Some(i)));
        }
    }

    // [FR-117]
    #[test]
    fn align_blocksは両方空なら行も空() {
        assert!(align_blocks(&[], &[]).is_empty());
    }

    // [FR-117]
    #[test]
    fn align_blocksは片側だけのブロックを追加と削除にする() {
        let a = vec![para("1", "x")];
        let rows = align_blocks(&a, &[]);
        assert_eq!(rows.len(), 1);
        assert_eq!(rows[0].kind, RowKind::Deleted);
        assert_eq!((rows[0].left, rows[0].right), (Some(0), None));
        let rows = align_blocks(&[], &a);
        assert_eq!(rows.len(), 1);
        assert_eq!(rows[0].kind, RowKind::Added);
        assert_eq!((rows[0].left, rows[0].right), (None, Some(0)));
    }

    // [FR-117]
    #[test]
    fn align_blocksは類似度が閾値以上の置換区間のブロックを対にする() {
        // 10 common of 20 -> 0.5
        let a = vec![para("l", &text20(10, false))];
        let b = vec![para("r", &text20(10, true))];
        let rows = align_blocks(&a, &b);
        assert_eq!(rows.len(), 1);
        assert_eq!(rows[0].kind, RowKind::Changed);
        assert_eq!((rows[0].left, rows[0].right), (Some(0), Some(0)));
    }

    // [FR-117]
    #[test]
    fn align_blocksは類似度がちょうど0_45なら対にする() {
        // 9 common of 20+20 -> 18/40 = 0.45
        let a = vec![para("l", &text20(9, false))];
        let b = vec![para("r", &text20(9, true))];
        assert!((similarity(&a[0].text, &b[0].text) - 0.45).abs() < 1e-9);
        let rows = align_blocks(&a, &b);
        assert_eq!(count(&rows, RowKind::Changed), 1);
    }

    // [FR-117]
    #[test]
    fn align_blocksは類似度が閾値未満なら対にせず削除と追加にする() {
        // 8 common of 20+20 -> 0.4
        let a = vec![para("l", &text20(8, false))];
        let b = vec![para("r", &text20(8, true))];
        let rows = align_blocks(&a, &b);
        assert_eq!(count(&rows, RowKind::Changed), 0);
        assert_eq!(count(&rows, RowKind::Deleted), 1);
        assert_eq!(count(&rows, RowKind::Added), 1);
    }

    // [FR-117]
    #[test]
    fn align_blocksは先読みして良い相手が後ろにあれば手前を単独の追加にする() {
        // R0 is similar enough (0.5) to L0, but R1 is identical in text.
        let l = vec![para("l", &text20(0, false))];
        let r = vec![
            para(
                "r0",
                &format!("{}{}", &text20(0, false)[..10], "XXXXXXXXXX"),
            ),
            para("r1", &text20(0, false)),
        ];
        let rows = align_blocks(&l, &r);
        assert_eq!(count(&rows, RowKind::Changed), 1);
        let changed = rows.iter().find(|r| r.kind == RowKind::Changed).unwrap();
        assert_eq!((changed.left, changed.right), (Some(0), Some(1)));
        let added = rows.iter().find(|r| r.kind == RowKind::Added).unwrap();
        assert_eq!(added.right, Some(0));
        assert_eq!(count(&rows, RowKind::Deleted), 0);
    }

    // [FR-117]
    #[test]
    fn align_blocksは対にしたブロックの順序を保つ() {
        let a = vec![para("l0", "alpha beta"), para("l1", "gamma delta")];
        let b = vec![para("r0", "alpha beta!"), para("r1", "gamma delta!")];
        let rows = align_blocks(&a, &b);
        let pairs: Vec<_> = rows
            .iter()
            .filter(|r| r.kind == RowKind::Changed)
            .map(|r| (r.left.unwrap(), r.right.unwrap()))
            .collect();
        assert_eq!(pairs, vec![(0, 0), (1, 1)]);
    }

    // [FR-117]
    #[test]
    fn align_blocksは空テキストで種類が同じブロックを対にする() {
        let a = vec![bk(BlockKind::Paragraph, "img-a", "")];
        let b = vec![bk(BlockKind::Paragraph, "img-b", "")];
        let rows = align_blocks(&a, &b);
        assert_eq!(rows.len(), 1);
        assert_eq!(rows[0].kind, RowKind::Changed);
    }

    // [FR-117]
    #[test]
    fn align_blocksは空テキストで種類が違うブロックを対にしない() {
        let a = vec![bk(BlockKind::Paragraph, "img-a", "")];
        let b = vec![bk(BlockKind::ListItem, "img-b", "")];
        let rows = align_blocks(&a, &b);
        assert_eq!(count(&rows, RowKind::Changed), 0);
        assert_eq!(count(&rows, RowKind::Deleted), 1);
        assert_eq!(count(&rows, RowKind::Added), 1);
    }

    fn many(prefix: &str, n: usize, same_text: bool) -> Vec<BlockKey> {
        (0..n)
            .map(|i| {
                let text = if same_text {
                    format!("text number {i}")
                } else {
                    format!("{prefix}{i}")
                };
                para(&format!("{prefix}{i}"), &text)
            })
            .collect()
    }

    // [FR-117]
    #[test]
    fn align_blocksは積が上限ちょうどなら対づけする() {
        let a = many("l", 100, true);
        let b = many("r", 100, true);
        assert_eq!(a.len() * b.len(), PAIRING_MAX_PRODUCT);
        let rows = align_blocks(&a, &b);
        assert_eq!(count(&rows, RowKind::Changed), 100);
    }

    // [FR-117]
    #[test]
    fn align_blocksは大きな置換区間でも似ていないブロックを速く削除と追加にする() {
        // 1,000 old blocks vs 1 new block, ~200 chars each, no shared chars.
        let a: Vec<BlockKey> = (0..1000)
            .map(|i| para(&format!("l{i}"), &"a".repeat(200)))
            .collect();
        let b = vec![para("r0", &"b".repeat(200))];
        let rows = align_blocks(&a, &b);
        assert_eq!(rows.len(), 1001);
        assert_eq!(count(&rows, RowKind::Changed), 0);
        assert_eq!(count(&rows, RowKind::Deleted), 1000);
        assert_eq!(count(&rows, RowKind::Added), 1);
        // Deleted first on equal lookahead bests, then the leftover Added.
        assert!(rows[..1000].iter().all(|r| r.kind == RowKind::Deleted));
        assert_eq!(rows[1000].kind, RowKind::Added);
    }

    // [FR-117]
    #[test]
    fn align_blocksは積が上限を超えると対づけせずすべて削除と追加にする() {
        let a = many("l", 101, true);
        let b = many("r", 100, true);
        assert!(a.len() * b.len() > PAIRING_MAX_PRODUCT);
        let rows = align_blocks(&a, &b);
        assert_eq!(count(&rows, RowKind::Changed), 0);
        assert_eq!(count(&rows, RowKind::Deleted), 101);
        assert_eq!(count(&rows, RowKind::Added), 100);
    }

    // [FR-117]
    #[test]
    fn align_blocksはブロック数の和が上限ちょうどなら通常どおり比べる() {
        let a = many("k", DOC_MAX_BLOCKS / 2, false);
        let rows = align_blocks(&a, &a.clone());
        assert_eq!(rows.len(), DOC_MAX_BLOCKS / 2);
        assert!(rows.iter().all(|r| r.kind == RowKind::Same));
    }

    // [FR-117]
    #[test]
    fn align_blocksはブロック数の和が上限を超えると全削除の後に全追加にする() {
        let a = many("k", DOC_MAX_BLOCKS / 2 + 1, false);
        let b = many("k", DOC_MAX_BLOCKS / 2, false);
        let rows = align_blocks(&a, &b);
        assert_eq!(rows.len(), a.len() + b.len());
        let (del, add) = rows.split_at(a.len());
        assert!(del
            .iter()
            .all(|r| r.kind == RowKind::Deleted && r.right.is_none()));
        assert!(add
            .iter()
            .all(|r| r.kind == RowKind::Added && r.left.is_none()));
        assert_eq!(del[0].left, Some(0));
        assert_eq!(add[0].right, Some(0));
    }

    // ---------------------------------------------------------- char_marks

    fn chars(s: &str) -> Vec<char> {
        s.chars().collect()
    }

    // [FR-117]
    #[test]
    fn char_marksは同一なら印を付けない() {
        let a = chars("同じ文字列");
        let (ma, mb) = char_marks(&a, &a.clone()).unwrap();
        assert_eq!(ma, vec![false; 5]);
        assert_eq!(mb, vec![false; 5]);
    }

    // [FR-117]
    #[test]
    fn char_marksは変わった文字だけに印を付ける() {
        let (ma, mb) = char_marks(&chars("abcdefgh"), &chars("abXdefgh")).unwrap();
        assert_eq!(
            ma,
            vec![false, false, true, false, false, false, false, false]
        );
        assert_eq!(
            mb,
            vec![false, false, true, false, false, false, false, false]
        );
    }

    // [FR-117]
    #[test]
    fn char_marksは2文字以下の一致に挟まれた変更を1つにまとめる() {
        let (ma, mb) = char_marks(&chars("AAxxBB"), &chars("CCxxDD")).unwrap();
        assert_eq!(ma, vec![true; 6]);
        assert_eq!(mb, vec![true; 6]);
    }

    // [FR-117]
    #[test]
    fn char_marksは1文字の一致に挟まれた変更もまとめる() {
        let (ma, mb) = char_marks(&chars("AAxBB"), &chars("CCxDD")).unwrap();
        assert_eq!(ma, vec![true; 5]);
        assert_eq!(mb, vec![true; 5]);
    }

    // [FR-117]
    #[test]
    fn char_marksは3文字の一致に挟まれた変更はまとめない() {
        let (ma, mb) = char_marks(&chars("AAxxxBB"), &chars("CCxxxDD")).unwrap();
        assert_eq!(ma, vec![true, true, false, false, false, true, true]);
        assert_eq!(mb, vec![true, true, false, false, false, true, true]);
    }

    // [FR-117]
    #[test]
    fn char_marksは挿入と削除を別々の側に印付けする() {
        let (ma, mb) = char_marks(&chars("abcdefgh"), &chars("abcdXXefgh")).unwrap();
        assert_eq!(ma.len(), 8);
        assert_eq!(mb.len(), 10);
        assert!(ma.iter().all(|m| !m));
        assert_eq!(mb.iter().filter(|m| **m).count(), 2);
        assert!(mb[4] && mb[5]);
    }

    // [FR-117]
    #[test]
    fn char_marksは文字数の和が上限ちょうどなら印を返す() {
        let a = vec!['a'; CHAR_DIFF_MAX_CHARS / 2];
        let b = vec!['a'; CHAR_DIFF_MAX_CHARS / 2];
        assert!(char_marks(&a, &b).is_some());
    }

    // [FR-117]
    #[test]
    fn char_marksは文字数の和が上限を超えるとnone() {
        let a = vec!['a'; CHAR_DIFF_MAX_CHARS / 2];
        let b = vec!['a'; CHAR_DIFF_MAX_CHARS / 2 + 1];
        assert!(char_marks(&a, &b).is_none());
    }

    // [FR-117]
    #[test]
    fn char_marksは編集距離が上限を超えるとnone() {
        // sum == 4000 (allowed), but edit distance 4000 > MYERS_MAX_EDITS
        let a = vec!['a'; CHAR_DIFF_MAX_CHARS / 2];
        let b = vec!['b'; CHAR_DIFF_MAX_CHARS / 2];
        assert!(char_marks(&a, &b).is_none());
    }

    // [FR-117]
    #[test]
    fn char_marksは編集距離が上限以内なら印を返す() {
        let a = vec!['a'; 500];
        let b = vec!['b'; 500];
        let (ma, mb) = char_marks(&a, &b).unwrap();
        assert!(ma.iter().all(|m| *m) && mb.iter().all(|m| *m));
    }
}