conatus 0.1.0

package/dist/goal/state-aggregator.js

@@ -0,0 +1,292 @@
+import { StateError } from "../utils/errors.js";
+import { aggregateValues } from "../drive/satisficing-judge.js";
+import { computeRawGap, normalizeGap } from "../drive/gap-calculator.js";
+/**
+ * StateAggregator handles upward aggregation (children → parent) and
+ * downward propagation (parent → children) of goal state, plus cascade
+ * completion detection.
+ *
+ * Design ref: docs/design/goal-tree.md §5 (state aggregation) and §6 (state propagation).
+ */
+export class StateAggregator {
+    stateManager;
+    satisficingJudge;
+    /**
+     * In-memory registry of StateAggregationRules keyed by parent_id.
+     * Rules are injected via registerAggregationRule().
+     */
+    aggregationRules = new Map();
+    constructor(stateManager, satisficingJudge) {
+        this.stateManager = stateManager;
+        this.satisficingJudge = satisficingJudge;
+    }
+    /**
+     * Register (or replace) a StateAggregationRule for a parent goal.
+     * The rule overrides the default "min" aggregation for that parent.
+     */
+    registerAggregationRule(rule) {
+        this.aggregationRules.set(rule.parent_id, rule);
+    }
+    // ─── Upward Aggregation ───
+    /**
+     * Aggregate the current states of all direct children of parentId into a
+     * single AggregatedState.
+     *
+     * Algorithm (goal-tree.md §5):
+     *   1. Load parent goal to get children_ids.
+     *   2. For each child, compute a normalized gap (average of per-dimension gaps).
+     *   3. Determine aggregation method from registered rule or default "min".
+     *   4. Aggregate child gaps with the chosen method.
+     *   5. Confidence = min(child confidences) — conservative.
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    async aggregateChildStates(parentId) {
+        const parent = await this.stateManager.loadGoal(parentId);
+        if (parent === null) {
+            throw new StateError(`StateAggregator.aggregateChildStates: parent goal "${parentId}" not found`);
+        }
+        const childIds = parent.children_ids;
+        const childGaps = {};
+        const childCompletions = {};
+        const childConfidences = [];
+        for (const childId of childIds) {
+            const child = await this.stateManager.loadGoal(childId);
+            if (child === null) {
+                // Missing child: treat as fully incomplete with low confidence
+                childGaps[childId] = 1.0;
+                childCompletions[childId] = false;
+                childConfidences.push(0);
+                continue;
+            }
+            const gap = computeChildGap(child);
+            childGaps[childId] = gap;
+            childCompletions[childId] = child.status === "completed";
+            const minConf = minChildConfidence(child);
+            childConfidences.push(minConf);
+        }
+        const aggregationMethod = this.resolveAggregationMethod(parentId);
+        let aggregatedGap;
+        if (childIds.length === 0) {
+            aggregatedGap = 0;
+        }
+        else {
+            const gapValues = childIds.map((id) => childGaps[id] ?? 1.0);
+            if (aggregationMethod === "all_required") {
+                // all_required: parent is blocked as long as any child is incomplete
+                // Express as minimum fulfillment ratio (1 - gap)
+                const fulfillmentRatios = gapValues.map((g) => 1 - g);
+                const minFulfillment = aggregateValues(fulfillmentRatios, "all_required");
+                aggregatedGap = 1 - minFulfillment;
+            }
+            else {
+                aggregatedGap = aggregateValues(gapValues, aggregationMethod);
+            }
+        }
+        const aggregatedConfidence = childConfidences.length > 0 ? Math.min(...childConfidences) : 1.0;
+        return {
+            parent_id: parentId,
+            aggregated_gap: Math.min(1, Math.max(0, aggregatedGap)),
+            aggregated_confidence: aggregatedConfidence,
+            child_gaps: childGaps,
+            child_completions: childCompletions,
+            aggregation_method: aggregationMethod,
+            timestamp: new Date().toISOString(),
+        };
+    }
+    // ─── Downward Propagation ───
+    /**
+     * Propagate parent-level state changes down to all direct children.
+     *
+     * Two propagation types (goal-tree.md §5):
+     *   a. Constraint propagation: new parent constraints are appended to children
+     *      that don't already have them (idempotent).
+     *   b. Deadline propagation: if the parent deadline differs from the children's
+     *      proportional position, adjust each child's deadline proportionally.
+     *
+     * Note: this method reads the parent goal's CURRENT deadline; to propagate a
+     * deadline change the caller must first save the updated parent, then call
+     * propagateStateDown().
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    async propagateStateDown(parentId) {
+        const parent = await this.stateManager.loadGoal(parentId);
+        if (parent === null) {
+            throw new StateError(`StateAggregator.propagateStateDown: parent goal "${parentId}" not found`);
+        }
+        const parentDeadlineMs = parseDeadlineMs(parent.deadline);
+        const now = Date.now();
+        for (const childId of parent.children_ids) {
+            const child = await this.stateManager.loadGoal(childId);
+            if (child === null)
+                continue;
+            let updated = { ...child };
+            // ─── a. Constraint propagation ───
+            const existingConstraints = new Set(child.constraints);
+            const newConstraints = parent.constraints.filter((c) => !existingConstraints.has(c));
+            if (newConstraints.length > 0) {
+                updated = {
+                    ...updated,
+                    constraints: [...child.constraints, ...newConstraints],
+                };
+            }
+            // ─── b. Deadline propagation ───
+            if (parentDeadlineMs !== null) {
+                const childDeadlineMs = parseDeadlineMs(child.deadline);
+                if (childDeadlineMs !== null) {
+                    // Proportional adjustment:
+                    //   remaining_parent = parentDeadline - now
+                    //   remaining_child  = childDeadline - now
+                    //   ratio = remaining_parent / original_remaining_parent
+                    // Since we don't store the "original" parent deadline, we derive
+                    // the ratio from how much of the parent's window is left relative
+                    // to the child's remaining window.  The simplest safe approach
+                    // (matching goal-tree.md §5) is:
+                    //   new_child_deadline = now + (childRemainingMs / parentRemainingMs) * parentRemainingMs
+                    // which simplifies to: keep child proportional within parent's window.
+                    //
+                    // Concretely: child gets the same ratio of parent's deadline window
+                    // as the child's remaining time relative to the parent.
+                    const parentRemainingMs = parentDeadlineMs - now;
+                    const childRemainingMs = childDeadlineMs - now;
+                    if (parentRemainingMs > 0 && childRemainingMs !== parentRemainingMs) {
+                        // New child deadline = now + min(childRemainingMs, parentRemainingMs)
+                        // so the child is never later than the parent.
+                        const newChildRemainingMs = Math.min(childRemainingMs, parentRemainingMs);
+                        const newChildDeadlineMs = now + newChildRemainingMs;
+                        updated = {
+                            ...updated,
+                            deadline: new Date(newChildDeadlineMs).toISOString(),
+                        };
+                    }
+                }
+            }
+            if (updated.constraints !== child.constraints ||
+                updated.deadline !== child.deadline) {
+                await this.stateManager.saveGoal({
+                    ...updated,
+                    updated_at: new Date().toISOString(),
+                });
+            }
+        }
+    }
+    // ─── Completion Cascade ───
+    /**
+     * Walk up the tree from goalId and return IDs of ancestors that have
+     * become eligible for completion because ALL of their children are either
+     * "completed" or cancelled (treated as pruned-and-done).
+     *
+     * The starting goalId is treated as if it were already completed — this
+     * allows callers to invoke checkCompletionCascade immediately after deciding
+     * to complete a goal, before the status has been persisted.
+     *
+     * This method does NOT mutate any goal status — the caller decides what to
+     * do with the returned list (e.g. mark them "completed").
+     *
+     * @param goalId Starting point (usually the goal that just completed).
+     * @returns Ordered array of newly-completable ancestor IDs (bottom-up order).
+     */
+    async checkCompletionCascade(goalId) {
+        const completable = [];
+        // Track which goals are effectively complete for the purpose of this walk.
+        // The starting goal is treated as complete even if its DB status is "active".
+        const effectivelyComplete = new Set([goalId]);
+        let currentId = goalId;
+        // Walk up the parent chain
+        while (currentId !== null) {
+            const current = await this.stateManager.loadGoal(currentId);
+            if (current === null)
+                break;
+            const parentId = current.parent_id;
+            if (parentId === null)
+                break; // reached root — stop (root itself has no parent to cascade to)
+            const parent = await this.stateManager.loadGoal(parentId);
+            if (parent === null)
+                break;
+            // Check whether ALL children of the parent are done
+            let allChildrenDone = true;
+            for (const childId of parent.children_ids) {
+                if (effectivelyComplete.has(childId))
+                    continue; // treated as complete
+                const child = await this.stateManager.loadGoal(childId);
+                if (child === null) {
+                    allChildrenDone = false;
+                    break;
+                }
+                if (child.status === "completed" || child.status === "cancelled")
+                    continue;
+                allChildrenDone = false;
+                break;
+            }
+            if (!allChildrenDone)
+                break; // stop cascade — parent still blocked
+            completable.push(parentId);
+            // Mark parent as effectively complete so its own parent sees it as done
+            effectivelyComplete.add(parentId);
+            currentId = parentId;
+        }
+        return completable;
+    }
+    // ─── Helpers ───
+    resolveAggregationMethod(parentId) {
+        const rule = this.aggregationRules.get(parentId);
+        return rule?.aggregation ?? "min";
+    }
+}
+// ─── Module-level pure helpers ───
+/**
+ * Compute a normalized gap in [0, 1] for a goal by averaging the normalized
+ * gap of each of its dimensions.
+ *
+ * Per-dimension formula (simplified, matches task spec):
+ *   min threshold: max(0, (target - current) / target)  [guard: target=0 → 0 or 1]
+ *   max threshold: max(0, (current - target) / target)  [guard: target=0 → 0 or 1]
+ *   default:       |current - target| / max(|target|, 1)
+ *
+ * When current_value is null, the dimension gap is 1 (fully unmet).
+ * When there are no dimensions, gap = 0 (consider it done).
+ */
+function computeChildGap(goal) {
+    if (goal.dimensions.length === 0)
+        return 0;
+    // If the goal is already completed/cancelled, gap = 0
+    if (goal.status === "completed" || goal.status === "cancelled")
+        return 0;
+    const dimGaps = goal.dimensions.map((dim) => computeDimensionGapSimple(dim));
+    const sum = dimGaps.reduce((acc, g) => acc + g, 0);
+    return Math.min(1, Math.max(0, sum / dimGaps.length));
+}
+/**
+ * Compute a simple normalized gap [0,1] for a single dimension.
+ * Uses the formulas from the task spec rather than the full
+ * confidence-weighted pipeline (which is used by GapCalculator for drive scoring).
+ */
+function computeDimensionGapSimple(dim) {
+    const { current_value, threshold } = dim;
+    if (current_value === null)
+        return 1;
+    const rawGap = computeRawGap(current_value, threshold);
+    const normalizedGap = normalizeGap(rawGap, threshold, current_value);
+    return Math.min(1, Math.max(0, normalizedGap));
+}
+/**
+ * Compute the minimum confidence across all dimensions of a goal.
+ * Returns 1.0 when there are no dimensions (nothing uncertain).
+ */
+function minChildConfidence(goal) {
+    if (goal.dimensions.length === 0)
+        return 1.0;
+    return Math.min(...goal.dimensions.map((d) => d.confidence));
+}
+/**
+ * Parse an ISO 8601 deadline string into milliseconds since epoch.
+ * Returns null if the deadline is null or unparseable.
+ */
+function parseDeadlineMs(deadline) {
+    if (deadline === null)
+        return null;
+    const ms = Date.parse(deadline);
+    return isNaN(ms) ? null : ms;
+}
+//# sourceMappingURL=state-aggregator.js.map

package/dist/goal/state-aggregator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-aggregator.js","sourceRoot":"","sources":["../../src/goal/state-aggregator.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAoB,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAClF,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAqBzE;;;;;;GAMG;AACH,MAAM,OAAO,eAAe;IACT,YAAY,CAAe;IAC3B,gBAAgB,CAAmB;IAEpD;;;OAGG;IACc,gBAAgB,GAC/B,IAAI,GAAG,EAAE,CAAC;IAEZ,YAAY,YAA0B,EAAE,gBAAkC;QACxE,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,uBAAuB,CAAC,IAA0B;QAChD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAClD,CAAC;IAED,6BAA6B;IAE7B;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAgB;QACzC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAClB,sDAAsD,QAAQ,aAAa,CAC5E,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC;QACrC,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,MAAM,gBAAgB,GAA4B,EAAE,CAAC;QACrD,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACxD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,+DAA+D;gBAC/D,SAAS,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;gBACzB,gBAAgB,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;gBAClC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YACnC,SAAS,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;YACzB,gBAAgB,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC;YAEzD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAC1C,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QAElE,IAAI,aAAqB,CAAC;QAC1B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,aAAa,GAAG,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;YAE7D,IAAI,iBAAiB,KAAK,cAAc,EAAE,CAAC;gBACzC,qEAAqE;gBACrE,iDAAiD;gBACjD,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtD,MAAM,cAAc,GAAG,eAAe,CACpC,iBAAiB,EACjB,cAAc,CACf,CAAC;gBACF,aAAa,GAAG,CAAC,GAAG,cAAc,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,aAAa,GAAG,eAAe,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,MAAM,oBAAoB,GACxB,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAEpE,OAAO;YACL,SAAS,EAAE,QAAQ;YACnB,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;YACvD,qBAAqB,EAAE,oBAAoB;YAC3C,UAAU,EAAE,SAAS;YACrB,iBAAiB,EAAE,gBAAgB;YACnC,kBAAkB,EAAE,iBAAiB;YACrC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;IACJ,CAAC;IAED,+BAA+B;IAE/B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,kBAAkB,CAAC,QAAgB;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAClB,oDAAoD,QAAQ,aAAa,CAC1E,CAAC;QACJ,CAAC;QAED,MAAM,gBAAgB,GAAG,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACxD,IAAI,KAAK,KAAK,IAAI;gBAAE,SAAS;YAE7B,IAAI,OAAO,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;YAE3B,oCAAoC;YACpC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CACnC,CAAC;YACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,OAAO,GAAG;oBACR,GAAG,OAAO;oBACV,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,cAAc,CAAC;iBACvD,CAAC;YACJ,CAAC;YAED,kCAAkC;YAClC,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;gBAC9B,MAAM,eAAe,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAExD,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;oBAC7B,2BAA2B;oBAC3B,4CAA4C;oBAC5C,2CAA2C;oBAC3C,yDAAyD;oBACzD,iEAAiE;oBACjE,kEAAkE;oBAClE,+DAA+D;oBAC/D,iCAAiC;oBACjC,0FAA0F;oBAC1F,uEAAuE;oBACvE,EAAE;oBACF,oEAAoE;oBACpE,wDAAwD;oBACxD,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC;oBACjD,MAAM,gBAAgB,GAAG,eAAe,GAAG,GAAG,CAAC;oBAE/C,IAAI,iBAAiB,GAAG,CAAC,IAAI,gBAAgB,KAAK,iBAAiB,EAAE,CAAC;wBACpE,sEAAsE;wBACtE,+CAA+C;wBAC/C,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAClC,gBAAgB,EAChB,iBAAiB,CAClB,CAAC;wBACF,MAAM,kBAAkB,GAAG,GAAG,GAAG,mBAAmB,CAAC;wBACrD,OAAO,GAAG;4BACR,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,WAAW,EAAE;yBACrD,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IACE,OAAO,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW;gBACzC,OAAO,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,EACnC,CAAC;gBACD,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;oBAC/B,GAAG,OAAO;oBACV,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACrC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,6BAA6B;IAE7B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,sBAAsB,CAAC,MAAc;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,2EAA2E;QAC3E,8EAA8E;QAC9E,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAEtD,IAAI,SAAS,GAAkB,MAAM,CAAC;QAEtC,2BAA2B;QAC3B,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC5D,IAAI,OAAO,KAAK,IAAI;gBAAE,MAAM;YAE5B,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC;YACnC,IAAI,QAAQ,KAAK,IAAI;gBAAE,MAAM,CAAC,gEAAgE;YAE9F,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM;YAE3B,oDAAoD;YACpD,IAAI,eAAe,GAAG,IAAI,CAAC;YAC3B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBAC1C,IAAI,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS,CAAC,sBAAsB;gBACtE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBACxD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBAAC,eAAe,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBACvD,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW;oBAAE,SAAS;gBAC3E,eAAe,GAAG,KAAK,CAAC;gBACxB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,eAAe;gBAAE,MAAM,CAAC,sCAAsC;YAEnE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3B,wEAAwE;YACxE,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClC,SAAS,GAAG,QAAQ,CAAC;QACvB,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,kBAAkB;IAEV,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,OAAO,IAAI,EAAE,WAAW,IAAI,KAAK,CAAC;IACpC,CAAC;CACF;AAED,oCAAoC;AAEpC;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,IAAU;IACjC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,sDAAsD;IACtD,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IAEzE,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7E,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;GAIG;AACH,SAAS,yBAAyB,CAAC,GAAc;IAC/C,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAEzC,IAAI,aAAa,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAErC,MAAM,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACrE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAU;IACpC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,QAAuB;IAC9C,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/B,CAAC"}

package/dist/goal/tree-loop-orchestrator.d.ts

@@ -0,0 +1,79 @@
+import type { StateManager } from "../state-manager.js";
+import type { GoalTreeManager } from "./goal-tree-manager.js";
+import type { StateAggregator } from "./state-aggregator.js";
+import type { SatisficingJudge } from "../drive/satisficing-judge.js";
+import type { GoalDecompositionConfig } from "../types/goal-tree.js";
+/**
+ * TreeLoopOrchestrator manages the execution of independent loops across
+ * all nodes in a goal tree.
+ *
+ * Responsibilities:
+ *   - Selecting the next node to execute (leaf-first priority)
+ *   - Enforcing parallel_loop_limit for concurrent execution
+ *   - Tracking loop_status transitions (idle → running → idle/paused)
+ *   - Triggering state aggregation on node completion
+ *   - Detecting and cascading completion up the tree
+ *
+ * Design ref: docs/design/goal-tree.md §14C
+ */
+export declare class TreeLoopOrchestrator {
+    private readonly stateManager;
+    private readonly goalTreeManager;
+    private readonly stateAggregator;
+    private readonly satisficingJudge;
+    /**
+     * GoalDecompositionConfig used to control parallel execution limits.
+     * Updated by startTreeExecution(); defaults applied until first call.
+     */
+    private config;
+    constructor(stateManager: StateManager, goalTreeManager: GoalTreeManager, stateAggregator: StateAggregator, satisficingJudge: SatisficingJudge);
+    /**
+     * Initialize tree execution.
+     * Saves the config and optionally resets all node loop_status to "idle".
+     * The actual per-node loops are driven by CoreLoop calling selectNextNode()
+     * in a tree-mode iteration.
+     */
+    startTreeExecution(rootId: string, config: GoalDecompositionConfig): Promise<void>;
+    /**
+     * Select the next node to execute from the tree rooted at rootId.
+     *
+     * Algorithm (MVP: leaf-first):
+     *   1. Get tree state — if active_loops.length >= parallel_loop_limit, return null.
+     *   2. Collect all goal IDs in the tree (root + descendants).
+     *   3. Filter to active + idle nodes (not running, not paused).
+     *   4. Prefer leaf nodes (node_type === "leaf") over non-leaf nodes.
+     *   5. Return the first candidate's ID and set its loop_status to "running".
+     *
+     * Returns null when:
+     *   - parallel_loop_limit is already reached
+     *   - No eligible (active + idle) nodes remain
+     */
+    selectNextNode(rootId: string): Promise<string | null>;
+    /**
+     * Pause the loop for a specific node.
+     * Sets loop_status to "paused".
+     * No-op if the goal is not found.
+     */
+    pauseNodeLoop(goalId: string): Promise<void>;
+    /**
+     * Resume the loop for a specific node.
+     * Sets loop_status to "running".
+     * No-op if the goal is not found.
+     */
+    resumeNodeLoop(goalId: string): Promise<void>;
+    /**
+     * Called when a node's execution cycle completes.
+     *
+     * Actions:
+     *   1. Reset loop_status to "idle" (release the execution slot).
+     *   2. Aggregate state bottom-up to the root.
+     *   3. Run completion cascade to auto-complete ancestor nodes whose
+     *      children are all done.
+     */
+    onNodeCompleted(goalId: string): Promise<void>;
+    /**
+     * Collect all descendant IDs (not including rootId itself).
+     */
+    private _collectAllDescendantIds;
+}
+//# sourceMappingURL=tree-loop-orchestrator.d.ts.map

package/dist/goal/tree-loop-orchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-loop-orchestrator.d.ts","sourceRoot":"","sources":["../../src/goal/tree-loop-orchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,+BAA+B,CAAC;AACtE,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAGrE;;;;;;;;;;;;GAYG;AACH,qBAAa,oBAAoB;IAa7B,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,eAAe;IAChC,OAAO,CAAC,QAAQ,CAAC,eAAe;IAChC,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAfnC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAKZ;gBAGiB,YAAY,EAAE,YAAY,EAC1B,eAAe,EAAE,eAAe,EAChC,eAAe,EAAE,eAAe,EAChC,gBAAgB,EAAE,gBAAgB;IAKrD;;;;;OAKG;IACG,kBAAkB,CACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,uBAAuB,GAC9B,OAAO,CAAC,IAAI,CAAC;IAwBhB;;;;;;;;;;;;;OAaG;IACG,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAkE5D;;;;OAIG;IACG,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWlD;;;;OAIG;IACG,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAanD;;;;;;;;OAQG;IACG,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IA0CpD;;OAEG;YACW,wBAAwB;CAUvC"}

package/dist/goal/tree-loop-orchestrator.js

@@ -0,0 +1,230 @@
+/**
+ * TreeLoopOrchestrator manages the execution of independent loops across
+ * all nodes in a goal tree.
+ *
+ * Responsibilities:
+ *   - Selecting the next node to execute (leaf-first priority)
+ *   - Enforcing parallel_loop_limit for concurrent execution
+ *   - Tracking loop_status transitions (idle → running → idle/paused)
+ *   - Triggering state aggregation on node completion
+ *   - Detecting and cascading completion up the tree
+ *
+ * Design ref: docs/design/goal-tree.md §14C
+ */
+export class TreeLoopOrchestrator {
+    stateManager;
+    goalTreeManager;
+    stateAggregator;
+    satisficingJudge;
+    /**
+     * GoalDecompositionConfig used to control parallel execution limits.
+     * Updated by startTreeExecution(); defaults applied until first call.
+     */
+    config = {
+        max_depth: 5,
+        min_specificity: 0.7,
+        auto_prune_threshold: 0.3,
+        parallel_loop_limit: 3,
+    };
+    constructor(stateManager, goalTreeManager, stateAggregator, satisficingJudge) {
+        this.stateManager = stateManager;
+        this.goalTreeManager = goalTreeManager;
+        this.stateAggregator = stateAggregator;
+        this.satisficingJudge = satisficingJudge;
+    }
+    // ─── Tree Execution Initialization ───
+    /**
+     * Initialize tree execution.
+     * Saves the config and optionally resets all node loop_status to "idle".
+     * The actual per-node loops are driven by CoreLoop calling selectNextNode()
+     * in a tree-mode iteration.
+     */
+    async startTreeExecution(rootId, config) {
+        this.config = config;
+        // Reset all nodes in the tree to loop_status: "idle" to ensure clean state
+        const root = await this.stateManager.loadGoal(rootId);
+        if (!root)
+            return;
+        const now = new Date().toISOString();
+        const allIds = [rootId, ...await this._collectAllDescendantIds(rootId)];
+        for (const id of allIds) {
+            const goal = await this.stateManager.loadGoal(id);
+            if (goal && goal.loop_status !== "idle") {
+                await this.stateManager.saveGoal({
+                    ...goal,
+                    loop_status: "idle",
+                    updated_at: now,
+                });
+            }
+        }
+    }
+    // ─── Node Selection ───
+    /**
+     * Select the next node to execute from the tree rooted at rootId.
+     *
+     * Algorithm (MVP: leaf-first):
+     *   1. Get tree state — if active_loops.length >= parallel_loop_limit, return null.
+     *   2. Collect all goal IDs in the tree (root + descendants).
+     *   3. Filter to active + idle nodes (not running, not paused).
+     *   4. Prefer leaf nodes (node_type === "leaf") over non-leaf nodes.
+     *   5. Return the first candidate's ID and set its loop_status to "running".
+     *
+     * Returns null when:
+     *   - parallel_loop_limit is already reached
+     *   - No eligible (active + idle) nodes remain
+     */
+    async selectNextNode(rootId) {
+        // Step 1: Check parallel limit
+        const treeState = await this.goalTreeManager.getTreeState(rootId);
+        if (treeState.active_loops.length >= this.config.parallel_loop_limit) {
+            return null;
+        }
+        // Step 2: Collect all IDs (root + all descendants)
+        const allIds = [rootId, ...await this._collectAllDescendantIds(rootId)];
+        // Step 3 & 4: Filter eligible nodes — active + idle, leaf first
+        const eligibleLeaves = [];
+        const eligibleNonLeaves = [];
+        for (const id of allIds) {
+            const goal = await this.stateManager.loadGoal(id);
+            if (!goal)
+                continue;
+            if (goal.status !== "active")
+                continue;
+            if (goal.loop_status === "running" || goal.loop_status === "paused")
+                continue;
+            if (goal.node_type === "leaf") {
+                eligibleLeaves.push(id);
+            }
+            else {
+                eligibleNonLeaves.push(id);
+            }
+        }
+        // Step 5: Pick best candidate (leaf-first, then non-leaf)
+        let selectedId = null;
+        if (eligibleLeaves.length > 0) {
+            // Among leaves, prefer deeper ones (higher decomposition_depth)
+            // Note: sorting is done synchronously using already-loaded data from above pass
+            // We re-use the loaded goals by building a depth map first
+            const depthMap = new Map();
+            for (const id of eligibleLeaves) {
+                const g = await this.stateManager.loadGoal(id);
+                depthMap.set(id, g?.decomposition_depth ?? 0);
+            }
+            eligibleLeaves.sort((a, b) => {
+                const depthA = depthMap.get(a) ?? 0;
+                const depthB = depthMap.get(b) ?? 0;
+                return depthB - depthA; // descending: deeper first
+            });
+            selectedId = eligibleLeaves[0] ?? null;
+        }
+        else if (eligibleNonLeaves.length > 0) {
+            selectedId = eligibleNonLeaves[0] ?? null;
+        }
+        if (selectedId === null)
+            return null;
+        // Mark selected node as running
+        const selected = await this.stateManager.loadGoal(selectedId);
+        if (selected) {
+            await this.stateManager.saveGoal({
+                ...selected,
+                loop_status: "running",
+                updated_at: new Date().toISOString(),
+            });
+        }
+        return selectedId;
+    }
+    // ─── Node Loop Control ───
+    /**
+     * Pause the loop for a specific node.
+     * Sets loop_status to "paused".
+     * No-op if the goal is not found.
+     */
+    async pauseNodeLoop(goalId) {
+        const goal = await this.stateManager.loadGoal(goalId);
+        if (!goal)
+            return;
+        await this.stateManager.saveGoal({
+            ...goal,
+            loop_status: "paused",
+            updated_at: new Date().toISOString(),
+        });
+    }
+    /**
+     * Resume the loop for a specific node.
+     * Sets loop_status to "running".
+     * No-op if the goal is not found.
+     */
+    async resumeNodeLoop(goalId) {
+        const goal = await this.stateManager.loadGoal(goalId);
+        if (!goal)
+            return;
+        await this.stateManager.saveGoal({
+            ...goal,
+            loop_status: "running",
+            updated_at: new Date().toISOString(),
+        });
+    }
+    // ─── Node Completion Callback ───
+    /**
+     * Called when a node's execution cycle completes.
+     *
+     * Actions:
+     *   1. Reset loop_status to "idle" (release the execution slot).
+     *   2. Aggregate state bottom-up to the root.
+     *   3. Run completion cascade to auto-complete ancestor nodes whose
+     *      children are all done.
+     */
+    async onNodeCompleted(goalId) {
+        const now = new Date().toISOString();
+        // Step 1: Reset loop_status to "idle"
+        const goal = await this.stateManager.loadGoal(goalId);
+        if (goal) {
+            await this.stateManager.saveGoal({
+                ...goal,
+                loop_status: "idle",
+                updated_at: now,
+            });
+        }
+        // Step 2: Aggregate parent chain bottom-up
+        let parentId = goal?.parent_id ?? null;
+        while (parentId !== null) {
+            try {
+                await this.stateAggregator.aggregateChildStates(parentId);
+            }
+            catch {
+                // Non-fatal: parent may be missing or have no children
+                break;
+            }
+            const parent = await this.stateManager.loadGoal(parentId);
+            parentId = parent?.parent_id ?? null;
+        }
+        // Step 3: Completion cascade
+        const cascadeIds = await this.stateAggregator.checkCompletionCascade(goalId);
+        for (const ancestorId of cascadeIds) {
+            const ancestor = await this.stateManager.loadGoal(ancestorId);
+            if (ancestor && ancestor.status !== "completed") {
+                await this.stateManager.saveGoal({
+                    ...ancestor,
+                    status: "completed",
+                    updated_at: now,
+                });
+            }
+        }
+    }
+    // ─── Private Helpers ───
+    /**
+     * Collect all descendant IDs (not including rootId itself).
+     */
+    async _collectAllDescendantIds(goalId) {
+        const goal = await this.stateManager.loadGoal(goalId);
+        if (!goal)
+            return [];
+        const result = [];
+        for (const childId of goal.children_ids) {
+            result.push(childId);
+            result.push(...await this._collectAllDescendantIds(childId));
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=tree-loop-orchestrator.js.map

package/dist/goal/tree-loop-orchestrator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-loop-orchestrator.js","sourceRoot":"","sources":["../../src/goal/tree-loop-orchestrator.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,oBAAoB;IAaZ;IACA;IACA;IACA;IAfnB;;;OAGG;IACK,MAAM,GAA4B;QACxC,SAAS,EAAE,CAAC;QACZ,eAAe,EAAE,GAAG;QACpB,oBAAoB,EAAE,GAAG;QACzB,mBAAmB,EAAE,CAAC;KACvB,CAAC;IAEF,YACmB,YAA0B,EAC1B,eAAgC,EAChC,eAAgC,EAChC,gBAAkC;QAHlC,iBAAY,GAAZ,YAAY,CAAc;QAC1B,oBAAe,GAAf,eAAe,CAAiB;QAChC,oBAAe,GAAf,eAAe,CAAiB;QAChC,qBAAgB,GAAhB,gBAAgB,CAAkB;IAClD,CAAC;IAEJ,wCAAwC;IAExC;;;;;OAKG;IACH,KAAK,CAAC,kBAAkB,CACtB,MAAc,EACd,MAA+B;QAE/B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,2EAA2E;QAC3E,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,CAAC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC;QAExE,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,KAAK,MAAM,EAAE,CAAC;gBACxC,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;oBAC/B,GAAG,IAAI;oBACP,WAAW,EAAE,MAAM;oBACnB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,yBAAyB;IAEzB;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,cAAc,CAAC,MAAc;QACjC,+BAA+B;QAC/B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAClE,IAAI,SAAS,CAAC,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;YACrE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,mDAAmD;QACnD,MAAM,MAAM,GAAG,CAAC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC;QAExE,gEAAgE;QAChE,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,MAAM,iBAAiB,GAAa,EAAE,CAAC;QAEvC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,SAAS;YACvC,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,KAAK,QAAQ;gBAAE,SAAS;YAE9E,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;gBAC9B,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,0DAA0D;QAC1D,IAAI,UAAU,GAAkB,IAAI,CAAC;QAErC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,gEAAgE;YAChE,gFAAgF;YAChF,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC3C,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;gBAChC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,mBAAmB,IAAI,CAAC,CAAC,CAAC;YAChD,CAAC;YACD,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACpC,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC,2BAA2B;YACrD,CAAC,CAAC,CAAC;YACH,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACzC,CAAC;aAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QAC5C,CAAC;QAED,IAAI,UAAU,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAErC,gCAAgC;QAChC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC9D,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;gBAC/B,GAAG,QAAQ;gBACX,WAAW,EAAE,SAAS;gBACtB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,4BAA4B;IAE5B;;;;OAIG;IACH,KAAK,CAAC,aAAa,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;YAC/B,GAAG,IAAI;YACP,WAAW,EAAE,QAAQ;YACrB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAAC,MAAc;QACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;YAC/B,GAAG,IAAI;YACP,WAAW,EAAE,SAAS;YACtB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;IACL,CAAC;IAED,mCAAmC;IAEnC;;;;;;;;OAQG;IACH,KAAK,CAAC,eAAe,CAAC,MAAc;QAClC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,sCAAsC;QACtC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;gBAC/B,GAAG,IAAI;gBACP,WAAW,EAAE,MAAM;gBACnB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,IAAI,QAAQ,GAAG,IAAI,EAAE,SAAS,IAAI,IAAI,CAAC;QACvC,OAAO,QAAQ,KAAK,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,IAAI,CAAC,eAAe,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;YAC5D,CAAC;YAAC,MAAM,CAAC;gBACP,uDAAuD;gBACvD,MAAM;YACR,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC1D,QAAQ,GAAG,MAAM,EAAE,SAAS,IAAI,IAAI,CAAC;QACvC,CAAC;QAED,6BAA6B;QAC7B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;QAC7E,KAAK,MAAM,UAAU,IAAI,UAAU,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAC9D,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAChD,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;oBAC/B,GAAG,QAAQ;oBACX,MAAM,EAAE,WAAW;oBACnB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,0BAA0B;IAE1B;;OAEG;IACK,KAAK,CAAC,wBAAwB,CAAC,MAAc;QACnD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QACrB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}