@mtcute/core 0.16.7 → 0.16.9

package/esm/storage/storage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"storage.js","sourceRoot":"","sources":["../../../src/storage/storage.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AAInD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAExD,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAA;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAA;AAiC9D,MAAM,OAAO,cAAc;IAQF;IAPZ,QAAQ,CAAoB;IAC5B,MAAM,CAAgB;IACtB,GAAG,CAAQ;IACX,GAAG,CAAmB;IACtB,KAAK,CAAoB;IACzB,IAAI,CAAiB;IAE9B,YAAqB,OAA2D;QAA3D,YAAO,GAAP,OAAO,CAAoD;QAC5E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAA;QACrC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAA;QAClC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;QAE7C,MAAM,cAAc,GAAmB;YACnC,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;YACjC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;YACjC,GAAG,EAAE,IAAI,CAAC,GAAG;SAChB,CAAA;QAED,IAAI,CAAC,GAAG,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,cAAc,CAAC,CAAA;QAClE,IAAI,CAAC,KAAK,GAAG,IAAI,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,cAAc,CAAC,CAAA;QACrE,IAAI,CAAC,IAAI,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,cAAc,CAAC,CAAA;IACvF,CAAC;IAEO,eAAe,CAAa;IAE5B,KAAK,GAAG,eAAe,CAAC,KAAK,IAAI,EAAE;QACvC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAE7B,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,IAAI,EAAE,CAAC;YAC/B,IAAI,CAAC,eAAe,GAAG,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE;gBACjD,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC,CAAA;YAC1E,CAAC,CAAC,CAAA;QACN,CAAC;QAED,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAA;IAC9B,CAAC,CAAC,CAAA;IAEF,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAA;IAC3B,CAAC;IAED,KAAK,CAAC,IAAI;QACN,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,YAAY,GAAG,KAAK;QAC5B,IAAI,YAAY,EAAE,CAAC;YACf,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAA;QAC5C,CAAC;QACD,MAAM,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,CAAA;QAClC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAA;IACrB,CAAC;IAEO,KAAK,CAAC,QAAQ;QAClB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YAAE,OAAM;QAClC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;QAEvB,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAA;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IACtB,CAAC;IAED,KAAK,CAAC,OAAO;QACT,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,IAAI,CAAC,eAAe,EAAE,CAAA;YACtB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAA;QACpC,CAAC;QAED,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;IACzB,CAAC;CACJ","sourcesContent":["import type { TlReaderMap, TlWriterMap } from '@mtcute/tl-runtime'\n\nimport { getPlatform } from '../platform.js'\nimport { asyncResettable } from '../utils/index.js'\nimport type { Logger } from '../utils/logger.js'\n\nimport type { IMtStorageProvider } from './provider.js'\nimport { AuthKeysService } from './service/auth-keys.js'\nimport type { ServiceOptions } from './service/base.js'\nimport { DefaultDcsService } from './service/default-dcs.js'\nimport { FutureSaltsService } from './service/future-salts.js'\nimport type { IStorageDriver } from './driver.js'\n\ninterface StorageManagerOptions {\n    provider: IMtStorageProvider\n    log: Logger\n    readerMap: TlReaderMap\n    writerMap: TlWriterMap\n}\n\n/**\n * Additional options for {@link StorageManager}, that\n * can be customized by the user.\n *\n * @internal\n */\nexport interface StorageManagerExtraOptions {\n    /**\n     * Interval in milliseconds for saving the storage.\n     *\n     * When saving, the storage is expected to persist\n     * all changes to disk, so that they are not lost.\n     */\n    saveInterval?: number\n\n    /**\n     * Whether to finalize database before exiting.\n     *\n     * @default  `true`\n     */\n    cleanup?: boolean\n}\n\nexport class StorageManager {\n    readonly provider: IMtStorageProvider\n    readonly driver: IStorageDriver\n    readonly log: Logger\n    readonly dcs: DefaultDcsService\n    readonly salts: FutureSaltsService\n    readonly keys: AuthKeysService\n\n    constructor(readonly options: StorageManagerOptions & StorageManagerExtraOptions) {\n        this.provider = this.options.provider\n        this.driver = this.provider.driver\n        this.log = this.options.log.create('storage')\n\n        const serviceOptions: ServiceOptions = {\n            driver: this.driver,\n            readerMap: this.options.readerMap,\n            writerMap: this.options.writerMap,\n            log: this.log,\n        }\n\n        this.dcs = new DefaultDcsService(this.provider.kv, serviceOptions)\n        this.salts = new FutureSaltsService(this.provider.kv, serviceOptions)\n        this.keys = new AuthKeysService(this.provider.authKeys, this.salts, serviceOptions)\n    }\n\n    private _cleanupRestore?: () => void\n\n    private _load = asyncResettable(async () => {\n        this.driver.setup?.(this.log)\n\n        if (this.options.cleanup ?? true) {\n            this._cleanupRestore = getPlatform().beforeExit(() => {\n                this._destroy().catch(err => this.log.error('cleanup error: %e', err))\n            })\n        }\n\n        await this.driver.load?.()\n    })\n\n    load(): Promise<void> {\n        return this._load.run()\n    }\n\n    async save(): Promise<void> {\n        await this.driver.save?.()\n    }\n\n    async clear(withAuthKeys = false): Promise<void> {\n        if (withAuthKeys) {\n            await this.provider.authKeys.deleteAll()\n        }\n        await this.provider.kv.deleteAll()\n        await this.save()\n    }\n\n    private async _destroy(): Promise<void> {\n        if (!this._load.finished()) return\n        await this._load.wait()\n\n        await this.driver.destroy?.()\n        this._load.reset()\n    }\n\n    async destroy(): Promise<void> {\n        if (this._cleanupRestore) {\n            this._cleanupRestore()\n            this._cleanupRestore = undefined\n        }\n\n        await this._destroy()\n    }\n}\n"]}

package/esm/types/errors.d.ts

@@ -1,53 +0,0 @@
-/**
- * Base class for all mtcute errors
- */
-export declare class MtcuteError extends Error {
-}
-/**
- * Method invocation was invalid because some argument
- * passed was invalid.
- */
-export declare class MtArgumentError extends MtcuteError {
-}
-/**
- * Something isn't right with security of the connection.
- */
-export declare class MtSecurityError extends MtcuteError {
-}
-/**
- * Either you requested or the server returned something
- * that is not (yet) supported.
- *
- * Stay tuned for future updates!
- *
- * In some cases, this error may mean that you are missing some
- * optional peer dependencies, or that the feature is not supported
- * in the current environment.
- */
-export declare class MtUnsupportedError extends MtcuteError {
-}
-/**
- * Server returned something of an unexpected type.
- *
- * This is usually a problem on library side.
- * Feel free to open an issue about this!
- */
-export declare class MtTypeAssertionError extends MtcuteError {
-    /**
-     * Context at which the error occurred.
-     * Usually a user-friendly string containing name
-     * of the high-level API method, name of the TL
-     * RPC method, and path of the entity,
-     * like this: `signIn (@ auth.signIn -> user)`
-     */
-    context: string;
-    /** Expected TL type */
-    expected: string;
-    /** Actual TL type */
-    actual: string;
-    constructor(context: string, expected: string, actual: string);
-}
-export declare class MtTimeoutError extends MtcuteError {
-    readonly timeout?: number | undefined;
-    constructor(timeout?: number | undefined);
-}

package/esm/types/errors.js

@@ -1,62 +0,0 @@
-/**
- * Base class for all mtcute errors
- */
-export class MtcuteError extends Error {
-}
-/**
- * Method invocation was invalid because some argument
- * passed was invalid.
- */
-export class MtArgumentError extends MtcuteError {
-}
-/**
- * Something isn't right with security of the connection.
- */
-export class MtSecurityError extends MtcuteError {
-}
-/**
- * Either you requested or the server returned something
- * that is not (yet) supported.
- *
- * Stay tuned for future updates!
- *
- * In some cases, this error may mean that you are missing some
- * optional peer dependencies, or that the feature is not supported
- * in the current environment.
- */
-export class MtUnsupportedError extends MtcuteError {
-}
-/**
- * Server returned something of an unexpected type.
- *
- * This is usually a problem on library side.
- * Feel free to open an issue about this!
- */
-export class MtTypeAssertionError extends MtcuteError {
-    /**
-     * Context at which the error occurred.
-     * Usually a user-friendly string containing name
-     * of the high-level API method, name of the TL
-     * RPC method, and path of the entity,
-     * like this: `signIn (@ auth.signIn -> user)`
-     */
-    context;
-    /** Expected TL type */
-    expected;
-    /** Actual TL type */
-    actual;
-    constructor(context, expected, actual) {
-        super(`Type assertion error at ${context}: expected ${expected}, but got ${actual}`);
-        this.context = context;
-        this.expected = expected;
-        this.actual = actual;
-    }
-}
-export class MtTimeoutError extends MtcuteError {
-    timeout;
-    constructor(timeout) {
-        super(`Request timed out${timeout ? ` after ${timeout}ms` : ''}`);
-        this.timeout = timeout;
-    }
-}
-//# sourceMappingURL=errors.js.map

package/esm/types/errors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../../src/types/errors.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,WAAY,SAAQ,KAAK;CAAG;AAEzC;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,WAAW;CAAG;AAEnD;;GAEG;AACH,MAAM,OAAO,eAAgB,SAAQ,WAAW;CAAG;AAEnD;;;;;;;;;GASG;AACH,MAAM,OAAO,kBAAmB,SAAQ,WAAW;CAAG;AAEtD;;;;;GAKG;AACH,MAAM,OAAO,oBAAqB,SAAQ,WAAW;IACjD;;;;;;OAMG;IACH,OAAO,CAAQ;IAEf,uBAAuB;IACvB,QAAQ,CAAQ;IAEhB,qBAAqB;IACrB,MAAM,CAAQ;IAEd,YAAY,OAAe,EAAE,QAAgB,EAAE,MAAc;QACzD,KAAK,CAAC,2BAA2B,OAAO,cAAc,QAAQ,aAAa,MAAM,EAAE,CAAC,CAAA;QACpF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACxB,CAAC;CACJ;AAED,MAAM,OAAO,cAAe,SAAQ,WAAW;IACtB;IAArB,YAAqB,OAAgB;QACjC,KAAK,CAAC,oBAAoB,OAAO,CAAC,CAAC,CAAC,UAAU,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QADhD,YAAO,GAAP,OAAO,CAAS;IAErC,CAAC;CACJ","sourcesContent":["/**\n * Base class for all mtcute errors\n */\nexport class MtcuteError extends Error {}\n\n/**\n * Method invocation was invalid because some argument\n * passed was invalid.\n */\nexport class MtArgumentError extends MtcuteError {}\n\n/**\n * Something isn't right with security of the connection.\n */\nexport class MtSecurityError extends MtcuteError {}\n\n/**\n * Either you requested or the server returned something\n * that is not (yet) supported.\n *\n * Stay tuned for future updates!\n *\n * In some cases, this error may mean that you are missing some\n * optional peer dependencies, or that the feature is not supported\n * in the current environment.\n */\nexport class MtUnsupportedError extends MtcuteError {}\n\n/**\n * Server returned something of an unexpected type.\n *\n * This is usually a problem on library side.\n * Feel free to open an issue about this!\n */\nexport class MtTypeAssertionError extends MtcuteError {\n    /**\n     * Context at which the error occurred.\n     * Usually a user-friendly string containing name\n     * of the high-level API method, name of the TL\n     * RPC method, and path of the entity,\n     * like this: `signIn (@ auth.signIn -> user)`\n     */\n    context: string\n\n    /** Expected TL type */\n    expected: string\n\n    /** Actual TL type */\n    actual: string\n\n    constructor(context: string, expected: string, actual: string) {\n        super(`Type assertion error at ${context}: expected ${expected}, but got ${actual}`)\n        this.context = context\n        this.expected = expected\n        this.actual = actual\n    }\n}\n\nexport class MtTimeoutError extends MtcuteError {\n    constructor(readonly timeout?: number) {\n        super(`Request timed out${timeout ? ` after ${timeout}ms` : ''}`)\n    }\n}\n"]}

package/esm/types/index.d.ts

@@ -1,3 +0,0 @@
-export * from './errors.js';
-export * from './peers.js';
-export * from './utils.js';

package/esm/types/index.js

@@ -1,4 +0,0 @@
-export * from './errors.js';
-export * from './peers.js';
-export * from './utils.js';
-//# sourceMappingURL=index.js.map

package/esm/types/index.js.map

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

package/esm/types/peers.d.ts

@@ -1,4 +0,0 @@
-/**
- * Peer types that have one-to-one relation to `tl.Peer*` types.
- */
-export type BasicPeerType = 'user' | 'chat' | 'channel';

package/esm/types/peers.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=peers.js.map

package/esm/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/esm/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(_: never): never;

package/esm/types/utils.js

@@ -1,4 +0,0 @@
-export function assertNever(_) {
-    throw new Error('Illegal state');
-}
-//# sourceMappingURL=utils.js.map

package/esm/types/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../src/types/utils.ts"],"names":[],"mappings":"AAWA,MAAM,UAAU,WAAW,CAAC,CAAQ;IAChC,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAA;AACpC,CAAC","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>\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\nexport function assertNever(_: never): never {\n    throw new Error('Illegal state')\n}\n"]}

package/esm/utils/abort-signal.d.ts

@@ -1 +0,0 @@
-export declare function combineAbortSignals(signal1: AbortSignal, signal2?: AbortSignal): AbortSignal;

package/esm/utils/abort-signal.js

@@ -1,9 +0,0 @@
-export 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;
-}
-//# sourceMappingURL=abort-signal.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"abort-signal.js","sourceRoot":"","sources":["../../../src/utils/abort-signal.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,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","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/esm/utils/async-lock.d.ts

@@ -1,10 +0,0 @@
-/**
- * Simple class implementing a semaphore like
- * behaviour.
- */
-export declare class AsyncLock {
-    private _queue;
-    acquire(): Promise<void>;
-    release(): void;
-    with(func: () => Promise<void>): Promise<void>;
-}

package/esm/utils/async-lock.js

@@ -1,36 +0,0 @@
-import { Deque } from './deque.js';
-/**
- * Simple class implementing a semaphore like
- * behaviour.
- */
-export class AsyncLock {
-    _queue = new 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();
-            if (err)
-                throw err;
-        });
-    }
-}
-//# sourceMappingURL=async-lock.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"async-lock.js","sourceRoot":"","sources":["../../../src/utils/async-lock.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAIlC;;;GAGG;AACH,MAAM,OAAO,SAAS;IACV,MAAM,GAAG,IAAI,KAAK,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,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;aAC1B,IAAI,CAAC,GAAG,EAAE;YACP,IAAI,CAAC,OAAO,EAAE,CAAA;YACd,IAAI,GAAG;gBAAE,MAAM,GAAG,CAAA;QACtB,CAAC,CAAC,CAAA;IACV,CAAC;CACJ","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                if (err) throw err\n            })\n    }\n}\n"]}

package/esm/utils/bigint-utils.d.ts

@@ -1,47 +0,0 @@
-import type { ICryptoProvider } from './crypto/abstract.js';
-/**
- * Get the minimum number of bits required to represent a number
- */
-export declare function bigIntBitLength(n: bigint): number;
-/**
- * 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
- */
-export declare function bigIntToBuffer(value: bigint, length?: number, le?: boolean): Uint8Array;
-/**
- * Convert a buffer to a big integer
- *
- * @param buffer  Buffer to convert
- * @param le  Whether to use little-endian encoding
- */
-export declare function bufferToBigInt(buffer: Uint8Array, le?: boolean): bigint;
-/**
- * Generate a cryptographically safe random big integer of the given size (in bytes)
- * @param size  Size in bytes
- */
-export declare function randomBigInt(crypto: ICryptoProvider, size: number): bigint;
-/**
- * Generate a random big integer of the given size (in bits)
- * @param bits
- */
-export declare function randomBigIntBits(crypto: ICryptoProvider, bits: number): bigint;
-/**
- * Generate a random big integer in the range [min, max)
- *
- * @param max  Maximum value (exclusive)
- * @param min  Minimum value (inclusive)
- */
-export declare function randomBigIntInRange(crypto: ICryptoProvider, max: bigint, min?: bigint): bigint;
-/**
- * Compute the multiplicity of 2 in the prime factorization of n
- * @param n
- */
-export declare function twoMultiplicity(n: bigint): bigint;
-export declare function bigIntMin(a: bigint, b: bigint): bigint;
-export declare function bigIntAbs(a: bigint): bigint;
-export declare function bigIntGcd(a: bigint, b: bigint): bigint;
-export declare function bigIntModPow(base: bigint, exp: bigint, mod: bigint): bigint;
-export declare function bigIntModInv(a: bigint, n: bigint): bigint;

package/esm/utils/bigint-utils.js

@@ -1,190 +0,0 @@
-import { bufferToReversed } from './buffer-utils.js';
-/**
- * Get the minimum number of bits required to represent a number
- */
-export 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)));
-}
-/**
- * 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
- */
-export 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;
-}
-/**
- * Convert a buffer to a big integer
- *
- * @param buffer  Buffer to convert
- * @param le  Whether to use little-endian encoding
- */
-export function bufferToBigInt(buffer, le = false) {
-    if (le)
-        buffer = 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;
-}
-/**
- * Generate a cryptographically safe random big integer of the given size (in bytes)
- * @param size  Size in bytes
- */
-export function randomBigInt(crypto, size) {
-    return bufferToBigInt(crypto.randomBytes(size));
-}
-/**
- * Generate a random big integer of the given size (in bits)
- * @param bits
- */
-export 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;
-}
-/**
- * Generate a random big integer in the range [min, max)
- *
- * @param max  Maximum value (exclusive)
- * @param min  Minimum value (inclusive)
- */
-export 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;
-}
-/**
- * Compute the multiplicity of 2 in the prime factorization of n
- * @param n
- */
-export 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;
-    }
-}
-export function bigIntMin(a, b) {
-    return a < b ? a : b;
-}
-export function bigIntAbs(a) {
-    return a < 0n ? -a : a;
-}
-export 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;
-}
-export 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;
-}
-// 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;
-}
-export 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);
-    }
-}
-//# sourceMappingURL=bigint-utils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bigint-utils.js","sourceRoot":"","sources":["../../../src/utils/bigint-utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAGpD;;GAEG;AACH,MAAM,UAAU,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;AAED;;;;;;GAMG;AACH,MAAM,UAAU,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;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,MAAkB,EAAE,EAAE,GAAG,KAAK;IACzD,IAAI,EAAE;QAAE,MAAM,GAAG,gBAAgB,CAAC,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;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,MAAuB,EAAE,IAAY;IAC9D,OAAO,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAA;AACnD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,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;AAED;;;;;GAKG;AACH,MAAM,UAAU,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;AAED;;;GAGG;AACH,MAAM,UAAU,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;AAED,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,CAAS;IAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACxB,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,CAAS;IAC/B,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC1B,CAAC;AAED,MAAM,UAAU,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;AAED,MAAM,UAAU,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;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,MAAM,UAAU,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","sourcesContent":["import { bufferToReversed } from './buffer-utils.js'\nimport type { 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): number {\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/esm/utils/binary/asn1-parser.d.ts

@@ -1,17 +0,0 @@
-/**
- * Parses a single PEM block to buffer.
- * In fact just strips begin/end tags and parses the rest as Base64
- */
-export declare function parsePemContents(pem: string): Uint8Array;
-interface Asn1Object {
-    type: number;
-    lengthSize: number;
-    length: number;
-    children?: Asn1Object[];
-    value?: Uint8Array;
-}
-/**
- * Parses ASN.1 data to an object
- */
-export declare function parseAsn1(data: Uint8Array): Asn1Object;
-export {};