Struct mz_adapter::ReadHoldsInner

pub struct ReadHoldsInner<T> {
    pub storage_holds: HashMap<GlobalId, MutableAntichain<T>>,
    pub compute_holds: HashMap<(ComputeInstanceId, GlobalId), MutableAntichain<T>>,
}

Inner state of ReadHolds. We have this separate so that we can send the inner state along a channel, for releasing when dropped.

Fields

storage_holds: HashMap<GlobalId, MutableAntichain<T>>

compute_holds: HashMap<(ComputeInstanceId, GlobalId), MutableAntichain<T>>

Implementations

impl<T: Eq + Hash + Ord> ReadHoldsInner<T>

pub fn new() -> Self

Return empty ReadHolds.

pub fn id_bundle(&self) -> CollectionIdBundle

Return a CollectionIdBundle containing all the IDs in the ReadHoldsInner.

impl<T: TimelyTimestamp + Lattice> ReadHoldsInner<T>

pub fn least_valid_read(&self) -> Antichain<T>

pub fn since(&self, desired_id: &GlobalId) -> Antichain<T>

Returns the frontier at which this ReadHoldsInner is holding back the since of the collection identified by id. This does not mean that the overall since of the collection is what we report here. Only that it is at least held back to the reported frontier by this read hold.

This method is not meant to be fast, use wisely!

pub fn merge(&mut self, other: Self)

Trait Implementations

impl<T: Debug> Debug for ReadHoldsInner<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Ord> Default for ReadHoldsInner<T>

fn default() -> Self

Returns the “default value” for a type.