Trait IsTop

pub trait IsTop {
    // Required method
    fn is_top(&self) -> bool;
}

Trait to check if a lattice instance is top (⊤) and therefore cannot change any futher.

Required Methods

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

Must be consistent with equality, any element equal to top is also considered to be top.

Implementations on Foreign Types

impl IsTop for ()

fn is_top(&self) -> bool

Implementors

impl IsTop for Max<bool>

impl IsTop for Max<char>

impl IsTop for Max<i8>

impl IsTop for Max<i16>

impl IsTop for Max<i32>

impl IsTop for Max<i64>

impl IsTop for Max<i128>

impl IsTop for Max<isize>

impl IsTop for Max<u8>

impl IsTop for Max<u16>

impl IsTop for Max<u32>

impl IsTop for Max<u64>

impl IsTop for Max<u128>

impl IsTop for Max<()>

impl IsTop for Max<usize>

impl IsTop for Min<bool>

impl IsTop for Min<char>

impl IsTop for Min<i8>

impl IsTop for Min<i16>

impl IsTop for Min<i32>

impl IsTop for Min<i64>

impl IsTop for Min<i128>

impl IsTop for Min<isize>

impl IsTop for Min<u8>

impl IsTop for Min<u16>

impl IsTop for Min<u32>

impl IsTop for Min<u64>

impl IsTop for Min<u128>

impl IsTop for Min<()>

impl IsTop for Min<usize>

impl<Head, Node> IsTop for GhtInner<Head, Node>

where Head: Clone, Node: GeneralizedHashTrieNode, Node::Storage: VariadicSet<Schema = Node::Schema>,

impl<Inner> IsTop for WithBot<Inner>

where Inner: IsTop,

impl<Inner> IsTop for WithTop<Inner>

where Inner: IsTop,

impl<Key, Val> IsTop for DomPair<Key, Val>

where Key: IsTop, Val: IsTop,

impl<Lat> IsTop for VecUnion<Lat>

impl<LatA, LatB> IsTop for Pair<LatA, LatB>

where LatA: IsTop, LatB: IsTop,

impl<Map> IsTop for MapUnion<Map>

impl<Map> IsTop for UnionFind<Map>

impl<Map, TombstoneSet> IsTop for MapUnionWithTombstones<Map, TombstoneSet>

impl<Schema, SuffixSchema, Storage> IsTop for GhtLeaf<Schema, SuffixSchema, Storage>

where Schema: Eq + Hash, SuffixSchema: Eq + Hash, Storage: VariadicSet<Schema = Schema>,

impl<Set> IsTop for SetUnion<Set>

impl<Set, TombstoneSet> IsTop for SetUnionWithTombstones<Set, TombstoneSet>

impl<T> IsTop for Conflict<T>

impl<T, Provenance> IsTop for Point<T, Provenance>

impl IsTop for InfectingWrite

where Namespaces<Clock>: IsTop, BoundedSetLattice<MemberId, 2>: IsTop,

impl<T, const N: usize> IsTop for BoundedSetLattice<T, N>

where T: Eq + Hash,