Struct coord::coord::arrangement_state::ArrangementFrontiers

pub struct ArrangementFrontiers<T: Timestamp> {
    index: HashMap<GlobalId, Frontiers<T>>,
}

A map from global identifiers to arrangement frontier state.

Fields

index: HashMap<GlobalId, Frontiers<T>>

Implementations

impl<T: Timestamp> ArrangementFrontiers<T>

pub fn get(&self, id: &GlobalId) -> Option<&Frontiers<T>>

pub fn get_mut(&mut self, id: &GlobalId) -> Option<&mut Frontiers<T>>

pub fn contains_key(&self, id: GlobalId) -> bool

pub fn intersection(
    &self,
    ids: impl IntoIterator<Item = GlobalId>
) -> Vec<GlobalId>

pub fn insert(
    &mut self,
    id: GlobalId,
    state: Frontiers<T>
) -> Option<Frontiers<T>>

pub fn remove(&mut self, id: &GlobalId) -> Option<Frontiers<T>>

pub fn upper_of(&self, name: &GlobalId) -> Option<AntichainRef<'_, T>>

The upper frontier of a maintained index, if it exists.

pub fn since_of(&self, name: &GlobalId) -> Option<Antichain<T>>

The since frontier of a maintained index, if it exists.

pub fn greatest_open_upper<I>(&self, identifiers: I) -> Antichain<T> where
    I: IntoIterator<Item = GlobalId>,
    T: Lattice, 

Reports the greatest frontier less than all identified upper frontiers.

pub fn least_valid_since<I>(&self, identifiers: I) -> Antichain<T> where
    I: IntoIterator<Item = GlobalId>,
    T: Lattice, 

Reports the minimal frontier greater than all identified since frontiers.

Trait Implementations

impl<T: Timestamp> Default for ArrangementFrontiers<T>

fn default() -> Self

Returns the “default value” for a type.