Struct StorageWriterAdapter 

pub struct StorageWriterAdapter<'a>(pub &'a dyn StorageEngine);

Adapter that lets a &dyn StorageEngine act as a GraphWriter. See crate::reader::StorageReaderAdapter for the rationale.

Tuple Fields

0: &'a dyn StorageEngine

Trait Implementations

impl GraphWriter for StorageWriterAdapter<'_>

fn put_node(&self, node: &Node) -> Result<()>

fn put_edge(&self, edge: &Edge) -> Result<()>

fn delete_edge(&self, id: EdgeId) -> Result<()>

fn detach_delete_node(&self, id: NodeId) -> Result<()>

fn create_property_index( &self, label: &str, properties: &[String], ) -> Result<()>

Declare a new property index. properties is a slice so the composite form (CREATE INDEX FOR (n:L) ON (n.a, n.b)) fits the same surface as single-property. Default impl errors so remote writers that don’t yet support cluster-aware DDL surface the limitation immediately; storage-backed writers override via the blanket impl.

fn drop_property_index(&self, label: &str, properties: &[String]) -> Result<()>

Tear down a property index. Mirrors Self::create_property_index.

fn list_property_indexes(&self) -> Result<Vec<(String, Vec<String>)>>

Snapshot the currently-registered property indexes as (label, property) pairs for SHOW INDEXES. Default impl returns an empty list — remote writers will wire real fan-out in Phase C.

fn create_edge_property_index( &self, edge_type: &str, properties: &[String], ) -> Result<()>

Relationship-scope analogue of Self::create_property_index.

fn drop_edge_property_index( &self, edge_type: &str, properties: &[String], ) -> Result<()>

Tear down an edge property index. Mirrors Self::create_edge_property_index.

fn list_edge_property_indexes(&self) -> Result<Vec<(String, Vec<String>)>>

Snapshot the currently-registered edge property indexes as (edge_type, property) pairs. Default impl returns an empty list.

fn create_point_index(&self, label: &str, property: &str) -> Result<()>

Declare a point / spatial index on (label, property). Default impl errors — remote writers opt in via the blanket StorageEngine impl or a cluster-aware override.

fn drop_point_index(&self, label: &str, property: &str) -> Result<()>

Tear down a point index. Mirrors Self::create_point_index.

fn list_point_indexes(&self) -> Result<Vec<(String, String)>>

Snapshot the currently-registered point indexes as (label, property) pairs. Default impl returns empty.

fn create_edge_point_index(&self, edge_type: &str, property: &str) -> Result<()>

Relationship-scope analogue of Self::create_point_index.

fn drop_edge_point_index(&self, edge_type: &str, property: &str) -> Result<()>

Tear down an edge point index. Mirrors Self::create_edge_point_index.

fn list_edge_point_indexes(&self) -> Result<Vec<(String, String)>>

Snapshot the currently-registered edge point indexes as (edge_type, property) pairs.

fn create_property_constraint( &self, name: Option<&str>, scope: &ConstraintScope, properties: &[String], kind: PropertyConstraintKind, if_not_exists: bool, ) -> Result<PropertyConstraintSpec>

Declare a new property constraint. Default impl errors so remote writers that haven’t plumbed constraint DDL yet surface the limitation immediately — storage-backed writers override via the blanket impl. properties is a list to accommodate composite kinds (NodeKey); single-property kinds pass a one-element slice.

fn drop_property_constraint(&self, name: &str, if_exists: bool) -> Result<()>

Tear down a constraint by name. Mirrors Self::create_property_constraint.

fn list_property_constraints(&self) -> Result<Vec<PropertyConstraintSpec>>

Snapshot the currently-registered constraints for SHOW CONSTRAINTS. Default impl returns an empty list.