Struct Trail 

pub struct Trail {
    pub shape: RouteShape,
    pub support_points: Vec<SupportPoint>,
    pub routing: RoutingLaw,
}

Fields

shape: RouteShape

support_points: Vec<SupportPoint>

routing: RoutingLaw

Implementations

impl Trail

pub fn forge( shape: RouteShape, support_points: Vec<SupportPoint>, routing: RoutingLaw, ) -> Result<Self>

pub fn validate(&self) -> Result<()>

pub fn infer( graph: &WalkGraph, route: &Route, routing: RoutingLaw, ) -> Option<Self>

Recovers a compact, lossless support design. Globally shortest spans remain single legs; an irreducible non-shortest edge receives an interior support so the design compels that physical segment.

pub fn realize( &self, name: impl Into<String>, graph: &WalkGraph, constraints: &LoopConstraints, max_snap_m: f64, ) -> Result<TrailRealization>

pub fn realize_indexed( &self, name: impl Into<String>, graph: &WalkGraph, index: &EdgeIndex, router: &WalkRouter, constraints: &LoopConstraints, max_snap_m: f64, ) -> Result<TrailRealization>

Trait Implementations

impl Clone for Trail

fn clone(&self) -> Trail

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Trail

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Trail

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Trail

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Trail

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Trail