Struct Redeem

pub struct Redeem<J> { /* private fields */ }

Trait Implementations

impl<J: Clone> Clone for Redeem<J>

fn clone(&self) -> Redeem<J>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<W: Iterator<Item = Value>, J: Jet> Converter<Commit<J>, Redeem<J>> for SimpleFinalizer<W>

type Error = FinalizeError

The error type returned by the methods on this trait.

fn convert_witness( &mut self, data: &PostOrderIterItem<&CommitNode<J>>, _: &NoWitness, ) -> Result<Value, Self::Error>

For witness nodes, this method is called first to attach witness data to the node.

fn convert_disconnect( &mut self, _: &PostOrderIterItem<&CommitNode<J>>, _: Option<&Arc<RedeemNode<J>>>, _: &NoDisconnect, ) -> Result<Arc<RedeemNode<J>>, Self::Error>

For disconnect nodes, this method is called first to attach a disconnected expression to the node.

fn convert_data( &mut self, data: &PostOrderIterItem<&CommitNode<J>>, inner: Inner<&Arc<RedeemNode<J>>, J, &Arc<RedeemNode<J>>, &Value>, ) -> Result<Arc<RedeemData<J>>, Self::Error>

This method is called for every node, after Self::convert_witness or Self::prune_case, if either is applicable.

fn visit_node(&mut self, _data: &PostOrderIterItem<&Node<N>>)

This method is called on every node, to inform the Converter about the state of the iterator.

fn prune_case( &mut self, _data: &PostOrderIterItem<&Node<N>>, _left: &Arc<Node<M>>, _right: &Arc<Node<M>>, ) -> Result<Hide, Self::Error>

For case nodes, this method is called first to decide which, if any, children to prune.

impl<J: Debug> Debug for Redeem<J>

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

Formats the value using the given formatter.

impl<J: Hash> Hash for Redeem<J>

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<J: Jet> Marker for Redeem<J>

type CachedData = Arc<RedeemData<J>>

Precomputed data about the node, such as its type arrow or various Merkle roots.

type Witness = Value

Type of witness data attached to DAGs of this node type. Typically either Value or NoWitness.

type Disconnect = Arc<Node<Redeem<J>>>

Type of disconnect data attached to DAGs of this node type.

type SharingId = Ihr

A type which uniquely identifies a node, for purposes of sharing during iteration over the DAG.

type Jet = J

The jet catalogue used with this node type.

fn compute_sharing_id(_: Cmr, cached_data: &Arc<RedeemData<J>>) -> Option<Ihr>

Yields the sharing ID for a given type, starting from its CMR and its cached data.

impl<J: Ord> Ord for Redeem<J>

fn cmp(&self, other: &Redeem<J>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<J: PartialEq> PartialEq for Redeem<J>

fn eq(&self, other: &Redeem<J>) -> 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<J: PartialOrd> PartialOrd for Redeem<J>

fn partial_cmp(&self, other: &Redeem<J>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<J: Copy> Copy for Redeem<J>

impl<J: Eq> Eq for Redeem<J>

impl<J> StructuralPartialEq for Redeem<J>