Struct SemifiniteFunction 

pub struct SemifiniteFunction<K: ArrayKind, T>(pub K::Type<T>);

A function whose source is finite, but whose target may be non-finite. This is really just an array!

Tuple Fields

0: K::Type<T>

Implementations

impl<K: ArrayKind, T> SemifiniteFunction<K, T>

where K::Type<T>: Array<K, T>,

pub fn new(x: K::Type<T>) -> Self

pub fn len(&self) -> K::I

pub fn singleton(x: T) -> SemifiniteFunction<K, T>

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

Trait Implementations

impl<K: ArrayKind, T> Add<&SemifiniteFunction<K, T>> for &SemifiniteFunction<K, T>

where K::Type<T>: Array<K, T>,

type Output = Option<SemifiniteFunction<K, T>>

The resulting type after applying the + operator.

fn add(self, rhs: &SemifiniteFunction<K, T>) -> Self::Output

Performs the + operation.

impl<K: ArrayKind, T> Add for SemifiniteFunction<K, T>

where K::Type<T>: Array<K, T>,

type Output = SemifiniteFunction<K, T>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<K: ArrayKind, T> Clone for SemifiniteFunction<K, T>

where K::Type<T>: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: ArrayKind, T> Debug for SemifiniteFunction<K, T>

where K::Type<T>: Debug,

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

Formats the value using the given formatter.

impl<K: ArrayKind, T> From<SemifiniteFunction<K, T>> for SemifiniteArrow<K, T>

fn from(val: SemifiniteFunction<K, T>) -> Self

Converts to this type from the input type.

impl<K: ArrayKind, T> HasLen<K> for SemifiniteFunction<K, T>

where K::Type<T>: Array<K, T>,

fn len(&self) -> K::I

fn is_empty(&self) -> bool

impl<K: ArrayKind, T> PartialEq for SemifiniteFunction<K, T>

where K::Type<T>: PartialEq,

fn eq(&self, other: &SemifiniteFunction<K, 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<K: ArrayKind, T> Shr<&SemifiniteFunction<K, T>> for &FiniteFunction<K>

where K::Type<T>: Array<K, T>,

A FiniteFunction can be precomposed with a SemifiniteFunction to re-index it.

type Output = Option<SemifiniteFunction<K, T>>

The resulting type after applying the >> operator.

fn shr( self, other: &SemifiniteFunction<K, T>, ) -> Option<SemifiniteFunction<K, T>>

Performs the >> operation.

impl<K: ArrayKind, T> TryFrom<SemifiniteArrow<K, T>> for SemifiniteFunction<K, T>

type Error = ()

The type returned in the event of a conversion error.

fn try_from(value: SemifiniteArrow<K, T>) -> Result<Self, Self::Error>

Performs the conversion.

impl<K: ArrayKind, T> Zero for SemifiniteFunction<K, T>

where K::Type<T>: Array<K, T>,

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.