@astrosheep/keiyaku 4.5.3 → 4.5.4
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/build/src/cli/commands/task-invoke.d.ts +2 -0
- package/build/src/cli/commands/task-invoke.js +15 -2
- package/build/src/cli/commands/task.js +21 -3
- package/build/src/cli/invoke.js +1 -0
- package/build/src/cli/render/task.js +25 -1
- package/build/src/task/compose-language.d.ts +43 -0
- package/build/src/task/compose-language.js +314 -0
- package/build/src/task/compose-parser.d.ts +31 -0
- package/build/src/task/compose-parser.js +162 -0
- package/build/src/task/compose.d.ts +20 -9
- package/build/src/task/compose.js +124 -287
- package/build/src/task/index.d.ts +3 -2
- package/build/src/task/index.js +4 -2
- package/build/src/task/operations.d.ts +6 -1
- package/package.json +12 -2
|
@@ -19,6 +19,7 @@ export type TaskWorldObservation = Readonly<{
|
|
|
19
19
|
}>;
|
|
20
20
|
type TaskInput = Readonly<{
|
|
21
21
|
world: WorldRoot | null;
|
|
22
|
+
candidate: WorldRoot | null;
|
|
22
23
|
context: Readonly<{
|
|
23
24
|
directory: string;
|
|
24
25
|
boundary: string;
|
|
@@ -30,6 +31,7 @@ type TaskInput = Readonly<{
|
|
|
30
31
|
export declare function invokeTaskFromEdge(input: Readonly<{
|
|
31
32
|
parsed: ParsedTaskCommand;
|
|
32
33
|
world: WorldRoot | null;
|
|
34
|
+
candidate: WorldRoot | null;
|
|
33
35
|
context: Readonly<{
|
|
34
36
|
directory: string;
|
|
35
37
|
boundary: string;
|
|
@@ -8,6 +8,7 @@ export async function invokeTaskFromEdge(input) {
|
|
|
8
8
|
try {
|
|
9
9
|
return await invokeTask(input.parsed, {
|
|
10
10
|
world: input.world,
|
|
11
|
+
candidate: input.candidate,
|
|
11
12
|
context: input.context,
|
|
12
13
|
establish: input.establish,
|
|
13
14
|
readStdin: input.readStdin,
|
|
@@ -293,6 +294,15 @@ function missingWorld(command) {
|
|
|
293
294
|
});
|
|
294
295
|
if (isWorldObservation(command))
|
|
295
296
|
return { kind: "absent" };
|
|
297
|
+
if (command.action === "compose" && command.flags.plan === true) {
|
|
298
|
+
return {
|
|
299
|
+
kind: "refused",
|
|
300
|
+
refusal: {
|
|
301
|
+
kind: "invalid-composition",
|
|
302
|
+
diagnostics: [{ line: 1, reason: "task world has no valid planning coordinate", token: "--plan" }],
|
|
303
|
+
},
|
|
304
|
+
};
|
|
305
|
+
}
|
|
296
306
|
if (command.action === "namespace")
|
|
297
307
|
return { kind: "accepted", value: [] };
|
|
298
308
|
if (command.action === "hold" || command.action === "done" || command.action === "drop") {
|
|
@@ -338,6 +348,7 @@ async function invokeLocalMutation(tasks, command, input, current) {
|
|
|
338
348
|
markdown: await input.readStdin(),
|
|
339
349
|
namespace: current ?? [],
|
|
340
350
|
...(input.actor === undefined ? {} : { actor: input.actor }),
|
|
351
|
+
...(command.flags.plan === true ? { plan: true } : {}),
|
|
341
352
|
});
|
|
342
353
|
default:
|
|
343
354
|
throw new Error(`task action has no invocation: ${command.action}`);
|
|
@@ -345,17 +356,19 @@ async function invokeLocalMutation(tasks, command, input, current) {
|
|
|
345
356
|
}
|
|
346
357
|
function establishesWorld(command) {
|
|
347
358
|
return (command.action === "add" ||
|
|
348
|
-
command.action === "compose" ||
|
|
359
|
+
(command.action === "compose" && command.flags.plan !== true) ||
|
|
349
360
|
(command.action === "namespace" && command.positionals.length > 0));
|
|
350
361
|
}
|
|
351
362
|
function forwardsMutation(command) {
|
|
352
363
|
return (command.action !== "show" &&
|
|
353
364
|
command.action !== "tree" &&
|
|
354
365
|
command.action !== "namespace" &&
|
|
366
|
+
!(command.action === "compose" && command.flags.plan === true) &&
|
|
355
367
|
!isWorldObservation(command));
|
|
356
368
|
}
|
|
357
369
|
export async function invokeTask(command, input) {
|
|
358
|
-
const
|
|
370
|
+
const planOnly = command.action === "compose" && command.flags.plan === true;
|
|
371
|
+
const world = input.world ?? (planOnly ? input.candidate : establishesWorld(command) ? await input.establish() : null);
|
|
359
372
|
if (world === null)
|
|
360
373
|
return missingWorld(command);
|
|
361
374
|
const tasks = Tasks.of(world);
|
|
@@ -133,9 +133,27 @@ task add [--namespace <ns>] [--actor <actor>] -`,
|
|
|
133
133
|
compose: {
|
|
134
134
|
arity: [0, 0],
|
|
135
135
|
stdin: "compose",
|
|
136
|
-
flags: { ...COMMON, actor: "value" },
|
|
137
|
-
usage: "task compose [--actor <actor>] -",
|
|
138
|
-
purpose: "
|
|
136
|
+
flags: { ...COMMON, actor: "value", plan: "boolean" },
|
|
137
|
+
usage: "task compose [--actor <actor>] [--plan] -",
|
|
138
|
+
purpose: "Plan or admit one explicit Task composition.",
|
|
139
|
+
details: [
|
|
140
|
+
"nodes: + <Title> creates; @task/<id> modifies a pre-existing Task",
|
|
141
|
+
"properties: as = <alias>; pri = 0..3; parent = <ref>|empty",
|
|
142
|
+
"relations: needs|supersedes|relates with =, +=, or -=",
|
|
143
|
+
"references: @task/... is pre-existing; ^alias is new in this document",
|
|
144
|
+
"body: body = clears; body <<TOKEN reads exact content to TOKEN",
|
|
145
|
+
"TOKEN: [A-Z][A-Z0-9_]* with length 3..32",
|
|
146
|
+
"example:",
|
|
147
|
+
" ns=feature",
|
|
148
|
+
" + Parent",
|
|
149
|
+
" as = parent",
|
|
150
|
+
" pri = 1",
|
|
151
|
+
" body <<BODY",
|
|
152
|
+
" Exact body bytes.",
|
|
153
|
+
" BODY",
|
|
154
|
+
" + Child",
|
|
155
|
+
" parent = ^parent",
|
|
156
|
+
].join("\n"),
|
|
139
157
|
},
|
|
140
158
|
};
|
|
141
159
|
export function isTaskAction(value) {
|
package/build/src/cli/invoke.js
CHANGED
|
@@ -318,6 +318,7 @@ async function invokeParsed(invocation, runtime) {
|
|
|
318
318
|
return await (await import("./commands/task-invoke.js")).invokeTaskFromEdge({
|
|
319
319
|
parsed,
|
|
320
320
|
world,
|
|
321
|
+
candidate: candidateWorld,
|
|
321
322
|
context: taskContext,
|
|
322
323
|
establish: coordinates.establishWorld,
|
|
323
324
|
readStdin: edge.readStdin,
|
|
@@ -59,6 +59,9 @@ function projectRefusal(refusal) {
|
|
|
59
59
|
if (refusal.kind === "relation-owned-by-other") {
|
|
60
60
|
return { line: `relation-owned-by-other ${refusal.taskId} ${refusal.related} ${refusal.declaringTask}` };
|
|
61
61
|
}
|
|
62
|
+
if (refusal.kind === "invalid-composition") {
|
|
63
|
+
return { line: refusal.kind, compositionDiagnostics: refusal.diagnostics };
|
|
64
|
+
}
|
|
62
65
|
return { line: refusal.kind, diagnostic: refusal.diagnostic };
|
|
63
66
|
}
|
|
64
67
|
function appendDiagnostic(lines, diagnostic) {
|
|
@@ -73,6 +76,9 @@ function renderFailure(verb, result, columns) {
|
|
|
73
76
|
const facts = projectRefusal(result.refusal);
|
|
74
77
|
lines.push(facts.line);
|
|
75
78
|
appendDiagnostic(lines, facts.diagnostic);
|
|
79
|
+
for (const item of facts.compositionDiagnostics ?? []) {
|
|
80
|
+
lines.push(`line ${item.line} · ${safeText(item.reason)} · ${safeText(item.token)}`);
|
|
81
|
+
}
|
|
76
82
|
return lines.join("\n");
|
|
77
83
|
}
|
|
78
84
|
function edge(label, ref, mark) {
|
|
@@ -256,12 +262,30 @@ function stoppedLines(stopped) {
|
|
|
256
262
|
appendDiagnostic(lines, facts.diagnostic);
|
|
257
263
|
return lines;
|
|
258
264
|
}
|
|
265
|
+
function aliasLines(aliases) {
|
|
266
|
+
return aliases.map((binding) => `alias ^${binding.alias} ${binding.taskId}`);
|
|
267
|
+
}
|
|
268
|
+
function renderPlan(result) {
|
|
269
|
+
const lines = [
|
|
270
|
+
`compose plan · ${result.admissionOrder.length} documents`,
|
|
271
|
+
...aliasLines(result.aliases),
|
|
272
|
+
...result.admissionOrder.map((id, index) => `admit ${index + 1} ${id}`),
|
|
273
|
+
];
|
|
274
|
+
for (const body of result.bodies) {
|
|
275
|
+
lines.push(`body ${body.taskId} · ${body.bytes} bytes`);
|
|
276
|
+
lines.push(` first ${safeText(body.firstLine)}`);
|
|
277
|
+
lines.push(` last ${safeText(body.lastLine)}`);
|
|
278
|
+
}
|
|
279
|
+
return lines.join("\n");
|
|
280
|
+
}
|
|
259
281
|
function renderCompose(result, columns) {
|
|
260
282
|
if (result.kind === "incomplete")
|
|
261
283
|
return "";
|
|
284
|
+
if (result.kind === "planned")
|
|
285
|
+
return renderPlan(result);
|
|
262
286
|
if (result.kind !== "accepted")
|
|
263
287
|
return renderFailure("compose", result, columns);
|
|
264
|
-
const lines = [`✓ compose accepted · ${result.documentChanges.length} changed
|
|
288
|
+
const lines = [`✓ compose accepted · ${result.documentChanges.length} changed`, ...aliasLines(result.aliases)];
|
|
265
289
|
composeDiffs(lines, result.documentChanges);
|
|
266
290
|
return lines.join("\n");
|
|
267
291
|
}
|
|
@@ -0,0 +1,43 @@
|
|
|
1
|
+
import type { TaskBoard } from "./board.js";
|
|
2
|
+
import { type TaskDocument } from "./document.js";
|
|
3
|
+
import { type TaskId } from "./identity.js";
|
|
4
|
+
import { type TaskCompositionDiagnostic } from "./operations.js";
|
|
5
|
+
export type TaskCompositionAlias = Readonly<{
|
|
6
|
+
alias: string;
|
|
7
|
+
taskId: TaskId;
|
|
8
|
+
}>;
|
|
9
|
+
export type TaskCompositionBodyPreview = Readonly<{
|
|
10
|
+
taskId: TaskId;
|
|
11
|
+
bytes: number;
|
|
12
|
+
firstLine: string;
|
|
13
|
+
lastLine: string;
|
|
14
|
+
}>;
|
|
15
|
+
export type PlannedTask = Readonly<{
|
|
16
|
+
index: number;
|
|
17
|
+
line: number;
|
|
18
|
+
kind: "new" | "existing";
|
|
19
|
+
alias?: string;
|
|
20
|
+
before: TaskDocument | null;
|
|
21
|
+
after: TaskDocument;
|
|
22
|
+
}>;
|
|
23
|
+
export type TaskCompositionPlan = Readonly<{
|
|
24
|
+
namespace: readonly string[];
|
|
25
|
+
aliases: readonly TaskCompositionAlias[];
|
|
26
|
+
admissionOrder: readonly TaskId[];
|
|
27
|
+
bodies: readonly TaskCompositionBodyPreview[];
|
|
28
|
+
tasks: readonly PlannedTask[];
|
|
29
|
+
}>;
|
|
30
|
+
export type TaskCompositionPlanning = Readonly<{
|
|
31
|
+
kind: "planned";
|
|
32
|
+
plan: TaskCompositionPlan;
|
|
33
|
+
}> | Readonly<{
|
|
34
|
+
kind: "refused";
|
|
35
|
+
diagnostics: readonly TaskCompositionDiagnostic[];
|
|
36
|
+
}>;
|
|
37
|
+
export declare function planTaskComposition(input: Readonly<{
|
|
38
|
+
markdown: string;
|
|
39
|
+
board: TaskBoard;
|
|
40
|
+
namespace: readonly string[];
|
|
41
|
+
at: string;
|
|
42
|
+
actor?: string;
|
|
43
|
+
}>): TaskCompositionPlanning;
|
|
@@ -0,0 +1,314 @@
|
|
|
1
|
+
import { serializeTaskDocument } from "./document.js";
|
|
2
|
+
import { allocateLocalId, deriveLocalStem, formatTaskId, parseTaskId, sameNamespace } from "./identity.js";
|
|
3
|
+
import { parseTaskComposition } from "./compose-parser.js";
|
|
4
|
+
import { advanceTaskTimestamp } from "./operations.js";
|
|
5
|
+
function diagnostic(line, reason, token) {
|
|
6
|
+
return { line, reason, token };
|
|
7
|
+
}
|
|
8
|
+
function occupied(board, namespace) {
|
|
9
|
+
return new Set([...board.tasks.values()].flatMap((task) => {
|
|
10
|
+
const coordinate = parseTaskId(task.id);
|
|
11
|
+
return sameNamespace(coordinate.namespace, namespace) ? [coordinate.localId] : [];
|
|
12
|
+
}));
|
|
13
|
+
}
|
|
14
|
+
function createdTask(id, title, at, actor) {
|
|
15
|
+
return {
|
|
16
|
+
id,
|
|
17
|
+
title,
|
|
18
|
+
state: "open",
|
|
19
|
+
priority: 2,
|
|
20
|
+
needs: [],
|
|
21
|
+
parent: null,
|
|
22
|
+
supersedes: [],
|
|
23
|
+
relates: [],
|
|
24
|
+
note: "",
|
|
25
|
+
...(actor === undefined ? {} : { createdBy: actor }),
|
|
26
|
+
createdAt: at,
|
|
27
|
+
updatedAt: at,
|
|
28
|
+
body: "",
|
|
29
|
+
};
|
|
30
|
+
}
|
|
31
|
+
function aliasFor(node) {
|
|
32
|
+
return node.assignments.find((item) => item.field === "as");
|
|
33
|
+
}
|
|
34
|
+
function allocateNodes(parsed, board, namespace, at, actor, diagnostics) {
|
|
35
|
+
const ids = occupied(board, namespace);
|
|
36
|
+
const allocations = new Map();
|
|
37
|
+
for (const node of parsed.nodes) {
|
|
38
|
+
if (node.kind !== "new")
|
|
39
|
+
continue;
|
|
40
|
+
try {
|
|
41
|
+
const localId = allocateLocalId(deriveLocalStem(node.title), ids);
|
|
42
|
+
ids.add(localId);
|
|
43
|
+
const id = formatTaskId({ namespace, localId });
|
|
44
|
+
allocations.set(node.index, createdTask(id, node.title, at, actor));
|
|
45
|
+
}
|
|
46
|
+
catch (error) {
|
|
47
|
+
diagnostics.push(diagnostic(node.line, error instanceof Error ? error.message : String(error), node.title));
|
|
48
|
+
}
|
|
49
|
+
}
|
|
50
|
+
return allocations;
|
|
51
|
+
}
|
|
52
|
+
function collectAliases(nodes, allocations, diagnostics) {
|
|
53
|
+
const aliases = new Map();
|
|
54
|
+
for (const node of nodes) {
|
|
55
|
+
const declarations = node.assignments.filter((item) => item.field === "as");
|
|
56
|
+
for (const duplicate of declarations.slice(1)) {
|
|
57
|
+
diagnostics.push(diagnostic(duplicate.line, "alias is assigned more than once", duplicate.token));
|
|
58
|
+
}
|
|
59
|
+
const declaration = declarations[0];
|
|
60
|
+
if (declaration === undefined)
|
|
61
|
+
continue;
|
|
62
|
+
if (node.kind !== "new") {
|
|
63
|
+
diagnostics.push(diagnostic(declaration.line, "only a new task may declare an alias", declaration.token));
|
|
64
|
+
continue;
|
|
65
|
+
}
|
|
66
|
+
if (declaration.operator !== "=" || !/^[a-z0-9-]+$/u.test(declaration.value)) {
|
|
67
|
+
diagnostics.push(diagnostic(declaration.line, "alias must use as = [a-z0-9-]+", declaration.token));
|
|
68
|
+
continue;
|
|
69
|
+
}
|
|
70
|
+
if (aliases.has(declaration.value)) {
|
|
71
|
+
diagnostics.push(diagnostic(declaration.line, "alias must be unique in the composition", declaration.value));
|
|
72
|
+
continue;
|
|
73
|
+
}
|
|
74
|
+
const allocated = allocations.get(node.index);
|
|
75
|
+
if (allocated !== undefined)
|
|
76
|
+
aliases.set(declaration.value, allocated.id);
|
|
77
|
+
}
|
|
78
|
+
return aliases;
|
|
79
|
+
}
|
|
80
|
+
function resolveReference(raw, line, board, aliases, diagnostics) {
|
|
81
|
+
if (raw.startsWith("^")) {
|
|
82
|
+
const alias = raw.slice(1);
|
|
83
|
+
const resolved = aliases.get(alias);
|
|
84
|
+
if (resolved === undefined)
|
|
85
|
+
diagnostics.push(diagnostic(line, "new-task alias is not declared", raw));
|
|
86
|
+
return resolved;
|
|
87
|
+
}
|
|
88
|
+
if (!raw.startsWith("@task/")) {
|
|
89
|
+
diagnostics.push(diagnostic(line, "reference must be @task/... or ^alias", raw));
|
|
90
|
+
return undefined;
|
|
91
|
+
}
|
|
92
|
+
try {
|
|
93
|
+
const id = raw.slice(1);
|
|
94
|
+
parseTaskId(id);
|
|
95
|
+
if (!board.tasks.has(id))
|
|
96
|
+
diagnostics.push(diagnostic(line, "@ reference must name a pre-existing task", raw));
|
|
97
|
+
return board.tasks.has(id) ? id : undefined;
|
|
98
|
+
}
|
|
99
|
+
catch (error) {
|
|
100
|
+
diagnostics.push(diagnostic(line, error instanceof Error ? error.message : String(error), raw));
|
|
101
|
+
return undefined;
|
|
102
|
+
}
|
|
103
|
+
}
|
|
104
|
+
function referenceList(assignment, board, aliases, diagnostics) {
|
|
105
|
+
if (assignment.value === "")
|
|
106
|
+
return [];
|
|
107
|
+
const raw = assignment.value.split(",").map((item) => item.trim());
|
|
108
|
+
if (raw.some((item) => item.length === 0)) {
|
|
109
|
+
diagnostics.push(diagnostic(assignment.line, "reference list contains an empty item", assignment.token));
|
|
110
|
+
return undefined;
|
|
111
|
+
}
|
|
112
|
+
const resolved = raw.map((item) => resolveReference(item, assignment.line, board, aliases, diagnostics));
|
|
113
|
+
if (resolved.some((item) => item === undefined))
|
|
114
|
+
return undefined;
|
|
115
|
+
const ids = resolved;
|
|
116
|
+
if (new Set(ids).size !== ids.length) {
|
|
117
|
+
diagnostics.push(diagnostic(assignment.line, "reference list contains a duplicate", assignment.token));
|
|
118
|
+
return undefined;
|
|
119
|
+
}
|
|
120
|
+
return ids;
|
|
121
|
+
}
|
|
122
|
+
function patchRelation(current, assignment, values, diagnostics) {
|
|
123
|
+
if (assignment.operator === "=")
|
|
124
|
+
return values;
|
|
125
|
+
if (assignment.operator === "+=")
|
|
126
|
+
return [...current, ...values.filter((id) => !current.includes(id))];
|
|
127
|
+
const missing = values.filter((id) => !current.includes(id));
|
|
128
|
+
for (const id of missing)
|
|
129
|
+
diagnostics.push(diagnostic(assignment.line, "cannot remove an absent relation", `@${id}`));
|
|
130
|
+
return missing.length === 0 ? current.filter((id) => !values.includes(id)) : current;
|
|
131
|
+
}
|
|
132
|
+
function applyAssignments(node, base, board, aliases, diagnostics) {
|
|
133
|
+
let next = base;
|
|
134
|
+
const scalar = new Set();
|
|
135
|
+
for (const assignment of node.assignments) {
|
|
136
|
+
if (assignment.field === "as")
|
|
137
|
+
continue;
|
|
138
|
+
if (assignment.field === "pri" || assignment.field === "parent") {
|
|
139
|
+
if (scalar.has(assignment.field)) {
|
|
140
|
+
diagnostics.push(diagnostic(assignment.line, `${assignment.field} is assigned more than once`, assignment.token));
|
|
141
|
+
}
|
|
142
|
+
scalar.add(assignment.field);
|
|
143
|
+
}
|
|
144
|
+
if (assignment.field === "pri") {
|
|
145
|
+
if (assignment.operator !== "=" || !/^[0-3]$/u.test(assignment.value)) {
|
|
146
|
+
diagnostics.push(diagnostic(assignment.line, "pri must use = with a value from 0 through 3", assignment.token));
|
|
147
|
+
}
|
|
148
|
+
else
|
|
149
|
+
next = { ...next, priority: Number(assignment.value) };
|
|
150
|
+
continue;
|
|
151
|
+
}
|
|
152
|
+
if (assignment.field === "parent") {
|
|
153
|
+
if (assignment.operator !== "=") {
|
|
154
|
+
diagnostics.push(diagnostic(assignment.line, "parent accepts only =", assignment.token));
|
|
155
|
+
}
|
|
156
|
+
else if (assignment.value === "")
|
|
157
|
+
next = { ...next, parent: null };
|
|
158
|
+
else {
|
|
159
|
+
const id = resolveReference(assignment.value.trim(), assignment.line, board, aliases, diagnostics);
|
|
160
|
+
if (id !== undefined)
|
|
161
|
+
next = { ...next, parent: id };
|
|
162
|
+
}
|
|
163
|
+
continue;
|
|
164
|
+
}
|
|
165
|
+
const values = referenceList(assignment, board, aliases, diagnostics);
|
|
166
|
+
if (values === undefined)
|
|
167
|
+
continue;
|
|
168
|
+
if (assignment.operator !== "=" && values.length === 0) {
|
|
169
|
+
diagnostics.push(diagnostic(assignment.line, `${assignment.operator} requires at least one reference`, assignment.token));
|
|
170
|
+
continue;
|
|
171
|
+
}
|
|
172
|
+
next = { ...next, [assignment.field]: patchRelation(next[assignment.field], assignment, values, diagnostics) };
|
|
173
|
+
}
|
|
174
|
+
if (node.body !== undefined)
|
|
175
|
+
next = { ...next, body: node.body.value };
|
|
176
|
+
for (const field of ["needs", "supersedes", "relates"]) {
|
|
177
|
+
if (next[field].includes(next.id))
|
|
178
|
+
diagnostics.push(diagnostic(node.line, `${field} cannot reference the task itself`, next.id));
|
|
179
|
+
}
|
|
180
|
+
if (next.parent === next.id)
|
|
181
|
+
diagnostics.push(diagnostic(node.line, "parent cannot reference the task itself", next.id));
|
|
182
|
+
return next;
|
|
183
|
+
}
|
|
184
|
+
function relationTargets(document, relation) {
|
|
185
|
+
return relation === "needs" ? document.needs : document.parent === null ? [] : [document.parent];
|
|
186
|
+
}
|
|
187
|
+
function pathExists(board, start, goal, relation) {
|
|
188
|
+
const seen = new Set();
|
|
189
|
+
const pending = [start];
|
|
190
|
+
while (pending.length > 0) {
|
|
191
|
+
const id = pending.pop();
|
|
192
|
+
if (id === goal)
|
|
193
|
+
return true;
|
|
194
|
+
if (seen.has(id))
|
|
195
|
+
continue;
|
|
196
|
+
seen.add(id);
|
|
197
|
+
const task = board.tasks.get(id);
|
|
198
|
+
if (task !== undefined)
|
|
199
|
+
pending.push(...relationTargets(task, relation));
|
|
200
|
+
}
|
|
201
|
+
return false;
|
|
202
|
+
}
|
|
203
|
+
function diagnoseIntroducedCycles(after, tasks, diagnostics) {
|
|
204
|
+
for (const task of tasks) {
|
|
205
|
+
for (const relation of ["needs", "parent"]) {
|
|
206
|
+
const old = task.before === null ? [] : relationTargets(task.before, relation);
|
|
207
|
+
for (const target of relationTargets(task.after, relation)) {
|
|
208
|
+
if (!old.includes(target) && pathExists(after, target, task.after.id, relation)) {
|
|
209
|
+
diagnostics.push(diagnostic(task.line, `${relation} edge creates a cycle`, `${task.after.id} -> ${target}`));
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
}
|
|
214
|
+
}
|
|
215
|
+
function changed(task) {
|
|
216
|
+
return (task.before === null ||
|
|
217
|
+
!Buffer.from(serializeTaskDocument(task.before)).equals(Buffer.from(serializeTaskDocument(task.after))));
|
|
218
|
+
}
|
|
219
|
+
function stableAdmissionOrder(tasks, diagnostics) {
|
|
220
|
+
const candidates = tasks.filter(changed);
|
|
221
|
+
const byId = new Map(candidates.map((task) => [task.after.id, task]));
|
|
222
|
+
const dependencies = new Map(candidates.map((task) => [task.after.id, new Set()]));
|
|
223
|
+
for (const task of candidates) {
|
|
224
|
+
const targets = [...task.after.needs, ...(task.after.parent === null ? [] : [task.after.parent])];
|
|
225
|
+
for (const target of targets) {
|
|
226
|
+
const plannedTarget = byId.get(target);
|
|
227
|
+
if (plannedTarget?.before === null)
|
|
228
|
+
dependencies.get(task.after.id).add(target);
|
|
229
|
+
}
|
|
230
|
+
}
|
|
231
|
+
const remaining = new Set(candidates.map((task) => task.after.id));
|
|
232
|
+
const ordered = [];
|
|
233
|
+
while (remaining.size > 0) {
|
|
234
|
+
const ready = candidates.find((task) => remaining.has(task.after.id) && [...dependencies.get(task.after.id)].every((id) => !remaining.has(id)));
|
|
235
|
+
if (ready === undefined) {
|
|
236
|
+
const first = candidates.find((task) => remaining.has(task.after.id));
|
|
237
|
+
diagnostics.push(diagnostic(first.line, "needs and parent references create an admission cycle", first.after.id));
|
|
238
|
+
return [];
|
|
239
|
+
}
|
|
240
|
+
remaining.delete(ready.after.id);
|
|
241
|
+
ordered.push(ready);
|
|
242
|
+
}
|
|
243
|
+
return ordered;
|
|
244
|
+
}
|
|
245
|
+
function bodyPreview(node, id) {
|
|
246
|
+
if (node.body?.kind !== "replace")
|
|
247
|
+
return null;
|
|
248
|
+
const lines = node.body.value.split(/\r\n|\n|\r/u);
|
|
249
|
+
return {
|
|
250
|
+
taskId: id,
|
|
251
|
+
bytes: Buffer.byteLength(node.body.value),
|
|
252
|
+
firstLine: lines[0] ?? "",
|
|
253
|
+
lastLine: lines.at(-1) ?? "",
|
|
254
|
+
};
|
|
255
|
+
}
|
|
256
|
+
export function planTaskComposition(input) {
|
|
257
|
+
const parsed = parseTaskComposition(input.markdown);
|
|
258
|
+
const diagnostics = [...parsed.diagnostics];
|
|
259
|
+
const namespace = parsed.namespace ?? input.namespace;
|
|
260
|
+
const allocations = allocateNodes(parsed, input.board, namespace, input.at, input.actor, diagnostics);
|
|
261
|
+
const aliases = collectAliases(parsed.nodes, allocations, diagnostics);
|
|
262
|
+
const addressed = new Set();
|
|
263
|
+
const tasks = [];
|
|
264
|
+
for (const node of parsed.nodes) {
|
|
265
|
+
const before = node.kind === "new" ? null : (input.board.tasks.get(node.id) ?? null);
|
|
266
|
+
const base = node.kind === "new" ? allocations.get(node.index) : before;
|
|
267
|
+
if (base === null || base === undefined) {
|
|
268
|
+
diagnostics.push(diagnostic(node.line, "existing task does not exist before composition", `@${node.id}`));
|
|
269
|
+
continue;
|
|
270
|
+
}
|
|
271
|
+
if (addressed.has(base.id)) {
|
|
272
|
+
diagnostics.push(diagnostic(node.line, "task is addressed more than once", base.id));
|
|
273
|
+
continue;
|
|
274
|
+
}
|
|
275
|
+
addressed.add(base.id);
|
|
276
|
+
let after = applyAssignments(node, base, input.board, aliases, diagnostics);
|
|
277
|
+
if (before !== null && changed({ index: node.index, line: node.line, kind: node.kind, before, after })) {
|
|
278
|
+
after = { ...after, updatedAt: advanceTaskTimestamp(before.updatedAt, input.at) };
|
|
279
|
+
}
|
|
280
|
+
tasks.push({
|
|
281
|
+
index: node.index,
|
|
282
|
+
line: node.line,
|
|
283
|
+
kind: node.kind,
|
|
284
|
+
...(aliasFor(node) === undefined ? {} : { alias: aliasFor(node).value }),
|
|
285
|
+
before,
|
|
286
|
+
after,
|
|
287
|
+
});
|
|
288
|
+
}
|
|
289
|
+
const post = new Map(input.board.tasks);
|
|
290
|
+
for (const task of tasks)
|
|
291
|
+
post.set(task.after.id, task.after);
|
|
292
|
+
diagnoseIntroducedCycles({ tasks: post }, tasks, diagnostics);
|
|
293
|
+
const ordered = stableAdmissionOrder(tasks, diagnostics);
|
|
294
|
+
if (diagnostics.length > 0)
|
|
295
|
+
return { kind: "refused", diagnostics };
|
|
296
|
+
const aliasBindings = [...aliases].map(([alias, taskId]) => ({ alias, taskId }));
|
|
297
|
+
const bodies = parsed.nodes.flatMap((node) => {
|
|
298
|
+
const task = tasks.find((candidate) => candidate.index === node.index);
|
|
299
|
+
if (task === undefined)
|
|
300
|
+
return [];
|
|
301
|
+
const preview = bodyPreview(node, task.after.id);
|
|
302
|
+
return preview === null ? [] : [preview];
|
|
303
|
+
});
|
|
304
|
+
return {
|
|
305
|
+
kind: "planned",
|
|
306
|
+
plan: {
|
|
307
|
+
namespace,
|
|
308
|
+
aliases: aliasBindings,
|
|
309
|
+
admissionOrder: ordered.map((task) => task.after.id),
|
|
310
|
+
bodies,
|
|
311
|
+
tasks: ordered,
|
|
312
|
+
},
|
|
313
|
+
};
|
|
314
|
+
}
|
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
import { type TaskId } from "./identity.js";
|
|
2
|
+
import type { TaskCompositionDiagnostic } from "./operations.js";
|
|
3
|
+
export type RelationField = "needs" | "supersedes" | "relates";
|
|
4
|
+
export type Assignment = Readonly<{
|
|
5
|
+
field: "as" | "parent" | "pri" | RelationField;
|
|
6
|
+
operator: "=" | "+=" | "-=";
|
|
7
|
+
value: string;
|
|
8
|
+
line: number;
|
|
9
|
+
token: string;
|
|
10
|
+
}>;
|
|
11
|
+
export type BodyAssignment = Readonly<{
|
|
12
|
+
kind: "clear" | "replace";
|
|
13
|
+
value: string;
|
|
14
|
+
line: number;
|
|
15
|
+
token: string;
|
|
16
|
+
}>;
|
|
17
|
+
export type ParsedNode = Readonly<{
|
|
18
|
+
index: number;
|
|
19
|
+
line: number;
|
|
20
|
+
kind: "new" | "existing";
|
|
21
|
+
title?: string;
|
|
22
|
+
id?: TaskId;
|
|
23
|
+
assignments: readonly Assignment[];
|
|
24
|
+
body?: BodyAssignment;
|
|
25
|
+
}>;
|
|
26
|
+
export type ParsedComposition = Readonly<{
|
|
27
|
+
namespace?: readonly string[];
|
|
28
|
+
nodes: readonly ParsedNode[];
|
|
29
|
+
diagnostics: readonly TaskCompositionDiagnostic[];
|
|
30
|
+
}>;
|
|
31
|
+
export declare function parseTaskComposition(source: string): ParsedComposition;
|
|
@@ -0,0 +1,162 @@
|
|
|
1
|
+
import { parseTaskId } from "./identity.js";
|
|
2
|
+
function diagnostic(line, reason, token) {
|
|
3
|
+
return { line, reason, token };
|
|
4
|
+
}
|
|
5
|
+
function sourceLines(source) {
|
|
6
|
+
const lines = [];
|
|
7
|
+
let start = 0;
|
|
8
|
+
let number = 1;
|
|
9
|
+
while (start < source.length) {
|
|
10
|
+
let cursor = start;
|
|
11
|
+
while (cursor < source.length && source[cursor] !== "\n" && source[cursor] !== "\r")
|
|
12
|
+
cursor += 1;
|
|
13
|
+
let end = cursor;
|
|
14
|
+
if (source[cursor] === "\r" && source[cursor + 1] === "\n")
|
|
15
|
+
end += 2;
|
|
16
|
+
else if (cursor < source.length)
|
|
17
|
+
end += 1;
|
|
18
|
+
lines.push({ number, start, end, text: source.slice(start, cursor) });
|
|
19
|
+
start = end;
|
|
20
|
+
number += 1;
|
|
21
|
+
}
|
|
22
|
+
if (source.length === 0 || source.endsWith("\n") || source.endsWith("\r")) {
|
|
23
|
+
lines.push({ number, start: source.length, end: source.length, text: "" });
|
|
24
|
+
}
|
|
25
|
+
return lines;
|
|
26
|
+
}
|
|
27
|
+
function withoutFenceSeparator(value) {
|
|
28
|
+
if (value.endsWith("\r\n"))
|
|
29
|
+
return value.slice(0, -2);
|
|
30
|
+
if (value.endsWith("\n") || value.endsWith("\r"))
|
|
31
|
+
return value.slice(0, -1);
|
|
32
|
+
return value;
|
|
33
|
+
}
|
|
34
|
+
function parseNamespace(value) {
|
|
35
|
+
if (value === "")
|
|
36
|
+
return [];
|
|
37
|
+
return parseTaskId(`task/${value}/placeholder`).namespace;
|
|
38
|
+
}
|
|
39
|
+
function parseAssignment(text, line) {
|
|
40
|
+
const matched = /^(as|parent|pri|needs|supersedes|relates)\s*(=|\+=|-=)\s*(.*)$/u.exec(text);
|
|
41
|
+
if (matched === null)
|
|
42
|
+
return null;
|
|
43
|
+
return {
|
|
44
|
+
field: matched[1],
|
|
45
|
+
operator: matched[2],
|
|
46
|
+
value: matched[3],
|
|
47
|
+
line,
|
|
48
|
+
token: text,
|
|
49
|
+
};
|
|
50
|
+
}
|
|
51
|
+
function parseNode(text, line, index) {
|
|
52
|
+
if (text.startsWith("+ ")) {
|
|
53
|
+
const title = text.slice(2);
|
|
54
|
+
return title.trim().length === 0
|
|
55
|
+
? diagnostic(line, "new task title must be nonblank", text)
|
|
56
|
+
: { index, line, kind: "new", title, assignments: [] };
|
|
57
|
+
}
|
|
58
|
+
if (!text.startsWith("@task/"))
|
|
59
|
+
return diagnostic(line, "node must begin with + or @task/", text);
|
|
60
|
+
try {
|
|
61
|
+
const id = text.slice(1);
|
|
62
|
+
parseTaskId(id);
|
|
63
|
+
return { index, line, kind: "existing", id, assignments: [] };
|
|
64
|
+
}
|
|
65
|
+
catch (error) {
|
|
66
|
+
return diagnostic(line, error instanceof Error ? error.message : String(error), text);
|
|
67
|
+
}
|
|
68
|
+
}
|
|
69
|
+
function withAssignment(node, assignment) {
|
|
70
|
+
return { ...node, assignments: [...node.assignments, assignment] };
|
|
71
|
+
}
|
|
72
|
+
function withBody(node, body) {
|
|
73
|
+
return { ...node, body };
|
|
74
|
+
}
|
|
75
|
+
function replaceNode(nodes, node) {
|
|
76
|
+
nodes[node.index] = node;
|
|
77
|
+
}
|
|
78
|
+
export function parseTaskComposition(source) {
|
|
79
|
+
const lines = sourceLines(source);
|
|
80
|
+
const diagnostics = [];
|
|
81
|
+
const nodes = [];
|
|
82
|
+
let namespace;
|
|
83
|
+
let current;
|
|
84
|
+
let sawNode = false;
|
|
85
|
+
let sawNamespace = false;
|
|
86
|
+
for (let index = 0; index < lines.length; index += 1) {
|
|
87
|
+
const line = lines[index];
|
|
88
|
+
const text = line.text.trimStart();
|
|
89
|
+
if (text.trim().length === 0)
|
|
90
|
+
continue;
|
|
91
|
+
if (text.startsWith("ns=")) {
|
|
92
|
+
if (sawNode || sawNamespace)
|
|
93
|
+
diagnostics.push(diagnostic(line.number, "namespace must be the first nonblank line", text));
|
|
94
|
+
else {
|
|
95
|
+
try {
|
|
96
|
+
namespace = parseNamespace(text.slice(3));
|
|
97
|
+
}
|
|
98
|
+
catch (error) {
|
|
99
|
+
diagnostics.push(diagnostic(line.number, error instanceof Error ? error.message : String(error), text));
|
|
100
|
+
}
|
|
101
|
+
}
|
|
102
|
+
sawNamespace = true;
|
|
103
|
+
continue;
|
|
104
|
+
}
|
|
105
|
+
if (text.startsWith("+ ") || text.startsWith("@task/")) {
|
|
106
|
+
const parsed = parseNode(text, line.number, nodes.length);
|
|
107
|
+
if ("reason" in parsed) {
|
|
108
|
+
diagnostics.push(parsed);
|
|
109
|
+
current = undefined;
|
|
110
|
+
}
|
|
111
|
+
else {
|
|
112
|
+
nodes.push(parsed);
|
|
113
|
+
current = parsed;
|
|
114
|
+
}
|
|
115
|
+
sawNode = true;
|
|
116
|
+
continue;
|
|
117
|
+
}
|
|
118
|
+
if (current === undefined) {
|
|
119
|
+
diagnostics.push(diagnostic(line.number, "property must follow a task node", text));
|
|
120
|
+
continue;
|
|
121
|
+
}
|
|
122
|
+
const fence = /^body\s+<<(.+)$/u.exec(text);
|
|
123
|
+
if (fence !== null) {
|
|
124
|
+
const token = fence[1];
|
|
125
|
+
if (!/^[A-Z][A-Z0-9_]{2,31}$/u.test(token)) {
|
|
126
|
+
diagnostics.push(diagnostic(line.number, "body token must match [A-Z][A-Z0-9_]* with length 3..32", token));
|
|
127
|
+
continue;
|
|
128
|
+
}
|
|
129
|
+
const close = lines.findIndex((candidate, candidateIndex) => candidateIndex > index && candidate.text === token);
|
|
130
|
+
if (close < 0) {
|
|
131
|
+
diagnostics.push(diagnostic(line.number, "body fence is not closed", token));
|
|
132
|
+
break;
|
|
133
|
+
}
|
|
134
|
+
const body = withoutFenceSeparator(source.slice(line.end, lines[close].start));
|
|
135
|
+
if (current.body !== undefined)
|
|
136
|
+
diagnostics.push(diagnostic(line.number, "body is assigned more than once", text));
|
|
137
|
+
else {
|
|
138
|
+
current = withBody(current, { kind: "replace", value: body, line: line.number, token });
|
|
139
|
+
replaceNode(nodes, current);
|
|
140
|
+
}
|
|
141
|
+
index = close;
|
|
142
|
+
continue;
|
|
143
|
+
}
|
|
144
|
+
if (/^body\s*=\s*$/u.test(text)) {
|
|
145
|
+
if (current.body !== undefined)
|
|
146
|
+
diagnostics.push(diagnostic(line.number, "body is assigned more than once", text));
|
|
147
|
+
else {
|
|
148
|
+
current = withBody(current, { kind: "clear", value: "", line: line.number, token: text });
|
|
149
|
+
replaceNode(nodes, current);
|
|
150
|
+
}
|
|
151
|
+
continue;
|
|
152
|
+
}
|
|
153
|
+
const assignment = parseAssignment(text, line.number);
|
|
154
|
+
if (assignment === null)
|
|
155
|
+
diagnostics.push(diagnostic(line.number, "unknown compose property", text));
|
|
156
|
+
else {
|
|
157
|
+
current = withAssignment(current, assignment);
|
|
158
|
+
replaceNode(nodes, current);
|
|
159
|
+
}
|
|
160
|
+
}
|
|
161
|
+
return { ...(namespace === undefined ? {} : { namespace }), nodes, diagnostics };
|
|
162
|
+
}
|
|
@@ -1,18 +1,30 @@
|
|
|
1
|
-
import { type TaskId } from "./identity.js";
|
|
2
1
|
import type { WorldRoot } from "../world.js";
|
|
3
|
-
import { type
|
|
4
|
-
type
|
|
2
|
+
import { type TaskCompositionAlias, type TaskCompositionBodyPreview } from "./compose-language.js";
|
|
3
|
+
import type { TaskId } from "./identity.js";
|
|
4
|
+
import type { TaskRefusal, TaskRetry } from "./operations.js";
|
|
5
|
+
export type TaskDocumentChange = Readonly<{
|
|
5
6
|
taskId: TaskId;
|
|
6
7
|
kind: "created" | "updated";
|
|
7
8
|
documentDiff: string;
|
|
8
9
|
}>;
|
|
10
|
+
export type TaskCompositionFacts = Readonly<{
|
|
11
|
+
aliases: readonly TaskCompositionAlias[];
|
|
12
|
+
admissionOrder: readonly TaskId[];
|
|
13
|
+
}>;
|
|
9
14
|
export type TaskCompositionResult = Readonly<{
|
|
15
|
+
kind: "planned";
|
|
16
|
+
aliases: readonly TaskCompositionAlias[];
|
|
17
|
+
admissionOrder: readonly TaskId[];
|
|
18
|
+
bodies: readonly TaskCompositionBodyPreview[];
|
|
19
|
+
}> | Readonly<{
|
|
10
20
|
kind: "accepted";
|
|
11
21
|
documentChanges: readonly TaskDocumentChange[];
|
|
12
|
-
}> | Readonly<{
|
|
22
|
+
} & TaskCompositionFacts> | Readonly<{
|
|
13
23
|
kind: "refused";
|
|
14
|
-
refusal: TaskRefusal
|
|
15
|
-
|
|
24
|
+
refusal: Extract<TaskRefusal, {
|
|
25
|
+
kind: "invalid-composition";
|
|
26
|
+
}>;
|
|
27
|
+
}> | (Readonly<{
|
|
16
28
|
kind: "incomplete";
|
|
17
29
|
documentChanges: readonly TaskDocumentChange[];
|
|
18
30
|
stopped: TaskRefusal | Readonly<{
|
|
@@ -20,6 +32,5 @@ export type TaskCompositionResult = Readonly<{
|
|
|
20
32
|
reason: TaskRetry;
|
|
21
33
|
}>;
|
|
22
34
|
draft: string;
|
|
23
|
-
}
|
|
24
|
-
export declare function composeTasks(world: WorldRoot, markdown: string, signal?: AbortSignal, actor?: string, defaultNamespace?: readonly string[]): Promise<TaskCompositionResult>;
|
|
25
|
-
export {};
|
|
35
|
+
}> & TaskCompositionFacts);
|
|
36
|
+
export declare function composeTasks(world: WorldRoot, markdown: string, signal?: AbortSignal, actor?: string, defaultNamespace?: readonly string[], planOnly?: boolean): Promise<TaskCompositionResult>;
|
|
@@ -1,305 +1,142 @@
|
|
|
1
1
|
import { documentDiff } from "../markdown/diff.js";
|
|
2
|
-
import {
|
|
2
|
+
import { planTaskComposition, } from "./compose-language.js";
|
|
3
3
|
import { serializeTaskDocument } from "./document.js";
|
|
4
|
-
import { allocateLocalId, deriveLocalStem, formatTaskId, parseTaskId, sameNamespace } from "./identity.js";
|
|
5
4
|
import { authorityPath, readBoard, replaceAuthority, withTaskLocks } from "./store.js";
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
return { kind: "invalid-composition", diagnostic };
|
|
5
|
+
function refusal(diagnostics) {
|
|
6
|
+
return { kind: "refused", refusal: { kind: "invalid-composition", diagnostics } };
|
|
9
7
|
}
|
|
10
|
-
function
|
|
11
|
-
|
|
12
|
-
return [];
|
|
13
|
-
const coordinate = parseTaskId(`task/${value}/placeholder`);
|
|
14
|
-
return coordinate.namespace;
|
|
15
|
-
}
|
|
16
|
-
function assignment(token) {
|
|
17
|
-
const matched = /^(parent|needs|supersedes|relates|pri|body)(\+=|=)(.*)$/u.exec(token);
|
|
18
|
-
if (matched === null)
|
|
19
|
-
return null;
|
|
20
|
-
const field = matched[1], append = matched[2] === "+=", value = matched[3];
|
|
21
|
-
if (append && (field === "parent" || field === "pri" || field === "body"))
|
|
22
|
-
throw new TypeError(`${field} does not accept +=`);
|
|
23
|
-
if (field === "body" && (append || value !== ""))
|
|
24
|
-
throw new TypeError("body accepts only bare body=");
|
|
25
|
-
return { field, append, value };
|
|
26
|
-
}
|
|
27
|
-
function parseNode(text, depth, index) {
|
|
28
|
-
const tokens = text.split(/ +/u);
|
|
29
|
-
if (text.startsWith("+ ")) {
|
|
30
|
-
const values = tokens.slice(1);
|
|
31
|
-
const at = values.findIndex((token) => assignment(token) !== null);
|
|
32
|
-
const title = values.slice(0, at < 0 ? values.length : at).join(" ");
|
|
33
|
-
if (title.trim().length === 0)
|
|
34
|
-
throw new TypeError("compose + node requires a title");
|
|
35
|
-
return {
|
|
36
|
-
index,
|
|
37
|
-
depth,
|
|
38
|
-
kind: "new",
|
|
39
|
-
title,
|
|
40
|
-
assignments: (at < 0 ? [] : values.slice(at)).map((token) => assignment(token) ??
|
|
41
|
-
(() => {
|
|
42
|
-
throw new TypeError(`invalid assignment token: ${token}`);
|
|
43
|
-
})()),
|
|
44
|
-
};
|
|
45
|
-
}
|
|
46
|
-
const [rawId, ...rest] = tokens;
|
|
47
|
-
if (rawId === undefined || !rawId.startsWith("@task/"))
|
|
48
|
-
throw new TypeError("compose node must begin with + or @task/");
|
|
49
|
-
const id = `task/${rawId.slice(1).slice(5)}`;
|
|
50
|
-
parseTaskId(id);
|
|
51
|
-
return {
|
|
52
|
-
index,
|
|
53
|
-
depth,
|
|
54
|
-
kind: "existing",
|
|
55
|
-
id,
|
|
56
|
-
assignments: rest.map((token) => assignment(token) ??
|
|
57
|
-
(() => {
|
|
58
|
-
throw new TypeError(`invalid assignment token: ${token}`);
|
|
59
|
-
})()),
|
|
60
|
-
};
|
|
8
|
+
function currentTimestamp() {
|
|
9
|
+
return new Date().toISOString();
|
|
61
10
|
}
|
|
62
|
-
function
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
const text = raw.slice(/^(?:\t| )*/u.exec(raw)[0].length);
|
|
78
|
-
const nodeLine = text.startsWith("+ ") || text.startsWith("@task/");
|
|
79
|
-
if (nodeLine) {
|
|
80
|
-
if (leading.length % 2 !== 0)
|
|
81
|
-
throw new TypeError(`compose line ${line + 1} has invalid indentation`);
|
|
82
|
-
const depth = leading.length / 2;
|
|
83
|
-
if (depth > 0 && !mutable.some((entry) => entry.node.depth === depth - 1))
|
|
84
|
-
throw new TypeError(`compose line ${line + 1} skips a parent depth`);
|
|
85
|
-
mutable.push({ node: parseNode(text, depth, mutable.length), body: [] });
|
|
86
|
-
continue;
|
|
87
|
-
}
|
|
88
|
-
const current = mutable.at(-1);
|
|
89
|
-
if (current === undefined) {
|
|
90
|
-
if (text.trim() === "")
|
|
91
|
-
continue;
|
|
92
|
-
throw new TypeError(`compose line ${line + 1} has body before a node`);
|
|
93
|
-
}
|
|
94
|
-
current.body.push(text.startsWith("\\") ? text.slice(1) : text);
|
|
95
|
-
}
|
|
96
|
-
const nodes = mutable.map(({ node, body }) => ({
|
|
97
|
-
...node,
|
|
98
|
-
...(body.length === 0 ? {} : { body: body.join("\n") }),
|
|
99
|
-
}));
|
|
100
|
-
return { ...(namespace === undefined ? {} : { namespace }), nodes };
|
|
11
|
+
function facts(plan) {
|
|
12
|
+
return { aliases: plan.aliases, admissionOrder: plan.admissionOrder };
|
|
13
|
+
}
|
|
14
|
+
function reference(id, remainingAliases) {
|
|
15
|
+
const alias = remainingAliases.get(id);
|
|
16
|
+
return alias === undefined ? `@${id}` : `^${alias}`;
|
|
17
|
+
}
|
|
18
|
+
function bodyToken(body) {
|
|
19
|
+
const lines = new Set(body.split(/\r\n|\n|\r/u));
|
|
20
|
+
for (let suffix = 0; Number.isSafeInteger(suffix); suffix += 1) {
|
|
21
|
+
const token = suffix === 0 ? "END_BODY" : `END_BODY_${suffix}`;
|
|
22
|
+
if (token.length > 32)
|
|
23
|
+
break;
|
|
24
|
+
if (!lines.has(token))
|
|
25
|
+
return token;
|
|
101
26
|
}
|
|
102
|
-
|
|
103
|
-
|
|
27
|
+
throw new Error("compose recovery body token space exhausted");
|
|
28
|
+
}
|
|
29
|
+
function taskDraft(task, remainingAliases) {
|
|
30
|
+
const document = task.after;
|
|
31
|
+
const lines = [task.kind === "new" ? `+ ${document.title}` : `@${document.id}`];
|
|
32
|
+
if (task.kind === "new" && task.alias !== undefined)
|
|
33
|
+
lines.push(`as = ${task.alias}`);
|
|
34
|
+
lines.push(`pri = ${document.priority}`, `needs = ${document.needs.map((id) => reference(id, remainingAliases)).join(", ")}`, `parent = ${document.parent === null ? "" : reference(document.parent, remainingAliases)}`, `supersedes = ${document.supersedes.map((id) => reference(id, remainingAliases)).join(", ")}`, `relates = ${document.relates.map((id) => reference(id, remainingAliases)).join(", ")}`);
|
|
35
|
+
if (document.body === "")
|
|
36
|
+
lines.push("body =");
|
|
37
|
+
else {
|
|
38
|
+
const token = bodyToken(document.body);
|
|
39
|
+
lines.push(`body <<${token}`, document.body, token);
|
|
104
40
|
}
|
|
41
|
+
return lines;
|
|
105
42
|
}
|
|
106
|
-
function
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
}
|
|
116
|
-
if (new Set(parsed).size !== parsed.length)
|
|
117
|
-
throw new TypeError("relation values must not contain duplicates");
|
|
118
|
-
return parsed;
|
|
119
|
-
}
|
|
120
|
-
function scalarId(value) {
|
|
121
|
-
const values = ids(value);
|
|
122
|
-
if (values.length > 1)
|
|
123
|
-
throw new TypeError("parent accepts at most one TaskId");
|
|
124
|
-
return values[0] ?? null;
|
|
125
|
-
}
|
|
126
|
-
function changed(current, value, append) {
|
|
127
|
-
return append ? [...current, ...value.filter((id) => !current.includes(id))] : value;
|
|
43
|
+
function recoveryDraft(namespace, remaining) {
|
|
44
|
+
const aliases = new Map();
|
|
45
|
+
for (const task of remaining) {
|
|
46
|
+
if (task.kind === "new" && task.alias !== undefined)
|
|
47
|
+
aliases.set(task.after.id, task.alias);
|
|
48
|
+
}
|
|
49
|
+
const lines = [`ns=${namespace.join("/")}`];
|
|
50
|
+
for (const task of remaining)
|
|
51
|
+
lines.push("", ...taskDraft(task, aliases));
|
|
52
|
+
return `${lines.join("\n")}\n`;
|
|
128
53
|
}
|
|
129
|
-
function
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
54
|
+
function plannedResult(plan) {
|
|
55
|
+
return { kind: "planned", ...facts(plan), bodies: plan.bodies };
|
|
56
|
+
}
|
|
57
|
+
function planAgainst(markdown, board, namespace, at, actor) {
|
|
58
|
+
return planTaskComposition({ markdown, board, namespace, at, ...(actor === undefined ? {} : { actor }) });
|
|
59
|
+
}
|
|
60
|
+
async function admitPlan(world, snapshot, plan, signal) {
|
|
61
|
+
const changes = [];
|
|
62
|
+
for (let index = 0; index < plan.tasks.length; index += 1) {
|
|
63
|
+
signal?.throwIfAborted();
|
|
64
|
+
const item = plan.tasks[index];
|
|
65
|
+
const beforeBytes = item.before === null ? null : (snapshot.bytes.get(item.after.id) ?? null);
|
|
66
|
+
const afterBytes = serializeTaskDocument(item.after);
|
|
67
|
+
const before = beforeBytes === null ? "" : Buffer.from(beforeBytes).toString("utf8");
|
|
68
|
+
const after = Buffer.from(afterBytes).toString("utf8");
|
|
69
|
+
const replaced = await replaceAuthority({
|
|
70
|
+
path: authorityPath(world, item.after.id),
|
|
71
|
+
expected: beforeBytes,
|
|
72
|
+
next: afterBytes,
|
|
73
|
+
});
|
|
74
|
+
if (replaced !== "replaced") {
|
|
75
|
+
return {
|
|
76
|
+
kind: "incomplete",
|
|
77
|
+
...facts(plan),
|
|
78
|
+
documentChanges: changes,
|
|
79
|
+
stopped: { kind: "retry", reason: "concurrent-modification" },
|
|
80
|
+
draft: recoveryDraft(plan.namespace, plan.tasks.slice(index)),
|
|
81
|
+
};
|
|
142
82
|
}
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
83
|
+
const label = `${item.after.id}.md`;
|
|
84
|
+
changes.push({
|
|
85
|
+
taskId: item.after.id,
|
|
86
|
+
kind: item.before === null ? "created" : "updated",
|
|
87
|
+
documentDiff: documentDiff(label, label, before, after),
|
|
88
|
+
});
|
|
149
89
|
}
|
|
150
|
-
return
|
|
151
|
-
}
|
|
152
|
-
function
|
|
153
|
-
|
|
90
|
+
return { kind: "accepted", ...facts(plan), documentChanges: changes };
|
|
91
|
+
}
|
|
92
|
+
async function composeUnderLocks(input) {
|
|
93
|
+
const snapshot = await readBoard(input.world);
|
|
94
|
+
const planned = planAgainst(input.markdown, snapshot.board, input.namespace, input.at, input.actor);
|
|
95
|
+
if (planned.kind === "refused")
|
|
96
|
+
return refusal(planned.diagnostics);
|
|
97
|
+
return await withTaskLocks({
|
|
98
|
+
world: input.world,
|
|
99
|
+
allocation: false,
|
|
100
|
+
ids: planned.plan.admissionOrder,
|
|
101
|
+
...(input.signal === undefined ? {} : { signal: input.signal }),
|
|
102
|
+
}, async () => {
|
|
103
|
+
const fresh = await readBoard(input.world);
|
|
104
|
+
const replanned = planAgainst(input.markdown, fresh.board, input.namespace, input.at, input.actor);
|
|
105
|
+
if (replanned.kind === "refused")
|
|
106
|
+
return refusal(replanned.diagnostics);
|
|
107
|
+
return await admitPlan(input.world, fresh, replanned.plan, input.signal);
|
|
108
|
+
});
|
|
154
109
|
}
|
|
155
|
-
function
|
|
110
|
+
function composeInput(world, markdown, namespace, at, actor, signal) {
|
|
156
111
|
return {
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
supersedes: [],
|
|
164
|
-
relates: [],
|
|
165
|
-
note: "",
|
|
166
|
-
...(actor === undefined ? {} : { createdBy: actor }),
|
|
167
|
-
createdAt: at,
|
|
168
|
-
updatedAt: at,
|
|
169
|
-
body: "",
|
|
112
|
+
world,
|
|
113
|
+
markdown,
|
|
114
|
+
namespace,
|
|
115
|
+
at,
|
|
116
|
+
...(actor === undefined ? {} : { actor }),
|
|
117
|
+
...(signal === undefined ? {} : { signal }),
|
|
170
118
|
};
|
|
171
119
|
}
|
|
172
|
-
function
|
|
173
|
-
try {
|
|
174
|
-
const namespace = sketch.namespace ?? defaultNamespace;
|
|
175
|
-
const occupied = new Set([...board.tasks.values()].flatMap((task) => {
|
|
176
|
-
const coordinate = parseTaskId(task.id);
|
|
177
|
-
return sameNamespace(coordinate.namespace, namespace) ? [coordinate.localId] : [];
|
|
178
|
-
}));
|
|
179
|
-
const allocations = new Map();
|
|
180
|
-
for (const node of sketch.nodes)
|
|
181
|
-
if (node.kind === "new") {
|
|
182
|
-
const localId = allocateLocalId(deriveLocalStem(node.title), occupied);
|
|
183
|
-
occupied.add(localId);
|
|
184
|
-
const coordinate = { namespace, localId };
|
|
185
|
-
allocations.set(node.index, createdTask(formatTaskId(coordinate), node.title, at, actor));
|
|
186
|
-
}
|
|
187
|
-
const all = new Map(board.tasks);
|
|
188
|
-
for (const allocated of allocations.values())
|
|
189
|
-
all.set(allocated.id, allocated);
|
|
190
|
-
const byDepth = [], addressed = new Set();
|
|
191
|
-
const planned = [];
|
|
192
|
-
for (const node of sketch.nodes) {
|
|
193
|
-
const before = node.kind === "new" ? null : (board.tasks.get(node.id) ?? null);
|
|
194
|
-
let current = node.kind === "new" ? allocations.get(node.index) : all.get(node.id);
|
|
195
|
-
if (current === undefined)
|
|
196
|
-
throw new TypeError(`compose task does not exist: ${node.id}`);
|
|
197
|
-
if (addressed.has(current.id))
|
|
198
|
-
throw new TypeError(`compose addresses ${current.id} more than once`);
|
|
199
|
-
addressed.add(current.id);
|
|
200
|
-
if (node.depth > 0) {
|
|
201
|
-
const parent = byDepth[node.depth - 1];
|
|
202
|
-
if (parent === undefined)
|
|
203
|
-
throw new TypeError("compose parent is unavailable");
|
|
204
|
-
if (node.assignments.some((item) => item.field === "parent"))
|
|
205
|
-
throw new TypeError("indented node cannot also assign parent");
|
|
206
|
-
current = { ...current, parent };
|
|
207
|
-
}
|
|
208
|
-
current = applyAssignments(current, node.assignments, node.body);
|
|
209
|
-
if (before !== null &&
|
|
210
|
-
!Buffer.from(serializeTaskDocument(current)).equals(Buffer.from(serializeTaskDocument(before)))) {
|
|
211
|
-
current = {
|
|
212
|
-
...current,
|
|
213
|
-
updatedAt: advanceTaskTimestamp(before.updatedAt, at),
|
|
214
|
-
};
|
|
215
|
-
}
|
|
216
|
-
byDepth[node.depth] = current.id;
|
|
217
|
-
byDepth.length = node.depth + 1;
|
|
218
|
-
all.set(current.id, current);
|
|
219
|
-
planned.push({ node, before, after: current });
|
|
220
|
-
}
|
|
221
|
-
for (const item of planned) {
|
|
222
|
-
const problem = relationProblem({ tasks: all }, item.before, item.after);
|
|
223
|
-
if (problem !== null)
|
|
224
|
-
return failure(problem);
|
|
225
|
-
}
|
|
226
|
-
return planned;
|
|
227
|
-
}
|
|
228
|
-
catch (error) {
|
|
229
|
-
return failure(error instanceof Error ? error.message : String(error));
|
|
230
|
-
}
|
|
231
|
-
}
|
|
232
|
-
function ref(id) {
|
|
233
|
-
return `@${id}`;
|
|
234
|
-
}
|
|
235
|
-
function bodyLines(body) {
|
|
236
|
-
return body.split("\n").map((line) => (/^[\\]|^\+ |^@task\//u.test(line) ? `\\${line}` : line));
|
|
237
|
-
}
|
|
238
|
-
function draft(namespace, remaining) {
|
|
239
|
-
const lines = [`ns=${namespace.join("/")}`];
|
|
240
|
-
for (const item of remaining) {
|
|
241
|
-
const task = item.after;
|
|
242
|
-
const assignments = [
|
|
243
|
-
`pri=${task.priority}`,
|
|
244
|
-
`needs=${task.needs.map(ref).join(",")}`,
|
|
245
|
-
`parent=${task.parent === null ? "" : ref(task.parent)}`,
|
|
246
|
-
`supersedes=${task.supersedes.map(ref).join(",")}`,
|
|
247
|
-
`relates=${task.relates.map(ref).join(",")}`,
|
|
248
|
-
];
|
|
249
|
-
lines.push(`${item.node.kind === "new" ? `+ ${task.title}` : ref(task.id)} ${assignments.join(" ")}${task.body === "" ? " body=" : ""}`);
|
|
250
|
-
if (task.body !== "")
|
|
251
|
-
lines.push(...bodyLines(task.body));
|
|
252
|
-
}
|
|
253
|
-
return `${lines.join("\n")}\n`;
|
|
254
|
-
}
|
|
255
|
-
export async function composeTasks(world, markdown, signal, actor, defaultNamespace) {
|
|
256
|
-
const sketch = parseSketch(markdown);
|
|
257
|
-
if ("kind" in sketch)
|
|
258
|
-
return { kind: "refused", refusal: sketch };
|
|
120
|
+
export async function composeTasks(world, markdown, signal, actor, defaultNamespace = [], planOnly = false) {
|
|
259
121
|
const at = currentTimestamp();
|
|
260
|
-
const namespace = sketch.namespace ?? defaultNamespace ?? [];
|
|
261
122
|
const initial = await readBoard(world);
|
|
262
|
-
const
|
|
263
|
-
if (
|
|
264
|
-
return
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
const
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
273
|
-
|
|
274
|
-
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
if ((await replaceAuthority({ path, expected: beforeBytes, next: afterBytes })) !== "replaced")
|
|
282
|
-
return {
|
|
283
|
-
kind: "incomplete",
|
|
284
|
-
documentChanges: changes,
|
|
285
|
-
stopped: { kind: "retry", reason: "concurrent-modification" },
|
|
286
|
-
draft: draft(namespace, queue.slice(index)),
|
|
287
|
-
};
|
|
288
|
-
const label = `${item.after.id}.md`;
|
|
289
|
-
changes.push({
|
|
290
|
-
taskId: item.after.id,
|
|
291
|
-
kind: item.before === null ? "created" : "updated",
|
|
292
|
-
documentDiff: documentDiff(label, label, before, after),
|
|
293
|
-
});
|
|
294
|
-
}
|
|
295
|
-
return { kind: "accepted", documentChanges: changes };
|
|
296
|
-
});
|
|
297
|
-
return result === "busy"
|
|
298
|
-
? {
|
|
299
|
-
kind: "incomplete",
|
|
300
|
-
documentChanges: [],
|
|
301
|
-
stopped: { kind: "retry", reason: "busy" },
|
|
302
|
-
draft: draft(namespace, ordered),
|
|
303
|
-
}
|
|
304
|
-
: result;
|
|
123
|
+
const initialPlan = planAgainst(markdown, initial.board, defaultNamespace, at, actor);
|
|
124
|
+
if (initialPlan.kind === "refused")
|
|
125
|
+
return refusal(initialPlan.diagnostics);
|
|
126
|
+
if (planOnly)
|
|
127
|
+
return plannedResult(initialPlan.plan);
|
|
128
|
+
const input = composeInput(world, markdown, defaultNamespace, at, actor, signal);
|
|
129
|
+
const allocation = initialPlan.plan.tasks.some((task) => task.kind === "new");
|
|
130
|
+
const admitted = allocation
|
|
131
|
+
? await withTaskLocks({ world, allocation: true, ids: [], ...(signal === undefined ? {} : { signal }) }, async () => await composeUnderLocks(input))
|
|
132
|
+
: await composeUnderLocks(input);
|
|
133
|
+
if (admitted !== "busy")
|
|
134
|
+
return admitted;
|
|
135
|
+
return {
|
|
136
|
+
kind: "incomplete",
|
|
137
|
+
...facts(initialPlan.plan),
|
|
138
|
+
documentChanges: [],
|
|
139
|
+
stopped: { kind: "retry", reason: "busy" },
|
|
140
|
+
draft: recoveryDraft(initialPlan.plan.namespace, initialPlan.plan.tasks),
|
|
141
|
+
};
|
|
305
142
|
}
|
|
@@ -4,7 +4,7 @@ import { type BlockedTaskRow, type TaskDetailFacts, type TaskDoctorIssue, type T
|
|
|
4
4
|
import { type TaskCompositionResult } from "./compose.js";
|
|
5
5
|
import { TaskAuthorityCorruptionError, type TaskPriority, type TaskState } from "./document.js";
|
|
6
6
|
import type { TaskId } from "./identity.js";
|
|
7
|
-
import { type AddTaskDocumentInput, type AddTaskInput, type TaskBatchResult, type TaskMutationResult, type TaskOutcome, type TaskRefusal, type TaskRetry, type TaskUpdateResult, type TaskView, type UpdateTaskInput } from "./operations.js";
|
|
7
|
+
import { type AddTaskDocumentInput, type AddTaskInput, type TaskBatchResult, type TaskCompositionDiagnostic, type TaskMutationResult, type TaskOutcome, type TaskRefusal, type TaskRetry, type TaskUpdateResult, type TaskView, type UpdateTaskInput } from "./operations.js";
|
|
8
8
|
import { TASK_RELATION_PREDICATE_FIELDS, type TaskPage, type TaskQueryExpression, type TaskQueryPredicate, type TaskQueryRow, type TaskQuerySort, type TaskRelationPredicateField } from "./query.js";
|
|
9
9
|
export type TaskDetail = Omit<TaskDetailFacts, "task"> & Readonly<{
|
|
10
10
|
task: TaskView;
|
|
@@ -17,7 +17,7 @@ export type TaskDoctorReport = Readonly<{
|
|
|
17
17
|
issues: readonly TaskDoctorIssue[];
|
|
18
18
|
}>;
|
|
19
19
|
export type TaskDecompositionTree = TaskOutcome<TaskTreeNode>;
|
|
20
|
-
export type { AddTaskDocumentInput, AddTaskInput, BlockedTaskRow, TaskBatchResult, TaskCompositionResult, TaskDoctorIssue, TaskId, TaskMutationResult, TaskOutcome, TaskPriority, TaskRef, TaskRefusal, TaskRetry, TaskRow, TaskState, TaskTreeNode, TaskUpdateResult, TaskView, UpdateTaskInput, TaskPage, TaskQueryExpression, TaskQueryPredicate, TaskQueryRow, TaskQuerySort, TaskRelationPredicateField, };
|
|
20
|
+
export type { AddTaskDocumentInput, AddTaskInput, BlockedTaskRow, TaskBatchResult, TaskCompositionDiagnostic, TaskCompositionResult, TaskDoctorIssue, TaskId, TaskMutationResult, TaskOutcome, TaskPriority, TaskRef, TaskRefusal, TaskRetry, TaskRow, TaskState, TaskTreeNode, TaskUpdateResult, TaskView, UpdateTaskInput, TaskPage, TaskQueryExpression, TaskQueryPredicate, TaskQueryRow, TaskQuerySort, TaskRelationPredicateField, };
|
|
21
21
|
export { TaskAuthorityCorruptionError, TASK_RELATION_PREDICATE_FIELDS };
|
|
22
22
|
declare class TaskHandle {
|
|
23
23
|
readonly id: TaskId;
|
|
@@ -95,6 +95,7 @@ declare class TasksHandle {
|
|
|
95
95
|
namespace?: readonly string[];
|
|
96
96
|
actor?: string;
|
|
97
97
|
signal?: AbortSignal;
|
|
98
|
+
plan?: boolean;
|
|
98
99
|
}>): Promise<TaskCompositionResult>;
|
|
99
100
|
}
|
|
100
101
|
export type Tasks = TasksHandle;
|
package/build/src/task/index.js
CHANGED
|
@@ -149,12 +149,14 @@ class TasksHandle {
|
|
|
149
149
|
}
|
|
150
150
|
compose(input) {
|
|
151
151
|
const v = record(input, "compose input");
|
|
152
|
-
closed(v, ["markdown", "namespace", "actor", "signal"], "compose input");
|
|
152
|
+
closed(v, ["markdown", "namespace", "actor", "signal", "plan"], "compose input");
|
|
153
153
|
const markdown = text(v.markdown, "markdown");
|
|
154
154
|
if (markdown === undefined)
|
|
155
155
|
throw new TypeError("markdown is required");
|
|
156
|
+
if (v.plan !== undefined && typeof v.plan !== "boolean")
|
|
157
|
+
throw new TypeError("plan must be a boolean");
|
|
156
158
|
const selected = namespace(v.namespace);
|
|
157
|
-
return composeTasks(this.world, markdown, signal(v.signal), actor(v.actor), selected);
|
|
159
|
+
return composeTasks(this.world, markdown, signal(v.signal), actor(v.actor), selected, v.plan === true);
|
|
158
160
|
}
|
|
159
161
|
}
|
|
160
162
|
export const Tasks = Object.freeze({
|
|
@@ -9,6 +9,11 @@ export type TaskView = Readonly<TaskDocument & {
|
|
|
9
9
|
export declare function nukeTask(world: WorldRoot, options?: Readonly<{
|
|
10
10
|
timeoutMs?: number;
|
|
11
11
|
}>): Promise<void>;
|
|
12
|
+
export type TaskCompositionDiagnostic = Readonly<{
|
|
13
|
+
line: number;
|
|
14
|
+
reason: string;
|
|
15
|
+
token: string;
|
|
16
|
+
}>;
|
|
12
17
|
export type TaskRefusal = Readonly<{
|
|
13
18
|
kind: "task-missing";
|
|
14
19
|
taskId: TaskId;
|
|
@@ -30,7 +35,7 @@ export type TaskRefusal = Readonly<{
|
|
|
30
35
|
declaringTask: TaskId;
|
|
31
36
|
}> | Readonly<{
|
|
32
37
|
kind: "invalid-composition";
|
|
33
|
-
|
|
38
|
+
diagnostics: readonly TaskCompositionDiagnostic[];
|
|
34
39
|
}>;
|
|
35
40
|
export type TaskRetry = "busy" | "concurrent-modification";
|
|
36
41
|
export type TaskOutcome<A> = Readonly<{
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@astrosheep/keiyaku",
|
|
3
|
-
"version": "4.5.
|
|
3
|
+
"version": "4.5.4",
|
|
4
4
|
"files": [
|
|
5
5
|
"build"
|
|
6
6
|
],
|
|
@@ -76,7 +76,17 @@
|
|
|
76
76
|
"doc": "docs",
|
|
77
77
|
"test": "tests"
|
|
78
78
|
},
|
|
79
|
-
"keywords": [
|
|
79
|
+
"keywords": [
|
|
80
|
+
"pi-package"
|
|
81
|
+
],
|
|
82
|
+
"pi": {
|
|
83
|
+
"extensions": [
|
|
84
|
+
"./build/integrations/pi/keiyaku.ts"
|
|
85
|
+
],
|
|
86
|
+
"skills": [
|
|
87
|
+
"./build/integrations/marketplace/plugins/keiyaku/skills"
|
|
88
|
+
]
|
|
89
|
+
},
|
|
80
90
|
"author": "",
|
|
81
91
|
"license": "ISC",
|
|
82
92
|
"publishConfig": {
|