Struct ReachabilityKey 

pub struct ReachabilityKey {
    pub roots: Vec<NodeId>,
    pub edge_kind: EdgeKind,
}

Key for a reachability query: a set of root nodes + edge kind.

Fields

roots: Vec<NodeId>

Root nodes to start BFS from.

edge_kind: EdgeKind

Edge kind to follow.

Trait Implementations

impl Clone for ReachabilityKey

fn clone(&self) -> ReachabilityKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReachabilityKey

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ReachabilityKey

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for ReachabilityKey

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 ReachabilityKey

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for ReachabilityKey

impl StructuralPartialEq for ReachabilityKey