Struct RandomAccessMemory 

pub struct RandomAccessMemory { /* private fields */ }

In-memory storage for random access

Implementations

impl RandomAccessMemory

pub fn new(page_size: usize) -> Self

Create a new instance with page_size in bytes.

pub fn with_buffers(page_size: usize, buffers: IntMap<Vec<u8>>) -> Self

Create a new instance with page_size in bytes, but pass the initial buffers to the constructor.

Trait Implementations

impl Clone for RandomAccessMemory

fn clone(&self) -> RandomAccessMemory

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RandomAccessMemory

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RandomAccessMemory

fn default() -> Self

Create a new instance with a 1mb page size.

impl RandomAccess for RandomAccessMemory

fn write( &self, offset: u64, data: &[u8], ) -> BoxFuture<Result<(), RandomAccessError>>

Write bytes of data at an offset to the backend.

fn read( &self, offset: u64, length: u64, ) -> BoxFuture<Result<Vec<u8>, RandomAccessError>>

Read a sequence of bytes at an offset from the backend.

fn del( &self, offset: u64, length: u64, ) -> BoxFuture<Result<(), RandomAccessError>>

Delete a sequence of bytes of given length at an offset from the backend. This either sets the bytes in the given slice to zeroes, or if offset + length >= RandomAccess::len() is the same as truncate(offset).

fn truncate(&self, length: u64) -> BoxFuture<Result<(), RandomAccessError>>

Resize the sequence of bytes so that RandomAccess::len() is set to length. If length < RandomAccess::len(), the bytes are disregarded. If length > RandomAccess::len(), the storage is zero-padded.

fn len(&self) -> u64

Get the size of the storage in bytes.

fn is_empty(&self) -> bool

Whether the storage is empty.

fn sync_all( &self, ) -> Pin<Box<dyn Future<Output = Result<(), RandomAccessError>> + Send>>

Flush buffered data on the underlying storage resource.