Enum TrafficPattern 

#[non_exhaustive]
pub enum TrafficPattern {
    Uniform,
    UpPeak,
    DownPeak,
    Lunchtime,
    Mixed,
}

Traffic pattern for generating realistic rider origin/destination distributions.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Uniform

Uniform random: equal probability for all origin/destination pairs.

UpPeak

Morning rush: most riders originate from the lobby (first stop) going up.

DownPeak

Evening rush: most riders head to the lobby (first stop) from upper stops.

Lunchtime

Lunch rush: riders go from upper stops to a mid-range stop and back.

Mixed

Mixed: combination of up-peak, down-peak, and inter-floor traffic.

Implementations

impl TrafficPattern

pub fn sample( &self, stops: &[EntityId], rng: &mut impl RngExt, ) -> Option<(EntityId, EntityId)>

Sample an (origin, destination) pair from the given stops.

stops must be sorted by position (lowest first). The first stop is treated as the “lobby” for peak patterns.

Returns None if fewer than 2 stops are provided.

pub fn sample_stop_ids( &self, stops: &[StopId], rng: &mut impl RngExt, ) -> Option<(StopId, StopId)>

Sample an (origin, destination) pair using config StopIds.

Same as sample but works with StopId slices for use outside the simulation (no EntityId resolution needed).

Trait Implementations

impl Clone for TrafficPattern

fn clone(&self) -> TrafficPattern

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TrafficPattern

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TrafficPattern

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for TrafficPattern

fn eq(&self, other: &TrafficPattern) -> 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 Serialize for TrafficPattern

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for TrafficPattern

impl Eq for TrafficPattern

impl StructuralPartialEq for TrafficPattern