1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
// SPDX-License-Identifier: GPL-3.0-or-later
package main
import (
"io"
"strings"
"testing"
"unicode/utf8"
"krino/internal/plan"
"krino/internal/scan"
)
func chains(rels ...string) []plan.Chain {
out := make([]plan.Chain, len(rels))
for i, r := range rels {
out[i] = plan.Chain{File: scan.File{Rel: r}, Steps: []plan.Step{{Kind: plan.Move, Dst: "/w/" + r}}}
}
return out
}
func TestChoosePerFile(t *testing.T) {
// c enters per-file mode, then y n y for three files.
approved, _, action, err := reviewChains(strings.NewReader("cyny"), new(strings.Builder), chains("a", "b", "c"), "", palette{})
if err != nil {
t.Fatal(err)
}
if action != 'c' {
t.Errorf("action = %q", action)
}
if !approved["a"] || approved["b"] || !approved["c"] {
t.Errorf("approved = %v; want a and c only", approved)
}
}
func TestApplyAllAndSkip(t *testing.T) {
approved, _, action, _ := reviewChains(strings.NewReader("a"), new(strings.Builder), chains("a", "b"), "", palette{})
if action != 'a' || len(approved) != 2 {
t.Errorf("[a] = %q %v; want every file approved", action, approved)
}
approved, _, action, _ = reviewChains(strings.NewReader("s"), new(strings.Builder), chains("a", "b"), "", palette{})
if action != 's' || len(approved) != 0 {
t.Errorf("[s] = %q %v; want nothing approved", action, approved)
}
}
func TestPerFileWriteStopsAsking(t *testing.T) {
// c, y for the first, then w: apply what was chosen so far.
approved, _, _, _ := reviewChains(strings.NewReader("cyw"), new(strings.Builder), chains("a", "b", "c"), "", palette{})
if !approved["a"] || approved["b"] || approved["c"] {
t.Errorf("approved = %v; want only a", approved)
}
}
// TestPerFileQuitAppliesNothing: spec §8.3's [q] on the per-file prompt is
// "quit, apply nothing" - stronger than [w], which keeps what was already
// chosen. It folds into the same top-level 'q' the caller already handles
// for the directory-level menu (spec §8.2's [q]), and discards even a file
// already marked yes.
func TestPerFileQuitAppliesNothing(t *testing.T) {
approved, _, action, err := reviewChains(strings.NewReader("cyq"), new(strings.Builder), chains("a", "b"), "", palette{})
if err != nil {
t.Fatal(err)
}
if action != 'q' {
t.Errorf("action = %q, want 'q'", action)
}
if len(approved) != 0 {
t.Errorf("approved = %v; want nothing, even though a was marked yes first", approved)
}
}
// TestPerFileYesToAllRemaining: spec §8.3's [a] mid-review approves the
// current file and every remaining one without asking again.
func TestPerFileYesToAllRemaining(t *testing.T) {
approved, _, action, err := reviewChains(strings.NewReader("ca"), new(strings.Builder), chains("a", "b", "c"), "", palette{})
if err != nil {
t.Fatal(err)
}
if action != 'c' || len(approved) != 3 {
t.Errorf("approved = %v action = %q; want all three approved", approved, action)
}
}
// TestInvalidKeyReprompts: an unrecognised key at either the top-level menu
// or the per-file prompt does not abort the review - it is reported and the
// same prompt is read again.
func TestInvalidKeyReprompts(t *testing.T) {
out := new(strings.Builder)
approved, _, action, err := reviewChains(strings.NewReader("zs"), out, chains("a"), "", palette{})
if err != nil {
t.Fatal(err)
}
if action != 's' || len(approved) != 0 {
t.Errorf("approved = %v action = %q; want [s] after the bad key", approved, action)
}
if !strings.Contains(out.String(), "z") {
t.Errorf("no mention of the rejected key:\n%s", out)
}
}
// TestPerFileDestinationIsRootRelative is review finding 1 (fix round
// 2026-09-12): reviewPerFile must render a destination the same way the
// directory-level table does (render.go's destText) - root-relative for a
// destination inside root, ~-abbreviated for one outside it - not always
// abbreviated because root was never passed through to actionCell at all.
// Both halves are pinned: getting only the "inside" half right would still
// let an outside-root destination silently regress to some other form.
func TestPerFileDestinationIsRootRelative(t *testing.T) {
t.Setenv("HOME", "/home/x")
root := "/home/x/dl"
cs := []plan.Chain{
{File: scan.File{Rel: "inside.txt"}, Steps: []plan.Step{{Kind: plan.Move, Dst: root + "/Work/Acme/inside.txt"}}},
{File: scan.File{Rel: "outside.txt"}, Steps: []plan.Step{{Kind: plan.Move, Dst: "/home/x/backup/outside.txt"}}},
}
out := new(strings.Builder)
if _, _, _, err := reviewChains(strings.NewReader("cyy"), out, cs, root, palette{}); err != nil {
t.Fatal(err)
}
text := out.String()
if !strings.Contains(text, "move → Work/Acme/") {
t.Errorf("destination inside root should be root-relative, not ~-abbreviated:\n%s", text)
}
if !strings.Contains(text, "move → ~/backup/") {
t.Errorf("destination outside root should be ~-abbreviated:\n%s", text)
}
}
// TestPerFileShowsTheWholeBlock: choosing per file shows each step, its
// rule and its reason: the same block the plan shows, not the steps alone.
func TestPerFileShowsTheWholeBlock(t *testing.T) {
cs := []plan.Chain{{File: scan.File{Rel: "a.pdf"}, Steps: []plan.Step{
{Kind: plan.Move, Rule: "acme", Dst: "/w/a.pdf", Reason: `content "acme ltd"`},
}}}
out := new(strings.Builder)
if _, _, _, err := reviewChains(strings.NewReader("cy"), out, cs, "", palette{}); err != nil {
t.Fatal(err)
}
want := "\n[1/1] a.pdf\n move → /w/\n rule acme\n because content \"acme ltd\"\n"
if !strings.Contains(out.String(), want) {
t.Errorf("per-file prompt:\n%s\nwant substring:\n%s", out, want)
}
}
// TestPerFileWrapsToTheTerminal: on a narrow terminal the per-file block
// and its key prompt both fit, and the prompt's pieces read back as the
// whole prompt.
func TestPerFileWrapsToTheTerminal(t *testing.T) {
old := widthPolicy
t.Cleanup(func() { widthPolicy = old })
widthPolicy = func(io.Writer) int { return 60 }
cs := []plan.Chain{{File: scan.File{Rel: "a.pdf"}, Steps: []plan.Step{
{Kind: plan.Move, Rule: "acme", Dst: "/w/some/deeply/nested/destination/directory/for/invoices/a.pdf", Reason: `content "acme ltd"`},
}}}
out := new(strings.Builder)
if _, _, _, err := reviewChains(strings.NewReader("cy"), out, cs, "", palette{}); err != nil {
t.Fatal(err)
}
var prompt string
for _, l := range strings.Split(out.String(), "\n") {
if n := utf8.RuneCountInString(l); n > 60 {
t.Errorf("line of %d runes exceeds width 60: %q", n, l)
}
if strings.HasPrefix(l, " [y] yes") || (prompt != "" && strings.HasPrefix(l, " ") && !strings.HasPrefix(l, " ")) {
prompt += strings.TrimPrefix(l, " ")
}
}
if prompt != perFileKeys {
t.Errorf("wrapped prompt reads %q, want %q\n%s", prompt, perFileKeys, out)
}
}
// TestPerFileTrashAndDelete: [t] and [d] (confirmed with y) replace what the
// rules planned for that file with one step, and approve it.
func TestPerFileTrashAndDelete(t *testing.T) {
out := new(strings.Builder)
approved, replaced, action, err := reviewChains(strings.NewReader("ctdyn"), out, chains("a", "b", "c"), "", palette{})
if err != nil {
t.Fatal(err)
}
if action != 'c' || !approved["a"] || !approved["b"] || approved["c"] {
t.Errorf("approved = %v action = %q; want a and b", approved, action)
}
if len(replaced) != 2 || replaced["a"] != plan.Trash || replaced["b"] != plan.DeletePermanent {
t.Errorf("replaced = %v; want a trash, b deleted permanently", replaced)
}
if !strings.Contains(out.String(), "delete b permanently? [y/N]") {
t.Errorf("no confirmation asked:\n%s", out)
}
}
// TestPerFileDeleteNeedsConfirmation: any key but y after [d] deletes
// nothing and asks about the same file again.
func TestPerFileDeleteNeedsConfirmation(t *testing.T) {
out := new(strings.Builder)
approved, replaced, _, err := reviewChains(strings.NewReader("cdny"), out, chains("a"), "", palette{})
if err != nil {
t.Fatal(err)
}
if len(replaced) != 0 || !approved["a"] {
t.Errorf("approved = %v replaced = %v; want a approved as planned, nothing replaced", approved, replaced)
}
if strings.Count(out.String(), perFileKeys) != 2 {
t.Errorf("the prompt should be shown again after a cancelled delete:\n%s", out)
}
}
// TestPerFileQuitDiscardsReplacements: [q] after [t] applies nothing, the
// trash included.
func TestPerFileQuitDiscardsReplacements(t *testing.T) {
approved, replaced, action, _ := reviewChains(strings.NewReader("ctq"), new(strings.Builder), chains("a", "b"), "", palette{})
if action != 'q' || len(approved) != 0 || len(replaced) != 0 {
t.Errorf("approved = %v replaced = %v action = %q; want nothing", approved, replaced, action)
}
}
// TestReplaceChains: a replaced file's chain becomes one step of the chosen
// kind on the file itself, under the rule name (review); other chains keep
// their steps.
func TestReplaceChains(t *testing.T) {
cs := chains("a", "b")
cs[0].File.Path = "/dl/a"
cs[0].Steps = append(cs[0].Steps, plan.Step{Kind: plan.Copy, Dst: "/w/copy"})
got := replaceChains(cs, map[string]plan.Kind{"a": plan.DeletePermanent})
want := plan.Step{Kind: plan.DeletePermanent, Rule: "(review)", Src: "/dl/a", Reason: "chosen in review"}
if len(got[0].Steps) != 1 || got[0].Steps[0] != want {
t.Errorf("a's steps = %+v; want only %+v", got[0].Steps, want)
}
if len(got[1].Steps) != 1 || got[1].Steps[0].Kind != plan.Move {
t.Errorf("b's steps changed: %+v", got[1].Steps)
}
if len(cs[0].Steps) != 2 {
t.Errorf("replaceChains changed its input: %+v", cs[0].Steps)
}
}
|