pub struct CauseSpecificRowProgram { /* private fields */ }Expand description
Production gam_math::jet_tower::RowProgram for one cause-specific
Royston-Parmar row.
The generic evaluator and the live specialized order-2/third/fourth
lowerings are all emitted from cause_specific_row. Predictor values are
ordered as exit index, entry index, and positive spline derivative; entry
and event activity remain row constants.
Implementations§
Trait Implementations§
Source§impl RowProgram<3> for CauseSpecificRowProgram
impl RowProgram<3> for CauseSpecificRowProgram
Source§fn primaries(&self, row: usize) -> Result<[f64; 3], String>
fn primaries(&self, row: usize) -> Result<[f64; 3], String>
Current primary-scalar values for
row (where to seed the scalar).Source§fn eval<S: JetScalar<3>>(&self, row: usize, p: &[S; 3]) -> Result<S, String>
fn eval<S: JetScalar<3>>(&self, row: usize, p: &[S; 3]) -> Result<S, String>
The row NLL evaluated on a generic jet scalar.
p[a] arrives pre-seeded
(base value + per-scalar nilpotent directions) by the caller; the body
uses ONLY crate::jet_scalar::JetScalar ops and per-row data (response,
censoring, offsets) entering as constants.Auto Trait Implementations§
impl Freeze for CauseSpecificRowProgram
impl RefUnwindSafe for CauseSpecificRowProgram
impl Send for CauseSpecificRowProgram
impl Sync for CauseSpecificRowProgram
impl Unpin for CauseSpecificRowProgram
impl UnsafeUnpin for CauseSpecificRowProgram
impl UnwindSafe for CauseSpecificRowProgram
Blanket Implementations§
impl<T> Allocation for T
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> 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.