Struct ConnectorRouting 

pub struct ConnectorRouting { /* private fields */ }

The vertical connectors a route may climb through, and how a climb counts.

A route enters and leaves a connector at its landings, the two ends of its walking line, and counts the climb between them by ClimbLength. A request carrying this routes through these connectors only: any other connector is no way between levels for it. A backend that cannot prove a connector’s length or passability leaves every route through it undecided, never shorter and never blocked.

Implementations

impl ConnectorRouting

pub fn try_new( connectors: Vec<VerticalConnector>, climb: ClimbLength, ) -> Result<Self, MetricRoutingError>

The connectors (sorted, deduplicated) and the climb length.

Errors

MetricRoutingError::ConflictingConnector when one object is given two kinds.

pub fn connectors(&self) -> &[VerticalConnector]

The connectors a route may climb through, sorted.

pub fn climb(&self) -> ClimbLength

How a climb counts.

Trait Implementations

impl Clone for ConnectorRouting

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ConnectorRouting

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

Formats the value using the given formatter.

impl PartialEq for ConnectorRouting

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for ConnectorRouting