pub struct CompressibleChunkStorageReader<'a, N, Compr>where
Compr: Compression,{
pub storage: &'a CompressibleChunkStorage<N, Compr>,
pub local_cache: &'a LocalCache<ChunkKey<N>, <Compr as Compression>::Data, RandomState>,
}Expand description
An object for reading from CompressibleChunkStorage with only &self. Easily construct one of these using the
CompressibleChunkStorage::reader method.
This works by using a LocalChunkCache for storing decompressed Chunks from cache misses.
Fields§
§storage: &'a CompressibleChunkStorage<N, Compr>§local_cache: &'a LocalCache<ChunkKey<N>, <Compr as Compression>::Data, RandomState>Trait Implementations§
Source§impl<'a, N, Compr> ChunkReadStorage<N, <Compr as Compression>::Data> for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> ChunkReadStorage<N, <Compr as Compression>::Data> for CompressibleChunkStorageReader<'a, N, Compr>
Source§impl<'a, N, Compr> IntoIterator for &'a CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> IntoIterator for &'a CompressibleChunkStorageReader<'a, N, Compr>
Source§type IntoIter = CompressibleChunkStorageReaderIntoIter<'a, N, Compr>
type IntoIter = CompressibleChunkStorageReaderIntoIter<'a, N, Compr>
Which kind of iterator are we turning this into?
Source§type Item = (&'a ChunkKey<N>, &'a <Compr as Compression>::Data)
type Item = (&'a ChunkKey<N>, &'a <Compr as Compression>::Data)
The type of the elements being iterated over.
Source§fn into_iter(
self,
) -> <&'a CompressibleChunkStorageReader<'a, N, Compr> as IntoIterator>::IntoIter
fn into_iter( self, ) -> <&'a CompressibleChunkStorageReader<'a, N, Compr> as IntoIterator>::IntoIter
Creates an iterator from a value. Read more
Source§impl<'a, N, Compr> IterChunkKeys<'a, N> for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> IterChunkKeys<'a, N> for CompressibleChunkStorageReader<'a, N, Compr>
type Iter = Keys<'a, ChunkKey<N>, CacheEntry<(<Compr as Compression>::Data, usize), CompressedLocation>>
fn chunk_keys( &'a self, ) -> <CompressibleChunkStorageReader<'a, N, Compr> as IterChunkKeys<'a, N>>::Iter
Auto Trait Implementations§
impl<'a, N, Compr> Freeze for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> !RefUnwindSafe for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> !Send for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> !Sync for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> Unpin for CompressibleChunkStorageReader<'a, N, Compr>
impl<'a, N, Compr> !UnwindSafe for CompressibleChunkStorageReader<'a, N, Compr>
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> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§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.Source§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.Source§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.Source§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.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.