pub struct ParallelBgpEvaluator {
pub num_threads: usize,
pub chunk_size: usize,
}Expand description
Parallel evaluator for Basic Graph Patterns.
Fields§
§num_threads: usizeNumber of worker threads (0 = use Rayon’s global pool)
chunk_size: usizeMinimum patterns per stage to justify parallelism overhead
Implementations§
Source§impl ParallelBgpEvaluator
impl ParallelBgpEvaluator
Sourcepub fn with_chunk_size(self, chunk_size: usize) -> Self
pub fn with_chunk_size(self, chunk_size: usize) -> Self
Create a new evaluator with tunable chunk size
Sourcepub fn evaluate(
&self,
patterns: Vec<TriplePatternInfo>,
store: &dyn TripleStore,
) -> Result<Vec<BindingRow>>
pub fn evaluate( &self, patterns: Vec<TriplePatternInfo>, store: &dyn TripleStore, ) -> Result<Vec<BindingRow>>
Evaluate a BGP by exploiting parallelism among independent patterns.
Sourcepub fn merge_results(
&self,
left: Vec<BindingRow>,
right: Vec<BindingRow>,
join_vars: &[String],
) -> Vec<BindingRow> ⓘ
pub fn merge_results( &self, left: Vec<BindingRow>, right: Vec<BindingRow>, join_vars: &[String], ) -> Vec<BindingRow> ⓘ
Hash join of two binding sets on shared variables.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ParallelBgpEvaluator
impl RefUnwindSafe for ParallelBgpEvaluator
impl Send for ParallelBgpEvaluator
impl Sync for ParallelBgpEvaluator
impl Unpin for ParallelBgpEvaluator
impl UnsafeUnpin for ParallelBgpEvaluator
impl UnwindSafe for ParallelBgpEvaluator
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.