pub struct CacheOptimizedMatrixProcessor { /* private fields */ }Expand description
Cache-optimized matrix processor with advanced SIMD operations
Implementations§
Source§impl CacheOptimizedMatrixProcessor
impl CacheOptimizedMatrixProcessor
Sourcepub fn transpose_advanced_fast<T>(&self, input: &ArrayView2<'_, T>) -> Array2<T>
pub fn transpose_advanced_fast<T>(&self, input: &ArrayView2<'_, T>) -> Array2<T>
Optimized matrix transpose with advanced cache optimization
Sourcepub fn matrix_multiply_blocked<T>(
&self,
a: &ArrayView2<'_, T>,
b: &ArrayView2<'_, T>,
) -> Result<Array2<T>>
pub fn matrix_multiply_blocked<T>( &self, a: &ArrayView2<'_, T>, b: &ArrayView2<'_, T>, ) -> Result<Array2<T>>
Advanced matrix multiplication with blocking and SIMD
Sourcepub fn matrix_vector_multiply_simd<T>(
&self,
matrix: &ArrayView2<'_, T>,
vector: &ArrayView1<'_, T>,
) -> Result<Array1<T>>
pub fn matrix_vector_multiply_simd<T>( &self, matrix: &ArrayView2<'_, T>, vector: &ArrayView1<'_, T>, ) -> Result<Array1<T>>
Matrix-vector multiplication with SIMD optimization
Sourcepub fn optimize_memory_access<T>(&self, data: &mut ArrayViewMut2<'_, T>)
pub fn optimize_memory_access<T>(&self, data: &mut ArrayViewMut2<'_, T>)
Strided memory access pattern optimization
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CacheOptimizedMatrixProcessor
impl RefUnwindSafe for CacheOptimizedMatrixProcessor
impl Send for CacheOptimizedMatrixProcessor
impl Sync for CacheOptimizedMatrixProcessor
impl Unpin for CacheOptimizedMatrixProcessor
impl UnsafeUnpin for CacheOptimizedMatrixProcessor
impl UnwindSafe for CacheOptimizedMatrixProcessor
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::RequestSource§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,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().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.