maskweaver 0.7.26 → 0.7.28

package/dist/shared/model-registry.d.ts

@@ -0,0 +1,126 @@
+/**
+ * Model Registry
+ *
+ * Manages the pool of available AI models with:
+ * - Concurrency tracking (max N simultaneous uses per model)
+ * - Capability-based matching (task → best model)
+ * - Tier-based fallback (if preferred model is full, find similar)
+ * - Cost-aware scheduling (prefer cheaper models for simple tasks)
+ *
+ * "The art of programming is the art of organizing complexity." - Dijkstra
+ *
+ * @author Mask Weaver
+ */
+import type { ModelPoolEntry, ModelTier, ModelCapability } from './config.js';
+/** Runtime state for a model in the pool */
+export interface ModelSlot {
+    /** The model definition from config */
+    entry: ModelPoolEntry;
+    /** Current number of active uses */
+    activeCount: number;
+    /** Whether this model has available slots */
+    available: boolean;
+    /** Remaining available slots */
+    remainingSlots: number;
+}
+/** Options for acquiring a model */
+export interface AcquireOptions {
+    /** Preferred tier (flash/human/premium) */
+    tier?: ModelTier;
+    /** Required capabilities (at least one must match) */
+    capabilities?: ModelCapability[];
+    /** Prefer lower cost when multiple models match */
+    preferCheap?: boolean;
+    /** Specific model ID to request */
+    modelId?: string;
+}
+/** Result of a model acquisition attempt */
+export interface AcquireResult {
+    /** Whether a model was successfully acquired */
+    success: boolean;
+    /** The acquired model slot (if success) */
+    slot?: ModelSlot;
+    /** The agent name to use (e.g., "dummy-gemini-flash") */
+    agentName?: string;
+    /** Reason for failure (if not success) */
+    reason?: string;
+    /** Suggested alternative if primary choice unavailable */
+    suggestion?: string;
+}
+/** Snapshot of all model statuses */
+export interface RegistryStatus {
+    /** All model slots with their current state */
+    models: ModelSlot[];
+    /** Total capacity across all models */
+    totalCapacity: number;
+    /** Currently in use */
+    totalActive: number;
+    /** Available slots */
+    totalAvailable: number;
+}
+export declare class ModelRegistry {
+    private pool;
+    private activeCountMap;
+    constructor(pool: ModelPoolEntry[]);
+    /**
+     * Acquire a model from the pool.
+     *
+     * Selection strategy:
+     * 1. If modelId specified → try that exact model
+     * 2. Filter by tier preference
+     * 3. Filter by required capabilities
+     * 4. Among candidates, pick best available (cost-aware)
+     * 5. If no match in preferred tier, try fallback tiers
+     */
+    acquire(options?: AcquireOptions): AcquireResult;
+    /**
+     * Release a model back to the pool.
+     * Must be called when a task using this model completes.
+     */
+    release(modelId: string): boolean;
+    /** Get the current status of all models in the pool */
+    getStatus(): RegistryStatus;
+    /** Get available models for a specific tier */
+    getAvailableForTier(tier: ModelTier): ModelSlot[];
+    /** Get all models with a specific capability */
+    getModelsWithCapability(capability: ModelCapability): ModelSlot[];
+    /** Get the total concurrency available for a tier (including fallbacks) */
+    getTierConcurrency(tier: ModelTier): {
+        total: number;
+        available: number;
+        models: string[];
+    };
+    /** Get the pool entries */
+    getPool(): ModelPoolEntry[];
+    /** Get the agent name for a pool entry */
+    getAgentName(entry: ModelPoolEntry): string;
+    /**
+     * Recommend the best model for a task based on its capabilities.
+     * Does NOT acquire — just suggests.
+     */
+    recommend(options?: AcquireOptions): ModelPoolEntry | null;
+    /**
+     * Compute maximum parallelism for a set of tasks.
+     * Given N tasks of different tiers, returns how many can run simultaneously.
+     */
+    computeMaxParallelism(taskTiers: ModelTier[]): number;
+    private getSlot;
+    private tryAcquire;
+    private findCandidates;
+    private sortCandidates;
+    private suggestWait;
+}
+/**
+ * Get the global model registry.
+ * Lazily initialized from maskweaver.config.json.
+ */
+export declare function getModelRegistry(basePath?: string): ModelRegistry;
+/**
+ * Reset the registry (for testing or config reload).
+ */
+export declare function resetModelRegistry(): void;
+/**
+ * Create a fresh registry from explicit pool entries.
+ */
+export declare function createModelRegistry(pool: ModelPoolEntry[]): ModelRegistry;
+//# sourceMappingURL=model-registry.d.ts.map

package/dist/shared/model-registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-registry.d.ts","sourceRoot":"","sources":["../../src/shared/model-registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,eAAe,EAAiB,MAAM,aAAa,CAAC;AAO7F,4CAA4C;AAC5C,MAAM,WAAW,SAAS;IACxB,uCAAuC;IACvC,KAAK,EAAE,cAAc,CAAC;IACtB,oCAAoC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,6CAA6C;IAC7C,SAAS,EAAE,OAAO,CAAC;IACnB,gCAAgC;IAChC,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,oCAAoC;AACpC,MAAM,WAAW,cAAc;IAC7B,2CAA2C;IAC3C,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,sDAAsD;IACtD,YAAY,CAAC,EAAE,eAAe,EAAE,CAAC;IACjC,mDAAmD;IACnD,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,mCAAmC;IACnC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,4CAA4C;AAC5C,MAAM,WAAW,aAAa;IAC5B,gDAAgD;IAChD,OAAO,EAAE,OAAO,CAAC;IACjB,2CAA2C;IAC3C,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,yDAAyD;IACzD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0CAA0C;IAC1C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0DAA0D;IAC1D,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,qCAAqC;AACrC,MAAM,WAAW,cAAc;IAC7B,+CAA+C;IAC/C,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,uCAAuC;IACvC,aAAa,EAAE,MAAM,CAAC;IACtB,uBAAuB;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,sBAAsB;IACtB,cAAc,EAAE,MAAM,CAAC;CACxB;AA0BD,qBAAa,aAAa;IACxB,OAAO,CAAC,IAAI,CAAmB;IAC/B,OAAO,CAAC,cAAc,CAAkC;gBAE5C,IAAI,EAAE,cAAc,EAAE;IAYlC;;;;;;;;;OASG;IACH,OAAO,CAAC,OAAO,GAAE,cAAmB,GAAG,aAAa;IA+CpD;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAgBjC,uDAAuD;IACvD,SAAS,IAAI,cAAc;IAc3B,+CAA+C;IAC/C,mBAAmB,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,EAAE;IAOjD,gDAAgD;IAChD,uBAAuB,CAAC,UAAU,EAAE,eAAe,GAAG,SAAS,EAAE;IAMjE,2EAA2E;IAC3E,kBAAkB,CAAC,IAAI,EAAE,SAAS,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAkB3F,2BAA2B;IAC3B,OAAO,IAAI,cAAc,EAAE;IAI3B,0CAA0C;IAC1C,YAAY,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM;IAQ3C;;;OAGG;IACH,SAAS,CAAC,OAAO,GAAE,cAAmB,GAAG,cAAc,GAAG,IAAI;IAsB9D;;;OAGG;IACH,qBAAqB,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,MAAM;IAsBrD,OAAO,CAAC,OAAO;IAWf,OAAO,CAAC,UAAU;IAwBlB,OAAO,CAAC,cAAc;IAetB,OAAO,CAAC,cAAc;IAmBtB,OAAO,CAAC,WAAW;CAgBpB;AAQD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,aAAa,CASjE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,IAAI,IAAI,CAEzC;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,cAAc,EAAE,GAAG,aAAa,CAGzE"}

package/dist/shared/model-registry.js

@@ -0,0 +1,318 @@
+/**
+ * Model Registry
+ *
+ * Manages the pool of available AI models with:
+ * - Concurrency tracking (max N simultaneous uses per model)
+ * - Capability-based matching (task → best model)
+ * - Tier-based fallback (if preferred model is full, find similar)
+ * - Cost-aware scheduling (prefer cheaper models for simple tasks)
+ *
+ * "The art of programming is the art of organizing complexity." - Dijkstra
+ *
+ * @author Mask Weaver
+ */
+import { loadRuntimeConfig, normalizeDummyHumansConfig } from './config.js';
+// ============================================================================
+// Cost tier ordering
+// ============================================================================
+const COST_ORDER = {
+    low: 1,
+    medium: 2,
+    high: 3,
+};
+// ============================================================================
+// Tier fallback chain - when preferred tier is full
+// ============================================================================
+const TIER_FALLBACK = {
+    flash: ['human', 'premium'], // Flash full → try human → premium
+    human: ['premium', 'flash'], // Human full → try premium → flash
+    premium: ['human', 'flash'], // Premium full → try human → flash
+};
+// ============================================================================
+// Model Registry
+// ============================================================================
+export class ModelRegistry {
+    pool;
+    activeCountMap = new Map();
+    constructor(pool) {
+        this.pool = pool;
+        // Initialize all counts to 0
+        for (const entry of pool) {
+            this.activeCountMap.set(entry.id, 0);
+        }
+    }
+    // --------------------------------------------------------------------------
+    // Core: Acquire / Release
+    // --------------------------------------------------------------------------
+    /**
+     * Acquire a model from the pool.
+     *
+     * Selection strategy:
+     * 1. If modelId specified → try that exact model
+     * 2. Filter by tier preference
+     * 3. Filter by required capabilities
+     * 4. Among candidates, pick best available (cost-aware)
+     * 5. If no match in preferred tier, try fallback tiers
+     */
+    acquire(options = {}) {
+        const { tier, capabilities, preferCheap = true, modelId } = options;
+        // Specific model requested
+        if (modelId) {
+            const entry = this.pool.find(e => e.id === modelId);
+            if (!entry) {
+                return { success: false, reason: `Model "${modelId}" not found in pool` };
+            }
+            return this.tryAcquire(entry);
+        }
+        // Tier + capabilities based selection
+        const tiersToTry = [];
+        if (tier) {
+            tiersToTry.push(tier, ...TIER_FALLBACK[tier]);
+        }
+        else {
+            // No tier specified → try all from cheapest
+            tiersToTry.push('flash', 'human', 'premium');
+        }
+        for (const tryTier of tiersToTry) {
+            const candidates = this.findCandidates(tryTier, capabilities);
+            // Sort by availability then cost
+            const sorted = this.sortCandidates(candidates, preferCheap);
+            for (const entry of sorted) {
+                const result = this.tryAcquire(entry);
+                if (result.success) {
+                    // If we fell back to a different tier, note it
+                    if (tier && tryTier !== tier) {
+                        result.suggestion = `Preferred tier "${tier}" was full. Using "${tryTier}" model "${entry.id}" instead.`;
+                    }
+                    return result;
+                }
+            }
+        }
+        // All models exhausted
+        return {
+            success: false,
+            reason: 'All suitable models are at maximum concurrency',
+            suggestion: this.suggestWait(tier, capabilities),
+        };
+    }
+    /**
+     * Release a model back to the pool.
+     * Must be called when a task using this model completes.
+     */
+    release(modelId) {
+        const current = this.activeCountMap.get(modelId);
+        if (current === undefined) {
+            return false; // Unknown model
+        }
+        if (current <= 0) {
+            return false; // Already at 0
+        }
+        this.activeCountMap.set(modelId, current - 1);
+        return true;
+    }
+    // --------------------------------------------------------------------------
+    // Query: Status and availability
+    // --------------------------------------------------------------------------
+    /** Get the current status of all models in the pool */
+    getStatus() {
+        const models = this.pool.map(entry => this.getSlot(entry));
+        const totalCapacity = models.reduce((sum, m) => sum + m.entry.maxConcurrent, 0);
+        const totalActive = models.reduce((sum, m) => sum + m.activeCount, 0);
+        return {
+            models,
+            totalCapacity,
+            totalActive,
+            totalAvailable: totalCapacity - totalActive,
+        };
+    }
+    /** Get available models for a specific tier */
+    getAvailableForTier(tier) {
+        return this.pool
+            .filter(e => e.tier === tier)
+            .map(e => this.getSlot(e))
+            .filter(s => s.available);
+    }
+    /** Get all models with a specific capability */
+    getModelsWithCapability(capability) {
+        return this.pool
+            .filter(e => e.capabilities.includes(capability))
+            .map(e => this.getSlot(e));
+    }
+    /** Get the total concurrency available for a tier (including fallbacks) */
+    getTierConcurrency(tier) {
+        const tiersToInclude = [tier, ...TIER_FALLBACK[tier]];
+        const entries = this.pool.filter(e => tiersToInclude.includes(e.tier));
+        let total = 0;
+        let available = 0;
+        const models = [];
+        for (const entry of entries) {
+            const slot = this.getSlot(entry);
+            total += entry.maxConcurrent;
+            available += slot.remainingSlots;
+            if (slot.available)
+                models.push(entry.id);
+        }
+        return { total, available, models };
+    }
+    /** Get the pool entries */
+    getPool() {
+        return [...this.pool];
+    }
+    /** Get the agent name for a pool entry */
+    getAgentName(entry) {
+        return `dummy-${entry.id}`;
+    }
+    // --------------------------------------------------------------------------
+    // Recommend: Smart model selection
+    // --------------------------------------------------------------------------
+    /**
+     * Recommend the best model for a task based on its capabilities.
+     * Does NOT acquire — just suggests.
+     */
+    recommend(options = {}) {
+        const { tier, capabilities, preferCheap = true } = options;
+        const tiersToTry = tier
+            ? [tier, ...TIER_FALLBACK[tier]]
+            : ['flash', 'human', 'premium'];
+        for (const tryTier of tiersToTry) {
+            const candidates = this.findCandidates(tryTier, capabilities);
+            const sorted = this.sortCandidates(candidates, preferCheap);
+            for (const entry of sorted) {
+                const slot = this.getSlot(entry);
+                if (slot.available) {
+                    return entry;
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Compute maximum parallelism for a set of tasks.
+     * Given N tasks of different tiers, returns how many can run simultaneously.
+     */
+    computeMaxParallelism(taskTiers) {
+        // Count tasks per tier
+        const tierCounts = new Map();
+        for (const tier of taskTiers) {
+            tierCounts.set(tier, (tierCounts.get(tier) ?? 0) + 1);
+        }
+        // For each tier, compute available concurrency
+        let maxParallel = 0;
+        for (const [tier, count] of tierCounts) {
+            const entries = this.pool.filter(e => e.tier === tier);
+            const tierCapacity = entries.reduce((sum, e) => sum + e.maxConcurrent, 0);
+            maxParallel += Math.min(count, tierCapacity);
+        }
+        return maxParallel;
+    }
+    // --------------------------------------------------------------------------
+    // Internal helpers
+    // --------------------------------------------------------------------------
+    getSlot(entry) {
+        const activeCount = this.activeCountMap.get(entry.id) ?? 0;
+        const remainingSlots = entry.maxConcurrent - activeCount;
+        return {
+            entry,
+            activeCount,
+            available: remainingSlots > 0,
+            remainingSlots: Math.max(0, remainingSlots),
+        };
+    }
+    tryAcquire(entry) {
+        const slot = this.getSlot(entry);
+        if (!slot.available) {
+            return {
+                success: false,
+                reason: `Model "${entry.id}" at max concurrency (${entry.maxConcurrent})`,
+            };
+        }
+        // Increment active count
+        this.activeCountMap.set(entry.id, slot.activeCount + 1);
+        return {
+            success: true,
+            slot: {
+                ...slot,
+                activeCount: slot.activeCount + 1,
+                remainingSlots: slot.remainingSlots - 1,
+                available: slot.remainingSlots - 1 > 0,
+            },
+            agentName: this.getAgentName(entry),
+        };
+    }
+    findCandidates(tier, capabilities) {
+        return this.pool.filter(entry => {
+            // Must match tier
+            if (entry.tier !== tier)
+                return false;
+            // If capabilities specified, at least one must match
+            if (capabilities && capabilities.length > 0) {
+                const hasMatch = capabilities.some(c => entry.capabilities.includes(c));
+                if (!hasMatch)
+                    return false;
+            }
+            return true;
+        });
+    }
+    sortCandidates(entries, preferCheap) {
+        return [...entries].sort((a, b) => {
+            // 1. Available slots first
+            const slotA = this.getSlot(a);
+            const slotB = this.getSlot(b);
+            if (slotA.available && !slotB.available)
+                return -1;
+            if (!slotA.available && slotB.available)
+                return 1;
+            // 2. Cost ordering
+            if (preferCheap) {
+                const costDiff = COST_ORDER[a.costTier] - COST_ORDER[b.costTier];
+                if (costDiff !== 0)
+                    return costDiff;
+            }
+            // 3. More remaining slots = better
+            return slotB.remainingSlots - slotA.remainingSlots;
+        });
+    }
+    suggestWait(tier, capabilities) {
+        const status = this.getStatus();
+        const busiest = status.models
+            .filter(m => m.activeCount > 0)
+            .sort((a, b) => b.activeCount - a.activeCount);
+        if (busiest.length === 0) {
+            return 'No models are configured in the pool.';
+        }
+        const hints = busiest.slice(0, 3).map(m => `  - ${m.entry.id}: ${m.activeCount}/${m.entry.maxConcurrent} in use`);
+        return `All models are busy. Current usage:\n${hints.join('\n')}\nWait for a task to complete or add more models to the pool.`;
+    }
+}
+// ============================================================================
+// Singleton Instance
+// ============================================================================
+let registryInstance = null;
+/**
+ * Get the global model registry.
+ * Lazily initialized from maskweaver.config.json.
+ */
+export function getModelRegistry(basePath) {
+    if (!registryInstance) {
+        const config = loadRuntimeConfig(basePath);
+        const pool = config.dummyHumans
+            ? normalizeDummyHumansConfig(config.dummyHumans)
+            : [];
+        registryInstance = new ModelRegistry(pool);
+    }
+    return registryInstance;
+}
+/**
+ * Reset the registry (for testing or config reload).
+ */
+export function resetModelRegistry() {
+    registryInstance = null;
+}
+/**
+ * Create a fresh registry from explicit pool entries.
+ */
+export function createModelRegistry(pool) {
+    registryInstance = new ModelRegistry(pool);
+    return registryInstance;
+}
+//# sourceMappingURL=model-registry.js.map

package/dist/shared/model-registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-registry.js","sourceRoot":"","sources":["../../src/shared/model-registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAAE,iBAAiB,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AAwD5E,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E,MAAM,UAAU,GAAkC;IAChD,GAAG,EAAE,CAAC;IACN,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;CACR,CAAC;AAEF,+EAA+E;AAC/E,oDAAoD;AACpD,+EAA+E;AAE/E,MAAM,aAAa,GAAmC;IACpD,KAAK,EAAI,CAAC,OAAO,EAAE,SAAS,CAAC,EAAM,mCAAmC;IACtE,KAAK,EAAI,CAAC,SAAS,EAAE,OAAO,CAAC,EAAM,mCAAmC;IACtE,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAQ,mCAAmC;CACvE,CAAC;AAEF,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E,MAAM,OAAO,aAAa;IAChB,IAAI,CAAmB;IACvB,cAAc,GAAwB,IAAI,GAAG,EAAE,CAAC;IAExD,YAAY,IAAsB;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,6BAA6B;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,0BAA0B;IAC1B,6EAA6E;IAE7E;;;;;;;;;OASG;IACH,OAAO,CAAC,UAA0B,EAAE;QAClC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;QAEpE,2BAA2B;QAC3B,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,OAAO,qBAAqB,EAAE,CAAC;YAC5E,CAAC;YACD,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,sCAAsC;QACtC,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,IAAI,IAAI,EAAE,CAAC;YACT,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,4CAA4C;YAC5C,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC/C,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAE9D,iCAAiC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;YAE5D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBACtC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,+CAA+C;oBAC/C,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;wBAC7B,MAAM,CAAC,UAAU,GAAG,mBAAmB,IAAI,sBAAsB,OAAO,YAAY,KAAK,CAAC,EAAE,YAAY,CAAC;oBAC3G,CAAC;oBACD,OAAO,MAAM,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,gDAAgD;YACxD,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,CAAC;SACjD,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,OAAe;QACrB,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC,CAAC,gBAAgB;QAChC,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC,CAAC,eAAe;QAC/B,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,iCAAiC;IACjC,6EAA6E;IAE7E,uDAAuD;IACvD,SAAS;QACP,MAAM,MAAM,GAAgB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAExE,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAChF,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAEtE,OAAO;YACL,MAAM;YACN,aAAa;YACb,WAAW;YACX,cAAc,EAAE,aAAa,GAAG,WAAW;SAC5C,CAAC;IACJ,CAAC;IAED,+CAA+C;IAC/C,mBAAmB,CAAC,IAAe;QACjC,OAAO,IAAI,CAAC,IAAI;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;aAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;IAED,gDAAgD;IAChD,uBAAuB,CAAC,UAA2B;QACjD,OAAO,IAAI,CAAC,IAAI;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;aAChD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,2EAA2E;IAC3E,kBAAkB,CAAC,IAAe;QAChC,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAEvE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACjC,KAAK,IAAI,KAAK,CAAC,aAAa,CAAC;YAC7B,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC;YACjC,IAAI,IAAI,CAAC,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;IACtC,CAAC;IAED,2BAA2B;IAC3B,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,0CAA0C;IAC1C,YAAY,CAAC,KAAqB;QAChC,OAAO,SAAS,KAAK,CAAC,EAAE,EAAE,CAAC;IAC7B,CAAC;IAED,6EAA6E;IAC7E,mCAAmC;IACnC,6EAA6E;IAE7E;;;OAGG;IACH,SAAS,CAAC,UAA0B,EAAE;QACpC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;QAE3D,MAAM,UAAU,GAAgB,IAAI;YAClC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAElC,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;YAE5D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACjC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;oBACnB,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,qBAAqB,CAAC,SAAsB;QAC1C,uBAAuB;QACvB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,+CAA+C;QAC/C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YACvD,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YAC1E,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAErE,OAAO,CAAC,KAAqB;QACnC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,cAAc,GAAG,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC;QACzD,OAAO;YACL,KAAK;YACL,WAAW;YACX,SAAS,EAAE,cAAc,GAAG,CAAC;YAC7B,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC;SAC5C,CAAC;IACJ,CAAC;IAEO,UAAU,CAAC,KAAqB;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,MAAM,EAAE,UAAU,KAAK,CAAC,EAAE,yBAAyB,KAAK,CAAC,aAAa,GAAG;aAC1E,CAAC;QACJ,CAAC;QAED,yBAAyB;QACzB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAExD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,IAAI,EAAE;gBACJ,GAAG,IAAI;gBACP,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,CAAC;gBACjC,cAAc,EAAE,IAAI,CAAC,cAAc,GAAG,CAAC;gBACvC,SAAS,EAAE,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,CAAC;aACvC;YACD,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;SACpC,CAAC;IACJ,CAAC;IAEO,cAAc,CAAC,IAAe,EAAE,YAAgC;QACtE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC9B,kBAAkB;YAClB,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAEtC,qDAAqD;YACrD,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,IAAI,CAAC,QAAQ;oBAAE,OAAO,KAAK,CAAC;YAC9B,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,cAAc,CAAC,OAAyB,EAAE,WAAoB;QACpE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAChC,2BAA2B;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,SAAS;gBAAE,OAAO,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS;gBAAE,OAAO,CAAC,CAAC;YAElD,mBAAmB;YACnB,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,QAAQ,KAAK,CAAC;oBAAE,OAAO,QAAQ,CAAC;YACtC,CAAC;YAED,mCAAmC;YACnC,OAAO,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,IAAgB,EAAE,YAAgC;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;aAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAEjD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,uCAAuC,CAAC;QACjD,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CACxC,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,SAAS,CACtE,CAAC;QAEF,OAAO,wCAAwC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,+DAA+D,CAAC;IACjI,CAAC;CACF;AAED,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E,IAAI,gBAAgB,GAAyB,IAAI,CAAC;AAElD;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAiB;IAChD,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW;YAC7B,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,WAAW,CAAC;YAChD,CAAC,CAAC,EAAE,CAAC;QACP,gBAAgB,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,gBAAgB,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB;IAChC,gBAAgB,GAAG,IAAI,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAsB;IACxD,gBAAgB,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IAC3C,OAAO,gBAAgB,CAAC;AAC1B,CAAC"}

package/dist/weave/bridge.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Weave-Squad Bridge
+ *
+ * Converts between Weave types (WeaveTask, WeavePhase) and Squad types (TaskState)
+ * to enable parallel execution of Weave phase tasks through the Squad system.
+ *
+ * This is the missing link between the two systems:
+ * - Weave: Project-level milestone tracking (YAML plans)
+ * - Squad: Multi-agent parallel execution (JSON sessions)
+ */
+import type { WeaveTask, PhaseExecutionPlan, TaskExecutionPlan } from './types.js';
+import type { TaskState, Priority } from '../shared-context/types.js';
+/**
+ * Convert a WeaveTask to a TaskState for use in the Squad system.
+ * Maps Weave concepts to Squad concepts:
+ * - WeaveTask.id -> TaskState.taskId
+ * - WeaveTask.status -> TaskState.status (with mapping)
+ * - Complexity -> TaskState.priority
+ */
+export declare function weaveTaskToSquadTask(task: WeaveTask, options: {
+    assignee: string;
+    priority?: Priority;
+    dependencies?: string[];
+}): TaskState;
+/**
+ * Map TaskComplexity to Squad Priority.
+ */
+export declare function complexityToPriority(complexity: 'simple' | 'standard' | 'complex'): Priority;
+/**
+ * Convert a PhaseExecutionPlan into a list of TaskStates for the Squad system.
+ * Each TaskExecutionPlan determines the assignee (agent tier) and priority.
+ */
+export declare function executionPlanToSquadTasks(plan: PhaseExecutionPlan): TaskState[];
+/**
+ * Analyze a PhaseExecutionPlan for parallel execution opportunities.
+ *
+ * Since Weave tasks within a phase don't have explicit dependencies by default,
+ * this function uses a heuristic:
+ * - Tasks that touch the same file patterns are grouped sequentially
+ * - Independent tasks are grouped into parallel waves
+ *
+ * Returns DAG analysis with wave grouping for parallel execution.
+ */
+export declare function analyzeParallelOpportunities(plan: PhaseExecutionPlan): ParallelAnalysis;
+export interface WaveDetail {
+    waveIndex: number;
+    tasks: TaskExecutionPlan[];
+}
+export interface ParallelAnalysis {
+    totalTasks: number;
+    totalWaves: number;
+    parallelismFactor: number;
+    isFullyParallel: boolean;
+    waves: WaveDetail[];
+    criticalPath: string[];
+}
+/**
+ * Format parallel analysis as markdown for the Mask Weaver.
+ */
+export declare function formatParallelAnalysis(analysis: ParallelAnalysis): string;
+//# sourceMappingURL=bridge.d.ts.map

package/dist/weave/bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bridge.d.ts","sourceRoot":"","sources":["../../src/weave/bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAc,kBAAkB,EAAE,iBAAiB,EAAa,MAAM,YAAY,CAAC;AAC1G,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAOtE;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAChC,IAAI,EAAE,SAAS,EACf,OAAO,EAAE;IACL,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CAC3B,GACF,SAAS,CAUX;AAcD;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,UAAU,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAM5F;AAMD;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,kBAAkB,GAAG,SAAS,EAAE,CAK/E;AAMD;;;;;;;;;GASG;AACH,wBAAgB,4BAA4B,CAAC,IAAI,EAAE,kBAAkB,GAAG,gBAAgB,CAuCvF;AAMD,MAAM,WAAW,UAAU;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,iBAAiB,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,gBAAgB;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,OAAO,CAAC;IACzB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,YAAY,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,MAAM,CA2BzE"}

package/dist/weave/bridge.js

@@ -0,0 +1,143 @@
+/**
+ * Weave-Squad Bridge
+ *
+ * Converts between Weave types (WeaveTask, WeavePhase) and Squad types (TaskState)
+ * to enable parallel execution of Weave phase tasks through the Squad system.
+ *
+ * This is the missing link between the two systems:
+ * - Weave: Project-level milestone tracking (YAML plans)
+ * - Squad: Multi-agent parallel execution (JSON sessions)
+ */
+import { buildDAG } from '../shared-context/dag.js';
+// ============================================================================
+// WeaveTask -> TaskState Conversion
+// ============================================================================
+/**
+ * Convert a WeaveTask to a TaskState for use in the Squad system.
+ * Maps Weave concepts to Squad concepts:
+ * - WeaveTask.id -> TaskState.taskId
+ * - WeaveTask.status -> TaskState.status (with mapping)
+ * - Complexity -> TaskState.priority
+ */
+export function weaveTaskToSquadTask(task, options) {
+    return {
+        taskId: task.id,
+        assignee: options.assignee,
+        status: mapWeaveStatusToSquad(task.status),
+        priority: options.priority || 'medium',
+        description: task.name,
+        dependencies: options.dependencies || [],
+        createdAt: new Date().toISOString(),
+    };
+}
+/**
+ * Map Weave task status to Squad task status.
+ */
+function mapWeaveStatusToSquad(weaveStatus) {
+    switch (weaveStatus) {
+        case 'pending': return 'pending';
+        case 'in_progress': return 'active';
+        case 'passed': return 'completed';
+        case 'failed': return 'failed';
+    }
+}
+/**
+ * Map TaskComplexity to Squad Priority.
+ */
+export function complexityToPriority(complexity) {
+    switch (complexity) {
+        case 'simple': return 'low';
+        case 'standard': return 'medium';
+        case 'complex': return 'high';
+    }
+}
+// ============================================================================
+// Phase -> Squad Task List Conversion
+// ============================================================================
+/**
+ * Convert a PhaseExecutionPlan into a list of TaskStates for the Squad system.
+ * Each TaskExecutionPlan determines the assignee (agent tier) and priority.
+ */
+export function executionPlanToSquadTasks(plan) {
+    return plan.taskPlans.map(tp => weaveTaskToSquadTask(tp.task, {
+        assignee: tp.agentTier,
+        priority: complexityToPriority(tp.complexity),
+    }));
+}
+// ============================================================================
+// Parallel Execution Analysis
+// ============================================================================
+/**
+ * Analyze a PhaseExecutionPlan for parallel execution opportunities.
+ *
+ * Since Weave tasks within a phase don't have explicit dependencies by default,
+ * this function uses a heuristic:
+ * - Tasks that touch the same file patterns are grouped sequentially
+ * - Independent tasks are grouped into parallel waves
+ *
+ * Returns DAG analysis with wave grouping for parallel execution.
+ */
+export function analyzeParallelOpportunities(plan) {
+    const squadTasks = executionPlanToSquadTasks(plan);
+    // If no dependencies, all tasks are in wave 0 (fully parallel)
+    const allIndependent = squadTasks.every(t => !t.dependencies || t.dependencies.length === 0);
+    let dagAnalysis;
+    if (allIndependent && squadTasks.length > 1) {
+        // All tasks are independent — one big parallel wave
+        dagAnalysis = {
+            nodes: new Map(),
+            waves: [{ waveIndex: 0, taskIds: squadTasks.map(t => t.taskId) }],
+            criticalPath: [squadTasks[0].taskId],
+            hasCycle: false,
+            parallelismFactor: squadTasks.length,
+        };
+    }
+    else {
+        // Use DAG analysis for dependency-aware wave grouping
+        dagAnalysis = buildDAG(squadTasks);
+    }
+    // Map waves back to execution plans
+    const waveDetails = dagAnalysis.waves.map(wave => ({
+        waveIndex: wave.waveIndex,
+        tasks: wave.taskIds.map(taskId => {
+            const tp = plan.taskPlans.find(p => p.task.id === taskId);
+            return tp;
+        }).filter(Boolean),
+    }));
+    return {
+        totalTasks: plan.taskPlans.length,
+        totalWaves: dagAnalysis.waves.length,
+        parallelismFactor: dagAnalysis.parallelismFactor,
+        isFullyParallel: allIndependent,
+        waves: waveDetails,
+        criticalPath: dagAnalysis.criticalPath,
+    };
+}
+/**
+ * Format parallel analysis as markdown for the Mask Weaver.
+ */
+export function formatParallelAnalysis(analysis) {
+    const lines = [];
+    lines.push('### Parallel Execution Analysis');
+    lines.push('');
+    lines.push(`- Total tasks: ${analysis.totalTasks}`);
+    lines.push(`- Execution waves: ${analysis.totalWaves}`);
+    lines.push(`- Parallelism factor: ${analysis.parallelismFactor.toFixed(1)}x`);
+    lines.push(`- Fully parallel: ${analysis.isFullyParallel ? 'yes' : 'no'}`);
+    lines.push('');
+    for (const wave of analysis.waves) {
+        lines.push(`**Wave ${wave.waveIndex}** (${wave.tasks.length} tasks in parallel):`);
+        for (const tp of wave.tasks) {
+            const tierLabel = tp.agentTier === 'dummy-flash' ? 'flash'
+                : tp.agentTier === 'dummy-human' ? 'human'
+                    : 'premium';
+            lines.push(`  - [${tierLabel}] ${tp.task.name} (${tp.mask || 'auto'})`);
+        }
+        lines.push('');
+    }
+    if (analysis.criticalPath.length > 1) {
+        lines.push(`Critical path: ${analysis.criticalPath.join(' -> ')}`);
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=bridge.js.map