Struct SearchIo 

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

Implementations

impl<S> SearchIo<S>

pub fn new(store: S, runtime: Arc<SearchRuntime>) -> Self

pub fn namespace(&self) -> StoreCacheNamespace

pub fn runtime(&self) -> &Arc<SearchRuntime>

pub fn store(&self) -> &S

pub fn physical_bytes_read(&self) -> usize

pub fn physical_reads(&self) -> usize

pub fn with_proximity_dimensions(self, dimensions: u32) -> Self

Bind proximity decoder context so authoritative PRXN objects can be validated before shared cache admission, including through AsyncStore.

Trait Implementations

impl<S: Clone> Clone for SearchIo<S>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Store + Clone> Store for SearchIo<S>

type Error = <S as Store>::Error

Error type for storage operations

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

Get value by key

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

Get immutable shared bytes without requiring the engine to copy an already-retained cache value. Stores that cannot retain values may use the default owned-read adapter.

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

Store key-value pair

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

Delete key

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

Batch write operations (atomic if supported by backend)

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

Retrieve multiple keys in a single operation with order preservation

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

Retrieve unique keys in input order.

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

Retrieve unique keys in order as retained immutable byte buffers.

fn has_native_shared_reads(&self) -> bool

Whether shared reads return an already-retained immutable allocation.

fn prefers_batch_reads(&self) -> bool

Whether this store has an efficient batched-read implementation.

fn supports_hints(&self) -> bool

Whether this store persists performance hints.

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

Retrieve an optional performance hint for a logical namespace and key.

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

Persist an optional performance hint for a logical namespace and key.

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

Retrieve multiple keys in a single operation

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

Store multiple key-value pairs in a single operation

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.