jubarte-redlines 0.9.0

Lossless DOCX redline engine — compare two Word documents into a tracked-changes document that opens cleanly in Microsoft Word; list, accept, or reject revisions
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

// SPDX-FileCopyrightText: 2026 Jandira Technologies, LLC
//
// SPDX-License-Identifier: AGPL-3.0-only

//! Port of `GroupAdjacent` from `PtUtil.ts` — group consecutive items sharing a
//! key into runs (each run keeps its key).

/// `GroupAdjacent(source, keySelector)` → `[(key, [items…]), …]`.
pub fn group_adjacent<T, K, F>(
    source: impl IntoIterator<Item = T>,
    key_selector: F,
) -> Vec<(K, Vec<T>)>
where
    K: PartialEq,
    F: Fn(&T) -> K,
{
    let mut out: Vec<(K, Vec<T>)> = Vec::new();
    let mut last: Option<K> = None;
    let mut list: Vec<T> = Vec::new();

    for s in source {
        let k = key_selector(&s);
        match &last {
            Some(prev) if *prev != k => {
                out.push((last.take().unwrap(), std::mem::take(&mut list)));
                list.push(s);
                last = Some(k);
            }
            _ => {
                list.push(s);
                last = Some(k);
            }
        }
    }
    if let Some(k) = last {
        out.push((k, list));
    }
    out
}