@g9tm/syncdata 1.2.1

package/dist/internal/dotnetFormat.js

@@ -0,0 +1,207 @@
+// Invariant-culture number text exactly as .NET writes it, where G9SyncData hashes or stores that text: a computed
+// column's canonical text (G9CSyncDigest.CanonicalText) and the TEXT storage of decimals.
+/**
+ * `double.ToString(CultureInfo.InvariantCulture)` (.NET Core 3.0+): the shortest round-trip digits, in fixed notation
+ * unless the decimal exponent is 17 or more, or below -4, then `d.dddE+XX` (the golden vectors pin both edges).
+ */
+export function formatDouble(value) {
+    if (value !== value)
+        return 'NaN';
+    if (value === Infinity)
+        return 'Infinity';
+    if (value === -Infinity)
+        return '-Infinity';
+    if (value === 0)
+        return 1 / value < 0 ? '-0' : '0';
+    const negative = value < 0;
+    // toExponential() without an argument gives the shortest digits that round-trip, like .NET's.
+    const text = Math.abs(value).toExponential();
+    const e = text.indexOf('e');
+    const digits = text.slice(0, e).replace('.', '');
+    const exponent = parseInt(text.slice(e + 1), 10);
+    const scale = exponent + 1;
+    let out;
+    if (scale > 17 || scale < -3) {
+        const abs = Math.abs(exponent);
+        out = digits.charAt(0) + (digits.length > 1 ? '.' + digits.slice(1) : '') + 'E' + (exponent < 0 ? '-' : '+') + (abs < 10 ? '0' : '') + abs;
+    }
+    else if (scale <= 0) {
+        out = '0.' + repeat('0', -scale) + digits;
+    }
+    else if (scale >= digits.length) {
+        out = digits + repeat('0', scale - digits.length);
+    }
+    else {
+        out = digits.slice(0, scale) + '.' + digits.slice(scale);
+    }
+    return negative ? '-' + out : out;
+}
+function repeat(text, count) {
+    let out = '';
+    for (let i = 0; i < count; i++)
+        out += text;
+    return out;
+}
+/** Divides a 96-bit magnitude (three uint32 words, little-endian order) by a small divisor, in place; returns the remainder. */
+function divide96(words, divisor) {
+    let remainder = 0;
+    for (let i = 2; i >= 0; i--) {
+        // Two 16-bit steps keep every intermediate below 2^53.
+        const word = words[i];
+        let v = remainder * 65536 + (word >>> 16);
+        const qHigh = Math.floor(v / divisor);
+        remainder = v - qHigh * divisor;
+        v = remainder * 65536 + (word & 0xffff);
+        const qLow = Math.floor(v / divisor);
+        remainder = v - qLow * divisor;
+        words[i] = ((qHigh << 16) | qLow) >>> 0;
+    }
+    return remainder;
+}
+/** `decimal.ToString(CultureInfo.InvariantCulture)`: every digit of the magnitude, the scale kept (`1.50`, `0.000`). */
+export function formatDecimal(parts) {
+    const words = [parts.lo >>> 0, parts.mid >>> 0, parts.hi >>> 0];
+    let digits = '';
+    while (words[0] !== 0 || words[1] !== 0 || words[2] !== 0) {
+        const chunk = String(divide96(words, 10000000));
+        digits = (words[0] !== 0 || words[1] !== 0 || words[2] !== 0 ? '0000000'.slice(chunk.length) + chunk : chunk) + digits;
+    }
+    if (digits === '')
+        digits = '0';
+    const scale = parts.scale;
+    if (scale > 0) {
+        while (digits.length <= scale)
+            digits = '0' + digits;
+        digits = digits.slice(0, digits.length - scale) + '.' + digits.slice(digits.length - scale);
+    }
+    const zero = parts.lo === 0 && parts.mid === 0 && parts.hi === 0;
+    return parts.negative && !zero ? '-' + digits : digits;
+}
+const DOUBLE_POWERS_10 = [
+    1, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22, 1e23, 1e24, 1e25,
+    1e26, 1e27, 1e28,
+];
+/**
+ * `(double)decimal` exactly as .NET computes it (`DecCalc.VarR8FromDec`): `((double)low64 + (double)high · 2^64) /
+ * 10^scale`, each step an IEEE double operation, so the result matches .NET to the bit (it is not always the correctly
+ * rounded value, and must not be: the server compares what .NET stored).
+ */
+export function decimalToDouble(parts) {
+    const low64 = (parts.mid >>> 0) * 4294967296 + (parts.lo >>> 0);
+    const value = (low64 + (parts.hi >>> 0) * 18446744073709552000) / DOUBLE_POWERS_10[parts.scale];
+    return parts.negative ? -value : value;
+}
+/**
+ * Parses invariant decimal text (`decimal.Parse(text, NumberStyles.Number | NumberStyles.AllowExponent, Invariant)`
+ * for the forms SQLite and .NET produce: sign, digits, one '.', an optional exponent). Digits past 28 significant are
+ * rounded half to even… as .NET does (to the 96-bit limit). Returns null for text that is not a number.
+ */
+export function parseDecimal(text) {
+    var _a, _b;
+    const m = /^\s*([+-]?)(\d*)(?:\.(\d*))?(?:[eE]([+-]?\d+))?\s*$/.exec(text);
+    if (!m)
+        return null;
+    const intPart = (_a = m[2]) !== null && _a !== void 0 ? _a : '';
+    const fracPart = (_b = m[3]) !== null && _b !== void 0 ? _b : '';
+    if (intPart === '' && fracPart === '')
+        return null;
+    let digits = (intPart + fracPart).replace(/^0+/, '');
+    let scale = fracPart.length - (m[4] ? parseInt(m[4], 10) : 0);
+    if (digits === '')
+        return { lo: 0, mid: 0, hi: 0, scale: Math.max(0, Math.min(28, scale)), negative: m[1] === '-' };
+    // Negative scale: append zeros (the value is an integer).
+    while (scale < 0) {
+        digits += '0';
+        scale++;
+    }
+    // Too many digits for 96 bits or a scale past 28: round away the excess, half to even.
+    while (scale > 28 || !fits96(digits)) {
+        if (scale === 0)
+            return null; // overflow
+        const last = digits.charCodeAt(digits.length - 1) - 48;
+        digits = digits.slice(0, -1);
+        scale--;
+        if (last > 5 || (last === 5 && (digits.length === 0 || (digits.charCodeAt(digits.length - 1) - 48) % 2 === 1)))
+            digits = incrementDigits(digits);
+        if (digits === '')
+            digits = '0';
+    }
+    const words = toWords(digits);
+    return { lo: words[0], mid: words[1], hi: words[2], scale, negative: m[1] === '-' };
+}
+function incrementDigits(digits) {
+    const chars = digits.split('');
+    let i = chars.length - 1;
+    while (i >= 0) {
+        if (chars[i] === '9') {
+            chars[i] = '0';
+            i--;
+        }
+        else {
+            chars[i] = String.fromCharCode(chars[i].charCodeAt(0) + 1);
+            return chars.join('');
+        }
+    }
+    return '1' + chars.join('');
+}
+const MAX_96 = '79228162514264337593543950335';
+function fits96(digits) {
+    const d = digits.replace(/^0+/, '');
+    return d.length < MAX_96.length || (d.length === MAX_96.length && d <= MAX_96);
+}
+function toWords(digits) {
+    // 16-bit limbs, little-endian; value = value * 10 + digit.
+    const limbs = [0, 0, 0, 0, 0, 0];
+    for (let i = 0; i < digits.length; i++) {
+        let carry = digits.charCodeAt(i) - 48;
+        for (let k = 0; k < 6; k++) {
+            const v = limbs[k] * 10 + carry;
+            limbs[k] = v & 0xffff;
+            carry = Math.floor(v / 65536);
+        }
+    }
+    return [
+        ((limbs[1] << 16) | limbs[0]) >>> 0,
+        ((limbs[3] << 16) | limbs[2]) >>> 0,
+        ((limbs[5] << 16) | limbs[4]) >>> 0,
+    ];
+}
+/**
+ * `(decimal)double` exactly as .NET converts it (`new decimal(double)`, VarDecFromR8): the value rounded to 15
+ * significant digits, then trailing zeros dropped. Throws `RangeError` for NaN, infinities and |value| ≥ 7.9e28.
+ */
+export function doubleToDecimal(value) {
+    if (!isFinite(value))
+        throw new RangeError('Value was either too large or too small for a Decimal.');
+    if (value === 0)
+        return { lo: 0, mid: 0, hi: 0, scale: 0, negative: false };
+    if (Math.abs(value) >= 7.9228162514264338e28)
+        throw new RangeError('Value was either too large or too small for a Decimal.');
+    if (Math.abs(value) < 1e-28)
+        return { lo: 0, mid: 0, hi: 0, scale: 0, negative: value < 0 };
+    // 15 significant digits (toExponential(14) rounds half-even on the exact binary value, like .NET's double→decimal).
+    const text = Math.abs(value).toExponential(14);
+    const e = text.indexOf('e');
+    let digits = text.slice(0, e).replace('.', '');
+    const exponent = parseInt(text.slice(e + 1), 10);
+    digits = digits.replace(/0+$/, '');
+    if (digits === '')
+        digits = '0';
+    // value = digits × 10^(exponent − (digits.length − 1))
+    let scale = digits.length - 1 - exponent;
+    if (scale > 28) {
+        // Fewer digits fit: drop to scale 28 with rounding.
+        const parsed = parseDecimal(digits + 'e' + String(-scale));
+        if (!parsed)
+            throw new RangeError('Value was either too large or too small for a Decimal.');
+        parsed.negative = value < 0;
+        return parsed;
+    }
+    while (scale < 0) {
+        digits += '0';
+        scale++;
+    }
+    const words = toWords(digits);
+    return { lo: words[0], mid: words[1], hi: words[2], scale, negative: value < 0 };
+}
+//# sourceMappingURL=dotnetFormat.js.map

package/dist/internal/dotnetFormat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dotnetFormat.js","sourceRoot":"","sources":["../../src/internal/dotnetFormat.ts"],"names":[],"mappings":"AAAA,mHAAmH;AACnH,0FAA0F;AAE1F;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,KAAK,KAAK,QAAQ;QAAE,OAAO,UAAU,CAAC;IAC1C,IAAI,KAAK,KAAK,CAAC,QAAQ;QAAE,OAAO,WAAW,CAAC;IAC5C,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IACnD,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;IAC3B,8FAA8F;IAC9F,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;IAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC3B,IAAI,GAAW,CAAC;IAChB,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;IAC7I,CAAC;SAAM,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;IAC5C,CAAC;SAAM,IAAI,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,GAAG,GAAG,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACpC,CAAC;AAED,SAAS,MAAM,CAAC,IAAY,EAAE,KAAa;IACzC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,IAAI,CAAC;IAC5C,OAAO,GAAG,CAAC;AACb,CAAC;AAWD,gIAAgI;AAChI,SAAS,QAAQ,CAAC,KAAe,EAAE,OAAe;IAChD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,uDAAuD;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAChC,IAAI,CAAC,GAAG,SAAS,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QACtC,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,OAAO,CAAC;QAChC,CAAC,GAAG,SAAS,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QACrC,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,wHAAwH;AACxH,MAAM,UAAU,aAAa,CAAC,KAAmB;IAC/C,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAChE,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;QAChD,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;IACzH,CAAC;IACD,IAAI,MAAM,KAAK,EAAE;QAAE,MAAM,GAAG,GAAG,CAAC;IAChC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,OAAO,MAAM,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;QACrD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACjE,OAAO,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;AACzD,CAAC;AAED,MAAM,gBAAgB,GAAG;IACvB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IAC9I,IAAI,EAAE,IAAI,EAAE,IAAI;CACjB,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAmB;IACjD,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,oBAAoB,CAAC,GAAI,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAY,CAAC;IAC5G,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;;IACvC,MAAM,CAAC,GAAG,qDAAqD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3E,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,MAAM,OAAO,GAAG,MAAA,CAAC,CAAC,CAAC,CAAC,mCAAI,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,MAAA,CAAC,CAAC,CAAC,CAAC,mCAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,EAAE,IAAI,QAAQ,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,MAAM,GAAG,CAAC,OAAO,GAAG,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACrD,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,MAAM,KAAK,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;IACpH,0DAA0D;IAC1D,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,CAAC;QACd,KAAK,EAAE,CAAC;IACV,CAAC;IACD,uFAAuF;IACvF,OAAO,KAAK,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,WAAW;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACvD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,EAAE,CAAC;QACR,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACjJ,IAAI,MAAM,KAAK,EAAE;YAAE,MAAM,GAAG,GAAG,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;AACpH,CAAC;AAED,SAAS,eAAe,CAAC,MAAc;IACrC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACd,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACrB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACf,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAE,KAAK,CAAC,CAAC,CAAY,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvE,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,MAAM,GAAG,+BAA+B,CAAC;AAE/C,SAAS,MAAM,CAAC,MAAc;IAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACpC,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,OAAO,CAAC,MAAc;IAC7B,2DAA2D;IAC3D,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAI,KAAK,CAAC,CAAC,CAAY,GAAG,EAAE,GAAG,KAAK,CAAC;YAC5C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACtB,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO;QACL,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,IAAI,EAAE,CAAC,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,KAAK,CAAC;QAC3D,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,IAAI,EAAE,CAAC,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,KAAK,CAAC;QAC3D,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,IAAI,EAAE,CAAC,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,KAAK,CAAC;KAC5D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,wDAAwD,CAAC,CAAC;IACrG,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC5E,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,qBAAqB;QAAE,MAAM,IAAI,UAAU,CAAC,wDAAwD,CAAC,CAAC;IAC7H,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK;QAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;IAC5F,oHAAoH;IACpH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACnC,IAAI,MAAM,KAAK,EAAE;QAAE,MAAM,GAAG,GAAG,CAAC;IAChC,uDAAuD;IACvD,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC;IACzC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACf,oDAAoD;QACpD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,UAAU,CAAC,wDAAwD,CAAC,CAAC;QAC5F,MAAM,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,CAAC;QACd,KAAK,EAAE,CAAC;IACV,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;AACjH,CAAC","sourcesContent":["// Invariant-culture number text exactly as .NET writes it, where G9SyncData hashes or stores that text: a computed\n// column's canonical text (G9CSyncDigest.CanonicalText) and the TEXT storage of decimals.\n\n/**\n * `double.ToString(CultureInfo.InvariantCulture)` (.NET Core 3.0+): the shortest round-trip digits, in fixed notation\n * unless the decimal exponent is 17 or more, or below -4, then `d.dddE+XX` (the golden vectors pin both edges).\n */\nexport function formatDouble(value: number): string {\n  if (value !== value) return 'NaN';\n  if (value === Infinity) return 'Infinity';\n  if (value === -Infinity) return '-Infinity';\n  if (value === 0) return 1 / value < 0 ? '-0' : '0';\n  const negative = value < 0;\n  // toExponential() without an argument gives the shortest digits that round-trip, like .NET's.\n  const text = Math.abs(value).toExponential();\n  const e = text.indexOf('e');\n  const digits = text.slice(0, e).replace('.', '');\n  const exponent = parseInt(text.slice(e + 1), 10);\n  const scale = exponent + 1;\n  let out: string;\n  if (scale > 17 || scale < -3) {\n    const abs = Math.abs(exponent);\n    out = digits.charAt(0) + (digits.length > 1 ? '.' + digits.slice(1) : '') + 'E' + (exponent < 0 ? '-' : '+') + (abs < 10 ? '0' : '') + abs;\n  } else if (scale <= 0) {\n    out = '0.' + repeat('0', -scale) + digits;\n  } else if (scale >= digits.length) {\n    out = digits + repeat('0', scale - digits.length);\n  } else {\n    out = digits.slice(0, scale) + '.' + digits.slice(scale);\n  }\n  return negative ? '-' + out : out;\n}\n\nfunction repeat(text: string, count: number): string {\n  let out = '';\n  for (let i = 0; i < count; i++) out += text;\n  return out;\n}\n\n/** The parts of a .NET `decimal`: 96-bit magnitude as three 32-bit words, a scale 0..28 and a sign. */\nexport interface DecimalParts {\n  lo: number;\n  mid: number;\n  hi: number;\n  scale: number;\n  negative: boolean;\n}\n\n/** Divides a 96-bit magnitude (three uint32 words, little-endian order) by a small divisor, in place; returns the remainder. */\nfunction divide96(words: number[], divisor: number): number {\n  let remainder = 0;\n  for (let i = 2; i >= 0; i--) {\n    // Two 16-bit steps keep every intermediate below 2^53.\n    const word = words[i] as number;\n    let v = remainder * 65536 + (word >>> 16);\n    const qHigh = Math.floor(v / divisor);\n    remainder = v - qHigh * divisor;\n    v = remainder * 65536 + (word & 0xffff);\n    const qLow = Math.floor(v / divisor);\n    remainder = v - qLow * divisor;\n    words[i] = ((qHigh << 16) | qLow) >>> 0;\n  }\n  return remainder;\n}\n\n/** `decimal.ToString(CultureInfo.InvariantCulture)`: every digit of the magnitude, the scale kept (`1.50`, `0.000`). */\nexport function formatDecimal(parts: DecimalParts): string {\n  const words = [parts.lo >>> 0, parts.mid >>> 0, parts.hi >>> 0];\n  let digits = '';\n  while (words[0] !== 0 || words[1] !== 0 || words[2] !== 0) {\n    const chunk = String(divide96(words, 10000000));\n    digits = (words[0] !== 0 || words[1] !== 0 || words[2] !== 0 ? '0000000'.slice(chunk.length) + chunk : chunk) + digits;\n  }\n  if (digits === '') digits = '0';\n  const scale = parts.scale;\n  if (scale > 0) {\n    while (digits.length <= scale) digits = '0' + digits;\n    digits = digits.slice(0, digits.length - scale) + '.' + digits.slice(digits.length - scale);\n  }\n  const zero = parts.lo === 0 && parts.mid === 0 && parts.hi === 0;\n  return parts.negative && !zero ? '-' + digits : digits;\n}\n\nconst DOUBLE_POWERS_10 = [\n  1, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22, 1e23, 1e24, 1e25,\n  1e26, 1e27, 1e28,\n];\n\n/**\n * `(double)decimal` exactly as .NET computes it (`DecCalc.VarR8FromDec`): `((double)low64 + (double)high · 2^64) /\n * 10^scale`, each step an IEEE double operation, so the result matches .NET to the bit (it is not always the correctly\n * rounded value, and must not be: the server compares what .NET stored).\n */\nexport function decimalToDouble(parts: DecimalParts): number {\n  const low64 = (parts.mid >>> 0) * 4294967296 + (parts.lo >>> 0);\n  const value = (low64 + (parts.hi >>> 0) * 18446744073709552000) / (DOUBLE_POWERS_10[parts.scale] as number);\n  return parts.negative ? -value : value;\n}\n\n/**\n * Parses invariant decimal text (`decimal.Parse(text, NumberStyles.Number | NumberStyles.AllowExponent, Invariant)`\n * for the forms SQLite and .NET produce: sign, digits, one '.', an optional exponent). Digits past 28 significant are\n * rounded half to even… as .NET does (to the 96-bit limit). Returns null for text that is not a number.\n */\nexport function parseDecimal(text: string): DecimalParts | null {\n  const m = /^\\s*([+-]?)(\\d*)(?:\\.(\\d*))?(?:[eE]([+-]?\\d+))?\\s*$/.exec(text);\n  if (!m) return null;\n  const intPart = m[2] ?? '';\n  const fracPart = m[3] ?? '';\n  if (intPart === '' && fracPart === '') return null;\n  let digits = (intPart + fracPart).replace(/^0+/, '');\n  let scale = fracPart.length - (m[4] ? parseInt(m[4], 10) : 0);\n  if (digits === '') return { lo: 0, mid: 0, hi: 0, scale: Math.max(0, Math.min(28, scale)), negative: m[1] === '-' };\n  // Negative scale: append zeros (the value is an integer).\n  while (scale < 0) {\n    digits += '0';\n    scale++;\n  }\n  // Too many digits for 96 bits or a scale past 28: round away the excess, half to even.\n  while (scale > 28 || !fits96(digits)) {\n    if (scale === 0) return null; // overflow\n    const last = digits.charCodeAt(digits.length - 1) - 48;\n    digits = digits.slice(0, -1);\n    scale--;\n    if (last > 5 || (last === 5 && (digits.length === 0 || (digits.charCodeAt(digits.length - 1) - 48) % 2 === 1))) digits = incrementDigits(digits);\n    if (digits === '') digits = '0';\n  }\n  const words = toWords(digits);\n  return { lo: words[0] as number, mid: words[1] as number, hi: words[2] as number, scale, negative: m[1] === '-' };\n}\n\nfunction incrementDigits(digits: string): string {\n  const chars = digits.split('');\n  let i = chars.length - 1;\n  while (i >= 0) {\n    if (chars[i] === '9') {\n      chars[i] = '0';\n      i--;\n    } else {\n      chars[i] = String.fromCharCode((chars[i] as string).charCodeAt(0) + 1);\n      return chars.join('');\n    }\n  }\n  return '1' + chars.join('');\n}\n\nconst MAX_96 = '79228162514264337593543950335';\n\nfunction fits96(digits: string): boolean {\n  const d = digits.replace(/^0+/, '');\n  return d.length < MAX_96.length || (d.length === MAX_96.length && d <= MAX_96);\n}\n\nfunction toWords(digits: string): number[] {\n  // 16-bit limbs, little-endian; value = value * 10 + digit.\n  const limbs = [0, 0, 0, 0, 0, 0];\n  for (let i = 0; i < digits.length; i++) {\n    let carry = digits.charCodeAt(i) - 48;\n    for (let k = 0; k < 6; k++) {\n      const v = (limbs[k] as number) * 10 + carry;\n      limbs[k] = v & 0xffff;\n      carry = Math.floor(v / 65536);\n    }\n  }\n  return [\n    (((limbs[1] as number) << 16) | (limbs[0] as number)) >>> 0,\n    (((limbs[3] as number) << 16) | (limbs[2] as number)) >>> 0,\n    (((limbs[5] as number) << 16) | (limbs[4] as number)) >>> 0,\n  ];\n}\n\n/**\n * `(decimal)double` exactly as .NET converts it (`new decimal(double)`, VarDecFromR8): the value rounded to 15\n * significant digits, then trailing zeros dropped. Throws `RangeError` for NaN, infinities and |value| ≥ 7.9e28.\n */\nexport function doubleToDecimal(value: number): DecimalParts {\n  if (!isFinite(value)) throw new RangeError('Value was either too large or too small for a Decimal.');\n  if (value === 0) return { lo: 0, mid: 0, hi: 0, scale: 0, negative: false };\n  if (Math.abs(value) >= 7.9228162514264338e28) throw new RangeError('Value was either too large or too small for a Decimal.');\n  if (Math.abs(value) < 1e-28) return { lo: 0, mid: 0, hi: 0, scale: 0, negative: value < 0 };\n  // 15 significant digits (toExponential(14) rounds half-even on the exact binary value, like .NET's double→decimal).\n  const text = Math.abs(value).toExponential(14);\n  const e = text.indexOf('e');\n  let digits = text.slice(0, e).replace('.', '');\n  const exponent = parseInt(text.slice(e + 1), 10);\n  digits = digits.replace(/0+$/, '');\n  if (digits === '') digits = '0';\n  // value = digits × 10^(exponent − (digits.length − 1))\n  let scale = digits.length - 1 - exponent;\n  if (scale > 28) {\n    // Fewer digits fit: drop to scale 28 with rounding.\n    const parsed = parseDecimal(digits + 'e' + String(-scale));\n    if (!parsed) throw new RangeError('Value was either too large or too small for a Decimal.');\n    parsed.negative = value < 0;\n    return parsed;\n  }\n  while (scale < 0) {\n    digits += '0';\n    scale++;\n  }\n  const words = toWords(digits);\n  return { lo: words[0] as number, mid: words[1] as number, hi: words[2] as number, scale, negative: value < 0 };\n}\n"]}

package/dist/internal/md5.d.ts

@@ -0,0 +1,2 @@
+/** Writes the 16-byte MD5 of `source` to `destination` (offset 0) and returns it. */
+export declare function md5(source: Uint8Array, destination?: Uint8Array): Uint8Array;

package/dist/internal/md5.js

@@ -0,0 +1,97 @@
+// One-shot MD5 (RFC 1321), the twin of G9SyncData.Abstractions/G9CMd5.cs: the reconciliation hash's bucketing
+// function (ADR-0012), not a security boundary. Lynx has no WebCrypto (and WebCrypto has no MD5).
+const K = new Int32Array([
+    0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
+    0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
+    0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
+    0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
+    0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
+    0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
+    0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
+    0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
+]);
+const S = [
+    7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4,
+    11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,
+];
+const G = new Int32Array(64);
+for (let i = 0; i < 64; i++) {
+    G[i] = i < 16 ? i : i < 32 ? (5 * i + 1) & 15 : i < 48 ? (3 * i + 5) & 15 : (7 * i) & 15;
+}
+const M = new Int32Array(16);
+const TAIL = new Uint8Array(128);
+function block(data, offset, state) {
+    for (let i = 0; i < 16; i++) {
+        const j = offset + i * 4;
+        M[i] = data[j] | (data[j + 1] << 8) | (data[j + 2] << 16) | (data[j + 3] << 24);
+    }
+    let a = state[0];
+    let b = state[1];
+    let c = state[2];
+    let d = state[3];
+    for (let i = 0; i < 64; i++) {
+        let f;
+        switch (i >> 4) {
+            case 0:
+                f = (b & c) | (~b & d);
+                break;
+            case 1:
+                f = (d & b) | (~d & c);
+                break;
+            case 2:
+                f = b ^ c ^ d;
+                break;
+            default:
+                f = c ^ (b | ~d);
+                break;
+        }
+        const next = d;
+        d = c;
+        c = b;
+        const sum = (a + f + K[i] + M[G[i]]) | 0;
+        const s = S[i];
+        b = (b + ((sum << s) | (sum >>> (32 - s)))) | 0;
+        a = next;
+    }
+    state[0] = (state[0] + a) | 0;
+    state[1] = (state[1] + b) | 0;
+    state[2] = (state[2] + c) | 0;
+    state[3] = (state[3] + d) | 0;
+}
+/** Writes the 16-byte MD5 of `source` to `destination` (offset 0) and returns it. */
+export function md5(source, destination = new Uint8Array(16)) {
+    const state = new Int32Array([0x67452301, 0xefcdab89 | 0, 0x98badcfe | 0, 0x10325476]);
+    const length = source.length;
+    const full = length - (length % 64);
+    for (let offset = 0; offset < full; offset += 64)
+        block(source, offset, state);
+    // The tail, the 0x80 marker and the bit length: one or two final blocks.
+    TAIL.fill(0);
+    const remaining = length - full;
+    for (let i = 0; i < remaining; i++)
+        TAIL[i] = source[full + i];
+    TAIL[remaining] = 0x80;
+    const tailBytes = remaining < 56 ? 64 : 128;
+    const bitsLow = (length * 8) >>> 0;
+    const bitsHigh = Math.floor(length / 0x20000000) >>> 0;
+    const at = tailBytes - 8;
+    TAIL[at] = bitsLow & 0xff;
+    TAIL[at + 1] = (bitsLow >>> 8) & 0xff;
+    TAIL[at + 2] = (bitsLow >>> 16) & 0xff;
+    TAIL[at + 3] = (bitsLow >>> 24) & 0xff;
+    TAIL[at + 4] = bitsHigh & 0xff;
+    TAIL[at + 5] = (bitsHigh >>> 8) & 0xff;
+    TAIL[at + 6] = (bitsHigh >>> 16) & 0xff;
+    TAIL[at + 7] = (bitsHigh >>> 24) & 0xff;
+    for (let offset = 0; offset < tailBytes; offset += 64)
+        block(TAIL, offset, state);
+    for (let i = 0; i < 4; i++) {
+        const word = state[i];
+        destination[i * 4] = word & 0xff;
+        destination[i * 4 + 1] = (word >>> 8) & 0xff;
+        destination[i * 4 + 2] = (word >>> 16) & 0xff;
+        destination[i * 4 + 3] = (word >>> 24) & 0xff;
+    }
+    return destination;
+}
+//# sourceMappingURL=md5.js.map

package/dist/internal/md5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"md5.js","sourceRoot":"","sources":["../../src/internal/md5.ts"],"names":[],"mappings":"AAAA,8GAA8G;AAC9G,kGAAkG;AAElG,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC;IACvB,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;CAC/F,CAAC,CAAC;AAEH,MAAM,CAAC,GAAG;IACR,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;IACrH,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;CACpH,CAAC;AAEF,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;AAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;AAC3F,CAAC;AAED,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;AAC7B,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;AAEjC,SAAS,KAAK,CAAC,IAAgB,EAAE,MAAc,EAAE,KAAiB;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,CAAY,GAAG,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAY,IAAI,CAAC,CAAC,GAAG,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC,GAAG,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC,CAAC;IAClI,CAAC;IACD,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;IAC3B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;IAC3B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;IAC3B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAS,CAAC;QACd,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACf,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvB,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvB,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM;YACR;gBACE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM;QACV,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,CAAC,CAAC;QACN,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAI,CAAC,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAW,CAAY,CAAC,GAAG,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,CAAC;QACzB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChD,CAAC,GAAG,IAAI,CAAC;IACX,CAAC;IACD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,KAAK,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,KAAK,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,KAAK,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,KAAK,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,GAAG,CAAC,MAAkB,EAAE,cAA0B,IAAI,UAAU,CAAC,EAAE,CAAC;IAClF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,UAAU,EAAE,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IACpC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,EAAE;QAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAE/E,yEAAyE;IACzE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACb,MAAM,SAAS,GAAG,MAAM,GAAG,IAAI,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAW,CAAC;IACzE,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;IACvB,MAAM,SAAS,GAAG,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5C,MAAM,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,SAAS,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;IACtC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACvC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACvC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC;IAC/B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;IACvC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACxC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACxC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,IAAI,EAAE;QAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAElF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QAChC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACjC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAC7C,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QAC9C,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAChD,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC","sourcesContent":["// One-shot MD5 (RFC 1321), the twin of G9SyncData.Abstractions/G9CMd5.cs: the reconciliation hash's bucketing\n// function (ADR-0012), not a security boundary. Lynx has no WebCrypto (and WebCrypto has no MD5).\n\nconst K = new Int32Array([\n  0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,\n  0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,\n  0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,\n  0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,\n  0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,\n  0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,\n  0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,\n  0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,\n]);\n\nconst S = [\n  7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4,\n  11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,\n];\n\nconst G = new Int32Array(64);\nfor (let i = 0; i < 64; i++) {\n  G[i] = i < 16 ? i : i < 32 ? (5 * i + 1) & 15 : i < 48 ? (3 * i + 5) & 15 : (7 * i) & 15;\n}\n\nconst M = new Int32Array(16);\nconst TAIL = new Uint8Array(128);\n\nfunction block(data: Uint8Array, offset: number, state: Int32Array): void {\n  for (let i = 0; i < 16; i++) {\n    const j = offset + i * 4;\n    M[i] = (data[j] as number) | ((data[j + 1] as number) << 8) | ((data[j + 2] as number) << 16) | ((data[j + 3] as number) << 24);\n  }\n  let a = state[0] as number;\n  let b = state[1] as number;\n  let c = state[2] as number;\n  let d = state[3] as number;\n  for (let i = 0; i < 64; i++) {\n    let f: number;\n    switch (i >> 4) {\n      case 0:\n        f = (b & c) | (~b & d);\n        break;\n      case 1:\n        f = (d & b) | (~d & c);\n        break;\n      case 2:\n        f = b ^ c ^ d;\n        break;\n      default:\n        f = c ^ (b | ~d);\n        break;\n    }\n    const next = d;\n    d = c;\n    c = b;\n    const sum = (a + f + (K[i] as number) + (M[G[i] as number] as number)) | 0;\n    const s = S[i] as number;\n    b = (b + ((sum << s) | (sum >>> (32 - s)))) | 0;\n    a = next;\n  }\n  state[0] = ((state[0] as number) + a) | 0;\n  state[1] = ((state[1] as number) + b) | 0;\n  state[2] = ((state[2] as number) + c) | 0;\n  state[3] = ((state[3] as number) + d) | 0;\n}\n\n/** Writes the 16-byte MD5 of `source` to `destination` (offset 0) and returns it. */\nexport function md5(source: Uint8Array, destination: Uint8Array = new Uint8Array(16)): Uint8Array {\n  const state = new Int32Array([0x67452301, 0xefcdab89 | 0, 0x98badcfe | 0, 0x10325476]);\n  const length = source.length;\n  const full = length - (length % 64);\n  for (let offset = 0; offset < full; offset += 64) block(source, offset, state);\n\n  // The tail, the 0x80 marker and the bit length: one or two final blocks.\n  TAIL.fill(0);\n  const remaining = length - full;\n  for (let i = 0; i < remaining; i++) TAIL[i] = source[full + i] as number;\n  TAIL[remaining] = 0x80;\n  const tailBytes = remaining < 56 ? 64 : 128;\n  const bitsLow = (length * 8) >>> 0;\n  const bitsHigh = Math.floor(length / 0x20000000) >>> 0;\n  const at = tailBytes - 8;\n  TAIL[at] = bitsLow & 0xff;\n  TAIL[at + 1] = (bitsLow >>> 8) & 0xff;\n  TAIL[at + 2] = (bitsLow >>> 16) & 0xff;\n  TAIL[at + 3] = (bitsLow >>> 24) & 0xff;\n  TAIL[at + 4] = bitsHigh & 0xff;\n  TAIL[at + 5] = (bitsHigh >>> 8) & 0xff;\n  TAIL[at + 6] = (bitsHigh >>> 16) & 0xff;\n  TAIL[at + 7] = (bitsHigh >>> 24) & 0xff;\n  for (let offset = 0; offset < tailBytes; offset += 64) block(TAIL, offset, state);\n\n  for (let i = 0; i < 4; i++) {\n    const word = state[i] as number;\n    destination[i * 4] = word & 0xff;\n    destination[i * 4 + 1] = (word >>> 8) & 0xff;\n    destination[i * 4 + 2] = (word >>> 16) & 0xff;\n    destination[i * 4 + 3] = (word >>> 24) & 0xff;\n  }\n  return destination;\n}\n"]}

package/dist/internal/sha256.d.ts

@@ -0,0 +1,20 @@
+/** Incremental SHA-256 hasher (internal; the public entry point is {@link sha256Hex}). */
+export declare class Sha256 {
+    private readonly _state;
+    private readonly _w;
+    private readonly _block;
+    private _blockLength;
+    private _totalBytes;
+    private _finished;
+    /** Adds `data` to the hash. */
+    update(data: Uint8Array): this;
+    /** Finishes the hash and returns the 32-byte digest. The hasher cannot be updated afterwards. */
+    digest(): Uint8Array;
+    /** Finishes the hash and returns it as lower-case hex. */
+    hexDigest(): string;
+    private _compress;
+}
+/** Lower-case hex of `bytes` (.NET `Convert.ToHexStringLower`). */
+export declare function toHex(bytes: Uint8Array): string;
+/** SHA-256 of `bytes`. */
+export declare function sha256(bytes: Uint8Array): Uint8Array;

package/dist/internal/sha256.js

@@ -0,0 +1,153 @@
+// FIPS 180-4 SHA-256 (copied from @g9tm/signalr-supernetcore-client, bytes only). Lynx has no WebCrypto.
+const K = new Int32Array([
+    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+]);
+const INITIAL = [0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19];
+/** Incremental SHA-256 hasher (internal; the public entry point is {@link sha256Hex}). */
+export class Sha256 {
+    constructor() {
+        this._state = new Int32Array(INITIAL);
+        this._w = new Int32Array(64);
+        this._block = new Uint8Array(64);
+        this._blockLength = 0;
+        this._totalBytes = 0;
+        this._finished = false;
+    }
+    /** Adds `data` to the hash. */
+    update(data) {
+        if (this._finished)
+            throw new Error('SHA-256 digest was already computed; create a new hasher.');
+        const length = data.length;
+        this._totalBytes += length;
+        let offset = 0;
+        if (this._blockLength > 0) {
+            const take = Math.min(64 - this._blockLength, length);
+            this._block.set(data.subarray(0, take), this._blockLength);
+            this._blockLength += take;
+            offset = take;
+            if (this._blockLength === 64) {
+                this._compress(this._block, 0);
+                this._blockLength = 0;
+            }
+        }
+        while (offset + 64 <= length) {
+            this._compress(data, offset);
+            offset += 64;
+        }
+        if (offset < length) {
+            this._block.set(data.subarray(offset), 0);
+            this._blockLength = length - offset;
+        }
+        return this;
+    }
+    /** Finishes the hash and returns the 32-byte digest. The hasher cannot be updated afterwards. */
+    digest() {
+        if (this._finished)
+            throw new Error('SHA-256 digest was already computed; create a new hasher.');
+        this._finished = true;
+        const block = this._block;
+        let used = this._blockLength;
+        block[used++] = 0x80;
+        if (used > 56) {
+            block.fill(0, used);
+            this._compress(block, 0);
+            used = 0;
+        }
+        block.fill(0, used, 56);
+        // Message length in bits as a 64-bit big-endian integer (exact for inputs below 2^50 bytes).
+        const bytes = this._totalBytes;
+        const high = Math.floor(bytes / 0x20000000);
+        const low = (bytes * 8) >>> 0;
+        block[56] = high >>> 24;
+        block[57] = (high >>> 16) & 0xff;
+        block[58] = (high >>> 8) & 0xff;
+        block[59] = high & 0xff;
+        block[60] = low >>> 24;
+        block[61] = (low >>> 16) & 0xff;
+        block[62] = (low >>> 8) & 0xff;
+        block[63] = low & 0xff;
+        this._compress(block, 0);
+        const out = new Uint8Array(32);
+        for (let i = 0; i < 8; i++) {
+            const word = this._state[i];
+            out[i * 4] = word >>> 24;
+            out[i * 4 + 1] = (word >>> 16) & 0xff;
+            out[i * 4 + 2] = (word >>> 8) & 0xff;
+            out[i * 4 + 3] = word & 0xff;
+        }
+        return out;
+    }
+    /** Finishes the hash and returns it as lower-case hex. */
+    hexDigest() {
+        return toHex(this.digest());
+    }
+    _compress(data, offset) {
+        const w = this._w;
+        for (let i = 0; i < 16; i++) {
+            const j = offset + i * 4;
+            w[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | data[j + 3];
+        }
+        for (let i = 16; i < 64; i++) {
+            const x = w[i - 15];
+            const y = w[i - 2];
+            const s0 = ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);
+            const s1 = ((y >>> 17) | (y << 15)) ^ ((y >>> 19) | (y << 13)) ^ (y >>> 10);
+            w[i] = (w[i - 16] + s0 + w[i - 7] + s1) | 0;
+        }
+        const state = this._state;
+        let a = state[0];
+        let b = state[1];
+        let c = state[2];
+        let d = state[3];
+        let e = state[4];
+        let f = state[5];
+        let g = state[6];
+        let h = state[7];
+        for (let i = 0; i < 64; i++) {
+            const s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));
+            const ch = (e & f) ^ (~e & g);
+            const t1 = (h + s1 + ch + K[i] + w[i]) | 0;
+            const s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));
+            const maj = (a & b) ^ (a & c) ^ (b & c);
+            const t2 = (s0 + maj) | 0;
+            h = g;
+            g = f;
+            f = e;
+            e = (d + t1) | 0;
+            d = c;
+            c = b;
+            b = a;
+            a = (t1 + t2) | 0;
+        }
+        state[0] = (state[0] + a) | 0;
+        state[1] = (state[1] + b) | 0;
+        state[2] = (state[2] + c) | 0;
+        state[3] = (state[3] + d) | 0;
+        state[4] = (state[4] + e) | 0;
+        state[5] = (state[5] + f) | 0;
+        state[6] = (state[6] + g) | 0;
+        state[7] = (state[7] + h) | 0;
+    }
+}
+const HEX = [];
+for (let i = 0; i < 256; i++)
+    HEX.push((i < 16 ? '0' : '') + i.toString(16));
+/** Lower-case hex of `bytes` (.NET `Convert.ToHexStringLower`). */
+export function toHex(bytes) {
+    let out = '';
+    for (let i = 0; i < bytes.length; i++)
+        out += HEX[bytes[i]];
+    return out;
+}
+/** SHA-256 of `bytes`. */
+export function sha256(bytes) {
+    return new Sha256().update(bytes).digest();
+}
+//# sourceMappingURL=sha256.js.map

package/dist/internal/sha256.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sha256.js","sourceRoot":"","sources":["../../src/internal/sha256.ts"],"names":[],"mappings":"AAAA,yGAAyG;AAEzG,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC;IACvB,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;CAC/F,CAAC,CAAC;AAEH,MAAM,OAAO,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAEjH,0FAA0F;AAC1F,MAAM,OAAO,MAAM;IAAnB;QACmB,WAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,OAAE,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QACxB,WAAM,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QACrC,iBAAY,GAAG,CAAC,CAAC;QACjB,gBAAW,GAAG,CAAC,CAAC;QAChB,cAAS,GAAG,KAAK,CAAC;IA+H5B,CAAC;IA7HC,+BAA+B;IAC/B,MAAM,CAAC,IAAgB;QACrB,IAAI,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;QACjG,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,WAAW,IAAI,MAAM,CAAC;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC3D,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC;YAC1B,MAAM,GAAG,IAAI,CAAC;YACd,IAAI,IAAI,CAAC,YAAY,KAAK,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAC/B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,GAAG,EAAE,IAAI,MAAM,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC7B,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;QAED,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,GAAG,MAAM,GAAG,MAAM,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iGAAiG;IACjG,MAAM;QACJ,IAAI,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;QACjG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAEtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC;QAC7B,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;QACrB,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAExB,6FAA6F;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9B,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACjC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAChC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACxB,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC;QACvB,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QAChC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAC/B,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEzB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;YAC7B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;YACzB,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;YACtC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;YACrC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,0DAA0D;IAC1D,SAAS;QACP,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEO,SAAS,CAAC,IAAgB,EAAE,MAAc;QAChD,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACtF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1E,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5E,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACzF,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QAED,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAED,MAAM,GAAG,GAAa,EAAE,CAAC;AACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;IAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAE7E,mEAAmE;AACnE,MAAM,UAAU,KAAK,CAAC,KAAiB;IACrC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAW,CAAW,CAAC;IAChF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0BAA0B;AAC1B,MAAM,UAAU,MAAM,CAAC,KAAiB;IACtC,OAAO,IAAI,MAAM,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;AAC7C,CAAC","sourcesContent":["// FIPS 180-4 SHA-256 (copied from @g9tm/signalr-supernetcore-client, bytes only). Lynx has no WebCrypto.\n\nconst K = new Int32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n]);\n\nconst INITIAL = [0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19];\n\n/** Incremental SHA-256 hasher (internal; the public entry point is {@link sha256Hex}). */\nexport class Sha256 {\n  private readonly _state = new Int32Array(INITIAL);\n  private readonly _w = new Int32Array(64);\n  private readonly _block = new Uint8Array(64);\n  private _blockLength = 0;\n  private _totalBytes = 0;\n  private _finished = false;\n\n  /** Adds `data` to the hash. */\n  update(data: Uint8Array): this {\n    if (this._finished) throw new Error('SHA-256 digest was already computed; create a new hasher.');\n    const length = data.length;\n    this._totalBytes += length;\n    let offset = 0;\n\n    if (this._blockLength > 0) {\n      const take = Math.min(64 - this._blockLength, length);\n      this._block.set(data.subarray(0, take), this._blockLength);\n      this._blockLength += take;\n      offset = take;\n      if (this._blockLength === 64) {\n        this._compress(this._block, 0);\n        this._blockLength = 0;\n      }\n    }\n\n    while (offset + 64 <= length) {\n      this._compress(data, offset);\n      offset += 64;\n    }\n\n    if (offset < length) {\n      this._block.set(data.subarray(offset), 0);\n      this._blockLength = length - offset;\n    }\n    return this;\n  }\n\n  /** Finishes the hash and returns the 32-byte digest. The hasher cannot be updated afterwards. */\n  digest(): Uint8Array {\n    if (this._finished) throw new Error('SHA-256 digest was already computed; create a new hasher.');\n    this._finished = true;\n\n    const block = this._block;\n    let used = this._blockLength;\n    block[used++] = 0x80;\n    if (used > 56) {\n      block.fill(0, used);\n      this._compress(block, 0);\n      used = 0;\n    }\n    block.fill(0, used, 56);\n\n    // Message length in bits as a 64-bit big-endian integer (exact for inputs below 2^50 bytes).\n    const bytes = this._totalBytes;\n    const high = Math.floor(bytes / 0x20000000);\n    const low = (bytes * 8) >>> 0;\n    block[56] = high >>> 24;\n    block[57] = (high >>> 16) & 0xff;\n    block[58] = (high >>> 8) & 0xff;\n    block[59] = high & 0xff;\n    block[60] = low >>> 24;\n    block[61] = (low >>> 16) & 0xff;\n    block[62] = (low >>> 8) & 0xff;\n    block[63] = low & 0xff;\n    this._compress(block, 0);\n\n    const out = new Uint8Array(32);\n    for (let i = 0; i < 8; i++) {\n      const word = this._state[i]!;\n      out[i * 4] = word >>> 24;\n      out[i * 4 + 1] = (word >>> 16) & 0xff;\n      out[i * 4 + 2] = (word >>> 8) & 0xff;\n      out[i * 4 + 3] = word & 0xff;\n    }\n    return out;\n  }\n\n  /** Finishes the hash and returns it as lower-case hex. */\n  hexDigest(): string {\n    return toHex(this.digest());\n  }\n\n  private _compress(data: Uint8Array, offset: number): void {\n    const w = this._w;\n    for (let i = 0; i < 16; i++) {\n      const j = offset + i * 4;\n      w[i] = (data[j]! << 24) | (data[j + 1]! << 16) | (data[j + 2]! << 8) | data[j + 3]!;\n    }\n    for (let i = 16; i < 64; i++) {\n      const x = w[i - 15]!;\n      const y = w[i - 2]!;\n      const s0 = ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n      const s1 = ((y >>> 17) | (y << 15)) ^ ((y >>> 19) | (y << 13)) ^ (y >>> 10);\n      w[i] = (w[i - 16]! + s0 + w[i - 7]! + s1) | 0;\n    }\n\n    const state = this._state;\n    let a = state[0]!;\n    let b = state[1]!;\n    let c = state[2]!;\n    let d = state[3]!;\n    let e = state[4]!;\n    let f = state[5]!;\n    let g = state[6]!;\n    let h = state[7]!;\n\n    for (let i = 0; i < 64; i++) {\n      const s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));\n      const ch = (e & f) ^ (~e & g);\n      const t1 = (h + s1 + ch + K[i]! + w[i]!) | 0;\n      const s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));\n      const maj = (a & b) ^ (a & c) ^ (b & c);\n      const t2 = (s0 + maj) | 0;\n      h = g;\n      g = f;\n      f = e;\n      e = (d + t1) | 0;\n      d = c;\n      c = b;\n      b = a;\n      a = (t1 + t2) | 0;\n    }\n\n    state[0] = (state[0]! + a) | 0;\n    state[1] = (state[1]! + b) | 0;\n    state[2] = (state[2]! + c) | 0;\n    state[3] = (state[3]! + d) | 0;\n    state[4] = (state[4]! + e) | 0;\n    state[5] = (state[5]! + f) | 0;\n    state[6] = (state[6]! + g) | 0;\n    state[7] = (state[7]! + h) | 0;\n  }\n}\n\nconst HEX: string[] = [];\nfor (let i = 0; i < 256; i++) HEX.push((i < 16 ? '0' : '') + i.toString(16));\n\n/** Lower-case hex of `bytes` (.NET `Convert.ToHexStringLower`). */\nexport function toHex(bytes: Uint8Array): string {\n  let out = '';\n  for (let i = 0; i < bytes.length; i++) out += HEX[bytes[i] as number] as string;\n  return out;\n}\n\n/** SHA-256 of `bytes`. */\nexport function sha256(bytes: Uint8Array): Uint8Array {\n  return new Sha256().update(bytes).digest();\n}\n"]}

package/dist/internal/utf8.d.ts

@@ -0,0 +1,8 @@
+/** UTF-8 bytes of `text`. */
+export declare function utf8Encode(text: string): Uint8Array;
+/** Text of UTF-8 `bytes`. */
+export declare function utf8Decode(bytes: Uint8Array): string;
+/** The pure-JS encoder (exported for tests; use {@link utf8Encode}). */
+export declare function utf8EncodeJs(text: string): Uint8Array;
+/** The pure-JS decoder, the WHATWG UTF-8 decode algorithm (exported for tests; use {@link utf8Decode}). */
+export declare function utf8DecodeJs(bytes: Uint8Array): string;