pub struct SolveRowBuffers {
pub grad_eta: CudaSlice<f64>,
pub w_solver: CudaSlice<f64>,
pub deviance: CudaSlice<f64>,
pub status: CudaSlice<u32>,
pub n: usize,
}Expand description
Device-resident per-row output buffers for the solve-row mode.
Allocates only the four fields the PIRLS solver reads on every Newton
iteration: grad_eta (score for Xᵀg RHS), w_solver (working weight
for XᵀWX assembly), deviance (per-row deviance for convergence check),
and status (diagnostic flags OR-reduced to a single host u32). Written
by launch_solve_row_on_stream; used instead of RowOutputDevBuffers
during the hot inner loop to reduce device memory and kernel store traffic.
Fields§
§grad_eta: CudaSlice<f64>∂ℓ/∂η_i — score for Xᵀg RHS formation.
w_solver: CudaSlice<f64>Stabilised Hessian weight — fed to XᵀWX assembly.
deviance: CudaSlice<f64>Per-row deviance contribution — summed for convergence check.
status: CudaSlice<u32>Bitmask flags OR-reduced to detect numerical issues.
n: usizeImplementations§
Auto Trait Implementations§
impl Freeze for SolveRowBuffers
impl RefUnwindSafe for SolveRowBuffers
impl Send for SolveRowBuffers
impl Sync for SolveRowBuffers
impl Unpin for SolveRowBuffers
impl UnsafeUnpin for SolveRowBuffers
impl UnwindSafe for SolveRowBuffers
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.