@nsxbet/playwright-orchestrator 0.2.0

package/dist/core/ckk-algorithm.js

@@ -0,0 +1,192 @@
+/**
+ * Default timeout for CKK algorithm in milliseconds
+ */
+export const DEFAULT_CKK_TIMEOUT = 500;
+/**
+ * Complete Karmarkar-Karp (CKK) inspired algorithm for multi-way number partitioning
+ *
+ * This algorithm finds the optimal distribution of tests across shards by:
+ * 1. Using branch and bound search with aggressive pruning
+ * 2. Starting with LPT solution as upper bound
+ * 3. Exploring assignment tree, pruning when partial makespan exceeds best
+ *
+ * Falls back to LPT if search exceeds timeout.
+ *
+ * @param tests - Tests with their durations
+ * @param numShards - Number of shards to distribute across
+ * @param timeoutMs - Maximum time to search for optimal solution
+ * @returns Optimal (or near-optimal) shard assignments
+ */
+export function assignWithCKK(tests, numShards, timeoutMs = DEFAULT_CKK_TIMEOUT) {
+    if (tests.length === 0) {
+        return {
+            assignments: createEmptyAssignments(numShards),
+            makespan: 0,
+            isOptimal: true,
+        };
+    }
+    if (numShards <= 0) {
+        throw new Error('Number of shards must be positive');
+    }
+    if (numShards >= tests.length) {
+        // More shards than tests - each test gets its own shard
+        return assignOnePerShard(tests, numShards);
+    }
+    // Sort tests by duration descending for better pruning
+    const sortedTests = [...tests].sort((a, b) => b.duration - a.duration);
+    // Get LPT solution as upper bound
+    const lptResult = assignWithLPTInternal(sortedTests, numShards);
+    let bestMakespan = lptResult.makespan;
+    let bestAssignment = lptResult.assignments;
+    let isOptimal = false;
+    // For small inputs, try to find optimal solution
+    const startTime = Date.now();
+    // Branch and bound search
+    const shardLoads = new Array(numShards).fill(0);
+    const shardTests = Array.from({ length: numShards }, () => []);
+    function search(testIndex) {
+        // Check timeout
+        if (Date.now() - startTime > timeoutMs) {
+            return false; // Timeout, stop search
+        }
+        // All tests assigned
+        if (testIndex >= sortedTests.length) {
+            const currentMakespan = Math.max(...shardLoads);
+            if (currentMakespan < bestMakespan) {
+                bestMakespan = currentMakespan;
+                bestAssignment = shardLoads.map((load, i) => ({
+                    shardIndex: i + 1,
+                    tests: [...(shardTests[i] ?? [])],
+                    expectedDuration: load,
+                }));
+                isOptimal = true;
+            }
+            return true;
+        }
+        const test = sortedTests[testIndex];
+        if (!test)
+            return true;
+        // Calculate lower bound: current max + remaining items distributed perfectly
+        const remainingDuration = sortedTests
+            .slice(testIndex)
+            .reduce((sum, t) => sum + t.duration, 0);
+        const currentMax = Math.max(...shardLoads);
+        const totalAfter = shardLoads.reduce((sum, l) => sum + l, 0) + remainingDuration;
+        const lowerBound = Math.max(currentMax, Math.ceil(totalAfter / numShards));
+        // Prune if lower bound exceeds best
+        if (lowerBound >= bestMakespan) {
+            return true;
+        }
+        // Try assigning to each shard, starting with least loaded
+        const shardOrder = shardLoads
+            .map((load, i) => ({ load, index: i }))
+            .sort((a, b) => a.load - b.load)
+            .map((s) => s.index);
+        // Skip duplicate loads to avoid redundant exploration
+        const seenLoads = new Set();
+        for (const shardIdx of shardOrder) {
+            const load = shardLoads[shardIdx];
+            if (load === undefined)
+                continue;
+            // Skip if we've already tried a shard with this load
+            if (seenLoads.has(load)) {
+                continue;
+            }
+            seenLoads.add(load);
+            // Prune: if adding to this shard exceeds best makespan, skip
+            if (load + test.duration >= bestMakespan) {
+                continue;
+            }
+            // Assign test to shard
+            shardLoads[shardIdx] = load + test.duration;
+            shardTests[shardIdx]?.push(test.testId);
+            const completed = search(testIndex + 1);
+            if (!completed) {
+                // Timeout - restore and return
+                shardLoads[shardIdx] = load;
+                shardTests[shardIdx]?.pop();
+                return false;
+            }
+            // Restore state for backtracking
+            shardLoads[shardIdx] = load;
+            shardTests[shardIdx]?.pop();
+        }
+        return true;
+    }
+    // Only run search for reasonable input sizes
+    if (tests.length <= 50) {
+        search(0);
+    }
+    return {
+        assignments: bestAssignment,
+        makespan: bestMakespan,
+        isOptimal,
+    };
+}
+/**
+ * Simple LPT algorithm for internal use
+ */
+function assignWithLPTInternal(sortedTests, numShards) {
+    const shards = Array.from({ length: numShards }, (_, i) => ({
+        shardIndex: i + 1,
+        tests: [],
+        expectedDuration: 0,
+    }));
+    for (const test of sortedTests) {
+        // Find shard with minimum load
+        let minShard = shards[0];
+        for (const shard of shards) {
+            if (minShard && shard.expectedDuration < minShard.expectedDuration) {
+                minShard = shard;
+            }
+        }
+        if (minShard) {
+            minShard.tests.push(test.testId);
+            minShard.expectedDuration += test.duration;
+        }
+    }
+    const makespan = Math.max(...shards.map((s) => s.expectedDuration));
+    return { assignments: shards, makespan };
+}
+/**
+ * Create empty shard assignments
+ */
+function createEmptyAssignments(numShards) {
+    return Array.from({ length: numShards }, (_, i) => ({
+        shardIndex: i + 1,
+        tests: [],
+        expectedDuration: 0,
+    }));
+}
+/**
+ * Assign one test per shard when there are more shards than tests
+ */
+function assignOnePerShard(tests, numShards) {
+    const assignments = createEmptyAssignments(numShards);
+    tests.forEach((test, i) => {
+        const assignment = assignments[i];
+        if (assignment) {
+            assignment.tests.push(test.testId);
+            assignment.expectedDuration = test.duration;
+        }
+    });
+    const makespan = tests.length > 0 ? Math.max(...tests.map((t) => t.duration)) : 0;
+    return {
+        assignments,
+        makespan,
+        isOptimal: true,
+    };
+}
+/**
+ * Calculate theoretical lower bound for makespan
+ * This is the best possible makespan if we could partition perfectly
+ */
+export function calculateLowerBound(tests, numShards) {
+    if (tests.length === 0)
+        return 0;
+    const totalDuration = tests.reduce((sum, t) => sum + t.duration, 0);
+    const maxSingleTest = Math.max(...tests.map((t) => t.duration));
+    // Lower bound is max of: largest single item OR total/shards
+    return Math.max(maxSingleTest, Math.ceil(totalDuration / numShards));
+}
+//# sourceMappingURL=ckk-algorithm.js.map

package/dist/core/ckk-algorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ckk-algorithm.js","sourceRoot":"","sources":["../../src/core/ckk-algorithm.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAcvC;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAyB,EACzB,SAAiB,EACjB,YAAoB,mBAAmB;IAEvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,WAAW,EAAE,sBAAsB,CAAC,SAAS,CAAC;YAC9C,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC9B,wDAAwD;QACxD,OAAO,iBAAiB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,uDAAuD;IACvD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEvE,kCAAkC;IAClC,MAAM,SAAS,GAAG,qBAAqB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAChE,IAAI,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC;IACtC,IAAI,cAAc,GAAG,SAAS,CAAC,WAAW,CAAC;IAC3C,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,iDAAiD;IACjD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,0BAA0B;IAC1B,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAa,CAAC;IAC5D,MAAM,UAAU,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAE3E,SAAS,MAAM,CAAC,SAAiB;QAC/B,gBAAgB;QAChB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,SAAS,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC,CAAC,uBAAuB;QACvC,CAAC;QAED,qBAAqB;QACrB,IAAI,SAAS,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;YAChD,IAAI,eAAe,GAAG,YAAY,EAAE,CAAC;gBACnC,YAAY,GAAG,eAAe,CAAC;gBAC/B,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC5C,UAAU,EAAE,CAAC,GAAG,CAAC;oBACjB,KAAK,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;oBACjC,gBAAgB,EAAE,IAAI;iBACvB,CAAC,CAAC,CAAC;gBACJ,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,IAAI,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAEvB,6EAA6E;QAC7E,MAAM,iBAAiB,GAAG,WAAW;aAClC,KAAK,CAAC,SAAS,CAAC;aAChB,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QAC3C,MAAM,UAAU,GACd,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,iBAAiB,CAAC;QAChE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC;QAE3E,oCAAoC;QACpC,IAAI,UAAU,IAAI,YAAY,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,0DAA0D;QAC1D,MAAM,UAAU,GAAG,UAAU;aAC1B,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;aACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;aAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEvB,sDAAsD;QACtD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YAEjC,qDAAqD;YACrD,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEpB,6DAA6D;YAC7D,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,IAAI,YAAY,EAAE,CAAC;gBACzC,SAAS;YACX,CAAC;YAED,uBAAuB;YACvB,UAAU,CAAC,QAAQ,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC5C,UAAU,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAExC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,+BAA+B;gBAC/B,UAAU,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;gBAC5B,UAAU,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,iCAAiC;YACjC,UAAU,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;YAC5B,UAAU,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC;QAC9B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6CAA6C;IAC7C,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,OAAO;QACL,WAAW,EAAE,cAAc;QAC3B,QAAQ,EAAE,YAAY;QACtB,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAC5B,WAA+B,EAC/B,SAAiB;IAEjB,MAAM,MAAM,GAA0B,KAAK,CAAC,IAAI,CAC9C,EAAE,MAAM,EAAE,SAAS,EAAE,EACrB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACT,UAAU,EAAE,CAAC,GAAG,CAAC;QACjB,KAAK,EAAE,EAAE;QACT,gBAAgB,EAAE,CAAC;KACpB,CAAC,CACH,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,+BAA+B;QAC/B,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,QAAQ,IAAI,KAAK,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,EAAE,CAAC;gBACnE,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,QAAQ,CAAC,gBAAgB,IAAI,IAAI,CAAC,QAAQ,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEpE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAAC,SAAiB;IAC/C,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,UAAU,EAAE,CAAC,GAAG,CAAC;QACjB,KAAK,EAAE,EAAE;QACT,gBAAgB,EAAE,CAAC;KACpB,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CACxB,KAAyB,EACzB,SAAiB;IAEjB,MAAM,WAAW,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC;IAEtD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,UAAU,EAAE,CAAC;YACf,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnC,UAAU,CAAC,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GACZ,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnE,OAAO;QACL,WAAW;QACX,QAAQ;QACR,SAAS,EAAE,IAAI;KAChB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAyB,EACzB,SAAiB;IAEjB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACpE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEhE,6DAA6D;IAC7D,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC;AACvE,CAAC"}

package/dist/core/estimate.d.ts

@@ -0,0 +1,72 @@
+import type { DiscoveredTest, TimingDataV2 } from './types.js';
+/**
+ * Default milliseconds per line for duration estimation
+ */
+export declare const DEFAULT_MS_PER_LINE = 100;
+/**
+ * Default duration for a test when no estimation is possible (30 seconds)
+ */
+export declare const DEFAULT_TEST_DURATION = 30000;
+/**
+ * Count the number of lines in a file
+ */
+export declare function countLines(filePath: string): number;
+/**
+ * Estimate the duration of a test file based on its line count
+ *
+ * @param filePath - Path to the test file
+ * @param msPerLine - Milliseconds per line (default: 100)
+ * @returns Estimated duration in milliseconds
+ */
+export declare function estimateDuration(filePath: string, msPerLine?: number): number;
+/**
+ * Estimate durations for multiple files
+ *
+ * @param testDir - Base test directory
+ * @param files - List of file paths (relative to testDir)
+ * @param msPerLine - Milliseconds per line
+ * @returns Map of file paths to estimated durations
+ */
+export declare function estimateDurations(testDir: string, files: string[], msPerLine?: number): Map<string, number>;
+/**
+ * Estimate the duration of a single test using fallback strategy:
+ * 1. Same-file average: Use average duration of known tests in the same file
+ * 2. Global average: Use average duration across all known tests
+ * 3. Default constant: Use DEFAULT_TEST_DURATION (30 seconds)
+ *
+ * @param testId - Test ID to estimate
+ * @param timingData - Existing timing data (v2)
+ * @returns Estimated duration in milliseconds
+ */
+export declare function estimateTestDuration(testId: string, timingData: TimingDataV2 | null): number;
+/**
+ * Get durations for a list of discovered tests
+ *
+ * Uses timing data when available, falls back to estimation
+ *
+ * @param tests - List of discovered tests
+ * @param timingData - Existing timing data (v2)
+ * @returns Array of tests with their durations and estimation flag
+ */
+export declare function getTestDurations(tests: DiscoveredTest[], timingData: TimingDataV2 | null): Array<{
+    testId: string;
+    file: string;
+    duration: number;
+    estimated: boolean;
+}>;
+/**
+ * Calculate average test duration from timing data
+ *
+ * @param timingData - Timing data (v2)
+ * @returns Average duration in milliseconds, or DEFAULT_TEST_DURATION if no data
+ */
+export declare function calculateAverageTestDuration(timingData: TimingDataV2 | null): number;
+/**
+ * Calculate average test duration for tests in a specific file
+ *
+ * @param file - File name
+ * @param timingData - Timing data (v2)
+ * @returns Average duration in milliseconds, or null if no tests found for file
+ */
+export declare function calculateFileAverageTestDuration(file: string, timingData: TimingDataV2 | null): number | null;
+//# sourceMappingURL=estimate.d.ts.map

package/dist/core/estimate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimate.d.ts","sourceRoot":"","sources":["../../src/core/estimate.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG/D;;GAEG;AACH,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC;;GAEG;AACH,eAAO,MAAM,qBAAqB,QAAQ,CAAC;AAE3C;;GAEG;AACH,wBAAgB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAQnD;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,MAAM,EAChB,SAAS,GAAE,MAA4B,GACtC,MAAM,CAGR;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,GAAE,MAA4B,GACtC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CASrB;AAED;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,YAAY,GAAG,IAAI,GAC9B,MAAM,CA0BR;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,cAAc,EAAE,EACvB,UAAU,EAAE,YAAY,GAAG,IAAI,GAC9B,KAAK,CAAC;IACP,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC,CAoBD;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAC1C,UAAU,EAAE,YAAY,GAAG,IAAI,GAC9B,MAAM,CAQR;AAED;;;;;;GAMG;AACH,wBAAgB,gCAAgC,CAC9C,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,YAAY,GAAG,IAAI,GAC9B,MAAM,GAAG,IAAI,CAef"}

package/dist/core/estimate.js

@@ -0,0 +1,142 @@
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+import { parseTestId } from './types.js';
+/**
+ * Default milliseconds per line for duration estimation
+ */
+export const DEFAULT_MS_PER_LINE = 100;
+/**
+ * Default duration for a test when no estimation is possible (30 seconds)
+ */
+export const DEFAULT_TEST_DURATION = 30000;
+/**
+ * Count the number of lines in a file
+ */
+export function countLines(filePath) {
+    try {
+        const content = fs.readFileSync(filePath, 'utf-8');
+        return content.split('\n').length;
+    }
+    catch {
+        // If file can't be read, return a reasonable default
+        return 50;
+    }
+}
+/**
+ * Estimate the duration of a test file based on its line count
+ *
+ * @param filePath - Path to the test file
+ * @param msPerLine - Milliseconds per line (default: 100)
+ * @returns Estimated duration in milliseconds
+ */
+export function estimateDuration(filePath, msPerLine = DEFAULT_MS_PER_LINE) {
+    const lines = countLines(filePath);
+    return lines * msPerLine;
+}
+/**
+ * Estimate durations for multiple files
+ *
+ * @param testDir - Base test directory
+ * @param files - List of file paths (relative to testDir)
+ * @param msPerLine - Milliseconds per line
+ * @returns Map of file paths to estimated durations
+ */
+export function estimateDurations(testDir, files, msPerLine = DEFAULT_MS_PER_LINE) {
+    const estimates = new Map();
+    for (const file of files) {
+        const fullPath = path.join(testDir, file);
+        estimates.set(file, estimateDuration(fullPath, msPerLine));
+    }
+    return estimates;
+}
+/**
+ * Estimate the duration of a single test using fallback strategy:
+ * 1. Same-file average: Use average duration of known tests in the same file
+ * 2. Global average: Use average duration across all known tests
+ * 3. Default constant: Use DEFAULT_TEST_DURATION (30 seconds)
+ *
+ * @param testId - Test ID to estimate
+ * @param timingData - Existing timing data (v2)
+ * @returns Estimated duration in milliseconds
+ */
+export function estimateTestDuration(testId, timingData) {
+    if (!timingData || Object.keys(timingData.tests).length === 0) {
+        return DEFAULT_TEST_DURATION;
+    }
+    const { file } = parseTestId(testId);
+    // Strategy 1: Same-file average
+    const sameFileTests = Object.entries(timingData.tests).filter(([, data]) => data.file === file);
+    if (sameFileTests.length > 0) {
+        const sum = sameFileTests.reduce((acc, [, data]) => acc + data.duration, 0);
+        return Math.round(sum / sameFileTests.length);
+    }
+    // Strategy 2: Global average
+    const allTests = Object.values(timingData.tests);
+    if (allTests.length > 0) {
+        const sum = allTests.reduce((acc, data) => acc + data.duration, 0);
+        return Math.round(sum / allTests.length);
+    }
+    // Strategy 3: Default constant
+    return DEFAULT_TEST_DURATION;
+}
+/**
+ * Get durations for a list of discovered tests
+ *
+ * Uses timing data when available, falls back to estimation
+ *
+ * @param tests - List of discovered tests
+ * @param timingData - Existing timing data (v2)
+ * @returns Array of tests with their durations and estimation flag
+ */
+export function getTestDurations(tests, timingData) {
+    return tests.map((test) => {
+        const existing = timingData?.tests[test.testId];
+        if (existing) {
+            return {
+                testId: test.testId,
+                file: test.file,
+                duration: existing.duration,
+                estimated: false,
+            };
+        }
+        return {
+            testId: test.testId,
+            file: test.file,
+            duration: estimateTestDuration(test.testId, timingData),
+            estimated: true,
+        };
+    });
+}
+/**
+ * Calculate average test duration from timing data
+ *
+ * @param timingData - Timing data (v2)
+ * @returns Average duration in milliseconds, or DEFAULT_TEST_DURATION if no data
+ */
+export function calculateAverageTestDuration(timingData) {
+    if (!timingData || Object.keys(timingData.tests).length === 0) {
+        return DEFAULT_TEST_DURATION;
+    }
+    const durations = Object.values(timingData.tests).map((t) => t.duration);
+    const sum = durations.reduce((acc, d) => acc + d, 0);
+    return Math.round(sum / durations.length);
+}
+/**
+ * Calculate average test duration for tests in a specific file
+ *
+ * @param file - File name
+ * @param timingData - Timing data (v2)
+ * @returns Average duration in milliseconds, or null if no tests found for file
+ */
+export function calculateFileAverageTestDuration(file, timingData) {
+    if (!timingData) {
+        return null;
+    }
+    const fileTests = Object.values(timingData.tests).filter((t) => t.file === file);
+    if (fileTests.length === 0) {
+        return null;
+    }
+    const sum = fileTests.reduce((acc, t) => acc + t.duration, 0);
+    return Math.round(sum / fileTests.length);
+}
+//# sourceMappingURL=estimate.js.map

package/dist/core/estimate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimate.js","sourceRoot":"","sources":["../../src/core/estimate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,KAAK,CAAC;AAE3C;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,QAAgB;IACzC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACnD,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,qDAAqD;QACrD,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAgB,EAChB,YAAoB,mBAAmB;IAEvC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IACnC,OAAO,KAAK,GAAG,SAAS,CAAC;AAC3B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAe,EACf,KAAe,EACf,YAAoB,mBAAmB;IAEvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,UAA+B;IAE/B,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9D,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IAED,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAErC,gCAAgC;IAChC,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,CAC3D,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CACjC,CAAC;IAEF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACjD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,+BAA+B;IAC/B,OAAO,qBAAqB,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAuB,EACvB,UAA+B;IAO/B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACxB,MAAM,QAAQ,GAAG,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhD,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO;gBACL,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,QAAQ,CAAC,QAAQ;gBAC3B,SAAS,EAAE,KAAK;aACjB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;YACvD,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAC1C,UAA+B;IAE/B,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9D,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACzE,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACrD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gCAAgC,CAC9C,IAAY,EACZ,UAA+B;IAE/B,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CACvB,CAAC;IAEF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC9D,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AAC5C,CAAC"}

package/dist/core/grep-pattern.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Maximum length for a grep pattern before switching to grep-file
+ */
+export declare const MAX_GREP_PATTERN_LENGTH = 4000;
+/**
+ * Escape regex special characters in a string
+ *
+ * @param str - String to escape
+ * @returns Escaped string safe for use in regex
+ */
+export declare function escapeRegex(str: string): string;
+/**
+ * Extract the test title from a test ID
+ * The title is the last part of the titlePath
+ *
+ * @param testId - Test ID in format file::describe::testTitle
+ * @returns The test title
+ */
+export declare function extractTitleFromTestId(testId: string): string;
+/**
+ * Generate a grep pattern from a list of test IDs
+ *
+ * Uses the test title (last part of titlePath) for matching.
+ * Escapes regex special characters to ensure exact matching.
+ *
+ * @param testIds - List of test IDs to include in pattern
+ * @returns Grep pattern string that matches any of the tests
+ */
+export declare function generateGrepPattern(testIds: string[]): string;
+/**
+ * Generate grep patterns for multiple shards
+ *
+ * @param shardTests - Map of shard index to list of test IDs
+ * @returns Map of shard index to grep pattern
+ */
+export declare function generateGrepPatterns(shardTests: Record<number, string[]>): Record<number, string>;
+/**
+ * Check if a grep pattern is too long and should use --grep-file instead
+ *
+ * @param pattern - Grep pattern to check
+ * @returns True if pattern exceeds maximum length
+ */
+export declare function isPatternTooLong(pattern: string): boolean;
+/**
+ * Generate content for a grep-file (one pattern per line)
+ *
+ * @param testIds - List of test IDs
+ * @returns File content with one escaped title per line
+ */
+export declare function generateGrepFileContent(testIds: string[]): string;
+/**
+ * Determine the best grep strategy for a list of tests
+ *
+ * @param testIds - List of test IDs
+ * @returns Object with strategy ('pattern' or 'file') and content
+ */
+export declare function determineGrepStrategy(testIds: string[]): {
+    strategy: 'pattern' | 'file';
+    content: string;
+};
+//# sourceMappingURL=grep-pattern.d.ts.map

package/dist/core/grep-pattern.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grep-pattern.d.ts","sourceRoot":"","sources":["../../src/core/grep-pattern.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,eAAO,MAAM,uBAAuB,OAAO,CAAC;AAE5C;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAG7D;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAY7D;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACnC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAQxB;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAOjE;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG;IACxD,QAAQ,EAAE,SAAS,GAAG,MAAM,CAAC;IAC7B,OAAO,EAAE,MAAM,CAAC;CACjB,CAeA"}

package/dist/core/grep-pattern.js

@@ -0,0 +1,104 @@
+import { parseTestId } from './types.js';
+/**
+ * Regex special characters that need escaping in grep patterns
+ */
+const REGEX_SPECIAL_CHARS = /[.*+?^${}()|[\]\\]/g;
+/**
+ * Maximum length for a grep pattern before switching to grep-file
+ */
+export const MAX_GREP_PATTERN_LENGTH = 4000;
+/**
+ * Escape regex special characters in a string
+ *
+ * @param str - String to escape
+ * @returns Escaped string safe for use in regex
+ */
+export function escapeRegex(str) {
+    return str.replace(REGEX_SPECIAL_CHARS, '\\$&');
+}
+/**
+ * Extract the test title from a test ID
+ * The title is the last part of the titlePath
+ *
+ * @param testId - Test ID in format file::describe::testTitle
+ * @returns The test title
+ */
+export function extractTitleFromTestId(testId) {
+    const { titlePath } = parseTestId(testId);
+    return titlePath[titlePath.length - 1] || testId;
+}
+/**
+ * Generate a grep pattern from a list of test IDs
+ *
+ * Uses the test title (last part of titlePath) for matching.
+ * Escapes regex special characters to ensure exact matching.
+ *
+ * @param testIds - List of test IDs to include in pattern
+ * @returns Grep pattern string that matches any of the tests
+ */
+export function generateGrepPattern(testIds) {
+    if (testIds.length === 0) {
+        return '';
+    }
+    const titles = testIds.map((id) => {
+        const title = extractTitleFromTestId(id);
+        return escapeRegex(title);
+    });
+    // Use OR operator to match any of the titles
+    return titles.join('|');
+}
+/**
+ * Generate grep patterns for multiple shards
+ *
+ * @param shardTests - Map of shard index to list of test IDs
+ * @returns Map of shard index to grep pattern
+ */
+export function generateGrepPatterns(shardTests) {
+    const patterns = {};
+    for (const [shardIndex, testIds] of Object.entries(shardTests)) {
+        patterns[Number(shardIndex)] = generateGrepPattern(testIds);
+    }
+    return patterns;
+}
+/**
+ * Check if a grep pattern is too long and should use --grep-file instead
+ *
+ * @param pattern - Grep pattern to check
+ * @returns True if pattern exceeds maximum length
+ */
+export function isPatternTooLong(pattern) {
+    return pattern.length > MAX_GREP_PATTERN_LENGTH;
+}
+/**
+ * Generate content for a grep-file (one pattern per line)
+ *
+ * @param testIds - List of test IDs
+ * @returns File content with one escaped title per line
+ */
+export function generateGrepFileContent(testIds) {
+    const titles = testIds.map((id) => {
+        const title = extractTitleFromTestId(id);
+        return escapeRegex(title);
+    });
+    return titles.join('\n');
+}
+/**
+ * Determine the best grep strategy for a list of tests
+ *
+ * @param testIds - List of test IDs
+ * @returns Object with strategy ('pattern' or 'file') and content
+ */
+export function determineGrepStrategy(testIds) {
+    if (testIds.length === 0) {
+        return { strategy: 'pattern', content: '' };
+    }
+    const pattern = generateGrepPattern(testIds);
+    if (isPatternTooLong(pattern)) {
+        return {
+            strategy: 'file',
+            content: generateGrepFileContent(testIds),
+        };
+    }
+    return { strategy: 'pattern', content: pattern };
+}
+//# sourceMappingURL=grep-pattern.js.map

package/dist/core/grep-pattern.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"grep-pattern.js","sourceRoot":"","sources":["../../src/core/grep-pattern.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEzC;;GAEG;AACH,MAAM,mBAAmB,GAAG,qBAAqB,CAAC;AAElD;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAE5C;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACrC,OAAO,GAAG,CAAC,OAAO,CAAC,mBAAmB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAAc;IACnD,MAAM,EAAE,SAAS,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;AACnD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAiB;IACnD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACzC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,6CAA6C;IAC7C,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAoC;IAEpC,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAE5C,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/D,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,OAAO,OAAO,CAAC,MAAM,GAAG,uBAAuB,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,OAAiB;IACvD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACzC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAiB;IAIrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC9C,CAAC;IAED,MAAM,OAAO,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAE7C,IAAI,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9B,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,OAAO,EAAE,uBAAuB,CAAC,OAAO,CAAC;SAC1C,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AACnD,CAAC"}

package/dist/core/index.d.ts

@@ -0,0 +1,9 @@
+export * from './ckk-algorithm.js';
+export * from './estimate.js';
+export * from './grep-pattern.js';
+export * from './lpt-algorithm.js';
+export * from './slugify.js';
+export * from './test-discovery.js';
+export * from './timing-store.js';
+export * from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/core/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC;AAC7B,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,YAAY,CAAC"}

package/dist/core/index.js

@@ -0,0 +1,9 @@
+export * from './ckk-algorithm.js';
+export * from './estimate.js';
+export * from './grep-pattern.js';
+export * from './lpt-algorithm.js';
+export * from './slugify.js';
+export * from './test-discovery.js';
+export * from './timing-store.js';
+export * from './types.js';
+//# sourceMappingURL=index.js.map

package/dist/core/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC;AAC7B,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,YAAY,CAAC"}

package/dist/core/lpt-algorithm.d.ts

@@ -0,0 +1,28 @@
+import type { AssignResult, FileWithDuration, ShardAssignment } from './types.js';
+/**
+ * Longest Processing Time First (LPT) algorithm for load balancing
+ *
+ * This greedy algorithm assigns jobs to workers by:
+ * 1. Sorting jobs by duration (descending)
+ * 2. Assigning each job to the worker with the smallest current load
+ *
+ * Time complexity: O(n log n) for sorting + O(n log k) for assignment = O(n log n)
+ * where n = number of files, k = number of shards
+ *
+ * @param files - Files with their durations
+ * @param numShards - Number of shards to distribute across
+ * @returns Shard assignments with expected durations
+ */
+export declare function assignWithLPT(files: FileWithDuration[], numShards: number): ShardAssignment[];
+/**
+ * Convert shard assignments to the format expected by the CLI output
+ */
+export declare function formatAssignResult(assignments: ShardAssignment[], estimatedFiles: string[]): AssignResult;
+/**
+ * Calculate the balance metric (max/min ratio) for the assignment
+ *
+ * A perfectly balanced assignment would have a ratio of 1.0
+ * The target is to keep this below 1.2 (20% difference)
+ */
+export declare function calculateBalanceRatio(assignments: ShardAssignment[]): number;
+//# sourceMappingURL=lpt-algorithm.d.ts.map

package/dist/core/lpt-algorithm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lpt-algorithm.d.ts","sourceRoot":"","sources":["../../src/core/lpt-algorithm.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EAChB,eAAe,EAChB,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,gBAAgB,EAAE,EACzB,SAAS,EAAE,MAAM,GAChB,eAAe,EAAE,CAoCnB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,eAAe,EAAE,EAC9B,cAAc,EAAE,MAAM,EAAE,GACvB,YAAY,CAiBd;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,eAAe,EAAE,GAAG,MAAM,CAa5E"}