Struct erg_common::tsort::Node

pub struct Node<T: Eq + Hash, U> {
    pub id: T,
    pub data: U,
    pub depends_on: Set<T>,
}

Fields

id: T

data: U

depends_on: Set<T>

Implementations

impl<T: Eq + Hash, U> Node<T, U>

pub const fn new(id: T, data: U, depends_on: Set<T>) -> Self

pub fn push_dep(&mut self, dep: T)

pub fn pop_dep(&mut self, dep: &T) -> bool

pub fn depends_on(&self, dep: &T) -> bool

Trait Implementations

impl<T: Clone + Eq + Hash, U: Clone> Clone for Node<T, U>

fn clone(&self) -> Node<T, U>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Eq + Hash, U: Debug> Debug for Node<T, U>

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

Formats the value using the given formatter.

impl<T: PartialEq + Eq + Hash, U: PartialEq> PartialEq for Node<T, U>

fn eq(&self, other: &Node<T, U>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq + Eq + Hash, U: Eq> Eq for Node<T, U>

impl<T: Eq + Hash, U> StructuralPartialEq for Node<T, U>