pub struct EdgeIndex { /* private fields */ }Implementations§
Source§impl EdgeIndex
impl EdgeIndex
pub fn forge(graph: &WalkGraph) -> Self
pub fn forge_allowed(graph: &WalkGraph, allowed: &[bool]) -> Self
pub fn project(&self, graph: &WalkGraph, coord: Coord) -> Option<EdgeProjection>
Sourcepub fn candidates(
&self,
graph: &WalkGraph,
coord: Coord,
max_distance_m: f64,
limit: usize,
) -> Vec<EdgeProjection>
pub fn candidates( &self, graph: &WalkGraph, coord: Coord, max_distance_m: f64, limit: usize, ) -> Vec<EdgeProjection>
Returns the nearest legal-looking geometric anchors in deterministic order. Selection policy belongs to the caller; the spatial index only supplies a bounded candidate set.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for EdgeIndex
impl RefUnwindSafe for EdgeIndex
impl Send for EdgeIndex
impl Sync for EdgeIndex
impl Unpin for EdgeIndex
impl UnsafeUnpin for EdgeIndex
impl UnwindSafe for EdgeIndex
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more