berkus
/
topola
mirror of https://codeberg.org/topola/topola.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

drawing: remove forgotten leftover dbg!() traces

This commit is contained in:
Mikolaj Wielgus 2024-06-13 18:46:27 +02:00
parent cff6b5aaf6
commit 339387c657
1 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/drawing/drawing.rs
View File

@ -782,7 +782,6 @@ impl<CW: Copy, R: RulesTrait> Drawing<CW, R> {
&limiting_shape.envelope_3d(0.0, node.primitive(self).layer()), &limiting_shape.envelope_3d(0.0, node.primitive(self).layer()),
) )
.filter_map(|wrapper| { .filter_map(|wrapper| {
dbg!("a");
if let GenericNode::Primitive(primitive_node) = wrapper.data { if let GenericNode::Primitive(primitive_node) = wrapper.data {
Some(primitive_node) Some(primitive_node)
} else { } else {
@ -790,21 +789,19 @@ impl<CW: Copy, R: RulesTrait> Drawing<CW, R> {
} }
}) })
.filter(|primitive_node| { .filter(|primitive_node| {
dbg!("b");
maybe_except.is_some_and(|except| !except.contains(&primitive_node)) maybe_except.is_some_and(|except| !except.contains(&primitive_node))
}) })
.filter(|primitive_node| dbg!(!self.are_connectable(node, *primitive_node))) .filter(|primitive_node| !self.are_connectable(node, *primitive_node))
.filter(|primitive_node| { .filter(|primitive_node| {
dbg!(node, primitive_node);
let infringee_conditions = primitive_node.primitive(self).conditions(); let infringee_conditions = primitive_node.primitive(self).conditions();
let epsilon = 1.0; let epsilon = 1.0;
inflated_shape = dbg!(node.primitive(self).shape().inflate( inflated_shape = node.primitive(self).shape().inflate(
(self.rules.clearance(&conditions, &infringee_conditions) - epsilon) (self.rules.clearance(&conditions, &infringee_conditions) - epsilon)
.clamp(0.0, f64::INFINITY), .clamp(0.0, f64::INFINITY),
)); );
dbg!(inflated_shape.intersects(&dbg!(primitive_node.primitive(self).shape()))) inflated_shape.intersects(&primitive_node.primitive(self).shape())
}) })
.map(|primitive_node| primitive_node) .map(|primitive_node| primitive_node)
.next() .next()