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
use rayon::iter::{IntoParallelRefIterator, ParallelIterator};
use std::collections::BTreeSet;
use usage::Usage;
use super::{line_eq, LineId, Lines};
use crate::{
face::{FaceDuplicates, FaceLines, FaceVertices},
BrushFaces, Brushes,
};
pub enum LineDuplicatesTag {}
pub type LineDuplicates = Usage<LineDuplicatesTag, BTreeSet<(LineId, LineId)>>;
pub fn line_duplicates(
brushes: &Brushes,
lines: &Lines,
brush_faces: &BrushFaces,
face_duplicates: &FaceDuplicates,
face_vertices: &FaceVertices,
face_lines: &FaceLines,
) -> LineDuplicates {
brushes
.par_iter()
.flat_map(|brush_a| {
let faces_a = &brush_faces[brush_a];
// Iterate over LHS brush faces
faces_a
.par_iter()
.filter(|f| !face_duplicates.iter().any(|(a, _)| a == *f))
.flat_map(move |face_a| {
// Fetch LHS vertex and line data
let verts_a = &face_vertices[&face_a];
let lines_a = &face_lines[&face_a];
// Iterate over LHS face lines
lines_a.par_iter().flat_map(move |line_id_a| {
// Fetch LHS line indices
let line_a = lines[line_id_a];
// Fetch LHS line vertices
let v0_a = &verts_a[line_a.i0];
let v1_a = &verts_a[line_a.i1];
// Iterate over brushes again to compare
brushes
.par_iter()
.flat_map(|brush_b| {
// Skip comparing with self
if brush_a == brush_b {
return None;
}
// Fetch each brush's faces
let faces_b = &brush_faces[brush_b];
// Iterate over RHS brush faces
Some(
faces_b
.par_iter()
.filter(|f| !face_duplicates.iter().any(|(a, _)| a == *f))
.flat_map(|face_b| {
// Fetch RHS vertex and line data
let verts_b = &face_vertices[face_b];
let lines_b = &face_lines[face_b];
// Iterate over RHS face lines
lines_b
.par_iter()
.flat_map(move |line_id_b| {
// Fetch RHS line indices
let line_b = lines[line_id_b];
// Fetch RHS line vertices
let v0_b = &verts_b[line_b.i0];
let v1_b = &verts_b[line_b.i1];
// If the lines are equivalent, add them to the set
if line_eq(v0_a, v1_a, v0_b, v1_b) {
Some([
(*line_id_a, *line_id_b),
(*line_id_b, *line_id_a),
])
} else {
None
}
})
.flatten()
}),
)
})
.flatten()
.collect::<BTreeSet<_>>()
})
})
})
.collect()
}