use crate::NodeKey;
use euclid::default::{Box2D, Point2D};
use crate::view::{point_segment_distance, segment_intersects_box};
use crate::{RectSelection, Simulation};
impl Simulation {
pub fn edge_segments(
&self,
) -> impl Iterator<Item = (NodeKey, NodeKey, Point2D<f32>, Point2D<f32>)> + '_ {
self.edges.iter().filter_map(move |&(a, b)| {
let pa = self.position_of(a)?;
let pb = self.position_of(b)?;
Some((a, b, pa, pb))
})
}
pub fn edge_hit_test(&self, point: Point2D<f32>, tolerance: f32) -> Option<(NodeKey, NodeKey)> {
let mut best: Option<((NodeKey, NodeKey), f32)> = None;
for (a, b, pa, pb) in self.edge_segments() {
let d = point_segment_distance(point, pa, pb);
if d <= tolerance && best.map_or(true, |(_, bd)| d < bd) {
best = Some(((a, b), d));
}
}
best.map(|(edge, _)| edge)
}
pub fn rect_select(&self, region: Box2D<f32>) -> RectSelection {
let nodes = self
.positions()
.filter(|(_, p)| region.contains(*p))
.map(|(node, _)| node)
.collect();
let edges = self
.edge_segments()
.filter(|&(_, _, pa, pb)| segment_intersects_box(pa, pb, region))
.map(|(a, b, _, _)| (a, b))
.collect();
RectSelection { nodes, edges }
}
}
#[cfg(test)]
mod tests {
use euclid::default::{Box2D, Point2D};
use crate::{NodeKey, Simulation};
fn sim_with_edge() -> (Simulation, NodeKey, NodeKey) {
let a = NodeKey::new(0);
let b = NodeKey::new(1);
let mut sim = Simulation::new();
sim.sync_nodes([(a, Point2D::new(0.0, 0.0)), (b, Point2D::new(100.0, 0.0))]);
sim.sync_edges([(a, b)]);
sim.refresh_spatial_index();
(sim, a, b)
}
#[test]
fn edge_segments_resolves_endpoints() {
let (sim, a, b) = sim_with_edge();
let segs: Vec<_> = sim.edge_segments().collect();
assert_eq!(segs.len(), 1);
let (sa, sb, pa, pb) = segs[0];
assert_eq!((sa, sb), (a, b));
assert!((pa - Point2D::new(0.0, 0.0)).length() < 0.5);
assert!((pb - Point2D::new(100.0, 0.0)).length() < 0.5);
}
#[test]
fn edge_hit_test_picks_near_segment_only() {
let (sim, a, b) = sim_with_edge();
assert_eq!(
sim.edge_hit_test(Point2D::new(50.0, 0.0), 5.0),
Some((a, b))
);
assert_eq!(
sim.edge_hit_test(Point2D::new(50.0, 3.0), 5.0),
Some((a, b))
);
assert!(sim.edge_hit_test(Point2D::new(50.0, 50.0), 5.0).is_none());
assert!(sim.edge_hit_test(Point2D::new(200.0, 0.0), 5.0).is_none());
}
#[test]
fn rect_select_returns_nodes_and_crossed_edges() {
let (sim, a, b) = sim_with_edge();
let near_origin = sim.rect_select(Box2D::new(
Point2D::new(-10.0, -10.0),
Point2D::new(10.0, 10.0),
));
assert_eq!(near_origin.nodes, vec![a]);
assert_eq!(near_origin.edges, vec![(a, b)]);
let midspan = sim.rect_select(Box2D::new(
Point2D::new(40.0, -5.0),
Point2D::new(60.0, 5.0),
));
assert!(midspan.nodes.is_empty());
assert_eq!(midspan.edges, vec![(a, b)]);
let empty = sim.rect_select(Box2D::new(
Point2D::new(40.0, 500.0),
Point2D::new(60.0, 600.0),
));
assert!(empty.nodes.is_empty() && empty.edges.is_empty());
}
}