@warren-dean/code-kit 0.26.2 → 0.28.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.claude-plugin/marketplace.json +1 -1
- package/.claude-plugin/plugin.json +1 -1
- package/CHANGELOG.md +24 -0
- package/README.md +8 -6
- package/bin/code-kit.mjs +269 -52
- package/hooks/act.mjs +14 -5
- package/hooks/guard-bash.mjs +82 -17
- package/hooks/lib/adapters/hub/client.mjs +22 -0
- package/hooks/lib/checkout.mjs +105 -0
- package/hooks/lib/checks.mjs +34 -8
- package/hooks/lib/config.mjs +16 -2
- package/hooks/lib/dependencies.mjs +4 -0
- package/hooks/lib/designs.mjs +138 -0
- package/hooks/lib/events.mjs +9 -4
- package/hooks/lib/hook.mjs +61 -2
- package/hooks/lib/next.mjs +26 -5
- package/hooks/lib/plan.mjs +55 -13
- package/hooks/lib/queue.mjs +86 -1
- package/hooks/lib/regression.mjs +54 -44
- package/hooks/lib/rules.mjs +63 -20
- package/hooks/lib/security.mjs +20 -0
- package/hooks/lib/sessions.mjs +49 -9
- package/hooks/lib/snapshot.mjs +227 -22
- package/hooks/lib/team.mjs +27 -1
- package/hooks/lib/verify.mjs +37 -4
- package/hooks/lib/worktrees.mjs +18 -1
- package/hooks/mod/board.mjs +10 -1
- package/hooks/mod/loop.mjs +44 -1
- package/hooks/mod/register.mjs +96 -8
- package/hooks/mod/view.mjs +8 -0
- package/hooks/post-edit-check.mjs +3 -1
- package/hooks/session.mjs +3 -1
- package/hooks/stop-check.mjs +6 -1
- package/package.json +1 -1
- package/skills/design/SKILL.md +36 -7
- package/skills/dispatch/SKILL.md +1 -0
- package/skills/init/SKILL.md +2 -0
- package/skills/review/SKILL.md +2 -1
- package/skills/spec-design/SKILL.md +1 -1
- package/skills/status/SKILL.md +1 -1
- package/templates/agent.md +2 -1
package/hooks/lib/hook.mjs
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
// What every hook starts with: the tool call from stdin, the project and its config.
|
|
2
|
-
import { readFileSync } from 'node:fs';
|
|
2
|
+
import { closeSync, fstatSync, openSync, readFileSync, readSync } from 'node:fs';
|
|
3
3
|
import { loadConfig } from './config.mjs';
|
|
4
4
|
import { projectDir } from './rules.mjs';
|
|
5
5
|
import { seeSession } from './sessions.mjs';
|
|
@@ -18,9 +18,68 @@ export function start() {
|
|
|
18
18
|
if (!config && !error) process.exit(0);
|
|
19
19
|
// SESS-1: the session acting is still there; one code-kit hadn't seen starts here.
|
|
20
20
|
try {
|
|
21
|
-
seeSession(project, input.session_id);
|
|
21
|
+
seeSession(project, input.session_id, Date.now(), () => ({ model: modelOf(input) }));
|
|
22
22
|
} catch {
|
|
23
23
|
// a read-only checkout: the session goes unrecorded
|
|
24
24
|
}
|
|
25
25
|
return { input, project, config, error };
|
|
26
26
|
}
|
|
27
|
+
|
|
28
|
+
/** The most of a transcript's end read for its last entry. */
|
|
29
|
+
const TAIL_BYTES = 64 * 1024;
|
|
30
|
+
|
|
31
|
+
/**
|
|
32
|
+
* The API error a stopping turn ended on ('rate_limit', 'overloaded', …), from the last entry of its
|
|
33
|
+
* transcript (a lane agent's own, or the session's), or null when it ended as it meant to. A turn cut
|
|
34
|
+
* off by Claude's usage limit stops too, but nothing it was doing is finished.
|
|
35
|
+
*/
|
|
36
|
+
export function apiStopOf(input) {
|
|
37
|
+
// A lane agent's own transcript: the session's ends where the lead is, not where the agent stopped.
|
|
38
|
+
const path = input?.agent_id ? input.agent_transcript_path : input?.transcript_path;
|
|
39
|
+
const entry = lastAssistant(path);
|
|
40
|
+
return entry?.isApiErrorMessage ? (entry.error ?? 'unknown') : null;
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
/**
|
|
44
|
+
* The model the session runs on: the one SessionStart names, or the one its transcript's last reply
|
|
45
|
+
* came from (Claude Code writes it on each), or null. Never a lane agent's: that's the session's lead.
|
|
46
|
+
*/
|
|
47
|
+
export function modelOf(input) {
|
|
48
|
+
if (typeof input?.model === 'string' && input.model) return input.model.slice(0, 120);
|
|
49
|
+
// A reply Claude Code made up itself (an error, a cut-off turn) names `<synthetic>`: not a model.
|
|
50
|
+
const named = (e) =>
|
|
51
|
+
!e.isApiErrorMessage && typeof e.message?.model === 'string' && /^[^<\s]/.test(e.message.model);
|
|
52
|
+
return lastAssistant(input?.transcript_path, named)?.message.model.slice(0, 120) ?? null;
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
/** The last of the model's entries in a transcript's end that `keep` accepts, or null. */
|
|
56
|
+
function lastAssistant(path, keep = () => true) {
|
|
57
|
+
if (!path) return null;
|
|
58
|
+
let fd;
|
|
59
|
+
try {
|
|
60
|
+
fd = openSync(path, 'r');
|
|
61
|
+
const size = fstatSync(fd).size;
|
|
62
|
+
const length = Math.min(size, TAIL_BYTES);
|
|
63
|
+
const buffer = Buffer.alloc(length);
|
|
64
|
+
readSync(fd, buffer, 0, length, size - length);
|
|
65
|
+
// The last of the model's entries: what Claude Code adds after it (a hook's note) says nothing.
|
|
66
|
+
return (
|
|
67
|
+
buffer
|
|
68
|
+
.toString('utf8')
|
|
69
|
+
.split('\n')
|
|
70
|
+
.reverse()
|
|
71
|
+
.map((line) => {
|
|
72
|
+
try {
|
|
73
|
+
return JSON.parse(line);
|
|
74
|
+
} catch {
|
|
75
|
+
return null;
|
|
76
|
+
}
|
|
77
|
+
})
|
|
78
|
+
.find((e) => e?.type === 'assistant' && keep(e)) ?? null
|
|
79
|
+
);
|
|
80
|
+
} catch {
|
|
81
|
+
return null;
|
|
82
|
+
} finally {
|
|
83
|
+
if (fd !== undefined) closeSync(fd);
|
|
84
|
+
}
|
|
85
|
+
}
|
package/hooks/lib/next.mjs
CHANGED
|
@@ -8,7 +8,8 @@ import { loadConfig, mergeDelegation } from './config.mjs';
|
|
|
8
8
|
import { buildStatus, readStories, DESIGN, LEAD } from './plan.mjs';
|
|
9
9
|
import { pendingSetup } from './adapters/index.mjs';
|
|
10
10
|
import { CONFIG_FILE, SETUP_VERSION } from './config.mjs';
|
|
11
|
-
import { readQueue, waiting } from './queue.mjs';
|
|
11
|
+
import { mergingNow, nextToMerge, readQueue, waiting } from './queue.mjs';
|
|
12
|
+
import { handedOver, readRegister, toolOf } from './designs.mjs';
|
|
12
13
|
import { decidedBy, laneOf, openRequests } from './rules.mjs';
|
|
13
14
|
import { instructionsState } from './instructions.mjs';
|
|
14
15
|
import { SECURITY_AGENT_FILE } from './security.mjs';
|
|
@@ -273,7 +274,13 @@ export function nextStep(root, base) {
|
|
|
273
274
|
);
|
|
274
275
|
|
|
275
276
|
// A branch already in the merge queue has passed its review: it isn't reviewed again.
|
|
276
|
-
const
|
|
277
|
+
const entries = readQueue(root);
|
|
278
|
+
const inQueue = waiting(entries);
|
|
279
|
+
// MQ-7: what can merge next; a branch queued with partners waits until they're queued too.
|
|
280
|
+
const { head: mergeHead, held: heldGroups } = nextToMerge(entries);
|
|
281
|
+
const queued = inQueue.map((e) => e.branch);
|
|
282
|
+
// MQ-1: a queue merge running now (its verify takes minutes) isn't asked for again.
|
|
283
|
+
const merging = mergingNow(inQueue[0]) ? inQueue[0].branch : null;
|
|
277
284
|
const ids = (state) =>
|
|
278
285
|
status.stories
|
|
279
286
|
.filter((s) => s.state === state && !(state === 'review' && queued.includes(s.branch)))
|
|
@@ -371,11 +378,19 @@ export function nextStep(root, base) {
|
|
|
371
378
|
attention.push(
|
|
372
379
|
`${queued.join(', ')} passed review and ${queued.length === 1 ? 'waits' : 'wait'} for the person to merge (code-kit queue merge --person, or Merge in the code-kit band).`,
|
|
373
380
|
);
|
|
374
|
-
if (
|
|
381
|
+
if (merging)
|
|
382
|
+
attention.push(
|
|
383
|
+
`${merging} is being merged now (queue merge is running); it says when it's done.`,
|
|
384
|
+
);
|
|
385
|
+
for (const h of heldGroups)
|
|
386
|
+
attention.push(
|
|
387
|
+
`${h.branch} passed review and merges together with ${h.missing.join(', ')}: it waits until ${h.missing.length === 1 ? 'that is' : 'they are'} reviewed and queued.`,
|
|
388
|
+
);
|
|
389
|
+
if (mergeHead && leadMerges && !merging)
|
|
375
390
|
return result(
|
|
376
391
|
'merge',
|
|
377
|
-
`${
|
|
378
|
-
{ args:
|
|
392
|
+
`${mergeHead.branch} passed review and is next in the merge queue${queued.length > 1 ? ` (then ${queued.filter((b) => b !== mergeHead.branch).join(', ')})` : ''}.`,
|
|
393
|
+
{ args: mergeHead.branch },
|
|
379
394
|
);
|
|
380
395
|
// SCHED-1, SCHED-2: one story for each free lane, across every session; the open slice's first.
|
|
381
396
|
const busy = new Set([
|
|
@@ -400,6 +415,12 @@ export function nextStep(root, base) {
|
|
|
400
415
|
attention.push(
|
|
401
416
|
`${sched.waiting.join(', ')} ${sched.waiting.length === 1 ? 'waits' : 'wait'} for ${sched.waiting.length === 1 ? 'its lane' : 'their lanes'}: a lane runs one story at a time.`,
|
|
402
417
|
);
|
|
418
|
+
// HAND-5: approved designs still only in a design tool, which no lane can read, are handed over once.
|
|
419
|
+
const toolOnly = readRegister(root, config).entries.filter((e) => !handedOver(e));
|
|
420
|
+
if (toolOnly.length)
|
|
421
|
+
attention.push(
|
|
422
|
+
`${toolOnly.length} approved screen${toolOnly.length === 1 ? ' is' : 's are'} only in ${[...new Set(toolOnly.map(toolOf))].join(', ')}, not as files a lane can build from: hand ${toolOnly.length === 1 ? 'it' : 'them'} over with /code-kit:design --hand-over.`,
|
|
423
|
+
);
|
|
403
424
|
const then = [];
|
|
404
425
|
// A sent-back story goes back to its lane with the review's findings, before new work starts.
|
|
405
426
|
const toDispatch = [...fixes, ...ready];
|
package/hooks/lib/plan.mjs
CHANGED
|
@@ -7,6 +7,7 @@
|
|
|
7
7
|
import { execFileSync } from 'node:child_process';
|
|
8
8
|
import { existsSync, readdirSync, readFileSync, statSync } from 'node:fs';
|
|
9
9
|
import { isAbsolute, join } from 'node:path';
|
|
10
|
+
import { readEvents } from './events.mjs';
|
|
10
11
|
import { laneClaims } from './laneclaims.mjs';
|
|
11
12
|
import { waitingStories } from './questions.mjs';
|
|
12
13
|
import { sentBack } from './reviews.mjs';
|
|
@@ -16,6 +17,8 @@ export const REQUIREMENT = /\b(?!ST-)([A-Z][A-Z0-9]*-\d+)\b/g;
|
|
|
16
17
|
const STORY_HEADING = /^###\s+(ST-\d+)\b\s*(.*)$/;
|
|
17
18
|
const REQUIREMENT_HEADING = /^###\s+((?!ST-)[A-Z][A-Z0-9]*-\d+)\b\s*(.*)$/;
|
|
18
19
|
export const STATES = ['todo', 'in progress', 'review', 'done'];
|
|
20
|
+
/** A story taken out of the plan (folded into another, or no longer wanted): never built, never waited on. */
|
|
21
|
+
export const DROPPED = 'dropped';
|
|
19
22
|
export const LEAD = 'lead';
|
|
20
23
|
/** ONB-2: the pseudo-lane for design stories, which the lead designs with the person before any screen is built. */
|
|
21
24
|
export const DESIGN = 'design';
|
|
@@ -53,6 +56,35 @@ const field = (lines, name) =>
|
|
|
53
56
|
.find(Boolean)?.[1]
|
|
54
57
|
.trim() ?? '';
|
|
55
58
|
|
|
59
|
+
/**
|
|
60
|
+
* Every spec in the specs (code-kit's spec template): [{ id, file, title, outcome, requirements }]. `id`
|
|
61
|
+
* is the number its `# ` heading starts with ("# 21. The hub adapter" → "21"), or else the file's name;
|
|
62
|
+
* `title` the rest of that heading; `outcome` its `**Outcome:**` line, or null; `requirements` the ids of
|
|
63
|
+
* the requirements it holds (removed ones left out). A file with neither an outcome nor a requirement
|
|
64
|
+
* (principles, architecture) isn't a spec. `plan` is the plan, left out where it sits among the specs.
|
|
65
|
+
*/
|
|
66
|
+
export function readSpecs(root, specsPath, plan = null) {
|
|
67
|
+
const requirements = readRequirements(root, specsPath);
|
|
68
|
+
const found = [];
|
|
69
|
+
for (const file of markdownFiles(root, specsPath)) {
|
|
70
|
+
if (file === plan) continue;
|
|
71
|
+
const lines = readFileSync(join(root, file), 'utf8').split('\n');
|
|
72
|
+
const heading = lines.map((l) => l.match(/^#\s+(.+?)\s*$/)).find(Boolean)?.[1] ?? null;
|
|
73
|
+
const numbered = heading?.match(/^(\d+[A-Za-z]?)[.:)]?\s+(.+)$/);
|
|
74
|
+
const outcome = field(lines, 'Outcome') || null;
|
|
75
|
+
const ids = requirements.filter((r) => r.file === file && !r.removed).map((r) => r.id);
|
|
76
|
+
if (!outcome && !ids.length) continue;
|
|
77
|
+
found.push({
|
|
78
|
+
id: numbered ? numbered[1] : file.split('/').pop().replace(/\.md$/, ''),
|
|
79
|
+
file,
|
|
80
|
+
title: numbered ? numbered[2] : heading,
|
|
81
|
+
outcome,
|
|
82
|
+
requirements: ids,
|
|
83
|
+
});
|
|
84
|
+
}
|
|
85
|
+
return found;
|
|
86
|
+
}
|
|
87
|
+
|
|
56
88
|
/** The first paragraph under a story's `**Field:**` lines, on one line, or null. */
|
|
57
89
|
function summaryOf(body) {
|
|
58
90
|
const start = body.findIndex((l) => l.trim() && !/^\*\*[^*]+:\*\*/.test(l.trim()));
|
|
@@ -94,7 +126,7 @@ export function readStories(root, planPath) {
|
|
|
94
126
|
// REG-1: what a fix story fixes, or null.
|
|
95
127
|
fixes: field(body, 'Fixes') || null,
|
|
96
128
|
dependsOn: [...field(body, 'Depends on').matchAll(/\bST-\d+\b/g)].map((r) => r[0]),
|
|
97
|
-
status: STATES.includes(status) ? status : 'todo',
|
|
129
|
+
status: STATES.includes(status) || status === DROPPED ? status : 'todo',
|
|
98
130
|
milestone,
|
|
99
131
|
// SCHED-2: the slice it belongs to, a feature built across lanes, or null.
|
|
100
132
|
slice: field(body, 'Slice') || null,
|
|
@@ -252,11 +284,18 @@ export function storyStates(root, stories, base) {
|
|
|
252
284
|
const trees = worktrees(root);
|
|
253
285
|
const backs = sentBack(root);
|
|
254
286
|
const refs = branchRefs(root, base);
|
|
255
|
-
const
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
)
|
|
287
|
+
const claims = laneClaims(root).filter((c) => !c.stale);
|
|
288
|
+
const live = new Set(claims.map((c) => `${c.lane}|${c.story ?? ''}`));
|
|
289
|
+
// A lane agent dispatched on the story and not handed back since: its commits are work in progress,
|
|
290
|
+
// even where the branch moved only by taking in the base (a re-dispatch after a send-back).
|
|
291
|
+
const building = (story) => {
|
|
292
|
+
const claim = claims.find((c) => c.lane === story.lane && c.story === story.id);
|
|
293
|
+
if (!claim) return false;
|
|
294
|
+
const since = Date.parse(claim.since);
|
|
295
|
+
return !readEvents(root, story.id).some(
|
|
296
|
+
(e) => e.kind === 'handback' && Date.parse(e.at) >= since,
|
|
297
|
+
);
|
|
298
|
+
};
|
|
260
299
|
// What the base already holds: the stories its commits name, and the story branches merged into it.
|
|
261
300
|
const onBase = { stories: new Set(), branches: new Set() };
|
|
262
301
|
for (const m of (git(root, 'log', base, '--format=%B%x1e') ?? '').matchAll(
|
|
@@ -280,10 +319,10 @@ export function storyStates(root, stories, base) {
|
|
|
280
319
|
: (refs[ref].ahead ?? Number(git(root, 'rev-list', '--count', `${base}..${ref}`) ?? 0));
|
|
281
320
|
let state = story.status;
|
|
282
321
|
let stopped = false;
|
|
283
|
-
if (ref && story.status
|
|
322
|
+
if (ref && !['done', DROPPED].includes(story.status)) {
|
|
284
323
|
const head = backs[branch] ? refs[ref].sha : null;
|
|
285
324
|
if (head && head === backs[branch].sha) state = 'sent back';
|
|
286
|
-
else if (ahead > 0) state = 'review';
|
|
325
|
+
else if (ahead > 0) state = building(story) ? 'in progress' : 'review';
|
|
287
326
|
else if (story.status === 'review') state = 'done';
|
|
288
327
|
else if (builtBy(story, branch)) state = 'in progress';
|
|
289
328
|
else {
|
|
@@ -310,11 +349,12 @@ export function storyStates(root, stories, base) {
|
|
|
310
349
|
waitingOn: [],
|
|
311
350
|
};
|
|
312
351
|
});
|
|
313
|
-
|
|
352
|
+
// A dropped story is as good as done for the stories that depend on it: it won't be built.
|
|
353
|
+
const done = new Set(states.filter((s) => ['done', DROPPED].includes(s.state)).map((s) => s.id));
|
|
314
354
|
// ASK-3: a story whose question for the person is open waits on them, whatever its branch holds.
|
|
315
355
|
const asked = waitingStories(root);
|
|
316
356
|
for (const s of states) {
|
|
317
|
-
if (s.state
|
|
357
|
+
if (['done', DROPPED].includes(s.state)) continue;
|
|
318
358
|
s.waitingOn = s.dependsOn.filter((d) => !done.has(d));
|
|
319
359
|
s.waitingFor = asked.has(s.id)
|
|
320
360
|
? { id: asked.get(s.id).id, question: asked.get(s.id).question }
|
|
@@ -342,7 +382,7 @@ export function traceProblems(requirements, stories, lanes) {
|
|
|
342
382
|
if (!s.lane) problems.push(`${s.id} has no **Lane:**`);
|
|
343
383
|
else if (s.lane !== LEAD && s.lane !== DESIGN && !lanes.includes(s.lane))
|
|
344
384
|
problems.push(`${s.id} names an unknown lane "${s.lane}"`);
|
|
345
|
-
if (!s.requirements.length && !s.noRequirements)
|
|
385
|
+
if (!s.requirements.length && !s.noRequirements && s.status !== DROPPED)
|
|
346
386
|
problems.push(`${s.id} cites no requirements (write "none" if it delivers none)`);
|
|
347
387
|
for (const r of s.requirements)
|
|
348
388
|
if (!ids.has(r)) problems.push(`${s.id} cites ${r}, which no spec defines`);
|
|
@@ -350,7 +390,9 @@ export function traceProblems(requirements, stories, lanes) {
|
|
|
350
390
|
if (!stories.some((o) => o.id === d))
|
|
351
391
|
problems.push(`${s.id} depends on ${d}, which isn't in the plan`);
|
|
352
392
|
}
|
|
353
|
-
const covered = new Set(
|
|
393
|
+
const covered = new Set(
|
|
394
|
+
stories.filter((s) => s.status !== DROPPED).flatMap((s) => s.requirements),
|
|
395
|
+
);
|
|
354
396
|
for (const r of requirements)
|
|
355
397
|
if (!r.removed && !covered.has(r.id)) problems.push(`${r.id} is in no story (${r.file})`);
|
|
356
398
|
return problems;
|
|
@@ -364,7 +406,7 @@ export function buildStatus(root, config, base, files) {
|
|
|
364
406
|
const tested = testedRequirements(root, files, specs);
|
|
365
407
|
const problems = traceProblems(requirements, stories, Object.keys(config.lanes));
|
|
366
408
|
const byRequirement = requirements.map((r) => {
|
|
367
|
-
const covering = stories.filter((s) => s.requirements.includes(r.id));
|
|
409
|
+
const covering = stories.filter((s) => s.state !== DROPPED && s.requirements.includes(r.id));
|
|
368
410
|
let state = 'no story';
|
|
369
411
|
if (r.removed) state = 'removed';
|
|
370
412
|
else if (covering.length && covering.every((s) => s.state === 'done')) state = 'done';
|
package/hooks/lib/queue.mjs
CHANGED
|
@@ -90,6 +90,91 @@ export function settle(root, branch, state, reason = null, now = Date.now()) {
|
|
|
90
90
|
writeQueue(root, [...entries.filter((e) => !settled.includes(e)), ...settled]);
|
|
91
91
|
}
|
|
92
92
|
|
|
93
|
+
/**
|
|
94
|
+
* MQ-1: the head being merged by a running `queue merge` (process `pid`), in its place; `null` puts it
|
|
95
|
+
* back to waiting, in its place too.
|
|
96
|
+
*/
|
|
97
|
+
export function markMerging(root, branch, pid, now = Date.now()) {
|
|
98
|
+
writeQueue(
|
|
99
|
+
root,
|
|
100
|
+
readQueue(root).map((e) => {
|
|
101
|
+
if (e.branch !== branch || !['waiting', 'merging'].includes(e.state)) return e;
|
|
102
|
+
const { pid: _pid, ...rest } = e;
|
|
103
|
+
return pid
|
|
104
|
+
? { ...rest, state: 'merging', pid, at: new Date(now).toISOString() }
|
|
105
|
+
: { ...rest, state: 'waiting' };
|
|
106
|
+
}),
|
|
107
|
+
);
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
/** Whether `entry` is being merged now: marked merging by a process still running. */
|
|
111
|
+
export function mergingNow(entry) {
|
|
112
|
+
if (entry?.state !== 'merging' || !entry.pid) return false;
|
|
113
|
+
try {
|
|
114
|
+
process.kill(entry.pid, 0);
|
|
115
|
+
return true;
|
|
116
|
+
} catch (e) {
|
|
117
|
+
return e.code === 'EPERM';
|
|
118
|
+
}
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
/**
|
|
122
|
+
* MQ-7: what the queue merges next. A branch queued `with` others merges only together with them, once
|
|
123
|
+
* each is queued too: verified as one tree, merged one after another. Until then it waits, and the
|
|
124
|
+
* queue goes on with the next. `{ head, partners, held }`: `head` null when nothing can merge yet;
|
|
125
|
+
* `held` lists each waiting branch with the partners it still needs queued.
|
|
126
|
+
*/
|
|
127
|
+
export function nextToMerge(entries) {
|
|
128
|
+
const queue = waiting(entries);
|
|
129
|
+
const queued = new Set(queue.map((e) => e.branch));
|
|
130
|
+
// A partner already merged on its own is no longer waited for.
|
|
131
|
+
const merged = new Set(entries.filter((e) => e.state === 'merged').map((e) => e.branch));
|
|
132
|
+
const groupOf = (e) => {
|
|
133
|
+
const group = new Set([e.branch]);
|
|
134
|
+
for (let grew = true; grew;) {
|
|
135
|
+
grew = false;
|
|
136
|
+
for (const x of queue)
|
|
137
|
+
if (
|
|
138
|
+
!group.has(x.branch) &&
|
|
139
|
+
((x.with ?? []).some((b) => group.has(b)) ||
|
|
140
|
+
[...group].some((b) =>
|
|
141
|
+
(queue.find((y) => y.branch === b)?.with ?? []).includes(x.branch),
|
|
142
|
+
))
|
|
143
|
+
) {
|
|
144
|
+
group.add(x.branch);
|
|
145
|
+
grew = true;
|
|
146
|
+
}
|
|
147
|
+
}
|
|
148
|
+
return group;
|
|
149
|
+
};
|
|
150
|
+
const held = [];
|
|
151
|
+
for (const e of queue) {
|
|
152
|
+
const group = groupOf(e);
|
|
153
|
+
const missing = [...group]
|
|
154
|
+
.flatMap((b) => queue.find((y) => y.branch === b)?.with ?? [])
|
|
155
|
+
.filter((b) => !queued.has(b) && !merged.has(b));
|
|
156
|
+
if (missing.length) {
|
|
157
|
+
held.push({ branch: e.branch, missing: [...new Set(missing)] });
|
|
158
|
+
continue;
|
|
159
|
+
}
|
|
160
|
+
const partners = queue.filter((x) => x.branch !== e.branch && group.has(x.branch));
|
|
161
|
+
return { head: e, partners, held };
|
|
162
|
+
}
|
|
163
|
+
return { head: null, partners: [], held };
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
/** MQ-7: a queued branch's partners, which it merges together with. */
|
|
167
|
+
export function setPartners(root, branch, partners) {
|
|
168
|
+
writeQueue(
|
|
169
|
+
root,
|
|
170
|
+
readQueue(root).map((e) =>
|
|
171
|
+
e.branch === branch && ['waiting', 'merging'].includes(e.state)
|
|
172
|
+
? { ...e, with: [...new Set([...(e.with ?? []), ...partners])] }
|
|
173
|
+
: e,
|
|
174
|
+
),
|
|
175
|
+
);
|
|
176
|
+
}
|
|
177
|
+
|
|
93
178
|
/** The branch merged last, for a send-back's reason ("conflicts with main after web/st-4"). */
|
|
94
179
|
export function lastMerged(entries) {
|
|
95
180
|
return [...entries].reverse().find((e) => e.state === 'merged')?.branch ?? null;
|
|
@@ -109,7 +194,7 @@ export function storyMerges(cmd, branch) {
|
|
|
109
194
|
const switches = new RegExp(
|
|
110
195
|
String.raw`^${GIT}(?:switch|checkout)\s+((?:-\S+\s+)*)([^\s-]\S*)\s*$`,
|
|
111
196
|
);
|
|
112
|
-
const merges = new RegExp(String.raw`^${GIT}merge\
|
|
197
|
+
const merges = new RegExp(String.raw`^${GIT}merge(?![\w-])(.*)$`);
|
|
113
198
|
for (const { text, code } of commandsOf(cmd)) {
|
|
114
199
|
const moved = code.match(switches);
|
|
115
200
|
if (moved) {
|
package/hooks/lib/regression.mjs
CHANGED
|
@@ -4,9 +4,9 @@
|
|
|
4
4
|
// WHO-2), the person's otherwise and always on the lead's own. The commit hook
|
|
5
5
|
// refuses a weakening commit; verify finds what a branch weakened, from git.
|
|
6
6
|
import { execFileSync, spawnSync } from 'node:child_process';
|
|
7
|
-
import { existsSync,
|
|
8
|
-
import {
|
|
9
|
-
import {
|
|
7
|
+
import { existsSync, readFileSync, rmSync } from 'node:fs';
|
|
8
|
+
import { join } from 'node:path';
|
|
9
|
+
import { freshCheckout } from './checkout.mjs';
|
|
10
10
|
import { runChecks } from './checks.mjs';
|
|
11
11
|
import { matchesAny } from './glob.mjs';
|
|
12
12
|
import { readStories } from './plan.mjs';
|
|
@@ -39,8 +39,9 @@ const SKIPS = [
|
|
|
39
39
|
/\bt\.Skip(?:f|Now)?\s*\(/,
|
|
40
40
|
/@(?:Disabled|Ignore)\b/,
|
|
41
41
|
];
|
|
42
|
+
// `expect(` and its retrying and soft forms (`expect.poll(`, `expect.soft(`), each one assertion.
|
|
42
43
|
const ASSERTION =
|
|
43
|
-
/\bexpect
|
|
44
|
+
/\bexpect(?:\.(?:poll|soft))?\s*\(|\bassert\w*\s*[.(]|\bt\.(?:Error|Errorf|Fatal|Fatalf|Fail)\b|\bshould\.\w/g;
|
|
44
45
|
|
|
45
46
|
const skipLines = (text) =>
|
|
46
47
|
String(text ?? '')
|
|
@@ -178,10 +179,22 @@ export function branchWeakenings(root, from, config) {
|
|
|
178
179
|
|
|
179
180
|
/**
|
|
180
181
|
* REG-2 for a commit about to be made: `files` as the commit hook lists them, HEAD against the
|
|
181
|
-
* working tree.
|
|
182
|
+
* working tree. `gone`: files the commit's own command takes away first (`git rm`, `git mv`), which
|
|
183
|
+
* are still on disk as the hook runs. `base`: the branch the work merges into; a test the branch
|
|
184
|
+
* added itself since it left it isn't the base's to lose, so moving or deleting it weakens nothing.
|
|
182
185
|
*/
|
|
183
|
-
export function commitWeakenings(root, files, config) {
|
|
186
|
+
export function commitWeakenings(root, files, config, gone = new Set(), base = null) {
|
|
187
|
+
let from = null;
|
|
188
|
+
try {
|
|
189
|
+
from = base ? git(root, 'merge-base', base, 'HEAD').trim() : null;
|
|
190
|
+
} catch {
|
|
191
|
+
// no common history with the base: every test counts
|
|
192
|
+
}
|
|
193
|
+
// What this commit adds stays, to pair a moved test with where it went.
|
|
194
|
+
if (from)
|
|
195
|
+
files = files.filter((f) => showAt(root, 'HEAD', f) === null || showAt(root, from, f) !== null);
|
|
184
196
|
const read = (rel) => {
|
|
197
|
+
if (gone.has(rel)) return null;
|
|
185
198
|
try {
|
|
186
199
|
return readFileSync(join(root, rel), 'utf8');
|
|
187
200
|
} catch {
|
|
@@ -190,7 +203,7 @@ export function commitWeakenings(root, files, config) {
|
|
|
190
203
|
};
|
|
191
204
|
const changes = files.map((file) => {
|
|
192
205
|
const was = showAt(root, 'HEAD', file) !== null;
|
|
193
|
-
const is = existsSync(join(root, file));
|
|
206
|
+
const is = !gone.has(file) && existsSync(join(root, file));
|
|
194
207
|
return { status: !was ? 'A' : is ? 'M' : 'D', file };
|
|
195
208
|
});
|
|
196
209
|
return weakenedTests(changes, (rel) => showAt(root, 'HEAD', rel), read, config);
|
|
@@ -219,38 +232,24 @@ const UNREACHABLE =
|
|
|
219
232
|
const ASSERTED =
|
|
220
233
|
/AssertionError|AssertionFailedError|Expected:|Received:|expected .+ to |toBe|toEqual|assert\w* failed|^\s*--- FAIL|Error: expect\(/m;
|
|
221
234
|
|
|
235
|
+
/** The names a failure says can't be reached: quoted ones on its unreachable lines. */
|
|
236
|
+
function missingNames(output) {
|
|
237
|
+
const names = new Set();
|
|
238
|
+
for (const line of output.split('\n').filter((l) => UNREACHABLE.test(l)))
|
|
239
|
+
for (const m of line.matchAll(
|
|
240
|
+
/['"`‘’]([A-Za-z_$][\w$]*)['"`‘’]|ReferenceError: ([A-Za-z_$][\w$]*)|undefined: (\w+)|import name '?(\w+)/g,
|
|
241
|
+
))
|
|
242
|
+
names.add(m[1] ?? m[2] ?? m[3] ?? m[4]);
|
|
243
|
+
return names;
|
|
244
|
+
}
|
|
245
|
+
|
|
222
246
|
/** Whether a failure's output only shows the tests couldn't reach what the fix adds. */
|
|
223
247
|
export const onlyUnreachable = (output) =>
|
|
224
248
|
UNREACHABLE.test(output) && !ASSERTED.test(output.replace(UNREACHABLE, ''));
|
|
225
249
|
|
|
226
|
-
// The folders an install puts beside the code, which a fresh checkout lacks.
|
|
227
|
-
const INSTALLS = new Set(['node_modules', '.venv', 'venv']);
|
|
228
|
-
|
|
229
|
-
/** Links the checkout's installs (node_modules and the like, wherever git ignores them) into `dir`. */
|
|
230
|
-
function linkInstalls(root, dir) {
|
|
231
|
-
let ignored = [];
|
|
232
|
-
try {
|
|
233
|
-
ignored = git(root, 'ls-files', '--others', '--ignored', '--exclude-standard', '--directory')
|
|
234
|
-
.split('\n')
|
|
235
|
-
.map((l) => l.replace(/\/$/, ''))
|
|
236
|
-
.filter((l) => l && INSTALLS.has(basename(l)));
|
|
237
|
-
} catch {
|
|
238
|
-
return;
|
|
239
|
-
}
|
|
240
|
-
for (const rel of ignored) {
|
|
241
|
-
const to = join(dir, rel);
|
|
242
|
-
if (!existsSync(dirname(to)) || existsSync(to)) continue;
|
|
243
|
-
try {
|
|
244
|
-
symlinkSync(join(root, rel), to, 'dir');
|
|
245
|
-
} catch {
|
|
246
|
-
// the check then says what it couldn't run
|
|
247
|
-
}
|
|
248
|
-
}
|
|
249
|
-
}
|
|
250
|
-
|
|
251
250
|
/**
|
|
252
|
-
* REG-1: whether a fix's tests prove its bug. In a
|
|
253
|
-
* checkout's installs
|
|
251
|
+
* REG-1: whether a fix's tests prove its bug. In a fresh checkout of the branch (with its own copy of
|
|
252
|
+
* the checkout's installs, after `regression.prepare`), the checks covering the tests it added
|
|
254
253
|
* or changed must pass, and fail, as the bug, once every change outside the tests goes back to `from`.
|
|
255
254
|
* Problems in words; empty when the tests prove it.
|
|
256
255
|
*/
|
|
@@ -263,6 +262,9 @@ export function proveFix({ root, from, base, changed, config, fix }) {
|
|
|
263
262
|
return [
|
|
264
263
|
`${what}, but it adds or changes no test. Add a test that fails without the fix: it's what stops the bug coming back.`,
|
|
265
264
|
];
|
|
265
|
+
// A fix made wholly in the tests (a flaky test, a broken helper) has no code to take back: its tests
|
|
266
|
+
// are the fix. REG-2 still holds them, so it can't be made by weakening one.
|
|
267
|
+
if (changed.every((f) => isTestFile(f, config) || SNAPSHOT.test(f))) return [];
|
|
266
268
|
const covering = config.checks.filter((c) =>
|
|
267
269
|
tests.some((f) => matchesAny(f, c.files) && !matchesAny(f, c.exclude)),
|
|
268
270
|
);
|
|
@@ -272,11 +274,8 @@ export function proveFix({ root, from, base, changed, config, fix }) {
|
|
|
272
274
|
];
|
|
273
275
|
const strict = { ...config, checks: covering.map((c) => ({ ...c, ifMissing: 'fail' })) };
|
|
274
276
|
const actor = { kind: 'lead', label: 'lead' };
|
|
275
|
-
const dir =
|
|
276
|
-
rmSync(dir, { recursive: true });
|
|
277
|
+
const { dir, remove } = freshCheckout(root, 'HEAD', { prefix: 'code-kit-fix-' });
|
|
277
278
|
try {
|
|
278
|
-
git(root, 'worktree', 'add', '--quiet', '--detach', dir, 'HEAD');
|
|
279
|
-
linkInstalls(root, dir);
|
|
280
279
|
const prepare = config.regression?.prepare;
|
|
281
280
|
if (prepare) {
|
|
282
281
|
const res = spawnSync(prepare, { cwd: dir, shell: true, encoding: 'utf8', timeout: 900000 });
|
|
@@ -300,7 +299,22 @@ export function proveFix({ root, from, base, changed, config, fix }) {
|
|
|
300
299
|
return [
|
|
301
300
|
`${what}, but its tests (${tests.join(', ')}) also pass without the fix, so they don't prove the bug and it can come back. Write a test that fails on ${base} and passes here.`,
|
|
302
301
|
];
|
|
303
|
-
|
|
302
|
+
let output = `${without.title}\n${without.output ?? ''}`;
|
|
303
|
+
// Tests that call what the fix adds can stop a whole run (a typecheck) before a test through the
|
|
304
|
+
// existing code fails on its assertion: set them aside, and run the rest without the fix.
|
|
305
|
+
if (onlyUnreachable(output)) {
|
|
306
|
+
const missing = missingNames(output);
|
|
307
|
+
const aside = tests.filter((f) => {
|
|
308
|
+
const text = showAt(root, 'HEAD', f) ?? '';
|
|
309
|
+
return [...missing].some((n) => new RegExp(String.raw`\b${n}\b`).test(text));
|
|
310
|
+
});
|
|
311
|
+
const rest = tests.filter((f) => !aside.includes(f));
|
|
312
|
+
if (aside.length && rest.length) {
|
|
313
|
+
for (const f of aside) rmSync(join(dir, f), { force: true });
|
|
314
|
+
const { failure: again } = runChecks(strict, rest, dir, actor);
|
|
315
|
+
if (again) output = `${again.title}\n${again.output ?? ''}`;
|
|
316
|
+
}
|
|
317
|
+
}
|
|
304
318
|
if (onlyUnreachable(output)) {
|
|
305
319
|
const line =
|
|
306
320
|
output
|
|
@@ -313,10 +327,6 @@ export function proveFix({ root, from, base, changed, config, fix }) {
|
|
|
313
327
|
}
|
|
314
328
|
return [];
|
|
315
329
|
} finally {
|
|
316
|
-
|
|
317
|
-
git(root, 'worktree', 'remove', '--force', dir);
|
|
318
|
-
} catch {
|
|
319
|
-
rmSync(dir, { recursive: true, force: true });
|
|
320
|
-
}
|
|
330
|
+
remove();
|
|
321
331
|
}
|
|
322
332
|
}
|