pub struct PathIndex { /* private fields */ }Expand description
Pre-indexed reachable (start, end) pairs for fixed label
sequences. Lookup is keyed by the slash-joined sequence so the RPQ
operator can lift a Label / Label / ... expression into a direct
hit without running NFA simulation.
Implementations§
Source§impl PathIndex
impl PathIndex
pub fn build<G: GraphStore>( store: &G, graph: &str, label_sequences: &[Vec<String>], ) -> GraphStoreResult<Self>
pub fn lookup( &self, label_sequence: &[String], ) -> Option<&BTreeSet<(VertexId, VertexId)>>
pub fn has_path(&self, label_sequence: &[String]) -> bool
pub fn indexed_paths(&self) -> Vec<String>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PathIndex
impl RefUnwindSafe for PathIndex
impl Send for PathIndex
impl Sync for PathIndex
impl Unpin for PathIndex
impl UnsafeUnpin for PathIndex
impl UnwindSafe for PathIndex
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more