naudachu
9480e48312
The plugin resolved its issue store from `__file__`, which put it inside a versioned plugin cache: issues written from one project were invisible from the next, and `origin: local` files — the only copy of that work by definition — were stranded a version bump at a time. The walk that answers "which directory is the project" was written three times over, and in a linked worktree the three disagreed. Both are runtime failures rather than logic ones, so the fix is a compiled binary: one walk, imported rather than re-derived, and a layering rule the build graph enforces instead of a grep. Seven packages, knowledge flowing one way. `project` answers which directory is the project and depends on nothing. `issue` is the domain — format, taxonomy, validation, checkboxes, dependency graph, the store, eviction — offline, with no tracker in it. `wire` holds the protocol shapes. `gitea` is the transport, `mapping` the bridge, `config` the credentials, `cmd` the command tree. Four tests hold the boundaries, each failing on a real mistake rather than a naming convention. The marker moves to `.kettle/` and the login pin moves out of the harness's settings file into `.kettle/config.yaml`, which pins a login by NAME; the tokens live in one file per machine, mode 0600, outside every working tree. That retires the PreToolUse guard hook entirely — the binary holds its own credentials, so a command running under a login nobody chose is not expressible rather than caught. `kettle init` migrates an older `tmp/issues` or `.tea/issues` store in, as a move: a store left behind at an old path is one somebody edits by accident months later. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
60 lines
1.4 KiB
Go
60 lines
1.4 KiB
Go
package issue
|
|
|
|
import (
|
|
"regexp"
|
|
"strings"
|
|
)
|
|
|
|
// A reference is a slug, or `#N` on an issue that came from a tracker.
|
|
var depRefRe = regexp.MustCompile(`#(\d+)|\b([a-z0-9]+(?:-[a-z0-9]+)+)\b`)
|
|
|
|
// DepRef is one dependency reference written in the body prose, carried out
|
|
// with the section it was found in.
|
|
//
|
|
// The section travels with the reference so a caller can name the one the
|
|
// reader actually has in front of them: a container's children come from
|
|
// `## Issues`, and pointing at `## Depends on` would name a section that is not
|
|
// in the file.
|
|
type DepRef struct {
|
|
Section string
|
|
Ref string
|
|
}
|
|
|
|
// BodyDepRefs returns every reference under one of DepSections, deduplicated
|
|
// on first sight, in order of first appearance.
|
|
//
|
|
// Never from prose elsewhere, or a graph walk would drag in half the backlog.
|
|
func BodyDepRefs(body string) []DepRef {
|
|
var out []DepRef
|
|
seen := map[string]bool{}
|
|
section := ""
|
|
|
|
for _, line := range splitLines(body) {
|
|
if strings.HasPrefix(line, "## ") {
|
|
head := strings.TrimSpace(line)
|
|
section = ""
|
|
for _, s := range DepSections {
|
|
if head == s {
|
|
section = head
|
|
break
|
|
}
|
|
}
|
|
continue
|
|
}
|
|
if section == "" {
|
|
continue
|
|
}
|
|
for _, tok := range depRefRe.FindAllStringSubmatch(line, -1) {
|
|
ref := tok[2]
|
|
if tok[1] != "" {
|
|
ref = "#" + tok[1]
|
|
}
|
|
if !seen[ref] {
|
|
seen[ref] = true
|
|
out = append(out, DepRef{Section: section, Ref: ref})
|
|
}
|
|
}
|
|
}
|
|
return out
|
|
}
|