Struct LazyCache 

pub struct LazyCache<R>
where
    R: Read + Seek,
{ /* private fields */ }

Implementations

impl LazyCache<File>

pub fn open<P: AsRef<Path>>(path: P) -> Result<Self, Error>

impl<R> LazyCache<R>

where R: Read + Seek,

pub fn from_read_seek(rs: R) -> Result<Self, Error>

pub fn with_hot_cache(self, size: usize) -> Result<Self, Error>

pub fn with_warm_cache(self, warm_size: u64) -> Self

pub fn offset_from_start(&self, pos: SeekFrom) -> u64

pub fn lazy_stream_position(&self) -> u64

pub fn read_range(&mut self, range: Range<u64>) -> Result<&[u8], Error>

pub fn read_count(&mut self, count: u64) -> Result<&[u8], Error>

Read at current reader position and return byte slice

pub fn read_exact_range(&mut self, range: Range<u64>) -> Result<&[u8], Error>

pub fn read_exact_count(&mut self, count: u64) -> Result<&[u8], Error>

pub fn read_exact_into(&mut self, buf: &mut [u8]) -> Result<(), Error>

pub fn read_until_any_delim_or_limit( &mut self, delims: &[u8], limit: u64, ) -> Result<&[u8], Error>

pub fn read_until_or_limit( &mut self, byte: u8, limit: u64, ) -> Result<&[u8], Error>

pub fn read_while_or_limit<F>( &mut self, f: F, limit: u64, ) -> Result<&[u8], Error>

where F: Fn(u8) -> bool,

pub fn read_until_utf16_or_limit( &mut self, utf16_char: &[u8; 2], limit: u64, ) -> Result<&[u8], Error>

pub fn data_size(&self) -> u64

Returns the size of the whole data. If the LazyCache is used with a std::fs::File reader, this method will return the file size.

Trait Implementations

impl<R> Read for LazyCache<R>

where R: Read + Seek,

fn read(&mut self, buf: &mut [u8]) -> Result<usize>

Pull some bytes from this source into the specified buffer, returning how many bytes were read.

fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>

Like read, except that it reads into a slice of buffers.

fn is_read_vectored(&self) -> bool

🔬This is a nightly-only experimental API. (can_vector)

Determines if this Reader has an efficient read_vectored implementation.

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Reads all bytes until EOF in this source, placing them into buf.

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Reads all bytes until EOF in this source, appending them to buf.

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

Reads the exact number of bytes required to fill buf.

fn read_buf(&mut self, buf: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (read_buf)

Pull some bytes from this source into the specified buffer.

fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (read_buf)

Reads the exact number of bytes required to fill cursor.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Read.

fn bytes(self) -> Bytes<Self>

where Self: Sized,

Transforms this Read instance to an Iterator over its bytes.

fn chain<R>(self, next: R) -> Chain<Self, R>

where R: Read, Self: Sized,

Creates an adapter which will chain this stream with another.

fn take(self, limit: u64) -> Take<Self>

where Self: Sized,

Creates an adapter which will read at most limit bytes from it.

fn read_array<const N: usize>(&mut self) -> Result<[u8; N], Error>

where Self: Sized,

🔬This is a nightly-only experimental API. (read_array)

Read and return a fixed array of bytes from this source.

impl<R> Seek for LazyCache<R>

where R: Read + Seek,

fn seek(&mut self, pos: SeekFrom) -> Result<u64>

Seek to an offset, in bytes, in a stream.

fn rewind(&mut self) -> Result<(), Error>

Rewind to the beginning of a stream.

fn stream_len(&mut self) -> Result<u64, Error>

🔬This is a nightly-only experimental API. (seek_stream_len)

Returns the length of this stream (in bytes).

fn stream_position(&mut self) -> Result<u64, Error>

Returns the current seek position from the start of the stream.

fn seek_relative(&mut self, offset: i64) -> Result<(), Error>

Seeks relative to the current position.