Best-pool scoring used to always blend the archive's inner file names into the fuzzy score (0.95 discount), which dragged clean-named files into wrong units (e.g. 'Keeper of Secrets & Shalaxi Helbane.7z' ended in Orks/Boyz). Now the outer name decides when it scores >= threshold; inner names only vote as fallback (hash-named gofile archives rely on that). Also: url/failed-list run artifacts are excluded from sorting, and two plan-inspection helpers under tools/.
23 lines
824 B
Python
23 lines
824 B
Python
#!/usr/bin/env python3
|
|
"""Summarize a sorter plan JSON: match kinds, top targets, oddities."""
|
|
import json
|
|
import sys
|
|
from collections import Counter
|
|
from pathlib import Path
|
|
|
|
plan = json.loads(Path(sys.argv[1]).read_text())
|
|
print(f"files: {len(plan)}")
|
|
print("kinds:", Counter(p["kind"] for p in plan))
|
|
print("actions:", Counter(p.get("action", "?") for p in plan))
|
|
# system breakdown
|
|
print("systems:", Counter(p["system"] for p in plan).most_common(10))
|
|
# top-level targets
|
|
roots = Counter(str(Path(p["target"]).relative_to(
|
|
Path(p["target"]).parents[3])) if len(Path(p["target"]).parents) > 3
|
|
else p["target"] for p in plan)
|
|
for root, n in roots.most_common(15):
|
|
print(f" {n:5d} {root}")
|
|
# anything with empty target?
|
|
empties = [p for p in plan if not p.get("target")]
|
|
print("empty targets:", len(empties))
|