{"record":{"id":"0e79294b52557d83","repo":"affaan-m/ECC","slug":"sample-seeds-must-be-unique","errorCode":null,"errorMessage":"sample seeds must be unique","messagePattern":"sample seeds must be unique","errorType":"validation","errorClass":"anyhow::Error","httpStatus":null,"severity":"error","filePath":"ecc2/src/harness_eval.rs","lineNumber":531,"sourceCode":"        if !self.min_win_rate.is_finite() || !(0.0..=1.0).contains(&self.min_win_rate) {\n            bail!(\"minimum win rate must be between 0 and 1\");\n        }\n        Ok(())\n    }\n\n    pub fn compare(self, samples: &[PairedSample]) -> Result<Comparison> {\n        self.validate()?;\n        if samples.is_empty() {\n            bail!(\"samples cannot be empty\");\n        }\n        if samples\n            .iter()\n            .map(|sample| sample.seed)\n            .collect::<BTreeSet<_>>()\n            .len()\n            != samples.len()\n        {\n            bail!(\"sample seeds must be unique\");\n        }\n        if samples.iter().any(|s| {\n            !s.candidate_score.is_finite()\n                || !s.baseline_score.is_finite()\n                || !(0.0..=1.0).contains(&s.candidate_score)\n                || !(0.0..=1.0).contains(&s.baseline_score)\n        }) {\n            bail!(\"scores must be finite and between 0 and 1\");\n        }\n        let count = samples.len();\n        let candidate_mean = samples.iter().map(|s| s.candidate_score).sum::<f64>() / count as f64;\n        let baseline_mean = samples.iter().map(|s| s.baseline_score).sum::<f64>() / count as f64;\n        let mean_delta = candidate_mean - baseline_mean;\n        let win_rate = samples\n            .iter()\n            .filter(|s| s.candidate_score > s.baseline_score)\n            .count() as f64\n            / count as f64;","sourceCodeStart":513,"sourceCodeEnd":549,"githubUrl":"https://github.com/affaan-m/ECC/blob/06c5e118c4d3e6c3b7f9445f973a2194c82de193/ecc2/src/harness_eval.rs#L513-L549","documentation":"compare enforces unique seeds across the paired samples (BTreeSet size vs slice length), mirroring the seed-uniqueness rule of evaluate_paired. It guards the compare path against callers assembling samples by hand with duplicated seeds.","triggerScenarios":"Thrown at ecc2/src/harness_eval.rs:531 when the library encounters an invalid state.","commonSituations":"See trigger scenarios.","solutions":["Deduplicate sample seeds; each sample must use a distinct seed.","Check the seed assignment loop for repeated values."],"exampleFix":null,"handlingStrategy":"validation","validationCode":null,"typeGuard":null,"tryCatchPattern":null,"preventionTips":[],"tags":[],"backgroundTag":null,"analyzedSha":"06c5e118c4d3e6c3b7f9445f973a2194c82de193","analyzedAt":"2026-08-18T11:27:13.915Z","contentChangedAt":null,"schemaVersion":2},"datasetVersion":"2026-09-14T05:17:10.506Z"}