cbrowser 18.40.0 → 18.41.0

package/dist/visual/cognitive-transport-chain.js

@@ -0,0 +1,440 @@
+/**
+ * Cognitive Optimal Transport — Sequential Transport Chain
+ *
+ * Implements the CHI 2027 paper's core contribution:
+ * - 26-dimensional demand distribution computed from page features
+ * - Sequential transport chain where each layer depletes capacity
+ * - Asymmetric deficit-surplus cost
+ * - Layer interaction terms
+ *
+ * Mathematical foundation: The total Cognitive Transport Cost is NOT
+ * the sum of independent layers. Each layer receives the user's RESIDUAL
+ * capacity after prior layers have consumed resources.
+ *
+ * @see Section 3.4 of "Cognitive Optimal Transport: A Unified Framework"
+ * @since v18.39.0
+ */
+import { extractPageMetrics, } from './cognitive-transport.js';
+// ── Constants ──
+/**
+ * The 26 demand dimensions used by the sequential transport chain.
+ * Superset of the base 25 OT cognitive traits — includes extended traits
+ * from CognitiveTraits that capture decision biases, learning transfer,
+ * and emotional regulation.
+ */
+export const DEMAND_DIMENSIONS = [
+    // Core capacity traits
+    'patience', 'riskTolerance', 'comprehension',
+    'persistence', 'workingMemory', 'readingTendency',
+    // Emotional regulation
+    'resilience', 'selfEfficacy', 'emotionalContagion',
+    // Decision-making
+    'satisficing', 'anchoringBias', 'fearOfMissingOut', 'socialProofSensitivity',
+    // Perceptual
+    'changeBlindness', 'attentionPattern',
+    // Motor & procedural
+    'motorPrecision', 'proceduralFluency',
+    // Cognitive strategy
+    'informationForaging', 'metacognitivePlanning', 'transferLearning',
+    // Interrupt & recovery
+    'interruptRecovery',
+    // Trust
+    'trustCalibration',
+    // Additional extended traits
+    'mentalModelRigidity', 'curiosity',
+    // Processing
+    'processingSpeed', 'textProcessing',
+];
+/**
+ * Layer definitions for the sequential transport chain.
+ * Order reflects temporal processing: perception -> cognition -> decision -> action -> affect -> comprehension.
+ */
+const LAYER_DEFINITIONS = [
+    {
+        name: 'saliency',
+        traits: ['changeBlindness', 'attentionPattern'],
+    },
+    {
+        name: 'cognitiveLoad',
+        traits: ['comprehension', 'workingMemory', 'informationForaging'],
+    },
+    {
+        name: 'decision',
+        traits: ['satisficing', 'anchoringBias', 'riskTolerance', 'fearOfMissingOut', 'socialProofSensitivity'],
+    },
+    {
+        name: 'motor',
+        traits: ['patience', 'proceduralFluency'],
+    },
+    {
+        name: 'frustration',
+        traits: ['resilience', 'selfEfficacy', 'patience', 'emotionalContagion'],
+    },
+    {
+        name: 'readability',
+        traits: ['readingTendency', 'comprehension', 'transferLearning'],
+    },
+];
+/**
+ * Pairwise interaction definitions — the top 5 cross-layer effects
+ * identified in the CHI 2027 paper's empirical calibration (Table 3).
+ */
+const INTERACTION_PAIRS = [
+    { a: 'cognitiveLoad', b: 'decision', weight: 0.15 },
+    { a: 'saliency', b: 'cognitiveLoad', weight: 0.15 },
+    { a: 'frustration', b: 'readability', weight: 0.15 },
+    { a: 'cognitiveLoad', b: 'motor', weight: 0.15 },
+    { a: 'frustration', b: 'decision', weight: 0.15 },
+];
+/** Asymmetric cost weights (Theorem 2 in paper) */
+const WEIGHT_DEFICIT = 1.0; // demand > capacity: high cost
+const WEIGHT_SURPLUS = 0.3; // capacity > demand: low cost (surplus is cheap)
+/** Capacity depletion rate per layer (alpha_i, Section 3.4) */
+const DEPLETION_RATE = 0.15;
+/** Minimum residual capacity floor (prevents total exhaustion) */
+const CAPACITY_FLOOR = 0.05;
+// ── Sigmoid Helper ──
+/**
+ * Standard logistic sigmoid for mapping raw page metrics to demand values.
+ * Calibrated thresholds ensure typical web pages produce demands in [0.1, 0.9].
+ */
+function sigmoid(raw, threshold, scale) {
+    const x = -(raw - threshold) / scale;
+    // Clamp exponent to prevent overflow
+    if (x > 500)
+        return 0;
+    if (x < -500)
+        return 1;
+    return 1 / (1 + Math.exp(x));
+}
+// ── 1. Demand Distribution Computation ──
+/**
+ * Compute the 26-dimensional demand distribution from page metrics.
+ *
+ * Each page feature maps to specific trait dimensions via calibrated
+ * sigmoid functions. The mapping encodes HOW each page characteristic
+ * creates cognitive demand on specific user capacities.
+ *
+ * Traits not affected by any page feature receive demand = 0.0 (no demand).
+ *
+ * @param pageMetrics - Extracted page analysis metrics
+ * @returns DemandDistribution with per-trait demand and variance
+ */
+export function computeDemandDistribution(pageMetrics) {
+    const demands = {};
+    const variance = {};
+    // Initialize all 26 dimensions to zero demand
+    for (const dim of DEMAND_DIMENSIONS) {
+        demands[dim] = 0;
+        variance[dim] = 0;
+    }
+    // Sanitize inputs — guard against NaN, undefined, negative
+    const safe = (v, fallback = 0) => {
+        if (v === undefined || v === null || Number.isNaN(v))
+            return fallback;
+        return Math.max(0, v);
+    };
+    const infoDensity = safe(pageMetrics.informationDensity);
+    const visCplx = safe(pageMetrics.visualComplexity);
+    const interactiveCount = safe(pageMetrics.interactiveElementCount);
+    const textDens = safe(pageMetrics.textDensity);
+    const animLevel = safe(pageMetrics.animationLevel);
+    const choices = safe(pageMetrics.choiceCount);
+    const navDepth = safe(pageMetrics.navigationDepth);
+    // Normalize interactive element count to 0-1 range for sigmoid
+    const interactiveNorm = Math.min(1, interactiveCount / 50);
+    // ── informationDensity → comprehension, workingMemory, readingTendency, informationForaging
+    const infoDemand = sigmoid(infoDensity, 0.5, 0.15);
+    demands.comprehension = Math.max(demands.comprehension, infoDemand);
+    demands.workingMemory = Math.max(demands.workingMemory, infoDemand * 0.9);
+    demands.readingTendency = Math.max(demands.readingTendency, infoDemand * 0.85);
+    demands.informationForaging = Math.max(demands.informationForaging, infoDemand * 0.8);
+    variance.comprehension += infoDensity * 0.1;
+    variance.workingMemory += infoDensity * 0.08;
+    variance.readingTendency += infoDensity * 0.07;
+    variance.informationForaging += infoDensity * 0.06;
+    // ── visualComplexity → changeBlindness, mentalModelRigidity, attentionPattern (inferred)
+    const visDemand = sigmoid(visCplx, 0.5, 0.15);
+    demands.changeBlindness = Math.max(demands.changeBlindness, visDemand);
+    demands.mentalModelRigidity = Math.max(demands.mentalModelRigidity, visDemand * 0.7);
+    demands.attentionPattern = Math.max(demands.attentionPattern, visDemand * 0.85);
+    variance.changeBlindness += visCplx * 0.12;
+    variance.mentalModelRigidity += visCplx * 0.08;
+    variance.attentionPattern += visCplx * 0.1;
+    // ── interactiveElementCount → riskTolerance, satisficing, proceduralFluency, motorPrecision (inferred)
+    const interDemand = sigmoid(interactiveNorm, 0.4, 0.2);
+    demands.riskTolerance = Math.max(demands.riskTolerance, interDemand * 0.75);
+    demands.satisficing = Math.max(demands.satisficing, interDemand * 0.8);
+    demands.proceduralFluency = Math.max(demands.proceduralFluency, interDemand * 0.9);
+    demands.motorPrecision = Math.max(demands.motorPrecision, interDemand);
+    variance.riskTolerance += interactiveNorm * 0.06;
+    variance.satisficing += interactiveNorm * 0.07;
+    variance.proceduralFluency += interactiveNorm * 0.08;
+    variance.motorPrecision += interactiveNorm * 0.1;
+    // ── textDensity → readingTendency, patience, comprehension
+    const textDemand = sigmoid(textDens, 0.5, 0.15);
+    demands.readingTendency = Math.max(demands.readingTendency, textDemand);
+    demands.patience = Math.max(demands.patience, textDemand * 0.7);
+    demands.comprehension = Math.max(demands.comprehension, textDemand * 0.85);
+    variance.readingTendency += textDens * 0.09;
+    variance.patience += textDens * 0.06;
+    variance.comprehension += textDens * 0.08;
+    // ── animationLevel → changeBlindness, interruptRecovery, emotionalContagion
+    const animDemand = sigmoid(animLevel, 0.3, 0.15);
+    demands.changeBlindness = Math.max(demands.changeBlindness, animDemand * 0.9);
+    demands.interruptRecovery = Math.max(demands.interruptRecovery, animDemand * 0.85);
+    demands.emotionalContagion = Math.max(demands.emotionalContagion, animDemand * 0.7);
+    variance.changeBlindness += animLevel * 0.1;
+    variance.interruptRecovery += animLevel * 0.09;
+    variance.emotionalContagion += animLevel * 0.07;
+    // ── choiceCount → satisficing, anchoringBias, fearOfMissingOut, socialProofSensitivity
+    const choiceDemand = sigmoid(choices, 8, 4);
+    demands.satisficing = Math.max(demands.satisficing, choiceDemand);
+    demands.anchoringBias = Math.max(demands.anchoringBias, choiceDemand * 0.85);
+    demands.fearOfMissingOut = Math.max(demands.fearOfMissingOut, choiceDemand * 0.75);
+    demands.socialProofSensitivity = Math.max(demands.socialProofSensitivity, choiceDemand * 0.7);
+    variance.satisficing += Math.min(1, choices / 20) * 0.1;
+    variance.anchoringBias += Math.min(1, choices / 20) * 0.08;
+    variance.fearOfMissingOut += Math.min(1, choices / 20) * 0.07;
+    variance.socialProofSensitivity += Math.min(1, choices / 20) * 0.06;
+    // ── navigationDepth → workingMemory, metacognitivePlanning, persistence, transferLearning
+    const navDemand = sigmoid(Math.min(1, navDepth / 5), 0.4, 0.2);
+    demands.workingMemory = Math.max(demands.workingMemory, navDemand * 0.95);
+    demands.metacognitivePlanning = Math.max(demands.metacognitivePlanning, navDemand * 0.8);
+    demands.persistence = Math.max(demands.persistence, navDemand * 0.7);
+    demands.transferLearning = Math.max(demands.transferLearning, navDemand * 0.65);
+    variance.workingMemory += Math.min(1, navDepth / 5) * 0.09;
+    variance.metacognitivePlanning += Math.min(1, navDepth / 5) * 0.07;
+    variance.persistence += Math.min(1, navDepth / 5) * 0.06;
+    variance.transferLearning += Math.min(1, navDepth / 5) * 0.05;
+    // Clamp all demands and variances to [0, 1]
+    for (const dim of DEMAND_DIMENSIONS) {
+        demands[dim] = Math.max(0, Math.min(1, demands[dim]));
+        variance[dim] = Math.max(0, Math.min(1, variance[dim]));
+    }
+    return { demands, variance };
+}
+// ── 2. Sequential Transport Chain ──
+/**
+ * Resolve a trait value from the persona's trait record.
+ * Falls back to 0.5 (neutral midpoint) for missing traits.
+ */
+function traitValue(traits, trait) {
+    const v = traits[trait];
+    if (v === undefined || v === null || Number.isNaN(v))
+        return 0.5;
+    return Math.max(0, Math.min(1, v));
+}
+/**
+ * Compute the Sequential Cognitive Transport Cost (CTC).
+ *
+ * Unlike additive cognitive load models, the sequential chain depletes
+ * capacity at each processing layer. A user who spends cognitive resources
+ * on saliency detection has LESS available for subsequent decision-making.
+ *
+ * The algorithm processes layers in temporal order:
+ *   Saliency -> Cognitive Load -> Decision -> Motor -> Frustration -> Readability
+ *
+ * Each layer:
+ * 1. Computes asymmetric transport cost (deficit is expensive, surplus is cheap)
+ * 2. Depletes residual capacity proportional to cost incurred
+ * 3. Records the remaining capacity for downstream layers
+ *
+ * @param persona - OTCognitiveProfile with trait values
+ * @param demand - 26D demand distribution from page analysis
+ * @param options - Enable/disable asymmetric costs and interaction terms
+ * @returns Complete sequential transport result with per-layer breakdown
+ */
+export function computeSequentialCTC(persona, demand, options) {
+    const useAsymmetric = options?.asymmetric !== false; // default true
+    const useInteractions = options?.interactions !== false; // default true
+    // Initialize residual capacity from persona traits
+    const residualCapacity = {};
+    for (const dim of DEMAND_DIMENSIONS) {
+        residualCapacity[dim] = traitValue(persona.traits, dim);
+    }
+    const layers = [];
+    const traitCosts = {};
+    let totalDeficit = 0;
+    let totalSurplus = 0;
+    let additiveCTC = 0;
+    // Initialize per-trait costs to zero
+    for (const dim of DEMAND_DIMENSIONS) {
+        traitCosts[dim] = 0;
+    }
+    // Process each layer sequentially
+    for (const layerDef of LAYER_DEFINITIONS) {
+        let layerCost = 0;
+        let layerDeficit = 0;
+        let layerSurplus = 0;
+        // Compute transport cost for this layer's traits
+        for (const trait of layerDef.traits) {
+            const d = demand.demands[trait] ?? 0;
+            const c = residualCapacity[trait] ?? 0.5;
+            const gap = d - c;
+            let cost;
+            if (gap > 0) {
+                // Deficit: demand exceeds capacity — expensive
+                cost = (useAsymmetric ? WEIGHT_DEFICIT : 1.0) * gap * gap;
+                layerDeficit += cost;
+            }
+            else {
+                // Surplus: capacity exceeds demand — cheap
+                cost = (useAsymmetric ? WEIGHT_SURPLUS : 1.0) * gap * gap;
+                layerSurplus += cost;
+            }
+            layerCost += cost;
+            traitCosts[trait] = (traitCosts[trait] ?? 0) + cost;
+        }
+        totalDeficit += layerDeficit;
+        totalSurplus += layerSurplus;
+        additiveCTC += layerCost;
+        // Deplete capacity for next layers
+        // Each trait in this layer loses capacity proportional to the layer's total cost
+        const capacityConsumed = DEPLETION_RATE * layerCost;
+        for (const trait of layerDef.traits) {
+            residualCapacity[trait] -= capacityConsumed;
+            residualCapacity[trait] = Math.max(CAPACITY_FLOOR, residualCapacity[trait]);
+        }
+        // Also deplete shared traits that appear in later layers
+        // (cross-layer fatigue: cognitive exhaustion bleeds across boundaries)
+        for (const dim of DEMAND_DIMENSIONS) {
+            if (!layerDef.traits.includes(dim)) {
+                // Indirect depletion at half rate
+                residualCapacity[dim] -= (DEPLETION_RATE * 0.5) * layerCost;
+                residualCapacity[dim] = Math.max(CAPACITY_FLOOR, residualCapacity[dim]);
+            }
+        }
+        layers.push({
+            name: layerDef.name,
+            transportCost: layerCost,
+            capacityConsumed,
+            residualCapacity: { ...residualCapacity },
+        });
+    }
+    // Compute interaction terms
+    const interactions = {};
+    let interactionTotal = 0;
+    if (useInteractions) {
+        const layerCostMap = {};
+        for (const layer of layers) {
+            layerCostMap[layer.name] = layer.transportCost;
+        }
+        for (const pair of INTERACTION_PAIRS) {
+            const costA = layerCostMap[pair.a] ?? 0;
+            const costB = layerCostMap[pair.b] ?? 0;
+            const interaction = costA * costB * pair.weight;
+            const key = `${pair.a}x${pair.b}`;
+            interactions[key] = interaction;
+            interactionTotal += interaction;
+        }
+    }
+    // Total CTC = sum of layer costs + interaction terms
+    // Note: additiveCTC is layers-only (no interactions, no sequential effects)
+    // The sequential effect is already embedded in layer costs via capacity depletion
+    const totalCTC = layers.reduce((sum, l) => sum + l.transportCost, 0) + interactionTotal;
+    // Find bottleneck layer
+    let maxLayerCost = 0;
+    let bottleneckLayer = layers[0]?.name ?? 'saliency';
+    for (const layer of layers) {
+        if (layer.transportCost > maxLayerCost) {
+            maxLayerCost = layer.transportCost;
+            bottleneckLayer = layer.name;
+        }
+    }
+    // Compute abandonment risk
+    // Higher CTC relative to patience capacity → higher abandonment probability
+    const patienceCapacity = traitValue(persona.traits, 'patience');
+    const abandonmentRisk = sigmoid(totalCTC, patienceCapacity * 2, 0.3);
+    return {
+        totalCTC,
+        layers,
+        interactions,
+        additiveCTC,
+        deficitCost: totalDeficit,
+        surplusCost: totalSurplus,
+        traitCosts,
+        bottleneckLayer,
+        abandonmentRisk,
+    };
+}
+// ── 3. Convenience: Full COT Pipeline ──
+/**
+ * End-to-end Cognitive Optimal Transport computation.
+ *
+ * Extracts page metrics from a live Playwright page, computes the
+ * 26D demand distribution, and runs the full sequential transport chain.
+ *
+ * This is the primary entry point for MCP tools that need a single
+ * CTC score with full breakdown.
+ *
+ * @param persona - OTCognitiveProfile with trait values
+ * @param page - Playwright Page object (or any object with evaluate())
+ * @returns Complete sequential transport result
+ */
+export async function computeFullCOT(persona, page) {
+    // Extract page metrics via Playwright's page.evaluate()
+    const metrics = await extractPageMetrics(page);
+    // Compute 26D demand distribution
+    const demand = computeDemandDistribution(metrics);
+    // Run sequential transport chain with full options
+    return computeSequentialCTC(persona, demand, {
+        asymmetric: true,
+        interactions: true,
+    });
+}
+// ── 4. Utility Exports ──
+/**
+ * Compute demand distribution from raw metric values (no page required).
+ * Useful for testing, simulation, and sensitivity analysis.
+ */
+export function computeDemandFromRawMetrics(informationDensity, visualComplexity, interactiveElementCount, textDensity, animationLevel, choiceCount, navigationDepth) {
+    return computeDemandDistribution({
+        informationDensity,
+        visualComplexity,
+        interactiveElementCount,
+        textDensity,
+        animationLevel,
+        choiceCount,
+        navigationDepth,
+    });
+}
+/**
+ * Compare sequential vs. additive CTC to quantify the sequential effect.
+ *
+ * Returns the ratio (sequential / additive). Values > 1.0 indicate that
+ * capacity depletion and interactions amplify the total cost beyond what
+ * independent layers would predict.
+ */
+export function sequentialAmplification(result) {
+    if (result.additiveCTC === 0)
+        return 1.0;
+    return result.totalCTC / result.additiveCTC;
+}
+/**
+ * Identify the top N most costly traits across all layers.
+ * Useful for targeted remediation — fix the traits that hurt most.
+ */
+export function topCostlyTraits(result, n = 5) {
+    return Object.entries(result.traitCosts)
+        .filter(([, cost]) => cost > 0)
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, n)
+        .map(([trait, cost]) => ({ trait, cost }));
+}
+/**
+ * Compute CTC for a minimal/empty page (baseline).
+ * Useful for normalizing CTC scores against the best-case scenario.
+ */
+export function baselineCTC(persona) {
+    const emptyDemand = {
+        demands: {},
+        variance: {},
+    };
+    for (const dim of DEMAND_DIMENSIONS) {
+        emptyDemand.demands[dim] = 0;
+        emptyDemand.variance[dim] = 0;
+    }
+    return computeSequentialCTC(persona, emptyDemand);
+}
+//# sourceMappingURL=cognitive-transport-chain.js.map

package/dist/visual/cognitive-transport-chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognitive-transport-chain.js","sourceRoot":"","sources":["../../src/visual/cognitive-transport-chain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAEL,kBAAkB,GACnB,MAAM,0BAA0B,CAAC;AAiDlC,kBAAkB;AAElB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,uBAAuB;IACvB,UAAU,EAAE,eAAe,EAAE,eAAe;IAC5C,aAAa,EAAE,eAAe,EAAE,iBAAiB;IACjD,uBAAuB;IACvB,YAAY,EAAE,cAAc,EAAE,oBAAoB;IAClD,kBAAkB;IAClB,aAAa,EAAE,eAAe,EAAE,kBAAkB,EAAE,wBAAwB;IAC5E,aAAa;IACb,iBAAiB,EAAE,kBAAkB;IACrC,qBAAqB;IACrB,gBAAgB,EAAE,mBAAmB;IACrC,qBAAqB;IACrB,qBAAqB,EAAE,uBAAuB,EAAE,kBAAkB;IAClE,uBAAuB;IACvB,mBAAmB;IACnB,QAAQ;IACR,kBAAkB;IAClB,6BAA6B;IAC7B,qBAAqB,EAAE,WAAW;IAClC,aAAa;IACb,iBAAiB,EAAE,gBAAgB;CAC3B,CAAC;AAEX;;;GAGG;AACH,MAAM,iBAAiB,GAA8C;IACnE;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,CAAC,iBAAiB,EAAE,kBAAkB,CAAC;KAChD;IACD;QACE,IAAI,EAAE,eAAe;QACrB,MAAM,EAAE,CAAC,eAAe,EAAE,eAAe,EAAE,qBAAqB,CAAC;KAClE;IACD;QACE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,CAAC,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,kBAAkB,EAAE,wBAAwB,CAAC;KACxG;IACD;QACE,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,CAAC,UAAU,EAAE,mBAAmB,CAAC;KAC1C;IACD;QACE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,CAAC,YAAY,EAAE,cAAc,EAAE,UAAU,EAAE,oBAAoB,CAAC;KACzE;IACD;QACE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,CAAC,iBAAiB,EAAE,eAAe,EAAE,kBAAkB,CAAC;KACjE;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,iBAAiB,GAAoD;IACzE,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;IACnD,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE;IACnD,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE;IACpD,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE;IAChD,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;CAClD,CAAC;AAEF,mDAAmD;AACnD,MAAM,cAAc,GAAG,GAAG,CAAC,CAAG,+BAA+B;AAC7D,MAAM,cAAc,GAAG,GAAG,CAAC,CAAG,iDAAiD;AAE/E,+DAA+D;AAC/D,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B,kEAAkE;AAClE,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B,uBAAuB;AAEvB;;;GAGG;AACH,SAAS,OAAO,CAAC,GAAW,EAAE,SAAiB,EAAE,KAAa;IAC5D,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;IACrC,qCAAqC;IACrC,IAAI,CAAC,GAAG,GAAG;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,2CAA2C;AAE3C;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,yBAAyB,CAAC,WAAwB;IAChE,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAE5C,8CAA8C;IAC9C,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,2DAA2D;IAC3D,MAAM,IAAI,GAAG,CAAC,CAAqB,EAAE,WAAmB,CAAC,EAAU,EAAE;QACnE,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,QAAQ,CAAC;QACtE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;IACzD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;IACnD,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,uBAAuB,CAAC,CAAC;IACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;IAEnD,+DAA+D;IAC/D,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,GAAG,EAAE,CAAC,CAAC;IAE3D,6FAA6F;IAC7F,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IACnD,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IACpE,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC;IAC1E,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC;IAC/E,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,mBAAmB,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC;IACtF,QAAQ,CAAC,aAAa,IAAI,WAAW,GAAG,GAAG,CAAC;IAC5C,QAAQ,CAAC,aAAa,IAAI,WAAW,GAAG,IAAI,CAAC;IAC7C,QAAQ,CAAC,eAAe,IAAI,WAAW,GAAG,IAAI,CAAC;IAC/C,QAAQ,CAAC,mBAAmB,IAAI,WAAW,GAAG,IAAI,CAAC;IAEnD,0FAA0F;IAC1F,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9C,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC;IACvE,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,mBAAmB,EAAE,SAAS,GAAG,GAAG,CAAC,CAAC;IACrF,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,EAAE,SAAS,GAAG,IAAI,CAAC,CAAC;IAChF,QAAQ,CAAC,eAAe,IAAI,OAAO,GAAG,IAAI,CAAC;IAC3C,QAAQ,CAAC,mBAAmB,IAAI,OAAO,GAAG,IAAI,CAAC;IAC/C,QAAQ,CAAC,gBAAgB,IAAI,OAAO,GAAG,GAAG,CAAC;IAE3C,wGAAwG;IACxG,MAAM,WAAW,GAAG,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACvD,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,WAAW,GAAG,IAAI,CAAC,CAAC;IAC5E,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,GAAG,GAAG,CAAC,CAAC;IACvE,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,iBAAiB,EAAE,WAAW,GAAG,GAAG,CAAC,CAAC;IACnF,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;IACvE,QAAQ,CAAC,aAAa,IAAI,eAAe,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,WAAW,IAAI,eAAe,GAAG,IAAI,CAAC;IAC/C,QAAQ,CAAC,iBAAiB,IAAI,eAAe,GAAG,IAAI,CAAC;IACrD,QAAQ,CAAC,cAAc,IAAI,eAAe,GAAG,GAAG,CAAC;IAEjD,4DAA4D;IAC5D,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAChD,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;IACxE,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC;IAChE,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC;IAC3E,QAAQ,CAAC,eAAe,IAAI,QAAQ,GAAG,IAAI,CAAC;IAC5C,QAAQ,CAAC,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC;IAE1C,6EAA6E;IAC7E,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IACjD,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC;IAC9E,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,iBAAiB,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC;IACnF,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,kBAAkB,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC;IACpF,QAAQ,CAAC,eAAe,IAAI,SAAS,GAAG,GAAG,CAAC;IAC5C,QAAQ,CAAC,iBAAiB,IAAI,SAAS,GAAG,IAAI,CAAC;IAC/C,QAAQ,CAAC,kBAAkB,IAAI,SAAS,GAAG,IAAI,CAAC;IAEhD,wFAAwF;IACxF,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAClE,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,YAAY,GAAG,IAAI,CAAC,CAAC;IAC7E,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,EAAE,YAAY,GAAG,IAAI,CAAC,CAAC;IACnF,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,sBAAsB,EAAE,YAAY,GAAG,GAAG,CAAC,CAAC;IAC9F,QAAQ,CAAC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC;IACxD,QAAQ,CAAC,aAAa,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAC3D,QAAQ,CAAC,gBAAgB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9D,QAAQ,CAAC,sBAAsB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAEpE,2FAA2F;IAC3F,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC/D,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,GAAG,IAAI,CAAC,CAAC;IAC1E,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,qBAAqB,EAAE,SAAS,GAAG,GAAG,CAAC,CAAC;IACzF,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,GAAG,GAAG,CAAC,CAAC;IACrE,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,EAAE,SAAS,GAAG,IAAI,CAAC,CAAC;IAChF,QAAQ,CAAC,aAAa,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAC3D,QAAQ,CAAC,qBAAqB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IACnE,QAAQ,CAAC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IACzD,QAAQ,CAAC,gBAAgB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAE9D,4CAA4C;IAC5C,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AAC/B,CAAC;AAED,sCAAsC;AAEtC;;;GAGG;AACH,SAAS,UAAU,CAAC,MAA8B,EAAE,KAAa;IAC/D,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACjE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAA2B,EAC3B,MAA0B,EAC1B,OAA0D;IAE1D,MAAM,aAAa,GAAG,OAAO,EAAE,UAAU,KAAK,KAAK,CAAC,CAAC,eAAe;IACpE,MAAM,eAAe,GAAG,OAAO,EAAE,YAAY,KAAK,KAAK,CAAC,CAAC,eAAe;IAExE,mDAAmD;IACnD,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,gBAAgB,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,qCAAqC;IACrC,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IAED,kCAAkC;IAClC,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,iDAAiD;QACjD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;YACzC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAElB,IAAI,IAAY,CAAC;YACjB,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACZ,+CAA+C;gBAC/C,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;gBAC1D,YAAY,IAAI,IAAI,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,2CAA2C;gBAC3C,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;gBAC1D,YAAY,IAAI,IAAI,CAAC;YACvB,CAAC;YAED,SAAS,IAAI,IAAI,CAAC;YAClB,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QACtD,CAAC;QAED,YAAY,IAAI,YAAY,CAAC;QAC7B,YAAY,IAAI,YAAY,CAAC;QAC7B,WAAW,IAAI,SAAS,CAAC;QAEzB,mCAAmC;QACnC,iFAAiF;QACjF,MAAM,gBAAgB,GAAG,cAAc,GAAG,SAAS,CAAC;QACpD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,gBAAgB,CAAC,KAAK,CAAC,IAAI,gBAAgB,CAAC;YAC5C,gBAAgB,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,yDAAyD;QACzD,uEAAuE;QACvE,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnC,kCAAkC;gBAClC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC;gBAC5D,gBAAgB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,aAAa,EAAE,SAAS;YACxB,gBAAgB;YAChB,gBAAgB,EAAE,EAAE,GAAG,gBAAgB,EAAE;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,MAAM,YAAY,GAA2B,EAAE,CAAC;IAChD,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,YAAY,GAA2B,EAAE,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC;QACjD,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,WAAW,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;YAChD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YAClC,YAAY,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;YAChC,gBAAgB,IAAI,WAAW,CAAC;QAClC,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,4EAA4E;IAC5E,kFAAkF;IAClF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,gBAAgB,CAAC;IAExF,wBAAwB;IACxB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,eAAe,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,UAAU,CAAC;IACpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,aAAa,GAAG,YAAY,EAAE,CAAC;YACvC,YAAY,GAAG,KAAK,CAAC,aAAa,CAAC;YACnC,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,4EAA4E;IAC5E,MAAM,gBAAgB,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAChE,MAAM,eAAe,GAAG,OAAO,CAAC,QAAQ,EAAE,gBAAgB,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAErE,OAAO;QACL,QAAQ;QACR,MAAM;QACN,YAAY;QACZ,WAAW;QACX,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,YAAY;QACzB,UAAU;QACV,eAAe;QACf,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,0CAA0C;AAE1C;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAA2B,EAC3B,IAAS;IAET,wDAAwD;IACxD,MAAM,OAAO,GAAG,MAAM,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAE/C,kCAAkC;IAClC,MAAM,MAAM,GAAG,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAElD,mDAAmD;IACnD,OAAO,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE;QAC3C,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;KACnB,CAAC,CAAC;AACL,CAAC;AAED,2BAA2B;AAE3B;;;GAGG;AACH,MAAM,UAAU,2BAA2B,CACzC,kBAA0B,EAC1B,gBAAwB,EACxB,uBAA+B,EAC/B,WAAmB,EACnB,cAAsB,EACtB,WAAmB,EACnB,eAAuB;IAEvB,OAAO,yBAAyB,CAAC;QAC/B,kBAAkB;QAClB,gBAAgB;QAChB,uBAAuB;QACvB,WAAW;QACX,cAAc;QACd,WAAW;QACX,eAAe;KAChB,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CAAC,MAAiC;IACvE,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACzC,OAAO,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAiC,EACjC,IAAY,CAAC;IAEb,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC;SACrC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;SAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,OAA2B;IACrD,MAAM,WAAW,GAAuB;QACtC,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,EAAE;KACb,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,oBAAoB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC"}

package/dist/visual/index.d.ts

@@ -15,5 +15,7 @@ export * from "./ab-comparison.js";
 export * from "./distance-metrics.js";
 export * from "./perceptual-transport.js";
 export * from "./cognitive-transport.js";
+export * from "./cognitive-transport-chain.js";
+export * from "./cognitive-models.js";
 export * from "./attention-transport.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/visual/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH;;;;GAIG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/visual/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH;;;;GAIG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC;AACzC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,uBAAuB,CAAC;AACtC,cAAc,0BAA0B,CAAC"}

package/dist/visual/index.js

@@ -15,5 +15,7 @@ export * from "./ab-comparison.js";
 export * from "./distance-metrics.js";
 export * from "./perceptual-transport.js";
 export * from "./cognitive-transport.js";
+export * from "./cognitive-transport-chain.js";
+export * from "./cognitive-models.js";
 export * from "./attention-transport.js";
 //# sourceMappingURL=index.js.map

package/dist/visual/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/visual/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH;;;;GAIG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/visual/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH;;;;GAIG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC;AACzC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,uBAAuB,CAAC;AACtC,cAAc,0BAA0B,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "cbrowser",
-  "version": "18.40.0",
+  "version": "18.41.0",
   "type": "module",
   "description": "Cognitive browser automation that thinks like your users—and helps AI agents navigate too. Simulate real user cognition with abandonment detection, constitutional safety, chaos engineering, and UX friction discovery. Sites that pass CBrowser's cognitive tests are easier for both humans and AI agents to navigate.",
   "main": "dist/index.js",