pub struct Ingest<R: GridRow> { /* private fields */ }Expand description
The single writer of the rows. Applies operations in order, diffs every replacement, writes change stamps and publishes snapshots.
Implementations§
Source§impl<R: GridRow> Ingest<R>
impl<R: GridRow> Ingest<R>
Sourcepub fn new(policy: HighlightPolicy, epoch: Instant) -> Self
pub fn new(policy: HighlightPolicy, epoch: Instant) -> Self
Creates an empty store whose stamps are measured from epoch.
Sourcepub fn with_reload_policy(
policy: HighlightPolicy,
epoch: Instant,
reload: Box<dyn ReloadPolicy<R>>,
) -> Self
pub fn with_reload_policy( policy: HighlightPolicy, epoch: Instant, reload: Box<dyn ReloadPolicy<R>>, ) -> Self
Creates an empty store with a custom ReloadPolicy.
Sourcepub fn apply(
&mut self,
ops: impl IntoIterator<Item = Op<R>>,
now: Instant,
) -> ChangeSet
pub fn apply( &mut self, ops: impl IntoIterator<Item = Op<R>>, now: Instant, ) -> ChangeSet
Applies ops in order at now and returns what changed. Then drops
the fading rows whose fade ended at now (ChangeSet::faded),
even when ops is empty.
Sourcepub fn sweep(&mut self, now: Instant)
pub fn sweep(&mut self, now: Instant)
Frees the stamps of rows whose highlight is over. Runs at most twice per highlight duration and costs O(hot rows). A row with some hot stamps keeps its expired ones until it is written again.
Sourcepub fn snapshot(&self) -> Arc<StoreSnapshot<R>>
pub fn snapshot(&self) -> Arc<StoreSnapshot<R>>
Publishes the current rows. Cheap: clones one Arc per page and per
pinned band.
Auto Trait Implementations§
impl<R> Freeze for Ingest<R>
impl<R> !RefUnwindSafe for Ingest<R>
impl<R> Send for Ingest<R>
impl<R> !Sync for Ingest<R>
impl<R> Unpin for Ingest<R>
impl<R> UnsafeUnpin for Ingest<R>
impl<R> !UnwindSafe for Ingest<R>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more