Struct Node 

pub struct Node {
    pub id: NodeId,
    pub op: OpKind,
    pub inputs: Vec<NodeId>,
    pub shape: Vec<usize>,
}

Struct for a graph node in the ML operations sequence.

They are constructed automatically by interacting with operations in a crate::graph::Graph struct.

Each node represents a particular action as determined by the OpKind field.

Examples

#TODO

Fields

id: NodeId

ID of the current node.

This is automatically generated on Node creation.

op: OpKind

Operation of the current node in the ML pipeline. See OpKind.

inputs: Vec<NodeId>

Node IDs of the inputs to this operation.

shape: Vec<usize>

Tensor dimensions (shape) of the output tensor produced by this node.

Trait Implementations

impl Debug for Node

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

Formats the value using the given formatter.

impl Hash for Node

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 Node

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

impl StructuralPartialEq for Node