pub enum CacheOptimizedLayout {
Linear,
Blocked,
ZOrder,
Hilbert,
BitReversal,
Strided,
Hierarchical,
}
Expand description
Cache-optimized data layout strategies
Variants§
Linear
Standard linear layout
Blocked
Block-based layout for cache lines
ZOrder
Z-order (Morton order) layout
Hilbert
Hilbert curve layout
BitReversal
Bit-reversal layout for FFT-like operations
Strided
Strided layout for parallel access
Hierarchical
Hierarchical layout matching cache levels
Trait Implementations§
Source§impl Clone for CacheOptimizedLayout
impl Clone for CacheOptimizedLayout
Source§fn clone(&self) -> CacheOptimizedLayout
fn clone(&self) -> CacheOptimizedLayout
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for CacheOptimizedLayout
impl Debug for CacheOptimizedLayout
Source§impl PartialEq for CacheOptimizedLayout
impl PartialEq for CacheOptimizedLayout
impl Copy for CacheOptimizedLayout
impl Eq for CacheOptimizedLayout
impl StructuralPartialEq for CacheOptimizedLayout
Auto Trait Implementations§
impl Freeze for CacheOptimizedLayout
impl RefUnwindSafe for CacheOptimizedLayout
impl Send for CacheOptimizedLayout
impl Sync for CacheOptimizedLayout
impl Unpin for CacheOptimizedLayout
impl UnwindSafe for CacheOptimizedLayout
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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.