//! PERF-2 P1.1 (`docs/perf2_campaign.md`): the cached multigrid-PCG (the
//! operator's hierarchy, fine level and components kept across solves)
//! must give the uncached solve's answer BIT FOR BIT — a masked,
//! outlet-anchored problem like the overset background's, five right-hand
//! sides in a row on one operator, then a one-coefficient change that
//! must miss the cache and still match.

use rtx_cfd::solvers::incompressible::{
    MgPrecision, MultigridParameters, PcgCache, PoissonProblem, solve_multigrid_pcg,
    solve_multigrid_pcg_cached,
};

fn problem(nx: usize, ny: usize, seed: u64) -> PoissonProblem {
    let mut p = PoissonProblem::new(nx, ny);
    let (dx, dy, dt) = (1.0 / nx as f64, 0.41 / ny as f64, 1e-3);
    let (ae, an) = (dt * dy / dx, dt * dx / dy);
    let hole = |i: usize, j: usize| {
        let (x, y) = ((i as f64 + 0.5) * dx, (j as f64 + 0.5) * dy);
        (x - 0.2).powi(2) + (y - 0.2).powi(2) < 0.05 * 0.05
    };
    for j in 0..ny {
        for i in 0..nx {
            let idx = j * nx + i;
            if hole(i, j) {
                p.active[idx] = false;
                continue;
            }
            if i + 1 < nx && !hole(i + 1, j) {
                p.ae[idx] = ae;
            }
            if i > 0 && !hole(i - 1, j) {
                p.aw[idx] = ae;
            }
            if j + 1 < ny && !hole(i, j + 1) {
                p.an[idx] = an;
            }
            if j > 0 && !hole(i, j - 1) {
                p.as_[idx] = an;
            }
            if i + 1 == nx {
                p.extra_diag[idx] = 2.0 * ae; // the outlet
            }
        }
    }
    let mut state = seed | 1;
    for idx in 0..nx * ny {
        state ^= state << 13;
        state ^= state >> 7;
        state ^= state << 17;
        p.rhs[idx] = if p.active[idx] {
            1e-6 * ((state >> 11) as f64 / (1u64 << 53) as f64 - 0.5)
        } else {
            0.0
        };
    }
    p
}

fn same(a: &[f64], b: &[f64]) -> bool {
    a.len() == b.len() && a.iter().zip(b).all(|(x, y)| x.to_bits() == y.to_bits())
}

#[test]
fn cached_pcg_reproduces_the_uncached_solve_bit_for_bit() {
    let (nx, ny) = (96, 40);
    for precision in [MgPrecision::F64, MgPrecision::F32] {
        let params = MultigridParameters {
            precision,
            ..MultigridParameters::default()
        };
        let mut cache = PcgCache::default();
        let base = problem(nx, ny, 7);
        for k in 0..5u64 {
            // Same operator, a new right-hand side each time.
            let mut prob = base.clone();
            prob.rhs = problem(nx, ny, 11 + k).rhs;
            let (mut p0, mut p1) = (vec![0.0; nx * ny], vec![0.0; nx * ny]);
            let s0 = solve_multigrid_pcg(&prob, &mut p0, &params, 1e-12, None);
            let s1 = solve_multigrid_pcg_cached(&prob, &mut p1, &params, 1e-12, None, &mut cache);
            assert_eq!(cache.len(), 1);
            assert!(same(&p0, &p1), "{precision:?} rhs {k}: solutions differ");
            assert_eq!(s0.iterations, s1.iterations);
            assert_eq!(s0.residual.to_bits(), s1.residual.to_bits());
            if k > 0 {
                assert!(
                    s1.setup_ns < s0.setup_ns / 4,
                    "{precision:?} rhs {k}: cache hit should skip the setup ({} vs {} ns)",
                    s1.setup_ns,
                    s0.setup_ns
                );
            }
            println!(
                "  {precision:?} rhs {k}: {} iterations, residual {:.3e}, setup {} vs {} ns",
                s0.iterations, s0.residual, s0.setup_ns, s1.setup_ns
            );
        }
        // One coefficient changes: a miss, still exact.
        let mut changed = base.clone();
        let idx = (ny / 2) * nx + nx / 3;
        changed.ae[idx] *= 1.5;
        changed.aw[idx + 1] *= 1.5;
        let (mut p0, mut p1) = (vec![0.0; nx * ny], vec![0.0; nx * ny]);
        let s0 = solve_multigrid_pcg(&changed, &mut p0, &params, 1e-12, None);
        let s1 = solve_multigrid_pcg_cached(&changed, &mut p1, &params, 1e-12, None, &mut cache);
        assert!(
            same(&p0, &p1),
            "{precision:?}: the changed operator's solutions differ"
        );
        assert_eq!(s0.iterations, s1.iterations);
        // And back to the base operator: a miss again (the cache holds one), still exact.
        let (mut p0, mut p1) = (vec![0.0; nx * ny], vec![0.0; nx * ny]);
        let s0 = solve_multigrid_pcg(&base, &mut p0, &params, 1e-12, None);
        let s1 = solve_multigrid_pcg_cached(&base, &mut p1, &params, 1e-12, None, &mut cache);
        assert!(same(&p0, &p1));
        assert_eq!(s0.iterations, s1.iterations);
    }
}