@jwilger/pi-development-system 0.68.0 → 0.69.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.
Files changed (3) hide show
  1. package/package.json +1 -1
  2. package/skills/work-intake-and-slicing/SKILL.md +1 -1
  3. package/src/planning/task-record.ts +1 -1
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@jwilger/pi-development-system",
3
- "version": "0.68.0",
3
+ "version": "0.69.0",
4
4
  "description": "A pi extension package representing a seasoned approach to software development using a full AI SDLC.",
5
5
  "keywords": [
6
6
  "pi-package"
package/skills/work-intake-and-slicing/SKILL.md CHANGED
@@ -54,4 +54,4 @@ Use `devsys_work_item` for the backlog. It reads `[tracker] kind` from `.develop
54
54
 
55
55
  ## Handing off
56
56
 
57
- `/devsys-plan <slug>` writes `docs/plan/<slug>.md` in this structure and, when a goal tool is available, starts a goal to complete it. Review the plan with the user before any implementation.
57
+ `/devsys-plan <slug>` writes `docs/plan/<slug>.md` in this structure and checks every task record. Then it stops for the user to review the plan. Only after they approve does it start a goal to complete the plan, when a goal tool is available: a goal can begin implementing on its own, so it must not exist before the review.
package/src/planning/task-record.ts CHANGED
@@ -176,7 +176,7 @@ function problemsOf(markdown: string, split: Sections): string[] {
176
176
  }
177
177
  const missing = SECTIONS.filter((s) => got(sections, s) === "");
178
178
  if (missing.length > 0) problems.push(`missing section: ${missing.join(", ")}`);
179
- if (/\bTBD\b/.test(markdown)) problems.push("contains TBD; decide it or split the task");
179
+ if (/\bTBD\b/i.test(markdown)) problems.push("contains TBD; decide it or split the task");
180
180
  const steps = stepsOf(get(sections, "Steps"));
181
181
  if (!missing.includes("Steps") && (steps.length < STEPS_MIN || steps.length > STEPS_MAX)) {
182
182
  problems.push(`Steps must be ${STEPS_MIN}-${STEPS_MAX} steps, found ${steps.length}`);