pub struct DataLocalityOptimizer { /* private fields */ }Expand description
Data locality optimizer
Implementations§
Source§impl DataLocalityOptimizer
impl DataLocalityOptimizer
Sourcepub fn new(strategy: LocalityStrategy, numa_topology: NUMATopology) -> Self
pub fn new(strategy: LocalityStrategy, numa_topology: NUMATopology) -> Self
Create a new data locality optimizer
Sourcepub fn optimize_data_placement(
&mut self,
state_vector: &mut OptimizedStateVector,
access_pattern: &[usize],
) -> Result<LocalityOptimizationResult>
pub fn optimize_data_placement( &mut self, state_vector: &mut OptimizedStateVector, access_pattern: &[usize], ) -> Result<LocalityOptimizationResult>
Optimize data placement for better locality
Sourcepub fn get_detected_loops(&self) -> &[LoopPattern]
pub fn get_detected_loops(&self) -> &[LoopPattern]
Get detected loop patterns
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DataLocalityOptimizer
impl RefUnwindSafe for DataLocalityOptimizer
impl Send for DataLocalityOptimizer
impl Sync for DataLocalityOptimizer
impl Unpin for DataLocalityOptimizer
impl UnwindSafe for DataLocalityOptimizer
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.