pub struct MultiCcaPermuteParams<T> {
pub grid: Option<Vec<Vec<T>>>,
pub n_perms: usize,
pub n_iter: usize,
pub seed: u64,
}Expand description
Tuning knobs for multi_cca_permute.
Fields§
§grid: Option<Vec<Vec<T>>>Candidate L1 bounds, one row per grid point and one entry per block.
None builds PMA’s grid: ten points spanning
[0.1, 0.8] * sqrt(p_k), floored at 1.1.
n_perms: usizePermutations per grid point.
n_iter: usizeSweeps per fit while tuning.
seed: u64Seed for the row permutations.
Trait Implementations§
Source§impl<T: Clone> Clone for MultiCcaPermuteParams<T>
impl<T: Clone> Clone for MultiCcaPermuteParams<T>
Source§impl<T: Debug> Debug for MultiCcaPermuteParams<T>
impl<T: Debug> Debug for MultiCcaPermuteParams<T>
Source§impl<T: BixverseFloat> Default for MultiCcaPermuteParams<T>
impl<T: BixverseFloat> Default for MultiCcaPermuteParams<T>
Auto Trait Implementations§
impl<T> Freeze for MultiCcaPermuteParams<T>
impl<T> RefUnwindSafe for MultiCcaPermuteParams<T>
impl<T> Send for MultiCcaPermuteParams<T>
impl<T> Sync for MultiCcaPermuteParams<T>
impl<T> Unpin for MultiCcaPermuteParams<T>
impl<T> UnsafeUnpin for MultiCcaPermuteParams<T>
impl<T> UnwindSafe for MultiCcaPermuteParams<T>
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.