pub struct SkipListLayer<K, V> { /* private fields */ }
Implementations§
Source§impl<K, V> SkipListLayer<K, V>
impl<K, V> SkipListLayer<K, V>
Source§impl<K: Eq + Key + OrdLowerBound, V: LayerValue> SkipListLayer<K, V>
impl<K: Eq + Key + OrdLowerBound, V: LayerValue> SkipListLayer<K, V>
Trait Implementations§
Source§impl<K, V> Drop for SkipListLayer<K, V>
impl<K, V> Drop for SkipListLayer<K, V>
Source§impl<K: Key, V: LayerValue> Layer<K, V> for SkipListLayer<K, V>
impl<K: Key, V: LayerValue> Layer<K, V> for SkipListLayer<K, V>
Source§fn seek<'a, 'life0, 'async_trait>(
&'a self,
bound: Bound<&'life0 K>,
) -> Pin<Box<dyn Future<Output = Result<BoxedLayerIterator<'a, K, V>, Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'a: 'async_trait,
'life0: 'async_trait,
fn seek<'a, 'life0, 'async_trait>(
&'a self,
bound: Bound<&'life0 K>,
) -> Pin<Box<dyn Future<Output = Result<BoxedLayerIterator<'a, K, V>, Error>> + Send + 'async_trait>>where
Self: 'async_trait,
'a: 'async_trait,
'life0: 'async_trait,
Searches for a key. Bound::Excluded is not supported. Bound::Unbounded positions the
iterator on the first item in the layer.
Source§fn lock(&self) -> Option<Arc<DropEvent>>
fn lock(&self) -> Option<Arc<DropEvent>>
Locks the layer preventing it from being closed. This will never block i.e. there can be
many locks concurrently. The lock is purely advisory: seek will still work even if lock has
not been called; it merely causes close to wait until all locks are released. Returns None
if close has been called for the layer.
Source§fn estimated_len(&self) -> ItemCount
fn estimated_len(&self) -> ItemCount
Returns the number of items in the layer file, or an estimate if not known.
Old persistent layer formats did not keep track of how many entries they have, hence the
estimate. If this is wrong, bloom filter sizing might be off, but that won’t affect
correctness, and will wash out with future compactions anyways.
Source§fn close<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn close<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Waits for existing locks readers to finish and then returns. Subsequent calls to lock will
return None.
Source§fn get_version(&self) -> Version
fn get_version(&self) -> Version
Returns the version number used by structs in this layer
Source§fn record_inspect_data(self: Arc<Self>, node: &Node)
fn record_inspect_data(self: Arc<Self>, node: &Node)
Records inspect data for the layer into
node
. Called lazily when inspect is queried.Source§fn handle(&self) -> Option<&dyn ReadObjectHandle>
fn handle(&self) -> Option<&dyn ReadObjectHandle>
If the layer is persistent, returns the handle to its contents. Returns None for in-memory
layers.
Source§fn purge_cached_data(&self)
fn purge_cached_data(&self)
Some layer implementations may choose to cache data in-memory. Calling this function will
request that the layer purges unused cached data. This is intended to run on a timer.
Source§fn maybe_contains_key(&self, _key: &K) -> bool
fn maybe_contains_key(&self, _key: &K) -> bool
Returns whether the layer might contain records relevant to
key
. Note that this can
return true even if the layer has no records relevant to key
, but it will never return
false if there are such records. (As such, always returning true is a trivially correct
implementation.)Auto Trait Implementations§
impl<K, V> !Freeze for SkipListLayer<K, V>
impl<K, V> !RefUnwindSafe for SkipListLayer<K, V>
impl<K, V> Send for SkipListLayer<K, V>
impl<K, V> Sync for SkipListLayer<K, V>
impl<K, V> Unpin for SkipListLayer<K, V>
impl<K, V> UnwindSafe for SkipListLayer<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
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
Source§impl<T, D> Encode<Ambiguous1, D> for Twhere
D: ResourceDialect,
impl<T, D> Encode<Ambiguous1, D> for Twhere
D: ResourceDialect,
Source§impl<T, D> Encode<Ambiguous2, D> for Twhere
D: ResourceDialect,
impl<T, D> Encode<Ambiguous2, D> for Twhere
D: ResourceDialect,
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