Struct LookDispatch 

pub struct LookDispatch { /* private fields */ }

Elevator dispatch using the LOOK algorithm.

Like SCAN, but reverses at the last request in the current direction instead of traveling to the end of the shaft. More efficient than pure SCAN for sparse request distributions.

This is the standard “elevator algorithm” used in real buildings.

Implementations

impl LookDispatch

pub fn new() -> Self

Create a new LookDispatch with no initial direction state.

Trait Implementations

impl Default for LookDispatch

fn default() -> Self

Returns the “default value” for a type.

impl DispatchStrategy for LookDispatch

fn decide( &mut self, elevator: EntityId, elevator_position: f64, group: &ElevatorGroup, manifest: &DispatchManifest, world: &World, ) -> DispatchDecision

Decide for a single elevator.

fn notify_removed(&mut self, elevator: EntityId)

Notify the strategy that an elevator has been removed.

fn decide_all( &mut self, elevators: &[(EntityId, f64)], group: &ElevatorGroup, manifest: &DispatchManifest, world: &World, ) -> Vec<(EntityId, DispatchDecision)>

Decide for all idle elevators in a group. Default: calls decide() per elevator.