Struct Final

Source
pub struct Final { /* private fields */ }
Expand description

Data related to a finalized type, which can be extracted from a super::Type if (and only if) it is finalized.

Implementations§

Source§

impl Final

Source

pub fn unit() -> Arc<Self>

Create the unit type.

Source

pub fn two_two_n(n: usize) -> Arc<Self>

Create the type 2^(2^n) for the given n.

The type is precomputed and fast to access.

Source

pub fn u1() -> Arc<Self>

Create the type of 1-bit words.

The type is precomputed and fast to access.

Source

pub fn u2() -> Arc<Self>

Create the type of 2-bit words.

The type is precomputed and fast to access.

Source

pub fn u4() -> Arc<Self>

Create the type of 4-bit words.

The type is precomputed and fast to access.

Source

pub fn u8() -> Arc<Self>

Create the type of 8-bit words.

The type is precomputed and fast to access.

Source

pub fn u16() -> Arc<Self>

Create the type of 16-bit words.

The type is precomputed and fast to access.

Source

pub fn u32() -> Arc<Self>

Create the type of 32-bit words.

The type is precomputed and fast to access.

Source

pub fn u64() -> Arc<Self>

Create the type of 64-bit words.

The type is precomputed and fast to access.

Source

pub fn u128() -> Arc<Self>

Create the type of 128-bit words.

The type is precomputed and fast to access.

Source

pub fn u256() -> Arc<Self>

Create the type of 256-bit words.

The type is precomputed and fast to access.

Source

pub fn u512() -> Arc<Self>

Create the type of 512-bit words.

The type is precomputed and fast to access.

Source

pub fn sum(left: Arc<Self>, right: Arc<Self>) -> Arc<Self>

Create the sum of the given left and right types.

Source

pub fn product(left: Arc<Self>, right: Arc<Self>) -> Arc<Self>

Create the product of the given left and right types.

Source

pub fn tmr(&self) -> Tmr

Accessor for the TMR

Source

pub fn bit_width(&self) -> usize

Accessor for the Bit Machine bit-width of the type

Source

pub fn has_padding(&self) -> bool

Whether the type’s bit representation has any padding.

If this is true, then its “compact” witness-encoded bit-width may be lower than its “padded” bit-machine bit-width.

Source

pub fn is_empty(&self) -> bool

Check if the type is a nested product of units. In this case, values contain no information.

Source

pub fn bound(&self) -> &CompleteBound

Accessor for the type bound

Source

pub fn is_unit(&self) -> bool

Check if the type is a unit.

Source

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

Access the inner types of a sum type.

Source

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

Access the inner types of a product type.

Source

pub fn as_word(&self) -> Option<u32>

If the type is of the form TWO^(2^n), then return n.

§Post condition

0 ≤ n < 32.

Source

pub fn pad_left(&self, other: &Self) -> usize

Compute the padding of left values of the sum type Self + Other.

Source

pub fn pad_right(&self, other: &Self) -> usize

Compute the padding of right values of the sum type Self + Other.

Trait Implementations§

Source§

impl Clone for Final

Source§

fn clone(&self) -> Final

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl DagLike for &Final

Source§

type Node = Final

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

fn data(&self) -> &Final

A pointer to the underlying data
Source§

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

Interpret the node as a DAG node
Source§

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

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

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

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

fn n_children(&self) -> usize

Number of children that the node has. Read more
Source§

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. Read more
Source§

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.
Source§

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. Read more
Source§

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. Read more
Source§

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.
Source§

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. Read more
Source§

impl Debug for Final

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Display for Final

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Hash for Final

Source§

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl Ord for Final

Source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · Source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · Source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · Source§

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

Restrict a value to a certain interval. Read more
Source§

impl PartialEq for Final

Source§

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl PartialOrd for Final

Source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · Source§

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

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

impl Eq for Final

Auto Trait Implementations§

§

impl Freeze for Final

§

impl RefUnwindSafe for Final

§

impl Send for Final

§

impl Sync for Final

§

impl Unpin for Final

§

impl UnwindSafe for Final

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V