Struct ValueRef 

pub struct ValueRef<'v> { /* private fields */ }

Reference to a value, or to a sub-value of a value.

Implementations

impl<'v> ValueRef<'v>

pub fn is_unit(&self) -> bool

Check if the value is a unit.

pub fn as_left(&self) -> Option<Self>

Access the inner value of a left sum value.

pub fn as_right(&self) -> Option<Self>

Access the inner value of a right sum value.

pub fn as_product(&self) -> Option<(Self, Self)>

Access the inner values of a product value.

pub fn to_value(&self) -> Value

Convert the reference back to a value.

pub fn to_word(&self) -> Option<Word>

Try to convert the value into a word.

pub fn raw_byte_iter(&self) -> RawByteIter<'v>

Yields an iterator over the “raw bytes” of the value.

The returned bytes match the padded bit-encoding of the value. You may wish to call Self::iter_padded instead to obtain the bits, but this method is more efficient in some contexts.

pub fn iter_compact(&self) -> CompactBitsIter<'v>

Return an iterator over the compact bit encoding of the value.

This encoding is used for writing witness data and for computing IHRs.

pub fn iter_padded(&self) -> PreOrderIter<'v>

Return an iterator over the padded bit encoding of the value.

This encoding is used to represent the value in the Bit Machine.

Trait Implementations

impl<'v> Clone for ValueRef<'v>

fn clone(&self) -> ValueRef<'v>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl DagLike for ValueRef<'_>

type Node = ValueRef<'_>

The type of the DAG node, with no references or wrappers

fn data(&self) -> &Self

A pointer to the underlying data

fn as_dag_node(&self) -> Dag<Self>

Interpret the node as a DAG node

fn left_child(&self) -> Option<Self>

Accessor for the left child of the node, if one exists

fn right_child(&self) -> Option<Self>

Accessor for the right child of the node, if one exists

fn n_children(&self) -> usize

Number of children that the node has.

fn rtl_post_order_iter<S: SharingTracker<SwapChildren<Self>> + Default>( self, ) -> RtlPostOrderIter<Self, S>

Obtains an iterator of all the nodes rooted at the DAG, in right-to-left post order.

fn pre_order_iter<S: SharingTracker<Self> + Default>( self, ) -> PreOrderIter<Self, S>

Obtains an iterator of all the nodes rooted at the DAG, in pre-order.

fn verbose_pre_order_iter<S: SharingTracker<Self> + Default>( self, max_depth: Option<usize>, ) -> VerbosePreOrderIter<Self, S>

where Self: Clone,

Obtains a verbose iterator of all the nodes rooted at the DAG, in pre-order.

fn post_order_iter<S: SharingTracker<Self> + Default>( self, ) -> PostOrderIter<Self, S>

Obtains an iterator of all the nodes rooted at the DAG, in post order.

fn is_shared_as<S: SharingTracker<Self> + Default>(self) -> bool

where Self: Clone,

Checks whether a DAG’s internal sharing (as expressed by shared pointers) matches the given target sharing.

fn post_order_iter_with_tracker<S: SharingTracker<Self>>( self, tracker: S, ) -> PostOrderIter<Self, S>

Obtains an post-order iterator of all the nodes rooted at DAG, using the given tracker.

impl<'v> Debug for ValueRef<'v>

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

Formats the value using the given formatter.

impl<'v> Copy for ValueRef<'v>