Trait IsTop

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

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

Required Methods§

Source

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§

Source§

impl IsTop for ()

Source§

fn is_top(&self) -> bool

Implementors§

Source§

impl IsTop for Max<bool>

Source§

impl IsTop for Max<char>

Source§

impl IsTop for Max<i8>

Source§

impl IsTop for Max<i16>

Source§

impl IsTop for Max<i32>

Source§

impl IsTop for Max<i64>

Source§

impl IsTop for Max<i128>

Source§

impl IsTop for Max<isize>

Source§

impl IsTop for Max<u8>

Source§

impl IsTop for Max<u16>

Source§

impl IsTop for Max<u32>

Source§

impl IsTop for Max<u64>

Source§

impl IsTop for Max<u128>

Source§

impl IsTop for Max<()>

Source§

impl IsTop for Max<usize>

Source§

impl IsTop for Min<bool>

Source§

impl IsTop for Min<char>

Source§

impl IsTop for Min<i8>

Source§

impl IsTop for Min<i16>

Source§

impl IsTop for Min<i32>

Source§

impl IsTop for Min<i64>

Source§

impl IsTop for Min<i128>

Source§

impl IsTop for Min<isize>

Source§

impl IsTop for Min<u8>

Source§

impl IsTop for Min<u16>

Source§

impl IsTop for Min<u32>

Source§

impl IsTop for Min<u64>

Source§

impl IsTop for Min<u128>

Source§

impl IsTop for Min<()>

Source§

impl IsTop for Min<usize>

Source§

impl<Head, Node> IsTop for GhtInner<Head, Node>
where Head: Clone, Node: GeneralizedHashTrieNode, Node::Storage: VariadicSet<Schema = Node::Schema>,

Source§

impl<Inner> IsTop for WithBot<Inner>
where Inner: IsTop,

Source§

impl<Inner> IsTop for WithTop<Inner>
where Inner: IsTop,

Source§

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

Source§

impl<Lat> IsTop for VecUnion<Lat>

Source§

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

Source§

impl<Map> IsTop for MapUnion<Map>

Source§

impl<Map> IsTop for UnionFind<Map>

Source§

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

Source§

impl<Schema, SuffixSchema, Storage> IsTop for GhtLeaf<Schema, SuffixSchema, Storage>
where Schema: Eq + Hash, SuffixSchema: Eq + Hash, Storage: VariadicSet<Schema = Schema>,

Source§

impl<Set> IsTop for SetUnion<Set>

Source§

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

Source§

impl<T> IsTop for Conflict<T>

Source§

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,