Struct ModeApp

pub struct ModeApp<T> {
    pub arg: T,
    pub modalities: Vec<Modality>,
}

Application of modalities.

Due to the simplicity of this logic, we can easily put terms in normal form: every term is a single argument along with a (possibly empty) list of modalities applied to it.

Fields

arg: T

Argument to which the modalities are applied.

modalities: Vec<Modality>

List of modalities applied (from left to right).

Implementations

impl<T> ModeApp<T>

pub fn new(arg: T) -> Self

Constructs a new term with no modalities applied.

pub fn as_ref(&self) -> ModeApp<&T>

Converts from &ModeApp<T> to ModeApp<&T>.

Note that this requires cloning the list of applied modalities.

pub fn apply(self, m: Modality) -> Self

Applies a modality.

pub fn apply_all(self, iter: impl IntoIterator<Item = Modality>) -> Self

Applies a sequence of modalities.

pub fn map<S, F: FnOnce(T) -> S>(self, f: F) -> ModeApp<S>

Maps over the argument.

pub fn flat_map<S, F: FnOnce(T) -> ModeApp<S>>(self, f: F) -> ModeApp<S>

Maps over the argument, flattening nested applications.

Trait Implementations

impl<T: Clone> Clone for ModeApp<T>

fn clone(&self) -> ModeApp<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ModeApp<T>

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

Formats the value using the given formatter.

impl<Id> From<ModeApp<ModalOp<Id>>> for ModalNode<Id>

fn from(value: ModeApp<ModalOp<Id>>) -> Self

Converts to this type from the input type.

impl<T: PartialEq> PartialEq for ModeApp<T>

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

impl<T> StructuralPartialEq for ModeApp<T>