audit-tools 0.32.10 → 0.32.12

package/dist/shared/quota/rollingEngine.js

@@ -1,153 +0,0 @@
-/**
- * Rolling engine — provider-pool-change semantics (drop + re-route).
- *
- * Manages a mutable active provider pool across a dispatch run. When a provider
- * signals quota exhaustion or disappears, the engine drops it from the active
- * routing set, re-queues any in-flight packets that had been assigned to it, and
- * re-routes those packets to the remaining active providers.
- *
- * NOTE: The empty-pool terminal (active_pools reaches zero → waiting_for_provider)
- * is NOT handled here — that is N-S09's responsibility. When dropProvider is
- * called on the last active pool it returns a state with active_pools: [] and
- * the caller's engine loop detects and handles the empty-pool condition.
- */
-import { computeDispatchCapacity, buildEmptyPoolTerminal } from "./capacity.js";
-// ---------------------------------------------------------------------------
-// dropProvider
-// ---------------------------------------------------------------------------
-/**
- * Pure function: remove a provider from the active routing set.
- *
- * Given the current engine state and a pool_id to drop:
- * 1. Moves the named pool from `active_pools` to `exhausted_pools`.
- * 2. Identifies all in-flight packets assigned to the dropped pool.
- * 3. Removes those packets from `in_flight_tokens`.
- * 4. Appends those packets to `pending_tokens` (re-queued for re-routing).
- * 5. Appends a `ProviderPoolEvent` to `event_log`.
- *
- * Returns a new `RollingEnginePoolState` — the input state is never mutated.
- *
- * When `active_pools` is already empty or the pool_id is not found in
- * `active_pools`, the state is returned unchanged (idempotent).
- *
- * When this call reduces `active_pools` to `[]`, the caller (N-S09's engine
- * loop) is responsible for detecting the empty-pool condition.
- */
-export function dropProvider(state, pool_id, kind) {
-    const poolIndex = state.active_pools.findIndex((e) => e.pool.id === pool_id);
-    if (poolIndex === -1) {
-        // Pool not in active set — idempotent, return unchanged.
-        return state;
-    }
-    const dropped = state.active_pools[poolIndex];
-    // Identify in-flight packets assigned to the dropped pool.
-    const requeued = state.in_flight_tokens.filter((t) => t.assigned_pool_id === pool_id);
-    const stillInFlight = state.in_flight_tokens.filter((t) => t.assigned_pool_id !== pool_id);
-    const event = {
-        kind,
-        provider_id: pool_id,
-        timestamp: new Date().toISOString(),
-        in_flight_count: requeued.length,
-        requeued_count: requeued.length,
-    };
-    // Structured observability for pool drops/rerouting (OBS-d81a55ab). Emitted on
-    // its own line and wrapped so a logging failure can never abort a dispatch run.
-    try {
-        process.stderr.write(JSON.stringify({
-            ts: event.timestamp,
-            kind: "rolling_engine_drop_provider",
-            provider_id: pool_id,
-            drop_kind: kind,
-            in_flight_count: event.in_flight_count,
-            requeued_count: event.requeued_count,
-        }) + "\n");
-    }
-    catch {
-        // Observability must never abort a run.
-    }
-    return {
-        active_pools: [
-            ...state.active_pools.slice(0, poolIndex),
-            ...state.active_pools.slice(poolIndex + 1),
-        ],
-        exhausted_pools: [...state.exhausted_pools, dropped],
-        in_flight_tokens: stillInFlight,
-        pending_tokens: [...state.pending_tokens, ...requeued],
-        event_log: [...state.event_log, event],
-    };
-}
-/**
- * Re-route pending packet tokens across the remaining active pools.
- *
- * The no-stranding guarantee (INV-QD-13 / SEAM-rolling-stranding): after ANY
- * `dropProvider` — including simultaneous multi-pool drops where pending demand
- * exceeds the survivors' slot capacity — this function leaves ZERO
- * `pending_tokens` whose `assigned_pool_id` points at a dropped/exhausted (i.e.
- * non-active) pool. Every pending packet is either reassigned to a pool still in
- * `active_pools`, or removed from `pending_tokens` and surfaced in
- * `terminal.stranded_ids`. `reroutePackets` is the SINGLE owner of this
- * guarantee; consumers (audit-cli-commands, remediate-steps-dispatch) only
- * consume `stranded_ids` and never implement their own reroute.
- *
- * Behaviour:
- * - No pending tokens → state unchanged, `allocation` and `terminal` null.
- * - `active_pools` empty but pending tokens exist → every pending packet is
- *   stranded (state pending cleared) and an `empty_pool` terminal is returned.
- * - Otherwise → `computeDispatchCapacity` sizes the surviving pools; the largest
- *   pending packets are assigned to the surviving pools up to their slot counts,
- *   and any surplus that does not fit is stranded.
- *
- * Also returns the `DispatchCapacity` computed by `computeDispatchCapacity` so
- * callers can inspect the allocation without re-computing it.
- */
-export function reroutePackets(state, sessionConfig) {
-    if (state.pending_tokens.length === 0) {
-        return { state, allocation: null, terminal: null };
-    }
-    // No surviving pool: every pending packet is stranded. Clearing pending here
-    // is what guarantees ZERO pending_tokens remain pointed at a dead pool.
-    if (state.active_pools.length === 0) {
-        const strandedIds = state.pending_tokens.map((t) => t.id);
-        return {
-            state: { ...state, pending_tokens: [] },
-            allocation: null,
-            terminal: buildEmptyPoolTerminal(strandedIds),
-        };
-    }
-    const pendingItemTokens = state.pending_tokens.map((t) => t.estimated_tokens);
-    const pools = state.active_pools.map((e) => e.pool);
-    const activePoolIds = new Set(pools.map((p) => p.id));
-    const allocation = computeDispatchCapacity({ pools, sessionConfig, pendingItemTokens });
-    // Order pending packets largest-first so the survivors' slots carry the most
-    // expensive work, mirroring computeDispatchCapacity's own descending layout.
-    const ordered = [...state.pending_tokens].sort((a, b) => b.estimated_tokens - a.estimated_tokens);
-    // Re-assign pending tokens to surviving pools based on slot counts.
-    const reassigned = [];
-    let tokenCursor = 0;
-    for (const poolAlloc of allocation.pools) {
-        // Defensive: never assign to a pool that is not in the active set.
-        if (!activePoolIds.has(poolAlloc.pool_id))
-            continue;
-        const assignCount = Math.min(poolAlloc.slots, ordered.length - tokenCursor);
-        for (let i = 0; i < assignCount; i++) {
-            const original = ordered[tokenCursor + i];
-            reassigned.push({ ...original, assigned_pool_id: poolAlloc.pool_id });
-        }
-        tokenCursor += assignCount;
-        if (tokenCursor >= ordered.length)
-            break;
-    }
-    // Any packet beyond the survivors' combined slot capacity cannot be placed on
-    // an active pool. It MUST NOT stay assigned to a dropped/exhausted pool — it is
-    // removed from pending_tokens and surfaced as stranded (INV-QD-13).
-    const stranded = ordered.slice(tokenCursor);
-    const terminal = stranded.length > 0
-        ? buildEmptyPoolTerminal(stranded.map((t) => t.id))
-        : null;
-    return {
-        state: { ...state, pending_tokens: reassigned },
-        allocation,
-        terminal,
-    };
-}
-//# sourceMappingURL=rollingEngine.js.map

package/dist/shared/quota/rollingEngine.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rollingEngine.js","sourceRoot":"","sources":["../../../src/shared/quota/rollingEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAE,uBAAuB,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAC;AAiEhF,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,YAAY,CAC1B,KAA6B,EAC7B,OAAe,EACf,IAA2B;IAE3B,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IAC7E,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,yDAAyD;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAE,CAAC;IAE/C,2DAA2D;IAC3D,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,KAAK,OAAO,CACtC,CAAC;IACF,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,KAAK,OAAO,CACtC,CAAC;IAEF,MAAM,KAAK,GAAsB;QAC/B,IAAI;QACJ,WAAW,EAAE,OAAO;QACpB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,eAAe,EAAE,QAAQ,CAAC,MAAM;QAChC,cAAc,EAAE,QAAQ,CAAC,MAAM;KAChC,CAAC;IAEF,+EAA+E;IAC/E,gFAAgF;IAChF,IAAI,CAAC;QACH,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,IAAI,CAAC,SAAS,CAAC;YACb,EAAE,EAAE,KAAK,CAAC,SAAS;YACnB,IAAI,EAAE,8BAA8B;YACpC,WAAW,EAAE,OAAO;YACpB,SAAS,EAAE,IAAI;YACf,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,cAAc,EAAE,KAAK,CAAC,cAAc;SACrC,CAAC,GAAG,IAAI,CACV,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,wCAAwC;IAC1C,CAAC;IAED,OAAO;QACL,YAAY,EAAE;YACZ,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;YACzC,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;SAC3C;QACD,eAAe,EAAE,CAAC,GAAG,KAAK,CAAC,eAAe,EAAE,OAAO,CAAC;QACpD,gBAAgB,EAAE,aAAa;QAC/B,cAAc,EAAE,CAAC,GAAG,KAAK,CAAC,cAAc,EAAE,GAAG,QAAQ,CAAC;QACtD,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC;KACvC,CAAC;AACJ,CAAC;AAsBD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA6B,EAC7B,aAA4B;IAE5B,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IACrD,CAAC;IAED,6EAA6E;IAC7E,wEAAwE;IACxE,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,OAAO;YACL,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE;YACvC,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,sBAAsB,CAAC,WAAW,CAAC;SAC9C,CAAC;IACJ,CAAC;IAED,MAAM,iBAAiB,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtD,MAAM,UAAU,GAAG,uBAAuB,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,CAAC,CAAC;IAExF,6EAA6E;IAC7E,6EAA6E;IAC7E,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,IAAI,CAC5C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAClD,CAAC;IAEF,oEAAoE;IACpE,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACzC,mEAAmE;QACnE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC;YAAE,SAAS;QACpD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,GAAG,CAAC,CAAE,CAAC;YAC3C,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,gBAAgB,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QACxE,CAAC;QACD,WAAW,IAAI,WAAW,CAAC;QAC3B,IAAI,WAAW,IAAI,OAAO,CAAC,MAAM;YAAE,MAAM;IAC3C,CAAC;IAED,8EAA8E;IAC9E,gFAAgF;IAChF,oEAAoE;IACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC5C,MAAM,QAAQ,GACZ,QAAQ,CAAC,MAAM,GAAG,CAAC;QACjB,CAAC,CAAC,sBAAsB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC,CAAC,IAAI,CAAC;IAEX,OAAO;QACL,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE;QAC/C,UAAU;QACV,QAAQ;KACT,CAAC;AACJ,CAAC"}