rei-mirrors/Fornjot
1
0
Fork 0
mirror of https://github.com/hannobraun/Fornjot synced 2025-11-27 01:42:28 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update order of values in iterator

Browse Source
This commit is contained in:
Hanno Braun 2025-04-16 11:11:16 +02:00
parent 85cfac7f63
commit 9cc25feb3a
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
experiments/2025-03-18/src/geometry/sketch.rs
View File

@ -38,7 +38,7 @@ impl Sketch {
let vertices = VerticesFromSegments::new(&self.segments, &surface); let vertices = VerticesFromSegments::new(&self.segments, &surface);
let half_edges = vertices.iter().map( let half_edges = vertices.iter().map(
|([(segment, start), (_, end)], is_internal)| { |([(start, segment), (end, _)], is_internal)| {
let curve = match segment { let curve = match segment {
SketchSegment::Arc { .. } => { SketchSegment::Arc { .. } => {
// We are creating a line here, temporarily, while // We are creating a line here, temporarily, while
@ -120,7 +120,7 @@ impl VerticesFromSegments {
fn iter( fn iter(
&self, &self,
) -> impl Iterator<Item = ([(SketchSegment, Handle<Vertex>); 2], bool)> ) -> impl Iterator<Item = ([(Handle<Vertex>, SketchSegment); 2], bool)>
{ {
self.segments_with_start_vertex self.segments_with_start_vertex
.iter() .iter()
@ -131,7 +131,7 @@ impl VerticesFromSegments {
.map(|vertex| self.coincident_vertices.contains(vertex)); .map(|vertex| self.coincident_vertices.contains(vertex));
let is_internal = start_is_coincident && end_is_coincident; let is_internal = start_is_coincident && end_is_coincident;
([(segment, start), (next_segment, end)], is_internal) ([(start, segment), (end, next_segment)], is_internal)
}) })
} }
} }