Struct LaneSRoute

pub struct LaneSRoute { /* private fields */ }

A route, possibly spanning multiple (end-to-end) lanes.

The sequence of LaneSRanges should be contiguous by either presenting laterally adjacent LaneSRanges, or consecutive LaneSRanges. (In other words, taken as a Lane-space path with r=0 and h=0, it should present a G1-continuous curve.)

Implementations

impl LaneSRoute

pub fn new(ranges: Vec<LaneSRange>) -> LaneSRoute

Create a new LaneSRoute with the given ranges.

Arguments

• ranges - A vector of LaneSRange to create the LaneSRoute.

pub fn ranges(&self) -> Vec<LaneSRange>

Returns the sequence of LaneSRanges.

pub fn length(&self) -> f64

Computes the accumulated length of all LaneSRanges.

pub fn intersects(&self, other: &LaneSRoute, tolerance: f64) -> bool

Determines whether this LaneSRoute intersects with other.

Arguments

• other - The other LaneSRoute to check for intersection.
• tolerance - The tolerance to use for intersection checks.

Returns

• true if the two LaneSRoute intersect, false otherwise.