Struct PamojaRoute 

#[repr(C)]
pub struct PamojaRoute {
    pub dst: u32,
    pub next_hop: u32,
    pub cost: u16,
}

A learned way to reach one node.

Every field is a scalar, so this crosses the boundary by value.

Fields

dst: u32

The node this route reaches.

next_hop: u32

The neighbour to send a packet to on the way there.

cost: u16

What the route costs, usually in hops.

Trait Implementations

impl Clone for PamojaRoute

fn clone(&self) -> PamojaRoute

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PamojaRoute

impl Debug for PamojaRoute

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

Formats the value using the given formatter.

impl Eq for PamojaRoute

impl PartialEq for PamojaRoute

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for PamojaRoute