pub(crate) struct Router {
path: Path,
goal: Goal,
owner: CarID,
}
Fields§
§path: Path
Front is always the current step
goal: Goal
§owner: CarID
Implementations§
source§impl Router
impl Router
pub fn end_at_border( owner: CarID, path: Path, end_dist: Distance, i: IntersectionID ) -> Router
pub fn park_near(owner: CarID, path: Path, bldg: BuildingID) -> Router
pub fn bike_then_stop(owner: CarID, path: Path, goal: SidewalkSpot) -> Router
pub fn follow_bus_route(owner: CarID, path: Path) -> Router
pub fn head(&self) -> Traversable
pub fn next(&self) -> Traversable
pub fn maybe_next(&self) -> Option<Traversable>
pub fn last_step(&self) -> bool
pub fn get_end_dist(&self) -> Distance
pub fn get_path(&self) -> &Path
sourcepub fn advance(
&mut self,
vehicle: &Vehicle,
parking: &ParkingSimState,
map: &Map,
trip_and_person: Option<(TripID, PersonID)>,
events: &mut Vec<Event>
) -> Traversable
pub fn advance( &mut self, vehicle: &Vehicle, parking: &ParkingSimState, map: &Map, trip_and_person: Option<(TripID, PersonID)>, events: &mut Vec<Event> ) -> Traversable
Returns the step just finished
sourcepub fn maybe_handle_end(
&mut self,
front: Distance,
vehicle: &Vehicle,
parking: &ParkingSimState,
map: &Map,
trip_and_person: Option<(TripID, PersonID)>,
events: &mut Vec<Event>
) -> Option<ActionAtEnd>
pub fn maybe_handle_end( &mut self, front: Distance, vehicle: &Vehicle, parking: &ParkingSimState, map: &Map, trip_and_person: Option<(TripID, PersonID)>, events: &mut Vec<Event> ) -> Option<ActionAtEnd>
Called when the car is Queued at the last step, or when they initially advance to the last step.
pub fn opportunistically_lanechange( &mut self, queues: &HashMap<Traversable, Queue>, map: &Map, handle_uber_turns: bool )
pub fn can_lanechange(&self, from: LaneID, to: LaneID, map: &Map) -> bool
pub fn confirm_lanechange(&mut self, to: LaneID, map: &Map)
pub fn is_parking(&self) -> bool
pub fn get_parking_spot_goal(&self) -> Option<&ParkingSpot>
Trait Implementations§
source§impl<'de> Deserialize<'de> for Router
impl<'de> Deserialize<'de> for Router
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq for Router
impl PartialEq for Router
impl StructuralPartialEq for Router
Auto Trait Implementations§
impl Freeze for Router
impl RefUnwindSafe for Router
impl Send for Router
impl Sync for Router
impl Unpin for Router
impl UnwindSafe for Router
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.