Struct ScanDispatch 

pub struct ScanDispatch { /* private fields */ }

Elevator dispatch using the SCAN (elevator) algorithm.

Each car tracks a sweep direction; stops demanded in that direction receive a positional cost while stops behind are excluded. When nothing remains ahead, the sweep reverses and the car considers the reverse side. Direction and mode are resolved once per pass in DispatchStrategy::prepare_car so ranking is independent of the iteration order over stops.

Implementations

impl ScanDispatch

pub fn new() -> Self

Create a new ScanDispatch with no initial direction state.

Trait Implementations

impl Default for ScanDispatch

fn default() -> Self

Returns the “default value” for a type.

impl DispatchStrategy for ScanDispatch

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 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 notify_removed(&mut self, elevator: EntityId)

Notify the strategy that an elevator has been removed.

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

Optional hook called once per group before the assignment 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.