@@ -23,7 +23,7 @@ func (f *ftLU) clone() *ftLU {
2323 rlist : append ([]ftR (nil ), f .rlist ... ),
2424 nUpd : f .nUpd ,
2525 lPr : append ([]int (nil ), f .lPr ... ),
26- lFR : append ([]int32 (nil ), f .lFR ... ), lFV : append ([]float64 (nil ), f .lFV ... ),
26+ lFR : append ([]int32 (nil ), f .lFR ... ), lFV : append ([]float64 (nil ), f .lFV ... ),
2727 lPtr : append ([]int32 (nil ), f .lPtr ... ),
2828 uCol : make ([][]int32 , f .m ), uVal : make ([][]float64 , f .m ),
2929 ucRows : make ([][]int32 , f .m ),
@@ -47,12 +47,12 @@ func (f *ftLU) clone() *ftLU {
4747// keyed by stable orig rows, U by stable basis cols; "step" order remaps freely.
4848type ftLU struct {
4949 m int
50- lFR []int32 // flat L: step s eliminated rows, range [lPtr[s],lPtr[s+1])
51- lFV []float64 // matching L multipliers (contiguous, cache-friendly)
52- lPtr []int32 // step s -> start offset into lFR/lFV (len m+1)
53- lPr []int // factorize step s -> its pivot orig row (immutable)
54- udiag []float64 // udiag[s] = U[s][s]
55- uCol [][]int32 // step-row s -> basis cols c with rinvcol[c] > s
50+ lFR []int32 // flat L: step s eliminated rows, range [lPtr[s],lPtr[s+1])
51+ lFV []float64 // matching L multipliers (contiguous, cache-friendly)
52+ lPtr []int32 // step s -> start offset into lFR/lFV (len m+1)
53+ lPr []int // factorize step s -> its pivot orig row (immutable)
54+ udiag []float64 // udiag[s] = U[s][s]
55+ uCol [][]int32 // step-row s -> basis cols c with rinvcol[c] > s
5656 uVal [][]float64
5757 ucRows [][]int32 // basis col -> orig rows whose U row may hold it (lazy)
5858 prow []int // prow[step] = orig row
0 commit comments