universal-physics-tensor 0.47.1 → 1.0.2

package/dist/atlas/oscillators/position-translation.js

@@ -0,0 +1,254 @@
+/**
+ * `ab-pendulum-linear`'s declared translation from its bound's quantity, the
+ * relative period error ε, into an UPPER BOUND on the pointwise position error
+ * |θ(t) − θ_lin(t)|, in rad.
+ *
+ * Both motions start from rest at θ0. The pendulum is θ(t) = F(φ), φ = 2πt/T,
+ * with the classical Fourier series of the elliptic solution
+ *
+ *   F(φ) = Σ_{n≥0} (−1)ⁿ aₙ cos((2n+1)φ),  aₙ = 8 q^{n+½} / ((2n+1)(1 + q^{2n+1})),
+ *
+ * q the nome of k = sin(θ0/2); F(0) = θ0 = Σ (−1)ⁿ aₙ. The linear motion is
+ * θ0 cos φ_lin, φ_lin = 2πt/T0. Splitting at θ0 cos φ,
+ *
+ *   |θ − θ_lin| ≤ |F(φ) − θ0 cos φ| + θ0 |cos φ − cos φ_lin|
+ *              ≤ 2 Σ_{n≥1} aₙ + 2θ0 |sin(Δφ/2)|,
+ *
+ * because F(φ) − θ0 cos φ = Σ_{n≥1} (−1)ⁿ aₙ (cos((2n+1)φ) − cos φ). With
+ * aₙ ≤ (8/3) q^{n+½} for n ≥ 1 the first term is at most
+ * W̄ = (16/3) q^{3/2}/(1 − q) ≈ θ0³/96, and Δφ = 2π(t/T0) ε/(1+ε) is the
+ * exact phase lead of `phase-translation.ts`. So
+ *
+ *   B(t) = W̄ + 2θ0 sin(min(Δφ(t), π)/2)
+ *
+ * bounds the error at every t; the clamp at π keeps B non-decreasing in t and
+ * is still a bound, since |cos a − cos b| ≤ 2. It is rigorous GIVEN the
+ * Fourier series, which is quoted, not derived here. Witness W7xs checks the
+ * series against RK4 over one period at each θ0 of a grid across the domain;
+ * that is a check at those points, not a derivation.
+ *
+ * B is an upper bound, not the error: past its horizon the BOUND exceeds the
+ * tolerance, and the error may not. It is near-sharp where Δφ → π (the
+ * motions are in antiphase and the error reaches 2θ0), and the waveform term
+ * cannot be dropped: without W̄, RK4 finds the error above 2θ0 sin(Δφ/2) by
+ * about 3% (witness control).
+ *
+ * @module atlas/oscillators/position-translation
+ * @internal
+ */
+import { pendulumPeriodErrorAt } from './bridges-limits.js';
+import { linearAccel, pendulumAccel, pendulumNome, rk4Step, theta0OfPeriodError } from './pendulum-motion.js';
+const TWO_PI = 2 * Math.PI;
+/** W̄ = (16/3) q^{3/2}/(1 − q): the bound on the waveform distortion |F(φ) − θ0 cos φ|. @internal */
+export function waveformBound(theta0) {
+    const q = pendulumNome(theta0);
+    return ((16 / 3) * q ** 1.5) / (1 - q);
+}
+/** The pendulum's fundamental Fourier coefficient a₀ = 8√q/(1 + q). @internal */
+export function fundamentalCoefficient(theta0) {
+    const q = pendulumNome(theta0);
+    return (8 * Math.sqrt(q)) / (1 + q);
+}
+const lead = (eps, tOverT0) => (TWO_PI * tOverT0 * eps) / (1 + eps);
+/** B(t/T0) at θ0 recovered from ε; `drift` and `waveform` scale its two terms (1, 1 is B itself). */
+function positionBound(eps, drift = 1, waveform = 1) {
+    const theta0 = theta0OfPeriodError(eps);
+    const floor = waveform * waveformBound(theta0);
+    return (tOverT0) => floor + drift * 2 * theta0 * Math.sin(Math.min(lead(eps, tOverT0), Math.PI) / 2);
+}
+function positionHorizon(eps, tolerance, T0) {
+    if (T0 === undefined || !Number.isFinite(T0) || T0 <= 0 || !Number.isFinite(eps) || eps < 0)
+        return Number.NaN;
+    if (eps === 0)
+        return Infinity;
+    const theta0 = theta0OfPeriodError(eps);
+    const floor = waveformBound(theta0);
+    if (tolerance < floor)
+        return Number.NaN;
+    const r = (tolerance - floor) / (2 * theta0);
+    if (r >= 1)
+        return Infinity;
+    return (2 * Math.asin(r) * T0 * (1 + eps)) / (TWO_PI * eps);
+}
+/** The point witness integrates at most this many periods of T0. */
+export const POSITION_POINT_MAX_PERIODS = 512;
+/** Samples per T0 both resolutions report at. */
+const SAMPLES_PER_PERIOD = 200;
+/**
+ * |θ(t) − θ_lin(t)| from RK4 of both motions, and B(t) at the same samples,
+ * over `periods` of T0; `stepsPerPeriod` must be a multiple of 200.
+ */
+function dominanceSamples(theta0, periods, stepsPerPeriod, bound) {
+    const stride = stepsPerPeriod / SAMPLES_PER_PERIOD;
+    const h = 1 / stepsPerPeriod;
+    const measured = [];
+    const b = [];
+    let x = theta0;
+    let v = 0;
+    let y = theta0;
+    let u = 0;
+    const steps = Math.floor(periods * SAMPLES_PER_PERIOD) * stride;
+    for (let i = 1; i <= steps; i++) {
+        [x, v] = rk4Step(x, v, h, pendulumAccel);
+        [y, u] = rk4Step(y, u, h, linearAccel);
+        if (i % stride === 0) {
+            measured.push(Math.abs(x - y));
+            b.push(bound(i * h));
+        }
+    }
+    return { measured, bound: b };
+}
+/** The window a dominance witness covers: up to antiphase (Δφ = π), past which B ≥ 2θ0 holds trivially, capped. */
+function dominanceWindow(eps) {
+    return Math.min(POSITION_POINT_MAX_PERIODS, (1 + eps) / (2 * eps));
+}
+function dominanceSpec(id, eps, drift, waveform) {
+    const theta0 = theta0OfPeriodError(eps);
+    const periods = dominanceWindow(eps);
+    return {
+        id,
+        kind: 'dominance',
+        evaluate: (stepsPerPeriod) => dominanceSamples(theta0, periods, stepsPerPeriod, positionBound(eps, drift, waveform)),
+        coarseResolution: 200,
+        fineResolution: 800,
+    };
+}
+/** a₀ measured by projecting one RK4 pendulum period onto cos φ (trapezoid, exact for a periodic integrand). */
+export function measureFundamental(theta0, stepsPerPeriod) {
+    const T = 1 + pendulumPeriodErrorAt({ theta0 });
+    const h = T / stepsPerPeriod;
+    let x = theta0;
+    let v = 0;
+    let sum = theta0;
+    for (let i = 1; i < stepsPerPeriod; i++) {
+        [x, v] = rk4Step(x, v, h, pendulumAccel);
+        sum += x * Math.cos((TWO_PI * i) / stepsPerPeriod);
+    }
+    return (2 * sum) / stepsPerPeriod;
+}
+/** The θ0 at which W7xs checks the Fourier series: a grid across the bridge's domain θ0 ≤ 0.5. @internal */
+export const FOURIER_SERIES_THETA0S = [0.01, 0.1, 0.2, 0.3, 0.4, 0.5];
+const FOURIER_SERIES_TERMS = 20;
+const FOURIER_SERIES_TOLERANCE = 1e-9;
+/**
+ * F(φ) = Σ_{n<20} (−1)ⁿ aₙ cos((2n+1)φ). `'minus'` puts (1 − q^{2n+1}) in the
+ * denominator of aₙ, a transcription error the control uses.
+ */
+function fourierSeries(theta0, phi, variant) {
+    const q = pendulumNome(theta0);
+    let s = 0;
+    for (let n = 0; n < FOURIER_SERIES_TERMS; n++) {
+        const odd = 2 * n + 1;
+        const a = (8 * q ** (n + 0.5)) / (odd * (variant === 'plus' ? 1 + q ** odd : 1 - q ** odd));
+        s += (n % 2 === 0 ? a : -a) * Math.cos(odd * phi);
+    }
+    return s;
+}
+/** max over the grid, and over one period T = T0(1+ε) sampled at every RK4 step, of |θ_RK4(t) − F(2πt/T)|. */
+function fourierSeriesDeviation(stepsPerPeriod, variant) {
+    let worst = 0;
+    for (const theta0 of FOURIER_SERIES_THETA0S) {
+        const h = (1 + pendulumPeriodErrorAt({ theta0 })) / stepsPerPeriod;
+        let x = theta0;
+        let v = 0;
+        worst = Math.max(worst, Math.abs(x - fourierSeries(theta0, 0, variant)));
+        for (let i = 1; i <= stepsPerPeriod; i++) {
+            [x, v] = rk4Step(x, v, h, pendulumAccel);
+            worst = Math.max(worst, Math.abs(x - fourierSeries(theta0, (TWO_PI * i) / stepsPerPeriod, variant)));
+        }
+    }
+    return worst;
+}
+/**
+ * W7xs, or its control: the Fourier series against RK4 of the pendulum, at 200
+ * and 800 steps per period, within 1e-9 rad at every step and every grid θ0.
+ * @internal
+ */
+export function fourierSeriesCheck(id, variant = 'plus') {
+    return {
+        id,
+        evaluate: (stepsPerPeriod) => fourierSeriesDeviation(stepsPerPeriod, variant),
+        target: 0,
+        coarseResolution: 200,
+        fineResolution: 800,
+        tolerance: FOURIER_SERIES_TOLERANCE,
+    };
+}
+const W7X_THETA0 = 0.3;
+const W7X_EPS = pendulumPeriodErrorAt({ theta0: W7X_THETA0 });
+const W7XA = {
+    id: 'W7xa',
+    evaluate: (stepsPerPeriod) => measureFundamental(W7X_THETA0, stepsPerPeriod),
+    target: fundamentalCoefficient(W7X_THETA0),
+    coarseResolution: 200,
+    fineResolution: 800,
+    tolerance: 1e-10,
+};
+function positionPointCheck(eps) {
+    if (!Number.isFinite(eps) || eps <= 0)
+        return { unavailable: `θ0 = 0 at ε = ${eps}: both motions are at rest and the error is 0` };
+    const theta0 = theta0OfPeriodError(eps);
+    const periods = dominanceWindow(eps);
+    const capped = periods === POSITION_POINT_MAX_PERIODS ? `, capped at ${POSITION_POINT_MAX_PERIODS} T0 (antiphase is at ${(1 + eps) / (2 * eps)} T0)` : ' (to antiphase, Δφ = π)';
+    return {
+        claim: `RK4 |θ − θ_lin| ≤ B(t) at every sample, θ0 = ${Number(theta0.toPrecision(8))} (recovered from ε), over t ≤ ${periods} T0${capped}; ` +
+            `200 and 800 steps per T0, sampled 200 per T0; the coarse-to-fine difference is the uncertainty`,
+        check: dominanceSpec('W7x@point', eps, 1, 1),
+        control: dominanceSpec('W7x@point-control', eps, 1, 0),
+        controlClaim: 'the same bound without its waveform term W̄, 2θ0 sin(Δφ/2) alone',
+    };
+}
+/** @internal */
+export const PENDULUM_POSITION_TRANSLATION = {
+    bridgeId: 'ab-pendulum-linear',
+    observable: 'position',
+    unit: 'rad',
+    fromNorm: 'relative period error, normalized by the value of the reduced model',
+    errorKind: 'upper-bound',
+    definition: 'the pointwise angle error |θ(t) − θ_lin(t)| of the two motions released from rest at θ0',
+    derivation: 'an UPPER BOUND B(t) = W̄ + 2θ0 sin(min(Δφ(t), π)/2), Δφ = 2π (t/T0) ε/(1+ε) the exact phase lead and ' +
+        'W̄ = (16/3) q^{3/2}/(1−q) ≈ θ0³/96 the waveform term (q the nome of sin(θ0/2); θ0 is recovered from ε). ' +
+        'From the Fourier series θ = Σ (−1)ⁿ aₙ cos((2n+1)φ): |θ − θ0 cos φ| ≤ 2 Σ_{n≥1} aₙ ≤ W̄, and θ0|cos φ − cos φ_lin| ≤ 2θ0|sin(Δφ/2)|. ' +
+        'B increases with ε, so the domain supremum of ε gives the shortest horizon over the domain',
+    premises: [
+        'both motions are released from rest at the same θ0 at t = 0',
+        'T0 = 2π √(ℓ/g) is the linear period, in the unit t is given in',
+        'the classical Fourier series of the pendulum (all aₙ > 0, Σ (−1)ⁿ aₙ = θ0) — quoted, not derived here; ' +
+            `machine-checked against RK4 at θ0 ∈ {${FOURIER_SERIES_THETA0S.join(', ')}} (W7xs), not between those points`,
+    ],
+    parameters: ['T0'],
+    timeUnit: 'the unit of T0',
+    errorAt: (eps, t, { T0 }) => {
+        if (T0 === undefined || !Number.isFinite(T0) || T0 <= 0 || !Number.isFinite(eps) || eps < 0 || !Number.isFinite(t))
+            return Number.NaN;
+        return positionBound(eps)(t / T0);
+    },
+    horizonFor: (eps, tolerance, { T0 }) => positionHorizon(eps, tolerance, T0),
+    floor: (eps) => waveformBound(theta0OfPeriodError(eps)),
+    boundary: 'inclusive: certified iff t ≤ t*, i.e. B(t) ≤ the tolerance; past t* the BOUND exceeds it and the error may not (undetermined, not inadequate)',
+    notCovered: ['the phase (declared separately: --tolerance=phase:EPS)', 'the angular velocity', 'the amplitude'],
+    witnesses: [
+        {
+            id: 'W7x',
+            kind: 'numeric',
+            test: 'tests/atlas/pendulum-position-translation.test.ts',
+            tolerance: `RK4 |θ − θ_lin| ≤ B(t) at every sample to antiphase, θ0 = ${W7X_THETA0}, by more than the coarse-to-fine difference`,
+        },
+        {
+            id: 'W7xa',
+            kind: 'numeric',
+            test: 'tests/atlas/pendulum-position-translation.test.ts',
+            tolerance: `RK4-projected fundamental coefficient at θ0 = ${W7X_THETA0} within 1e-10 of 8√q/(1+q)`,
+        },
+        {
+            id: 'W7xs',
+            kind: 'numeric',
+            test: 'tests/atlas/pendulum-position-translation.test.ts',
+            tolerance: `the Fourier series (${FOURIER_SERIES_TERMS} terms) within ${FOURIER_SERIES_TOLERANCE} rad of RK4 at every step of one period, ` +
+                `at θ0 ∈ {${FOURIER_SERIES_THETA0S.join(', ')}}`,
+        },
+    ],
+    checks: [dominanceSpec('W7x', W7X_EPS, 1, 1), W7XA, fourierSeriesCheck('W7xs')],
+    pointCheck: positionPointCheck,
+};
+//# sourceMappingURL=position-translation.js.map

package/dist/atlas/oscillators/position-translation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"position-translation.js","sourceRoot":"","sources":["../../../src/atlas/oscillators/position-translation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAKH,OAAO,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAE9G,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AAE3B,qGAAqG;AACrG,MAAM,UAAU,aAAa,CAAC,MAAc;IAC1C,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,sBAAsB,CAAC,MAAc;IACnD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAC/B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,OAAe,EAAU,EAAE,CAAC,CAAC,MAAM,GAAG,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAE5F,qGAAqG;AACrG,SAAS,aAAa,CAAC,GAAW,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC;IACzD,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAC/C,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AACvG,CAAC;AAED,SAAS,eAAe,CAAC,GAAW,EAAE,SAAiB,EAAE,EAAsB;IAC7E,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAC/G,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC/B,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,SAAS,GAAG,KAAK;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACzC,MAAM,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7C,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC5B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AAC9D,CAAC;AAED,oEAAoE;AACpE,MAAM,CAAC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAC9C,iDAAiD;AACjD,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B;;;GAGG;AACH,SAAS,gBAAgB,CAAC,MAAc,EAAE,OAAe,EAAE,cAAsB,EAAE,KAA4B;IAC7G,MAAM,MAAM,GAAG,cAAc,GAAG,kBAAkB,CAAC;IACnD,MAAM,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC;IAC7B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,IAAI,CAAC,GAAG,MAAM,CAAC;IACf,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,MAAM,CAAC;IACf,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,kBAAkB,CAAC,GAAG,MAAM,CAAC;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACzC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAChC,CAAC;AAED,mHAAmH;AACnH,SAAS,eAAe,CAAC,GAAW;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,0BAA0B,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACrE,CAAC;AAED,SAAS,aAAa,CAAC,EAAU,EAAE,GAAW,EAAE,KAAa,EAAE,QAAgB;IAC7E,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACrC,OAAO;QACL,EAAE;QACF,IAAI,EAAE,WAAW;QACjB,QAAQ,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACpH,gBAAgB,EAAE,GAAG;QACrB,cAAc,EAAE,GAAG;KACpB,CAAC;AACJ,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,kBAAkB,CAAC,MAAc,EAAE,cAAsB;IACvE,MAAM,CAAC,GAAG,CAAC,GAAG,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC;IAC7B,IAAI,CAAC,GAAG,MAAM,CAAC;IACf,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACzC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,cAAc,CAAC;AACpC,CAAC;AAED,4GAA4G;AAC5G,MAAM,CAAC,MAAM,sBAAsB,GAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACzF,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAChC,MAAM,wBAAwB,GAAG,IAAI,CAAC;AAEtC;;;GAGG;AACH,SAAS,aAAa,CAAC,MAAc,EAAE,GAAW,EAAE,OAAyB;IAC3E,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC5F,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8GAA8G;AAC9G,SAAS,sBAAsB,CAAC,cAAsB,EAAE,OAAyB;IAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,MAAM,IAAI,sBAAsB,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC;QACnE,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;YACzC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACvG,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,EAAU,EAAE,OAAO,GAAqB,MAAM;IAC/E,OAAO;QACL,EAAE;QACF,QAAQ,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,sBAAsB,CAAC,cAAc,EAAE,OAAO,CAAC;QAC7E,MAAM,EAAE,CAAC;QACT,gBAAgB,EAAE,GAAG;QACrB,cAAc,EAAE,GAAG;QACnB,SAAS,EAAE,wBAAwB;KACpC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,MAAM,OAAO,GAAG,qBAAqB,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;AAE9D,MAAM,IAAI,GAAuB;IAC/B,EAAE,EAAE,MAAM;IACV,QAAQ,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,kBAAkB,CAAC,UAAU,EAAE,cAAc,CAAC;IAC5E,MAAM,EAAE,sBAAsB,CAAC,UAAU,CAAC;IAC1C,gBAAgB,EAAE,GAAG;IACrB,cAAc,EAAE,GAAG;IACnB,SAAS,EAAE,KAAK;CACjB,CAAC;AAEF,SAAS,kBAAkB,CAAC,GAAW;IACrC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,EAAE,WAAW,EAAE,iBAAiB,GAAG,+CAA+C,EAAE,CAAC;IACnI,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,OAAO,KAAK,0BAA0B,CAAC,CAAC,CAAC,eAAe,0BAA0B,wBAAwB,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,yBAAyB,CAAC;IACjL,OAAO;QACL,KAAK,EACH,gDAAgD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,iCAAiC,OAAO,MAAM,MAAM,IAAI;YACrI,gGAAgG;QAClG,KAAK,EAAE,aAAa,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,OAAO,EAAE,aAAa,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACtD,YAAY,EAAE,kEAAkE;KACjF,CAAC;AACJ,CAAC;AAED,gBAAgB;AAChB,MAAM,CAAC,MAAM,6BAA6B,GAA0B;IAClE,QAAQ,EAAE,oBAAoB;IAC9B,UAAU,EAAE,UAAU;IACtB,IAAI,EAAE,KAAK;IACX,QAAQ,EAAE,qEAAqE;IAC/E,SAAS,EAAE,aAAa;IACxB,UAAU,EAAE,yFAAyF;IACrG,UAAU,EACR,uGAAuG;QACvG,0GAA0G;QAC1G,uIAAuI;QACvI,4FAA4F;IAC9F,QAAQ,EAAE;QACR,6DAA6D;QAC7D,gEAAgE;QAChE,yGAAyG;YACvG,wCAAwC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,oCAAoC;KAChH;IACD,UAAU,EAAE,CAAC,IAAI,CAAC;IAClB,QAAQ,EAAE,gBAAgB;IAC1B,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;QAC1B,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QACtI,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,UAAU,EAAE,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC;IAC3E,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACvD,QAAQ,EACN,+IAA+I;IACjJ,UAAU,EAAE,CAAC,wDAAwD,EAAE,sBAAsB,EAAE,eAAe,CAAC;IAC/G,SAAS,EAAE;QACT;YACE,EAAE,EAAE,KAAK;YACT,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,mDAAmD;YACzD,SAAS,EAAE,6DAA6D,UAAU,8CAA8C;SACjI;QACD;YACE,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,mDAAmD;YACzD,SAAS,EAAE,iDAAiD,UAAU,4BAA4B;SACnG;QACD;YACE,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,mDAAmD;YACzD,SAAS,EACP,uBAAuB,oBAAoB,kBAAkB,wBAAwB,2CAA2C;gBAChI,YAAY,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;SACnD;KACF;IACD,MAAM,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAC/E,UAAU,EAAE,kBAAkB;CAC/B,CAAC"}

package/dist/atlas/path-bound.d.ts

@@ -35,6 +35,13 @@
  * makes the error invisible without this gate: the danger is not a wrong
  * magnitude, it is a right magnitude attached to the wrong norm.
  *
+ * The one way through is a DECLARATION on the exact bridge
+ * (`AtlasBridge.normTransports`, `docs/planning/ADR-transported-norm-composition.md`):
+ * a norm, a direction, a factor `K` and a time map, each with a witness. A route
+ * that crosses the bridge in that direction, carrying a bound in that norm,
+ * composes with `(K, 0)`; every other norm and direction is still refused, and
+ * the refusal names the declaration that is missing.
+ *
  * ⚠ **Correction to the S2.2 brief.** The brief states that no field records a
  * norm and that Phase 2 must add `norm?` to `ApproximationBound`. That is
  * out of date: `ApproximationBound.norm` already exists as a MANDATORY
@@ -55,7 +62,7 @@
  */
 import { IDENTITY_BOUND } from './error-algebra.js';
 import type { BoundPair } from './error-algebra.js';
-import type { AtlasBridge, RelationType } from './types.js';
+import type { AtlasBridge, NormTransport, RelationType } from './types.js';
 /**
  * Shortest chain of bridges from `from` to `to`, or `null` if none exists.
  *
@@ -72,6 +79,59 @@ import type { AtlasBridge, RelationType } from './types.js';
  * @internal
  */
 export declare function findPath(family: string, from: string, to: string): readonly AtlasBridge[] | null;
+/**
+ * Shortest chain of bridges from `from` to `to` across EVERY registered
+ * family, or `null` if none exists.
+ *
+ * A family is a filing label, not a physical boundary: `ab-kg-schrodinger` is
+ * filed under waves and ends in the diffusion family's free Schrödinger model.
+ * The search runs over the union of all families' bridges under the same
+ * rules as {@link findPath} — an exact equivalence both ways, every lossy
+ * relation forward only — and the route it returns is composed by
+ * {@link boundPath} exactly as a single-family route is. Crossing a family
+ * adds no composition rule.
+ *
+ * Ties are broken by {@link ATLAS_FAMILIES} order, then each family's bridge
+ * order, so the result is stable across runs.
+ *
+ * @throws RangeError if an endpoint is not a model of any family.
+ * @internal
+ */
+export declare function findAtlasPath(from: string, to: string): readonly AtlasBridge[] | null;
+/**
+ * The simple routes from `from` to `to` across every registered family, as
+ * far as a bounded search reaches. Each route is a list of bridges, and no route
+ * visits a model twice. Traversal follows the same rules as
+ * {@link findAtlasPath}: an exact equivalence both ways, every lossy relation
+ * forward only, multi-premise bridges skipped.
+ *
+ * The search runs by bridge count (every route of k bridges before any of
+ * k + 1), with ties in {@link ATLAS_FAMILIES} order and then bridge order. It stops
+ * once it has found `limit + 1` routes, or after expanding `budget` partial
+ * routes. Stopping early is REPORTED, not hidden: `exhausted` is false,
+ * `stoppedBy` says which bound stopped it, and `completeThrough` is the largest
+ * bridge count up to which every route has been found. When `exhausted` is
+ * true, `routes` holds all of them.
+ *
+ * @throws RangeError if an endpoint is not a model of any family, or `limit`
+ *   is not a positive integer (via {@link enumerateRoutes}).
+ * @internal
+ */
+export declare function enumerateAtlasRoutes(from: string, to: string, limit: number, budget?: number): RouteEnumeration;
+/** What {@link enumerateAtlasRoutes} found, and whether the search was cut short. @internal */
+export interface RouteEnumeration {
+    readonly routes: (readonly AtlasBridge[])[];
+    readonly exhausted: boolean;
+    readonly completeThrough: number | null;
+    readonly stoppedBy: 'limit' | 'budget' | null;
+}
+/**
+ * {@link enumerateAtlasRoutes} over an explicit bridge list; endpoints are not
+ * validated against any family.
+ * @throws RangeError if `limit` is not a positive integer.
+ * @internal
+ */
+export declare function enumerateRoutes(bridges: readonly AtlasBridge[], from: string, to: string, limit: number, budget?: number): RouteEnumeration;
 /** Why a path supports no bound. @internal */
 export type NoClaimReason = 
 /** The relations along the path do not compose to a relation at all. */
@@ -80,6 +140,12 @@ export type NoClaimReason =
  | 'norm-not-stated'
 /** Two edges state DIFFERENT norms; composing across norms is unsound. */
  | 'norm-mismatch'
+/**
+ * A norm stated in one model family was carried into another with no
+ * witnessed transport across that boundary. String equality is not a match
+ * there. A one-step route does not reach this gate.
+ */
+ | 'cross-family-unmapped'
 /**
  * A bound on the path has `uniformity === null` or an empty list: what the
  * error is uniform in has not been analysed, so no number is stated.
@@ -94,11 +160,21 @@ export interface PathBoundClaim {
     /** The relation the chain asserts, from {@link composeRelation}. */
     readonly relation: RelationType;
     /**
-     * The single norm every bound on the path states, or `null` when the path
-     * carries no bound at all and the claim is the vacuous `terminal` identity
-     * over an empty prefix.
+     * The norm the composite holds in: the single norm every bound on the path
+     * states, or the `to` norm of the last transport applied after them. `null`
+     * when the path carries no bound at all and the claim is the vacuous
+     * `terminal` identity over an empty prefix.
      */
     readonly norm: string | null;
+    /** The declared norm transports that carried the bound across exact maps; absent when none did. */
+    readonly transports?: readonly AppliedTransport[];
+}
+/** A declared norm transport {@link boundPath} applied, and where on the path. @internal */
+export interface AppliedTransport {
+    /** Index of the exact bridge in the path. */
+    readonly index: number;
+    readonly bridgeId: string;
+    readonly transport: NormTransport;
 }
 /** A path that carries NO bound, and the reason. @internal */
 export interface PathNoClaim {
@@ -112,7 +188,7 @@ export type PathBoundResult = PathBoundClaim | PathNoClaim;
 /**
  * The error bound a chain of bridges carries — or an explicit no-claim.
  *
- * Four gates, in this order. Each one is a reason to refuse, and the FIRST
+ * Five gates, in this order. Each one is a reason to refuse, and the FIRST
  * reason found is the one reported; none of them is skippable by a caller.
  *
  * 1. **Relation.** `composeRelation` is folded along the path. The moment the
@@ -127,10 +203,21 @@ export type PathBoundResult = PathBoundClaim | PathNoClaim;
  *    edge that is neither bounded nor exact — is tolerated only as the LAST
  *    entry, where it terminates the claim (`terminal: true`); anywhere else it
  *    throws `MissingLipschitzError` rather than inventing a constant.
- * 4. **Norm.** Every stated norm on the path must be the SAME norm, and no
- *    unnormed exact map may carry a normed claim. An `exact-equivalence`
- *    states no norm (it has no `bound`), so a path mixing one with a normed
- *    bound is `'norm-not-stated'` — see the module note.
+ * 4. **Norm.** Every stated norm on the path must be the SAME norm as the bound
+ *    reaching it, and no unnormed exact map may carry a normed claim. An
+ *    `exact-equivalence` states no norm (it has no `bound`), so a path mixing
+ *    one with a normed bound is `'norm-not-stated'` — see the module note —
+ *    UNLESS the exact bridge declares a `NormTransport` from the running norm,
+ *    for the direction the route crosses it, with a uniform time map. Then it
+ *    contributes `(K, 0)` and the running norm becomes the transport's `to`.
+ *    A mismatch is reported before a missing norm.
+ * 5. **Vocabulary.** When the models a norm is carried between sit in different
+ *    families, string equality is not a match. The carry needs a
+ *    `NormTransport` whose `fromModel` / `toModel` are the models the route
+ *    crosses, whose `from` is the running norm, whose time map is uniform, and
+ *    whose witness is present. Otherwise the refusal is
+ *    `'cross-family-unmapped'`. A one-step route has nothing to carry, so this
+ *    gate does not fire. A missing Lipschitz constant is reported first.
  *
  * @throws RangeError on an empty path. Returning `IDENTITY_BOUND` for "no
  *   edges" would be a bound asserted about nothing.
@@ -138,6 +225,36 @@ export type PathBoundResult = PathBoundClaim | PathNoClaim;
  * @internal
  */
 export declare function boundPath(bridges: readonly AtlasBridge[]): PathBoundResult;
+/**
+ * The model each step of a route is entered from, or `null` where the list is
+ * not a chain. An exact equivalence may be crossed either way; the first one is
+ * read as reversed when the next step leaves from its premise and not from its
+ * conclusion. Every other relation is crossed forward.
+ *
+ * @internal
+ */
+export declare function routeEntryModels(bridges: readonly AtlasBridge[]): (string | null)[];
+/**
+ * True when step `index` sits in a different model family from the previous
+ * step and no applied transport restates a clock onto it. The step's own
+ * horizon is then unevaluated: a family change does not copy one.
+ *
+ * @internal
+ */
+export declare function familyChangeBlocksHorizon(bridges: readonly AtlasBridge[], transports: readonly AppliedTransport[], index: number): boolean;
+/**
+ * The horizon of the bound on `bridges[index]` as it reads at the END of the
+ * route: restated through every transport applied after it (a
+ * {@link PathBoundClaim}'s `transports`; none for a no-claim). `null` when that
+ * step carries no bound.
+ *
+ * @internal
+ */
+export declare function horizonOnRoute(bridges: readonly AtlasBridge[], transports: readonly AppliedTransport[], index: number): {
+    readonly horizon: string;
+    readonly restatedBy: readonly AppliedTransport[];
+    readonly holds: (t: number, params: Readonly<Record<string, number>>) => boolean;
+} | null;
 /** Re-exported so a caller need not reach into the algebra module. @internal */
 export { IDENTITY_BOUND };
 //# sourceMappingURL=path-bound.d.ts.map

package/dist/atlas/path-bound.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"path-bound.d.ts","sourceRoot":"","sources":["../../src/atlas/path-bound.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AAEH,OAAO,EAAoB,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACtE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAGpD,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AA+C5D;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,GACT,SAAS,WAAW,EAAE,GAAG,IAAI,CA2C/B;AAED,8CAA8C;AAC9C,MAAM,MAAM,aAAa;AACvB,wEAAwE;AACtE,oBAAoB;AACtB,0EAA0E;GACxE,iBAAiB;AACnB,0EAA0E;GACxE,eAAe;AACjB;;;GAGG;GACD,uBAAuB,CAAC;AAE5B,gDAAgD;AAChD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;IAC1B,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,oEAAoE;IACpE,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAChC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC9B;AAED,8DAA8D;AAC9D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,yDAAyD;IACzD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,kFAAkF;AAClF,MAAM,MAAM,eAAe,GAAG,cAAc,GAAG,WAAW,CAAC;AAE3D;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,eAAe,CAkG1E;AAED,gFAAgF;AAChF,OAAO,EAAE,cAAc,EAAE,CAAC"}
+{"version":3,"file":"path-bound.d.ts","sourceRoot":"","sources":["../../src/atlas/path-bound.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6DG;AAEH,OAAO,EAAoB,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACtE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAGpD,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AA+C3E;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,GACT,SAAS,WAAW,EAAE,GAAG,IAAI,CAY/B;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,SAAS,WAAW,EAAE,GAAG,IAAI,CAYrF;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,MAAM,SAAU,GACf,gBAAgB,CAQlB;AAED,+FAA+F;AAC/F,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,EAAE,CAAC;IAC5C,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IACxC,QAAQ,CAAC,SAAS,EAAE,OAAO,GAAG,QAAQ,GAAG,IAAI,CAAC;CAC/C;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,SAAS,WAAW,EAAE,EAC/B,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,MAAM,SAAU,GACf,gBAAgB,CA2ClB;AA0CD,8CAA8C;AAC9C,MAAM,MAAM,aAAa;AACvB,wEAAwE;AACtE,oBAAoB;AACtB,0EAA0E;GACxE,iBAAiB;AACnB,0EAA0E;GACxE,eAAe;AACjB;;;;GAIG;GACD,uBAAuB;AACzB;;;GAGG;GACD,uBAAuB,CAAC;AAE5B,gDAAgD;AAChD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;IAC1B,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,oEAAoE;IACpE,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,mGAAmG;IACnG,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACnD;AAED,4FAA4F;AAC5F,MAAM,WAAW,gBAAgB;IAC/B,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;CACnC;AAED,8DAA8D;AAC9D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,yDAAyD;IACzD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,kFAAkF;AAClF,MAAM,MAAM,eAAe,GAAG,cAAc,GAAG,WAAW,CAAC;AAoC3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,eAAe,CAqO1E;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAGnF;AAkBD;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CACvC,OAAO,EAAE,SAAS,WAAW,EAAE,EAC/B,UAAU,EAAE,SAAS,gBAAgB,EAAE,EACvC,KAAK,EAAE,MAAM,GACZ,OAAO,CAaT;AAUD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,SAAS,WAAW,EAAE,EAC/B,UAAU,EAAE,SAAS,gBAAgB,EAAE,EACvC,KAAK,EAAE,MAAM,GACZ;IACD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,OAAO,CAAC;CAClF,GAAG,IAAI,CAMP;AAED,gFAAgF;AAChF,OAAO,EAAE,cAAc,EAAE,CAAC"}