Struct IsInCycleKey 

pub struct IsInCycleKey {
    pub node_id: NodeId,
    pub circular_type: CircularType,
    pub bounds: CycleBounds,
}

Cache key for IsInCycleQuery.

Fields

node_id: NodeId

The node to check.

circular_type: CircularType

Which edge kind to traverse.

bounds: CycleBounds

Cycle filtering bounds.

Trait Implementations

impl Clone for IsInCycleKey

fn clone(&self) -> IsInCycleKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IsInCycleKey

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for IsInCycleKey

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for IsInCycleKey

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 IsInCycleKey

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

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 IsInCycleKey

impl StructuralPartialEq for IsInCycleKey