pub struct AsyncZeroCopyProcessor<T> { /* private fields */ }Expand description
Advanced asynchronous zero-copy processor with NUMA awareness
Implementations§
Source§impl<T: Copy + Send + Sync + 'static> AsyncZeroCopyProcessor<T>
impl<T: Copy + Send + Sync + 'static> AsyncZeroCopyProcessor<T>
Sourcepub fn new<P: AsRef<Path>>(
path: P,
chunk_size: usize,
config: AsyncConfig,
) -> Result<Self>
pub fn new<P: AsRef<Path>>( path: P, chunk_size: usize, config: AsyncConfig, ) -> Result<Self>
Create a new async zero-copy processor with NUMA awareness
Sourcepub fn with_numa_binding<P: AsRef<Path>>(
path: P,
chunk_size: usize,
numa_node: usize,
config: AsyncConfig,
) -> Result<Self>
pub fn with_numa_binding<P: AsRef<Path>>( path: P, chunk_size: usize, numa_node: usize, config: AsyncConfig, ) -> Result<Self>
Create with NUMA binding to specific node
Sourcepub async fn process_async<F, R>(
&mut self,
shape: Vec<usize>,
processor: F,
) -> Result<Vec<R>>
pub async fn process_async<F, R>( &mut self, shape: Vec<usize>, processor: F, ) -> Result<Vec<R>>
Asynchronous parallel processing with NUMA optimization
Sourcepub fn get_numa_info(&self) -> NumaTopologyInfo
pub fn get_numa_info(&self) -> NumaTopologyInfo
Get NUMA topology information
Auto Trait Implementations§
impl<T> Freeze for AsyncZeroCopyProcessor<T>
impl<T> RefUnwindSafe for AsyncZeroCopyProcessor<T>where
T: RefUnwindSafe,
impl<T> Send for AsyncZeroCopyProcessor<T>where
T: Send,
impl<T> Sync for AsyncZeroCopyProcessor<T>where
T: Sync,
impl<T> Unpin for AsyncZeroCopyProcessor<T>where
T: Unpin,
impl<T> UnwindSafe for AsyncZeroCopyProcessor<T>where
T: 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.