rei-mirrors/Fornjot
1
0
Fork 0
mirror of https://github.com/hannobraun/Fornjot synced 2025-02-26 00:55:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix formatting

Browse Source 
Those comments went over the maximum line length.
This commit is contained in:
Hanno Braun 2022-04-11 16:07:55 +02:00
parent 30249b10d5
commit a5ea5877e8
1 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
fj-kernel/src/algorithms/triangulation/polygon.rs
View File

@ -123,26 +123,26 @@ impl Polygon {
} }
(Some(Hit::UpperVertex), Some(Hit::LowerVertex)) (Some(Hit::UpperVertex), Some(Hit::LowerVertex))
| (Some(Hit::LowerVertex), Some(Hit::UpperVertex)) => { | (Some(Hit::LowerVertex), Some(Hit::UpperVertex)) => {
// If we're hitting a vertex, only count it if we've hit the // If we're hitting a vertex, only count it if we've hit
// other kind of vertex right before. // the other kind of vertex right before.
// //
// That means, we're passing through the polygon boundary // That means, we're passing through the polygon
// at where two edges touch. Depending on the order in which // boundary at where two edges touch. Depending on the
// edges are checked, we're seeing this as a hit to one // order in which edges are checked, we're seeing this
// edge's lower/upper vertex, then the other edge's opposite // as a hit to one edge's lower/upper vertex, then the
// vertex. // other edge's opposite vertex.
// //
// If we're seeing two of the same vertices in a row, we're // If we're seeing two of the same vertices in a row,
// not actually passing through the polygon boundary. Then // we're not actually passing through the polygon
// we're just touching a vertex without passing through // boundary. Then we're just touching a vertex without
// anything. // passing through anything.
true true
} }
(Some(Hit::Parallel), _) => { (Some(Hit::Parallel), _) => {
// A parallel edge must be completely ignored. Its presence // A parallel edge must be completely ignored. Its
// won't change anything, so we can treat it as if it // presence won't change anything, so we can treat it as
// wasn't there, and its neighbors were connected to each // if it wasn't there, and its neighbors were connected
// other. // to each other.
continue; continue;
} }
_ => { _ => {