Struct sim::mechanics::parking::InfiniteParkingSimState

pub struct InfiniteParkingSimState {
    parked_cars: BTreeMap<CarID, ParkedCar>,
    occupants: BTreeMap<ParkingSpot, CarID>,
    reserved_spots: BTreeMap<ParkingSpot, CarID>,
    driving_to_offstreet: MultiMap<LaneID, (BuildingID, Distance)>,
    blackholed_building_redirects: BTreeMap<BuildingID, BuildingID>,
    num_occupants_per_offstreet: BTreeMap<BuildingID, usize>,
    events: Vec<Event>,
}

This assigns infinite private parking to all buildings and none anywhere else. This effectively disables the simulation of parking entirely, making driving trips just go directly between buildings. Useful for maps without good parking data (which is currently all of them) and experiments where parking contention skews results and just gets in the way.

Fields

parked_cars: BTreeMap<CarID, ParkedCar>

occupants: BTreeMap<ParkingSpot, CarID>

reserved_spots: BTreeMap<ParkingSpot, CarID>

driving_to_offstreet: MultiMap<LaneID, (BuildingID, Distance)>

blackholed_building_redirects: BTreeMap<BuildingID, BuildingID>

num_occupants_per_offstreet: BTreeMap<BuildingID, usize>

events: Vec<Event>

Implementations

impl InfiniteParkingSimState

fn new(map: &Map) -> InfiniteParkingSimState

fn get_free_bldg_spot(&self, b: BuildingID) -> ParkingSpot

Trait Implementations

impl Clone for InfiniteParkingSimState

fn clone(&self) -> InfiniteParkingSimState

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for InfiniteParkingSimState

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

Deserialize this value from the given Serde deserializer.

impl From<InfiniteParkingSimState> for ParkingSimState

fn from(v: InfiniteParkingSimState) -> ParkingSimState

Performs the conversion.

impl ParkingSim for InfiniteParkingSimState

fn handle_live_edits(&mut self, map: &Map) -> (Vec<ParkedCar>, Vec<CarID>)

Returns any cars that got very abruptly evicted from existence, and also cars actively moving into a deleted spot.

fn get_free_onstreet_spots(&self, _: LaneID) -> Vec<ParkingSpot>

fn get_free_offstreet_spots(&self, b: BuildingID) -> Vec<ParkingSpot>

fn get_free_lot_spots(&self, _: ParkingLotID) -> Vec<ParkingSpot>

fn reserve_spot(&mut self, spot: ParkingSpot, car: CarID)

fn unreserve_spot(&mut self, car: CarID)

Needed when abruptly deleting a car, in case they’re being deleted during their last step.

fn remove_parked_car(&mut self, p: ParkedCar)

fn add_parked_car(&mut self, p: ParkedCar)

fn get_draw_cars(&self, _: LaneID, _: &Map) -> Vec<DrawCarInput>

fn get_draw_cars_in_lots(&self, _: LaneID, _: &Map) -> Vec<DrawCarInput>

fn get_draw_car(&self, _: CarID, _: &Map) -> Option<DrawCarInput>

fn canonical_pt(&self, id: CarID, map: &Map) -> Option<Pt2D>

There’s no DrawCarInput for cars parked offstreet, so we need this.

fn get_all_draw_cars(&self, _: &Map) -> Vec<DrawCarInput>

fn is_free(&self, spot: ParkingSpot) -> bool

fn get_car_at_spot(&self, spot: ParkingSpot) -> Option<&ParkedCar>

fn get_all_free_spots(
    &self,
    driving_pos: Position,
    vehicle: &Vehicle,
    target: BuildingID,
    map: &Map
) -> Vec<(ParkingSpot, Position)>

The vehicle’s front is currently at the given driving_pos. Returns all valid spots and their driving position.

fn spot_to_driving_pos(
    &self,
    spot: ParkingSpot,
    _: &Vehicle,
    map: &Map
) -> Position

fn spot_to_sidewalk_pos(&self, spot: ParkingSpot, map: &Map) -> Position

fn get_owner_of_car(&self, id: CarID) -> Option<PersonID>

fn lookup_parked_car(&self, id: CarID) -> Option<&ParkedCar>

fn get_all_parking_spots(&self) -> (Vec<ParkingSpot>, Vec<ParkingSpot>)

(Filled, available)

fn path_to_free_parking_spot(
    &self,
    start: LaneID,
    vehicle: &Vehicle,
    target: BuildingID,
    map: &Map
) -> Option<(Vec<PathStep>, ParkingSpot, Position)>

Unrealistically assumes the driver has knowledge of currently free parking spots, even if they’re far away. Since they don’t reserve the spot in advance, somebody else can still beat them there, producing some nice, realistic churn if there’s too much contention. But the implementation has some internal jitter between different vehicles, to discourage everybody near one spot from all competing for it. Note the first PathStep is the turn after start, NOT PathStep::Lane(start).

fn collect_events(&mut self) -> Vec<Event>

fn all_parked_car_positions(&self, map: &Map) -> Vec<(Position, PersonID)>

fn bldg_to_parked_cars(&self, b: BuildingID) -> Vec<CarID>

impl Serialize for InfiniteParkingSimState

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

Serialize this value into the given Serde serializer.

impl TryInto<InfiniteParkingSimState> for ParkingSimState

type Error = &'static str

The type returned in the event of a conversion error.

fn try_into(self) -> Result<InfiniteParkingSimState, Self::Error>

Performs the conversion.