forked from lovyou-ai/work
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathreopen_test.go
More file actions
276 lines (241 loc) · 8.64 KB
/
Copy pathreopen_test.go
File metadata and controls
276 lines (241 loc) · 8.64 KB
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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
package work_test
import (
"strings"
"testing"
"github.com/transpara-ai/eventgraph/go/pkg/types"
"github.com/transpara-ai/work"
)
// The review→fix return edge (run findings v12-F1): a request_changes verdict
// must be able to return a completed task to the open state so the producer's
// existing pickup machinery re-engages. These tests pin the store semantics:
// a completion is live unless a reopen references it — pure set algebra over
// CompletionRefs, no event-order comparison anywhere.
func listOpenIDs(t *testing.T, ts *work.TaskStore) map[types.EventID]bool {
t.Helper()
open, err := ts.ListOpen()
if err != nil {
t.Fatalf("ListOpen: %v", err)
}
ids := make(map[types.EventID]bool, len(open))
for _, task := range open {
ids[task.ID] = true
}
return ids
}
func TestReopenRequiresLiveCompletion(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
err = ts.Reopen(testActor, task.ID, "review found defects", []string{"issue"}, causes, testConv)
if err == nil {
t.Fatal("Reopen on a never-completed task must refuse")
}
}
func TestReopenRequiresReason(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if err := ts.Reopen(testActor, task.ID, " ", nil, causes, testConv); err == nil {
t.Fatal("Reopen with a blank reason must refuse")
}
}
func TestReopenReturnsTaskToOpen(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
if err := ts.Assign(testActor, task.ID, testActor, causes, testConv); err != nil {
t.Fatalf("Assign: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if listOpenIDs(t, ts)[task.ID] {
t.Fatal("completed task must not be open")
}
proj, err := ts.ProjectLegacyTask(task.ID)
if err != nil {
t.Fatalf("ProjectLegacyTask: %v", err)
}
if proj.Status != work.LegacyStatusCompleted {
t.Fatalf("pre-reopen status = %q, want completed", proj.Status)
}
if err := ts.Reopen(testActor, task.ID, "review found defects", []string{"fix the Tier citation"}, causes, testConv); err != nil {
t.Fatalf("Reopen: %v", err)
}
if !listOpenIDs(t, ts)[task.ID] {
t.Fatal("reopened task must be open again")
}
proj, err = ts.ProjectLegacyTask(task.ID)
if err != nil {
t.Fatalf("ProjectLegacyTask after reopen: %v", err)
}
if proj.Status == work.LegacyStatusCompleted {
t.Fatal("reopened task must not project as completed")
}
if proj.Status != work.LegacyStatusAssigned {
t.Fatalf("reopened assigned task status = %q, want assigned (sticky assignment is the return edge)", proj.Status)
}
}
func TestReopenedDependencyReblocksAggregate(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
parent, err := ts.Create(testActor, "order", "aggregate", causes, testConv)
if err != nil {
t.Fatalf("Create parent: %v", err)
}
child, err := ts.Create(testActor, "subtask", "piece", causes, testConv)
if err != nil {
t.Fatalf("Create child: %v", err)
}
// Corrected decomposition direction (v11-F1): parent depends_on child.
if err := ts.AddDependency(testActor, parent.ID, child.ID, causes, testConv); err != nil {
t.Fatalf("AddDependency: %v", err)
}
if listOpenIDs(t, ts)[parent.ID] {
t.Fatal("parent must be hidden while its piece is open")
}
completeWithArtifact(t, ts, testActor, child.ID, "done", causes, testConv)
if !listOpenIDs(t, ts)[parent.ID] {
t.Fatal("parent must surface once its piece completes")
}
if err := ts.Reopen(testActor, child.ID, "review found defects", nil, causes, testConv); err != nil {
t.Fatalf("Reopen child: %v", err)
}
if listOpenIDs(t, ts)[parent.ID] {
t.Fatal("parent must re-hide while the reopened piece is being fixed")
}
blocked, err := ts.IsBlocked(parent.ID)
if err != nil {
t.Fatalf("IsBlocked: %v", err)
}
if !blocked {
t.Fatal("parent must read blocked while the reopened piece is open")
}
}
func TestRecompletionAfterReopenIsCompleted(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if err := ts.Reopen(testActor, task.ID, "review found defects", nil, causes, testConv); err != nil {
t.Fatalf("Reopen: %v", err)
}
// The fix: a NEW completion event, never referenced by the prior reopen.
if err := ts.Complete(testActor, task.ID, "fixed", causes, testConv); err != nil {
t.Fatalf("re-Complete: %v", err)
}
if listOpenIDs(t, ts)[task.ID] {
t.Fatal("re-completed task must not be open")
}
proj, err := ts.ProjectLegacyTask(task.ID)
if err != nil {
t.Fatalf("ProjectLegacyTask: %v", err)
}
if proj.Status != work.LegacyStatusCompleted {
t.Fatalf("re-completed status = %q, want completed", proj.Status)
}
}
func TestDoubleReopenRefused(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if err := ts.Reopen(testActor, task.ID, "round 1", nil, causes, testConv); err != nil {
t.Fatalf("first Reopen: %v", err)
}
if err := ts.Reopen(testActor, task.ID, "round 2", nil, causes, testConv); err == nil {
t.Fatal("second Reopen without re-completion must refuse (no live completion)")
}
}
func TestListReopensReturnsFeedback(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
issues := []string{"fix the Tier citation", "reword the Notes claim"}
if err := ts.Reopen(testActor, task.ID, "request_changes: Tier rows wrong", issues, causes, testConv); err != nil {
t.Fatalf("Reopen: %v", err)
}
reopens, err := ts.ListReopens(task.ID)
if err != nil {
t.Fatalf("ListReopens: %v", err)
}
if len(reopens) != 1 {
t.Fatalf("got %d reopens, want 1", len(reopens))
}
r := reopens[0]
if r.TaskID != task.ID || r.ReopenedBy != testActor {
t.Fatalf("reopen identity mismatch: %+v", r)
}
if !strings.Contains(r.Reason, "Tier rows wrong") {
t.Fatalf("reason = %q, want the review summary", r.Reason)
}
if len(r.Issues) != 2 || r.Issues[0] != issues[0] || r.Issues[1] != issues[1] {
t.Fatalf("issues = %v, want %v", r.Issues, issues)
}
}
func TestListReopensChronological(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if err := ts.Reopen(testActor, task.ID, "round 1", nil, causes, testConv); err != nil {
t.Fatalf("Reopen 1: %v", err)
}
if err := ts.Complete(testActor, task.ID, "fixed once", causes, testConv); err != nil {
t.Fatalf("re-Complete: %v", err)
}
if err := ts.Reopen(testActor, task.ID, "round 2", nil, causes, testConv); err != nil {
t.Fatalf("Reopen 2: %v", err)
}
reopens, err := ts.ListReopens(task.ID)
if err != nil {
t.Fatalf("ListReopens: %v", err)
}
// The Operate instruction numbers these as rounds — chronological order
// is load-bearing (ByType pages newest-first; ListReopens must reverse).
if len(reopens) != 2 || reopens[0].Reason != "round 1" || reopens[1].Reason != "round 2" {
t.Fatalf("reopens must be chronological (oldest first); got %+v", reopens)
}
}
func TestBatchStatusReflectsReopen(t *testing.T) {
s, causes := setupStore(t)
ts := newTaskStore(t, s)
task, err := ts.Create(testActor, "subtask", "do the thing", causes, testConv)
if err != nil {
t.Fatalf("Create: %v", err)
}
completeWithArtifact(t, ts, testActor, task.ID, "done", causes, testConv)
if err := ts.Reopen(testActor, task.ID, "review found defects", nil, causes, testConv); err != nil {
t.Fatalf("Reopen: %v", err)
}
summaries, err := ts.ListSummaries(100)
if err != nil {
t.Fatalf("ListSummaries: %v", err)
}
for _, sum := range summaries {
if sum.ID == task.ID && sum.LegacyStatus == work.LegacyStatusCompleted {
t.Fatal("batch status must not report a reopened task as completed")
}
}
}