perf(배수유역): 342-3 빠른 길 — 흐름 방향 큰 격자 한 번 · 도로 닿음 판정 한꺼번에

- 하강 방향장 = 해석 격자 둘레 400 m 큰 격자로 한 번 짓고 회차마다 잘라 씀(crop_descent) · 넘으면 그때 다시 지음
- classify_flow 한 칸씩 걷기 → 포인터 더블링(_reach_by_doubling) · 기록용 출발 셀 수는 최외곽 · 나머지 셀 수로
- 거울 시험 test_342_3_watershed_fast(옛 걷기와 칸마다 같음 · 잘라 씀 안쪽 같음) · 실측 bench_342_watershed
- 검증_sub3 실측: 적색 차이 0칸 · 도로 귀속 · 강도 · 관 자리 같음 · 108 → 27 s(붐빈 랩탑 · 340 기준 약 15 s)

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01XWh5wNNycMkbwMpACz1rte
This commit is contained in:
2026-10-16 11:01:28 +09:00
co-authored by Claude Opus 5.5
parent 2879f9bea9
commit 0efc77380e
4 changed files with 349 additions and 65 deletions
+94
View File
@@ -0,0 +1,94 @@
"""342-3 · 347-1 배수유역 빠른 길 실측 — 검증_sub3 도엽 · 노선으로 preview_stages 를 돌려
시간과 결과(적색 · 흐름 방향 · 도로 귀속 · 강도)를 tmp/342/<이름>.npz 에 남기고 기준과 대조한다.
./venv/Scripts/python.exe resources/tester/bench_342_watershed.py base # 기준 저장
./venv/Scripts/python.exe resources/tester/bench_342_watershed.py new base # 새로 돌려 대조
pytest 대상 아님(DB · 프로젝트 파일이 있어야 돎). 저장 안 함 — 프로젝트 파일은 읽기만
(흐름 방향 저장본 drainage/descent_*.npz 는 347-1 부터 씀).
"""
import asyncio
import json
import logging
import sys
import time
from pathlib import Path
from uuid import UUID
import numpy as np
ROOT = Path(__file__).resolve().parents[2]
sys.path.insert(0, str(ROOT))
PID = UUID("1f93a515-df0a-4975-a8ba-daaa7672b123") # 검증_sub3
OUT_DIR = ROOT / "tmp" / "342"
async def _prepare():
from config.config_db import close_db_pool, init_db_pool
await init_db_pool()
try:
from B04_PreProcess.B04_PreProcess_Router_Watershed import _prepare as prepare
started = time.perf_counter()
prepared = await prepare(PID)
return prepared, time.perf_counter() - started
finally:
await close_db_pool()
def main() -> None:
name = sys.argv[1]
base = sys.argv[2] if len(sys.argv) > 2 else None
OUT_DIR.mkdir(parents=True, exist_ok=True)
logging.basicConfig(
level=logging.INFO,
format="%(asctime)s %(name)s:%(message)s",
handlers=[logging.FileHandler(OUT_DIR / f"{name}.log", "w", encoding="utf-8")],
)
prepared, prepare_s = asyncio.run(_prepare())
from B04_PreProcess.B04_PreProcess_Engine_Watershed_Analyze import preview_stages
started = time.perf_counter()
pv = preview_stages(prepared["vertices"], prepared["contours"], prepared["streams"])
preview_s = time.perf_counter() - started
spec = pv.spec
red = pv.flow.reaches_road & pv.flow.analyzed
result = {
"spec": np.array([spec.x_min, spec.y_max, spec.cell_m, spec.n_rows, spec.n_cols]),
"domain": pv.domain,
"red": red,
"direction": pv.flow.direction,
"road_slot": pv.routing.road_slot,
"strength": np.array(pv.strength_profile),
"pipes": np.array([p.chainage_m for p in pv.pipes]),
}
np.savez_compressed(OUT_DIR / f"{name}.npz", **result)
report = {
"prepare_s": round(prepare_s, 2),
"preview_s": round(preview_s, 2),
"total_s": round(prepare_s + preview_s, 2),
"rounds": pv.expand_rounds,
"grid": [spec.n_rows, spec.n_cols],
"red_cells": int(red.sum()),
}
if base:
ref = np.load(OUT_DIR / f"{base}.npz")
same_spec = bool(np.array_equal(ref["spec"], result["spec"]))
report["same_spec"] = same_spec
if same_spec:
for key in ("domain", "red", "direction", "road_slot"):
report[f"diff_{key}"] = int((ref[key] != result[key]).sum())
else:
report["base_spec"] = ref["spec"].tolist()
report["new_spec"] = result["spec"].tolist()
report["red_cells_base"] = int(ref["red"].sum())
report["same_strength"] = bool(np.array_equal(ref["strength"], result["strength"]))
report["same_pipes"] = bool(np.array_equal(ref["pipes"], result["pipes"]))
print(json.dumps(report, ensure_ascii=False))
(OUT_DIR / f"{name}.json").write_text(json.dumps(report, ensure_ascii=False, indent=1), "utf-8")
if __name__ == "__main__":
main()
@@ -0,0 +1,138 @@
"""342-3 배수유역 빠른 길 — 도로 닿음 판정 한꺼번에 · 큰 방향장 잘라 씀.
- 판정: 옛 한 칸씩 걷기(최외곽 출발 → 내부 보충 · 색 물려받기)와 칸마다 같음(적색 차이 0).
- 잘라 씀: 같은 격자면 그대로 · 셀 어긋남 · 범위 밖은 None · 안쪽은 제 격자로 지은 것과 같음.
실측(검증_sub3 · 적색 차이 0 · 60 → 약 15 s)은 bench_342_watershed.py.
"""
import math
import numpy as np
from B04_PreProcess.B04_PreProcess_Engine_Watershed_Descent import build_contour_descent
from B04_PreProcess.B04_PreProcess_Engine_Watershed_Expand import _pad_spec, crop_descent
from B04_PreProcess.B04_PreProcess_Engine_Watershed_Flow import (
_reach_by_doubling,
outermost_cells,
)
from B04_PreProcess.B04_PreProcess_Engine_Watershed_Grid import GridSpec
def _walk_reference(receiver, valid2d, absorbing, stream):
"""옛 classify_flow 판정(한 칸씩 걷기) 그대로."""
valid = valid2d.reshape(-1)
reaches = np.zeros(receiver.size, bool)
state = np.zeros(receiver.size, np.int8)
reaches[stream] = True
state[stream] = 2
starts = list(np.flatnonzero(outermost_cells(valid2d))) + list(np.flatnonzero(valid))
for start in starts:
if state[start] == 2:
continue
path, node = [], start
while True:
if state[node] == 2:
verdict = bool(reaches[node])
break
if state[node] == 1:
verdict = False
break
state[node] = 1
path.append(node)
if absorbing[node]:
verdict = True
break
following = int(receiver[node])
if following == node:
verdict = False
break
if not valid[following] and state[following] != 2:
verdict = False
break
node = following
for visited in path:
reaches[visited] = verdict
state[visited] = 2
return reaches
def _random_case(seed, rows=60, cols=70):
rng = np.random.default_rng(seed)
size = rows * cols
potential = rng.random(size)
index = np.arange(size)
r, c = index // cols, index % cols
receiver = index.copy()
best = potential.copy()
for dr in (-1, 0, 1):
for dc in (-1, 0, 1):
nr, nc = r + dr, c + dc
ok = (nr >= 0) & (nr < rows) & (nc >= 0) & (nc < cols)
n = np.where(ok, nr * cols + nc, index)
better = ok & (potential[n] < best)
best = np.where(better, potential[n], best)
receiver = np.where(better, n, receiver)
valid2d = rng.random((rows, cols)) > 0.15
road = np.zeros(size, bool)
road[(r == rows // 2) & (c > 5) & (c < cols - 5)] = True
stream = (rng.random(size) > 0.97) & ~road # 표고 없는 세류 셀도 섞임
# 세류 셀은 물길 다음 셀로 새김 — 순환 하나를 일부러 만든다(걷던 판정 = 미도달).
receiver = receiver.astype(np.int32)
receiver[stream] = np.roll(index, 1)[stream]
receiver[5 * cols + 5], receiver[5 * cols + 6] = 5 * cols + 6, 5 * cols + 5
absorbing = (road & valid2d.reshape(-1)) | stream
return receiver, valid2d, absorbing, stream
def test_reach_matches_walk_cell_by_cell():
for seed in range(8):
receiver, valid2d, absorbing, stream = _random_case(seed)
expected = _walk_reference(receiver, valid2d, absorbing, stream)
got = _reach_by_doubling(receiver, valid2d.reshape(-1), absorbing, stream)
assert int((got != expected).sum()) == 0, seed
assert expected.sum() > 0 and (~expected).sum() > 0
def _circle_contours(cx, cy, radii_levels):
features = []
for radius, level in radii_levels:
coords = [
[cx + radius * math.cos(t), cy + radius * math.sin(t)]
for t in np.linspace(0, 2 * math.pi, 181)
]
features.append(
{
"geometry": {"type": "LineString", "coordinates": coords},
"properties": {"elevation": level},
}
)
return features
def test_crop_descent_matches_own_grid_inside():
contours = _circle_contours(100.0, -100.0, [(r, 200.0 - r) for r in range(10, 140, 10)])
spec = GridSpec(x_min=40.0, y_max=-40.0, cell_m=1.0, n_rows=120, n_cols=120)
big_spec, _ = _pad_spec(spec, np.ones((120, 120), bool), 30)
big = build_contour_descent(big_spec, contours)
own = build_contour_descent(spec, contours)
cut = crop_descent(big, spec)
assert cut is not None and cut.spec == spec
inner = np.zeros((120, 120), bool)
inner[20:100, 20:100] = True
flat = inner.reshape(-1)
assert np.array_equal(cut.valid[inner], own.valid[inner])
assert np.array_equal(cut.receiver[flat], own.receiver[flat])
assert np.array_equal(cut.azimuth[flat], own.azimuth[flat])
# 잘린 몫 밖을 가리키는 셀은 없다(제자리로 둠).
assert cut.receiver.min() >= 0 and cut.receiver.max() < spec.size
assert crop_descent(big, big_spec) is big
def test_crop_descent_refuses_misaligned_or_outside():
contours = _circle_contours(100.0, -100.0, [(r, 200.0 - r) for r in range(10, 140, 10)])
spec = GridSpec(x_min=40.0, y_max=-40.0, cell_m=1.0, n_rows=50, n_cols=50)
big = build_contour_descent(spec, contours)
shifted = GridSpec(x_min=40.5, y_max=-40.0, cell_m=1.0, n_rows=20, n_cols=20)
outside = GridSpec(x_min=30.0, y_max=-40.0, cell_m=1.0, n_rows=20, n_cols=20)
assert crop_descent(big, shifted) is None
assert crop_descent(big, outside) is None