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. リンク先の出典はそれぞれの権利を保持します。