cbrowser 20.2.2 → 21.0.0

package/dist/visual/cognitive-transport.d.ts

@@ -4,7 +4,7 @@
  * Treats persona cognitive profiles as probability measures in Wasserstein space.
  * Provides mathematically grounded operations:
  *
- * - Cognitive distance: W₁(personaA, personaB) — true distance between minds
+ * - Cognitive distance: generalized W₁(personaA, personaB) — trait shape AND level
  * - Barycenter: consensus cognitive profile from multiple personas
  * - Geodesic interpolation: principled persona blending preserving trait coupling
  * - Adversarial generation: worst-case persona via distributionally robust optimization
@@ -40,13 +40,21 @@ export interface OTCognitiveProfile {
     covariance: Float64Array[];
 }
 export interface CognitiveDistance {
-    /** Wasserstein-1 distance between trait distributions */
+    /**
+     * Generalized Wasserstein-1 distance between the two trait measures (shape
+     * AND level; see cognitiveDistance). In [0, distance.slackCost].
+     */
     w1: number;
-    /** Wasserstein-2 distance (Bures-Wasserstein for Gaussians) */
+    /** Wasserstein-2 distance (Bures-Wasserstein for Gaussians), on the simplex: shape only */
     w2: number;
-    /** Per-trait contribution to total distance */
+    /**
+     * Per-trait contribution to `w1`, plus one non-trait key, OVERALL_LEVEL_KEY
+     * ("overallLevel"): the slack bin's half of the cost of creating or destroying
+     * trait mass, exactly 0.5 * slackCost * |mean trait level A - mean trait
+     * level B|. The values sum to `w1`.
+     */
     traitContributions: Record<string, number>;
-    /** Sliced Wasserstein approximation */
+    /** Sliced Wasserstein-1 over uniform directions, exact (closed form), on the simplex: shape only */
     sliced: number;
 }
 export interface CognitiveBarycenter {
@@ -86,6 +94,28 @@ export interface AdversarialPersona {
 }
 export declare const COGNITIVE_TRAITS: readonly ["patience", "riskTolerance", "comprehension", "persistence", "resilience", "selfEfficacy", "emotionalContagion", "attributionStyle", "satisficing", "anchoringBias", "timeHorizon", "fearOfMissingOut", "interruptRecovery", "metacognitivePlanning", "proceduralFluency", "transferLearning", "informationForaging", "changeBlindness", "mentalModelFlexibility", "trustCalibration", "socialProofSensitivity", "authoritySensitivity", "workingMemory", "readingTendency", "curiosity", "siteFamiliarity", "readingCapacity", "motorCapacity", "sustainedAttention"];
 export type CognitiveTrait = typeof COGNITIVE_TRAITS[number];
+/** The 29 x 29 trait ground-cost matrix, exposed for tests (a copy). */
+export declare function traitGroundCostMatrix(): number[][];
+/**
+ * Key of the slack bin's share in `CognitiveDistance.traitContributions`. Not a
+ * trait: it is the part of the distance spent creating or destroying trait mass,
+ * i.e. the difference in overall level between the two profiles.
+ */
+export declare const OVERALL_LEVEL_KEY = "overallLevel";
+/** The generalized (trait + slack bin) cost matrix, exposed for tests (a copy). */
+export declare function traitGeneralizedCostMatrix(): number[][];
+/**
+ * A profile's trait measure for the generalized distance: d + 1 masses that sum
+ * to 1. Trait i carries t_i / d (t_i clamped to the schema range [0, 1], missing
+ * traits at distance.missingTraitDefault); the last entry is the slack bin,
+ * 1 - sum_i t_i / d, which holds the mass the traits do not.
+ *
+ * Unlike traitsToDistribution nothing is renormalised, so the absolute level
+ * survives: all traits 0.2 puts 0.2 on the traits and 0.8 in the slack bin, all
+ * traits 0.8 puts 0.8 and 0.2. No floor is applied either, because the solver
+ * accepts zero atoms (distance.simplexFloor belongs to the simplex encoding).
+ */
+export declare function traitsToLevelMeasure(traits: Record<string, number>): Float64Array;
 /**
  * Normalize trait values to a probability measure (simplex).
  * This is the fundamental operation: traits → distribution.
@@ -99,6 +129,96 @@ export declare function distributionToTraits(dist: Float64Array, traitScale?: nu
  * Build a OTCognitiveProfile from raw trait values.
  */
 export declare function buildOTCognitiveProfile(name: string, traits: Record<string, number>): OTCognitiveProfile;
+/**
+ * E|<x, theta>| / ||x|| for theta uniform on the unit sphere in `d`
+ * dimensions: Gamma(d/2) / (sqrt(pi) * Gamma((d + 1)/2)). The sliced
+ * Wasserstein-1 distance between two points is this times their Euclidean
+ * distance. Built from c_1 = 1, c_2 = 2/pi and c_(d+2) = c_d * d/(d + 1), so
+ * no gamma function is needed; for odd d it is a product of rationals.
+ * Exported for tests of the formula.
+ */
+export declare function sphereMeanAbsProjection(d: number): number;
+/**
+ * Distance between two cognitive profiles.
+ *
+ * `w1` is the exact GENERALIZED Wasserstein-1 distance between the two trait
+ * vectors (Piccoli & Rossi 2014, "Generalized Wasserstein distance and its
+ * application to transport equations with source"; the unbalanced-OT form with
+ * a per-unit cost for creating or destroying mass). Each profile is the measure
+ * that puts t_i / 29 on trait i, so its total mass is its mean trait level and
+ * is NOT normalised away. The distance is the cheapest way to turn one measure
+ * into the other when moving a unit of mass from trait i to trait j costs
+ * d(trait_i, trait_j) (traitGroundDistance) and creating or destroying a unit
+ * costs c = distance.slackCost (0.4, a registered hypothesis).
+ *
+ * It is computed by the standard slack-bin reduction (traitsToLevelMeasure):
+ * each measure gets one extra bin holding 1 - its trait mass, so both sum to 1,
+ * the slack bin is at cost c from every trait and 0 from itself, and the exact
+ * balanced W1 is solved on the 30 bins by min-cost flow (successive shortest
+ * paths; see exact-w1.ts). Mass sent from a trait to the other side's slack bin
+ * is destroyed, mass sent from the slack bin to a trait is created. The
+ * reduction equals the Piccoli-Rossi distance (with a = c, b = 1) whenever
+ * 2c >= the largest ground cost (0.8): a plan that both destroys at i and
+ * creates at j can then be replaced by transporting i -> j at no greater cost,
+ * so some optimum only destroys (or only creates) |mass_A - mass_B|, which the
+ * slack bins always have room for since both trait masses are at most 1. The
+ * same condition makes the 30-bin cost a metric, so `w1` is a metric on trait
+ * vectors: 0 exactly when the 29 values agree (after the [0, 1] clamp and the
+ * missing-trait default). tests/cognitive-distance-w1.test.ts checks the
+ * reduction against the Piccoli-Rossi LP solved by an independent simplex.
+ *
+ * Bounds, with mean_i over the 29 traits:
+ *   c * |mean_i t_A,i - mean_i t_B,i|  <=  w1  <=  c * mean_i |t_A,i - t_B,i|  <=  c.
+ * The lower bound is the mass imbalance, which can only be created or
+ * destroyed; the upper bound routes every difference through the slack bin.
+ * Proportional profiles are no longer at distance 0: all traits 0.2 versus all
+ * traits 0.8 is exactly 0.6 * c = 0.24 (both bounds meet). History: until
+ * 2026-10-21 this field was a weighted L1 that was not optimal transport (see
+ * exact-w1.ts); its exact replacement, shipped the same day, normalised both
+ * profiles to the simplex, and that pair was at 0 on every metric.
+ *
+ * `w1` is also positively homogeneous in the trait difference: moving every
+ * trait of A toward B by the same fraction scales the distance by that
+ * fraction (Kantorovich-Rubinstein: W1 under a metric cost depends only on the
+ * signed difference of the measures). So pushing a persona's traits further
+ * from another's never brings it closer.
+ *
+ * `w2` and `sliced` are UNCHANGED and still computed on the simplex
+ * (traitsToDistribution), so they remain shape-only: proportional profiles are
+ * at 0 on both.
+ *
+ * `traitContributions[t]` is the cost attributed to trait t under the optimal
+ * plan: half the cost of mass shipped OUT of t plus half the cost of mass
+ * shipped INTO t, i.e. 0.5 * (sum_j P[t][j] C(t,j) + sum_i P[i][t] C(i,t)) over
+ * all 30 bins. The slack bin's share is reported under OVERALL_LEVEL_KEY: half
+ * of every creation or destruction is charged to the trait it happened at and
+ * half to the overall level. Each unit of cost is split between the two
+ * endpoints it connects, so the contributions sum to `w1` exactly and are
+ * symmetric in the two profiles (swapping A and B transposes P and leaves every
+ * contribution unchanged). Mass that stays put (P[t][t]) costs 0 and
+ * contributes nothing.
+ *
+ * The optimal plan is often not unique (ties are common under a three-level
+ * cost), and one tie matters for the attribution: destroying a unit at trait i
+ * and creating one at trait j costs 2c = 0.8, exactly what moving it i -> j
+ * costs between unrelated domains. Left to the solver, a pure shape difference
+ * can be booked as a level difference: with exactW1's earlier end-node rule
+ * (same optimal costs) 211 of the 300 roster pairs did, by up to 0.017. The
+ * current solver happens not to (0 of 300 roster pairs, 0 of 21,000 random
+ * pairs, 2026-10-21), but nothing guarantees which tied plan it returns, so
+ * the plan is UNCROSSED after solving: wherever it both destroys at i and
+ * creates at j, that mass is routed i -> j directly, which costs
+ * C(i, j) <= 2c, so the plan stays optimal. With the old end-node rule put
+ * back, uncrossing alone brings all 300 pairs back to the identity below.
+ * The uncrossed plan creates or destroys exactly |mass_A - mass_B|, which makes
+ * the attribution unique where it matters:
+ *   overallLevel = 0.5 * c * |mean_i t_A,i - mean_i t_B,i|,
+ * half of what the level difference forces (the other half is charged to the
+ * traits where the mass is created or destroyed). Remaining ties among trait
+ * pairs are settled by solving the pair in a canonical order, so the
+ * attribution is deterministic and the same for (A, B) and (B, A). `w1` itself
+ * is unique.
+ */
 export declare function cognitiveDistance(profileA: OTCognitiveProfile, profileB: OTCognitiveProfile): CognitiveDistance;
 /**
  * Compute the Wasserstein barycenter of multiple cognitive profiles.
@@ -152,7 +272,6 @@ export declare function generateAdversarialPersonas(knownPersonas: OTCognitivePr
  *
  * The expectation distribution is derived from the persona's traits:
  * - High patience → expects slower information delivery (wider temporal spread)
- * - High comprehension → expects denser information
  * - attention / motor / text read the three BRIDGED capacities
  *   (sustainedAttention, motorCapacity, readingCapacity), so a caller must run
  *   bridgeCapacityTraits (visual/cognitive-models.ts) before building the
@@ -187,8 +306,9 @@ export declare function estimateCognitiveLoad(persona: OTCognitiveProfile, pageM
 };
 /**
  * Given a set of personas, find the N most different ones for maximum
- * test coverage. Uses greedy farthest-point sampling in Wasserstein space,
- * seeded with the two farthest-apart profiles.
+ * test coverage. Uses greedy farthest-point sampling under the generalized W1
+ * of cognitiveDistance (so a difference in overall level counts as well as one
+ * in profile shape), seeded with the two farthest-apart profiles.
  *
  * The seed used to be `profiles[0]` — whichever persona happened to be first in
  * the caller's array. Farthest-point traversal is seed-sensitive, so the same
@@ -282,9 +402,11 @@ export declare function measurePageGeometry(page: any, maxScreens?: number): Pro
  * Returns one metrics object per screen, in document order.
  */
 export declare function extractPerScreenMetrics(page: any, maxScreens?: number, geometry?: PageGeometry): Promise<Array<Awaited<ReturnType<typeof extractPageMetrics>>>>;
-export declare function extractPageMetrics(page: any, scope?: MetricScope, 
-/** Geometry already measured by the caller, so both derivations share one read. */
-geometry?: PageGeometry): Promise<{
+/**
+ * What extractPageMetrics returns: the PageMetrics the chain reads, plus the
+ * fields reported beside them.
+ */
+export interface ExtractedPageMetrics {
     informationDensity: number;
     visualComplexity: number;
     interactiveElementCount: number;
@@ -304,10 +426,321 @@ geometry?: PageGeometry): Promise<{
     /** Uncapped choice count, so the cap below is visible rather than silent. */
     choiceCountRaw: number;
     choiceCountCapped: boolean;
-}>;
+    /**
+     * Stage B: seconds of work for the reference user, from published laws
+     * (demand-laws.ts). The chain turns each into a demand against one time
+     * budget (computeDemandDistribution). See lawSecondsOf for what each covers.
+     */
+    pointingSeconds: number;
+    choosingSeconds: number;
+    readingSeconds: number;
+    procedureSeconds: number;
+    /**
+     * Stage C: the same choices by Hick-Hyman, the expert limit of the menu
+     * model (Cockburn, Gutwin & Greenberg 2007) whose novice limit is
+     * choosingSeconds. cognitiveLoad's demand reads (1 - e) choosingSeconds +
+     * e choosingSecondsExpert, e the run's siteFamiliarity.
+     */
+    choosingSecondsExpert: number;
+    /** Diagnostics beside the law times; no demand reads them. */
+    lawDiagnostics: LawDiagnostics;
+}
+/** What lawSecondsOf measured besides the law times. */
+export interface LawDiagnostics {
+    /** Mean Fitts index of difficulty over the stored targets, bits. */
+    meanFittsID: number;
+    /** Targets acquired (interactiveElements, uncapped). */
+    targets: number;
+    /** Entry steps the KLM time charges an M for. */
+    entrySteps: number;
+    /** Choice groups resolved, uncapped, plus the ungrouped links as one more when there are any. */
+    choiceGroups: number;
+    /** Links in no choice group, which form one more choice set. */
+    ungroupedLinks: number;
+    /**
+     * How ungroupedLinks was counted: `groupedLinks` (format 2: links -
+     * groupedLinks, each link once) or `navGroupSizes` (format 1: links minus the
+     * stored nav groups' sizes, where a link in nested groups may count twice).
+     */
+    ungroupedLinksFrom: "groupedLinks" | "navGroupSizes";
+    /**
+     * Menu labels read once each: the grouped links whose drawn text holds a
+     * letter or digit (groupedLinksWithText); an icon-only link has nothing to
+     * read. 0 for format 1, which has no in-group prose.
+     */
+    labels: number;
+    /** The part of readingSeconds that is the labels' first read (law.reading.labelFirstRead per label). */
+    labelSeconds: number;
+}
+/**
+ * A page as measured, before any normaliser: the counts every PageMetrics
+ * field is computed from, and the geometry a demand model needs beyond them
+ * (interactive targets, choice groups, text blocks). Plain numbers, strings
+ * and arrays, so it serialises as JSON and round-trips exactly.
+ *
+ * WHY IT EXISTS. extractPageMetrics used to count and normalise in one pass
+ * inside the page, so the only thing a caller could keep was the normalised
+ * 0-1 metric. The CTC reference set stored exactly that, and a registered
+ * normaliser (a midpoint, a weight, a cap) could not move the curve built from
+ * it: every stored page had the old value baked in. Now measurePageRaw counts,
+ * deriveMetrics normalises, and extractPageMetrics is the two in sequence,
+ * returning what it always returned (tests/page-metrics-golden.test.ts).
+ *
+ * WHICH CONSTANTS ARE APPLIED WHERE. The ids in PAGE_METRICS_MEASURE_IDS
+ * (provenance/page-metrics.ts) decide what is counted at all, so they are
+ * applied while measuring and a stored record cannot be re-derived under
+ * another value: the lazy-load walk, the colour sample, the prose length
+ * filter, script detection, and this record's own storage bounds. Every other
+ * pageMetrics constant is applied by deriveMetrics, the word, run and
+ * sentence-length thresholds included: they read the length histograms below
+ * rather than counts already cut at one threshold.
+ *
+ * FORMAT 2 (RAW_PAGE_FORMAT). Four things format 1 measured wrongly or not
+ * at all, fixed where they are measured because a stored record cannot be
+ * corrected later:
+ *   - Prose counted once. Format 1 took every element matching the prose
+ *     selector, so a p inside an li, an li inside a td or a p inside a
+ *     blockquote was counted once per matching ancestor (a nested menu many
+ *     times over). Format 2 counts the outermost matching element only, so
+ *     `text`, `textBlocks` and `prose` hold each visible character once.
+ *     Format 1's count survives as `proseNested`, three totals measured on
+ *     the same DOM, for comparison; nothing derives from it.
+ *   - A language picker is not the page's language. The key-element script
+ *     rule read the first nav, and www.w3.org's first nav lists its Japanese
+ *     and Chinese editions, so the page read as CJK. Text declared to be in
+ *     another language (lang, or a link's hreflang) is no longer key-element
+ *     text, and a nav that is a language picker is not "the nav".
+ *   - Menu labels apart from the prose (proseInNav): the prose that sits in
+ *     a nav or composite group, which the choosing law already reads.
+ *   - A choice in one group only, with whole nav totals. Format 1 counted a
+ *     nav's links, then a menubar inside it, then its submenus, so one link
+ *     sat in up to three groups, and its nav sizes stopped at the stored
+ *     list's 64 groups. Format 2 gives each choice to the outermost group
+ *     that offers it and stores navGroupCount, navLinks and groupedLinks
+ *     uncapped; format 1's group totals survive as `choiceNested`.
+ * deriveMetrics reads groupedLinks (the links in no group, for the choosing
+ * law) and none of the other new fields. It still accepts a format-1 record
+ * (RawPageMeasurementV1), which derives as format 2 does except choosing,
+ * whose ungrouped links come from the stored nav sizes, so the two can be
+ * compared.
+ */
+export interface RawPageMeasurement {
+    /** Version of this record's layout: RAW_PAGE_FORMAT. */
+    format: 2;
+    scope: MetricScope;
+    /** window.innerWidth, CSS px. */
+    viewportWidth: number;
+    /** From the shared PageGeometry. */
+    viewportHeight: number;
+    documentHeight: number;
+    pageScreens: number;
+    /** window.scrollY when measured. Boxes are in document coordinates; subtract it for viewport ones. */
+    scrollY: number;
+    /** Summed trimmed innerText length of every text element in scope (nested elements count their text again). */
+    textChars: number;
+    /** Elements matching the interactive selector, in scope. */
+    interactiveElements: number;
+    /** a[href] in scope. */
+    links: number;
+    /** option elements inside the selects in scope. */
+    selectOptions: number;
+    /** Elements in scope with a running CSS animation. */
+    runningAnimations: number;
+    /** [autoplay] elements in scope. */
+    autoplayElements: number;
+    /** An element whose class names a carousel, slider or swiper, anywhere in the document. */
+    carousel: boolean;
+    /** Breadcrumb links, anywhere in the document. */
+    breadcrumbLinks: number;
+    /** Distinct colours among the body and the first visual.colourSample visible elements. */
+    colours: number;
+    /** Laid-out elements in scope. */
+    visibleElements: number;
+    /** img, svg and role=img elements in scope. */
+    images: number;
+    /** The visible prose, each character once, tokenised for its script. */
+    text: RawText;
+    /**
+     * The visible prose's totals, uncapped: trimmed characters and
+     * whitespace-separated words over the outermost prose elements (the
+     * textBlocks, all of them). `textBlockCount` is their number.
+     */
+    prose: {
+        chars: number;
+        words: number;
+    };
+    /**
+     * The part of `prose` inside a nav or ARIA composite group in scope (the
+     * groups choiceGroups counts, each choice once): menu labels, which the
+     * choosing law already reads as choices. A block a group holds counts
+     * whole; a block that holds groups (a layout td around a nav) counts their
+     * text. chars and words as `prose` counts them; letters, abjadWords and
+     * cjkChars in the reading law's units, tokenised as `text` is, so
+     * prose minus proseInNav is the prose outside every group.
+     */
+    proseInNav: {
+        chars: number;
+        words: number;
+        letters: number;
+        abjadWords: number;
+        cjkChars: number;
+    };
+    /**
+     * The same totals as format 1 counted them: every element matching the
+     * prose selector, nested ones again (elements, characters, words). For
+     * comparison only; nothing derives from it.
+     */
+    proseNested: {
+        elements: number;
+        chars: number;
+        words: number;
+    };
+    /** Element kinds, indexed by `boxes` and `choiceGroups`: tag, `:type` for inputs, `[role]` when set. */
+    kinds: string[];
+    /**
+     * The interactive elements in scope, five numbers each: kind index, x, y,
+     * width, height (CSS px, document coordinates, rounded). The first
+     * pageMetrics.raw.maxBoxes in document order; interactiveElements is the
+     * uncapped count.
+     */
+    boxes: number[];
+    /**
+     * Choice groups in scope, two numbers each: kind index and size. A nav's
+     * visible links, a select's options, a named radio or checkbox group (an
+     * unnamed one is a group of one), a menu, listbox, tablist or radiogroup's
+     * visible items. The first pageMetrics.raw.maxChoiceGroups, navs first,
+     * then selects, toggles and the ARIA composites, each in document order.
+     *
+     * Each choice is in one group only: the outermost nav or composite that
+     * offers it (an item and the link inside it are one choice). A menubar
+     * inside a nav, its submenus, or a nav inside a navigation region keep only
+     * what no outer group took, and are no group when that is nothing.
+     */
+    choiceGroups: number[];
+    /** Every group, uncapped: the length choiceGroups would have without its bound. */
+    choiceGroupCount: number;
+    /** Nav groups (nav, role=navigation) left with at least one link of their own, uncapped. */
+    navGroupCount: number;
+    /** The links those nav groups hold, each once, uncapped: the sum of every nav size, stored or not. */
+    navLinks: number;
+    /** Visible links inside any choice group (nav or composite), each once, uncapped; `links - groupedLinks` are in none. */
+    groupedLinks: number;
+    /**
+     * Of groupedLinks, those whose drawn text holds at least one letter or
+     * digit (any script: a Latin letter, an abjad word, a CJK character, a page
+     * number), uncapped. Text a sighted user does not see is left out:
+     * aria-label, title and alt, an svg title, and text hidden, transparent,
+     * sub-pixel or clipped away inside the link (a visually-hidden span).
+     * groupedLinks minus this is the icon-only grouped links.
+     */
+    groupedLinksWithText: number;
+    /**
+     * The group totals as format 1 counted them: every nav, select, toggle and
+     * composite group with a choice, nested groups counting their choices again.
+     * For comparison only; nothing derives from it.
+     */
+    choiceNested: {
+        groups: number;
+        items: number;
+    };
+    /**
+     * The prose elements the readability metrics read, eight numbers each:
+     * characters, whitespace-separated words, CJK characters, sentences
+     * (non-empty fragments between . ! ? and their CJK and Arabic forms), font
+     * size px, line height px (0 when `normal`), width and height px. Sizes to
+     * half a pixel, boxes rounded. The first pageMetrics.raw.maxTextBlocks.
+     *
+     * A block is an OUTERMOST prose element: one that matches the prose
+     * selector, is laid out in scope and longer than prose.lengthAbove, and has
+     * no such element above it. Its text includes everything nested inside it,
+     * so its font size and box are the outer element's. At viewport scope an
+     * outer element that is partly on screen brings all of its text, as every
+     * element-level count here does.
+     */
+    textBlocks: number[];
+    textBlockCount: number;
+}
+/** The layout measurePageRaw writes, and the only one the CTC reference loads. */
+export declare const RAW_PAGE_FORMAT = 2;
+/**
+ * A format-1 record (2026-10-22): nested prose counted per element, the
+ * first-nav script rule, nested choice groups counted again, no prose or nav
+ * totals. deriveMetrics still derives it,
+ * exactly as it did then, so format-1 data can be compared with format 2.
+ */
+export type RawPageMeasurementV1 = Omit<RawPageMeasurement, "format" | "prose" | "proseNested" | "proseInNav" | "navGroupCount" | "navLinks" | "groupedLinks" | "groupedLinksWithText" | "choiceNested"> & {
+    format: 1;
+};
+/** The visible prose of a RawPageMeasurement, as length histograms rather than threshold counts. */
+export interface RawText {
+    script: 'alphabetic' | 'cjk' | 'abjad';
+    /**
+     * [length, count] pairs, exact. alphabetic: every word, letters only.
+     * abjad: the words with no abjad letter. cjk: the words starting with a
+     * Latin letter, as written.
+     */
+    wordLengths: Array<[number, number]>;
+    /** abjad only: the abjad words, [length, count] pairs, exact. */
+    abjadWordLengths: Array<[number, number]>;
+    /** cjk only: CJK characters in the prose. */
+    cjkChars: number;
+    /** cjk only: maximal runs of CJK characters, [length, count]; lengths at or above lengthBins share that bin. */
+    cjkRunLengths: Array<[number, number]>;
+    /** Distinct words (cjk: distinct CJK bigrams plus Latin words). */
+    uniqueWords: number;
+    /** The script's sentence split, [trimmed length, count]; lengths at or above lengthBins share that bin. */
+    fragmentLengths: Array<[number, number]>;
+    /** pageMetrics.raw.lengthBins when measured: a threshold must sit below it to be re-derived. */
+    lengthBins: number;
+}
+/**
+ * Measure the page: counts and geometry, no normaliser (RawPageMeasurement).
+ * The scope decides which elements count; at full_page the page is walked
+ * first so lazy content exists to be counted.
+ */
+export declare function measurePageRaw(page: any, scope?: MetricScope, 
+/** Geometry already measured by the caller, so both derivations share one read. */
+geometry?: PageGeometry): Promise<RawPageMeasurement>;
+/**
+ * Stage B's four law times for a raw page measurement, in seconds for the
+ * reference user, with what they rest on. Everything in scope, once
+ * (research/stage-b-design.md, decision 1):
+ *
+ *   pointing   every interactive box acquired once: Fitts, SMALLER-OF width,
+ *              from the centre of the screen it is seen on; the stored boxes'
+ *              sum scaled to interactiveElements when the box list is capped.
+ *   choosing   every choice group resolved once by novice linear search
+ *              (Cockburn et al. 2007); a checkbox group is one yes/no per box;
+ *              links in no group form one more set. Groups beyond the stored
+ *              ones are scaled to choiceGroupCount. choosingSecondsExpert is
+ *              the same groups by Hick-Hyman, the menu model's expert limit
+ *              (Stage C: cognitiveLoad's demand interpolates the two by the
+ *              run's siteFamiliarity, Cockburn et al.'s Eq. 4).
+ *   reading    the prose outside every group read once at Brysbaert's rate
+ *              (letters of the alphabetic words, abjad words, CJK
+ *              characters; format 2 counts each character once), plus a
+ *              first read per menu label: law.reading.labelFirstRead per
+ *              grouped link with visible text (an icon-only link has nothing
+ *              to read), which the novice search above leaves out
+ *              (Cockburn et al. fitted it without that one-off cost). Format
+ *              1 has no in-group prose, so it reads all of its prose and
+ *              charges no label.
+ *   procedure  KLM's M per entry step: an entry field (ENTRY_INPUT_TYPES,
+ *              textarea, select) or a radio or checkbox group.
+ */
+export declare function lawSecondsOf(raw: RawPageMeasurement | RawPageMeasurementV1): Pick<ExtractedPageMetrics, "pointingSeconds" | "choosingSeconds" | "choosingSecondsExpert" | "readingSeconds" | "procedureSeconds" | "lawDiagnostics">;
+export declare function deriveMetrics(raw: RawPageMeasurement | RawPageMeasurementV1): ExtractedPageMetrics;
+/**
+ * Page metrics of a live page: measurePageRaw, then deriveMetrics. Callers
+ * that keep the measurement (the CTC reference crawl) call the two halves.
+ */
+export declare function extractPageMetrics(page: any, scope?: MetricScope, 
+/** Geometry already measured by the caller, so both derivations share one read. */
+geometry?: PageGeometry): Promise<ExtractedPageMetrics>;
 /**
  * Compute the full pairwise distance matrix between personas.
- * Returns a symmetric matrix where entry [i][j] = W₁(persona_i, persona_j).
+ * Returns a symmetric matrix where entry [i][j] = cognitiveDistance(persona_i,
+ * persona_j).w1, the generalized W₁ (shape and level; see cognitiveDistance).
  */
 export declare function cognitiveDistanceMatrix(profiles: OTCognitiveProfile[]): {
     matrix: number[][];

package/dist/visual/cognitive-transport.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cognitive-transport.d.ts","sourceRoot":"","sources":["../../src/visual/cognitive-transport.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,MAAM,WAAW,kBAAkB;IACjC,yBAAyB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,sEAAsE;IACtE,YAAY,EAAE,YAAY,CAAC;IAC3B;;;;;OAKG;IACH,UAAU,EAAE,MAAM,CAAC;IACnB,yDAAyD;IACzD,UAAU,EAAE,YAAY,EAAE,CAAC;CAC5B;AAED,MAAM,WAAW,iBAAiB;IAChC,yDAAyD;IACzD,EAAE,EAAE,MAAM,CAAC;IACX,+DAA+D;IAC/D,EAAE,EAAE,MAAM,CAAC;IACX,+CAA+C;IAC/C,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,uCAAuC;IACvC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,mBAAmB;IAClC,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,6BAA6B;IAC7B,YAAY,EAAE,YAAY,CAAC;IAC3B,kDAAkD;IAClD,YAAY,EAAE,MAAM,CAAC;IACrB,yCAAyC;IACzC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,yDAAyD;IACzD,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,0DAA0D;IAC1D,CAAC,EAAE,MAAM,CAAC;IACV,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,gCAAgC;IAChC,YAAY,EAAE,YAAY,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,0CAA0C;IAC1C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,0CAA0C;IAC1C,cAAc,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,YAAY,EAAE,MAAM,CAAC;IACrB,uCAAuC;IACvC,eAAe,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAiBD,eAAO,MAAM,gBAAgB,kjBAyBnB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC;AAmE7D;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,YAAY,CAUjF;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,YAAY,EAClB,UAAU,CAAC,EAAE,MAAM,GAClB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAyBxB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,kBAAkB,CAoBxG;AA6BD,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,kBAAkB,GAAG,iBAAiB,CAqE/G;AAID;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,OAAO,CAAC,EAAE,MAAM,EAAE,GACjB,mBAAmB,CA6CrB;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,kBAAkB,EAC5B,QAAQ,EAAE,kBAAkB,EAC5B,SAAS,GAAE,MAAU,GACpB,aAAa,EAAE,CA6BjB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,kBAAkB,EAC5B,QAAQ,EAAE,kBAAkB,EAC5B,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,EAClD,UAAU,GAAE,MAAW,GACtB,aAAa,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAclC;AAID;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,2BAA2B,CACzC,aAAa,EAAE,kBAAkB,EAAE,EACnC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,EAClD,OAAO,GAAE,MAAY,GACpB,kBAAkB,EAAE,CAuEtB;AAID;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,kBAAkB,EAC3B,WAAW,EAAE;IACX,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,uBAAuB,EAAE,MAAM,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;CACzB,GACA;IACD,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B,CAqEA;AAID;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,yBAAyB,CACvC,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,CAAC,EAAE,MAAM,GACR,kBAAkB,EAAE,CA0CtB;AAED;;;GAGG;AACH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,cAAc,EAAE,MAAM,CAAC;IACvB,mEAAmE;IACnE,cAAc,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,WAAW,EAAE,MAAM,CAAC;IACpB,kFAAkF;IAClF,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;GAKG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,GAAG,EAAE,UAAU,SAAK,GAAG,OAAO,CAAC,YAAY,CAAC,CAW3F;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,GAAG,EACT,UAAU,SAAK,EACf,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAyDhE;AAED,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,GAAG,EACT,KAAK,GAAE,WAAwB;AAC/B,mFAAmF;AACnF,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC;IACT,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,uBAAuB,EAAE,MAAM,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IAExB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,YAAY,GAAG,KAAK,GAAG,OAAO,CAAC;IAC7C,KAAK,EAAE,WAAW,CAAC;IACnB,uEAAuE;IACvE,WAAW,EAAE,MAAM,CAAC;IACpB,6EAA6E;IAC7E,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,OAAO,CAAC;CAC5B,CAAC,CAmVD;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,kBAAkB,EAAE,GAC7B;IAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAazC"}
+{"version":3,"file":"cognitive-transport.d.ts","sourceRoot":"","sources":["../../src/visual/cognitive-transport.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAWH,MAAM,WAAW,kBAAkB;IACjC,yBAAyB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,sEAAsE;IACtE,YAAY,EAAE,YAAY,CAAC;IAC3B;;;;;OAKG;IACH,UAAU,EAAE,MAAM,CAAC;IACnB,yDAAyD;IACzD,UAAU,EAAE,YAAY,EAAE,CAAC;CAC5B;AAED,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,EAAE,EAAE,MAAM,CAAC;IACX,2FAA2F;IAC3F,EAAE,EAAE,MAAM,CAAC;IACX;;;;;OAKG;IACH,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,oGAAoG;IACpG,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,mBAAmB;IAClC,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,6BAA6B;IAC7B,YAAY,EAAE,YAAY,CAAC;IAC3B,kDAAkD;IAClD,YAAY,EAAE,MAAM,CAAC;IACrB,yCAAyC;IACzC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,yDAAyD;IACzD,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,0DAA0D;IAC1D,CAAC,EAAE,MAAM,CAAC;IACV,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,gCAAgC;IAChC,YAAY,EAAE,YAAY,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,0CAA0C;IAC1C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,0CAA0C;IAC1C,cAAc,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,YAAY,EAAE,MAAM,CAAC;IACrB,uCAAuC;IACvC,eAAe,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAiBD,eAAO,MAAM,gBAAgB,kjBAyBnB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC;AAiG7D,wEAAwE;AACxE,wBAAgB,qBAAqB,IAAI,MAAM,EAAE,EAAE,CAElD;AAED;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,iBAAiB,CAAC;AAmChD,mFAAmF;AACnF,wBAAgB,0BAA0B,IAAI,MAAM,EAAE,EAAE,CAEvD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,YAAY,CAajF;AAID;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,YAAY,CAgBjF;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,YAAY,EAClB,UAAU,CAAC,EAAE,MAAM,GAClB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAyBxB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,kBAAkB,CAsBxG;AAID;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAKzD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgFG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,kBAAkB,GAAG,iBAAiB,CAuF/G;AAID;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,OAAO,CAAC,EAAE,MAAM,EAAE,GACjB,mBAAmB,CA6CrB;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,kBAAkB,EAC5B,QAAQ,EAAE,kBAAkB,EAC5B,SAAS,GAAE,MAAU,GACpB,aAAa,EAAE,CA6BjB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,kBAAkB,EAC5B,QAAQ,EAAE,kBAAkB,EAC5B,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,EAClD,UAAU,GAAE,MAAW,GACtB,aAAa,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAclC;AAID;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,2BAA2B,CACzC,aAAa,EAAE,kBAAkB,EAAE,EACnC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,EAClD,OAAO,GAAE,MAAY,GACpB,kBAAkB,EAAE,CAuEtB;AAID;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,kBAAkB,EAC3B,WAAW,EAAE;IACX,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,uBAAuB,EAAE,MAAM,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;CACzB,GACA;IACD,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B,CAwEA;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,yBAAyB,CACvC,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,CAAC,EAAE,MAAM,GACR,kBAAkB,EAAE,CA0CtB;AAED;;;GAGG;AACH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,cAAc,EAAE,MAAM,CAAC;IACvB,mEAAmE;IACnE,cAAc,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,WAAW,EAAE,MAAM,CAAC;IACpB,kFAAkF;IAClF,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;GAKG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,GAAG,EAAE,UAAU,SAAK,GAAG,OAAO,CAAC,YAAY,CAAC,CAW3F;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,GAAG,EACT,UAAU,SAAK,EACf,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CA+EhE;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACnC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,uBAAuB,EAAE,MAAM,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IAExB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,YAAY,GAAG,KAAK,GAAG,OAAO,CAAC;IAC7C,KAAK,EAAE,WAAW,CAAC;IACnB,uEAAuE;IACvE,WAAW,EAAE,MAAM,CAAC;IACpB,6EAA6E;IAC7E,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,OAAO,CAAC;IAC3B;;;;OAIG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,qBAAqB,EAAE,MAAM,CAAC;IAC9B,8DAA8D;IAC9D,cAAc,EAAE,cAAc,CAAC;CAChC;AAED,wDAAwD;AACxD,MAAM,WAAW,cAAc;IAC7B,oEAAoE;IACpE,WAAW,EAAE,MAAM,CAAC;IACpB,wDAAwD;IACxD,OAAO,EAAE,MAAM,CAAC;IAChB,iDAAiD;IACjD,UAAU,EAAE,MAAM,CAAC;IACnB,iGAAiG;IACjG,YAAY,EAAE,MAAM,CAAC;IACrB,gEAAgE;IAChE,cAAc,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,kBAAkB,EAAE,cAAc,GAAG,eAAe,CAAC;IACrD;;;;OAIG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,wGAAwG;IACxG,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,MAAM,WAAW,kBAAkB;IACjC,wDAAwD;IACxD,MAAM,EAAE,CAAC,CAAC;IACV,KAAK,EAAE,WAAW,CAAC;IACnB,iCAAiC;IACjC,aAAa,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,sGAAsG;IACtG,OAAO,EAAE,MAAM,CAAC;IAChB,+GAA+G;IAC/G,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,mBAAmB,EAAE,MAAM,CAAC;IAC5B,wBAAwB;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,mDAAmD;IACnD,aAAa,EAAE,MAAM,CAAC;IACtB,sDAAsD;IACtD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oCAAoC;IACpC,gBAAgB,EAAE,MAAM,CAAC;IACzB,2FAA2F;IAC3F,QAAQ,EAAE,OAAO,CAAC;IAClB,kDAAkD;IAClD,eAAe,EAAE,MAAM,CAAC;IACxB,0FAA0F;IAC1F,OAAO,EAAE,MAAM,CAAC;IAChB,kCAAkC;IAClC,eAAe,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,IAAI,EAAE,OAAO,CAAC;IACd;;;;OAIG;IACH,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACxC;;;;;;;;OAQG;IACH,UAAU,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACpG;;;;OAIG;IACH,WAAW,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAChE,wGAAwG;IACxG,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;OAKG;IACH,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;;;;;;;;;OAWG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,mFAAmF;IACnF,gBAAgB,EAAE,MAAM,CAAC;IACzB,4FAA4F;IAC5F,aAAa,EAAE,MAAM,CAAC;IACtB,sGAAsG;IACtG,QAAQ,EAAE,MAAM,CAAC;IACjB,yHAAyH;IACzH,YAAY,EAAE,MAAM,CAAC;IACrB;;;;;;;OAOG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,YAAY,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAChD;;;;;;;;;;;;;OAaG;IACH,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,kFAAkF;AAClF,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC;;;;;GAKG;AACH,MAAM,MAAM,oBAAoB,GAAG,IAAI,CAAC,kBAAkB,EAAE,QAAQ,GAAG,OAAO,GAAG,aAAa,GAAG,YAAY,GAAG,eAAe,GAAG,UAAU,GAAG,cAAc,GAAG,sBAAsB,GAAG,cAAc,CAAC,GAAG;IAAE,MAAM,EAAE,CAAC,CAAA;CAAE,CAAC;AAEzN,oGAAoG;AACpG,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,YAAY,GAAG,KAAK,GAAG,OAAO,CAAC;IACvC;;;;OAIG;IACH,WAAW,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACrC,iEAAiE;IACjE,gBAAgB,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC1C,6CAA6C;IAC7C,QAAQ,EAAE,MAAM,CAAC;IACjB,gHAAgH;IAChH,aAAa,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,2GAA2G;IAC3G,eAAe,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACzC,gGAAgG;IAChG,UAAU,EAAE,MAAM,CAAC;CACpB;AAuDD;;;;GAIG;AACH,wBAAsB,cAAc,CAClC,IAAI,EAAE,GAAG,EACT,KAAK,GAAE,WAAwB;AAC/B,mFAAmF;AACnF,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,kBAAkB,CAAC,CAiiB7B;AAiCD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,kBAAkB,GAAG,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,EAAE,iBAAiB,GAAG,iBAAiB,GAAG,uBAAuB,GAAG,gBAAgB,GAAG,kBAAkB,GAAG,gBAAgB,CAAC,CA8EnO;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,kBAAkB,GAAG,oBAAoB,GAAG,oBAAoB,CA+JlG;AAED;;;GAGG;AACH,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,GAAG,EACT,KAAK,GAAE,WAAwB;AAC/B,mFAAmF;AACnF,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,oBAAoB,CAAC,CAE/B;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,kBAAkB,EAAE,GAC7B;IAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAazC"}