Struct pergola::MinOpt

pub struct MinOpt<M: DefTraits> { /* fields omitted */ }

This lattice is similar to MaxDef but inverts the order, with the minimal value according to Ord::cmp as its join, and the unit being a putative "maximal" value of the element type. Since several Ord types do not have a maximal value (think strings, maps, etc.) MinOpt represents its element using an Option where None is the "maximal" value (that forms the lattice unit) and Some is for the other non-unit values.

Note this may not be quite what you want if your type does have a maximal element. For example this will make the unit of u32 still be None, not std::u32::MAX. For those, use MinNum. Both are safe, but MinOpt is weird in those cases.

Trait Implementations

impl<M: Clone + DefTraits> Clone for MinOpt<M>

pub fn clone(&self) -> MinOpt<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M: Debug + DefTraits> Debug for MinOpt<M>

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

Formats the value using the given formatter.

impl<M: Default + DefTraits> Default for MinOpt<M>

pub fn default() -> MinOpt<M>

Returns the "default value" for a type.

impl<'de, M: DefTraits> Deserialize<'de> for MinOpt<M>

pub fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<M: Eq + DefTraits> Eq for MinOpt<M>

impl<M: Hash + DefTraits> Hash for MinOpt<M>

pub fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<M: DefTraits> LatticeDef for MinOpt<M>

type T = Option<M>

pub fn unit() -> Self::T

pub fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

pub fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<M: Ord + DefTraits> Ord for MinOpt<M>

pub fn cmp(&self, other: &MinOpt<M>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<M: PartialEq + DefTraits> PartialEq<MinOpt<M>> for MinOpt<M>

pub fn eq(&self, other: &MinOpt<M>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &MinOpt<M>) -> bool

This method tests for !=.

impl<M: PartialOrd + DefTraits> PartialOrd<MinOpt<M>> for MinOpt<M>

pub fn partial_cmp(&self, other: &MinOpt<M>) -> Option<Ordering>

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

pub fn lt(&self, other: &MinOpt<M>) -> bool

This method tests less than (for self and other) and is used by the < operator.

pub fn le(&self, other: &MinOpt<M>) -> bool

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

pub fn gt(&self, other: &MinOpt<M>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

pub fn ge(&self, other: &MinOpt<M>) -> bool

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

impl<M: DefTraits> Serialize for MinOpt<M>

pub fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<M: DefTraits> StructuralEq for MinOpt<M>

impl<M: DefTraits> StructuralPartialEq for MinOpt<M>