pub struct PatternDependencyGraph { /* private fields */ }Expand description
Dependency graph over a set of triple patterns.
Pattern i depends on pattern j when j binds a variable that i
needs as input. In the context of parallel evaluation, two patterns are
independent when neither depends on the other.
Implementations§
Source§impl PatternDependencyGraph
impl PatternDependencyGraph
Sourcepub fn build(patterns: Vec<TriplePatternInfo>) -> Self
pub fn build(patterns: Vec<TriplePatternInfo>) -> Self
Build the dependency graph for the given pattern list.
Sourcepub fn get_independent_patterns(&self) -> Vec<Vec<usize>>
pub fn get_independent_patterns(&self) -> Vec<Vec<usize>>
Return groups of patterns that can be evaluated in parallel.
Sourcepub fn execution_order(&self) -> &[Vec<usize>]
pub fn execution_order(&self) -> &[Vec<usize>]
Return the topologically sorted execution stages.
Sourcepub fn patterns(&self) -> &[TriplePatternInfo]
pub fn patterns(&self) -> &[TriplePatternInfo]
Access the underlying patterns
Sourcepub fn are_independent(&self, i: usize, j: usize) -> bool
pub fn are_independent(&self, i: usize, j: usize) -> bool
Check whether two pattern indices are independent
Auto Trait Implementations§
impl Freeze for PatternDependencyGraph
impl RefUnwindSafe for PatternDependencyGraph
impl Send for PatternDependencyGraph
impl Sync for PatternDependencyGraph
impl Unpin for PatternDependencyGraph
impl UnsafeUnpin for PatternDependencyGraph
impl UnwindSafe for PatternDependencyGraph
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
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.