Struct Node

pub struct Node(/* private fields */);

A single node in a circuit.

Trait Implementations

impl AsRef<Node> for Terminal

fn as_ref(&self) -> &Node

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Node

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl FlatLen for Node

fn len(&self) -> usize

The length of the flattened list.

fn is_empty(&self) -> bool

Whether or not the flattened representation is empty.

impl Flatten<Node> for ()

fn flatten<E>(&self, _output: &mut E)

where E: Extend<Node>,

Flatten a structure into a list.

fn flatten_vec(&self) -> Vec<T>

Flatten into a Vec.

impl Flatten<Node> for Node

fn flatten<E>(&self, output: &mut E)

where E: Extend<Node>,

Flatten a structure into a list.

fn flatten_vec(&self) -> Vec<T>

Flatten into a Vec.

impl Flatten<Node> for Terminal

fn flatten<E>(&self, output: &mut E)

where E: Extend<Node>,

Flatten a structure into a list.

fn flatten_vec(&self) -> Vec<T>

Flatten into a Vec.

impl Flatten<Node> for Vec<Node>

fn flatten<E>(&self, output: &mut E)

where E: Extend<Node>,

Flatten a structure into a list.

fn flatten_vec(&self) -> Vec<T>

Flatten into a Vec.

impl HasBundleKind for Node

type BundleKind = Signal

The Rust type of the BundleKind associated with this bundle.

fn kind(&self) -> Self::BundleKind

Returns the BundleKind of this bundle.

impl HasNestedView for Node

type NestedView = NestedNode

A view of the nested object.

fn nested_view(&self, parent: &InstancePath) -> NestedView<Self>

Creates a nested view of the object given a parent node.

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 Serialize for Node

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Unflatten<Signal, Node> for Node

fn unflatten<I>(_data: &Signal, source: &mut I) -> Option<Self>

where I: Iterator<Item = Node>,

Unflatten a structure from an iterator.

impl UnifyKey for Node

type Value = Option<NodeUfValue>

fn index(&self) -> u32

fn from_index(u: u32) -> Self

fn tag() -> &'static str

fn order_roots( a: Self, a_value: &Self::Value, b: Self, b_value: &Self::Value, ) -> Option<(Self, Self)>

You should return first the key that should be used as root, then the other key (that will then point to the new root).

impl Copy for Node

impl Eq for Node

impl StructuralPartialEq for Node