Struct sim::mechanics::queue::Queue

pub(crate) struct Queue {
    pub id: Traversable,
    pub cars: VecDeque<CarID>,
    pub laggy_head: Option<CarID>,
    pub geom_len: Distance,
    pub reserved_length: Distance,
}

A Queue of vehicles on a single lane or turn. No over-taking or lane-changing. This is where https://a-b-street.github.io/docs/tech/trafficsim/discrete_event.html#exact-positions is implemented.

Fields

id: Traversable

cars: VecDeque<CarID>

laggy_head: Option<CarID>

This car’s back is still partly in this queue.

geom_len: Distance

reserved_length: Distance

When a car’s turn is accepted, reserve the vehicle length + FOLLOWING_DISTANCE for the target lane. When the car completely leaves (stops being the laggy_head), free up that space. To prevent blocking the box for possibly scary amounts of time, allocate some of this length first. This is unused for turns themselves. This value can exceed geom_len (for the edge case of ONE long car on a short queue).

Implementations

impl Queue

pub fn new(id: Traversable, map: &Map) -> Queue

pub fn get_last_car_position(
    &self,
    now: Time,
    cars: &FixedMap<CarID, Car>,
    queues: &HashMap<Traversable, Queue>
) -> Option<(CarID, Distance)>

pub fn get_car_positions(
    &self,
    now: Time,
    cars: &FixedMap<CarID, Car>,
    queues: &HashMap<Traversable, Queue>
) -> Vec<(CarID, Distance)>

Farthest along (greatest distance) is first.

fn inner_get_last_car_position(
    &self,
    now: Time,
    cars: &FixedMap<CarID, Car>,
    queues: &HashMap<Traversable, Queue>,
    recursed_queues: &mut BTreeSet<Traversable>,
    intermediate_results: Option<&mut Vec<(CarID, Distance)>>
) -> Option<(CarID, Distance)>

pub fn get_idx_to_insert_car(
    &self,
    start_dist: Distance,
    vehicle_len: Distance,
    now: Time,
    cars: &FixedMap<CarID, Car>,
    queues: &HashMap<Traversable, Queue>
) -> Option<usize>

pub fn try_to_reserve_entry(&mut self, car: &Car, force_entry: bool) -> bool

If true, there’s room and the car must actually start the turn (because the space is reserved).

pub fn is_overflowing(&self) -> bool

pub fn room_for_car(&self, car: &Car) -> bool

pub fn free_reserved_space(&mut self, car: &Car)

pub fn target_lane_penalty(&self) -> (usize, usize)

pub fn get_leader(&self, id: CarID) -> Option<CarID>

Find the vehicle in front of the specified input. None if this vehicle isn’t in the queue at all, or they’re the front (with or without a laggy head).

Trait Implementations

impl Clone for Queue

fn clone(&self) -> Queue

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Queue

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Queue

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Serialize for Queue

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

Serialize this value into the given Serde serializer.