Struct MemoryDatastore 

pub struct MemoryDatastore { /* private fields */ }

In-memory datastore used by examples and integration tests.

Stores the “command -> response” pairing for the simplest commands without speaking the real protocol. Production embedders use RedisDatastore or MemcacheDatastore.

Implementations

impl MemoryDatastore

pub fn new() -> Self

Build a fresh empty store.

Examples

use dynomite::embed::hooks::MemoryDatastore;
let ds = MemoryDatastore::new();
assert_eq!(ds.dispatch_count(), 0);

pub fn dispatch_count(&self) -> u64

Number of times Datastore::dispatch has been invoked.

Examples

use dynomite::embed::hooks::MemoryDatastore;
let ds = MemoryDatastore::new();
assert_eq!(ds.dispatch_count(), 0);

impl MemoryDatastore

pub fn insert(&self, bucket: &[u8], key: &[u8])

Insert (bucket, key) into the in-memory listing index.

Idempotent: inserting the same (bucket, key) pair twice is a no-op. Tests use this helper to seed the streaming list path without speaking the real Riak protocol.

Examples

use dynomite::embed::hooks::MemoryDatastore;
let ds = MemoryDatastore::new();
ds.insert(b"users", b"alice");
ds.insert(b"users", b"bob");
assert_eq!(ds.list_buckets_snapshot().len(), 1);
assert_eq!(ds.list_keys_snapshot(b"users").len(), 2);

pub fn list_buckets_snapshot(&self) -> Vec<Bytes>

Snapshot of the bucket name set, sorted lexicographically.

Examples

use dynomite::embed::hooks::MemoryDatastore;
let ds = MemoryDatastore::new();
assert!(ds.list_buckets_snapshot().is_empty());

pub fn list_keys_snapshot(&self, bucket: &[u8]) -> Vec<Bytes>

Snapshot of the keys in bucket, sorted lexicographically. Returns an empty vector when the bucket is unknown.

Examples

use dynomite::embed::hooks::MemoryDatastore;
let ds = MemoryDatastore::new();
assert!(ds.list_keys_snapshot(b"missing").is_empty());

Trait Implementations

impl Clone for MemoryDatastore

fn clone(&self) -> MemoryDatastore

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Datastore for MemoryDatastore

fn protocol(&self) -> Protocol

Return the wire protocol the datastore speaks.

fn dispatch(&self, req: Msg) -> BoxFuture<'_, Result<Msg, DatastoreError>>

Forward a routed request and return the response message.

fn list_buckets_stream(&self) -> DatastoreByteStream

Stream the names of every bucket the datastore is aware of, one bytes::Bytes per bucket.

fn list_keys_stream(&self, bucket: &[u8]) -> DatastoreByteStream

Stream every key in bucket, one bytes::Bytes per key.

fn supports(&self, _cmd: MsgType) -> bool

Predicate used by the dispatcher to short-circuit commands the backend cannot serve.

fn riak_get<'a>( &'a self, _bucket: &'a [u8], _key: &'a [u8], ) -> BoxFuture<'a, Result<Option<Vec<u8>>, DatastoreError>>

Read the object stored under (bucket, key) against the Riak K/V layer.

fn riak_put<'a>( &'a self, _bucket: &'a [u8], _key: &'a [u8], _value: &'a [u8], _indexes: &'a [(Vec<u8>, Vec<u8>)], ) -> BoxFuture<'a, Result<(), DatastoreError>>

Store value under (bucket, key). indexes carries (index_name, encoded_value) pairs to associate with the object on the 2i layer.

fn riak_delete<'a>( &'a self, _bucket: &'a [u8], _key: &'a [u8], ) -> BoxFuture<'a, Result<bool, DatastoreError>>

Delete the object stored under (bucket, key). Returns true when an object was removed, false when none existed.

fn riak_index_eq<'a>( &'a self, _bucket: &'a [u8], _index_name: &'a [u8], _value: &'a [u8], ) -> BoxFuture<'a, Result<Vec<Vec<u8>>, DatastoreError>>

Equality query against the 2i layer.

fn riak_index_range<'a>( &'a self, _bucket: &'a [u8], _index_name: &'a [u8], _min: &'a [u8], _max: &'a [u8], ) -> BoxFuture<'a, Result<Vec<Vec<u8>>, DatastoreError>>

Range query against the 2i layer. min and max are inclusive bounds in the same encoding the index uses internally.

impl Debug for MemoryDatastore

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

Formats the value using the given formatter.

impl Default for MemoryDatastore

fn default() -> MemoryDatastore

Returns the “default value” for a type.