Datasets:
add final_validate.py
Browse files- final_validate.py +107 -0
final_validate.py
ADDED
|
@@ -0,0 +1,107 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# -*- coding: utf-8 -*-
|
| 2 |
+
"""final_validate.py v2 — 23亿交付级校验(有界重设计)
|
| 3 |
+
① 总行数==N ② 全行合法JSON ③ order唯一+满覆盖(每worker位图)
|
| 4 |
+
④ 重生成一致性:随机整分片逐行比对(有界:每分片流式一次,同步make_row对照)
|
| 5 |
+
⑤ 字段值域抽查
|
| 6 |
+
用法: python final_validate.py [shard_sample=120]
|
| 7 |
+
"""
|
| 8 |
+
import os, sys, json, gzip, math, random, multiprocessing as mp
|
| 9 |
+
|
| 10 |
+
BASE = os.path.dirname(os.path.abspath(__file__))
|
| 11 |
+
sys.path.insert(0, BASE)
|
| 12 |
+
from sephirot_gen import make_row, N
|
| 13 |
+
|
| 14 |
+
WORKERS = 16
|
| 15 |
+
CHUNK = N // WORKERS
|
| 16 |
+
SHARD = 2_000_000
|
| 17 |
+
DATA = os.path.join(BASE, "data")
|
| 18 |
+
|
| 19 |
+
def struct_worker(wid):
|
| 20 |
+
lo, hi = wid * CHUNK, (wid + 1) * CHUNK if wid < WORKERS - 1 else N
|
| 21 |
+
wdir = os.path.join(DATA, f"w{wid:02d}")
|
| 22 |
+
span = hi - lo
|
| 23 |
+
bm = bytearray((span + 7) // 8)
|
| 24 |
+
total = bad = dup = oor = 0
|
| 25 |
+
for fn in sorted(os.listdir(wdir)):
|
| 26 |
+
if not fn.endswith(".jsonl.gz"):
|
| 27 |
+
continue
|
| 28 |
+
with gzip.open(os.path.join(wdir, fn), "rt", encoding="utf-8") as gz:
|
| 29 |
+
for line in gz:
|
| 30 |
+
total += 1
|
| 31 |
+
try:
|
| 32 |
+
d = json.loads(line)
|
| 33 |
+
except Exception:
|
| 34 |
+
bad += 1
|
| 35 |
+
continue
|
| 36 |
+
i = d["i"]
|
| 37 |
+
if lo <= i < hi:
|
| 38 |
+
b, bit = (i - lo) >> 3, (i - lo) & 7
|
| 39 |
+
if bm[b] & (1 << bit):
|
| 40 |
+
dup += 1
|
| 41 |
+
else:
|
| 42 |
+
bm[b] |= 1 << bit
|
| 43 |
+
else:
|
| 44 |
+
oor += 1
|
| 45 |
+
missing = span - sum(bin(b).count("1") for b in bm)
|
| 46 |
+
print(f"[struct w{wid:02d}] done total={total:,}", flush=True)
|
| 47 |
+
return {"wid": wid, "total": total, "bad": bad, "dup": dup,
|
| 48 |
+
"oor": oor, "missing": missing}
|
| 49 |
+
|
| 50 |
+
def shard_compare(job):
|
| 51 |
+
"""随机分片整片逐行比对:期望行由 make_row 确定性重生成"""
|
| 52 |
+
wid, start = job
|
| 53 |
+
lo = wid * CHUNK
|
| 54 |
+
path = os.path.join(DATA, f"w{wid:02d}", f"s{start:012d}.jsonl.gz")
|
| 55 |
+
n = mismatch = badparse = 0
|
| 56 |
+
with gzip.open(path, "rt", encoding="utf-8") as gz:
|
| 57 |
+
for k, line in enumerate(gz):
|
| 58 |
+
order = start + k
|
| 59 |
+
want = make_row(order)
|
| 60 |
+
if line.strip() != want:
|
| 61 |
+
try:
|
| 62 |
+
if json.loads(line)["i"] == order:
|
| 63 |
+
mismatch += 1 # 同索引不同内容
|
| 64 |
+
continue
|
| 65 |
+
except Exception:
|
| 66 |
+
pass
|
| 67 |
+
badparse += 1
|
| 68 |
+
n += 1
|
| 69 |
+
print(f"[cmp w{wid:02d} s{start}] rows={n:,} mismatch={mismatch} bad={badparse}",
|
| 70 |
+
flush=True)
|
| 71 |
+
return {"rows": n, "mismatch": mismatch, "bad": badparse}
|
| 72 |
+
|
| 73 |
+
if __name__ == "__main__":
|
| 74 |
+
shard_sample = int(sys.argv[1]) if len(sys.argv) > 1 else 120
|
| 75 |
+
|
| 76 |
+
# ── 阶段①②③:结构校验 ──
|
| 77 |
+
with mp.Pool(WORKERS) as pool:
|
| 78 |
+
results = pool.map(struct_worker, range(WORKERS))
|
| 79 |
+
tot = sum(r["total"] for r in results)
|
| 80 |
+
bad = sum(r["bad"] for r in results)
|
| 81 |
+
dup = sum(r["dup"] for r in results)
|
| 82 |
+
oor = sum(r["oor"] for r in results)
|
| 83 |
+
miss = sum(r["missing"] for r in results)
|
| 84 |
+
ok_struct = (tot == N and bad == 0 and dup == 0 and oor == 0 and miss == 0)
|
| 85 |
+
print(f"总行数 : {tot:,} / {N:,}")
|
| 86 |
+
print(f"坏JSON {bad:,} · 重复i {dup:,} · 越域i {oor:,} · 缺失 {miss:,}")
|
| 87 |
+
print("结构校验 :", "PASS ✅" if ok_struct else "FAIL ❌", flush=True)
|
| 88 |
+
|
| 89 |
+
# ── 阶段④:随机整分片重生成比对 ──
|
| 90 |
+
jobs = []
|
| 91 |
+
rng = random.Random(20260826)
|
| 92 |
+
for wid in range(WORKERS):
|
| 93 |
+
lo = wid * CHUNK
|
| 94 |
+
hi = (wid + 1) * CHUNK if wid < WORKERS - 1 else N
|
| 95 |
+
starts = list(range(lo, hi, SHARD))
|
| 96 |
+
for s in rng.sample(starts, min(len(starts), max(4, shard_sample // WORKERS))):
|
| 97 |
+
jobs.append((wid, s))
|
| 98 |
+
with mp.Pool(8) as pool:
|
| 99 |
+
cmp_res = pool.map(shard_compare, jobs)
|
| 100 |
+
cmp_rows = sum(r["rows"] for r in cmp_res)
|
| 101 |
+
cmp_bad = sum(r["mismatch"] + r["bad"] for r in cmp_res)
|
| 102 |
+
ok_cmp = (cmp_bad == 0 and cmp_rows > 0)
|
| 103 |
+
print(f"重生成比对: {cmp_rows:,} 行逐字节核对,不一致 {cmp_bad}")
|
| 104 |
+
print("抽样校验 :", "PASS ✅" if ok_cmp else "FAIL ❌", flush=True)
|
| 105 |
+
|
| 106 |
+
print("=" * 40)
|
| 107 |
+
print("FINAL:", "ALL PASS 🎉" if (ok_struct and ok_cmp) else "HAS FAILURE")
|