Struct WeightedReach

#[non_exhaustive]
pub struct WeightedReach {
    pub target: usize,
    pub cost: LengthInterval,
    pub route: Route,
}

The nearest target by weighted distance, bracketed, and a walk there.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

target: usize

Index of the target the walk reaches, in the targets given.

cost: LengthInterval

Contains the weighted distance to the nearest target, counting the target’s start weight (see weighted_distance_map_seeded). upper is the weighted cost of route plus that weight, rounded up.

route: Route

The walk, from the query point to the target. Its length is its plain Euclidean length.

Trait Implementations

impl Clone for WeightedReach

fn clone(&self) -> WeightedReach

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for WeightedReach

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl PartialEq for WeightedReach

fn eq(&self, other: &WeightedReach) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for WeightedReach