pulseed 0.1.4 → 0.1.5

package/dist/gap-calculator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gap-calculator.d.ts","sourceRoot":"","sources":["../src/gap-calculator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAyB,WAAW,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEpF;;;;;;;;;;GAUG;AAIH;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAC3B,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,EAC9C,SAAS,EAAE,SAAS,GACnB,MAAM,CA8CR;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,SAAS,EACpB,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAC7C,MAAM,CA8BR;AAID;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,EAClB,iBAAiB,EAAE,MAAM,EACzB,kBAAkB,EAAE,OAAO,GAC1B,MAAM,CAMR;AAID,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;IAChD,SAAS,EAAE,SAAS,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,gDAAgD;IAChD,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,iBAAiB,EACxB,uBAAuB,GAAE,MAAY,GACpC,WAAW,CAsBb;AAID;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,SAAS,EAAE,EACvB,uBAAuB,GAAE,MAAY,GACpC,SAAS,CAmBX;AAID;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EAAE,EACnB,MAAM,GAAE,KAAK,GAAG,cAAc,GAAG,KAAa,EAC9C,OAAO,CAAC,EAAE,MAAM,EAAE,GACjB,MAAM,CAmBR"}

package/dist/gap-calculator.js

@@ -1,218 +0,0 @@
-/**
- * GapCalculator implements the gap calculation pipeline defined in gap-calculation.md:
- *   raw_gap -> normalized_gap -> normalized_weighted_gap
- *
- * All functions are pure (no side effects).
- *
- * Key design constraints:
- * - Confidence adjustment applies ONLY at the normalized_weighted_gap stage (section 3).
- * - null current_value => maximum gap, no confidence weighting applied.
- * - Zero-division guards: if denominator is 0, normalized_gap = 1.0 (if raw_gap > 0) or 0.0.
- */
-// ─── Step 1: Raw Gap Calculation ───
-/**
- * Compute raw gap for a single dimension based on its threshold type.
- *
- * Formulas from gap-calculation.md section 1:
- *   min(N):        max(0, threshold - current)
- *   max(N):        max(0, current - threshold)
- *   range(lo, hi): max(0, lo - current) + max(0, current - hi)
- *   present:       0 if truthy, 1 if falsy
- *   match(value):  0 if current == value, 1 otherwise
- *
- * Guard: current_value = null => maximum gap
- *   numeric types: threshold value (representing full undershoot)
- *   binary types:  1
- */
-export function computeRawGap(currentValue, threshold) {
-    // Guard: null current_value
-    if (currentValue === null) {
-        switch (threshold.type) {
-            case "min":
-                return threshold.value; // full gap = threshold itself
-            case "max":
-                // null current_value on a max threshold: unknown exceedance.
-                // Formula for max is `current - threshold`; with null current we
-                // return a positive sentinel so normalizeGap's null guard (→ 1.0)
-                // takes over. Use max(threshold.value, 1) to stay positive when
-                // threshold.value = 0.
-                return threshold.value > 0 ? threshold.value : 1;
-            case "range":
-                return threshold.high - threshold.low; // full range span
-            case "present":
-                return 1;
-            case "match":
-                return 1;
-        }
-    }
-    switch (threshold.type) {
-        case "min": {
-            const current = toNumber(currentValue);
-            return Math.max(0, threshold.value - current);
-        }
-        case "max": {
-            const current = toNumber(currentValue);
-            return Math.max(0, current - threshold.value);
-        }
-        case "range": {
-            const current = toNumber(currentValue);
-            return (Math.max(0, threshold.low - current) +
-                Math.max(0, current - threshold.high));
-        }
-        case "present": {
-            return isTruthy(currentValue) ? 0 : 1;
-        }
-        case "match": {
-            // Strict equality comparison for match type
-            return currentValue === threshold.value ? 0 : 1;
-        }
-    }
-}
-// ─── Step 2: Normalization ───
-/**
- * Normalize raw gap to [0, 1] range.
- *
- * Formulas from gap-calculation.md section 2:
- *   min(N):        raw_gap / threshold (guard: if threshold=0 and raw_gap>0 -> 1.0)
- *   max(N):        raw_gap / threshold (guard: if threshold=0 -> cap at 1.0)
- *   range(lo, hi): min(1.0, raw_gap / ((high - low) / 2))
- *   present:       raw_gap (already 0 or 1)
- *   match:         raw_gap (already 0 or 1)
- *
- * null current_value => normalized_gap = 1.0
- */
-export function normalizeGap(rawGap, threshold, currentValue) {
-    // Guard: null current_value => maximum gap
-    if (currentValue === null) {
-        return 1.0;
-    }
-    switch (threshold.type) {
-        case "min": {
-            if (threshold.value === 0) {
-                return rawGap > 0 ? 1.0 : 0.0;
-            }
-            return rawGap / threshold.value;
-        }
-        case "max": {
-            if (threshold.value === 0) {
-                return Math.min(rawGap, 1.0);
-            }
-            return rawGap / threshold.value;
-        }
-        case "range": {
-            const halfWidth = (threshold.high - threshold.low) / 2;
-            if (halfWidth === 0) {
-                return rawGap > 0 ? 1.0 : 0.0;
-            }
-            return Math.min(1.0, rawGap / halfWidth);
-        }
-        case "present":
-        case "match":
-            return rawGap; // already 0 or 1
-    }
-}
-// ─── Step 3: Confidence-Weighted Gap ───
-/**
- * Apply confidence weighting to the normalized gap.
- *
- * Formula from gap-calculation.md section 3:
- *   normalized_weighted_gap = normalized_gap * (1 + (1 - confidence) * uncertainty_weight)
- *
- * Key constraint: if current_value is null, skip confidence weighting
- * (null already produces max gap via section 1 guard; don't double-inflate).
- */
-export function applyConfidenceWeight(normalizedGap, confidence, uncertaintyWeight, currentValueIsNull) {
-    if (currentValueIsNull) {
-        return normalizedGap; // Do not apply confidence weighting for null values
-    }
-    return normalizedGap * (1 + (1 - confidence) * uncertaintyWeight);
-}
-/**
- * Calculate the complete gap pipeline for a single dimension.
- * Returns all intermediate values for transparency.
- */
-export function calculateDimensionGap(input, globalUncertaintyWeight = 1.0) {
-    const { name, current_value, threshold, confidence, uncertainty_weight } = input;
-    const effectiveWeight = uncertainty_weight ?? globalUncertaintyWeight;
-    const rawGap = computeRawGap(current_value, threshold);
-    const normalizedGap = normalizeGap(rawGap, threshold, current_value);
-    const normalizedWeightedGap = applyConfidenceWeight(normalizedGap, confidence, effectiveWeight, current_value === null);
-    return {
-        dimension_name: name,
-        raw_gap: rawGap,
-        normalized_gap: normalizedGap,
-        normalized_weighted_gap: normalizedWeightedGap,
-        confidence,
-        uncertainty_weight: effectiveWeight,
-    };
-}
-// ─── Full Pipeline for a Goal ───
-/**
- * Calculate gap vector for all dimensions of a goal.
- */
-export function calculateGapVector(goalId, dimensions, globalUncertaintyWeight = 1.0) {
-    const gaps = dimensions.map((dim) => calculateDimensionGap({
-        name: dim.name,
-        current_value: dim.current_value,
-        threshold: dim.threshold,
-        confidence: dim.confidence,
-        uncertainty_weight: dim.uncertainty_weight,
-    }, globalUncertaintyWeight));
-    return {
-        goal_id: goalId,
-        gaps,
-        timestamp: new Date().toISOString(),
-    };
-}
-// ─── Parent Gap Aggregation ───
-/**
- * Aggregate child gap vectors into a parent gap value.
- *
- * gap-calculation.md section 6:
- *   Default: bottleneck aggregation = max(normalized_weighted_gap)
- *   Alternative: weighted_avg, sum
- *
- * Operates on normalized_weighted_gap values.
- */
-export function aggregateGaps(childGaps, method = "max", weights) {
-    if (childGaps.length === 0)
-        return 0;
-    switch (method) {
-        case "max":
-            return Math.max(...childGaps);
-        case "weighted_avg": {
-            const w = weights ?? childGaps.map(() => 1);
-            const totalWeight = w.reduce((sum, wi) => sum + wi, 0);
-            if (totalWeight === 0)
-                return 0;
-            const weightedSum = childGaps.reduce((sum, gap, i) => sum + gap * (w[i] ?? 1), 0);
-            return weightedSum / totalWeight;
-        }
-        case "sum":
-            return childGaps.reduce((sum, gap) => sum + gap, 0);
-    }
-}
-// ─── Helpers ───
-function toNumber(value) {
-    if (typeof value === "number")
-        return value;
-    if (typeof value === "boolean")
-        return value ? 1 : 0;
-    if (typeof value === "string") {
-        const n = Number(value);
-        return isNaN(n) ? 0 : n;
-    }
-    return 0;
-}
-function isTruthy(value) {
-    if (value === null || value === undefined)
-        return false;
-    if (typeof value === "boolean")
-        return value;
-    if (typeof value === "number")
-        return value !== 0;
-    if (typeof value === "string")
-        return value.length > 0;
-    return false;
-}
-//# sourceMappingURL=gap-calculator.js.map

package/dist/gap-calculator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"gap-calculator.js","sourceRoot":"","sources":["../src/gap-calculator.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AAEH,sCAAsC;AAEtC;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,aAAa,CAC3B,YAA8C,EAC9C,SAAoB;IAEpB,4BAA4B;IAC5B,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;QAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,8BAA8B;YACxD,KAAK,KAAK;gBACR,6DAA6D;gBAC7D,iEAAiE;gBACjE,kEAAkE;gBAClE,gEAAgE;gBAChE,uBAAuB;gBACvB,OAAO,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,OAAO;gBACV,OAAO,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,kBAAkB;YAC3D,KAAK,SAAS;gBACZ,OAAO,CAAC,CAAC;YACX,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IAED,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;YACvC,OAAO,CACL,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CACtC,CAAC;QACJ,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,OAAO,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,4CAA4C;YAC5C,OAAO,YAAY,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;AACH,CAAC;AAED,gCAAgC;AAEhC;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAc,EACd,SAAoB,EACpB,YAA8C;IAE9C,2CAA2C;IAC3C,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,SAAS,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAChC,CAAC;YACD,OAAO,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC;QAClC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,SAAS,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC;QAClC,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,SAAS,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAChC,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,CAAC,iBAAiB;IACpC,CAAC;AACH,CAAC;AAED,0CAA0C;AAE1C;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,aAAqB,EACrB,UAAkB,EAClB,iBAAyB,EACzB,kBAA2B;IAE3B,IAAI,kBAAkB,EAAE,CAAC;QACvB,OAAO,aAAa,CAAC,CAAC,oDAAoD;IAC5E,CAAC;IAED,OAAO,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,iBAAiB,CAAC,CAAC;AACpE,CAAC;AAaD;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAwB,EACxB,0BAAkC,GAAG;IAErC,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,EAAE,GACtE,KAAK,CAAC;IAER,MAAM,eAAe,GAAG,kBAAkB,IAAI,uBAAuB,CAAC;IACtE,MAAM,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACrE,MAAM,qBAAqB,GAAG,qBAAqB,CACjD,aAAa,EACb,UAAU,EACV,eAAe,EACf,aAAa,KAAK,IAAI,CACvB,CAAC;IAEF,OAAO;QACL,cAAc,EAAE,IAAI;QACpB,OAAO,EAAE,MAAM;QACf,cAAc,EAAE,aAAa;QAC7B,uBAAuB,EAAE,qBAAqB;QAC9C,UAAU;QACV,kBAAkB,EAAE,eAAe;KACpC,CAAC;AACJ,CAAC;AAED,mCAAmC;AAEnC;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,UAAuB,EACvB,0BAAkC,GAAG;IAErC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAClC,qBAAqB,CACnB;QACE,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,aAAa,EAAE,GAAG,CAAC,aAAa;QAChC,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;KAC3C,EACD,uBAAuB,CACxB,CACF,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,MAAM;QACf,IAAI;QACJ,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACpC,CAAC;AACJ,CAAC;AAED,iCAAiC;AAEjC;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAmB,EACnB,SAAyC,KAAK,EAC9C,OAAkB;IAElB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAErC,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QAChC,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,OAAO,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,WAAW,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YAChC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EACxC,CAAC,CACF,CAAC;YACF,OAAO,WAAW,GAAG,WAAW,CAAC;QACnC,CAAC;QACD,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAED,kBAAkB;AAElB,SAAS,QAAQ,CAAC,KAAuC;IACvD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CAAC,KAAuC;IACvD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC;AACf,CAAC"}

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

@@ -1,112 +0,0 @@
-import type { StateManager } from "./state-manager.js";
-import type { ILLMClient } from "./llm/llm-client.js";
-import type { DependencyEdge, DependencyEdgeStatus, DependencyGraph } from "./types/dependency.js";
-import type { DependencyType } from "./types/core.js";
-/**
- * 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: ~/.motiva/dependency-graph.json (via StateManager.readRaw/writeRaw)
- */
-export declare class GoalDependencyGraph {
-    private stateManager;
-    private llmClient?;
-    private graph;
-    constructor(stateManager: StateManager, llmClient?: ILLMClient);
-    /**
-     * Adds an edge to the graph.
-     * For prerequisite edges, validates that the addition would not create a cycle.
-     */
-    addEdge(edge: Omit<DependencyEdge, "created_at">): DependencyEdge;
-    /**
-     * Removes an edge matching from/to/type from the graph.
-     */
-    removeEdge(fromGoalId: string, toGoalId: string, type: DependencyType): void;
-    /**
-     * Updates the status of an edge identified by from/to.
-     */
-    updateEdgeStatus(fromGoalId: string, toGoalId: string, status: DependencyEdgeStatus): 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): 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(): DependencyGraph;
-    /**
-     * Persists the dependency graph to disk.
-     */
-    save(graph: DependencyGraph): void;
-    /**
-     * Returns the current in-memory graph.
-     */
-    getGraph(): DependencyGraph;
-}
-//# sourceMappingURL=goal-dependency-graph.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"goal-dependency-graph.d.ts","sourceRoot":"","sources":["../src/goal-dependency-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,qBAAqB,CAAC;AAClE,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEtD;;;;;;;;;;GAUG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,SAAS,CAAC,CAAa;IAC/B,OAAO,CAAC,KAAK,CAAkB;gBAEnB,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,UAAU;IAQ9D;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,CAAC,GAAG,cAAc;IA0BjE;;OAEG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,GAAG,IAAI;IAa5E;;OAEG;IACH,gBAAgB,CACd,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,oBAAoB,GAC3B,IAAI;IASP;;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;IA4B1D;;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;IA0D5B;;;;OAIG;IACH,qBAAqB,CACnB,gBAAgB,EAAE,MAAM,EACxB,gBAAgB,EAAE,MAAM,EACxB,cAAc,EAAE,cAAc,GAAG,UAAU,EAC3C,MAAM,EAAE,MAAM,GACb,IAAI;IAcP;;;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;IACH,IAAI,IAAI,eAAe;IAYvB;;OAEG;IACH,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,IAAI;IAIlC;;OAEG;IACH,QAAQ,IAAI,eAAe;CAG5B"}

package/dist/goal-dependency-graph.js

@@ -1,291 +0,0 @@
-import { DependencyGraphSchema } from "./types/dependency.js";
-/**
- * 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: ~/.motiva/dependency-graph.json (via StateManager.readRaw/writeRaw)
- */
-export class GoalDependencyGraph {
-    stateManager;
-    llmClient;
-    graph;
-    constructor(stateManager, llmClient) {
-        this.stateManager = stateManager;
-        this.llmClient = llmClient;
-        this.graph = this.load();
-    }
-    // ─── CRUD ───
-    /**
-     * Adds an edge to the graph.
-     * For prerequisite edges, validates that the addition would not create a cycle.
-     */
-    addEdge(edge) {
-        if (edge.type === "prerequisite" && this.detectCycle(edge.from_goal_id, edge.to_goal_id)) {
-            throw new Error(`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();
-        this.save(this.graph);
-        return fullEdge;
-    }
-    /**
-     * Removes an edge matching from/to/type from the graph.
-     */
-    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();
-        this.save(this.graph);
-    }
-    /**
-     * Updates the status of an edge identified by from/to.
-     */
-    updateEdgeStatus(fromGoalId, toGoalId, status) {
-        const edge = this.getEdge(fromGoalId, toGoalId);
-        if (edge) {
-            edge.status = status;
-            this.graph.updated_at = new Date().toISOString();
-            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];
-        while (queue.length > 0) {
-            const current = queue.shift();
-            if (current === fromGoalId)
-                return true;
-            if (visited.has(current))
-                continue;
-            visited.add(current);
-            // Follow active prerequisite edges where current is the from_goal_id
-            for (const edge of this.graph.edges) {
-                if (edge.type === "prerequisite" &&
-                    edge.from_goal_id === current &&
-                    edge.status === "active") {
-                    queue.push(edge.to_goal_id);
-                }
-            }
-        }
-        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 || 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.`;
-        const messages = [{ role: "user", content: prompt }];
-        try {
-            const response = await this.llmClient.sendMessage(messages);
-            const parsed = JSON.parse(response.content);
-            if (!Array.isArray(parsed))
-                return [];
-            const edges = [];
-            for (const item of parsed) {
-                try {
-                    const edge = this.addEdge({
-                        from_goal_id: String(item["from_goal_id"] ?? ""),
-                        to_goal_id: String(item["to_goal_id"] ?? ""),
-                        type: item["type"] ?? "conflict",
-                        status: "active",
-                        condition: typeof item["condition"] === "string" ? item["condition"] : null,
-                        affected_dimensions: Array.isArray(item["affected_dimensions"])
-                            ? item["affected_dimensions"]
-                            : [],
-                        mitigation: null,
-                        detection_confidence: typeof item["detection_confidence"] === "number"
-                            ? item["detection_confidence"]
-                            : 0.5,
-                        reasoning: typeof item["reasoning"] === "string" ? item["reasoning"] : null,
-                    });
-                    edges.push(edge);
-                }
-                catch {
-                    // Skip malformed items
-                }
-            }
-            return edges;
-        }
-        catch {
-            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.
-     */
-    addStrategyDependency(sourceStrategyId, targetStrategyId, dependencyType, goalId) {
-        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.
-     */
-    load() {
-        try {
-            const raw = 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.
-     */
-    save(graph) {
-        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/goal-dependency-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"goal-dependency-graph.js","sourceRoot":"","sources":["../src/goal-dependency-graph.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAG9D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,mBAAmB;IACtB,YAAY,CAAe;IAC3B,SAAS,CAAc;IACvB,KAAK,CAAkB;IAE/B,YAAY,YAA0B,EAAE,SAAsB;QAC5D,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,eAAe;IAEf;;;OAGG;IACH,OAAO,CAAC,IAAwC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzF,MAAM,IAAI,KAAK,CACb,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,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB,EAAE,QAAgB,EAAE,IAAoB;QACnE,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,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,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,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,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;QAEnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,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,qEAAqE;YACrE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACpC,IACE,IAAI,CAAC,IAAI,KAAK,cAAc;oBAC5B,IAAI,CAAC,YAAY,KAAK,OAAO;oBAC7B,IAAI,CAAC,MAAM,KAAK,QAAQ,EACxB,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC9B,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,IAAI,CAAC,SAAS,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE/D,MAAM,MAAM,GAAG;;eAEJ,SAAS;qBACH,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;;;;gDAWC,CAAC;QAE7C,MAAM,QAAQ,GAAiB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnE,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC5D,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,CAAC;YAEtC,MAAM,KAAK,GAAqB,EAAE,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,MAAmC,EAAE,CAAC;gBACvD,IAAI,CAAC;oBACH,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;wBACxB,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;wBAChD,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;wBAC5C,IAAI,EAAG,IAAI,CAAC,MAAM,CAAoB,IAAI,UAAU;wBACpD,MAAM,EAAE,QAAQ;wBAChB,SAAS,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;wBAC3E,mBAAmB,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;4BAC7D,CAAC,CAAE,IAAI,CAAC,qBAAqB,CAAc;4BAC3C,CAAC,CAAC,EAAE;wBACN,UAAU,EAAE,IAAI;wBAChB,oBAAoB,EAClB,OAAO,IAAI,CAAC,sBAAsB,CAAC,KAAK,QAAQ;4BAC9C,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC;4BAC9B,CAAC,CAAC,GAAG;wBACT,SAAS,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;qBAC5E,CAAC,CAAC;oBACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAAC,MAAM,CAAC;oBACP,uBAAuB;gBACzB,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,gCAAgC;IAEhC;;;;OAIG;IACH,qBAAqB,CACnB,gBAAwB,EACxB,gBAAwB,EACxB,cAA2C,EAC3C,MAAc;QAEd,IAAI,CAAC,OAAO,CAAC;YACX,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,IAAI;QACF,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;YAC/D,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,IAAI,CAAC,KAAsB;QACzB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}