Datasets:
File size: 10,437 Bytes
b10c2aa 326c447 b10c2aa 8900b7c a69b31b 8900b7c eac8c48 a69b31b eac8c48 ef4acbc | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 | """Tests for the sparam-conformance corpus.
The load-bearing tests verify the LABELS, not the checker. A corpus whose
ground truth is wrong is worse than no corpus, because every checker scored
against it inherits the error. Each label is therefore re-derived here from
the network itself by independent linear algebra.
"""
from __future__ import annotations
import hashlib
import subprocess
import sys
from pathlib import Path
import numpy as np
import pytest
HERE = Path(__file__).resolve().parents[1]
sys.path.insert(0, str(HERE))
sys.path.insert(0, str(HERE.parent / "sparam-lint" / "src"))
from sparam_lint import read_touchstone # noqa: E402
from generate import LAWS # noqa: E402
from score import load_manifest, score # noqa: E402
DATA = HERE / "data"
MANIFEST = load_manifest(DATA)
def _read(name):
case = next(c for c in MANIFEST["cases"] if c["name"] == name)
return read_touchstone(DATA / case["file"]), case
# --------------------------------------------------- labels re-derived, not trusted
@pytest.mark.parametrize("case", MANIFEST["cases"], ids=lambda c: c["name"])
def test_passivity_label_matches_independent_svd(case):
net = read_touchstone(DATA / case["file"])
sig = max(np.linalg.svd(m, compute_uv=False)[0] for m in net.s)
assert case["expect"]["passivity"] == bool(sig <= 1.0 + 1e-9), (
f"{case['name']}: label says passivity={case['expect']['passivity']} "
f"but sigma_max={sig:.6f}"
)
@pytest.mark.parametrize("case", MANIFEST["cases"], ids=lambda c: c["name"])
def test_reciprocity_label_matches_independent_asymmetry(case):
net = read_touchstone(DATA / case["file"])
asym = max(
np.linalg.norm(m - m.T, "fro") / max(np.linalg.norm(m, "fro"), 1e-300)
for m in net.s
)
assert case["expect"]["reciprocity"] == bool(asym <= 1e-6), (
f"{case['name']}: label says reciprocity={case['expect']['reciprocity']} "
f"but asymmetry={asym:.3e}"
)
@pytest.mark.parametrize("case", MANIFEST["cases"], ids=lambda c: c["name"])
def test_energy_label_matches_independent_row_power(case):
net = read_touchstone(DATA / case["file"])
rowp = max(np.sum(np.abs(m) ** 2, axis=1).max() for m in net.s)
assert case["expect"]["energy_conservation"] == bool(rowp <= 1.0 + 1e-9), (
f"{case['name']}: label says energy={case['expect']['energy_conservation']} "
f"but max row power={rowp:.6f}"
)
def test_physical_cases_pass_every_law_except_declared_exceptions():
"""A case marked physical must pass all five laws, unless it is explicitly
tagged as a real device that legitimately fails one (e.g. an isolator)."""
for c in MANIFEST["cases"]:
if not c["physical"]:
continue
fails = [k for k, v in c["expect"].items() if not v]
if fails:
assert "expected_law_failure" in c["tags"], (
f"{c['name']} is marked physical and fails {fails} but is not "
"tagged expected_law_failure"
)
def test_at_least_one_case_isolates_a_single_law():
"""Without an isolating case you cannot tell which check is alive."""
isolating = [c for c in MANIFEST["cases"]
if sum(1 for v in c["expect"].values() if not v) == 1
and not c["physical"]]
assert isolating, "corpus needs a case that breaks exactly one law"
def test_corpus_covers_every_law_in_both_directions():
for law in LAWS:
passes = [c for c in MANIFEST["cases"] if c["expect"][law]]
fails = [c for c in MANIFEST["cases"] if not c["expect"][law]]
assert passes, f"no case where {law} passes"
assert fails, f"no case where {law} fails"
# ------------------------------------------------------------------- integrity
def test_files_match_recorded_hashes():
for c in MANIFEST["cases"]:
digest = hashlib.sha256((DATA / c["file"]).read_bytes()).hexdigest()
assert digest == c["sha256"], f"{c['file']} changed since manifest was written"
def test_generation_is_deterministic(tmp_path):
"""Regenerating must reproduce byte-identical files."""
subprocess.run([sys.executable, str(HERE / "generate.py"),
"--out", str(tmp_path)], check=True, cwd=HERE,
capture_output=True)
for c in MANIFEST["cases"]:
a = (DATA / c["file"]).read_bytes()
b = (tmp_path / c["file"]).read_bytes()
assert a == b, f"{c['file']} is not reproducible"
def test_multiport_case_present():
ports = {c["n_ports"] for c in MANIFEST["cases"]}
assert ports - {2}, "corpus must exercise N>2"
# ---------------------------------------------------------------------- scorer
def _perfect(path):
case = next(c for c in MANIFEST["cases"] if c["file"] == Path(path).name)
return dict(case["expect"])
def _always_pass(path):
return {law: True for law in LAWS}
def _always_fail(path):
return {law: False for law in LAWS}
def test_scorer_gives_perfect_checker_a_clean_sheet():
r = score(_perfect, MANIFEST, DATA)
assert r["false_pass"] == 0 and r["false_fail"] == 0 and r["passed"]
def test_scorer_catches_permissive_checker():
"""The one that matters: a checker that admits everything must NOT pass."""
r = score(_always_pass, MANIFEST, DATA)
assert r["false_pass"] > 0
assert not r["passed"], "a permissive checker must never be CONFORMING"
def test_conservative_checker_has_no_false_passes_but_many_false_fails():
r = score(_always_fail, MANIFEST, DATA)
assert r["false_pass"] == 0
assert r["false_fail"] > 0
assert r["passed"], "a conservative checker is safe, so it conforms"
def test_scorer_records_checker_errors_without_crashing():
def boom(path):
raise RuntimeError("nope")
r = score(boom, MANIFEST, DATA)
assert r["checker_errors"] == len(MANIFEST["cases"])
assert not r["passed"]
def test_scorer_rejects_wrong_return_type():
r = score(lambda p: "not a dict", MANIFEST, DATA)
assert r["checker_errors"] == len(MANIFEST["cases"])
def test_missing_law_is_reported_not_silently_passed():
def partial(path):
return {"passivity": True}
r = score(partial, MANIFEST, DATA)
assert all(c["missing_laws"] for c in r["per_case"])
# ------------------------------------------- the reference adapter really works
def test_reference_adapter_conforms():
from sparam_lint_adapter import check
r = score(check, MANIFEST, DATA)
assert r["checker_errors"] == 0
assert r["false_pass"] == 0, f"sparam-lint false passes: {r['per_case']}"
assert r["passed"]
# ------------------------------------------------------- viewer index
def test_index_matches_the_manifest_exactly():
"""The browsable index is a view of the manifest, never a second source."""
import json as _json
import subprocess
import sys as _sys
here = Path(__file__).resolve().parents[1]
idx = here / "data" / "index.jsonl"
assert idx.exists(), "index.jsonl missing -- run build_index.py"
rows = [_json.loads(x) for x in idx.read_text(encoding="utf-8").splitlines() if x.strip()]
man = _json.loads((here / "data" / "manifest.json").read_text(encoding="utf-8"))
assert len(rows) == len(man["cases"]) == man["n_cases"]
by_name = {r["name"]: r for r in rows}
for c in man["cases"]:
r = by_name[c["name"]]
assert r["physically_realizable"] == c["physical"]
assert r["expected_failures"] == sorted(
k for k, v in c["expect"].items() if not v)
# and it must regenerate identically
before = idx.read_bytes()
subprocess.run([_sys.executable, str(here / "build_index.py")],
capture_output=True, check=True)
assert idx.read_bytes() == before, "index.jsonl is stale vs the manifest"
def test_readme_flags_the_one_figure_it_cannot_reproduce():
"""1.2441 is a pre-fix value from a superseded generator revision.
Every other number on the card re-derives from the committed corpus. This
one does not, so the card has to say so -- and the resonator it describes
must actually be passive today, or the anecdote is worse than the bug.
"""
readme = (HERE / "README.md").read_text(encoding="utf-8")
assert "1.2441" in readme, "drop this guard along with the figure"
assert "cannot reproduce from the" in readme
assert "superseded generator revision" in readme
net = read_touchstone(str(HERE / "data" / "passive_resonator.s2p"))
sigma = float(np.max(np.linalg.svd(net.s, compute_uv=False)))
assert sigma <= 1.0 + 1e-9, f"shipped resonator is not passive: {sigma}"
# ------------------------------------- an unreported law must not be a pass
def _score_with(fn):
from score import load_manifest, score
return score(fn, load_manifest())
def test_a_checker_that_omits_a_law_is_incomplete_not_conforming():
"""The corpus cannot certify a law the checker never reported."""
from sparam_lint_adapter import check as complete
def missing_passivity(path):
return {k: v for k, v in complete(path).items() if k != "passivity"}
full = _score_with(complete)
assert full["verdict"] == "CONFORMING" and full["passed"]
assert full["n_missing"] == 0
partial = _score_with(missing_passivity)
assert partial["false_pass"] == 0, "the omission is not a false pass"
assert partial["n_missing"] == full["n_cases"], "one law short on every case"
assert partial["verdict"] == "INCOMPLETE", (
"a checker missing a whole law was told it conforms"
)
assert not partial["passed"], "INCOMPLETE must not exit 0"
def test_a_false_pass_still_outranks_incompleteness():
"""Admitting a non-physical network is the worse failure and keeps its name."""
def permissive_and_partial(path):
return {"reciprocity": True, "energy_conservation": True,
"positive_real_z0": True, "group_delay_nonneg": True,
"passivity": True} # passes everything, including the violators
r = _score_with(permissive_and_partial)
assert r["false_pass"] > 0
assert r["verdict"] == "NOT CONFORMING"
def test_readme_verdict_table_matches_the_scorer():
readme = (HERE / "README.md").read_text(encoding="utf-8")
for verdict in ("CONFORMING", "INCOMPLETE", "NOT CONFORMING"):
assert f"`{verdict}`" in readme, f"README does not document the {verdict} verdict"
|