pub struct SharedTangentRemlRequest {
pub design: DesignMatrix,
pub response: Array2<f64>,
pub weights: Array1<f64>,
pub fisher_metric: Option<Array3<f64>>,
pub penalties: Vec<SharedTangentPenalty>,
pub initial_log_lambdas: Option<Array1<f64>>,
}Expand description
Owned request for a shared-tangent REML fit.
design may be dense, sparse, or operator-backed. The fit consumes it
through bounded row chunks and therefore does not force materialization.
Fields§
§design: DesignMatrix§response: Array2<f64>§weights: Array1<f64>§fisher_metric: Option<Array3<f64>>§penalties: Vec<SharedTangentPenalty>§initial_log_lambdas: Option<Array1<f64>>Optional log-lambda seed in the original penalties order.
Implementations§
pub fn new( design: DesignMatrix, response: Array2<f64>, weights: Array1<f64>, fisher_metric: Option<Array3<f64>>, penalties: Vec<SharedTangentPenalty>, ) -> Self
Sourcepub fn from_dense(
design: Array2<f64>,
response: Array2<f64>,
weights: Array1<f64>,
fisher_metric: Option<Array3<f64>>,
penalties: Vec<SharedTangentPenalty>,
) -> Self
pub fn from_dense( design: Array2<f64>, response: Array2<f64>, weights: Array1<f64>, fisher_metric: Option<Array3<f64>>, penalties: Vec<SharedTangentPenalty>, ) -> Self
Convenience constructor for an owned dense design.
pub fn with_initial_log_lambdas(self, initial: Array1<f64>) -> Self
Trait Implementations§
Source§fn clone(&self) -> SharedTangentRemlRequest
fn clone(&self) -> SharedTangentRemlRequest
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
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.