@rpgm-tools/neo-angband-core 0.10.0

package/dist/rational.js

@@ -0,0 +1,345 @@
+/**
+ * Exact rational arithmetic and the mean/variance estimators, ported from
+ * reference/src/z-util.c (Angband 4.2.6): gcd (L1679),
+ * my_rational_construct (L1694), my_rational_to_uint (L1722),
+ * my_rational_product (L1823), my_rational_sum (L1923), mean (L1389) and
+ * variance (L1516).
+ *
+ * WHY THESE ARE CORE AND NOT PLUMBING. Three upstream call sites depend on the
+ * exact values these return:
+ *  - obj-info.c (L435 sum_o_criticals, L563/L725 the O-combat crit averages,
+ *    L1271-L1488 the damage-per-blow readout) prints numbers derived from
+ *    my_rational_to_uint, so a rounding difference is a visibly wrong number on
+ *    the item-inspect screen.
+ *  - obj-randart.c L278-L282 store_base_power calls mean()/variance() over the
+ *    standard artifact set; those become the generator's power baselines.
+ *  - player-path.c L135/L195/L269 converts turn penalties through
+ *    my_rational_to_uint, which feeds the pathfinder's terrain penalties.
+ *
+ * FIDELITY. The C works in `unsigned int` (32-bit) and falls back to a
+ * hand-rolled 16-bit-limb multiprecision library (ini_u16n/mul_u16n/div_u16n,
+ * z-util.c L1000-L1380) whenever a product would overflow. This port keeps the
+ * SAME saturation and approximation behaviour, using BigInt for exactly the
+ * intermediates the C computes in multiprecision. That matters because the
+ * fallback is not just "a bigger integer": my_rational_product and
+ * my_rational_sum deliberately APPROXIMATE (they rescale to the largest
+ * denominator that still fits and then round to nearest), and
+ * my_rational_to_uint / variance SATURATE at UINT_MAX / INT_MAX. A port that
+ * merely used JS doubles would silently return the unsaturated value.
+ *
+ * The 32-bit rails are the point, so they are named rather than implied:
+ * a `number` here stands for a C `unsigned int` unless stated otherwise.
+ */
+import { INT_MAX, UINT32_MAX } from "./guard.js";
+/** Bit length, i.e. msb_u16n (z-util.c L1059): 0 for zero, else 1-based msb. */
+function msb(x) {
+    return x === 0n ? 0 : x.toString(2).length;
+}
+/**
+ * gcd (z-util.c L1679): the division-based Euclid. Note gcd(0, d) === d, which
+ * my_rational_product relies on when a numerator is zero.
+ */
+export function gcd(a, b) {
+    while (b) {
+        const t = b;
+        b = a % b;
+        a = t;
+    }
+    return a;
+}
+/**
+ * my_rational_construct (z-util.c L1694). Zero is always 0/1; otherwise the
+ * fraction is divided through by the gcd. The C asserts denominator > 0.
+ */
+export function myRationalConstruct(numerator, denominator) {
+    if (numerator === 0) {
+        /* Use 0 / 1 as the way to represent zero. */
+        return { n: 0, d: 1 };
+    }
+    const g = gcd(numerator, denominator);
+    return { n: Math.trunc(numerator / g), d: Math.trunc(denominator / g) };
+}
+/**
+ * my_rational_to_uint (z-util.c L1722): a->n / a->d scaled by `scale`, floored,
+ * saturating at UINT_MAX. When `out` is given it receives the numerator of the
+ * part that was dropped (over the same denominator a.d) so the caller can round.
+ *
+ * Every early return that saturates ALSO zeroes the remainder — upstream does
+ * that at four separate points and a caller that rounds on the remainder would
+ * round differently if any were missed, so they are each reproduced.
+ */
+export function myRationalToUint(a, scale, out) {
+    if (!scale) {
+        if (out)
+            out.remainder = 0;
+        return 0;
+    }
+    let result = Math.trunc(a.n / a.d);
+    if (result > Math.trunc(UINT32_MAX / scale)) {
+        if (out)
+            out.remainder = 0;
+        return UINT32_MAX;
+    }
+    result *= scale;
+    const r = a.n % a.d;
+    const q = Math.trunc(scale / a.d);
+    /* q * r cannot overflow: q <= scale / a.d and r < a.d, so q * r < scale. */
+    if (result > UINT32_MAX - q * r) {
+        if (out)
+            out.remainder = 0;
+        return UINT32_MAX;
+    }
+    result += q * r;
+    const r2 = scale - q * a.d;
+    if (r && r2 > Math.trunc(UINT32_MAX / r)) {
+        /*
+         * The product of the remainders overflows in the native arithmetic, so the
+         * C switches to multiprecision integers (L1756-L1803). BigInt is exact here
+         * for the same reason: r < a.d and r2 < a.d, both under 2^32.
+         */
+        const t = BigInt(r) * BigInt(r2);
+        const bd = BigInt(a.d);
+        const mq = Number(t / bd);
+        if (result <= UINT32_MAX - mq) {
+            result += mq;
+            if (out)
+                out.remainder = Number(t % bd);
+        }
+        else {
+            result = UINT32_MAX;
+            if (out)
+                out.remainder = 0;
+        }
+        return result;
+    }
+    const t = r * r2;
+    const q2 = Math.trunc(t / a.d);
+    if (result > UINT32_MAX - q2) {
+        if (out)
+            out.remainder = 0;
+        return UINT32_MAX;
+    }
+    result += q2;
+    if (out)
+        out.remainder = t - q2 * a.d;
+    return result;
+}
+/**
+ * The shared tail of my_rational_product and my_rational_sum's overflow paths
+ * (z-util.c L1872-L1911 and L1985-L2027). Given the exact fraction n / d that
+ * does not fit in 32 bits, return the best 32-bit approximation the C would:
+ * take the integer quotient, pick the LARGEST denominator that still fits
+ * alongside it, scale the remainder into that denominator, and round to nearest
+ * by comparing bit lengths (which is why this is an approximation and not the
+ * true value).
+ */
+function approximate(n, d, guardSum) {
+    const q = n / d;
+    if (q > BigInt(UINT32_MAX))
+        return myRationalConstruct(UINT32_MAX, 1);
+    const r = n % d;
+    let resn = Number(q);
+    const resd = resn < UINT32_MAX ? Math.trunc(UINT32_MAX / (resn + 1)) : 1;
+    resn *= resd;
+    const scaled = r * BigInt(resd);
+    const t = Number(scaled / d);
+    const rr = scaled % d;
+    if (guardSum && resn > UINT32_MAX - t) {
+        /* my_rational_sum guards this addition (L2015) where product asserts it. */
+        return myRationalConstruct(UINT32_MAX, 1);
+    }
+    resn += t;
+    /* Approximate rounding to the nearest. */
+    if (msb(rr) + 1 >= msb(d) && resn < UINT32_MAX)
+        resn += 1;
+    return myRationalConstruct(resn, resd);
+}
+/** my_rational_product (z-util.c L1823): a * b, approximating on overflow. */
+export function myRationalProduct(a, b) {
+    const g1 = gcd(a.n, b.d);
+    const g2 = gcd(a.d, b.n);
+    const anr = Math.trunc(a.n / g1);
+    const adr = Math.trunc(a.d / g2);
+    const bnr = Math.trunc(b.n / g2);
+    const bdr = Math.trunc(b.d / g1);
+    if ((bnr && anr > Math.trunc(UINT32_MAX / bnr)) ||
+        adr > Math.trunc(UINT32_MAX / bdr)) {
+        return approximate(BigInt(anr) * BigInt(bnr), BigInt(adr) * BigInt(bdr), false);
+    }
+    /* Note: the native path does NOT re-reduce; anr/adr and bnr/bdr already are. */
+    return { n: anr * bnr, d: adr * bdr };
+}
+/** my_rational_sum (z-util.c L1923): a + b, approximating on overflow. */
+export function myRationalSum(a, b) {
+    const g = gcd(a.d, b.d);
+    const adr = Math.trunc(a.d / g);
+    const bdr = Math.trunc(b.d / g);
+    if (adr <= Math.trunc(UINT32_MAX / b.d) &&
+        a.n <= Math.trunc(UINT32_MAX / bdr) &&
+        b.n <= Math.trunc(UINT32_MAX / adr) &&
+        a.n * bdr <= UINT32_MAX - b.n * adr) {
+        return myRationalConstruct(a.n * bdr + b.n * adr, adr * b.d);
+    }
+    return approximate(BigInt(a.n) * BigInt(bdr) + BigInt(adr) * BigInt(b.n), BigInt(adr) * BigInt(b.d), true);
+}
+/**
+ * Split the entries of `nums[0 .. size-1]` into the positive and negative
+ * contributions to the sum, the way mean() and variance() both do (the C keeps
+ * two multiprecision accumulators so that INT_MIN never has to be negated in
+ * an `int`). Also returns the sum of squares, which only variance() reads.
+ */
+function accumulate(nums, size) {
+    let sp = 0n;
+    let sn = 0n;
+    let ss = 0n;
+    for (let i = 0; i < size; i++) {
+        const v = nums[i];
+        if (v === 0)
+            continue;
+        const bv = BigInt(v);
+        if (v > 0)
+            sp += bv;
+        else
+            sn -= bv;
+        ss += bv * bv;
+    }
+    return { sp, sn, ss };
+}
+/**
+ * mean (z-util.c L1389): the arithmetic mean of nums[0 .. size-1].
+ *
+ * The `frac` out-parameter selects between TWO DIFFERENT ROUNDING RULES, which
+ * is the whole reason it exists:
+ *  - frac === null: the result is rounded to NEAREST, ties away from zero
+ *    (the C tests `f.n >= (f.d + 1) / 2` on the magnitude).
+ *  - frac given: the result is FLOORED (rounded toward negative infinity, not
+ *    toward zero) and *frac is the non-negative remainder over `size`, so that
+ *    `return + frac` is the exact mean. For a negative mean the C therefore
+ *    increments the magnitude and stores `(d - n) / d`.
+ *
+ * store_base_power (obj-randart.c L278) passes a non-null frac, so the artifact
+ * power baselines use the FLOOR, not round-to-nearest.
+ */
+export function mean(nums, size, frac) {
+    if (size <= 0) {
+        if (frac) {
+            frac.n = 0;
+            frac.d = 1;
+        }
+        return 0;
+    }
+    const { sp, sn } = accumulate(nums, size);
+    const sz = BigInt(size);
+    if (sp < sn) {
+        /* The mean is negative; work with the magnitude, like the C does. */
+        const mag = sn - sp;
+        let result = mag / sz;
+        const f = myRationalConstruct(Number(mag % sz), size);
+        if (frac) {
+            if (f.n > 0) {
+                /*
+                 * Will be negating the result, but the returned fraction must be
+                 * non-negative, so step the magnitude up and complement the fraction.
+                 */
+                result += 1n;
+                frac.n = f.d - f.n;
+                frac.d = f.d;
+            }
+            else {
+                frac.n = f.n;
+                frac.d = f.d;
+            }
+        }
+        else if (f.n >= Math.trunc((f.d + 1) / 2)) {
+            result += 1n;
+        }
+        return result === 0n ? 0 : -Number(result);
+    }
+    const mag = sp - sn;
+    let result = mag / sz;
+    const f = myRationalConstruct(Number(mag % sz), size);
+    if (frac) {
+        frac.n = f.n;
+        frac.d = f.d;
+    }
+    else if (f.n >= Math.trunc((f.d + 1) / 2)) {
+        result += 1n;
+    }
+    return Number(result);
+}
+/**
+ * variance (z-util.c L1516) of nums[0 .. size-1].
+ *
+ * `unbiased` divides by size - 1 instead of size; `ofMean` scales by a further
+ * 1 / size to give the variance of the estimate of the mean. `frac` selects
+ * floor + exact remainder over round-to-nearest, as in mean(). A result above
+ * INT_MAX saturates to INT_MAX with a zero fraction.
+ *
+ * The C computes this as (sum(x^2) - sum(x)^2 / size) / norm rather than from
+ * the deviations, and it rounds sum(x)^2 / size UP before subtracting (L1591),
+ * converting the remainder to `size - r0` so every later fractional term stays
+ * non-negative. Both are reproduced: the ceiling changes the floored result by
+ * one for some inputs.
+ */
+export function variance(nums, size, unbiased, ofMean, frac) {
+    if (size <= 1) {
+        if (frac) {
+            frac.n = 0;
+            frac.d = 1;
+        }
+        return 0;
+    }
+    const norm = size - (unbiased ? 1 : 0);
+    const { sp, sn, ss: sumSq } = accumulate(nums, size);
+    const sz = BigInt(size);
+    const nm = BigInt(norm);
+    const diff = sp >= sn ? sp - sn : sn - sp;
+    const sqs = diff * diff;
+    let q = sqs / sz;
+    let r0 = sqs % sz;
+    if (r0 > 0n) {
+        /*
+         * Since this remainder is subtracted, add one to the quotient and turn the
+         * remainder into size - r0 so later terms are all non-negative.
+         */
+        q += 1n;
+        r0 = sz - r0;
+    }
+    const ss = sumSq - q;
+    let v = ss / nm;
+    const r1 = ss % nm;
+    let r2 = 0n;
+    if (ofMean) {
+        r2 = v % sz;
+        v = v / sz;
+    }
+    if (v > BigInt(UINT32_MAX) || Number(v) > INT_MAX) {
+        if (frac) {
+            frac.n = 0;
+            frac.d = 1;
+        }
+        return INT_MAX;
+    }
+    let result = Number(v);
+    /*
+     * Account for the fractional part. With ofMean false that is
+     * r1 / norm + r0 / (size * norm); with ofMean true it is
+     * r2 / size + r1 / (size * norm) + r0 / (size * size * norm).
+     */
+    let f = myRationalConstruct(Number(r0), size);
+    f = myRationalProduct(f, myRationalConstruct(1, norm));
+    f = myRationalSum(f, myRationalConstruct(Number(r1), norm));
+    if (ofMean) {
+        f = myRationalProduct(f, myRationalConstruct(1, size));
+        f = myRationalSum(f, myRationalConstruct(Number(r2), size));
+    }
+    if (frac) {
+        frac.n = f.n;
+        frac.d = f.d;
+    }
+    else if (f.n >= Math.trunc((f.d + 1) / 2) && result < INT_MAX) {
+        result += 1;
+    }
+    return result;
+}
+//# sourceMappingURL=rational.js.map

package/dist/rational.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rational.js","sourceRoot":"","sources":["../src/rational.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAUjD,gFAAgF;AAChF,SAAS,GAAG,CAAC,CAAS;IACpB,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,EAAE,CAAC;QACT,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB,EAAE,WAAmB;IACxE,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,6CAA6C;QAC7C,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACtC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;AAC1E,CAAC;AAOD;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAAa,EACb,KAAa,EACb,GAAmB;IAEnB,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,IAAI,GAAG;YAAE,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC;QAC5C,IAAI,GAAG;YAAE,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3B,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,IAAI,KAAK,CAAC;IAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,4EAA4E;IAC5E,IAAI,MAAM,GAAG,UAAU,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,IAAI,GAAG;YAAE,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3B,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;QACzC;;;;WAIG;QACH,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1B,IAAI,MAAM,IAAI,UAAU,GAAG,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,EAAE,CAAC;YACb,IAAI,GAAG;gBAAE,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,UAAU,CAAC;YACpB,IAAI,GAAG;gBAAE,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACjB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,MAAM,GAAG,UAAU,GAAG,EAAE,EAAE,CAAC;QAC7B,IAAI,GAAG;YAAE,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3B,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,IAAI,EAAE,CAAC;IACb,IAAI,GAAG;QAAE,GAAG,CAAC,SAAS,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,QAAiB;IAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC;QAAE,OAAO,mBAAmB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACtE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,IAAI,IAAI,IAAI,CAAC;IACb,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC;IACtB,IAAI,QAAQ,IAAI,IAAI,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC;QACtC,4EAA4E;QAC5E,OAAO,mBAAmB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,IAAI,CAAC,CAAC;IACV,0CAA0C;IAC1C,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,UAAU;QAAE,IAAI,IAAI,CAAC,CAAC;IAC1D,OAAO,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACzC,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,iBAAiB,CAAC,CAAa,EAAE,CAAa;IAC5D,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAEjC,IACE,CAAC,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3C,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,EAClC,CAAC;QACD,OAAO,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IAClF,CAAC;IACD,gFAAgF;IAChF,OAAO,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;AACxC,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,aAAa,CAAC,CAAa,EAAE,CAAa;IACxD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEhC,IACE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC;QACnC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC;QACnC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EACnC,CAAC;QACD,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO,WAAW,CAChB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACrD,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACzB,IAAI,CACL,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CACjB,IAAuB,EACvB,IAAY;IAEZ,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC;YAAE,EAAE,IAAI,EAAE,CAAC;;YACf,EAAE,IAAI,EAAE,CAAC;QACd,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;AACxB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,IAAI,CAClB,IAAuB,EACvB,IAAY,EACZ,IAAuB;IAEvB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAExB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACZ,qEAAqE;QACrE,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;QACpB,IAAI,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,mBAAmB,CAAC,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACZ;;;mBAGG;gBACH,MAAM,IAAI,EAAE,CAAC;gBACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;QACD,OAAO,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IACpB,IAAI,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC;IACtB,MAAM,CAAC,GAAG,mBAAmB,CAAC,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,IAAI,EAAE,CAAC;QACT,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;SAAM,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,EAAE,CAAC;IACf,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC;AACxB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,QAAQ,CACtB,IAAuB,EACvB,IAAY,EACZ,QAAiB,EACjB,MAAe,EACf,IAAuB;IAEvB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACd,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAExB,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;IAExB,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACjB,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IAClB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACZ;;;WAGG;QACH,CAAC,IAAI,EAAE,CAAC;QACR,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAED,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAChB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,IAAI,MAAM,EAAE,CAAC;QACX,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IAED,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC;QAClD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEvB;;;;OAIG;IACH,IAAI,CAAC,GAAG,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC5D,IAAI,MAAM,EAAE,CAAC;QACX,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACvD,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,IAAI,IAAI,EAAE,CAAC;QACT,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;SAAM,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;QAChE,MAAM,IAAI,CAAC,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/rng.d.ts

@@ -0,0 +1,168 @@
+/**
+ * Random number generation, ported from reference/src/z-rand.c (Angband
+ * 4.2.6).
+ *
+ * The upstream implementation is a single global WELL1024a stream with a
+ * "quick" LCRNG mode and a seed-swap trick for stable seeds (flavors,
+ * randarts). This port makes the generator instantiable so the engine can
+ * run named, independently seeded streams instead of swapping seeds on one
+ * global; each individual stream is bit-for-bit faithful to upstream.
+ *
+ * All arithmetic reproduces C uint32 semantics exactly (Math.imul for
+ * wrapping multiplication, >>> 0 for unsigned truncation, Math.trunc for
+ * C integer division). Golden vectors generated by an independent Python
+ * oracle (scripts/gen-rng-vectors.py) pin the outputs.
+ */
+/**
+ * Assumed maximum dungeon level, used for object/monster creation math.
+ */
+export declare const MAX_RAND_DEPTH = 128;
+/**
+ * The number of 32-bit integers worth of WELL seed state.
+ */
+export declare const RAND_DEG = 32;
+/**
+ * Random aspects used by damcalc, mBonusCalc, and randcalc.
+ * Order mirrors the upstream enum: MINIMISE, AVERAGE, MAXIMISE, EXTREMIFY,
+ * RANDOMISE.
+ */
+export type Aspect = "minimise" | "average" | "maximise" | "extremify" | "randomise";
+/**
+ * A strategy for making a dice roll: base + XdY + BONUS, where mBonus is
+ * used in a tricky way to determine BONUS.
+ */
+export interface RandomValue {
+    base: number;
+    dice: number;
+    sides: number;
+    mBonus: number;
+}
+/**
+ * A random chance of success, such as 8 in 125 (6.4 percent).
+ */
+export interface RandomChance {
+    numerator: number;
+    denominator: number;
+}
+/**
+ * Serializable snapshot of a generator, for savefiles.
+ */
+export interface RngState {
+    quick: boolean;
+    value: number;
+    state: number[];
+    stateI: number;
+    fixed: boolean;
+    fixval: number;
+}
+/**
+ * A single RNG stream: WELL1024a (the upstream "complex" RNG) with an
+ * optional LCRNG "quick" mode, faithful to z-rand.c.
+ */
+export declare class Rng {
+    private state;
+    private stateI;
+    private quick;
+    /** Rand_value: the quick-mode LCRNG state. */
+    private value;
+    private fixed;
+    private fixval;
+    constructor(seed: number, opts?: {
+        quick?: boolean;
+    });
+    /**
+     * Rand_state_init: seed the WELL table via LCRNG propagation, then cycle
+     * the table ten times per degree.
+     */
+    stateInit(seed: number): void;
+    /** WELLRNG1024a step. */
+    private well;
+    /**
+     * Rand_div: extract a random number from 0 to m - 1 via unbiased
+     * partitioned division of 28-bit values.
+     */
+    randDiv(m: number): number;
+    /** randint0(M): 0 <= X < M, uniform. */
+    randint0(m: number): number;
+    /** randint1(M): 1 <= X <= M, uniform. */
+    randint1(m: number): number;
+    /** one_in_(x): true one time in x. */
+    oneIn(x: number): boolean;
+    /** rand_range: A <= X <= B, uniform. */
+    randRange(a: number, b: number): number;
+    /** rand_spread(A, D): A - D <= X <= A + D, uniform. */
+    randSpread(a: number, d: number): number;
+    /**
+     * Rand_normal: a random integer from a (table-driven pseudo-)normal
+     * distribution with the given mean and standard deviation.
+     */
+    randNormal(mean: number, stand: number): number;
+    /**
+     * Rand_sample: an integer from a distribution with known mean and
+     * approximate bounds; standU/standL are 10x the assumed standard
+     * deviations to each bound.
+     */
+    randSample(mean: number, upper: number, lower: number, standU: number, standL: number): number;
+    /** damroll: sum of `num` rolls of a `sides`-sided die. */
+    damroll(num: number, sides: number): number;
+    /** Division that rounds up or down randomly, weighted by the remainder. */
+    private simulateDivision;
+    /**
+     * m_bonus: an enchantment bonus from a normal distribution whose mean
+     * approaches max as level approaches MAX_RAND_DEPTH.
+     */
+    mBonus(max: number, level: number): number;
+    /** m_bonus_calc: aspect-parameterized companion of mBonus. */
+    mBonusCalc(max: number, level: number, aspect: Aspect): number;
+    /** damcalc: aspect-parameterized companion of damroll. */
+    damcalc(num: number, sides: number, aspect: Aspect): number;
+    /** randcalc: evaluate a RandomValue under an aspect. */
+    randcalc(v: RandomValue, level: number, aspect: Aspect): number;
+    /** Whether `test` lies within the RandomValue's possible range. */
+    randcalcValid(v: RandomValue, test: number): boolean;
+    /** Whether the RandomValue actually varies. */
+    randcalcVaries(v: RandomValue): boolean;
+    /** random_chance_check: roll a numerator-in-denominator chance. */
+    randomChanceCheck(c: RandomChance): boolean;
+    /**
+     * rand_fix: make randDiv return a fixed percentage of its maximum rather
+     * than a random value (upstream test hook).
+     */
+    randFix(val: number): void;
+    /** Undo randFix (upstream never needs this; tests do). */
+    randUnfix(): void;
+    /** Snapshot the full generator state for savefiles. */
+    getState(): RngState;
+    /**
+     * Restore a snapshot taken with getState() (or a savefile rd_randomizer).
+     * Matches load.c L388-415: state_i is reduced modulo RAND_DEG and
+     * Rand_quick is forced false so the WELL stream continues (never the
+     * simple LCRNG). Fixed/fixval are not part of the C save block; they
+     * remain as restored for the port's test/debug seams only when present.
+     */
+    setState(s: RngState): void;
+}
+/**
+ * random_chance_scaled: rescale a chance ratio to a new denominator
+ * (pure arithmetic; no RNG state involved).
+ */
+export declare function randomChanceScaled(c: RandomChance, scale: number): number;
+/**
+ * A set of named, independently seeded RNG streams. This replaces the
+ * upstream seed-swap trick (seed_flavor, seed_randart) with first-class
+ * streams; each stream is a faithful WELL1024a generator.
+ */
+export declare class RngStreams {
+    private streams;
+    /** Create (or re-seed) the named stream. */
+    create(name: string, seed: number): Rng;
+    /** Get a stream; throws if it was never created. */
+    get(name: string): Rng;
+    has(name: string): boolean;
+    names(): string[];
+    /** Snapshot every stream, for savefiles. */
+    getState(): Record<string, RngState>;
+    /** Restore a snapshot taken with getState(). */
+    setState(states: Record<string, RngState>): void;
+}
+//# sourceMappingURL=rng.d.ts.map

package/dist/rng.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.d.ts","sourceRoot":"","sources":["../src/rng.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;GAEG;AACH,eAAO,MAAM,cAAc,MAAM,CAAC;AAElC;;GAEG;AACH,eAAO,MAAM,QAAQ,KAAK,CAAC;AAE3B;;;;GAIG;AACH,MAAM,MAAM,MAAM,GACd,UAAU,GACV,SAAS,GACT,UAAU,GACV,WAAW,GACX,WAAW,CAAC;AAEhB;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AA+CD;;;GAGG;AACH,qBAAa,GAAG;IACd,OAAO,CAAC,KAAK,CAA6B;IAC1C,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,KAAK,CAAU;IACvB,8CAA8C;IAC9C,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,MAAM,CAAK;gBAEP,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE;IAQpD;;;OAGG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAgB7B,yBAAyB;IACzB,OAAO,CAAC,IAAI;IAsBZ;;;OAGG;IACH,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAwB1B,wCAAwC;IACxC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI3B,yCAAyC;IACzC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI3B,sCAAsC;IACtC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAIzB,wCAAwC;IACxC,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAQvC,uDAAuD;IACvD,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIxC;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAkB/C;;;;OAIG;IACH,UAAU,CACR,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,MAAM;IAYT,0DAA0D;IAC1D,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAO3C,2EAA2E;IAC3E,OAAO,CAAC,gBAAgB;IAOxB;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAU1C,8DAA8D;IAC9D,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAc9D,0DAA0D;IAC1D,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAc3D,wDAAwD;IACxD,QAAQ,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAW/D,mEAAmE;IACnE,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;IAMpD,+CAA+C;IAC/C,cAAc,CAAC,CAAC,EAAE,WAAW,GAAG,OAAO;IAMvC,mEAAmE;IACnE,iBAAiB,CAAC,CAAC,EAAE,YAAY,GAAG,OAAO;IAI3C;;;OAGG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAK1B,0DAA0D;IAC1D,SAAS,IAAI,IAAI;IAKjB,uDAAuD;IACvD,QAAQ,IAAI,QAAQ;IAWpB;;;;;;OAMG;IACH,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI;CAc5B;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAEzE;AAED;;;;GAIG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,OAAO,CAA0B;IAEzC,4CAA4C;IAC5C,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,GAAG;IAMvC,oDAAoD;IACpD,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG;IAMtB,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI1B,KAAK,IAAI,MAAM,EAAE;IAIjB,4CAA4C;IAC5C,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC;IAMpC,gDAAgD;IAChD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,IAAI;CAQjD"}