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
test: bind replay to total capacity and moving reviewers [R1,R2,H16]
Corey Olsone7fa1cfe1684
diff --git a/test/flow-replay-policy.test.js b/test/flow-replay-policy.test.jsindex 113ce365..112a6d60 100644--- a/test/flow-replay-policy.test.js+++ b/test/flow-replay-policy.test.js@@ -117,11 +117,12 @@ function parallelHistory() {({ event_id: index + 1, event_at: new Date(BASE + minute * 60_000).toISOString(), event_kind: kind, item_id: item, event_by: by }));}-test('board reviewer ratio bounds starts while fixed reviewer capacity preserves work [R1,R2]', () => {+test('the shared total WIP cap retains fractional limits without manufacturing stage capacity [R1,R2]', () => {const input = parallelHistory();const low = replayFlow(input, { settings: { wipPerReviewer: 1.5 } });const high = replayFlow(input, { settings: { wipPerReviewer: 3 } });- assert.equal(low.replay.items[2].claimAt, new Date(BASE + 4 * 60_000).toISOString());+ assert.deepEqual(low.replay.items.map(item => item.claimAt), [0, 5, 10, 15].map(minute => new Date(BASE + minute * 60_000).toISOString()),+ 'ratio1.5 with one reviewer admits one total item until its verdict, not two builders plus reviews');assert.equal(high.replay.items[2].claimAt, new Date(BASE).toISOString());for (const result of [low, high]) {assert.equal(result.replay.stages.build.medianMinutes, 4);@@ -139,23 +140,25 @@ test('board replay controls validate their named ranges and keep off values expl});-test('reviews-first changes a ready shared seat without preempting recorded work [R1,R2]', () => {- const rows = [[0, 'add', 1, 'coordinator'], [0, 'claim', 1, 'builder'],- [1, 'submit', 1, 'builder'], [1, 'reserve', 1, 'shared'], [1, 'add', 2, 'coordinator'],- [2, 'accept', 1, 'shared'], [2, 'claim', 2, 'shared'], [3, 'submit', 2, 'shared'],- [3, 'reserve', 2, 'reviewer'], [3, 'merged', 1, 'coordinator'],- [4, 'accept', 2, 'reviewer'], [5, 'merged', 2, 'coordinator']];- const events = rows.map(([minute, kind, item, by], index) => ({ event_id: index + 1,- event_at: new Date(BASE + minute * 60_000).toISOString(), event_kind: kind, item_id: item, event_by: by }));- const buildsFirst = replayFlow(events, { order: [2, 1], settings: { reviewsFirst: false } });- const reviewsFirst = replayFlow(events, { order: [2, 1], settings: { reviewsFirst: true } });- assert.equal(buildsFirst.replay.items[0].stages.reviewWait, 2,- 'the prioritized second item takes the shared build seat, then the one observed review place');- assert.equal(reviewsFirst.replay.items[0].stages.reviewWait, 0);- assert.equal(reviewsFirst.replay.items[1].claimAt, new Date(BASE + 2 * 60_000).toISOString());+test('reviews-first changes a shared seat only above the native submitted threshold [R1,R2]', () => {+ const rows = [];+ for (let id = 1; id <= 4; id += 1) rows.push([0, 'add', id, 'coordinator'], [0, 'claim', id, `builder-${id}`],+ [1, 'submit', id, `builder-${id}`], [id, 'reserve', id, 'shared'], [id + 1, 'accept', id, 'shared'],+ [id + 2, 'merged', id, 'coordinator']);+ rows.push([1, 'add', 5, 'coordinator'], [5, 'claim', 5, 'shared'], [6, 'submit', 5, 'shared'],+ [6, 'reserve', 5, 'reviewer'], [7, 'accept', 5, 'reviewer'], [8, 'merged', 5, 'coordinator']);+ const input = events(rows.sort((a, b) => a[0] - b[0]));+ const buildsFirst = replayFlow(input, { order: [5, 1, 2, 3, 4], settings: { reviewsFirst: false } });+ const reviewsFirst = replayFlow(input, { order: [5, 1, 2, 3, 4], settings: { reviewsFirst: true } });+ assert.equal(buildsFirst.replay.items[0].stages.reviewWait, 1);+ assert.equal(reviewsFirst.replay.items[0].stages.reviewWait, 0,+ 'four submitted items exceed the default3 threshold for one currently active reviewer');+ assert.equal(reviewsFirst.replay.items[4].claimAt, new Date(BASE + 2 * 60_000).toISOString(),+ 'after one verdict leaves only3 submissions, the explicit build order resumes without preemption');+ const below = replayFlow(rework(), { settings: { reviewsFirst: true } });+ assert.equal(below.replay.items[0].cycleMinutes, 10, 'one submitted item does not trigger review priority');});-test('landing cadence starts at actual admitted work when its recorded seat is busy [R1,R2]', () => {const rows = [[0, 'add', 1, 'coordinator'], [0, 'add', 2, 'coordinator'],[0, 'claim', 1, 'builder'], [0, 'claim', 2, 'coordinator'],@@ -170,3 +173,22 @@ test('landing cadence starts at actual admitted work when its recorded seat is bassert.equal(result.replay.items[1].landedAt, new Date(BASE + 12 * 60_000).toISOString(),'the next batch waits for actual prior start plus cadence and prior completion');});+++test('active reviewers follow the moving simulated sixty-minute event window [R1,R2,H16]', () => {+ const rows = [];+ for (let id = 1; id <= 6; id += 1) {+ const start = id <= 2 ? 0 : 70;+ rows.push([start, 'add', id, 'coordinator'], [start, 'claim', id, `builder-${id}`],+ [start + 1, 'submit', id, `builder-${id}`], [start + 1, 'reserve', id, `reviewer-${id}`],+ [start + 2, 'accept', id, `reviewer-${id}`], [start + 3, 'merged', id, 'coordinator']);+ }+ const input = events(rows.sort((a, b) => a[0] - b[0]));+ const result = replayFlow(input, { settings: { wipPerReviewer: 2 } });+ assert.deepEqual(result.replay.items.map(item => item.claimAt), [0, 0, 70, 70, 71, 71].map(minute => atMinute(minute)),+ 'future reviewers do not inflate admission; expired first-wave reviewers leave a minimum-one window until new reservations occur');+ assert.deepEqual(replayFlow([...input].reverse(), { settings: { wipPerReviewer: 2 } }), result);+});++/** Expected fixture instants are arithmetic on recorded minutes, never wall-clock samples. */+function atMinute(minute) { return new Date(BASE + minute * 60_000).toISOString(); }diff --git a/test/flow-replay.test.js b/test/flow-replay.test.jsindex e5afdaa9..ec11eadb 100644--- a/test/flow-replay.test.js+++ b/test/flow-replay.test.js@@ -72,11 +72,11 @@ test('the replay bench reproduces a recorded history and is deterministic [R1,R2const counterfactual = await run(root, 'flow', 'replay', '--history', history, '--policy', policy, '--json');assert.equal(counterfactual.code, 0, counterfactual.stderr + counterfactual.stdout);const changed = JSON.parse(counterfactual.stdout);- assert.deepEqual(changed.replay.landingOrder, [2, 1]);- assert.deepEqual(changed.replay.items.map(item => [item.id, item.cycleMinutes]), [[1, 12], [2, 6]]);+ assert.deepEqual(changed.replay.landingOrder, [1, 2]);+ assert.deepEqual(changed.replay.items.map(item => [item.id, item.cycleMinutes]), [[1, 11], [2, 8]]);assert.deepEqual(changed.replay.stages.build, { count: 2, fastQuarterMinutes: 2, medianMinutes: 3.5, slowQuarterMinutes: 5, worstMinutes: 5 });assert.deepEqual(changed.replay.stages.review, { count: 2, fastQuarterMinutes: 1, medianMinutes: 1.5, slowQuarterMinutes: 2, worstMinutes: 2 });- assert.deepEqual(changed.replay.stages.mergeWait, { count: 2, fastQuarterMinutes: 3, medianMinutes: 4, slowQuarterMinutes: 5, worstMinutes: 5 });+ assert.deepEqual(changed.replay.stages.mergeWait, { count: 2, fastQuarterMinutes: 4, medianMinutes: 4.5, slowQuarterMinutes: 5, worstMinutes: 5 });assert.equal((await run(root, 'flow', 'replay', '--history', history, '--policy', policy, '--json')).stdout,counterfactual.stdout, 'same structural input and policy produce byte-identical JSON');});