Skip to main content

SQLiteGraphStore

Struct SQLiteGraphStore 

Source
pub struct SQLiteGraphStore { /* private fields */ }

Implementations§

Source§

impl SQLiteGraphStore

Source

pub fn open( conn: ManagedConnection, table_name: Option<&str>, ) -> Result<Self, SQLiteError>

Open (or create) the per-table graph tables on conn and rehydrate the in-memory store from any existing rows.

Source

pub fn as_memory_store(&self) -> &MemoryGraphStore

Source

pub fn create_graph(&mut self, name: &str) -> Result<(), SQLiteError>

Source

pub fn drop_graph(&mut self, name: &str) -> Result<(), SQLiteError>

Source

pub fn union_graphs( &mut self, left: &str, right: &str, target: &str, ) -> Result<(), SQLiteError>

Source

pub fn intersect_graphs( &mut self, left: &str, right: &str, target: &str, ) -> Result<(), SQLiteError>

Source

pub fn difference_graphs( &mut self, left: &str, right: &str, target: &str, ) -> Result<(), SQLiteError>

Source

pub fn copy_graph( &mut self, source: &str, target: &str, ) -> Result<(), SQLiteError>

Source

pub fn add_vertex( &mut self, vertex: Vertex, graph: &str, ) -> Result<(), SQLiteError>

Source

pub fn add_edge(&mut self, edge: Edge, graph: &str) -> Result<(), SQLiteError>

Source

pub fn remove_vertex( &mut self, vertex_id: VertexId, graph: &str, ) -> Result<(), SQLiteError>

Source

pub fn remove_edge( &mut self, edge_id: EdgeId, graph: &str, ) -> Result<(), SQLiteError>

Source

pub fn allocate_vertex_id( &mut self, label: &str, graph: &str, ) -> Result<VertexId, SQLiteError>

Source

pub fn allocate_edge_id( &mut self, label: &str, graph: &str, ) -> Result<EdgeId, SQLiteError>

Source

pub fn clear(&mut self) -> Result<(), SQLiteError>

Source

pub fn graph_names(&self) -> Vec<String>

Source

pub fn has_graph(&self, name: &str) -> bool

Source

pub fn neighbors( &self, vertex_id: VertexId, label: Option<&str>, direction: Direction, graph: &str, ) -> Result<Vec<VertexId>, SQLiteError>

Source

pub fn vertices_by_label( &self, label: &str, graph: &str, ) -> Result<Vec<Vertex>, SQLiteError>

Source

pub fn vertex_ids_by_label( &self, label: &str, graph: &str, ) -> Result<Vec<VertexId>, SQLiteError>

Source

pub fn vertices_in_graph(&self, graph: &str) -> Result<Vec<Vertex>, SQLiteError>

Source

pub fn edges_in_graph(&self, graph: &str) -> Result<Vec<Edge>, SQLiteError>

Source

pub fn vertex_graphs(&self, vertex_id: VertexId) -> BTreeSet<String>

Source

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

Source

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

Source

pub fn vertices(&self) -> BTreeMap<VertexId, Vertex>

Source

pub fn edges(&self) -> BTreeMap<EdgeId, Edge>

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.