Struct FixedDesignGramCache 

pub struct FixedDesignGramCache { /* private fields */ }

Gaussian / constant-W sufficient statistics for a fixed design.

This stores X'WX, X'W(y - offset), and (y - offset)'W(y - offset) so per-lambda assembly and RSS/evidence terms are n-free. It generalizes the constant-design idea beyond the existing Gaussian+identity-only cache while keeping the same fixed-W requirement for this lane.

Implementations

impl FixedDesignGramCache

pub fn build( x: ArrayView2<'_, f64>, y: ArrayView1<'_, f64>, offset: Option<ArrayView1<'_, f64>>, weights: Option<ArrayView1<'_, f64>>, ) -> Result<Self, String>

Build fixed-design Gaussian sufficient statistics.

The right-hand side is routed through fast_xt_diag_y, the same weighted contraction primitive used by the runtime recompute path.

pub fn n(&self) -> usize

pub fn p(&self) -> usize

pub fn xtwx(&self) -> ArrayView2<'_, f64>

pub fn xtwy(&self) -> ArrayView1<'_, f64>

pub fn ywy(&self) -> f64

pub fn penalized_normal_matrix( &self, penalty: ArrayView2<'_, f64>, ) -> Result<Array2<f64>, String>

Assemble X'WX + S for the inner solver without revisiting design rows.

pub fn penalized_rss(&self, beta: ArrayView1<'_, f64>) -> Result<f64, String>

Compute penalty-free weighted RSS from sufficient statistics.