pulseed 0.4.16 → 0.4.18

package/dist/orchestrator/goal/goal-decomposer.js

@@ -1,167 +0,0 @@
-import { randomUUID } from "node:crypto";
-import { z } from "zod";
-import { GoalSchema } from "../../base/types/goal.js";
-import { DimensionDecompositionSchema } from "../../base/types/negotiation.js";
-import { decompositionToDimension } from "./goal-validation.js";
-// ─── Prompt builders ───
-function buildSubgoalDecompositionPrompt(parentGoal) {
-    const dimensionsList = parentGoal.dimensions
-        .map((d) => `- ${d.label} (${d.name}): target=${JSON.stringify(d.threshold)}`)
-        .join("\n");
-    return `Break down this goal into actionable subgoals.
-
-Goal: ${parentGoal.title}
-Description: ${parentGoal.description}
-Dimensions:
-${dimensionsList}
-
-For each subgoal, provide:
-- title: a clear subgoal title
-- description: what needs to be achieved
-- dimensions: array of dimension decompositions (same format as goal dimensions)
-
-Return a JSON array of subgoal objects:
-[
-  {
-    "title": "Subgoal Title",
-    "description": "What to achieve",
-    "dimensions": [
-      {
-        "name": "dimension_name",
-        "label": "Dimension Label",
-        "threshold_type": "min",
-        "threshold_value": 50,
-        "observation_method_hint": "How to measure"
-      }
-    ]
-  }
-]
-
-Return ONLY a JSON array, no other text.`;
-}
-// ─── Schemas ───
-const SubgoalLLMSchema = z.object({
-    title: z.string(),
-    description: z.string(),
-    dimensions: z.array(DimensionDecompositionSchema),
-});
-const SubgoalListSchema = z.array(SubgoalLLMSchema);
-// ─── decompose() ───
-export async function decompose(goalId, parentGoal, deps) {
-    const { stateManager, llmClient, ethicsGate, satisficingJudge, promptGateway } = deps;
-    // Step 1: LLM generates subgoals
-    const prompt = buildSubgoalDecompositionPrompt(parentGoal);
-    let subgoalSpecs;
-    if (promptGateway) {
-        subgoalSpecs = await promptGateway.execute({
-            purpose: "goal_decomposition",
-            goalId,
-            responseSchema: SubgoalListSchema,
-            additionalContext: {
-                prompt,
-                parentGoalTitle: parentGoal.title,
-                parentGoalDescription: parentGoal.description,
-            },
-        });
-    }
-    else {
-        const response = await llmClient.sendMessage([{ role: "user", content: prompt }], { temperature: 0 });
-        subgoalSpecs = llmClient.parseJSON(response.content, SubgoalListSchema);
-    }
-    const subgoals = [];
-    const rejectedSubgoals = [];
-    let hasCriticalRejection = false;
-    // Step 2: Ethics check each subgoal
-    for (const spec of subgoalSpecs) {
-        const subgoalId = randomUUID();
-        const verdict = await ethicsGate.check("subgoal", subgoalId, spec.description, `Parent goal: ${parentGoal.title}`);
-        if (verdict.verdict === "reject") {
-            rejectedSubgoals.push({
-                description: spec.title,
-                reason: verdict.reasoning,
-            });
-            hasCriticalRejection = true;
-            continue;
-        }
-        const now = new Date().toISOString();
-        const dimensions = spec.dimensions.map(decompositionToDimension);
-        const subgoal = GoalSchema.parse({
-            id: subgoalId,
-            parent_id: goalId,
-            node_type: "subgoal",
-            title: spec.title,
-            description: spec.description,
-            status: "active",
-            dimensions,
-            gap_aggregation: "max",
-            dimension_mapping: null,
-            constraints: parentGoal.constraints ?? [],
-            children_ids: [],
-            target_date: null,
-            origin: "decomposition",
-            pace_snapshot: null,
-            deadline: null,
-            confidence_flag: verdict.verdict === "flag" ? "medium" : "high",
-            user_override: false,
-            feasibility_note: null,
-            uncertainty_weight: 1.0,
-            created_at: now,
-            updated_at: now,
-        });
-        subgoals.push(subgoal);
-        await stateManager.saveGoal(subgoal);
-    }
-    // Phase 2: Auto-propose dimension mappings
-    if (satisficingJudge) {
-        for (const subgoal of subgoals) {
-            try {
-                const proposals = await satisficingJudge.proposeDimensionMapping(subgoal.dimensions.map((d) => ({ name: d.name })), parentGoal.dimensions.map((d) => ({ name: d.name })));
-                // Apply proposals to subgoal dimensions that don't already have mappings
-                for (const proposal of proposals) {
-                    const dim = subgoal.dimensions.find((d) => d.name === proposal.subgoal_dimension);
-                    if (dim && !dim.dimension_mapping) {
-                        dim.dimension_mapping = {
-                            parent_dimension: proposal.parent_dimension,
-                            aggregation: proposal.suggested_aggregation,
-                        };
-                    }
-                }
-                if (proposals.length > 0) {
-                    await stateManager.saveGoal(subgoal);
-                }
-            }
-            catch {
-                // Non-critical: auto-mapping failure should not block decomposition
-            }
-        }
-    }
-    // Step 4: If critical subgoal rejected, warn (but still return what we can)
-    if (hasCriticalRejection && subgoals.length === 0) {
-        // All subgoals rejected — caller should consider rejecting parent goal
-    }
-    return { subgoals, rejectedSubgoals };
-}
-// ─── decomposeIntoSubgoals() ───
-/**
- * Decompose a negotiated goal into subgoals using GoalTreeManager.
- * For depth >= 2, skip negotiation and auto-accept.
- * Returns null if goalTreeManager is not injected.
- */
-export async function decomposeIntoSubgoals(goalId, deps, config) {
-    const { stateManager, goalTreeManager } = deps;
-    if (goalTreeManager === undefined) {
-        return null;
-    }
-    const goal = await stateManager.loadGoal(goalId);
-    if (!goal) {
-        return null;
-    }
-    const resolvedConfig = config ?? {
-        max_depth: 5,
-        min_specificity: 0.7,
-        auto_prune_threshold: 0.3,
-        parallel_loop_limit: 3,
-    };
-    return goalTreeManager.decomposeGoal(goalId, resolvedConfig);
-}
-//# sourceMappingURL=goal-decomposer.js.map

package/dist/orchestrator/goal/goal-decomposer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"goal-decomposer.js","sourceRoot":"","sources":["../../../src/orchestrator/goal/goal-decomposer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,iCAAiC,CAAC;AAO/E,OAAO,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAGhE,0BAA0B;AAE1B,SAAS,+BAA+B,CAAC,UAAgB;IACvD,MAAM,cAAc,GAAG,UAAU,CAAC,UAAU;SACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,aAAa,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;SAC7E,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,OAAO;;QAED,UAAU,CAAC,KAAK;eACT,UAAU,CAAC,WAAW;;EAEnC,cAAc;;;;;;;;;;;;;;;;;;;;;;;;yCAwByB,CAAC;AAC1C,CAAC;AAED,kBAAkB;AAElB,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,4BAA4B,CAAC;CAClD,CAAC,CAAC;AAEH,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;AAapD,sBAAsB;AAEtB,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,MAAc,EACd,UAAgB,EAChB,IAAwB;IAKxB,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,gBAAgB,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;IAEtF,iCAAiC;IACjC,MAAM,MAAM,GAAG,+BAA+B,CAAC,UAAU,CAAC,CAAC;IAC3D,IAAI,YAA+C,CAAC;IACpD,IAAI,aAAa,EAAE,CAAC;QAClB,YAAY,GAAG,MAAM,aAAa,CAAC,OAAO,CAAC;YACzC,OAAO,EAAE,oBAAoB;YAC7B,MAAM;YACN,cAAc,EAAE,iBAAiB;YACjC,iBAAiB,EAAE;gBACjB,MAAM;gBACN,eAAe,EAAE,UAAU,CAAC,KAAK;gBACjC,qBAAqB,EAAE,UAAU,CAAC,WAAW;aAC9C;SACF,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;QACF,YAAY,GAAG,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,QAAQ,GAAW,EAAE,CAAC;IAC5B,MAAM,gBAAgB,GAAmD,EAAE,CAAC;IAC5E,IAAI,oBAAoB,GAAG,KAAK,CAAC;IAEjC,oCAAoC;IACpC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,UAAU,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,KAAK,CACpC,SAAS,EACT,SAAS,EACT,IAAI,CAAC,WAAW,EAChB,gBAAgB,UAAU,CAAC,KAAK,EAAE,CACnC,CAAC;QAEF,IAAI,OAAO,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;YACjC,gBAAgB,CAAC,IAAI,CAAC;gBACpB,WAAW,EAAE,IAAI,CAAC,KAAK;gBACvB,MAAM,EAAE,OAAO,CAAC,SAAS;aAC1B,CAAC,CAAC;YACH,oBAAoB,GAAG,IAAI,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;QAEjE,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC;YAC/B,EAAE,EAAE,SAAS;YACb,SAAS,EAAE,MAAM;YACjB,SAAS,EAAE,SAAS;YACpB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,MAAM,EAAE,QAAQ;YAChB,UAAU;YACV,eAAe,EAAE,KAAK;YACtB,iBAAiB,EAAE,IAAI;YACvB,WAAW,EAAE,UAAU,CAAC,WAAW,IAAI,EAAE;YACzC,YAAY,EAAE,EAAE;YAChB,WAAW,EAAE,IAAI;YACjB,MAAM,EAAE,eAAe;YACvB,aAAa,EAAE,IAAI;YACnB,QAAQ,EAAE,IAAI;YACd,eAAe,EAAE,OAAO,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM;YAC/D,aAAa,EAAE,KAAK;YACpB,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,GAAG;YACvB,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;QAEH,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,MAAM,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED,2CAA2C;IAC3C,IAAI,gBAAgB,EAAE,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACH,MAAM,SAAS,GAAG,MAAM,gBAAgB,CAAC,uBAAuB,CAC9D,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EACjD,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CACrD,CAAC;gBACF,yEAAyE;gBACzE,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,iBAAiB,CAAC,CAAC;oBAClF,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC;wBAClC,GAAG,CAAC,iBAAiB,GAAG;4BACtB,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;4BAC3C,WAAW,EAAE,QAAQ,CAAC,qBAAqB;yBAC5C,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,oEAAoE;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,IAAI,oBAAoB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,uEAAuE;IACzE,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC;AACxC,CAAC;AAED,kCAAkC;AAElC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,MAAc,EACd,IAAwB,EACxB,MAAgC;IAEhC,MAAM,EAAE,YAAY,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC;IAE/C,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,cAAc,GAA4B,MAAM,IAAI;QACxD,SAAS,EAAE,CAAC;QACZ,eAAe,EAAE,GAAG;QACpB,oBAAoB,EAAE,GAAG;QACzB,mBAAmB,EAAE,CAAC;KACvB,CAAC;IAEF,OAAO,eAAe,CAAC,aAAa,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AAC/D,CAAC"}

package/dist/orchestrator/goal/goal-dependency-graph.d.ts

@@ -1,124 +0,0 @@
-import type { StateManager } from "../../base/state/state-manager.js";
-import type { ILLMClient } from "../../base/llm/llm-client.js";
-import type { DependencyEdge, DependencyEdgeStatus, DependencyGraph } from "../../base/types/dependency.js";
-import type { DependencyType } from "../../base/types/core.js";
-import type { IPromptGateway } from "../../prompt/gateway.js";
-interface DependencyLogger {
-    warn?: (message: string, context?: Record<string, unknown>) => void;
-}
-/**
- * GoalDependencyGraph manages a DAG of dependencies between goals.
- *
- * Supports 4 edge types:
- *   - prerequisite: goal A must complete before goal B can start
- *   - resource_conflict: goals A and B compete for the same resource
- *   - synergy: progress on goal A helps goal B
- *   - conflict: goals A and B have incompatible objectives
- *
- * Persistence: ~/.pulseed/dependency-graph.json (via StateManager.readRaw/writeRaw)
- */
-export declare class GoalDependencyGraph {
-    private stateManager;
-    private llmClient?;
-    private promptGateway?;
-    private logger?;
-    private graph;
-    constructor(stateManager: StateManager, llmClient?: ILLMClient, promptGateway?: IPromptGateway, logger?: DependencyLogger);
-    /**
-     * Initializes the graph from disk. Must be called after construction when
-     * StateManager async methods are available.
-     */
-    init(): Promise<void>;
-    /**
-     * Adds an edge to the graph.
-     * For prerequisite edges, validates that the addition would not create a cycle.
-     */
-    addEdge(edge: Omit<DependencyEdge, "created_at">): Promise<DependencyEdge>;
-    /**
-     * Removes an edge matching from/to/type from the graph.
-     */
-    removeEdge(fromGoalId: string, toGoalId: string, type: DependencyType): Promise<void>;
-    /**
-     * Updates the status of an edge identified by from/to.
-     */
-    updateEdgeStatus(fromGoalId: string, toGoalId: string, status: DependencyEdgeStatus): Promise<void>;
-    /**
-     * Returns all edges where goalId appears as either from or to.
-     */
-    getEdges(goalId: string): DependencyEdge[];
-    /**
-     * Returns the first edge matching from/to (and optionally type), or null.
-     */
-    getEdge(fromGoalId: string, toGoalId: string, type?: DependencyType): DependencyEdge | null;
-    /**
-     * Detects whether adding a prerequisite edge from→to would create a cycle.
-     *
-     * Uses BFS starting from "to" following active prerequisite edges.
-     * If we can reach "from", adding from→to would form a cycle.
-     */
-    detectCycle(fromGoalId: string, toGoalId: string): boolean;
-    /**
-     * Returns active prerequisite edges that must be satisfied before goalId can proceed.
-     */
-    getPrerequisites(goalId: string): DependencyEdge[];
-    /**
-     * Returns true if goalId has unresolved prerequisites.
-     */
-    isBlocked(goalId: string): boolean;
-    /**
-     * Returns the IDs of goals that must complete before goalId can proceed.
-     */
-    getBlockingGoals(goalId: string): string[];
-    /**
-     * Returns active resource_conflict edges involving goalId.
-     */
-    getResourceConflicts(goalId: string): DependencyEdge[];
-    /**
-     * Returns goal IDs that have a synergy relationship with goalId.
-     */
-    getSynergyPartners(goalId: string): string[];
-    /**
-     * Uses an LLM to automatically detect dependency relationships between a new goal
-     * and a set of existing goals. Detected dependencies are added to the graph.
-     *
-     * Returns an empty array if no LLM client is configured or no existing goals are provided.
-     */
-    autoDetectDependencies(newGoalId: string, existingGoalIds: string[]): Promise<DependencyEdge[]>;
-    /**
-     * Add a strategy-level dependency between two strategies.
-     * Uses DependencyType "strategy_dependency" for the underlying edge.
-     * The sourceStrategyId is stored in from_goal_id and targetStrategyId in to_goal_id.
-     */
-    addStrategyDependency(sourceStrategyId: string, targetStrategyId: string, dependencyType: "prerequisite" | "enhances", goalId: string): Promise<void>;
-    /**
-     * Get all strategy dependencies for a given strategy.
-     * Returns edges where this strategy is either source or target.
-     */
-    getStrategyDependencies(strategyId: string): Array<{
-        source_strategy_id: string;
-        target_strategy_id: string;
-        dependency_type: "prerequisite" | "enhances";
-        goal_id: string;
-    }>;
-    /**
-     * Check if a strategy is blocked by a prerequisite dependency.
-     * Returns true if the strategy has a prerequisite dependency where
-     * the source strategy is NOT in completedStrategyIds.
-     */
-    isStrategyBlocked(strategyId: string, completedStrategyIds: string[]): boolean;
-    /**
-     * Loads the dependency graph from disk.
-     * Returns an empty graph if no file exists or parsing fails.
-     */
-    load(): Promise<DependencyGraph>;
-    /**
-     * Persists the dependency graph to disk.
-     */
-    save(graph: DependencyGraph): Promise<void>;
-    /**
-     * Returns the current in-memory graph.
-     */
-    getGraph(): DependencyGraph;
-}
-export {};
-//# sourceMappingURL=goal-dependency-graph.d.ts.map

package/dist/orchestrator/goal/goal-dependency-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"goal-dependency-graph.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/goal/goal-dependency-graph.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACtE,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,8BAA8B,CAAC;AAC3E,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,eAAe,EAChB,MAAM,gCAAgC,CAAC;AAExC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAE9D,UAAU,gBAAgB;IACxB,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;CACrE;AAcD;;;;;;;;;;GAUG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,SAAS,CAAC,CAAa;IAC/B,OAAO,CAAC,aAAa,CAAC,CAAiB;IACvC,OAAO,CAAC,MAAM,CAAC,CAAmB;IAClC,OAAO,CAAC,KAAK,CAAkB;gBAEnB,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,UAAU,EAAE,aAAa,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,gBAAgB;IAQzH;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAM3B;;;OAGG;IACG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC;IA0BhF;;OAEG;IACG,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAa3F;;OAEG;IACG,gBAAgB,CACpB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,oBAAoB,GAC3B,OAAO,CAAC,IAAI,CAAC;IAShB;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IAM1C;;OAEG;IACH,OAAO,CACL,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,IAAI,CAAC,EAAE,cAAc,GACpB,cAAc,GAAG,IAAI;IAaxB;;;;;OAKG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAqC1D;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IASlD;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIlC;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAI1C;;OAEG;IACH,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IAStD;;OAEG;IACH,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAe5C;;;;;OAKG;IACG,sBAAsB,CAC1B,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,MAAM,EAAE,GACxB,OAAO,CAAC,cAAc,EAAE,CAAC;IAqE5B;;;;OAIG;IACG,qBAAqB,CACzB,gBAAgB,EAAE,MAAM,EACxB,gBAAgB,EAAE,MAAM,EACxB,cAAc,EAAE,cAAc,GAAG,UAAU,EAC3C,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC;IAchB;;;OAGG;IACH,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC;QACjD,kBAAkB,EAAE,MAAM,CAAC;QAC3B,kBAAkB,EAAE,MAAM,CAAC;QAC3B,eAAe,EAAE,cAAc,GAAG,UAAU,CAAC;QAC7C,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IAqBF;;;;OAIG;IACH,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,EAAE,GAAG,OAAO;IAY9E;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,eAAe,CAAC;IAYtC;;OAEG;IACG,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC;IAIjD;;OAEG;IACH,QAAQ,IAAI,eAAe;CAG5B"}

package/dist/orchestrator/goal/goal-dependency-graph.js

@@ -1,337 +0,0 @@
-import { z } from "zod";
-import { ValidationError } from "../../base/utils/errors.js";
-import { DependencyGraphSchema } from "../../base/types/dependency.js";
-const AutoDetectItemSchema = z.object({
-    from_goal_id: z.string(),
-    to_goal_id: z.string(),
-    type: z.enum(["prerequisite", "resource_conflict", "synergy", "conflict"]),
-    condition: z.string().nullable().optional(),
-    affected_dimensions: z.array(z.string()).optional(),
-    reasoning: z.string().nullable().optional(),
-    detection_confidence: z.number().min(0).max(1).optional(),
-});
-const AutoDetectResponseSchema = z.array(AutoDetectItemSchema);
-/**
- * GoalDependencyGraph manages a DAG of dependencies between goals.
- *
- * Supports 4 edge types:
- *   - prerequisite: goal A must complete before goal B can start
- *   - resource_conflict: goals A and B compete for the same resource
- *   - synergy: progress on goal A helps goal B
- *   - conflict: goals A and B have incompatible objectives
- *
- * Persistence: ~/.pulseed/dependency-graph.json (via StateManager.readRaw/writeRaw)
- */
-export class GoalDependencyGraph {
-    stateManager;
-    llmClient;
-    promptGateway;
-    logger;
-    graph;
-    constructor(stateManager, llmClient, promptGateway, logger) {
-        this.stateManager = stateManager;
-        this.llmClient = llmClient;
-        this.promptGateway = promptGateway;
-        this.logger = logger;
-        this.graph = { nodes: [], edges: [], updated_at: new Date().toISOString() };
-    }
-    /**
-     * Initializes the graph from disk. Must be called after construction when
-     * StateManager async methods are available.
-     */
-    async init() {
-        this.graph = await this.load();
-    }
-    // ─── CRUD ───
-    /**
-     * Adds an edge to the graph.
-     * For prerequisite edges, validates that the addition would not create a cycle.
-     */
-    async addEdge(edge) {
-        if (edge.type === "prerequisite" && this.detectCycle(edge.from_goal_id, edge.to_goal_id)) {
-            throw new ValidationError(`Adding prerequisite ${edge.from_goal_id} → ${edge.to_goal_id} would create a cycle`);
-        }
-        const fullEdge = {
-            ...edge,
-            created_at: new Date().toISOString(),
-        };
-        // Add nodes if not present
-        if (!this.graph.nodes.includes(edge.from_goal_id)) {
-            this.graph.nodes.push(edge.from_goal_id);
-        }
-        if (!this.graph.nodes.includes(edge.to_goal_id)) {
-            this.graph.nodes.push(edge.to_goal_id);
-        }
-        this.graph.edges.push(fullEdge);
-        this.graph.updated_at = new Date().toISOString();
-        await this.save(this.graph);
-        return fullEdge;
-    }
-    /**
-     * Removes an edge matching from/to/type from the graph.
-     */
-    async removeEdge(fromGoalId, toGoalId, type) {
-        this.graph.edges = this.graph.edges.filter((e) => !(e.from_goal_id === fromGoalId &&
-            e.to_goal_id === toGoalId &&
-            e.type === type));
-        this.graph.updated_at = new Date().toISOString();
-        await this.save(this.graph);
-    }
-    /**
-     * Updates the status of an edge identified by from/to.
-     */
-    async updateEdgeStatus(fromGoalId, toGoalId, status) {
-        const edge = this.getEdge(fromGoalId, toGoalId);
-        if (edge) {
-            edge.status = status;
-            this.graph.updated_at = new Date().toISOString();
-            await this.save(this.graph);
-        }
-    }
-    /**
-     * Returns all edges where goalId appears as either from or to.
-     */
-    getEdges(goalId) {
-        return this.graph.edges.filter((e) => e.from_goal_id === goalId || e.to_goal_id === goalId);
-    }
-    /**
-     * Returns the first edge matching from/to (and optionally type), or null.
-     */
-    getEdge(fromGoalId, toGoalId, type) {
-        return (this.graph.edges.find((e) => e.from_goal_id === fromGoalId &&
-            e.to_goal_id === toGoalId &&
-            (!type || e.type === type)) ?? null);
-    }
-    // ─── DAG Validation ───
-    /**
-     * Detects whether adding a prerequisite edge from→to would create a cycle.
-     *
-     * Uses BFS starting from "to" following active prerequisite edges.
-     * If we can reach "from", adding from→to would form a cycle.
-     */
-    detectCycle(fromGoalId, toGoalId) {
-        const visited = new Set();
-        const queue = [toGoalId];
-        const activePrerequisiteAdjacency = new Map();
-        for (const edge of this.graph.edges) {
-            if (edge.type !== "prerequisite" || edge.status !== "active")
-                continue;
-            const outgoing = activePrerequisiteAdjacency.get(edge.from_goal_id);
-            if (outgoing) {
-                outgoing.push(edge.to_goal_id);
-            }
-            else {
-                activePrerequisiteAdjacency.set(edge.from_goal_id, [edge.to_goal_id]);
-            }
-        }
-        for (let index = 0; index < queue.length; index++) {
-            const current = queue[index];
-            if (current === fromGoalId)
-                return true;
-            if (visited.has(current))
-                continue;
-            visited.add(current);
-            const nextGoals = activePrerequisiteAdjacency.get(current);
-            if (!nextGoals)
-                continue;
-            for (const nextGoalId of nextGoals) {
-                if (!visited.has(nextGoalId)) {
-                    queue.push(nextGoalId);
-                }
-            }
-        }
-        return false;
-    }
-    // ─── Scheduling Influence ───
-    /**
-     * Returns active prerequisite edges that must be satisfied before goalId can proceed.
-     */
-    getPrerequisites(goalId) {
-        return this.graph.edges.filter((e) => e.to_goal_id === goalId &&
-            e.type === "prerequisite" &&
-            e.status === "active");
-    }
-    /**
-     * Returns true if goalId has unresolved prerequisites.
-     */
-    isBlocked(goalId) {
-        return this.getPrerequisites(goalId).length > 0;
-    }
-    /**
-     * Returns the IDs of goals that must complete before goalId can proceed.
-     */
-    getBlockingGoals(goalId) {
-        return this.getPrerequisites(goalId).map((e) => e.from_goal_id);
-    }
-    /**
-     * Returns active resource_conflict edges involving goalId.
-     */
-    getResourceConflicts(goalId) {
-        return this.graph.edges.filter((e) => e.type === "resource_conflict" &&
-            e.status === "active" &&
-            (e.from_goal_id === goalId || e.to_goal_id === goalId));
-    }
-    /**
-     * Returns goal IDs that have a synergy relationship with goalId.
-     */
-    getSynergyPartners(goalId) {
-        return this.graph.edges
-            .filter((e) => e.type === "synergy" &&
-            e.status === "active" &&
-            (e.from_goal_id === goalId || e.to_goal_id === goalId))
-            .map((e) => e.from_goal_id === goalId ? e.to_goal_id : e.from_goal_id);
-    }
-    // ─── LLM Auto-detection ───
-    /**
-     * Uses an LLM to automatically detect dependency relationships between a new goal
-     * and a set of existing goals. Detected dependencies are added to the graph.
-     *
-     * Returns an empty array if no LLM client is configured or no existing goals are provided.
-     */
-    async autoDetectDependencies(newGoalId, existingGoalIds) {
-        if ((!this.llmClient && !this.promptGateway) || existingGoalIds.length === 0)
-            return [];
-        const prompt = `Analyze dependencies between a new goal and existing goals.
-
-New goal ID: ${newGoalId}
-Existing goal IDs: ${existingGoalIds.join(", ")}
-
-For each relationship found, return a JSON array of objects with:
-- from_goal_id: string
-- to_goal_id: string
-- type: "prerequisite" | "resource_conflict" | "synergy" | "conflict"
-- condition: string or null (when is this dependency satisfied?)
-- affected_dimensions: string[] (which dimensions are affected)
-- reasoning: string (why this dependency exists)
-- detection_confidence: number 0-1
-
-Return empty array [] if no dependencies found.`;
-        try {
-            let rawData;
-            if (this.promptGateway) {
-                rawData = await this.promptGateway.execute({
-                    purpose: "goal_decomposition",
-                    goalId: newGoalId,
-                    additionalContext: { dependency_prompt: prompt },
-                    responseSchema: AutoDetectResponseSchema,
-                });
-            }
-            else {
-                const messages = [{ role: "user", content: prompt }];
-                const response = await this.llmClient.sendMessage(messages);
-                rawData = JSON.parse(response.content);
-            }
-            const parsed = AutoDetectResponseSchema.safeParse(rawData);
-            if (!parsed.success) {
-                this.logger?.warn?.(`autoDetectDependencies: LLM response failed Zod validation — ${parsed.error.message}`);
-                return [];
-            }
-            const edges = [];
-            for (const item of parsed.data) {
-                try {
-                    const edge = await this.addEdge({
-                        from_goal_id: item.from_goal_id,
-                        to_goal_id: item.to_goal_id,
-                        type: item.type,
-                        status: "active",
-                        condition: item.condition ?? null,
-                        affected_dimensions: item.affected_dimensions ?? [],
-                        mitigation: null,
-                        detection_confidence: item.detection_confidence ?? 0.5,
-                        reasoning: item.reasoning ?? null,
-                    });
-                    edges.push(edge);
-                }
-                catch {
-                    // Skip items that fail addEdge (e.g. duplicate edges)
-                }
-            }
-            return edges;
-        }
-        catch (err) {
-            this.logger?.warn?.(`[GoalDependencyGraph] autoDetectDependencies failed: ${String(err)}`);
-            return [];
-        }
-    }
-    // ─── Strategy Dependencies ───
-    /**
-     * Add a strategy-level dependency between two strategies.
-     * Uses DependencyType "strategy_dependency" for the underlying edge.
-     * The sourceStrategyId is stored in from_goal_id and targetStrategyId in to_goal_id.
-     */
-    async addStrategyDependency(sourceStrategyId, targetStrategyId, dependencyType, goalId) {
-        await this.addEdge({
-            from_goal_id: sourceStrategyId,
-            to_goal_id: targetStrategyId,
-            type: "strategy_dependency",
-            status: "active",
-            condition: null,
-            affected_dimensions: [],
-            mitigation: null,
-            detection_confidence: 1.0,
-            reasoning: `strategy_dependency_type:${dependencyType};goal_id:${goalId}`,
-        });
-    }
-    /**
-     * Get all strategy dependencies for a given strategy.
-     * Returns edges where this strategy is either source or target.
-     */
-    getStrategyDependencies(strategyId) {
-        return this.graph.edges
-            .filter((e) => e.type === "strategy_dependency" &&
-            (e.from_goal_id === strategyId || e.to_goal_id === strategyId))
-            .map((e) => {
-            // Extract dependency_type and goal_id from the reasoning field
-            const reasoning = e.reasoning ?? "";
-            const dtMatch = reasoning.match(/strategy_dependency_type:(prerequisite|enhances)/);
-            const giMatch = reasoning.match(/goal_id:([^;]+)/);
-            return {
-                source_strategy_id: e.from_goal_id,
-                target_strategy_id: e.to_goal_id,
-                dependency_type: (dtMatch?.[1] ?? "prerequisite"),
-                goal_id: giMatch?.[1] ?? "",
-            };
-        });
-    }
-    /**
-     * Check if a strategy is blocked by a prerequisite dependency.
-     * Returns true if the strategy has a prerequisite dependency where
-     * the source strategy is NOT in completedStrategyIds.
-     */
-    isStrategyBlocked(strategyId, completedStrategyIds) {
-        const deps = this.getStrategyDependencies(strategyId);
-        return deps.some((d) => d.dependency_type === "prerequisite" &&
-            d.target_strategy_id === strategyId &&
-            !completedStrategyIds.includes(d.source_strategy_id));
-    }
-    // ─── Persistence ───
-    /**
-     * Loads the dependency graph from disk.
-     * Returns an empty graph if no file exists or parsing fails.
-     */
-    async load() {
-        try {
-            const raw = await this.stateManager.readRaw("dependency-graph.json");
-            if (raw !== null) {
-                return DependencyGraphSchema.parse(raw);
-            }
-        }
-        catch {
-            // ignore parse errors — start fresh
-        }
-        return { nodes: [], edges: [], updated_at: new Date().toISOString() };
-    }
-    /**
-     * Persists the dependency graph to disk.
-     */
-    async save(graph) {
-        await this.stateManager.writeRaw("dependency-graph.json", graph);
-    }
-    /**
-     * Returns the current in-memory graph.
-     */
-    getGraph() {
-        return this.graph;
-    }
-}
-//# sourceMappingURL=goal-dependency-graph.js.map

package/dist/orchestrator/goal/goal-dependency-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"goal-dependency-graph.js","sourceRoot":"","sources":["../../../src/orchestrator/goal/goal-dependency-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAQ7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAQvE,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IACpC,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE;IACxB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;IACtB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE,mBAAmB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAC1E,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC3C,mBAAmB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;IACnD,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC3C,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;CAC1D,CAAC,CAAC;AAEH,MAAM,wBAAwB,GAAG,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,mBAAmB;IACtB,YAAY,CAAe;IAC3B,SAAS,CAAc;IACvB,aAAa,CAAkB;IAC/B,MAAM,CAAoB;IAC1B,KAAK,CAAkB;IAE/B,YAAY,YAA0B,EAAE,SAAsB,EAAE,aAA8B,EAAE,MAAyB;QACvH,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;IAC9E,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,CAAC,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACjC,CAAC;IAED,eAAe;IAEf;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,IAAwC;QACpD,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzF,MAAM,IAAI,eAAe,CACvB,uBAAuB,IAAI,CAAC,YAAY,MAAM,IAAI,CAAC,UAAU,uBAAuB,CACrF,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAmB;YAC/B,GAAG,IAAI;YACP,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;QAEF,2BAA2B;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,UAAkB,EAAE,QAAgB,EAAE,IAAoB;QACzE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CACC,CAAC,CAAC,YAAY,KAAK,UAAU;YAC7B,CAAC,CAAC,UAAU,KAAK,QAAQ;YACzB,CAAC,CAAC,IAAI,KAAK,IAAI,CAChB,CACJ,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,UAAkB,EAClB,QAAgB,EAChB,MAA4B;QAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAChD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACjD,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAc;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAC5D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,OAAO,CACL,UAAkB,EAClB,QAAgB,EAChB,IAAqB;QAErB,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CACnB,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,YAAY,KAAK,UAAU;YAC7B,CAAC,CAAC,UAAU,KAAK,QAAQ;YACzB,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAC7B,IAAI,IAAI,CACV,CAAC;IACJ,CAAC;IAED,yBAAyB;IAEzB;;;;;OAKG;IACH,WAAW,CAAC,UAAkB,EAAE,QAAgB;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,2BAA2B,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEhE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,SAAS;YACvE,MAAM,QAAQ,GAAG,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACpE,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;YAE9B,IAAI,OAAO,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC;YACxC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,SAAS,GAAG,2BAA2B,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS;gBAAE,SAAS;YAEzB,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,+BAA+B;IAE/B;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,UAAU,KAAK,MAAM;YACvB,CAAC,CAAC,IAAI,KAAK,cAAc;YACzB,CAAC,CAAC,MAAM,KAAK,QAAQ,CACxB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,MAAc;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,mBAAmB;YAC9B,CAAC,CAAC,MAAM,KAAK,QAAQ;YACrB,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CACzD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,MAAc;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;aACpB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,SAAS;YACpB,CAAC,CAAC,MAAM,KAAK,QAAQ;YACrB,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CACzD;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACT,CAAC,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAC1D,CAAC;IACN,CAAC;IAED,6BAA6B;IAE7B;;;;;OAKG;IACH,KAAK,CAAC,sBAAsB,CAC1B,SAAiB,EACjB,eAAyB;QAEzB,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExF,MAAM,MAAM,GAAG;;eAEJ,SAAS;qBACH,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;;;;gDAWC,CAAC;QAE7C,IAAI,CAAC;YACH,IAAI,OAAgB,CAAC;YACrB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC;oBACzC,OAAO,EAAE,oBAAoB;oBAC7B,MAAM,EAAE,SAAS;oBACjB,iBAAiB,EAAE,EAAE,iBAAiB,EAAE,MAAM,EAAE;oBAChD,cAAc,EAAE,wBAAwB;iBACzC,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GAAiB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBACnE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAC7D,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;YACD,MAAM,MAAM,GAAG,wBAAwB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CACjB,gEAAgE,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CACvF,CAAC;gBACF,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,KAAK,GAAqB,EAAE,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC/B,IAAI,CAAC;oBACH,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC;wBAC9B,YAAY,EAAE,IAAI,CAAC,YAAY;wBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;wBAC3B,IAAI,EAAE,IAAI,CAAC,IAAsB;wBACjC,MAAM,EAAE,QAAQ;wBAChB,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI;wBACjC,mBAAmB,EAAE,IAAI,CAAC,mBAAmB,IAAI,EAAE;wBACnD,UAAU,EAAE,IAAI;wBAChB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB,IAAI,GAAG;wBACtD,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI;qBAClC,CAAC,CAAC;oBACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAAC,MAAM,CAAC;oBACP,sDAAsD;gBACxD,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,wDAAwD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3F,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,gCAAgC;IAEhC;;;;OAIG;IACH,KAAK,CAAC,qBAAqB,CACzB,gBAAwB,EACxB,gBAAwB,EACxB,cAA2C,EAC3C,MAAc;QAEd,MAAM,IAAI,CAAC,OAAO,CAAC;YACjB,YAAY,EAAE,gBAAgB;YAC9B,UAAU,EAAE,gBAAgB;YAC5B,IAAI,EAAE,qBAAqB;YAC3B,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,IAAI;YACf,mBAAmB,EAAE,EAAE;YACvB,UAAU,EAAE,IAAI;YAChB,oBAAoB,EAAE,GAAG;YACzB,SAAS,EAAE,4BAA4B,cAAc,YAAY,MAAM,EAAE;SAC1E,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,uBAAuB,CAAC,UAAkB;QAMxC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;aACpB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,qBAAqB;YAChC,CAAC,CAAC,CAAC,YAAY,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CACjE;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,+DAA+D;YAC/D,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;YACpF,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;YACnD,OAAO;gBACL,kBAAkB,EAAE,CAAC,CAAC,YAAY;gBAClC,kBAAkB,EAAE,CAAC,CAAC,UAAU;gBAChC,eAAe,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,cAAc,CAAgC;gBAChF,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;aAC5B,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CAAC,UAAkB,EAAE,oBAA8B;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC,IAAI,CACd,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,eAAe,KAAK,cAAc;YACpC,CAAC,CAAC,kBAAkB,KAAK,UAAU;YACnC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC,CACvD,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB;;;OAGG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;YACrE,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,qBAAqB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,oCAAoC;QACtC,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;IACxE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,IAAI,CAAC,KAAsB;QAC/B,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}