Struct IncrementalPatternMatcher 

pub struct IncrementalPatternMatcher {
    pub pattern: GraphPattern,
    pub graph: String,
    pub base_matches: BTreeSet<Vec<VertexId>>,
}

Fields

pattern: GraphPattern

graph: String

base_matches: BTreeSet<Vec<VertexId>>

Implementations

impl IncrementalPatternMatcher

pub fn new(pattern: GraphPattern, graph: impl Into<String>) -> Self

pub fn matches(&self) -> &BTreeSet<Vec<VertexId>>

pub fn seed<G: GraphStore>(&mut self, store: &G) -> GraphStoreResult<()>

Initial population of the base match set. Equivalent to a one-shot GMatch whose results are folded into base_matches.

pub fn update<G: GraphStore>( &mut self, store: &G, delta: &GraphDelta, ) -> GraphStoreResult<&BTreeSet<Vec<VertexId>>>

Apply a delta and return the refreshed match set. The store is expected to already reflect the delta.