nucleation 0.10.14

A high-performance Minecraft schematic parser and utility library
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

//! Cluster change cells into connected regions (face-connectivity).

use std::collections::{HashMap, HashSet, VecDeque};

use crate::diff::{Diff, IVec3};

#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub enum RegionKind {
    Added,
    Removed,
    Changed,
    Swapped,
    Mixed,
}

#[derive(Clone, Debug)]
pub struct Region {
    pub min: IVec3,
    pub max: IVec3,
    pub kind: RegionKind,
    pub count: u32,
}

pub fn regions(diff: &Diff) -> Vec<Region> {
    let mut kind_of: HashMap<IVec3, RegionKind> = HashMap::new();
    for (p, _) in &diff.added {
        kind_of.insert(*p, RegionKind::Added);
    }
    for (p, _) in &diff.removed {
        kind_of.insert(*p, RegionKind::Removed);
    }
    for (p, _, _) in &diff.changed {
        kind_of.insert(*p, RegionKind::Changed);
    }
    for (p, _, _) in &diff.swapped {
        kind_of.insert(*p, RegionKind::Swapped);
    }

    let all: HashSet<IVec3> = kind_of.keys().copied().collect();
    let mut seen: HashSet<IVec3> = HashSet::new();
    let mut out = Vec::new();
    let neighbours = |(x, y, z): IVec3| {
        [
            (x + 1, y, z),
            (x - 1, y, z),
            (x, y + 1, z),
            (x, y - 1, z),
            (x, y, z + 1),
            (x, y, z - 1),
        ]
    };
    for &start in &all {
        if seen.contains(&start) {
            continue;
        }
        let mut q = VecDeque::from([start]);
        seen.insert(start);
        let (mut mn, mut mx) = (start, start);
        let mut count = 0u32;
        let mut kinds: HashSet<RegionKind> = HashSet::new();
        while let Some(p) = q.pop_front() {
            count += 1;
            kinds.insert(kind_of[&p]);
            mn = (mn.0.min(p.0), mn.1.min(p.1), mn.2.min(p.2));
            mx = (mx.0.max(p.0), mx.1.max(p.1), mx.2.max(p.2));
            for n in neighbours(p) {
                if all.contains(&n) && !seen.contains(&n) {
                    seen.insert(n);
                    q.push_back(n);
                }
            }
        }
        let kind = if kinds.len() == 1 {
            *kinds.iter().next().unwrap()
        } else {
            RegionKind::Mixed
        };
        out.push(Region {
            min: mn,
            max: mx,
            kind,
            count,
        });
    }
    out
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::block_state::BlockState;
    use crate::diff::{diff, DiffSpec};
    use crate::fingerprint::testgen::filled_box;
    use crate::fingerprint::FingerprintSpec;

    #[test]
    fn swapped_cells_form_a_swapped_region() {
        use crate::fingerprint::testgen::repalette;
        let a = filled_box((0, 0, 0), (2, 0, 0), "minecraft:stone");
        let b = repalette(&a, "minecraft:stone", "minecraft:cobblestone");
        let spec = DiffSpec::from_preset(FingerprintSpec::exact());
        let d = diff(&a, &b, &spec);
        assert!(
            !d.swapped.is_empty(),
            "pure re-palette yields swapped cells"
        );
        let regs = regions(&d);
        let covered: usize = regs.iter().map(|r| r.count as usize).sum();
        assert_eq!(covered, d.swapped.len(), "every swapped cell is clustered");
        assert!(
            regs.iter().any(|r| r.kind == RegionKind::Swapped),
            "a region reports kind Swapped"
        );
    }

    #[test]
    fn swapped_adjacent_to_added_is_mixed() {
        let a = filled_box((0, 0, 0), (0, 0, 0), "minecraft:stone");
        let mut b = filled_box((0, 0, 0), (0, 0, 0), "minecraft:cobblestone"); // swap at origin
        b.set_block(1, 0, 0, &BlockState::new("minecraft:glass")); // added, face-adjacent
        let spec = DiffSpec::from_preset(FingerprintSpec::exact());
        let d = diff(&a, &b, &spec);
        assert_eq!(d.swapped.len(), 1);
        assert_eq!(d.added.len(), 1);
        let regs = regions(&d);
        assert_eq!(regs.len(), 1, "adjacent swapped+added → one cluster");
        assert_eq!(regs[0].kind, RegionKind::Mixed);
    }

    #[test]
    fn two_separate_added_blobs_make_two_regions() {
        let a = filled_box((0, 0, 0), (0, 0, 0), "minecraft:stone");
        let mut b = filled_box((0, 0, 0), (0, 0, 0), "minecraft:stone");
        b.set_block(10, 0, 0, &BlockState::new("minecraft:stone"));
        b.set_block(20, 0, 0, &BlockState::new("minecraft:stone"));
        let spec = DiffSpec::from_preset(FingerprintSpec::structural());
        let d = diff(&a, &b, &spec);
        let regs = regions(&d);
        assert_eq!(regs.len(), 2, "two separated added cells → two regions");
        assert!(regs.iter().all(|r| matches!(r.kind, RegionKind::Added)));
    }
}