@transitrix/diagrams 1.0.0 → 1.1.0

package/src/goals/__tests__/layout.test.ts

@@ -1,175 +1,175 @@
-import { describe, it, expect } from 'vitest';
-import { layoutGoalTree } from '../layout.js';
-import type { GoalTree } from '../types.js';
-
-const TREE: GoalTree = {
-  goal_types: [
-    { name: 'Strategy', level: 0 },
-    { name: 'Business Goal', level: 1 },
-    { name: 'Project', level: 2 },
-  ],
-  goals: [
-    { id: 1, name: 'North Star', type: 'Strategy', level: 0, parent_id: 0 },
-    { id: 2, name: 'EU Expansion', type: 'Business Goal', level: 1, parent_id: 1 },
-    { id: 3, name: 'Berlin Office', type: 'Project', level: 2, parent_id: 2 },
-    { id: 4, name: 'London Office', type: 'Project', level: 2, parent_id: 2 },
-  ],
-};
-
-describe('layoutGoalTree', () => {
-  it('returns nodes for all goals', () => {
-    const layout = layoutGoalTree(TREE);
-    expect(layout.nodes).toHaveLength(4);
-  });
-
-  it('returns edges for parent-child pairs', () => {
-    const layout = layoutGoalTree(TREE);
-    expect(layout.edges).toHaveLength(3); // 1→2, 2→3, 2→4
-  });
-
-  it('levels map to increasing x positions', () => {
-    const layout = layoutGoalTree(TREE);
-    const byId = new Map(layout.nodes.map(n => [n.id, n]));
-    expect(byId.get(1)!.x).toBeLessThan(byId.get(2)!.x);
-    expect(byId.get(2)!.x).toBeLessThan(byId.get(3)!.x);
-  });
-
-  it('siblings at same level have different y positions', () => {
-    const layout = layoutGoalTree(TREE);
-    const byId = new Map(layout.nodes.map(n => [n.id, n]));
-    expect(byId.get(3)!.y).not.toBe(byId.get(4)!.y);
-  });
-
-  it('returns non-zero bounds for non-empty tree', () => {
-    const layout = layoutGoalTree(TREE);
-    expect(layout.bounds.width).toBeGreaterThan(0);
-    expect(layout.bounds.height).toBeGreaterThan(0);
-  });
-
-  it('returns empty layout for empty goals', () => {
-    const layout = layoutGoalTree({ goal_types: [], goals: [] });
-    expect(layout.nodes).toHaveLength(0);
-    expect(layout.edges).toHaveLength(0);
-  });
-
-  it('nodes have default 250×80 size', () => {
-    const layout = layoutGoalTree(TREE);
-    expect(layout.nodes[0].width).toBe(250);
-    expect(layout.nodes[0].height).toBe(80);
-  });
-
-  it('respects custom nodeWidth/nodeHeight', () => {
-    const layout = layoutGoalTree(TREE, { nodeWidth: 200, nodeHeight: 60 });
-    expect(layout.nodes[0].width).toBe(200);
-    expect(layout.nodes[0].height).toBe(60);
-  });
-
-  // vkgeorgia/strategy#75 — configurable spacing. The preview maps
-  // horizontalGap → rankSep and verticalGap → nodeSep.
-  it('larger rankSep widens the column step', () => {
-    const tight = layoutGoalTree(TREE, { rankSep: 80 });
-    const wide = layoutGoalTree(TREE, { rankSep: 200 });
-    const stepOf = (l: ReturnType<typeof layoutGoalTree>) => {
-      const byId = new Map(l.nodes.map(n => [n.id, n]));
-      return byId.get(2)!.x - byId.get(1)!.x;
-    };
-    expect(stepOf(wide)).toBeGreaterThan(stepOf(tight));
-  });
-
-  it('larger nodeSep increases the gap between stacked siblings', () => {
-    const gapOf = (sep: number) => {
-      const l = layoutGoalTree(TREE, { nodeSep: sep });
-      const byId = new Map(l.nodes.map(n => [n.id, n]));
-      return Math.abs(byId.get(4)!.y - byId.get(3)!.y);
-    };
-    expect(gapOf(120)).toBeGreaterThan(gapOf(24));
-  });
-
-  it('each node carries original goal data', () => {
-    const layout = layoutGoalTree(TREE);
-    const node1 = layout.nodes.find(n => n.id === 1)!;
-    expect(node1.data.name).toBe('North Star');
-  });
-
-  it('viewDepth hides nodes beyond depth', () => {
-    const layout = layoutGoalTree(TREE, { viewDepth: 1 });
-    // Level 2 nodes (id 3, 4) should be hidden
-    expect(layout.nodes.every(n => n.data.level <= 1)).toBe(true);
-  });
-
-  it('compresses non-contiguous levels into adjacent columns (no phantom empty columns)', () => {
-    // Legacy / non-canonical input: goal_types skip levels 1 and 3, so
-    // goals sit at levels 0, 2, 4. Column x must advance by exactly one
-    // step per used level, not per absolute level value — otherwise the
-    // skipped levels open empty columns and double the horizontal spacing.
-    const gapped: GoalTree = {
-      goal_types: [
-        { name: 'Strategy', level: 0 },
-        { name: 'Strategic Goal', level: 2 },
-        { name: 'Project Goal', level: 4 },
-      ],
-      goals: [
-        { id: 1, name: 'Root', type: 'Strategy', level: 0, parent_id: 0 },
-        { id: 2, name: 'Mid', type: 'Strategic Goal', level: 2, parent_id: 1 },
-        { id: 3, name: 'Leaf', type: 'Project Goal', level: 4, parent_id: 2 },
-      ],
-    };
-    const layout = layoutGoalTree(gapped);
-    const byId = new Map(layout.nodes.map(n => [n.id, n]));
-    const step = byId.get(2)!.x - byId.get(1)!.x;
-    // Root→Mid and Mid→Leaf must use the same single-column step despite
-    // the level numbers jumping by 2 each time.
-    expect(byId.get(3)!.x - byId.get(2)!.x).toBe(step);
-    // And that step is one node width + one rank separator (250 + 80).
-    expect(step).toBe(250 + 80);
-  });
-
-  // Pre-release blocker regression (orchestrator review 2026-05-21).
-  it('[blocker] does not stack-overflow on a self-parent cycle', () => {
-    const cyclic: GoalTree = {
-      goal_types: [{ name: 'X', level: 0 }],
-      goals: [{ id: 1, name: 'self-parent', type: 'X', level: 0, parent_id: 1 }],
-    };
-    // Without a visited-set inside placeSubtree, this recurses forever.
-    expect(() => layoutGoalTree(cyclic)).not.toThrow();
-  });
-
-  it('[blocker] does not stack-overflow on a 2-node mutual cycle', () => {
-    const cyclic: GoalTree = {
-      goal_types: [{ name: 'X', level: 0 }, { name: 'Y', level: 1 }],
-      goals: [
-        { id: 1, name: 'A', type: 'X', level: 0, parent_id: 2 },
-        { id: 2, name: 'B', type: 'Y', level: 1, parent_id: 1 },
-      ],
-    };
-    expect(() => layoutGoalTree(cyclic)).not.toThrow();
-  });
-
-  // vkgeorgia/strategy#77 — scope filtering.
-  describe('scope', () => {
-    const ids = (l: ReturnType<typeof layoutGoalTree>) => l.nodes.map(n => n.id).sort((a, b) => a - b);
-
-    it("mode 'all' matches the baseline", () => {
-      expect(ids(layoutGoalTree(TREE, { scope: { mode: 'all' } }))).toEqual(ids(layoutGoalTree(TREE)));
-    });
-
-    it("mode 'level' trims goals strictly above the cap", () => {
-      // TREE: id1 level0, id2 level1, id3/id4 level2.
-      const layout = layoutGoalTree(TREE, { scope: { mode: 'level', maxLevel: 1 } });
-      expect(ids(layout)).toEqual([1, 2]);
-      expect(layout.nodes.every(n => n.data.level <= 1)).toBe(true);
-    });
-
-    it("mode 'root' keeps the chosen goal and its descendants", () => {
-      // root id2 → itself + children id3, id4.
-      const layout = layoutGoalTree(TREE, { scope: { mode: 'root', rootGoalId: '2' } });
-      expect(ids(layout)).toEqual([2, 3, 4]);
-    });
-
-    it("mode 'root' returns an empty layout when the root is absent", () => {
-      const layout = layoutGoalTree(TREE, { scope: { mode: 'root', rootGoalId: '999' } });
-      expect(layout.nodes).toHaveLength(0);
-      expect(layout.edges).toHaveLength(0);
-    });
-  });
-});
+import { describe, it, expect } from 'vitest';
+import { layoutGoalTree } from '../layout.js';
+import type { GoalTree } from '../types.js';
+
+const TREE: GoalTree = {
+  goal_types: [
+    { name: 'Strategy', level: 0 },
+    { name: 'Business Goal', level: 1 },
+    { name: 'Project', level: 2 },
+  ],
+  goals: [
+    { id: 1, name: 'North Star', type: 'Strategy', level: 0, parent_id: 0 },
+    { id: 2, name: 'EU Expansion', type: 'Business Goal', level: 1, parent_id: 1 },
+    { id: 3, name: 'Berlin Office', type: 'Project', level: 2, parent_id: 2 },
+    { id: 4, name: 'London Office', type: 'Project', level: 2, parent_id: 2 },
+  ],
+};
+
+describe('layoutGoalTree', () => {
+  it('returns nodes for all goals', () => {
+    const layout = layoutGoalTree(TREE);
+    expect(layout.nodes).toHaveLength(4);
+  });
+
+  it('returns edges for parent-child pairs', () => {
+    const layout = layoutGoalTree(TREE);
+    expect(layout.edges).toHaveLength(3); // 1→2, 2→3, 2→4
+  });
+
+  it('levels map to increasing x positions', () => {
+    const layout = layoutGoalTree(TREE);
+    const byId = new Map(layout.nodes.map(n => [n.id, n]));
+    expect(byId.get(1)!.x).toBeLessThan(byId.get(2)!.x);
+    expect(byId.get(2)!.x).toBeLessThan(byId.get(3)!.x);
+  });
+
+  it('siblings at same level have different y positions', () => {
+    const layout = layoutGoalTree(TREE);
+    const byId = new Map(layout.nodes.map(n => [n.id, n]));
+    expect(byId.get(3)!.y).not.toBe(byId.get(4)!.y);
+  });
+
+  it('returns non-zero bounds for non-empty tree', () => {
+    const layout = layoutGoalTree(TREE);
+    expect(layout.bounds.width).toBeGreaterThan(0);
+    expect(layout.bounds.height).toBeGreaterThan(0);
+  });
+
+  it('returns empty layout for empty goals', () => {
+    const layout = layoutGoalTree({ goal_types: [], goals: [] });
+    expect(layout.nodes).toHaveLength(0);
+    expect(layout.edges).toHaveLength(0);
+  });
+
+  it('nodes have default 250×80 size', () => {
+    const layout = layoutGoalTree(TREE);
+    expect(layout.nodes[0].width).toBe(250);
+    expect(layout.nodes[0].height).toBe(80);
+  });
+
+  it('respects custom nodeWidth/nodeHeight', () => {
+    const layout = layoutGoalTree(TREE, { nodeWidth: 200, nodeHeight: 60 });
+    expect(layout.nodes[0].width).toBe(200);
+    expect(layout.nodes[0].height).toBe(60);
+  });
+
+  // vkgeorgia/strategy#75 — configurable spacing. The preview maps
+  // horizontalGap → rankSep and verticalGap → nodeSep.
+  it('larger rankSep widens the column step', () => {
+    const tight = layoutGoalTree(TREE, { rankSep: 80 });
+    const wide = layoutGoalTree(TREE, { rankSep: 200 });
+    const stepOf = (l: ReturnType<typeof layoutGoalTree>) => {
+      const byId = new Map(l.nodes.map(n => [n.id, n]));
+      return byId.get(2)!.x - byId.get(1)!.x;
+    };
+    expect(stepOf(wide)).toBeGreaterThan(stepOf(tight));
+  });
+
+  it('larger nodeSep increases the gap between stacked siblings', () => {
+    const gapOf = (sep: number) => {
+      const l = layoutGoalTree(TREE, { nodeSep: sep });
+      const byId = new Map(l.nodes.map(n => [n.id, n]));
+      return Math.abs(byId.get(4)!.y - byId.get(3)!.y);
+    };
+    expect(gapOf(120)).toBeGreaterThan(gapOf(24));
+  });
+
+  it('each node carries original goal data', () => {
+    const layout = layoutGoalTree(TREE);
+    const node1 = layout.nodes.find(n => n.id === 1)!;
+    expect(node1.data.name).toBe('North Star');
+  });
+
+  it('viewDepth hides nodes beyond depth', () => {
+    const layout = layoutGoalTree(TREE, { viewDepth: 1 });
+    // Level 2 nodes (id 3, 4) should be hidden
+    expect(layout.nodes.every(n => n.data.level <= 1)).toBe(true);
+  });
+
+  it('compresses non-contiguous levels into adjacent columns (no phantom empty columns)', () => {
+    // Legacy / non-canonical input: goal_types skip levels 1 and 3, so
+    // goals sit at levels 0, 2, 4. Column x must advance by exactly one
+    // step per used level, not per absolute level value — otherwise the
+    // skipped levels open empty columns and double the horizontal spacing.
+    const gapped: GoalTree = {
+      goal_types: [
+        { name: 'Strategy', level: 0 },
+        { name: 'Strategic Goal', level: 2 },
+        { name: 'Project Goal', level: 4 },
+      ],
+      goals: [
+        { id: 1, name: 'Root', type: 'Strategy', level: 0, parent_id: 0 },
+        { id: 2, name: 'Mid', type: 'Strategic Goal', level: 2, parent_id: 1 },
+        { id: 3, name: 'Leaf', type: 'Project Goal', level: 4, parent_id: 2 },
+      ],
+    };
+    const layout = layoutGoalTree(gapped);
+    const byId = new Map(layout.nodes.map(n => [n.id, n]));
+    const step = byId.get(2)!.x - byId.get(1)!.x;
+    // Root→Mid and Mid→Leaf must use the same single-column step despite
+    // the level numbers jumping by 2 each time.
+    expect(byId.get(3)!.x - byId.get(2)!.x).toBe(step);
+    // And that step is one node width + one rank separator (250 + 80).
+    expect(step).toBe(250 + 80);
+  });
+
+  // Pre-release blocker regression (orchestrator review 2026-05-21).
+  it('[blocker] does not stack-overflow on a self-parent cycle', () => {
+    const cyclic: GoalTree = {
+      goal_types: [{ name: 'X', level: 0 }],
+      goals: [{ id: 1, name: 'self-parent', type: 'X', level: 0, parent_id: 1 }],
+    };
+    // Without a visited-set inside placeSubtree, this recurses forever.
+    expect(() => layoutGoalTree(cyclic)).not.toThrow();
+  });
+
+  it('[blocker] does not stack-overflow on a 2-node mutual cycle', () => {
+    const cyclic: GoalTree = {
+      goal_types: [{ name: 'X', level: 0 }, { name: 'Y', level: 1 }],
+      goals: [
+        { id: 1, name: 'A', type: 'X', level: 0, parent_id: 2 },
+        { id: 2, name: 'B', type: 'Y', level: 1, parent_id: 1 },
+      ],
+    };
+    expect(() => layoutGoalTree(cyclic)).not.toThrow();
+  });
+
+  // vkgeorgia/strategy#77 — scope filtering.
+  describe('scope', () => {
+    const ids = (l: ReturnType<typeof layoutGoalTree>) => l.nodes.map(n => n.id).sort((a, b) => a - b);
+
+    it("mode 'all' matches the baseline", () => {
+      expect(ids(layoutGoalTree(TREE, { scope: { mode: 'all' } }))).toEqual(ids(layoutGoalTree(TREE)));
+    });
+
+    it("mode 'level' trims goals strictly above the cap", () => {
+      // TREE: id1 level0, id2 level1, id3/id4 level2.
+      const layout = layoutGoalTree(TREE, { scope: { mode: 'level', maxLevel: 1 } });
+      expect(ids(layout)).toEqual([1, 2]);
+      expect(layout.nodes.every(n => n.data.level <= 1)).toBe(true);
+    });
+
+    it("mode 'root' keeps the chosen goal and its descendants", () => {
+      // root id2 → itself + children id3, id4.
+      const layout = layoutGoalTree(TREE, { scope: { mode: 'root', rootGoalId: '2' } });
+      expect(ids(layout)).toEqual([2, 3, 4]);
+    });
+
+    it("mode 'root' returns an empty layout when the root is absent", () => {
+      const layout = layoutGoalTree(TREE, { scope: { mode: 'root', rootGoalId: '999' } });
+      expect(layout.nodes).toHaveLength(0);
+      expect(layout.edges).toHaveLength(0);
+    });
+  });
+});

package/src/goals/__tests__/mutations.test.ts

@@ -1,111 +1,111 @@
-import { describe, it, expect } from 'vitest';
-import { reparent, addChild, deleteWithDescendants, moveToBacklog, restoreFromBacklog } from '../mutations.js';
-import type { GoalTree } from '../types.js';
-
-const TREE: GoalTree = {
-  goal_types: [
-    { name: 'Strategy', level: 0 },
-    { name: 'Business Goal', level: 1 },
-    { name: 'Project', level: 2 },
-  ],
-  goals: [
-    { id: 1, name: 'North Star', type: 'Strategy', level: 0, parent_id: 0 },
-    { id: 2, name: 'EU Expansion', type: 'Business Goal', level: 1, parent_id: 1 },
-    { id: 3, name: 'Berlin Office', type: 'Project', level: 2, parent_id: 2 },
-  ],
-};
-
-describe('reparent', () => {
-  it('moves a goal to a new parent', () => {
-    const r = reparent(TREE, 3, 1);
-    expect(r.ok).toBe(true);
-    const moved = r.result!.goals.find(g => g.id === 3)!;
-    expect(moved.parent_id).toBe(1);
-    expect(moved.level).toBe(1);
-  });
-
-  it('refuses to create a cycle', () => {
-    const r = reparent(TREE, 1, 3);
-    expect(r.ok).toBe(false);
-    expect(r.error?.code).toBe('MUTATION_REFUSED');
-  });
-
-  it('refuses self-reparent', () => {
-    expect(reparent(TREE, 1, 1).ok).toBe(false);
-  });
-
-  it('refuses reparent that would exceed max level', () => {
-    const r = reparent(TREE, 1, 3); // would make level 3 which exceeds max 2
-    expect(r.ok).toBe(false);
-  });
-
-  it('preserves immutability — original tree unchanged', () => {
-    reparent(TREE, 3, 1);
-    expect(TREE.goals.find(g => g.id === 3)!.parent_id).toBe(2);
-  });
-});
-
-describe('addChild', () => {
-  it('adds a child with auto-assigned id and level', () => {
-    const r = addChild(TREE, 2, { name: 'Warsaw Office', type: 'Project', level: 2, parent_id: 2 });
-    expect(r.ok).toBe(true);
-    const newGoal = r.result!.goals.find(g => g.name === 'Warsaw Office')!;
-    expect(newGoal.id).toBeGreaterThan(3);
-    expect(newGoal.parent_id).toBe(2);
-    expect(newGoal.level).toBe(2);
-  });
-
-  it('adds root-level child when parentId is 0', () => {
-    const r = addChild(TREE, 0, { name: 'Second Strategy', type: 'Strategy', level: 0, parent_id: 0 });
-    expect(r.ok).toBe(true);
-    expect(r.result!.goals.find(g => g.name === 'Second Strategy')!.level).toBe(0);
-  });
-
-  it('refuses when parent not found', () => {
-    const r = addChild(TREE, 99, { name: 'X', type: 'Project', level: 2, parent_id: 99 });
-    expect(r.ok).toBe(false);
-  });
-
-  it('preserves immutability', () => {
-    const before = TREE.goals.length;
-    addChild(TREE, 1, { name: 'New', type: 'Business Goal', level: 1, parent_id: 1 });
-    expect(TREE.goals.length).toBe(before);
-  });
-});
-
-describe('deleteWithDescendants', () => {
-  it('deletes goal and all descendants', () => {
-    const r = deleteWithDescendants(TREE, 2);
-    expect(r.ok).toBe(true);
-    const ids = r.result!.goals.map(g => g.id);
-    expect(ids).not.toContain(2);
-    expect(ids).not.toContain(3);
-    expect(ids).toContain(1);
-  });
-
-  it('refuses when goal not found', () => {
-    expect(deleteWithDescendants(TREE, 99).ok).toBe(false);
-  });
-
-  it('preserves immutability', () => {
-    deleteWithDescendants(TREE, 2);
-    expect(TREE.goals.length).toBe(3);
-  });
-});
-
-describe('moveToBacklog', () => {
-  it('sets parent_id to 0', () => {
-    const r = moveToBacklog(TREE, 3);
-    expect(r.ok).toBe(true);
-    expect(r.result!.goals.find(g => g.id === 3)!.parent_id).toBe(0);
-  });
-});
-
-describe('restoreFromBacklog', () => {
-  it('reparents the goal to the new parent', () => {
-    const backlogged = moveToBacklog(TREE, 3).result!;
-    const r = restoreFromBacklog(backlogged, 3, 1);
-    expect(r.ok).toBe(true);
-    expect(r.result!.goals.find(g => g.id === 3)!.parent_id).toBe(1);
-  });
-});
+import { describe, it, expect } from 'vitest';
+import { reparent, addChild, deleteWithDescendants, moveToBacklog, restoreFromBacklog } from '../mutations.js';
+import type { GoalTree } from '../types.js';
+
+const TREE: GoalTree = {
+  goal_types: [
+    { name: 'Strategy', level: 0 },
+    { name: 'Business Goal', level: 1 },
+    { name: 'Project', level: 2 },
+  ],
+  goals: [
+    { id: 1, name: 'North Star', type: 'Strategy', level: 0, parent_id: 0 },
+    { id: 2, name: 'EU Expansion', type: 'Business Goal', level: 1, parent_id: 1 },
+    { id: 3, name: 'Berlin Office', type: 'Project', level: 2, parent_id: 2 },
+  ],
+};
+
+describe('reparent', () => {
+  it('moves a goal to a new parent', () => {
+    const r = reparent(TREE, 3, 1);
+    expect(r.ok).toBe(true);
+    const moved = r.result!.goals.find(g => g.id === 3)!;
+    expect(moved.parent_id).toBe(1);
+    expect(moved.level).toBe(1);
+  });
+
+  it('refuses to create a cycle', () => {
+    const r = reparent(TREE, 1, 3);
+    expect(r.ok).toBe(false);
+    expect(r.error?.code).toBe('MUTATION_REFUSED');
+  });
+
+  it('refuses self-reparent', () => {
+    expect(reparent(TREE, 1, 1).ok).toBe(false);
+  });
+
+  it('refuses reparent that would exceed max level', () => {
+    const r = reparent(TREE, 1, 3); // would make level 3 which exceeds max 2
+    expect(r.ok).toBe(false);
+  });
+
+  it('preserves immutability — original tree unchanged', () => {
+    reparent(TREE, 3, 1);
+    expect(TREE.goals.find(g => g.id === 3)!.parent_id).toBe(2);
+  });
+});
+
+describe('addChild', () => {
+  it('adds a child with auto-assigned id and level', () => {
+    const r = addChild(TREE, 2, { name: 'Warsaw Office', type: 'Project', level: 2, parent_id: 2 });
+    expect(r.ok).toBe(true);
+    const newGoal = r.result!.goals.find(g => g.name === 'Warsaw Office')!;
+    expect(newGoal.id).toBeGreaterThan(3);
+    expect(newGoal.parent_id).toBe(2);
+    expect(newGoal.level).toBe(2);
+  });
+
+  it('adds root-level child when parentId is 0', () => {
+    const r = addChild(TREE, 0, { name: 'Second Strategy', type: 'Strategy', level: 0, parent_id: 0 });
+    expect(r.ok).toBe(true);
+    expect(r.result!.goals.find(g => g.name === 'Second Strategy')!.level).toBe(0);
+  });
+
+  it('refuses when parent not found', () => {
+    const r = addChild(TREE, 99, { name: 'X', type: 'Project', level: 2, parent_id: 99 });
+    expect(r.ok).toBe(false);
+  });
+
+  it('preserves immutability', () => {
+    const before = TREE.goals.length;
+    addChild(TREE, 1, { name: 'New', type: 'Business Goal', level: 1, parent_id: 1 });
+    expect(TREE.goals.length).toBe(before);
+  });
+});
+
+describe('deleteWithDescendants', () => {
+  it('deletes goal and all descendants', () => {
+    const r = deleteWithDescendants(TREE, 2);
+    expect(r.ok).toBe(true);
+    const ids = r.result!.goals.map(g => g.id);
+    expect(ids).not.toContain(2);
+    expect(ids).not.toContain(3);
+    expect(ids).toContain(1);
+  });
+
+  it('refuses when goal not found', () => {
+    expect(deleteWithDescendants(TREE, 99).ok).toBe(false);
+  });
+
+  it('preserves immutability', () => {
+    deleteWithDescendants(TREE, 2);
+    expect(TREE.goals.length).toBe(3);
+  });
+});
+
+describe('moveToBacklog', () => {
+  it('sets parent_id to 0', () => {
+    const r = moveToBacklog(TREE, 3);
+    expect(r.ok).toBe(true);
+    expect(r.result!.goals.find(g => g.id === 3)!.parent_id).toBe(0);
+  });
+});
+
+describe('restoreFromBacklog', () => {
+  it('reparents the goal to the new parent', () => {
+    const backlogged = moveToBacklog(TREE, 3).result!;
+    const r = restoreFromBacklog(backlogged, 3, 1);
+    expect(r.ok).toBe(true);
+    expect(r.result!.goals.find(g => g.id === 3)!.parent_id).toBe(1);
+  });
+});