Struct GraphMutWrapper 

pub struct GraphMutWrapper<'a> { /* private fields */ }

Wrapper that provides [GraphStorageMut] implementation for Graph.

This wrapper allows using the COW-based Graph with APIs that require mutable storage access, such as the GQL mutation engine.

Example

use interstellar::storage::{Graph, GraphStorage, GraphStorageMut};

let graph = Graph::new();
let mut wrapper = graph.as_storage_mut();

// Use wrapper with APIs requiring GraphStorageMut
let id = wrapper.add_vertex("person", std::collections::HashMap::new());
assert!(wrapper.get_vertex(id).is_some());

Trait Implementations

impl<'a> GraphStorage for GraphMutWrapper<'a>

fn get_vertex(&self, id: VertexId) -> Option<Vertex>

Retrieves a vertex by its ID.

fn vertex_count(&self) -> u64

Returns the total number of vertices in the graph.

fn get_edge(&self, id: EdgeId) -> Option<Edge>

Retrieves an edge by its ID.

fn edge_count(&self) -> u64

Returns the total number of edges in the graph.

fn out_edges(&self, vertex: VertexId) -> Box<dyn Iterator<Item = Edge> + '_>

Returns an iterator over all outgoing edges from a vertex.

fn in_edges(&self, vertex: VertexId) -> Box<dyn Iterator<Item = Edge> + '_>

Returns an iterator over all incoming edges to a vertex.

fn vertices_with_label( &self, label: &str, ) -> Box<dyn Iterator<Item = Vertex> + '_>

Returns an iterator over all vertices with a given label.

fn edges_with_label(&self, label: &str) -> Box<dyn Iterator<Item = Edge> + '_>

Returns an iterator over all edges with a given label.

fn all_vertices(&self) -> Box<dyn Iterator<Item = Vertex> + '_>

Returns an iterator over all vertices in the graph.

fn all_edges(&self) -> Box<dyn Iterator<Item = Edge> + '_>

Returns an iterator over all edges in the graph.

fn interner(&self) -> &StringInterner

Returns a reference to the string interner for label resolution.

fn supports_indexes(&self) -> bool

Returns whether this storage supports property indexes.

fn vertices_by_property( &self, label: Option<&str>, property: &str, value: &Value, ) -> Box<dyn Iterator<Item = Vertex> + '_>

Lookup vertices by property value, using indexes if available.

fn edges_by_property( &self, label: Option<&str>, property: &str, value: &Value, ) -> Box<dyn Iterator<Item = Edge> + '_>

Lookup edges by property value, using indexes if available.

fn vertices_by_property_range( &self, label: Option<&str>, property: &str, start: Bound<&Value>, end: Bound<&Value>, ) -> Box<dyn Iterator<Item = Vertex> + '_>

Lookup vertices by property range, using indexes if available.

impl<'a> GraphStorageMut for GraphMutWrapper<'a>

fn add_vertex( &mut self, label: &str, properties: HashMap<String, Value>, ) -> VertexId

Adds a new vertex with the given label and properties.

fn add_edge( &mut self, src: VertexId, dst: VertexId, label: &str, properties: HashMap<String, Value>, ) -> Result<EdgeId, StorageError>

Adds a new edge connecting two vertices.

fn set_vertex_property( &mut self, id: VertexId, key: &str, value: Value, ) -> Result<(), StorageError>

Sets or updates a property on a vertex.

fn set_edge_property( &mut self, id: EdgeId, key: &str, value: Value, ) -> Result<(), StorageError>

Sets or updates a property on an edge.

fn remove_vertex(&mut self, id: VertexId) -> Result<(), StorageError>

Removes a vertex and all its incident edges.

fn remove_edge(&mut self, id: EdgeId) -> Result<(), StorageError>

Removes an edge from the graph.