Struct map_model::Lane[][src]

pub struct Lane {
    pub id: LaneID,
    pub parent: RoadID,
    pub lane_type: LaneType,
    pub lane_center_pts: PolyLine,
    pub width: Distance,
    pub src_i: IntersectionID,
    pub dst_i: IntersectionID,
    pub bus_stops: BTreeSet<BusStopID>,
    pub driving_blackhole: bool,
    pub biking_blackhole: bool,
}

A road segment is broken down into individual lanes, which have a LaneType.

Fields

id: LaneIDparent: RoadIDlane_type: LaneTypelane_center_pts: PolyLinewidth: Distancesrc_i: IntersectionIDdst_i: IntersectionIDbus_stops: BTreeSet<BusStopID>

Meaningless order

driving_blackhole: bool

{Cars, bikes} trying to start or end here might not be able to reach most lanes in the graph, because this is near a border.

biking_blackhole: bool

Implementations

impl Lane[src]

pub fn first_pt(&self) -> Pt2D[src]

pub fn last_pt(&self) -> Pt2D[src]

pub fn first_line(&self) -> Line[src]

pub fn last_line(&self) -> Line[src]

pub fn endpoint(&self, i: IntersectionID) -> Pt2D[src]

pub fn end_line(&self, i: IntersectionID) -> Line[src]

pt2 will be endpoint

pub fn dist_along_of_point(&self, pt: Pt2D) -> Option<Distance>[src]

pub fn length(&self) -> Distance[src]

pub fn intersections(&self) -> Vec<IntersectionID>[src]

pub fn number_parking_spots(&self, cfg: &MapConfig) -> usize[src]

pub fn is_driving(&self) -> bool[src]

pub fn is_biking(&self) -> bool[src]

pub fn is_bus(&self) -> bool[src]

pub fn is_walkable(&self) -> bool[src]

pub fn is_sidewalk(&self) -> bool[src]

pub fn is_shoulder(&self) -> bool[src]

pub fn is_parking(&self) -> bool[src]

pub fn is_light_rail(&self) -> bool[src]

pub fn get_directed_parent(&self, map: &Map) -> DirectedRoadID[src]

pub fn get_turn_restrictions(&self, road: &Road) -> Option<BTreeSet<TurnType>>[src]

pub fn trace_around_block(
    &self,
    map: &Map
) -> Option<(Polygon, BTreeSet<LaneID>)>
[src]

Starting from this lane, follow the lane's left edge to the intersection, continuing to "walk around the block" until we reach the starting point. This only makes sense for the outermost lanes on a road. Returns the polygon and all visited lanes.

TODO This process currently fails for some starting positions; orienting is weird.

Trait Implementations

impl Debug for Lane[src]

impl<'de> Deserialize<'de> for Lane[src]

impl Serialize for Lane[src]

Auto Trait Implementations

impl RefUnwindSafe for Lane[src]

impl Send for Lane[src]

impl Sync for Lane[src]

impl Unpin for Lane[src]

impl UnwindSafe for Lane[src]

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> DeserializeOwned for T where
    T: for<'de> Deserialize<'de>, 
[src]

impl<T> From<T> for T[src]

impl<T> Instrument for T[src]

impl<T> Instrument for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,