pub struct CacheObliviousSpatialAlgorithms {
pub distance_computation: CacheObliviousDistanceMatrix,
pub sorting: CacheObliviousSorting,
pub matrix_operations: CacheObliviousMatrixOps,
pub tree_traversal: CacheObliviousTreeTraversal,
}Expand description
Cache-oblivious spatial algorithms
Fields§
§distance_computation: CacheObliviousDistanceMatrixCache-oblivious distance computation
sorting: CacheObliviousSortingCache-oblivious sorting
matrix_operations: CacheObliviousMatrixOpsCache-oblivious matrix operations
tree_traversal: CacheObliviousTreeTraversalCache-oblivious tree traversal
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CacheObliviousSpatialAlgorithms
impl RefUnwindSafe for CacheObliviousSpatialAlgorithms
impl Send for CacheObliviousSpatialAlgorithms
impl Sync for CacheObliviousSpatialAlgorithms
impl Unpin for CacheObliviousSpatialAlgorithms
impl UnwindSafe for CacheObliviousSpatialAlgorithms
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.