Autonomous development for real products. Governed agents build from specs you approve, follow the rules you set, and nothing merges until another agent proves it. Your decisions, judgement and taste are the bar that work must clear. Declare your vision and let agents build it.
JavaScript agentic-codingai-agentsai-governanceautonomous-agentsclaude-codeclicode-reviewcodexcoding-agentsdeveloper-toolsgit-hooksllmlocal-firstmulti-agentsoftware-factoryspec-driven-developmentverificationvibe-coding
fix(view): keep counts on ordinary lifecycle routes [N26,M1]
Corey Olson29d3fa37880a
diff --git a/src/view/page-script-2.js b/src/view/page-script-2.jsindex 95a88eb0..55f66f09 100644--- a/src/view/page-script-2.js+++ b/src/view/page-script-2.js@@ -765,19 +765,23 @@ function flowSvg(p) {for (const s of below) {const t = pos.get(s.id), into = pairs.filter((pair) => pair.to === s.id && col(pair.from) >= 0);const said = told(into), tTop = t.y - BH / 2;- const xs = into.map((pair) => pos.get(pair.from).x).sort((a, b) => a - b);+ // A new import-only route cannot carry the existing ordinary moves' shared label.+ const ordinary = into.filter((pair) => pair.moves.some((move) => move.verb !== 'rehomeImport'));+ const carriers = ordinary.length ? ordinary : into;+ const xs = carriers.map((pair) => pos.get(pair.from).x).sort((a, b) => a - b);const left = xs.filter((x) => x < t.x - 0.5), right = xs.filter((x) => x > t.x + 0.5);const label = left.length? lines((left[0] + (left[1] ?? t.x - BW / 2)) / 2, t.y - 8, wrap(said.words, (left[1] ?? t.x - BW / 2) - left[0] - 20, 12), tone(said)): right.length? lines((right[right.length - 1] + (right[right.length - 2] ?? t.x + BW / 2)) / 2, t.y - 8, wrap(said.words, right[right.length - 1] - (right[right.length - 2] ?? t.x + BW / 2) - 20, 12), tone(said)): lines(t.x + 10, (bottom + tTop) / 2 + 4, said.words, tone(said), 'start');- // The label goes with the route that reaches furthest, drawn first; the others join it.+ // Keep path order intact, but bind the label to its ordinary route family before placement.const order = [...into].sort((p1, p2) => Math.abs(pos.get(p2.from).x - t.x) - Math.abs(pos.get(p1.from).x - t.x));- order.forEach((pair, n) => {+ const carrier = order.find((pair) => carriers.includes(pair));+ order.forEach((pair) => {const a = pos.get(pair.from);const d = Math.abs(a.x - t.x) < 0.5 ? path([[a.x, bottom], [t.x, tTop - 1]]) : path([[a.x, bottom], [a.x, t.y], [a.x < t.x ? t.x - BW / 2 - 1 : t.x + BW / 2 + 1, t.y]]);- routes.push(group([pair], { d }, n === 0 ? label : ''));+ routes.push(group([pair], { d }, pair === carrier ? label : ''));});}// A below-row state can move back into the row or on to another below-row state.diff --git a/test/cockpit/activity.test.js b/test/cockpit/activity.test.jsindex f6d6c98f..b510b423 100644--- a/test/cockpit/activity.test.js+++ b/test/cockpit/activity.test.js@@ -239,13 +239,14 @@ test('the activity tab draws the lifecycle from the declaration, as the README dassert.ok(routes.some((route) => route.title.includes(`claim, open to claimed, by the agent or coordinator: pullboard claim <id>. Made 6 times.\nChecks, in order:\n ${claimChecks.map(esc).join('\n ')}`)), 'each check in order, escaped');// The moves made along a route and how often, or its moves when none was; the routes into the// state below the row join into one, labelled once with their total.- // The new claimed-to-verified shortcut is the farthest incoming route to the below-row- // verified box, so it carries the shared accept count; each title still pins its own verb.+ // The claimed-to-verified shortcut carries the ordinary routes' shared accept count;+ // an unused import-only route cannot take that label. Each title still pins its own verb.assert.deepEqual(Object.fromEntries(routes.map((route) => [route.pair, route.label])), {'open>claimed': 'claim 6','claimed>open': 'release · lapse · escalate · refreeze (none yet)','claimed>submitted': 'submit 3','claimed>verified': 'accept 1',+ 'open>verified': null,'open>submitted': 'intake (none yet)','submitted>verified': null,'submitted>open': 'reject 1',