cbrowser 20.2.2 → 21.0.1

package/dist/visual/ctc-reference.js

@@ -0,0 +1,376 @@
+/**
+ * The reference set totalCTC is ranked against, and the curve that ranks it.
+ *
+ * WHAT totalCTC IS, as of 21.x: a percentile. A page's raw transport cost for
+ * a persona, placed among the raw costs of real pages for the built-in
+ * personas. 0.5 is the pooled median of the reference; 0.9 is costlier than
+ * nine in ten (page, persona) pairs in it; 1 is at least as costly as the
+ * costliest one.
+ *
+ * Until 21.x it was a logistic of the raw cost with a hand-set slope (2.5) and
+ * centre (1.2). Neither number was tied to anything, and on real pages it used
+ * little of its range: at viewport scope half of all (page, persona) scores sat
+ * between 0.055 and 0.133 and the logistic's floor at raw 0 was 0.047, so "0.2"
+ * read as low while it was costlier than most real first screens
+ * (research/ctc-21-deltas.md). A percentile has no free constant to set; its
+ * scale is the reference set, which is named and shipped.
+ *
+ * THE REFERENCE STORES RAW MEASUREMENTS, NOT METRICS OR SCORES.
+ * src/data/ctc-reference-v2-*.ts holds what measurePageRaw measured on each
+ * real page (research/ctc-reference/crawl-v2.ts): counts, length histograms
+ * and geometry, before any normaliser. The curve is derived from them through
+ * deriveMetrics and the live chain, so a change to a chain constant OR to a
+ * page-metric normaliser moves the curve with it. The first reference
+ * (2026-10-22, research/ctc-reference/v1/) stored normalised metrics, so a
+ * changed normaliser could not reach it. The constants that decide what is
+ * counted at all (PAGE_METRICS_MEASURE_IDS) are recorded with the data, and a
+ * live value that differs is refused: a stored measurement cannot follow them.
+ * For the same reason every record must be the raw layout this build measures
+ * (RAW_PAGE_FORMAT, 2: prose counted once, language pickers not read as the
+ * page's script); decodeReferenceRaw refuses any other.
+ *
+ * WHAT IS IN IT. About 500 graded pages from three sampling frames (the v1
+ * brand list, a random draw from a dated Tranco top-sites list, government and
+ * nonprofit directories) and six page types (landing, form, search, article,
+ * help, cart), crawled direct first and through a residential proxy only where
+ * the direct attempt was blocked. Every attempted page is listed with its
+ * outcome (referenceOutcomes), graded or not.
+ *
+ * WEIGHTING. Every graded page counts once. The crawl's quotas, not the
+ * curve, balance frames and types: each frame stopped at about a third of the
+ * pages and each inner type at a cap, so the counts are near balance by
+ * construction, and "ranked among N real pages" stays literally true.
+ * Weighting cells equally would let a handful of cart pages carry as much
+ * weight as the landing pages and widen every interval for it.
+ *
+ * POOLED OVER PERSONAS, so persona differences survive the mapping. One curve
+ * per persona would rank every persona against itself: an elderly user and a
+ * power user on the same page would both land near their own median and the
+ * difference the tool exists to report would be gone.
+ *
+ * UNCERTAINTY. A different draw of real pages would place the same raw cost at
+ * a somewhat different percentile. bootstrapPercentileInterval measures that:
+ * it resamples PAGES (each with all its personas, since a page's personas are
+ * not independent draws) and reports, for any raw cost, the central interval
+ * of its percentile across the resamples. It says nothing about whether the
+ * chain's costs are right; only how firmly the yardstick is fixed.
+ *
+ * This module holds the data, the population and the curve arithmetic. The
+ * chain (cognitive-transport-chain.ts) builds and caches the curves, because
+ * only it can compute a raw cost; nothing here imports it.
+ *
+ * @copyright 2026 Alexandria Eden alexandria.shai.eden@gmail.com https://cbrowser.ai
+ * @license MIT
+ */
+import { brotliDecompressSync } from "node:zlib";
+import { CTC_REFERENCE_META, CTC_REFERENCE_PAGES, CTC_REFERENCE_RAW } from "../data/ctc-reference-v2-2026-10-24.js";
+import { BUILTIN_PERSONAS, ACCESSIBILITY_PERSONAS, EMOTIONAL_PERSONAS } from "../personas.js";
+import { bridgeCapacityTraits } from "./cognitive-models.js";
+import { RAW_PAGE_FORMAT, deriveMetrics } from "./cognitive-transport.js";
+import { param } from "./model-provenance.js";
+import { PAGE_METRICS_MEASURE_IDS } from "./provenance/page-metrics.js";
+const META = CTC_REFERENCE_META;
+const PAGES = CTC_REFERENCE_PAGES;
+/** Where the reference came from: everything about the dataset except the pages. */
+export const CTC_REFERENCE = Object.freeze({ ...META });
+/** Every attempted page with its outcome, graded or not, so the exclusions stay visible. */
+export function referenceOutcomes() {
+    return PAGES.map((p) => ({ ...p }));
+}
+let rawCache = null;
+/**
+ * Decode a reference's packed raw measurements (brotli JSON, base64) and
+ * check them: one record per graded page, each scope a record of the layout
+ * this build measures (RAW_PAGE_FORMAT). A record of another layout is
+ * refused, not derived: a format-1 record counts nested prose again and reads
+ * some language pickers as CJK, so ranking a live page against it would rank
+ * one measurement against another.
+ */
+/** What format 2 adds to format 1; a record without any of them is not format 2. */
+const FORMAT_2_FIELDS = ["prose", "proseNested", "proseInNav", "navGroupCount", "navLinks", "groupedLinks", "groupedLinksWithText", "choiceNested"];
+export function decodeReferenceRaw(packed, graded, id) {
+    const decoded = JSON.parse(brotliDecompressSync(Buffer.from(packed, "base64")).toString("utf8"));
+    if (decoded.length !== graded) {
+        throw new Error(`ctc reference ${id}: ${decoded.length} raw measurements for ${graded} graded pages`);
+    }
+    decoded.forEach((page, i) => {
+        for (const scope of META.scopes) {
+            const record = page[scope];
+            const format = record?.format;
+            if (format !== RAW_PAGE_FORMAT) {
+                throw new Error(`ctc reference ${id}: graded page ${i} ${scope} is raw format ${String(format)}; this build measures and ranks against format ${RAW_PAGE_FORMAT}. Re-crawl the reference (research/ctc-reference/crawl-v2.ts) rather than mixing layouts.`);
+            }
+            // Format 2 gained its nav totals, proseInNav and groupedLinksWithText
+            // before it left the branch it was made on, so an early format-2 record
+            // (crawled 2026-10-23 from fd28165, eaf3b36 or 711f0b4) carries the
+            // number without them: refused by its fields, not its number.
+            const missing = FORMAT_2_FIELDS.filter((k) => !(k in record));
+            if (missing.length) {
+                throw new Error(`ctc reference ${id}: graded page ${i} ${scope} is raw format ${RAW_PAGE_FORMAT} without ${missing.join(", ")}; re-crawl the reference (research/ctc-reference/crawl-v2.ts).`);
+            }
+        }
+    });
+    return decoded;
+}
+/**
+ * The graded pages' raw measurements, in outcome-list order, decoded once.
+ * Shipped brotli-compressed (base64 in a TS module, so it loads on every Node
+ * the package supports); the decoded count must equal the graded count.
+ */
+function rawPages() {
+    if (!rawCache) {
+        const graded = PAGES.filter((p) => p.outcome === "graded").length;
+        if (graded !== META.outcomes.graded) {
+            throw new Error(`ctc reference ${META.id}: ${graded} graded pages listed, meta says ${META.outcomes.graded}`);
+        }
+        rawCache = decodeReferenceRaw(CTC_REFERENCE_RAW, graded, META.id);
+    }
+    return rawCache;
+}
+/**
+ * Refuse to derive the reference under a measure-stage constant other than
+ * the one its pages were measured with. Reads each through param(), so a curve
+ * built under withProvenance records that it rests on them.
+ */
+function assertMeasuredWith() {
+    for (const id of PAGE_METRICS_MEASURE_IDS) {
+        const live = param(id);
+        const at = META.measureParams[id];
+        if (live !== at) {
+            throw new Error(`${id} is applied while a page is measured; the reference ${META.id} was measured with ${at}, not ${live}. A stored measurement cannot follow it: re-crawl the reference (research/ctc-reference/crawl-v2.ts) to change it.`);
+        }
+    }
+}
+/**
+ * The graded pages' raw measurements at one scope, in dataset order. Blocked,
+ * error, excluded and robots-disallowed pages are absent measurements and are
+ * never part of the reference: a bot challenge measures as a nearly empty
+ * page and would rank as the easiest page on the web.
+ */
+export function referenceRaw(scope) {
+    if (!META.scopes.includes(scope))
+        throw new Error(`ctc reference ${META.id} carries no ${scope} measurements`);
+    assertMeasuredWith();
+    return rawPages().map((p, i) => {
+        const m = p[scope];
+        if (!m || m.scope !== scope)
+            throw new Error(`ctc reference ${META.id}: graded page ${i} has no ${scope} measurement`);
+        return m;
+    });
+}
+/** The graded pages' metrics at one scope, derived from their raw measurements under the live constants. */
+export function referencePages(scope) {
+    return referenceRaw(scope).map(deriveMetrics);
+}
+/** The graded pages' records, in the order referenceRaw returns their measurements. */
+export function referenceGraded() {
+    return PAGES.filter((p) => p.outcome === "graded").map((p) => ({ ...p }));
+}
+/**
+ * The built-in human personas, each built the way cognitive_effort builds it
+ * with no site model: its cognitive traits, siteFamiliarity 0 (first visit),
+ * and the reading, pointing and attention capacities bridged from the formal
+ * models. Since 21.0 the chain does not read the siteFamiliarity trait: a
+ * visit's familiarity is the demand's e (DemandOptions), and the curve is built
+ * at e = 0. The trait stays at 0 for what else reads a persona's 29 traits
+ * (the persona distance). The same 25 the golden matrix pins (tests/fixtures/ctc-golden-matrix.ts,
+ * ROSTER and toolProfile); a test holds the two to each other.
+ */
+export function referencePopulation() {
+    const roster = { ...BUILTIN_PERSONAS, ...ACCESSIBILITY_PERSONAS, ...EMOTIONAL_PERSONAS };
+    return Object.entries(roster).map(([name, p]) => {
+        const traits = { ...(p.cognitiveTraits ?? {}) };
+        traits.siteFamiliarity = 0;
+        bridgeCapacityTraits(name, traits, p.accessibilityTraits);
+        return { name, traits };
+    });
+}
+let populationSize;
+/** How many personas the reference pools: the length of referencePopulation(), counted once. */
+export function referencePersonaCount() {
+    return (populationSize ??= referencePopulation().length);
+}
+export function percentileCurve(samples) {
+    const s = Float64Array.from(samples).sort();
+    const n = s.length;
+    for (const v of s)
+        if (!Number.isFinite(v))
+            throw new Error(`percentileCurve: sample ${v} is not finite`);
+    const xs = [];
+    const ps = [];
+    for (let i = 0; i < n;) {
+        let j = i;
+        while (j + 1 < n && s[j + 1] === s[i])
+            j++;
+        xs.push(s[i]);
+        ps.push((i + j) / 2 / (n - 1));
+        i = j + 1;
+    }
+    // One distinct value has no spread to rank against, and the only curve
+    // through it is a step.
+    if (xs.length < 2)
+        throw new Error(`percentileCurve: needs two distinct samples, got ${xs.length} from ${n}`);
+    ps[0] = 0;
+    ps[ps.length - 1] = 1;
+    return { xs: Float64Array.from(xs), ps: Float64Array.from(ps), samples: n };
+}
+/**
+ * The curve at x: 0 at or below the lowest sample, 1 at or above the highest,
+ * linear between knots. NaN in, NaN out, so a broken cost is not reported as
+ * a rank.
+ */
+export function percentileAt(curve, x) {
+    const { xs, ps } = curve;
+    if (Number.isNaN(x))
+        return Number.NaN;
+    const last = xs.length - 1;
+    if (x <= xs[0])
+        return 0;
+    if (x >= xs[last])
+        return 1;
+    // Largest k with xs[k] <= x; xs[0] <= x < xs[last] holds here.
+    let lo = 0, hi = last;
+    while (hi - lo > 1) {
+        const mid = (lo + hi) >> 1;
+        if (xs[mid] <= x)
+            lo = mid;
+        else
+            hi = mid;
+    }
+    return ps[lo] + ((ps[hi] - ps[lo]) * (x - xs[lo])) / (xs[hi] - xs[lo]);
+}
+/**
+ * The largest slope of the curve over [lo, hi]: its Lipschitz constant there.
+ * Outside the sampled range the curve is flat, so only segments meeting
+ * [lo, hi] count. With knots close together this can be large; it is the
+ * honest constant of a curve that follows the data.
+ */
+export function curveSlope(curve, lo = -Infinity, hi = Infinity) {
+    const { xs, ps } = curve;
+    let max = 0;
+    for (let k = 0; k + 1 < xs.length; k++) {
+        if (xs[k + 1] < lo || xs[k] > hi)
+            continue;
+        const slope = (ps[k + 1] - ps[k]) / (xs[k + 1] - xs[k]);
+        if (slope > max)
+            max = slope;
+    }
+    return max;
+}
+/** A small, fast, seeded generator (mulberry32): the same seed gives the same resamples on every run. */
+function mulberry32(seed) {
+    let a = seed >>> 0;
+    return () => {
+        a = (a + 0x6d2b79f5) >>> 0;
+        let t = a;
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+/** The type-7 quantile of sorted values (numpy's default), the inverse of percentileCurve. */
+function quantileSorted(sorted, q) {
+    const h = q * (sorted.length - 1);
+    const f = Math.floor(h);
+    const c = Math.min(sorted.length - 1, f + 1);
+    return sorted[f] + (h - f) * (sorted[c] - sorted[f]);
+}
+/**
+ * Bootstrap over PAGES. `costs` is page-major: page i's costs for every
+ * persona sit at [i * perPage, (i + 1) * perPage). A resample draws as many
+ * pages as there are, with replacement, and keeps each drawn page's costs for
+ * all personas together, because a page's personas share the page and are
+ * not independent draws. A grid cost's percentile in a resample is its
+ * mid-rank share of the resampled costs (below, plus half of the ties), which
+ * differs from the interpolated curve by at most one sample's share.
+ *
+ * Cost: grid x pages x replicates additions (101 x 500 x 1000 is about 50
+ * million), once per curve build.
+ */
+export function bootstrapPercentileInterval(costs, perPage, opts) {
+    const N = costs.length;
+    const n = N / perPage;
+    if (!Number.isInteger(n) || n < 2)
+        throw new Error(`bootstrapPercentileInterval: ${N} costs are not whole pages of ${perPage}`);
+    const B = opts.replicates;
+    const sorted = Float64Array.from(costs).sort();
+    // The grid: the pooled sample's quantiles at even steps, duplicates dropped.
+    const gridXs = [];
+    for (let g = 0; g < opts.grid; g++) {
+        const x = quantileSorted(sorted, g / (opts.grid - 1));
+        if (gridXs.length === 0 || x > gridXs[gridXs.length - 1])
+            gridXs.push(x);
+    }
+    const G = gridXs.length;
+    // Per page and grid cost: twice the costs below it plus the ties, so a sum
+    // over drawn pages divided by twice the sample size is the mid-rank share.
+    const D = new Int32Array(n * G);
+    const page = new Float64Array(perPage);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < perPage; j++)
+            page[j] = costs[i * perPage + j];
+        page.sort();
+        let below = 0;
+        for (let g = 0; g < G; g++) {
+            const x = gridXs[g];
+            while (below < perPage && page[below] < x)
+                below++;
+            let ties = 0;
+            while (below + ties < perPage && page[below + ties] === x)
+                ties++;
+            D[i * G + g] = 2 * below + ties;
+        }
+    }
+    const rng = mulberry32(opts.seed);
+    const F = new Float64Array(G * B);
+    const acc = new Int32Array(G);
+    const twoN = 2 * N;
+    for (let b = 0; b < B; b++) {
+        acc.fill(0);
+        for (let k = 0; k < n; k++) {
+            const off = Math.floor(rng() * n) * G;
+            for (let g = 0; g < G; g++)
+                acc[g] += D[off + g];
+        }
+        for (let g = 0; g < G; g++)
+            F[g * B + b] = acc[g] / twoN;
+    }
+    const lo = new Float64Array(G);
+    const hi = new Float64Array(G);
+    const tail = (1 - opts.level) / 2;
+    for (let g = 0; g < G; g++) {
+        const reps = F.subarray(g * B, (g + 1) * B).sort();
+        lo[g] = quantileSorted(reps, tail);
+        hi[g] = quantileSorted(reps, 1 - tail);
+    }
+    return { xs: Float64Array.from(gridXs), lo, hi, replicates: B, level: opts.level };
+}
+/**
+ * The interval at raw cost x, for the point estimate p = percentileAt(curve, x).
+ * Interpolated between grid costs; [0, 0] below the reference and [1, 1]
+ * above it; widened if needed to contain p, which the mid-rank resamples can
+ * miss by at most one sample's share. NaN in, [NaN, NaN] out.
+ */
+export function intervalAt(iv, x, p) {
+    if (Number.isNaN(x) || Number.isNaN(p))
+        return [Number.NaN, Number.NaN];
+    const { xs } = iv;
+    const last = xs.length - 1;
+    if (x < xs[0])
+        return [0, 0];
+    if (x > xs[last])
+        return [1, 1];
+    let k = 0, top = last;
+    while (top - k > 1) {
+        const mid = (k + top) >> 1;
+        if (xs[mid] <= x)
+            k = mid;
+        else
+            top = mid;
+    }
+    const t = top === k ? 0 : (x - xs[k]) / (xs[top] - xs[k]);
+    const lo = iv.lo[k] + t * (iv.lo[top] - iv.lo[k]);
+    const hi = iv.hi[k] + t * (iv.hi[top] - iv.hi[k]);
+    return [Math.min(lo, p), Math.max(hi, p)];
+}
+//# sourceMappingURL=ctc-reference.js.map

package/dist/visual/ctc-reference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ctc-reference.js","sourceRoot":"","sources":["../../src/visual/ctc-reference.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,wCAAwC,CAAC;AACpH,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC9F,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,aAAa,EAAwE,MAAM,0BAA0B,CAAC;AAChJ,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,wBAAwB,EAAE,MAAM,8BAA8B,CAAC;AAwDxE,MAAM,IAAI,GAAkB,kBAAkB,CAAC;AAC/C,MAAM,KAAK,GAAmC,mBAAmB,CAAC;AAElE,oFAAoF;AACpF,MAAM,CAAC,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;AAExD,4FAA4F;AAC5F,MAAM,UAAU,iBAAiB;IAC/B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,IAAI,QAAQ,GAA0D,IAAI,CAAC;AAE3E;;;;;;;GAOG;AACH,oFAAoF;AACpF,MAAM,eAAe,GAAG,CAAC,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,cAAc,EAAE,sBAAsB,EAAE,cAAc,CAAU,CAAC;AAE7J,MAAM,UAAU,kBAAkB,CAAC,MAAc,EAAE,MAAc,EAAE,EAAU;IAC3E,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAgD,CAAC;IAChJ,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,KAAK,OAAO,CAAC,MAAM,yBAAyB,MAAM,eAAe,CAAC,CAAC;IACxG,CAAC;IACD,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAwC,CAAC;YAClE,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,CAAC;YAC9B,IAAI,MAAM,KAAK,eAAe,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,IAAI,KAAK,kBAAkB,MAAM,CAAC,MAAM,CAAC,kDAAkD,eAAe,2FAA2F,CAAC,CAAC;YAC9P,CAAC;YACD,sEAAsE;YACtE,wEAAwE;YACxE,oEAAoE;YACpE,8DAA8D;YAC9D,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,MAAO,CAAC,CAAC,CAAC;YAC/D,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnB,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,IAAI,KAAK,kBAAkB,eAAe,YAAY,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;YACjM,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,OAAoE,CAAC;AAC9E,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ;IACf,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;QAClE,IAAI,MAAM,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,EAAE,KAAK,MAAM,mCAAmC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAChH,CAAC;QACD,QAAQ,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB;IACzB,KAAK,MAAM,EAAE,IAAI,wBAAwB,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,GAAG,EAAE,uDAAuD,IAAI,CAAC,EAAE,sBAAsB,EAAE,SAAS,IAAI,oHAAoH,CAAC,CAAC;QAChP,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB;IAC7C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,EAAE,eAAe,KAAK,eAAe,CAAC,CAAC;IAC/G,kBAAkB,EAAE,CAAC;IACrB,OAAO,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,EAAE,iBAAiB,CAAC,WAAW,KAAK,cAAc,CAAC,CAAC;QACvH,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,4GAA4G;AAC5G,MAAM,UAAU,cAAc,CAAC,KAAkB;IAC/C,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AAChD,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,eAAe;IAC7B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB;IACjC,MAAM,MAAM,GAAG,EAAE,GAAG,gBAAgB,EAAE,GAAG,sBAAsB,EAAE,GAAG,kBAAkB,EAGrF,CAAC;IACF,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QAC9C,MAAM,MAAM,GAAG,EAAE,GAAI,CAAC,CAAC,CAAC,eAAe,IAAI,EAAE,CAA4B,EAAE,CAAC;QAC5E,MAAM,CAAC,eAAe,GAAG,CAAC,CAAC;QAC3B,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC;QAC1D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,IAAI,cAAkC,CAAC;AAEvC,gGAAgG;AAChG,MAAM,UAAU,qBAAqB;IACnC,OAAO,CAAC,cAAc,KAAK,mBAAmB,EAAE,CAAC,MAAM,CAAC,CAAC;AAC3D,CAAC;AAsBD,MAAM,UAAU,eAAe,CAAC,OAA0B;IACxD,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,gBAAgB,CAAC,CAAC;IAC1G,MAAM,EAAE,GAAa,EAAE,CAAC;IACxB,MAAM,EAAE,GAAa,EAAE,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAI,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QAC3C,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,uEAAuE;IACvE,wBAAwB;IACxB,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,EAAE,CAAC,MAAM,SAAS,CAAC,EAAE,CAAC,CAAC;IAC9G,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACV,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACtB,OAAO,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,CAAS;IAC5D,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IACzB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACvC,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC5B,+DAA+D;IAC/D,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC;IACtB,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,EAAE,GAAG,GAAG,CAAC;;YACtB,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAsB,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,EAAE,GAAG,QAAQ;IAC9E,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IACzB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE;YAAE,SAAS;QAC3C,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,KAAK,GAAG,GAAG;YAAE,GAAG,GAAG,KAAK,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAoBD,yGAAyG;AACzG,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED,8FAA8F;AAC9F,SAAS,cAAc,CAAC,MAAyB,EAAE,CAAS;IAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAmB,EACnB,OAAe,EACf,IAAuE;IAEvE,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,iCAAiC,OAAO,EAAE,CAAC,CAAC;IAChI,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;IAC1B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,6EAA6E;IAC7E,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,OAAO,KAAK,GAAG,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,KAAK,EAAE,CAAC;YACnD,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,KAAK,GAAG,IAAI,GAAG,OAAO,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBAAE,IAAI,EAAE,CAAC;YAClE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;QAClC,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAC3D,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,EAAE,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACnC,EAAE,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACrF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,EAAsB,EAAE,CAAS,EAAE,CAAS;IACrE,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;IACxE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;IAClB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC;IACtB,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,CAAC,GAAG,GAAG,CAAC;;YACrB,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC"}

package/dist/visual/demand-laws.d.ts

@@ -0,0 +1,145 @@
+import type { MetricScope } from "./cognitive-transport.js";
+/**
+ * Fitts' index of difficulty, bits, in the Shannon form ID = log2(D / W + 1)
+ * (Soukoreff & MacKenzie 2004, section 3.3). W is floored at law.fitts.minWidth,
+ * where ID would otherwise be undefined.
+ */
+export declare function fittsIndexOfDifficulty(distance: number, width: number): number;
+/**
+ * Movement time, seconds, to acquire one target: MT = a + b ID, the regression
+ * MacKenzie & Buxton (1992) fit with the SMALLER-OF width. Predicted from the
+ * regression, not as ID / throughput, because the regression is what predicts
+ * time (Soukoreff & MacKenzie 2004).
+ */
+export declare function fittsMovementTime(distance: number, width: number): number;
+/** The width a two-dimensional target enters Fitts' law with: the smaller of its width and height (SMALLER-OF). */
+export declare function smallerOfWidth(width: number, height: number): number;
+export interface PointingTarget {
+    /** From where the pointer starts to the target's centre, CSS px. */
+    distance: number;
+    width: number;
+    height: number;
+}
+/**
+ * Seconds to acquire every target once: the sum of each target's movement
+ * time. `totalTargets` is the uncapped count when the targets given are the
+ * first N of it; the sum is then scaled by totalTargets / N, assuming the
+ * targets not given are as hard on average as those given (a definition).
+ */
+export declare function pointingSeconds(targets: readonly PointingTarget[], totalTargets?: number): number;
+/** A target's box, CSS px in document coordinates. */
+export interface TargetBox {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}
+/**
+ * Distance, CSS px, from a target's centre to the centre of the screen it is
+ * seen on, the pointer's assumed start (a definition). At viewport scope that
+ * screen is the one scrolled to; at full_page it is the screen-sized band, tiled
+ * from the top of the document, that holds the target's centre. The motor
+ * audits measure from the same point.
+ */
+export declare function distanceToScreenCentre(box: TargetBox, view: {
+    viewportWidth: number;
+    viewportHeight: number;
+    scrollY: number;
+}, scope: MetricScope): number;
+/**
+ * Seconds to find an item in a group of `items` by linear visual search, the
+ * novice limit of Cockburn et al.'s menu model: T = a + b n. A group of 0
+ * offers no choice and takes 0.
+ */
+export declare function noviceSearchSeconds(items: number): number;
+/** The expert limit of the same model, Hick-Hyman: T = a + b log2 n. cognitiveLoad's demand weights it by the run's siteFamiliarity e (Eq. 4); a first visit reads none of it. */
+export declare function hickHymanSeconds(items: number): number;
+export interface ChoiceGroup {
+    /** Items offered. */
+    size: number;
+    /**
+     * True when every item is its own yes/no decision (a checkbox group): the
+     * group costs `size` decisions of one item each, one item inspected by search
+     * and one bit by Hick-Hyman (a definition). False or absent: one decision
+     * among `size` items.
+     */
+    each?: boolean;
+}
+/**
+ * Seconds to make every choice the groups offer once: the sum over groups.
+ * `law` picks novice search (the first-visit demand) or Hick-Hyman (the expert limit, weighted by siteFamiliarity).
+ * `totalGroups` scales a capped list as in pointingSeconds.
+ */
+export declare function choosingSeconds(groups: readonly ChoiceGroup[], law?: "novice" | "expert", totalGroups?: number): number;
+/** Seconds to read `words` at `wpm` words per minute. */
+export declare function wordsReadingSeconds(words: number, wpm: number): number;
+/**
+ * Seconds to read `letters` letters of alphabetic text: Brysbaert's equation
+ * for a text, wpm = 238 x 4.6 / mean word length, is a constant rate of
+ * 238 x 4.6 letters per minute, so time depends on letters, not words.
+ */
+export declare function lettersReadingSeconds(letters: number): number;
+export interface ReadingCounts {
+    /** Letters of alphabetic words (on any page: the Latin words of an abjad or CJK page too). */
+    letters: number;
+    /** Abjad words, read at the Arabic rate. */
+    abjadWords?: number;
+    /**
+     * CJK characters, read at the Chinese character rate (260 wpm x 1.5
+     * characters per word). Japanese and Korean read at that rate is an
+     * assumption: Brysbaert's Table 5 has no Japanese row and counts Korean in
+     * space-separated words.
+     */
+    cjkChars?: number;
+}
+/** Seconds to read all of the prose once, at the reference rate of each script. */
+export declare function readingSeconds(counts: ReadingCounts): number;
+/**
+ * Seconds to read `labels` menu labels for the first time: the one-off cost
+ * Cockburn et al. kept out of their visual-search fit, charged per label in
+ * place of reading the labels' prose (law.reading.labelFirstRead, a hypothesis
+ * read off their Figure 2).
+ */
+export declare function labelReadingSeconds(labels: number): number;
+/**
+ * Seconds of mental preparation for `entrySteps` entry steps: KLM's M per
+ * step. One M per field is a definition borrowing KLM's operator; KLM places
+ * M by rules applied to a task method, which a page does not give.
+ */
+export declare function klmSeconds(entrySteps: number): number;
+/** A time as a demand, d = T / (T + tau): 0 at no work, 0.5 at the budget, below 1 for any finite time. */
+export declare function timeDemand(seconds: number): number;
+/**
+ * A rate as a capacity, c = r_p / (r_p + r_ref): 0.5 at the reference rate.
+ * Under timeDemand this is the share of the budget's reference-user work the
+ * persona gets through, so tau does not appear in it.
+ */
+export declare function rateCapacity(rate: number, referenceRate: number): number;
+/** Pointing capacity from a Fitts throughput, bits/s, against the reference mouse throughput. */
+export declare function pointingCapacity(throughput: number): number;
+/** Reading capacity from a silent reading rate, wpm, against the reference rate the reading time uses. */
+export declare function readingCapacity(wpm: number): number;
+/**
+ * The populations with a measured rate in provenance/laws.ts. Adults 65+, adults
+ * with ADHD and adults with intellectual disability have none.
+ */
+export type MeasuredPopulation = "motionImpaired" | "dyslexiaAdults" | "lowVisionCentralLoss" | "lowVisionIntactFields" | "aphasiaReadingImpaired";
+export interface MeasuredRate {
+    channel: "pointing" | "reading";
+    /**
+     * The population's measurement: bits/s for pointing, wpm for reading, or
+     * seconds for one text when `timed` (Stage C: aphasia, Webster et al. 2018).
+     */
+    rate: number;
+    /** What it is compared with, in the same unit. */
+    control: number;
+    /** True when the control group was measured in the same study and method; false when it is the reference law rate. */
+    sameStudyControl: boolean;
+    /** True when rate and control are times on the same text, so the faster group has the smaller number. */
+    timed: boolean;
+    /** The population's rate as a share of typical, the r_p / r_ref a capacity is built from: rate / control, or control / rate when timed. */
+    ratio: number;
+}
+/** A population's measured rate and its ratio to a control, from the registered sources. */
+export declare function measuredRate(population: MeasuredPopulation): MeasuredRate;
+//# sourceMappingURL=demand-laws.d.ts.map

package/dist/visual/demand-laws.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"demand-laws.d.ts","sourceRoot":"","sources":["../../src/visual/demand-laws.ts"],"names":[],"mappings":"AAiCA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAiC5D;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAG9E;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAEzE;AAED,mHAAmH;AACnH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAEpE;AAED,MAAM,WAAW,cAAc;IAC7B,oEAAoE;IACpE,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,EAAE,YAAY,GAAE,MAAuB,GAAG,MAAM,CAIjH;AAED,sDAAsD;AACtD,MAAM,WAAW,SAAS;IACxB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,GAAG,EAAE,SAAS,EACd,IAAI,EAAE;IAAE,aAAa,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EACxE,KAAK,EAAE,WAAW,GACjB,MAAM,CAMR;AAID;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGzD;AAED,kLAAkL;AAClL,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGtD;AAED,MAAM,WAAW,WAAW;IAC1B,qBAAqB;IACrB,IAAI,EAAE,MAAM,CAAC;IACb;;;;;OAKG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,EAAE,GAAG,GAAE,QAAQ,GAAG,QAAmB,EAAE,WAAW,GAAE,MAAsB,GAAG,MAAM,CAMhJ;AAID,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEtE;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED,MAAM,WAAW,aAAa;IAC5B,8FAA8F;IAC9F,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,mFAAmF;AACnF,wBAAgB,cAAc,CAAC,MAAM,EAAE,aAAa,GAAG,MAAM,CAI5D;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE1D;AAID;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAErD;AAID,2GAA2G;AAC3G,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAGlD;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CAGxE;AAED,iGAAiG;AACjG,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,0GAA0G;AAC1G,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;GAGG;AACH,MAAM,MAAM,kBAAkB,GAAG,gBAAgB,GAAG,gBAAgB,GAAG,sBAAsB,GAAG,uBAAuB,GAAG,wBAAwB,CAAC;AAEnJ,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,UAAU,GAAG,SAAS,CAAC;IAChC;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,kDAAkD;IAClD,OAAO,EAAE,MAAM,CAAC;IAChB,sHAAsH;IACtH,gBAAgB,EAAE,OAAO,CAAC;IAC1B,yGAAyG;IACzG,KAAK,EAAE,OAAO,CAAC;IACf,2IAA2I;IAC3I,KAAK,EAAE,MAAM,CAAC;CACf;AAUD,4FAA4F;AAC5F,wBAAgB,YAAY,CAAC,UAAU,EAAE,kBAAkB,GAAG,YAAY,CAOzE"}