Struct ReconnectEdge 

pub struct ReconnectEdge {
    pub from: ReconnectFrom,
    pub to_h: RawNodeIndex,
    pub indirect: bool,
}

Fields

from: ReconnectFrom

to_h: RawNodeIndex

A non-visible parent of the current visible node, set only if to_v.reconnect_parents().

indirect: bool

Did we walk through any hidden nodes on a path between from_v and to_v?

Implementations

impl ReconnectEdge

pub fn is_direct_visible(&self) -> bool

Trait Implementations

impl Clone for ReconnectEdge

fn clone(&self) -> ReconnectEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReconnectEdge

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

Formats the value using the given formatter.

impl Hash for ReconnectEdge

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ReconnectEdge

fn eq(&self, other: &ReconnectEdge) -> 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 Copy for ReconnectEdge

impl Eq for ReconnectEdge

impl StructuralPartialEq for ReconnectEdge