@mtcute/core 0.16.6 → 0.16.9

package/cjs/types/index.js

@@ -1,20 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./errors.js"), exports);
-__exportStar(require("./peers.js"), exports);
-__exportStar(require("./utils.js"), exports);
-//# sourceMappingURL=index.js.map

package/cjs/types/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,8CAA2B;AAC3B,6CAA0B;AAC1B,6CAA0B","sourcesContent":["export * from './errors.js'\nexport * from './peers.js'\nexport * from './utils.js'\n"]}

package/cjs/types/peers.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=peers.js.map

package/cjs/types/peers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"peers.js","sourceRoot":"","sources":["../../../src/types/peers.ts"],"names":[],"mappings":"","sourcesContent":["/**\n * Peer types that have one-to-one relation to `tl.Peer*` types.\n */\nexport type BasicPeerType = 'user' | 'chat' | 'channel'\n"]}

package/cjs/types/utils.d.ts

@@ -1,10 +0,0 @@
-export type MaybePromise<T> = T | Promise<T>;
-export type PartialExcept<T, K extends keyof T> = Partial<Omit<T, K>> & Pick<T, K>;
-export type PartialOnly<T, K extends keyof T> = Partial<Pick<T, K>> & Omit<T, K>;
-export type AnyToNever<T> = any extends T ? never : T;
-export type MaybeArray<T> = T | T[];
-export type MustEqual<T, V> = (() => T) extends () => V ? ((() => V) extends () => T ? T : V) : V;
-export type PublicPart<T> = {
-    [K in keyof T]: T[K];
-};
-export declare function assertNever(x: never): never;

package/cjs/types/utils.js

@@ -1,9 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.assertNever = void 0;
-// eslint-disable-next-line @typescript-eslint/no-unused-vars
-function assertNever(x) {
-    throw new Error('Illegal state');
-}
-exports.assertNever = assertNever;
-//# sourceMappingURL=utils.js.map

package/cjs/types/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../src/types/utils.ts"],"names":[],"mappings":";;;AAYA,6DAA6D;AAC7D,SAAgB,WAAW,CAAC,CAAQ;IAChC,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAA;AACpC,CAAC;AAFD,kCAEC","sourcesContent":["export type MaybePromise<T> = T | Promise<T>\nexport type PartialExcept<T, K extends keyof T> = Partial<Omit<T, K>> & Pick<T, K>\nexport type PartialOnly<T, K extends keyof T> = Partial<Pick<T, K>> & Omit<T, K>\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport type AnyToNever<T> = any extends T ? never : T\n\nexport type MaybeArray<T> = T | T[]\n\nexport type MustEqual<T, V> = (() => T) extends () => V ? ((() => V) extends () => T ? T : V) : V\n\nexport type PublicPart<T> = { [K in keyof T]: T[K] }\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nexport function assertNever(x: never): never {\n    throw new Error('Illegal state')\n}\n"]}

package/cjs/utils/abort-signal.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.combineAbortSignals = void 0;
-function combineAbortSignals(signal1, signal2) {
-    if (!signal2)
-        return signal1;
-    const controller = new AbortController();
-    signal1.addEventListener('abort', () => controller.abort());
-    signal2.addEventListener('abort', () => controller.abort());
-    return controller.signal;
-}
-exports.combineAbortSignals = combineAbortSignals;
-//# sourceMappingURL=abort-signal.js.map

package/cjs/utils/abort-signal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abort-signal.js","sourceRoot":"","sources":["../../../src/utils/abort-signal.ts"],"names":[],"mappings":";;;AAAA,SAAgB,mBAAmB,CAAC,OAAoB,EAAE,OAAqB;IAC3E,IAAI,CAAC,OAAO;QAAE,OAAO,OAAO,CAAA;IAE5B,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAA;IAExC,OAAO,CAAC,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAA;IAC3D,OAAO,CAAC,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAA;IAE3D,OAAO,UAAU,CAAC,MAAM,CAAA;AAC5B,CAAC;AATD,kDASC","sourcesContent":["export function combineAbortSignals(signal1: AbortSignal, signal2?: AbortSignal): AbortSignal {\n    if (!signal2) return signal1\n\n    const controller = new AbortController()\n\n    signal1.addEventListener('abort', () => controller.abort())\n    signal2.addEventListener('abort', () => controller.abort())\n\n    return controller.signal\n}\n"]}

package/cjs/utils/async-lock.js

@@ -1,41 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AsyncLock = void 0;
-const deque_js_1 = require("./deque.js");
-/**
- * Simple class implementing a semaphore like
- * behaviour.
- */
-class AsyncLock {
-    _queue = new deque_js_1.Deque();
-    async acquire() {
-        let info;
-        while ((info = this._queue.peekFront())) {
-            await info[0];
-        }
-        let unlock;
-        const prom = new Promise((resolve) => {
-            unlock = resolve;
-        });
-        this._queue.pushBack([prom, unlock]);
-    }
-    release() {
-        if (!this._queue.length)
-            throw new Error('Nothing to release');
-        this._queue.popFront()[1]();
-    }
-    with(func) {
-        let err = null;
-        return this.acquire()
-            .then(() => func())
-            .catch((e) => void (err = e))
-            .then(() => {
-            this.release();
-            // eslint-disable-next-line @typescript-eslint/no-throw-literal
-            if (err)
-                throw err;
-        });
-    }
-}
-exports.AsyncLock = AsyncLock;
-//# sourceMappingURL=async-lock.js.map

package/cjs/utils/async-lock.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-lock.js","sourceRoot":"","sources":["../../../src/utils/async-lock.ts"],"names":[],"mappings":";;;AAAA,yCAAkC;AAIlC;;;GAGG;AACH,MAAa,SAAS;IACV,MAAM,GAAG,IAAI,gBAAK,EAAY,CAAA;IAEtC,KAAK,CAAC,OAAO;QACT,IAAI,IAAI,CAAA;QAER,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,CAAC;QAED,IAAI,MAAkB,CAAA;QACtB,MAAM,IAAI,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YACvC,MAAM,GAAG,OAAO,CAAA;QACpB,CAAC,CAAC,CAAA;QAEF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,MAAO,CAAC,CAAC,CAAA;IACzC,CAAC;IAED,OAAO;QACH,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;QAE9D,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAG,CAAC,CAAC,CAAC,EAAE,CAAA;IAChC,CAAC;IAED,IAAI,CAAC,IAAyB;QAC1B,IAAI,GAAG,GAAY,IAAI,CAAA;QAEvB,OAAO,IAAI,CAAC,OAAO,EAAE;aAChB,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;aAClB,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;aAC5B,IAAI,CAAC,GAAG,EAAE;YACP,IAAI,CAAC,OAAO,EAAE,CAAA;YACd,+DAA+D;YAC/D,IAAI,GAAG;gBAAE,MAAM,GAAG,CAAA;QACtB,CAAC,CAAC,CAAA;IACV,CAAC;CACJ;AApCD,8BAoCC","sourcesContent":["import { Deque } from './deque.js'\n\ntype LockInfo = [Promise<void>, () => void]\n\n/**\n * Simple class implementing a semaphore like\n * behaviour.\n */\nexport class AsyncLock {\n    private _queue = new Deque<LockInfo>()\n\n    async acquire(): Promise<void> {\n        let info\n\n        while ((info = this._queue.peekFront())) {\n            await info[0]\n        }\n\n        let unlock: () => void\n        const prom = new Promise<void>((resolve) => {\n            unlock = resolve\n        })\n\n        this._queue.pushBack([prom, unlock!])\n    }\n\n    release(): void {\n        if (!this._queue.length) throw new Error('Nothing to release')\n\n        this._queue.popFront()![1]()\n    }\n\n    with(func: () => Promise<void>): Promise<void> {\n        let err: unknown = null\n\n        return this.acquire()\n            .then(() => func())\n            .catch((e) => void (err = e))\n            .then(() => {\n                this.release()\n                // eslint-disable-next-line @typescript-eslint/no-throw-literal\n                if (err) throw err\n            })\n    }\n}\n"]}

package/cjs/utils/bigint-utils.js

@@ -1,205 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.bigIntModInv = exports.bigIntModPow = exports.bigIntGcd = exports.bigIntAbs = exports.bigIntMin = exports.twoMultiplicity = exports.randomBigIntInRange = exports.randomBigIntBits = exports.randomBigInt = exports.bufferToBigInt = exports.bigIntToBuffer = exports.bigIntBitLength = void 0;
-const buffer_utils_js_1 = require("./buffer-utils.js");
-/**
- * Get the minimum number of bits required to represent a number
- */
-function bigIntBitLength(n) {
-    // not the fastest way, but at least not .toString(2) and not too complex
-    // taken from: https://stackoverflow.com/a/76616288/22656950
-    const i = (n.toString(16).length - 1) * 4;
-    return i + 32 - Math.clz32(Number(n >> BigInt(i)));
-}
-exports.bigIntBitLength = bigIntBitLength;
-/**
- * Convert a big integer to a buffer
- *
- * @param value  Value to convert
- * @param length  Length of the resulting buffer (by default it's the minimum required)
- * @param le  Whether to use little-endian encoding
- */
-function bigIntToBuffer(value, length = 0, le = false) {
-    const bits = bigIntBitLength(value);
-    const bytes = Math.ceil(bits / 8);
-    if (length !== 0 && bytes > length) {
-        throw new Error('Value out of bounds');
-    }
-    if (length === 0)
-        length = bytes;
-    const buf = new ArrayBuffer(length);
-    const u8 = new Uint8Array(buf);
-    const unaligned = length % 8;
-    const dv = new DataView(buf, 0, length - unaligned);
-    // it is faster to work with 64-bit words than with bytes directly
-    for (let i = 0; i < dv.byteLength; i += 8) {
-        dv.setBigUint64(i, value & 0xffffffffffffffffn, true);
-        value >>= 64n;
-    }
-    if (unaligned > 0) {
-        for (let i = length - unaligned; i < length; i++) {
-            u8[i] = Number(value & 0xffn);
-            value >>= 8n;
-        }
-    }
-    if (!le)
-        u8.reverse();
-    return u8;
-}
-exports.bigIntToBuffer = bigIntToBuffer;
-/**
- * Convert a buffer to a big integer
- *
- * @param buffer  Buffer to convert
- * @param le  Whether to use little-endian encoding
- */
-function bufferToBigInt(buffer, le = false) {
-    if (le)
-        buffer = (0, buffer_utils_js_1.bufferToReversed)(buffer);
-    const unaligned = buffer.length % 8;
-    const dv = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength - unaligned);
-    let res = 0n;
-    // it is faster to work with 64-bit words than with bytes directly
-    for (let i = 0; i < dv.byteLength; i += 8) {
-        res = (res << 64n) | BigInt(dv.getBigUint64(i, false));
-    }
-    if (unaligned > 0) {
-        for (let i = buffer.length - unaligned; i < buffer.length; i++) {
-            res = (res << 8n) | BigInt(buffer[i]);
-        }
-    }
-    return res;
-}
-exports.bufferToBigInt = bufferToBigInt;
-/**
- * Generate a cryptographically safe random big integer of the given size (in bytes)
- * @param size  Size in bytes
- */
-function randomBigInt(crypto, size) {
-    return bufferToBigInt(crypto.randomBytes(size));
-}
-exports.randomBigInt = randomBigInt;
-/**
- * Generate a random big integer of the given size (in bits)
- * @param bits
- */
-function randomBigIntBits(crypto, bits) {
-    let num = randomBigInt(crypto, Math.ceil(bits / 8));
-    const bitLength = bigIntBitLength(num);
-    if (bitLength > bits) {
-        const toTrim = bitLength - bits;
-        num >>= BigInt(toTrim);
-    }
-    return num;
-}
-exports.randomBigIntBits = randomBigIntBits;
-/**
- * Generate a random big integer in the range [min, max)
- *
- * @param max  Maximum value (exclusive)
- * @param min  Minimum value (inclusive)
- */
-function randomBigIntInRange(crypto, max, min = 1n) {
-    const interval = max - min;
-    if (interval < 0n)
-        throw new Error('expected min < max');
-    const byteSize = Math.ceil(bigIntBitLength(interval) / 8);
-    let result = randomBigInt(crypto, byteSize);
-    while (result > interval)
-        result -= interval;
-    return min + result;
-}
-exports.randomBigIntInRange = randomBigIntInRange;
-/**
- * Compute the multiplicity of 2 in the prime factorization of n
- * @param n
- */
-function twoMultiplicity(n) {
-    if (n === 0n)
-        return 0n;
-    let m = 0n;
-    let pow = 1n;
-    while (true) {
-        if ((n & pow) !== 0n)
-            return m;
-        m += 1n;
-        pow <<= 1n;
-    }
-}
-exports.twoMultiplicity = twoMultiplicity;
-function bigIntMin(a, b) {
-    return a < b ? a : b;
-}
-exports.bigIntMin = bigIntMin;
-function bigIntAbs(a) {
-    return a < 0n ? -a : a;
-}
-exports.bigIntAbs = bigIntAbs;
-function bigIntGcd(a, b) {
-    // using euclidean algorithm is fast enough on smaller numbers
-    // https://en.wikipedia.org/wiki/Euclidean_algorithm#Implementations
-    while (b !== 0n) {
-        const t = b;
-        b = a % b;
-        a = t;
-    }
-    return a;
-}
-exports.bigIntGcd = bigIntGcd;
-function bigIntModPow(base, exp, mod) {
-    // using the binary method is good enough for our use case
-    // https://en.wikipedia.org/wiki/Modular_exponentiation#Right-to-left_binary_method
-    base %= mod;
-    let result = 1n;
-    while (exp > 0n) {
-        if (exp % 2n === 1n) {
-            result = (result * base) % mod;
-        }
-        exp >>= 1n;
-        base = base ** 2n % mod;
-    }
-    return result;
-}
-exports.bigIntModPow = bigIntModPow;
-// below code is based on https://github.com/juanelas/bigint-mod-arith, MIT license
-function eGcd(a, b) {
-    let x = 0n;
-    let y = 1n;
-    let u = 1n;
-    let v = 0n;
-    while (a !== 0n) {
-        const q = b / a;
-        const r = b % a;
-        const m = x - u * q;
-        const n = y - v * q;
-        b = a;
-        a = r;
-        x = u;
-        y = v;
-        u = m;
-        v = n;
-    }
-    return [b, x, y];
-}
-function toZn(a, n) {
-    if (typeof a === 'number')
-        a = BigInt(a);
-    if (typeof n === 'number')
-        n = BigInt(n);
-    if (n <= 0n) {
-        throw new RangeError('n must be > 0');
-    }
-    const aZn = a % n;
-    return aZn < 0n ? aZn + n : aZn;
-}
-function bigIntModInv(a, n) {
-    const [g, x] = eGcd(toZn(a, n), n);
-    if (g !== 1n) {
-        throw new RangeError(`${a.toString()} does not have inverse modulo ${n.toString()}`); // modular inverse does not exist
-    }
-    else {
-        return toZn(x, n);
-    }
-}
-exports.bigIntModInv = bigIntModInv;
-//# sourceMappingURL=bigint-utils.js.map

package/cjs/utils/bigint-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bigint-utils.js","sourceRoot":"","sources":["../../../src/utils/bigint-utils.ts"],"names":[],"mappings":";;;AAAA,uDAAoD;AAGpD;;GAEG;AACH,SAAgB,eAAe,CAAC,CAAS;IACrC,yEAAyE;IACzE,4DAA4D;IAE5D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;IAEzC,OAAO,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,CAAC;AAPD,0CAOC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,KAAa,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK;IAChE,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;IAEjC,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;IAC1C,CAAC;IAED,IAAI,MAAM,KAAK,CAAC;QAAE,MAAM,GAAG,KAAK,CAAA;IAEhC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAE9B,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;IAEnD,kEAAkE;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,mBAAmB,EAAE,IAAI,CAAC,CAAA;QACrD,KAAK,KAAK,GAAG,CAAA;IACjB,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAA;YAC7B,KAAK,KAAK,EAAE,CAAA;QAChB,CAAC;IACL,CAAC;IAED,IAAI,CAAC,EAAE;QAAE,EAAE,CAAC,OAAO,EAAE,CAAA;IAErB,OAAO,EAAE,CAAA;AACb,CAAC;AAhCD,wCAgCC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,MAAkB,EAAE,EAAE,GAAG,KAAK;IACzD,IAAI,EAAE;QAAE,MAAM,GAAG,IAAA,kCAAgB,EAAC,MAAM,CAAC,CAAA;IAEzC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC,CAAA;IAExF,IAAI,GAAG,GAAG,EAAE,CAAA;IAEZ,kEAAkE;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;IAC1D,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACzC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AApBD,wCAoBC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,MAAuB,EAAE,IAAY;IAC9D,OAAO,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAA;AACnD,CAAC;AAFD,oCAEC;AAED;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,MAAuB,EAAE,IAAY;IAClE,IAAI,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;IAEnD,MAAM,SAAS,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAEtC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,SAAS,GAAG,IAAI,CAAA;QAC/B,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAA;IAC1B,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAXD,4CAWC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,EAAE;IAC9E,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAA;IAC1B,IAAI,QAAQ,GAAG,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;IAExD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAEzD,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IAC3C,OAAO,MAAM,GAAG,QAAQ;QAAE,MAAM,IAAI,QAAQ,CAAA;IAE5C,OAAO,GAAG,GAAG,MAAM,CAAA;AACvB,CAAC;AAVD,kDAUC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAC,CAAS;IACrC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAA;IAEvB,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,GAAG,GAAG,EAAE,CAAA;IAEZ,OAAO,IAAI,EAAE,CAAC;QACV,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE;YAAE,OAAO,CAAC,CAAA;QAC9B,CAAC,IAAI,EAAE,CAAA;QACP,GAAG,KAAK,EAAE,CAAA;IACd,CAAC;AACL,CAAC;AAXD,0CAWC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,CAAS;IAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACxB,CAAC;AAFD,8BAEC;AAED,SAAgB,SAAS,CAAC,CAAS;IAC/B,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC1B,CAAC;AAFD,8BAEC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,CAAS;IAC1C,8DAA8D;IAC9D,oEAAoE;IAEpE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,CAAA;QACX,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACT,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;IAED,OAAO,CAAC,CAAA;AACZ,CAAC;AAXD,8BAWC;AAED,SAAgB,YAAY,CAAC,IAAY,EAAE,GAAW,EAAE,GAAW;IAC/D,0DAA0D;IAC1D,mFAAmF;IAEnF,IAAI,IAAI,GAAG,CAAA;IAEX,IAAI,MAAM,GAAG,EAAE,CAAA;IAEf,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAClB,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,GAAG,CAAA;QAClC,CAAC;QAED,GAAG,KAAK,EAAE,CAAA;QACV,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,CAAA;IAC3B,CAAC;IAED,OAAO,MAAM,CAAA;AACjB,CAAC;AAlBD,oCAkBC;AAED,mFAAmF;AAEnF,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;IAC9B,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IAEV,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACf,MAAM,CAAC,GAAW,CAAC,GAAG,CAAC,CAAA;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnB,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;IACT,CAAC;IAED,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACpB,CAAC;AAED,SAAS,IAAI,CAAC,CAAkB,EAAE,CAAkB;IAChD,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACxC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IAExC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACV,MAAM,IAAI,UAAU,CAAC,eAAe,CAAC,CAAA;IACzC,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;IAEjB,OAAO,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;AACnC,CAAC;AAED,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAElC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACX,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,iCAAiC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA,CAAC,iCAAiC;IAC1H,CAAC;SAAM,CAAC;QACJ,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrB,CAAC;AACL,CAAC;AARD,oCAQC","sourcesContent":["import { bufferToReversed } from './buffer-utils.js'\nimport { ICryptoProvider } from './crypto/abstract.js'\n\n/**\n * Get the minimum number of bits required to represent a number\n */\nexport function bigIntBitLength(n: bigint) {\n    // not the fastest way, but at least not .toString(2) and not too complex\n    // taken from: https://stackoverflow.com/a/76616288/22656950\n\n    const i = (n.toString(16).length - 1) * 4\n\n    return i + 32 - Math.clz32(Number(n >> BigInt(i)))\n}\n\n/**\n * Convert a big integer to a buffer\n *\n * @param value  Value to convert\n * @param length  Length of the resulting buffer (by default it's the minimum required)\n * @param le  Whether to use little-endian encoding\n */\nexport function bigIntToBuffer(value: bigint, length = 0, le = false): Uint8Array {\n    const bits = bigIntBitLength(value)\n    const bytes = Math.ceil(bits / 8)\n\n    if (length !== 0 && bytes > length) {\n        throw new Error('Value out of bounds')\n    }\n\n    if (length === 0) length = bytes\n\n    const buf = new ArrayBuffer(length)\n    const u8 = new Uint8Array(buf)\n\n    const unaligned = length % 8\n    const dv = new DataView(buf, 0, length - unaligned)\n\n    // it is faster to work with 64-bit words than with bytes directly\n    for (let i = 0; i < dv.byteLength; i += 8) {\n        dv.setBigUint64(i, value & 0xffffffffffffffffn, true)\n        value >>= 64n\n    }\n\n    if (unaligned > 0) {\n        for (let i = length - unaligned; i < length; i++) {\n            u8[i] = Number(value & 0xffn)\n            value >>= 8n\n        }\n    }\n\n    if (!le) u8.reverse()\n\n    return u8\n}\n\n/**\n * Convert a buffer to a big integer\n *\n * @param buffer  Buffer to convert\n * @param le  Whether to use little-endian encoding\n */\nexport function bufferToBigInt(buffer: Uint8Array, le = false): bigint {\n    if (le) buffer = bufferToReversed(buffer)\n\n    const unaligned = buffer.length % 8\n    const dv = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength - unaligned)\n\n    let res = 0n\n\n    // it is faster to work with 64-bit words than with bytes directly\n    for (let i = 0; i < dv.byteLength; i += 8) {\n        res = (res << 64n) | BigInt(dv.getBigUint64(i, false))\n    }\n\n    if (unaligned > 0) {\n        for (let i = buffer.length - unaligned; i < buffer.length; i++) {\n            res = (res << 8n) | BigInt(buffer[i])\n        }\n    }\n\n    return res\n}\n\n/**\n * Generate a cryptographically safe random big integer of the given size (in bytes)\n * @param size  Size in bytes\n */\nexport function randomBigInt(crypto: ICryptoProvider, size: number): bigint {\n    return bufferToBigInt(crypto.randomBytes(size))\n}\n\n/**\n * Generate a random big integer of the given size (in bits)\n * @param bits\n */\nexport function randomBigIntBits(crypto: ICryptoProvider, bits: number): bigint {\n    let num = randomBigInt(crypto, Math.ceil(bits / 8))\n\n    const bitLength = bigIntBitLength(num)\n\n    if (bitLength > bits) {\n        const toTrim = bitLength - bits\n        num >>= BigInt(toTrim)\n    }\n\n    return num\n}\n\n/**\n * Generate a random big integer in the range [min, max)\n *\n * @param max  Maximum value (exclusive)\n * @param min  Minimum value (inclusive)\n */\nexport function randomBigIntInRange(crypto: ICryptoProvider, max: bigint, min = 1n): bigint {\n    const interval = max - min\n    if (interval < 0n) throw new Error('expected min < max')\n\n    const byteSize = Math.ceil(bigIntBitLength(interval) / 8)\n\n    let result = randomBigInt(crypto, byteSize)\n    while (result > interval) result -= interval\n\n    return min + result\n}\n\n/**\n * Compute the multiplicity of 2 in the prime factorization of n\n * @param n\n */\nexport function twoMultiplicity(n: bigint): bigint {\n    if (n === 0n) return 0n\n\n    let m = 0n\n    let pow = 1n\n\n    while (true) {\n        if ((n & pow) !== 0n) return m\n        m += 1n\n        pow <<= 1n\n    }\n}\n\nexport function bigIntMin(a: bigint, b: bigint): bigint {\n    return a < b ? a : b\n}\n\nexport function bigIntAbs(a: bigint): bigint {\n    return a < 0n ? -a : a\n}\n\nexport function bigIntGcd(a: bigint, b: bigint): bigint {\n    // using euclidean algorithm is fast enough on smaller numbers\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm#Implementations\n\n    while (b !== 0n) {\n        const t = b\n        b = a % b\n        a = t\n    }\n\n    return a\n}\n\nexport function bigIntModPow(base: bigint, exp: bigint, mod: bigint): bigint {\n    // using the binary method is good enough for our use case\n    // https://en.wikipedia.org/wiki/Modular_exponentiation#Right-to-left_binary_method\n\n    base %= mod\n\n    let result = 1n\n\n    while (exp > 0n) {\n        if (exp % 2n === 1n) {\n            result = (result * base) % mod\n        }\n\n        exp >>= 1n\n        base = base ** 2n % mod\n    }\n\n    return result\n}\n\n// below code is based on https://github.com/juanelas/bigint-mod-arith, MIT license\n\nfunction eGcd(a: bigint, b: bigint): [bigint, bigint, bigint] {\n    let x = 0n\n    let y = 1n\n    let u = 1n\n    let v = 0n\n\n    while (a !== 0n) {\n        const q = b / a\n        const r: bigint = b % a\n        const m = x - u * q\n        const n = y - v * q\n        b = a\n        a = r\n        x = u\n        y = v\n        u = m\n        v = n\n    }\n\n    return [b, x, y]\n}\n\nfunction toZn(a: number | bigint, n: number | bigint): bigint {\n    if (typeof a === 'number') a = BigInt(a)\n    if (typeof n === 'number') n = BigInt(n)\n\n    if (n <= 0n) {\n        throw new RangeError('n must be > 0')\n    }\n\n    const aZn = a % n\n\n    return aZn < 0n ? aZn + n : aZn\n}\n\nexport function bigIntModInv(a: bigint, n: bigint): bigint {\n    const [g, x] = eGcd(toZn(a, n), n)\n\n    if (g !== 1n) {\n        throw new RangeError(`${a.toString()} does not have inverse modulo ${n.toString()}`) // modular inverse does not exist\n    } else {\n        return toZn(x, n)\n    }\n}\n"]}

package/cjs/utils/binary/asn1-parser.js

@@ -1,121 +0,0 @@
-"use strict";
-// all available libraries either suck or are extremely large for the use case, so i made my own~
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parseAsn1 = exports.parsePemContents = void 0;
-const platform_js_1 = require("../../platform.js");
-/**
- * Parses a single PEM block to buffer.
- * In fact just strips begin/end tags and parses the rest as Base64
- */
-function parsePemContents(pem) {
-    return (0, platform_js_1.getPlatform)().base64Decode(pem.replace(/^-----(BEGIN|END)( RSA)? PUBLIC KEY-----$|\n/gm, ''));
-}
-exports.parsePemContents = parsePemContents;
-const ELOOPN = 102;
-const ELOOP = `iterated over ${ELOOPN} elements (probably a malformed file)`;
-const EDEEPN = 60;
-const EDEEP = `element nested over ${EDEEPN} layers deep (probably a malformed file)`;
-// Container Types are Sequence 0x30, Container Array? (0xA0, 0xA1)
-// Value Types are Boolean 0x01, Integer 0x02, Null 0x05, Object ID 0x06, String 0x0C, 0x16, 0x13, 0x1e
-// Value Array? (0x82)
-// Bit String (0x03) and Octet String (0x04) may be values or containers
-// Sometimes Bit String is used as a container (RSA Pub Spki)
-const CTYPES = {
-    '48': true,
-    '49': true,
-    '160': true,
-    '161': true,
-};
-const VTYPES = {
-    '1': true,
-    '2': true,
-    '5': true,
-    '6': true,
-    '12': true,
-    '130': true,
-};
-/**
- * Parses ASN.1 data to an object
- */
-function parseAsn1(data) {
-    function parseAsn1Inner(buf, depth, eager = false) {
-        if (depth.length >= EDEEPN) {
-            throw new Error(EDEEP);
-        }
-        let index = 2; // we know, at minimum, data starts after type (0) and lengthSize (1)
-        const asn1 = { type: buf[0], lengthSize: 0, length: buf[1] };
-        let child;
-        let iters = 0;
-        let adjust = 0;
-        let adjustedLen = 0;
-        // Determine how many bytes the length uses, and what it is
-        if (0x80 & asn1.length) {
-            asn1.lengthSize = 0x7f & asn1.length;
-            // I think that buf->hex->int solves the problem of Endianness... not sure
-            asn1.length = parseInt((0, platform_js_1.getPlatform)().hexEncode(buf.subarray(index, index + asn1.lengthSize)), 16);
-            index += asn1.lengthSize;
-        }
-        // High-order bit Integers have a leading 0x00 to signify that they are positive.
-        // Bit Streams use the first byte to signify padding, which x.509 doesn't use.
-        if (buf[index] === 0x00 && (asn1.type === 0x02 || asn1.type === 0x03)) {
-            // However, 0x00 on its own is a valid number
-            if (asn1.length > 1) {
-                index += 1;
-                adjust = -1;
-            }
-        }
-        adjustedLen = asn1.length + adjust;
-        function parseChildren(eager = false) {
-            asn1.children = [];
-            while (iters < ELOOPN && index < 2 + asn1.length + asn1.lengthSize) {
-                iters += 1;
-                depth.length += 1;
-                child = parseAsn1Inner(buf.subarray(index, index + adjustedLen), depth, eager);
-                depth.length -= 1;
-                // The numbers don't match up exactly and I don't remember why...
-                // probably something with adjustedLen or some such, but the tests pass
-                index += 2 + child.lengthSize + child.length;
-                if (index > 2 + asn1.lengthSize + asn1.length) {
-                    throw new Error(`Parse error: child value length (${child.length}) is ` +
-                        `greater than remaining parent length (${asn1.length - index} = ${asn1.length} - ${index})`);
-                }
-                asn1.children.push(child);
-            }
-            if (index !== 2 + asn1.lengthSize + asn1.length) {
-                throw new Error('Unexpected EOF');
-            }
-            if (iters >= ELOOPN) {
-                throw new Error(ELOOP);
-            }
-            delete asn1.value;
-            return asn1;
-        }
-        // Recurse into types that are _always_ containers
-        if (CTYPES[asn1.type]) {
-            return parseChildren(eager);
-        }
-        // Return types that are _always_ values
-        asn1.value = buf.subarray(index, index + adjustedLen);
-        if (VTYPES[asn1.type]) {
-            return asn1;
-        }
-        // For ambiguous / unknown types, recurse and return on failure
-        // (and return child array size to zero)
-        try {
-            return parseChildren(true);
-        }
-        catch (e) {
-            if (asn1.children)
-                asn1.children.length = 0;
-            return asn1;
-        }
-    }
-    const asn1 = parseAsn1Inner(data, []);
-    const len = data.length;
-    if (len !== 2 + asn1.lengthSize + asn1.length) {
-        throw new Error('Length of buffer does not match length of ASN.1 sequence.');
-    }
-    return asn1;
-}
-exports.parseAsn1 = parseAsn1;
-//# sourceMappingURL=asn1-parser.js.map

package/cjs/utils/binary/asn1-parser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"asn1-parser.js","sourceRoot":"","sources":["../../../../src/utils/binary/asn1-parser.ts"],"names":[],"mappings":";AAAA,iGAAiG;;;AAEjG,mDAA+C;AAE/C;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,GAAW;IACxC,OAAO,IAAA,yBAAW,GAAE,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,gDAAgD,EAAE,EAAE,CAAC,CAAC,CAAA;AACxG,CAAC;AAFD,4CAEC;AAaD,MAAM,MAAM,GAAG,GAAG,CAAA;AAClB,MAAM,KAAK,GAAG,iBAAiB,MAAM,uCAAuC,CAAA;AAC5E,MAAM,MAAM,GAAG,EAAE,CAAA;AACjB,MAAM,KAAK,GAAG,uBAAuB,MAAM,0CAA0C,CAAA;AAErF,mEAAmE;AACnE,uGAAuG;AACvG,sBAAsB;AACtB,wEAAwE;AACxE,6DAA6D;AAC7D,MAAM,MAAM,GAAyB;IACjC,IAAI,EAAE,IAAI;IACV,IAAI,EAAE,IAAI;IACV,KAAK,EAAE,IAAI;IACX,KAAK,EAAE,IAAI;CACd,CAAA;AACD,MAAM,MAAM,GAAyB;IACjC,GAAG,EAAE,IAAI;IACT,GAAG,EAAE,IAAI;IACT,GAAG,EAAE,IAAI;IACT,GAAG,EAAE,IAAI;IACT,IAAI,EAAE,IAAI;IACV,KAAK,EAAE,IAAI;CACd,CAAA;AAED;;GAEG;AACH,SAAgB,SAAS,CAAC,IAAgB;IACtC,SAAS,cAAc,CAAC,GAAe,EAAE,KAAe,EAAE,KAAK,GAAG,KAAK;QACnE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;QAC1B,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,CAAA,CAAC,qEAAqE;QACnF,MAAM,IAAI,GAAe,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;QACxE,IAAI,KAAK,CAAA;QACT,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,IAAI,WAAW,GAAG,CAAC,CAAA;QAEnB,2DAA2D;QAC3D,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAA;YACpC,0EAA0E;YAC1E,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAA,yBAAW,GAAE,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;YACjG,KAAK,IAAI,IAAI,CAAC,UAAU,CAAA;QAC5B,CAAC;QAED,iFAAiF;QACjF,8EAA8E;QAC9E,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACpE,6CAA6C;YAC7C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,IAAI,CAAC,CAAA;gBACV,MAAM,GAAG,CAAC,CAAC,CAAA;YACf,CAAC;QACL,CAAC;QACD,WAAW,GAAG,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QAElC,SAAS,aAAa,CAAC,KAAK,GAAG,KAAK;YAChC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;YAElB,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACjE,KAAK,IAAI,CAAC,CAAA;gBACV,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;gBACjB,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC9E,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;gBACjB,iEAAiE;gBACjE,uEAAuE;gBACvE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAA;gBAE5C,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CACX,oCAAoC,KAAK,CAAC,MAAM,OAAO;wBACnD,yCAAyC,IAAI,CAAC,MAAM,GAAG,KAAK,MAAM,IAAI,CAAC,MAAM,MAAM,KAAK,GAAG,CAClG,CAAA;gBACL,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,CAAC;YACD,IAAI,KAAK,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC9C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAA;YACrC,CAAC;YACD,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAA;YAC1B,CAAC;YAED,OAAO,IAAI,CAAC,KAAK,CAAA;YAEjB,OAAO,IAAI,CAAA;QACf,CAAC;QAED,kDAAkD;QAClD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,aAAa,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;QAED,wCAAwC;QACxC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAC,CAAA;QAErD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,IAAI,CAAA;QACf,CAAC;QAED,+DAA+D;QAC/D,wCAAwC;QACxC,IAAI,CAAC;YACD,OAAO,aAAa,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACT,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;YAE3C,OAAO,IAAI,CAAA;QACf,CAAC;IACL,CAAC;IAED,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;IAEvB,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;IAChF,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AA/FD,8BA+FC","sourcesContent":["// all available libraries either suck or are extremely large for the use case, so i made my own~\n\nimport { getPlatform } from '../../platform.js'\n\n/**\n * Parses a single PEM block to buffer.\n * In fact just strips begin/end tags and parses the rest as Base64\n */\nexport function parsePemContents(pem: string): Uint8Array {\n    return getPlatform().base64Decode(pem.replace(/^-----(BEGIN|END)( RSA)? PUBLIC KEY-----$|\\n/gm, ''))\n}\n\n// based on https://git.coolaj86.com/coolaj86/asn1-parser.js/src/branch/master/asn1-parser.js\n// but modified for typescript and node buffers\n\ninterface Asn1Object {\n    type: number\n    lengthSize: number\n    length: number\n    children?: Asn1Object[]\n    value?: Uint8Array\n}\n\nconst ELOOPN = 102\nconst ELOOP = `iterated over ${ELOOPN} elements (probably a malformed file)`\nconst EDEEPN = 60\nconst EDEEP = `element nested over ${EDEEPN} layers deep (probably a malformed file)`\n\n// Container Types are Sequence 0x30, Container Array? (0xA0, 0xA1)\n// Value Types are Boolean 0x01, Integer 0x02, Null 0x05, Object ID 0x06, String 0x0C, 0x16, 0x13, 0x1e\n// Value Array? (0x82)\n// Bit String (0x03) and Octet String (0x04) may be values or containers\n// Sometimes Bit String is used as a container (RSA Pub Spki)\nconst CTYPES: Record<number, true> = {\n    '48': true,\n    '49': true,\n    '160': true,\n    '161': true,\n}\nconst VTYPES: Record<number, true> = {\n    '1': true,\n    '2': true,\n    '5': true,\n    '6': true,\n    '12': true,\n    '130': true,\n}\n\n/**\n * Parses ASN.1 data to an object\n */\nexport function parseAsn1(data: Uint8Array): Asn1Object {\n    function parseAsn1Inner(buf: Uint8Array, depth: number[], eager = false) {\n        if (depth.length >= EDEEPN) {\n            throw new Error(EDEEP)\n        }\n\n        let index = 2 // we know, at minimum, data starts after type (0) and lengthSize (1)\n        const asn1: Asn1Object = { type: buf[0], lengthSize: 0, length: buf[1] }\n        let child\n        let iters = 0\n        let adjust = 0\n        let adjustedLen = 0\n\n        // Determine how many bytes the length uses, and what it is\n        if (0x80 & asn1.length) {\n            asn1.lengthSize = 0x7f & asn1.length\n            // I think that buf->hex->int solves the problem of Endianness... not sure\n            asn1.length = parseInt(getPlatform().hexEncode(buf.subarray(index, index + asn1.lengthSize)), 16)\n            index += asn1.lengthSize\n        }\n\n        // High-order bit Integers have a leading 0x00 to signify that they are positive.\n        // Bit Streams use the first byte to signify padding, which x.509 doesn't use.\n        if (buf[index] === 0x00 && (asn1.type === 0x02 || asn1.type === 0x03)) {\n            // However, 0x00 on its own is a valid number\n            if (asn1.length > 1) {\n                index += 1\n                adjust = -1\n            }\n        }\n        adjustedLen = asn1.length + adjust\n\n        function parseChildren(eager = false) {\n            asn1.children = []\n\n            while (iters < ELOOPN && index < 2 + asn1.length + asn1.lengthSize) {\n                iters += 1\n                depth.length += 1\n                child = parseAsn1Inner(buf.subarray(index, index + adjustedLen), depth, eager)\n                depth.length -= 1\n                // The numbers don't match up exactly and I don't remember why...\n                // probably something with adjustedLen or some such, but the tests pass\n                index += 2 + child.lengthSize + child.length\n\n                if (index > 2 + asn1.lengthSize + asn1.length) {\n                    throw new Error(\n                        `Parse error: child value length (${child.length}) is ` +\n                            `greater than remaining parent length (${asn1.length - index} = ${asn1.length} - ${index})`,\n                    )\n                }\n                asn1.children.push(child)\n            }\n            if (index !== 2 + asn1.lengthSize + asn1.length) {\n                throw new Error('Unexpected EOF')\n            }\n            if (iters >= ELOOPN) {\n                throw new Error(ELOOP)\n            }\n\n            delete asn1.value\n\n            return asn1\n        }\n\n        // Recurse into types that are _always_ containers\n        if (CTYPES[asn1.type]) {\n            return parseChildren(eager)\n        }\n\n        // Return types that are _always_ values\n        asn1.value = buf.subarray(index, index + adjustedLen)\n\n        if (VTYPES[asn1.type]) {\n            return asn1\n        }\n\n        // For ambiguous / unknown types, recurse and return on failure\n        // (and return child array size to zero)\n        try {\n            return parseChildren(true)\n        } catch (e) {\n            if (asn1.children) asn1.children.length = 0\n\n            return asn1\n        }\n    }\n\n    const asn1 = parseAsn1Inner(data, [])\n    const len = data.length\n\n    if (len !== 2 + asn1.lengthSize + asn1.length) {\n        throw new Error('Length of buffer does not match length of ASN.1 sequence.')\n    }\n\n    return asn1\n}\n"]}

package/cjs/utils/buffer-utils.js

@@ -1,76 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.bufferToReversed = exports.dataViewFromBuffer = exports.concatBuffers = exports.cloneBuffer = exports.buffersEqual = void 0;
-/**
- * Check if two buffers are equal
- *
- * @param a  First buffer
- * @param b  Second buffer
- */
-function buffersEqual(a, b) {
-    if (a.length !== b.length)
-        return false;
-    for (let i = 0; i < a.length; i++) {
-        if (a[i] !== b[i])
-            return false;
-    }
-    return true;
-}
-exports.buffersEqual = buffersEqual;
-/**
- * Copy a buffer
- *
- * @param buf  Buffer to copy
- * @param start  Start offset
- * @param end  End offset
- */
-function cloneBuffer(buf, start = 0, end = buf.length) {
-    const ret = new Uint8Array(end - start);
-    ret.set(buf.subarray(start, end));
-    return ret;
-}
-exports.cloneBuffer = cloneBuffer;
-/**
- * Concatenate multiple buffers into one
- */
-function concatBuffers(buffers) {
-    if (buffers.length === 1)
-        return buffers[0];
-    /* eslint-disable no-restricted-globals */
-    if (typeof Buffer !== 'undefined') {
-        return Buffer.concat(buffers);
-    }
-    /* eslint-enable no-restricted-globals */
-    let length = 0;
-    for (const buf of buffers) {
-        length += buf.length;
-    }
-    const ret = new Uint8Array(length);
-    let offset = 0;
-    for (const buf of buffers) {
-        ret.set(buf, offset);
-        offset += buf.length;
-    }
-    return ret;
-}
-exports.concatBuffers = concatBuffers;
-/**
- * Shortcut for creating a DataView from a Uint8Array
- */
-function dataViewFromBuffer(buf) {
-    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength);
-}
-exports.dataViewFromBuffer = dataViewFromBuffer;
-/**
- * Reverse a buffer (or a part of it) into a new buffer
- */
-function bufferToReversed(buf, start = 0, end = buf.length) {
-    const len = end - start;
-    const ret = new Uint8Array(len);
-    for (let i = 0; i < len; i++) {
-        ret[i] = buf[end - i - 1];
-    }
-    return ret;
-}
-exports.bufferToReversed = bufferToReversed;
-//# sourceMappingURL=buffer-utils.js.map

package/cjs/utils/buffer-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"buffer-utils.js","sourceRoot":"","sources":["../../../src/utils/buffer-utils.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,CAAa,EAAE,CAAa;IACrD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;IACnC,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AARD,oCAQC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM;IACpE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,CAAA;IACvC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;IAEjC,OAAO,GAAG,CAAA;AACd,CAAC;AALD,kCAKC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,OAAqB;IAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAA;IAE3C,0CAA0C;IAC1C,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACjC,CAAC;IACD,yCAAyC;IAEzC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;IACxB,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACpB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;IACxB,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAxBD,sCAwBC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAAC,GAAe;IAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAA;AACnE,CAAC;AAFD,gDAEC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM;IACzE,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAA;IACvB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AATD,4CASC","sourcesContent":["/**\n * Check if two buffers are equal\n *\n * @param a  First buffer\n * @param b  Second buffer\n */\nexport function buffersEqual(a: Uint8Array, b: Uint8Array): boolean {\n    if (a.length !== b.length) return false\n\n    for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false\n    }\n\n    return true\n}\n\n/**\n * Copy a buffer\n *\n * @param buf  Buffer to copy\n * @param start  Start offset\n * @param end  End offset\n */\nexport function cloneBuffer(buf: Uint8Array, start = 0, end = buf.length): Uint8Array {\n    const ret = new Uint8Array(end - start)\n    ret.set(buf.subarray(start, end))\n\n    return ret\n}\n\n/**\n * Concatenate multiple buffers into one\n */\nexport function concatBuffers(buffers: Uint8Array[]): Uint8Array {\n    if (buffers.length === 1) return buffers[0]\n\n    /* eslint-disable no-restricted-globals */\n    if (typeof Buffer !== 'undefined') {\n        return Buffer.concat(buffers)\n    }\n    /* eslint-enable no-restricted-globals */\n\n    let length = 0\n\n    for (const buf of buffers) {\n        length += buf.length\n    }\n\n    const ret = new Uint8Array(length)\n    let offset = 0\n\n    for (const buf of buffers) {\n        ret.set(buf, offset)\n        offset += buf.length\n    }\n\n    return ret\n}\n\n/**\n * Shortcut for creating a DataView from a Uint8Array\n */\nexport function dataViewFromBuffer(buf: Uint8Array): DataView {\n    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength)\n}\n\n/**\n * Reverse a buffer (or a part of it) into a new buffer\n */\nexport function bufferToReversed(buf: Uint8Array, start = 0, end = buf.length): Uint8Array {\n    const len = end - start\n    const ret = new Uint8Array(len)\n\n    for (let i = 0; i < len; i++) {\n        ret[i] = buf[end - i - 1]\n    }\n\n    return ret\n}\n"]}

package/cjs/utils/composer.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.composeMiddlewares = void 0;
-function composeMiddlewares(middlewares, final) {
-    middlewares = middlewares.slice();
-    middlewares.push(final);
-    function dispatch(i, ctx) {
-        const fn = middlewares[i];
-        if (!fn)
-            return final(ctx);
-        return fn(ctx, boundDispatches[i + 1]);
-    }
-    const boundDispatches = [];
-    for (let i = 0; i < middlewares.length; i++) {
-        boundDispatches.push(dispatch.bind(null, i));
-    }
-    return function (context) {
-        return boundDispatches[0](context);
-    };
-}
-exports.composeMiddlewares = composeMiddlewares;
-//# sourceMappingURL=composer.js.map

package/cjs/utils/composer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"composer.js","sourceRoot":"","sources":["../../../src/utils/composer.ts"],"names":[],"mappings":";;;AAMA,SAAgB,kBAAkB,CAC9B,WAA0C,EAC1C,KAA0C;IAE1C,WAAW,GAAG,WAAW,CAAC,KAAK,EAAE,CAAA;IACjC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAEvB,SAAS,QAAQ,CAAC,CAAS,EAAE,GAAY;QACrC,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QACzB,IAAI,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAA;QAE1B,OAAO,EAAE,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,MAAM,eAAe,GAA6C,EAAE,CAAA;IAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAChD,CAAC;IAED,OAAO,UAAU,OAAgB;QAC7B,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACtC,CAAC,CAAA;AACL,CAAC;AAvBD,gDAuBC","sourcesContent":["export type Middleware<Context, Result = void> = (\n    ctx: Context,\n    next: (ctx: Context) => Promise<Result>,\n) => Promise<Result>\nexport type ComposedMiddleware<Context, Result = void> = (ctx: Context) => Promise<Result>\n\nexport function composeMiddlewares<Context, Result = void>(\n    middlewares: Middleware<Context, Result>[],\n    final: ComposedMiddleware<Context, Result>,\n): ComposedMiddleware<Context, Result> {\n    middlewares = middlewares.slice()\n    middlewares.push(final)\n\n    function dispatch(i: number, ctx: Context): Promise<Result> {\n        const fn = middlewares[i]\n        if (!fn) return final(ctx)\n\n        return fn(ctx, boundDispatches[i + 1])\n    }\n\n    const boundDispatches: Array<(ctx: Context) => Promise<Result>> = []\n\n    for (let i = 0; i < middlewares.length; i++) {\n        boundDispatches.push(dispatch.bind(null, i))\n    }\n\n    return function (context: Context): Promise<Result> {\n        return boundDispatches[0](context)\n    }\n}\n"]}

package/cjs/utils/condition-variable.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ConditionVariable = void 0;
-/**
- * Class implementing a condition variable like behaviour.
- */
-class ConditionVariable {
-    _notify;
-    _timeout;
-    wait(timeout) {
-        const prom = new Promise((resolve) => {
-            this._notify = resolve;
-        });
-        if (timeout) {
-            this._timeout = setTimeout(() => {
-                this._notify?.();
-                this._timeout = undefined;
-            }, timeout);
-        }
-        return prom;
-    }
-    notify() {
-        this._notify?.();
-        if (this._timeout)
-            clearTimeout(this._timeout);
-        this._notify = undefined;
-    }
-}
-exports.ConditionVariable = ConditionVariable;
-//# sourceMappingURL=condition-variable.js.map

package/cjs/utils/condition-variable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"condition-variable.js","sourceRoot":"","sources":["../../../src/utils/condition-variable.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,MAAa,iBAAiB;IAClB,OAAO,CAAa;IACpB,QAAQ,CAAiB;IAEjC,IAAI,CAAC,OAAgB;QACjB,MAAM,IAAI,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC,CAAC,CAAA;QAEF,IAAI,OAAO,EAAE,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC5B,IAAI,CAAC,OAAO,EAAE,EAAE,CAAA;gBAChB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YAC7B,CAAC,EAAE,OAAO,CAAC,CAAA;QACf,CAAC;QAED,OAAO,IAAI,CAAA;IACf,CAAC;IAED,MAAM;QACF,IAAI,CAAC,OAAO,EAAE,EAAE,CAAA;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,IAAI,CAAC,OAAO,GAAG,SAAS,CAAA;IAC5B,CAAC;CACJ;AAxBD,8CAwBC","sourcesContent":["/**\n * Class implementing a condition variable like behaviour.\n */\nexport class ConditionVariable {\n    private _notify?: () => void\n    private _timeout?: NodeJS.Timeout\n\n    wait(timeout?: number): Promise<void> {\n        const prom = new Promise<void>((resolve) => {\n            this._notify = resolve\n        })\n\n        if (timeout) {\n            this._timeout = setTimeout(() => {\n                this._notify?.()\n                this._timeout = undefined\n            }, timeout)\n        }\n\n        return prom\n    }\n\n    notify(): void {\n        this._notify?.()\n        if (this._timeout) clearTimeout(this._timeout)\n        this._notify = undefined\n    }\n}\n"]}