Struct building_blocks::prelude::CompressibleChunkStorageReader [−][src]
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
impl<'a, N, Compr> ChunkReadStorage<N, <Compr as Compression>::Data> for CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
impl<'a, N, Compr> ChunkReadStorage<N, <Compr as Compression>::Data> for CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
impl<'a, N, Compr> IntoIterator for &'a CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
impl<'a, N, Compr> IntoIterator for &'a CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
type IntoIter = CompressibleChunkStorageReaderIntoIter<'a, N, Compr>
type IntoIter = CompressibleChunkStorageReaderIntoIter<'a, N, Compr>
Which kind of iterator are we turning this into?
The type of the elements being iterated over.
pub fn into_iter(
self
) -> <&'a CompressibleChunkStorageReader<'a, N, Compr> as IntoIterator>::IntoIter
pub fn into_iter(
self
) -> <&'a CompressibleChunkStorageReader<'a, N, Compr> as IntoIterator>::IntoIter
Creates an iterator from a value. Read more
impl<'a, N, Compr> IterChunkKeys<'a, N> for CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
impl<'a, N, Compr> IterChunkKeys<'a, N> for CompressibleChunkStorageReader<'a, N, Compr> where
Compr: Compression,
ChunkKey<N>: Clone,
ChunkKey<N>: Eq,
ChunkKey<N>: Hash,
type Iter = Keys<'a, ChunkKey<N>, CacheEntry<(<Compr as Compression>::Data, usize), CompressedLocation>>
pub fn chunk_keys(
&'a self
) -> <CompressibleChunkStorageReader<'a, N, Compr> as IterChunkKeys<'a, N>>::Iter
Auto Trait Implementations
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
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: 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. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more
Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.