Struct MemoryStore 

pub struct MemoryStore { /* private fields */ }

The in-memory reference implementation of JournalStore and GraphStore on one dataset, used by the test kit’s self-test and by tests of code above the storage layer.

Like the tiramemsu backend, it holds the journal and the graphs in one store: an append writes the entry graphs and the state delta into the dataset under one lock. By default it enforces fencing, accepts state deltas and declares RDF 1.2; each can be switched off to exercise the other side of a capability.

Implementations

impl MemoryStore

pub fn new() -> Self

An empty store with fencing, state deltas and RDF 1.2.

pub fn with_fencing(self, on: bool) -> Self

This store with fencing enforced or not.

pub fn with_state_in_append(self, on: bool) -> Self

This store with state deltas accepted or not.

pub fn with_rdf(self, rdf: RdfCapability) -> Self

This store declaring rdf. With RdfCapability::Rdf11 it refuses triple terms.

pub fn dataset(&self) -> Dataset

A copy of every quad in the store.

Trait Implementations

impl Debug for MemoryStore

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

Formats the value using the given formatter.

impl Default for MemoryStore

fn default() -> Self

Returns the “default value” for a type.

impl GraphStore for MemoryStore

fn capabilities(&self) -> GraphCapabilities

What the store declares about itself.

fn insert_quads(&self, quads: &[Quad]) -> Result<(), StoreError>

Adds quads.

fn remove_quads(&self, quads: &[Quad]) -> Result<(), StoreError>

Removes quads (absent ones are ignored). Blank nodes cannot be named for removal.

fn clear_graph(&self, graph: &NamedNode) -> Result<(), StoreError>

Removes every statement of the named graph graph.

fn query(&self, sparql: &str) -> Result<QueryResults, StoreError>

Runs a SPARQL 1.1 query (SELECT, ASK, CONSTRUCT, DESCRIBE).

fn rdf_capability(&self) -> RdfCapability

Whether the store supports RDF 1.2 triple terms.

impl JournalStore for MemoryStore

fn capabilities(&self) -> JournalCapabilities

What the store supports beyond compare-and-set.

fn append( &self, actor: &NamedNode, expected: Position, entries: &[Entry], meta: &AppendMeta, ) -> Result<Position, AppendError>

Appends entries to actor’s journal if, and only if, its last entry is at expected.

fn read( &self, actor: &NamedNode, from: Position, ) -> Result<Vec<JournalRecord>, StoreError>

The entries of actor’s journal from position from (inclusive; 0 reads from the start) to the head, in order.

fn head(&self, actor: &NamedNode) -> Result<Position, StoreError>

The position of actor’s last entry, 0 for an empty journal.

fn actors(&self) -> Result<Vec<NamedNode>, StoreError>

Every actor with at least one entry.

fn supports_fencing(&self) -> bool

True when the store enforces fencing tokens.