Struct NearestCarDispatch 

pub struct NearestCarDispatch;

Scores (car, stop) by absolute distance between the car and the stop.

Paired with the Hungarian assignment in the dispatch system, this yields the globally minimum-total-distance matching across the group — no two cars can be sent to the same hall call.

Implementations

impl NearestCarDispatch

pub const fn new() -> Self

Create a new NearestCarDispatch.

Trait Implementations

impl Default for NearestCarDispatch

fn default() -> Self

Returns the “default value” for a type.

impl DispatchStrategy for NearestCarDispatch

fn rank( &mut self, _car: EntityId, car_position: f64, _stop: EntityId, stop_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, ) -> Option<f64>

Score the cost of sending car to stop. Lower is better.

fn pre_dispatch( &mut self, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &mut World, )

Optional hook called once per group before the assignment pass.

fn prepare_car( &mut self, _car: EntityId, _car_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, )

Optional hook called once per candidate car, before any rank calls for that car in the current pass.

fn fallback( &mut self, _car: EntityId, _car_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, ) -> DispatchDecision

Decide what an idle car should do when no stop was assigned to it.

fn notify_removed(&mut self, _elevator: EntityId)

Notify the strategy that an elevator has been removed.