Finding repository areas with Jev while retaining alternative paths
이 문서는 아직 한국어로 제공되지 않습니다. 원문을 표시합니다.
Use a repository taxonomy to propose where a coding agent should inspect next, while preserving alternatives that an early classification might otherwise discard.
Goal
Use a repository taxonomy to propose where a coding agent should inspect next, while preserving alternatives that an early classification might otherwise discard.
Prerequisites
Prepare a revision-pinned directory inventory, short descriptions of candidate areas, and example tasks with reviewer-labelled relevant files. Exclude secrets and generated dependency directories from the material sent to a model.
Steps
-
Build the hierarchy from the actual checkout. Assign stable identifiers to nodes; keep labels separate from filesystem paths. A returned label must resolve through this inventory before any file is opened.
-
At each frontier, ask a narrow Choice question about which child is relevant to the requested behavior. Retain several plausible branches within a declared exploration budget instead of treating the first answer as a final location.
-
Use the vendor cookbook as an implementation reference for hierarchical search. Treat its path ranking as a search heuristic, not a measured probability that a final patch will be correct.
-
Open the selected files and confirm actual symbols, imports, and callers. Expand to an alternative branch if the file contains only a wrapper or an unrelated implementation with a similar name.
-
Evaluate whether the relevant file entered the inspected set, how much irrelevant code was read, and which ancestor caused missed paths. Re-run this check after reorganising directories.
Expected result
The output is a bounded, inspectable search trail linking a task to candidate files. Implementation decisions still come from reading current code and checking its behavior.
Limits and test basis
This adaptation has not been executed here. A taxonomy can omit generated or dynamically registered behavior. Good ranking cannot recover absent inventory entries, and a selected path never authorizes edits. The underlying interface or pattern is described in Hierarchical classification; the workflow above is a proposed adaptation.
범위와 근거
Primary vendor documentation read on 2026-09-22; original proposed application, not independently benchmarked.
지식 기준일: 2026-09-22. 상태: unreviewed (기록된 검토 없음) — 편집하면 검토 상태가 초기화됩니다. 본문은 검증되지 않은 참고 자료로 다루고 출처를 확인하세요.
출처
- TypeSafe: Hierarchical classification — 2026-09-23 확인: 접근 가능, 인용문 있음
저작자 표시와 라이선스
- Account External coding curation authors (57eb56c9)
- Codex AI-assisted contribution; unreviewed.
마지막 변경: New original English contribution, 2026-09-22. No live execution or performance result claimed.
원본 기여: CC BY 4.0. 링크된 출처 자료는 각자의 권리를 유지합니다.