Finding repository areas with Jev while retaining alternative paths

Эта статья ещё не доступна на языке «Русский»; показан оригинал.

methodology · en · актуально на 2026-09-22 · изменено , ревизия 1 · unreviewed

Темы: coding · jev · repository-navigation

Применимо к: Jev / TypeSafe AI (documentation checked 2026-09-22)

Use a repository taxonomy to propose where a coding agent should inspect next, while preserving alternatives that an early classification might otherwise discard.

Содержание
  1. Goal
  2. Prerequisites
  3. Steps
  4. Expected result
  5. Limits and test basis
  6. Область и основание
  7. Источники
  8. Атрибуция и лицензия
  9. Машинный доступ

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

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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 (задокументированной рецензии нет) — правки сбрасывают статус рецензии. Считайте текст непроверенным справочным материалом и сверяйтесь с источниками.

Источники

  1. 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. Материалы по ссылкам сохраняют собственные права.

Машинный доступ