pub struct EnhancedParallelProcessor<F> { /* private fields */ }Expand description
Enhanced parallel statistics processor
Implementations§
Source§impl<F> EnhancedParallelProcessor<F>where
F: Float + NumCast + SimdUnifiedOps + Zero + One + PartialOrd + Copy + Send + Sync + Display + Sum<F> + FromPrimitive,
impl<F> EnhancedParallelProcessor<F>where
F: Float + NumCast + SimdUnifiedOps + Zero + One + PartialOrd + Copy + Send + Sync + Display + Sum<F> + FromPrimitive,
Sourcepub fn with_config(config: EnhancedParallelConfig) -> Self
pub fn with_config(config: EnhancedParallelConfig) -> Self
Create with custom configuration
Sourcepub fn mean_parallel_enhanced(&self, data: &ArrayView1<'_, F>) -> StatsResult<F>
pub fn mean_parallel_enhanced(&self, data: &ArrayView1<'_, F>) -> StatsResult<F>
Parallel mean computation with optimal chunking
Sourcepub fn variance_parallel_enhanced(
&self,
data: &ArrayView1<'_, F>,
ddof: usize,
) -> StatsResult<F>
pub fn variance_parallel_enhanced( &self, data: &ArrayView1<'_, F>, ddof: usize, ) -> StatsResult<F>
Parallel variance computation with Welford’s algorithm
Sourcepub fn correlation_matrix_parallel(
&self,
matrix: &ArrayView2<'_, F>,
) -> StatsResult<Array2<F>>
pub fn correlation_matrix_parallel( &self, matrix: &ArrayView2<'_, F>, ) -> StatsResult<Array2<F>>
Parallel correlation matrix computation
Sourcepub fn bootstrap_parallel_enhanced(
&self,
data: &ArrayView1<'_, F>,
n_bootstrap: usize,
statistic_fn: impl Fn(&ArrayView1<'_, F>) -> F + Send + Sync,
seed: Option<u64>,
) -> StatsResult<Array1<F>>
pub fn bootstrap_parallel_enhanced( &self, data: &ArrayView1<'_, F>, n_bootstrap: usize, statistic_fn: impl Fn(&ArrayView1<'_, F>) -> F + Send + Sync, seed: Option<u64>, ) -> StatsResult<Array1<F>>
Parallel bootstrap sampling
Sourcepub fn matrix_operations_parallel(
&self,
matrix: &ArrayView2<'_, F>,
) -> StatsResult<MatrixParallelResult<F>>
pub fn matrix_operations_parallel( &self, matrix: &ArrayView2<'_, F>, ) -> StatsResult<MatrixParallelResult<F>>
Parallel matrix operations with optimal memory access patterns
Sourcepub fn quantiles_parallel(
&self,
data: &ArrayView1<'_, F>,
quantiles: &[F],
) -> StatsResult<Array1<F>>
pub fn quantiles_parallel( &self, data: &ArrayView1<'_, F>, quantiles: &[F], ) -> StatsResult<Array1<F>>
Parallel quantile computation using parallel sorting
Trait Implementations§
Source§impl<F> Default for EnhancedParallelProcessor<F>where
F: Float + NumCast + SimdUnifiedOps + Zero + One + PartialOrd + Copy + Send + Sync + Display + Sum<F> + FromPrimitive,
impl<F> Default for EnhancedParallelProcessor<F>where
F: Float + NumCast + SimdUnifiedOps + Zero + One + PartialOrd + Copy + Send + Sync + Display + Sum<F> + FromPrimitive,
Auto Trait Implementations§
impl<F> Freeze for EnhancedParallelProcessor<F>
impl<F> RefUnwindSafe for EnhancedParallelProcessor<F>where
F: RefUnwindSafe,
impl<F> Send for EnhancedParallelProcessor<F>where
F: Send,
impl<F> Sync for EnhancedParallelProcessor<F>where
F: Sync,
impl<F> Unpin for EnhancedParallelProcessor<F>where
F: Unpin,
impl<F> UnwindSafe for EnhancedParallelProcessor<F>where
F: UnwindSafe,
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> 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<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.