pub struct VerifyStateStore<A, E, T = ()> {
pub actual: A,
pub expected: Option<E>,
pub _phantom: PhantomData<T>,
}
Fields§
§actual: A
§expected: Option<E>
§_phantom: PhantomData<T>
Trait Implementations§
source§impl<A: AsHummock, E> AsHummock for VerifyStateStore<A, E>
impl<A: AsHummock, E> AsHummock for VerifyStateStore<A, E>
fn as_hummock(&self) -> Option<&HummockStorage>
source§impl<A, E> Deref for VerifyStateStore<A, E>
impl<A, E> Deref for VerifyStateStore<A, E>
source§impl<A: LocalStateStore, E: LocalStateStore> LocalStateStore for VerifyStateStore<A, E>
impl<A: LocalStateStore, E: LocalStateStore> LocalStateStore for VerifyStateStore<A, E>
type Iter<'a> = impl StateStoreIter + 'a
type RevIter<'a> = impl StateStoreIter + 'a
source§async fn get(
&self,
key: TableKey<Bytes>,
read_options: ReadOptions,
) -> StorageResult<Option<Bytes>>
async fn get( &self, key: TableKey<Bytes>, read_options: ReadOptions, ) -> StorageResult<Option<Bytes>>
Point gets a value from the state store.
The result is based on the latest written snapshot.
source§fn iter(
&self,
key_range: TableKeyRange,
read_options: ReadOptions,
) -> impl Future<Output = StorageResult<Self::Iter<'_>>> + Send + '_
fn iter( &self, key_range: TableKeyRange, read_options: ReadOptions, ) -> impl Future<Output = StorageResult<Self::Iter<'_>>> + Send + '_
Opens and returns an iterator for given
prefix_hint
and full_key_range
Internally, prefix_hint
will be used to for checking bloom_filter
and
full_key_range
used for iter. (if the prefix_hint
not None, it should be be included
in key_range
) The returned iterator will iterate data based on the latest written
snapshot.fn rev_iter( &self, key_range: TableKeyRange, read_options: ReadOptions, ) -> impl Future<Output = StorageResult<Self::RevIter<'_>>> + Send + '_
source§fn insert(
&mut self,
key: TableKey<Bytes>,
new_val: Bytes,
old_val: Option<Bytes>,
) -> StorageResult<()>
fn insert( &mut self, key: TableKey<Bytes>, new_val: Bytes, old_val: Option<Bytes>, ) -> StorageResult<()>
Inserts a key-value entry associated with a given
epoch
into the state store.source§fn delete(&mut self, key: TableKey<Bytes>, old_val: Bytes) -> StorageResult<()>
fn delete(&mut self, key: TableKey<Bytes>, old_val: Bytes) -> StorageResult<()>
Deletes a key-value entry from the state store. Only the key-value entry with epoch smaller
than the given
epoch
will be deleted.async fn flush(&mut self) -> StorageResult<usize>
async fn try_flush(&mut self) -> StorageResult<()>
source§async fn init(&mut self, options: InitOptions) -> StorageResult<()>
async fn init(&mut self, options: InitOptions) -> StorageResult<()>
Initializes the state store with given
epoch
pair.
Typically we will use epoch.curr
as the initialized epoch,
Since state table will begin as empty.
In some cases like replicated state table, state table may not be empty initially,
as such we need to wait for epoch.prev
checkpoint to complete,
hence this interface is made async.source§fn seal_current_epoch(&mut self, next_epoch: u64, opts: SealCurrentEpochOptions)
fn seal_current_epoch(&mut self, next_epoch: u64, opts: SealCurrentEpochOptions)
Updates the monotonically increasing write epoch to
new_epoch
.
All writes after this function is called will be tagged with new_epoch
. In other words,
the previous write epoch is sealed.fn epoch(&self) -> u64
fn is_dirty(&self) -> bool
fn update_vnode_bitmap(&mut self, vnodes: Arc<Bitmap>) -> Arc<Bitmap>
source§fn get_table_watermark(&self, vnode: VirtualNode) -> Option<Bytes>
fn get_table_watermark(&self, vnode: VirtualNode) -> Option<Bytes>
Get last persisted watermark for a given vnode.
source§impl<A: StateStore, E: StateStore> StateStore for VerifyStateStore<A, E>
impl<A: StateStore, E: StateStore> StateStore for VerifyStateStore<A, E>
type Local = VerifyStateStore<<A as StateStore>::Local, <E as StateStore>::Local>
source§fn try_wait_epoch(
&self,
epoch: HummockReadEpoch,
options: TryWaitEpochOptions,
) -> impl Future<Output = StorageResult<()>> + Send + '_
fn try_wait_epoch( &self, epoch: HummockReadEpoch, options: TryWaitEpochOptions, ) -> impl Future<Output = StorageResult<()>> + Send + '_
If epoch is
Committed
, we will wait until the epoch is committed and its data is ready to
read. If epoch is Current
, we will only check if the data can be read with this epoch.async fn new_local(&self, option: NewLocalOptions) -> Self::Local
source§fn monitored(
self,
storage_metrics: Arc<MonitoredStorageMetrics>,
) -> MonitoredStateStore<Self>
fn monitored( self, storage_metrics: Arc<MonitoredStorageMetrics>, ) -> MonitoredStateStore<Self>
Creates a
MonitoredStateStore
from this state store, with given stats
.source§impl<A: StateStoreIter<T>, E: StateStoreIter<T>, T: IterItem> StateStoreIter<T> for VerifyStateStore<A, E, T>
impl<A: StateStoreIter<T>, E: StateStoreIter<T>, T: IterItem> StateStoreIter<T> for VerifyStateStore<A, E, T>
source§impl<A: StateStoreRead, E: StateStoreRead> StateStoreRead for VerifyStateStore<A, E>
impl<A: StateStoreRead, E: StateStoreRead> StateStoreRead for VerifyStateStore<A, E>
type ChangeLogIter = impl StateStoreReadChangeLogIter
type Iter = impl StateStoreReadIter
type RevIter = impl StateStoreReadIter
source§async fn get_keyed_row(
&self,
key: TableKey<Bytes>,
epoch: u64,
read_options: ReadOptions,
) -> StorageResult<Option<StateStoreKeyedRow>>
async fn get_keyed_row( &self, key: TableKey<Bytes>, epoch: u64, read_options: ReadOptions, ) -> StorageResult<Option<StateStoreKeyedRow>>
Point gets a value from the state store.
The result is based on a snapshot corresponding to the given
epoch
.
Both full key and the value are returned.source§fn iter(
&self,
key_range: TableKeyRange,
epoch: u64,
read_options: ReadOptions,
) -> impl Future<Output = StorageResult<Self::Iter>> + '_
fn iter( &self, key_range: TableKeyRange, epoch: u64, read_options: ReadOptions, ) -> impl Future<Output = StorageResult<Self::Iter>> + '_
Opens and returns an iterator for given
prefix_hint
and full_key_range
Internally, prefix_hint
will be used to for checking bloom_filter
and
full_key_range
used for iter. (if the prefix_hint
not None, it should be be included
in key_range
) The returned iterator will iterate data based on a snapshot
corresponding to the given epoch
.fn rev_iter( &self, key_range: TableKeyRange, epoch: u64, read_options: ReadOptions, ) -> impl Future<Output = StorageResult<Self::RevIter>> + '_
async fn iter_log( &self, epoch_range: (u64, u64), key_range: TableKeyRange, options: ReadLogOptions, ) -> StorageResult<Self::ChangeLogIter>
source§fn get(
&self,
key: TableKey<Bytes>,
epoch: u64,
read_options: ReadOptions,
) -> impl Future<Output = StorageResult<Option<Bytes>>> + Send + '_
fn get( &self, key: TableKey<Bytes>, epoch: u64, read_options: ReadOptions, ) -> impl Future<Output = StorageResult<Option<Bytes>>> + Send + '_
Point gets a value from the state store.
The result is based on a snapshot corresponding to the given
epoch
.
Only the value is returned.source§impl<A: StateStoreWrite, E: StateStoreWrite> StateStoreWrite for VerifyStateStore<A, E>
impl<A: StateStoreWrite, E: StateStoreWrite> StateStoreWrite for VerifyStateStore<A, E>
source§fn ingest_batch(
&self,
kv_pairs: Vec<(TableKey<Bytes>, StorageValue)>,
delete_ranges: Vec<(Bound<Bytes>, Bound<Bytes>)>,
write_options: WriteOptions,
) -> StorageResult<usize>
fn ingest_batch( &self, kv_pairs: Vec<(TableKey<Bytes>, StorageValue)>, delete_ranges: Vec<(Bound<Bytes>, Bound<Bytes>)>, write_options: WriteOptions, ) -> StorageResult<usize>
Writes a batch to storage. The batch should be: Read more
Auto Trait Implementations§
impl<A, E, T> Freeze for VerifyStateStore<A, E, T>
impl<A, E, T> RefUnwindSafe for VerifyStateStore<A, E, T>
impl<A, E, T> Send for VerifyStateStore<A, E, T>
impl<A, E, T> Sync for VerifyStateStore<A, E, T>
impl<A, E, T> Unpin for VerifyStateStore<A, E, T>
impl<A, E, T> UnwindSafe for VerifyStateStore<A, E, T>
Blanket Implementations§
§impl<T, A, P> Access<T> for P
impl<T, A, P> Access<T> for P
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§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> DowncastSync for T
impl<T> DowncastSync for T
§impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
source§impl<S> DynamicDispatchedLocalStateStore for Swhere
S: LocalStateStore,
impl<S> DynamicDispatchedLocalStateStore for Swhere
S: LocalStateStore,
fn get<'life0, 'async_trait>(
&'life0 self,
key: TableKey<Bytes>,
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Option<Bytes>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn iter<'life0, 'async_trait>(
&'life0 self,
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Box<dyn DynamicDispatchedStateStoreIter<(FullKey<Bytes>, Bytes)> + 'life0>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn rev_iter<'life0, 'async_trait>(
&'life0 self,
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Box<dyn DynamicDispatchedStateStoreIter<(FullKey<Bytes>, Bytes)> + 'life0>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn insert( &mut self, key: TableKey<Bytes>, new_val: Bytes, old_val: Option<Bytes>, ) -> Result<(), StorageError>
fn delete( &mut self, key: TableKey<Bytes>, old_val: Bytes, ) -> Result<(), StorageError>
fn flush<'life0, 'async_trait>(
&'life0 mut self,
) -> Pin<Box<dyn Future<Output = Result<usize, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn try_flush<'life0, 'async_trait>(
&'life0 mut self,
) -> Pin<Box<dyn Future<Output = Result<(), StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn epoch(&self) -> u64
fn is_dirty(&self) -> bool
fn init<'life0, 'async_trait>(
&'life0 mut self,
options: InitOptions,
) -> Pin<Box<dyn Future<Output = Result<(), StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn seal_current_epoch(&mut self, next_epoch: u64, opts: SealCurrentEpochOptions)
fn update_vnode_bitmap(&mut self, vnodes: Arc<Bitmap>) -> Arc<Bitmap>
fn get_table_watermark(&self, vnode: VirtualNode) -> Option<Bytes>
source§impl<S> DynamicDispatchedStateStoreExt for Swhere
S: StateStore,
impl<S> DynamicDispatchedStateStoreExt for Swhere
S: StateStore,
fn try_wait_epoch<'life0, 'async_trait>(
&'life0 self,
epoch: HummockReadEpoch,
options: TryWaitEpochOptions,
) -> Pin<Box<dyn Future<Output = Result<(), StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn new_local<'life0, 'async_trait>(
&'life0 self,
option: NewLocalOptions,
) -> Pin<Box<dyn Future<Output = Box<dyn DynamicDispatchedLocalStateStore>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
source§impl<T, I> DynamicDispatchedStateStoreIter<T> for Iwhere
T: IterItem,
I: StateStoreIter<T>,
impl<T, I> DynamicDispatchedStateStoreIter<T> for Iwhere
T: IterItem,
I: StateStoreIter<T>,
source§impl<S> DynamicDispatchedStateStoreRead for Swhere
S: StateStoreRead,
impl<S> DynamicDispatchedStateStoreRead for Swhere
S: StateStoreRead,
fn get_keyed_row<'life0, 'async_trait>(
&'life0 self,
key: TableKey<Bytes>,
epoch: u64,
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Option<(FullKey<Bytes>, Bytes)>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn iter<'life0, 'async_trait>(
&'life0 self,
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
epoch: u64,
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Box<dyn DynamicDispatchedStateStoreIter<(FullKey<Bytes>, Bytes)>>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn rev_iter<'life0, 'async_trait>(
&'life0 self,
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
epoch: u64,
read_options: ReadOptions,
) -> Pin<Box<dyn Future<Output = Result<Box<dyn DynamicDispatchedStateStoreIter<(FullKey<Bytes>, Bytes)>>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
fn iter_log<'life0, 'async_trait>(
&'life0 self,
epoch_range: (u64, u64),
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
options: ReadLogOptions,
) -> Pin<Box<dyn Future<Output = Result<Box<dyn DynamicDispatchedStateStoreIter<(TableKey<Bytes>, ChangeLogValue<Bytes>)>>, StorageError>> + Send + 'async_trait>>where
'life0: 'async_trait,
S: 'async_trait,
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
§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> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§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 moresource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T
in a tonic::Request
§impl<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
type Err = Infallible
fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>
Creates a shared type from an unshared type.
source§impl<M> MetricVecRelabelExt for M
impl<M> MetricVecRelabelExt for M
source§fn relabel(
self,
metric_level: MetricLevel,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel( self, metric_level: MetricLevel, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level
.source§fn relabel_n(
self,
metric_level: MetricLevel,
relabel_threshold: MetricLevel,
relabel_num: usize,
) -> RelabeledMetricVec<M>
fn relabel_n( self, metric_level: MetricLevel, relabel_threshold: MetricLevel, relabel_num: usize, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level_relabel_n
.source§fn relabel_debug_1(
self,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel_debug_1( self, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level_relabel_n
with metric_level
set to
MetricLevel::Debug
and relabel_num
set to 1.§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T, I> StateStoreIterExt<T> for Iwhere
T: IterItem,
I: StateStoreIter<T>,
impl<T, I> StateStoreIterExt<T> for Iwhere
T: IterItem,
I: StateStoreIter<T>,
type ItemStream<O: Send, F: Send + for<'a> Fn(<T as IterItem>::ItemRef<'a>) -> Result<O, StorageError>> = impl Stream<Item = Result<O, StorageError>> + Send
fn into_stream<O, F>( self, f: F, ) -> <I as StateStoreIterExt<T>>::ItemStream<O, F>
fn fused(self) -> FusedStateStoreIter<Self, T>
source§impl<S> StateStoreReadExt for Swhere
S: StateStoreRead,
impl<S> StateStoreReadExt for Swhere
S: StateStoreRead,
source§async fn scan(
&self,
key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>),
epoch: u64,
limit: Option<usize>,
read_options: ReadOptions,
) -> Result<Vec<(FullKey<Bytes>, Bytes)>, StorageError>
async fn scan( &self, key_range: (Bound<TableKey<Bytes>>, Bound<TableKey<Bytes>>), epoch: u64, limit: Option<usize>, read_options: ReadOptions, ) -> Result<Vec<(FullKey<Bytes>, Bytes)>, StorageError>
Scans
limit
number of keys from a key range. If limit
is None
, scans all elements.
Internally, prefix_hint
will be used to for checking bloom_filter
and
full_key_range
used for iter.
The result is based on a snapshot corresponding to the given epoch
. Read more