feat: add the kettle CLI, replacing the plugin's Python scripts

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>
2026-08-11 19:05:39 +05:00
parent fb5445915f
commit 9480e48312
83 changed files with 23894 additions and 0 deletions
@@ -0,0 +1,106 @@
+package issue
+
+import "sort"
+
+// Graph is the edge list read off the `depends:` metadata — the authoritative
+// one. Body prose is never walked.
+func Graph(issues map[string]*Issue) map[string][]string {
+	out := make(map[string][]string, len(issues))
+	for id, i := range issues {
+		out[id] = append([]string{}, i.Depends...)
+	}
+	return out
+}
+
+// Dependents lists who depends on id — the upward direction.
+func Dependents(issues map[string]*Issue, id string) []string {
+	var out []string
+	for other, i := range issues {
+		if contains(i.Depends, id) {
+			out = append(out, other)
+		}
+	}
+	sort.Strings(out)
+	return out
+}
+
+// TopoOrder puts dependencies first.
+//
+// Cycles are broken deterministically rather than raising: a cycle is a data
+// problem for the caller to report, not a reason to refuse to order the rest.
+func TopoOrder(ids []string, edges map[string][]string) []string {
+	const (
+		open = 1
+		done = 2
+	)
+	state := map[string]int{}
+	var order []string
+
+	var visit func(string)
+	visit = func(n string) {
+		switch state[n] {
+		case done, open: // open = a back edge; leave it unresolved
+			return
+		}
+		state[n] = open
+		for _, d := range edges[n] {
+			if _, ok := edges[d]; ok {
+				visit(d)
+			}
+		}
+		state[n] = done
+		order = append(order, n)
+	}
+
+	for _, n := range ids {
+		visit(n)
+	}
+	return order
+}
+
+// FindCycles returns one id list per cycle. Empty when the graph is a DAG.
+func FindCycles(edges map[string][]string) [][]string {
+	const (
+		open = 1
+		done = 2
+	)
+	state := map[string]int{}
+	var stack []string
+	var cycles [][]string
+
+	var visit func(string)
+	visit = func(n string) {
+		state[n] = open
+		stack = append(stack, n)
+		for _, d := range edges[n] {
+			if _, ok := edges[d]; !ok {
+				continue
+			}
+			if state[d] == open {
+				for i, s := range stack {
+					if s == d {
+						cycles = append(cycles, append(append([]string{}, stack[i:]...), d))
+						break
+					}
+				}
+			} else if state[d] == 0 {
+				visit(d)
+			}
+		}
+		stack = stack[:len(stack)-1]
+		state[n] = done
+	}
+
+	// Sorted so the report is the same on every run; Go map order is not.
+	ids := make([]string, 0, len(edges))
+	for n := range edges {
+		ids = append(ids, n)
+	}
+	sort.Strings(ids)
+	for _, n := range ids {
+		if state[n] == 0 {
+			visit(n)
+		}
+	}
+	return cycles
+}