Struct SyncStoreAsAsync 

pub struct SyncStoreAsAsync<S> { /* private fields */ }

Adapter that exposes an existing synchronous Store as an AsyncStore.

This adapter calls the synchronous store directly and does not spawn blocking work. Runtime-specific spawn_blocking adapters can be layered on top by applications that need them.

Arbitrary futures cannot opt into the internal ready-only contract:

use prolly::{MemStore, SyncStoreAsAsync};

let adapter = SyncStoreAsAsync::new(MemStore::new());
adapter.ready(std::future::pending::<()>());

Implementations

impl<S> SyncStoreAsAsync<S>

pub fn new(inner: S) -> Self

Create a new adapter.

pub fn inner(&self) -> &S

Borrow the wrapped store.

pub fn into_inner(self) -> S

Consume the adapter and return the wrapped store.

Trait Implementations

impl<S: ManifestStore> AsyncManifestStore for SyncStoreAsAsync<S>

type Error = <S as ManifestStore>::Error

Error type for manifest operations.

async fn get_root( &self, name: &[u8], ) -> Result<Option<RootManifest>, Self::Error>

Load a named root manifest.

async fn put_root( &self, name: &[u8], manifest: &RootManifest, ) -> Result<(), Self::Error>

Unconditionally insert or replace a named root manifest.

async fn delete_root(&self, name: &[u8]) -> Result<(), Self::Error>

Delete a named root manifest. Deleting a missing name is not an error.

async fn compare_and_swap_root( &self, name: &[u8], expected: Option<&RootManifest>, new: Option<&RootManifest>, ) -> Result<ManifestUpdate, Self::Error>

Atomically update a named root if the current manifest matches expected.

impl<S: ManifestStoreScan> AsyncManifestStoreScan for SyncStoreAsAsync<S>

async fn list_roots(&self) -> Result<Vec<NamedRootManifest>, Self::Error>

List all durable named root manifests.

impl<S: Store> AsyncStore for SyncStoreAsAsync<S>

type Error = <S as Store>::Error

Error type for storage operations.

async fn get(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Self::Error>

Get value by key.

async fn get_shared(&self, key: &[u8]) -> Result<Option<Arc<[u8]>>, Self::Error>

Async immutable shared-byte read.

async fn batch_get_shared_ordered_unique( &self, keys: &[&[u8]], ) -> Result<Vec<Option<Arc<[u8]>>>, Self::Error>

Async ordered retained-byte batch read for unique keys.

fn has_native_shared_reads(&self) -> bool

Whether async shared reads retain backend-owned immutable allocations.

async fn put(&self, key: &[u8], value: &[u8]) -> Result<(), Self::Error>

Store key-value pair.

async fn delete(&self, key: &[u8]) -> Result<(), Self::Error>

Delete key.

async fn batch(&self, ops: &[BatchOp<'_>]) -> Result<(), Self::Error>

Batch write operations.

async fn batch_get( &self, keys: &[&[u8]], ) -> Result<HashMap<Vec<u8>, Vec<u8>>, Self::Error>

Retrieve multiple keys as a map.

async fn batch_get_ordered( &self, keys: &[&[u8]], ) -> Result<Vec<Option<Vec<u8>>>, Self::Error>

Retrieve multiple keys while preserving request order.

async fn batch_get_ordered_unique( &self, keys: &[&[u8]], ) -> Result<Vec<Option<Vec<u8>>>, Self::Error>

Retrieve unique keys in request order.

fn prefers_batch_reads(&self) -> bool

Whether this store has an efficient native batched-read implementation.

async fn batch_put(&self, entries: &[(&[u8], &[u8])]) -> Result<(), Self::Error>

Store multiple key-value pairs.

fn supports_hints(&self) -> bool

Whether this store persists performance hints.

fn prefers_rightmost_path_hints(&self) -> bool

Whether append-heavy writes should maintain the engine’s rightmost-path hint.

async fn get_hint( &self, namespace: &[u8], key: &[u8], ) -> Result<Option<Vec<u8>>, Self::Error>

Retrieve an optional performance hint.

async fn put_hint( &self, namespace: &[u8], key: &[u8], value: &[u8], ) -> Result<(), Self::Error>

Persist an optional performance hint.

async fn batch_put_with_hint( &self, entries: &[(&[u8], &[u8])], namespace: &[u8], key: &[u8], value: &[u8], ) -> Result<(), Self::Error>

Store content-addressed nodes and one hint atomically when supported.

async fn publish_nodes( &self, publication: NodePublication<'_>, ) -> Result<(), Self::Error>

Publish canonical immutable nodes with advisory logical context.

fn read_parallelism(&self) -> usize

Maximum in-flight point reads for default ordered batch reads.

impl<S> AsyncTransactionalStore for SyncStoreAsAsync<S>

where S: TransactionalStore,

fn supports_transactions(&self) -> bool

Whether this backend can atomically commit staged nodes and roots.

async fn commit_transaction( &self, node_writes: &[TransactionNodeWrite], root_conditions: &[RootCondition], root_writes: &[RootWrite], ) -> Result<TransactionUpdate, Error>

Atomically validate root conditions, write nodes, and apply root writes.

impl<S: Clone> Clone for SyncStoreAsAsync<S>

fn clone(&self) -> SyncStoreAsAsync<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for SyncStoreAsAsync<S>

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

Formats the value using the given formatter.