Struct gf::support::lattice::HashLattice

pub struct HashLattice<K: Clone + Hash + Eq, V: Clone + Eq> { /* fields omitted */ }

Lattice backed by a hash map.

Normally, instead of using the new constructor, it will be more useful to call Bottom::bottom or Top::top to create a new hash lattice.

If V does not implement the lattice traits, this structure can still be used as a hash map with default.

Implementations

impl<K: Clone + Hash + Eq, V: Clone + Eq> HashLattice<K, V>

pub fn new(default_value: V) -> Self

Create an empty hash lattice with given default value.

pub fn with_capacity(default_value: V, capacity: usize) -> Self

Create an empty hash lattice with given default value and preallocated capacity.

pub fn default_value(&self) -> &V

Return default value of the hash lattice.

pub fn clear(&mut self)

Clear the lattice by replacing all values with the default value.

pub fn get(&self, key: &K) -> &V

Return element for given key.

pub fn take(&mut self, key: &K) -> V

Take element for given key leaving the default value in its place.

pub fn set(&mut self, key: K, value: V)

Set element for given key.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Return an iterator over keys with non-default values.

pub fn set_meet(&mut self, key: K, value: &V) -> bool where
    V: Meet, 

Set element for given key by applying the meet operation and return if this changed the state.

pub fn set_join(&mut self, key: K, value: &V) -> bool where
    V: Join, 

Set element for given key by applying the join operation and return if this changed the state.

Trait Implementations

impl<K: Clone + Hash + Eq, V: Clone + Eq + Bottom> Bottom for HashLattice<K, V>

fn bottom() -> Self

Return the bottom element, ⊥.

fn is_bottom(&self) -> bool

Test whether self is ⊥.

fn to_option(self) -> Option<Self>

Convert ⊥ to None and all other elements to Some.

fn reset_to_bottom(&mut self)

Reset self to ⊥.

impl<K: Clone + Hash + Eq, V: Clone + Eq> Clone for HashLattice<K, V>

fn clone(&self) -> HashLattice<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Clone + Hash + Eq, V: Debug + Clone + Eq> Debug for HashLattice<K, V>

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

Formats the value using the given formatter.

impl<K: Eq + Clone + Hash, V: Eq + Clone> Eq for HashLattice<K, V>

impl<K: Clone + Hash + Eq, V: Clone + Eq + Join> Join for HashLattice<K, V>

fn join(a: &Self, b: &Self) -> Self

Return a ⊔ b.

fn join_cmp(a: &Self, b: &Self) -> Option<Ordering>

Compare a and b using the induced partial order ⊑.

impl<K: Clone + Hash + Eq, V: Clone + Eq + Meet> Meet for HashLattice<K, V>

fn meet(a: &Self, b: &Self) -> Self

Return a ⊓ b.

fn meet_cmp(a: &Self, b: &Self) -> Option<Ordering>

Compare a and b using the induced partial order ⊑.

impl<K: PartialEq + Clone + Hash + Eq, V: PartialEq + Clone + Eq> PartialEq<HashLattice<K, V>> for HashLattice<K, V>

fn eq(&self, other: &HashLattice<K, V>) -> bool

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

fn ne(&self, other: &HashLattice<K, V>) -> bool

This method tests for !=.

impl<K: Clone + Hash + Eq, V: Clone + Eq> StructuralEq for HashLattice<K, V>

impl<K: Clone + Hash + Eq, V: Clone + Eq> StructuralPartialEq for HashLattice<K, V>

impl<K: Clone + Hash + Eq, V: Clone + Eq + Top> Top for HashLattice<K, V>

fn top() -> Self

Return the top element, ⊤.

fn is_top(&self) -> bool

Test whether self is ⊤.

fn reset_to_top(&mut self)

Reset self to ⊤.