Struct DagNode 

pub struct DagNode<T> {
    pub id: PositionId,
    pub value: T,
    pub incoming: HashSet<PositionId>,
    pub outgoing: HashSet<PositionId>,
    pub visible: bool,
}

DAG (Directed Acyclic Graph) node

Fields

id: PositionId

Unique node identifier

value: T

Node value

incoming: HashSet<PositionId>

Incoming edges (dependencies)

outgoing: HashSet<PositionId>

Outgoing edges (dependents)

visible: bool

Whether the node is visible (not deleted)

Implementations

impl<T> DagNode<T>

pub fn new(id: PositionId, value: T) -> Self

Create a new DAG node

Trait Implementations

impl<T: Clone> Clone for DagNode<T>

fn clone(&self) -> DagNode<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for DagNode<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for DagNode<T>

where T: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: PartialEq> PartialEq for DagNode<T>

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

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> StructuralPartialEq for DagNode<T>