pub struct Waitlist {
pub map_offset: DashMap<usize, Vec<CacheObject>>,
pub map_ref: DashMap<ObjectHash, Vec<CacheObject>>,
}Expand description
Waitlist for Delta objects while the Base object is not ready. Easier and faster than Channels.
Fields§
§map_offset: DashMap<usize, Vec<CacheObject>>§map_ref: DashMap<ObjectHash, Vec<CacheObject>>Implementations§
Source§impl Waitlist
impl Waitlist
Sourcepub fn insert_offset(&self, offset: usize, obj: CacheObject)
pub fn insert_offset(&self, offset: usize, obj: CacheObject)
Insert an object into the waitlist by its pack offset or object hash.
Sourcepub fn insert_ref(&self, hash: ObjectHash, obj: CacheObject)
pub fn insert_ref(&self, hash: ObjectHash, obj: CacheObject)
Insert an object into the waitlist by its object hash.
Sourcepub fn take(&self, offset: usize, hash: ObjectHash) -> Vec<CacheObject>
pub fn take(&self, offset: usize, hash: ObjectHash) -> Vec<CacheObject>
Take objects out (get & remove)
Return Vec::new() if None
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Waitlist
impl !RefUnwindSafe for Waitlist
impl Send for Waitlist
impl Sync for Waitlist
impl Unpin for Waitlist
impl UnsafeUnpin for Waitlist
impl UnwindSafe for Waitlist
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> 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> Pointable for T
impl<T> Pointable for T
Source§impl<T> ValueSize for T
impl<T> ValueSize for T
Source§fn value_size(&self) -> usize
fn value_size(&self) -> usize
The size of this value in bytes, excluding allocated data. Read more
Source§fn value_size_sum_iter<'item>(iterator: impl Iterator<Item = &'item T>) -> usizewhere
T: 'item,
fn value_size_sum_iter<'item>(iterator: impl Iterator<Item = &'item T>) -> usizewhere
T: 'item,
The total sum of the sizes of all values in the given iterator, in
bytes. This is default-implemented by computing ValueSize::value_size
on every element and summing them. For Sized types, a more potentially
efficient implementation using Iterator::count is provided. If you are
implementing this trait manually, it is unlikely to be more efficient to
provide a manual implementation here. Read more
Source§fn value_size_sum_exact_size_iter<'item>(
iterator: impl ExactSizeIterator<Item = &'item T>,
) -> usizewhere
T: 'item,
fn value_size_sum_exact_size_iter<'item>(
iterator: impl ExactSizeIterator<Item = &'item T>,
) -> usizewhere
T: 'item,
The total sum of the sizes of all values in the given
exact-size-iterator, in bytes. This is default-implemented by using
ValueSize::value_size_sum_iter. For Sized types, a usually more
efficient implementation using ExactSizeIterator::len is provided. If
you are implementing this trait manually, it is unlikely to be more
efficient to provide a manual implementation here. Read more