Struct lattices::Conflict

pub struct Conflict<T>(/* private fields */);

A Conflict lattice, stores a single instance of T and goes to a “conflict” state (None) if inequal T instances are merged together.

Like Point<T>, but will go to “conflict” (top/None) instead of panicking.

Can be thought of as a lattice with a domain of size one, corresponding to the specific value inside.

This can be used to wrap non-lattice (scalar) data into a lattice type.

Implementations

impl<T> Conflict<T>

pub fn new(val: Option<T>) -> Self

Create a new Conflict lattice instance from a value.

pub fn new_from(val: impl Into<Option<T>>) -> Self

Create a new Conflict lattice instance from a value using Into.

pub fn as_reveal_ref(&self) -> Option<&T>

Reveal the inner value as a shared reference.

pub fn as_reveal_mut(&mut self) -> Option<&mut T>

Reveal the inner value as an exclusive reference.

pub fn into_reveal(self) -> Option<T>

Gets the inner by value, consuming self.

Trait Implementations

impl<T: Clone> Clone for Conflict<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Conflict<T>

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

Formats the value using the given formatter.

impl<T> DeepReveal for Conflict<T>

type Revealed = Option<T>

The underlying type when revealed.

fn deep_reveal(self) -> Self::Revealed

Reveals the underlying lattice types recursively.

impl<'de, T> Deserialize<'de> for Conflict<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> IsBot for Conflict<T>

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥).

impl<T> IsTop for Conflict<T>

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

impl<T> LatticeFrom<Conflict<T>> for Conflict<T>

fn lattice_from(other: Conflict<T>) -> Self

Convert from the Other lattice into Self.

impl<T, O> Merge<Conflict<O>> for Conflict<T>

where T: PartialEq<O>,

fn merge(&mut self, other: Conflict<O>) -> bool

Merge other into the self lattice.

fn merge_owned(this: Self, delta: Other) -> Self

where Self: Sized,

Merge this and delta together, returning the new value.

impl<T, O> PartialEq<Conflict<O>> for Conflict<T>

where T: PartialEq<O>,

fn eq(&self, other: &Conflict<O>) -> 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, O> PartialOrd<Conflict<O>> for Conflict<T>

where T: PartialEq<O>,

fn partial_cmp(&self, other: &Conflict<O>) -> 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<T> Serialize for Conflict<T>

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Copy> Copy for Conflict<T>

impl<T: Eq> Eq for Conflict<T>

impl<T, O> LatticeOrd<Conflict<O>> for Conflict<T>

where Self: PartialOrd<Conflict<O>>,