pub struct BlockCacheReader<R> { /* private fields */ }Implementations§
Source§impl<R> BlockCacheReader<R>where
R: RangeReader,
impl<R> BlockCacheReader<R>where
R: RangeReader,
Sourcepub fn new(inner: R, block: u64) -> BlockCacheReader<R>
pub fn new(inner: R, block: u64) -> BlockCacheReader<R>
Wrap inner, fetching block-aligned blocks (clamped to ≥ 4 KiB) and
keeping at most DEFAULT_CACHE_CAP bytes of them resident.
Sourcepub fn with_cache_cap(self, cap: u64) -> BlockCacheReader<R>
pub fn with_cache_cap(self, cap: u64) -> BlockCacheReader<R>
Override the resident-byte cap. The cap is enforced between reads: a
single read spanning more than cap bytes of blocks is still served
exactly (its blocks are resident while it assembles) and the cache is
trimmed back under the cap right after. u64::MAX disables eviction.
Sourcepub fn cached_bytes(&self) -> u64
pub fn cached_bytes(&self) -> u64
Bytes currently resident in the cache (for stats and tests).
Trait Implementations§
Source§impl<R> RangeReader for BlockCacheReader<R>where
R: RangeReader,
impl<R> RangeReader for BlockCacheReader<R>where
R: RangeReader,
Source§fn read_many_scattered(
&self,
ranges: &[(u64, u64)],
) -> Result<Vec<Vec<u8>>, Error>
fn read_many_scattered( &self, ranges: &[(u64, u64)], ) -> Result<Vec<Vec<u8>>, Error>
Ranges the caller knows lie far apart: those the cache holds are served from it; the rest go to the inner reader as they are, not rounded out to blocks (a 19 KB tile would cost its 128 KiB block, or two) and not cached here, since a scattered tile is not near the next one wanted.
Source§fn is_local(&self) -> bool
fn is_local(&self) -> bool
Is a read cheap and local: bytes already in memory, or a local file?
False (the default) for anything where a read is a round trip. Purely
advisory: an engine may then read from several threads at once, each in
small pieces, where over a network it keeps one scan and batches its
reads. A wrapper reports what it wraps.
Source§fn concurrency(&self) -> usize
fn concurrency(&self) -> usize
How many ranges this reader can usefully have in flight at once — the
planner’s hint for probe-vs-scan and batch-size decisions (a phone’s
serial sync-XHR reader reports 1; the CLI’s threaded HTTP client and the
browser’s concurrent-fetch variants report their fan-out). Purely
advisory: correctness never depends on it. Defaults to 1 (sequential).
Source§fn resident_prefix(&self) -> u64
fn resident_prefix(&self) -> u64
How many leading bytes this reader already holds in memory: a read that
lies wholly inside
[0, resident_prefix()) costs no round trip. An HTTP
reader that learnt the length from a ranged GET of the first 128 KiB
reports those 128 KiB. A caching layer above it serves such a read
straight through instead of fetching a block-aligned span that would
re-read what is already here (the open’s first read used to cost a
second, larger request for block 0). Purely advisory; defaults to 0.Source§fn read_at(&self, offset: u64, len: u64) -> Result<Vec<u8>, Error>
fn read_at(&self, offset: u64, len: u64) -> Result<Vec<u8>, Error>
Read
len bytes starting at offset. Implementations should error on
an out-of-bounds range rather than truncating.Source§fn read_many(&self, ranges: &[(u64, u64)]) -> Result<Vec<Vec<u8>>, Error>
fn read_many(&self, ranges: &[(u64, u64)]) -> Result<Vec<Vec<u8>>, Error>
Read several
(offset, len) ranges, returning each range’s bytes in
request order. These ranges are independent, so a reader whose backing
store is high-latency but parallelizable (an HTTP client) overrides this
to issue the reads concurrently — turning N round trips into ~N/P. The
default fetches them sequentially. Any range failing fails the batch.Auto Trait Implementations§
impl<R> !Freeze for BlockCacheReader<R>
impl<R> Forget for BlockCacheReader<R>
impl<R> Move for BlockCacheReader<R>
impl<R> RefUnwindSafe for BlockCacheReader<R>where
R: RefUnwindSafe,
impl<R> Send for BlockCacheReader<R>where
R: Send,
impl<R> Sync for BlockCacheReader<R>where
R: Sync,
impl<R> Unpin for BlockCacheReader<R>where
R: Unpin,
impl<R> UnsafeUnpin for BlockCacheReader<R>where
R: UnsafeUnpin,
impl<R> UnwindSafe for BlockCacheReader<R>where
R: UnwindSafe,
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