Struct NearestTargetRequest 

pub struct NearestTargetRequest { /* private fields */ }

The distance from one point to the nearest of several targets.

With Self::with_avoided, every walk keeps out of the named objects: each is an obstacle wherever its body stands in the walking band, even a surface or portal the backend would otherwise walk on or through. The answer then bounds the shortest walk avoiding them all, so a lower bound beyond the plain walk’s upper bound proves that every shortest walk enters one of them. Only a backend that avoids objects is asked.

With Self::with_costs, the distance is the least weighted cost of a walk (see TravelCost), and the answer’s route is a walk whose weighted cost is at most its upper bound. Only a backend that weighs travel is asked.

Implementations

impl NearestTargetRequest

pub fn try_new( origin: MetricPoint, targets: Vec<MetricPoint>, profile: MobilityProfile, ) -> Result<Self, MetricRoutingError>

Creates a request; targets keep their order, which answers index.

pub fn with_costs(self, costs: Vec<TravelCost>) -> Self

The same request, counting travel over objects by their factors (sorted by object, each object’s greatest factor kept, factors of one dropped).

pub fn costs(&self) -> &[TravelCost]

The costs travel counts by, sorted by object; empty for plain length.

pub fn with_avoided(self, avoided: Vec<ObjectId>) -> Self

The same request, walking around avoided (sorted, deduplicated). An avoided connector is not climbed.

pub fn with_connectors(self, connectors: ConnectorRouting) -> Self

The same request, climbing through connectors between levels (see ConnectorRouting).

pub fn connectors(&self) -> Option<&ConnectorRouting>

The connectors a route may climb through; None for a request that leaves them to the backend.

pub fn origin(&self) -> &MetricPoint

Where every route starts.

pub fn targets(&self) -> &[MetricPoint]

The targets, in request order.

pub fn profile(&self) -> MobilityProfile

Mobility envelope.

pub fn avoided(&self) -> &[ObjectId]

The objects every walk keeps out of, sorted; empty for a plain walk.

Trait Implementations

impl Clone for NearestTargetRequest

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NearestTargetRequest

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

Formats the value using the given formatter.

impl PartialEq for NearestTargetRequest

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NearestTargetRequest