@mtcute/core 0.16.6 → 0.16.9

package/esm/utils/lru-map.js

@@ -1,113 +0,0 @@
-/* eslint-disable @typescript-eslint/no-explicit-any,@typescript-eslint/no-unsafe-assignment */
-/* eslint-disable @typescript-eslint/no-unsafe-argument */
-// ^^ because of performance reasons
-import { LongMap } from './long-utils.js';
-/**
- * Simple class implementing LRU-like behaviour for a Map
- *
- * Can be used to handle local cache of *something*
- *
- * Uses two-way linked list internally to keep track of insertion/access order
- */
-export class LruMap {
-    _capacity;
-    _first;
-    _last;
-    _map;
-    _size = 0;
-    constructor(capacity, forLong = false) {
-        this._capacity = capacity;
-        this._map = forLong ? new LongMap() : new Map();
-    }
-    _markUsed(item) {
-        if (item === this._first) {
-            return; // already the most recently used
-        }
-        if (item.p) {
-            if (item === this._last) {
-                this._last = item.p;
-            }
-            item.p.n = item.n;
-        }
-        if (item.n) {
-            item.n.p = item.p;
-        }
-        item.p = undefined;
-        item.n = this._first;
-        if (this._first) {
-            this._first.p = item;
-        }
-        this._first = item;
-    }
-    get(key) {
-        const item = this._map.get(key);
-        if (!item)
-            return undefined;
-        this._markUsed(item);
-        return item.v;
-    }
-    has(key) {
-        return this._map.has(key);
-    }
-    _remove(item) {
-        if (item.p) {
-            this._last = item.p;
-            this._last.n = undefined;
-        }
-        else {
-            // exhausted
-            this._last = undefined;
-            this._first = undefined;
-        }
-        // remove strong refs to and from the item
-        item.p = item.n = undefined;
-        this._map.delete(item.k);
-        this._size -= 1;
-    }
-    set(key, value) {
-        let item = this._map.get(key);
-        if (item) {
-            // already in cache, update
-            item.v = value;
-            this._markUsed(item);
-            return;
-        }
-        item = {
-            k: key,
-            v: value,
-            // for jit to optimize stuff
-            n: undefined,
-            p: undefined,
-        };
-        this._map.set(key, item);
-        if (this._first) {
-            this._first.p = item;
-            item.n = this._first;
-        }
-        else {
-            // first item ever
-            this._last = item;
-        }
-        this._first = item;
-        this._size += 1;
-        if (this._size > this._capacity) {
-            // remove the last item
-            const oldest = this._last;
-            if (oldest) {
-                this._remove(oldest);
-            }
-        }
-    }
-    delete(key) {
-        const item = this._map.get(key);
-        if (item)
-            this._remove(item);
-    }
-    clear() {
-        this._map.clear();
-        this._first = undefined;
-        this._last = undefined;
-        this._size = 0;
-    }
-}
-//# sourceMappingURL=lru-map.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"lru-map.js","sourceRoot":"","sources":["../../../src/utils/lru-map.ts"],"names":[],"mappings":"AAAA,+FAA+F;AAC/F,0DAA0D;AAC1D,oCAAoC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAA;AAazC;;;;;;GAMG;AACH,MAAM,OAAO,MAAM;IACP,SAAS,CAAQ;IACjB,MAAM,CAAyB;IAC/B,KAAK,CAAyB;IAE9B,IAAI,CAAgC;IAEpC,KAAK,GAAG,CAAC,CAAA;IAEjB,YAAY,QAAgB,EAAE,OAAO,GAAG,KAAK;QACzC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAE,IAAI,OAAO,EAAU,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAA;IAC5D,CAAC;IAEO,SAAS,CAAC,IAA4B;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,OAAM,CAAC,iCAAiC;QAC5C,CAAC;QAED,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;YACvB,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QACrB,CAAC;QAED,IAAI,CAAC,CAAC,GAAG,SAAS,CAAA;QAClB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QAEpB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;QACxB,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;IACtB,CAAC;IAED,GAAG,CAAC,GAAM;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAA;QAE3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QAEpB,OAAO,IAAI,CAAC,CAAC,CAAA;IACjB,CAAC;IAED,GAAG,CAAC,GAAM;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC7B,CAAC;IAEO,OAAO,CAAC,IAA4B;QACxC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAA;QAC5B,CAAC;aAAM,CAAC;YACJ,YAAY;YACZ,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;YACtB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;QAC3B,CAAC;QAED,0CAA0C;QAC1C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAA;QAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;IACnB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAE7B,IAAI,IAAI,EAAE,CAAC;YACP,2BAA2B;YAC3B,IAAI,CAAC,CAAC,GAAG,KAAK,CAAA;YACd,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YAEpB,OAAM;QACV,CAAC;QAED,IAAI,GAAG;YACH,CAAC,EAAE,GAAG;YACN,CAAC,EAAE,KAAK;YACR,4BAA4B;YAC5B,CAAC,EAAE,SAAS;YACZ,CAAC,EAAE,SAAS;SACf,CAAA;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAW,CAAC,CAAA;QAE/B,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;YACpB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QACxB,CAAC;aAAM,CAAC;YACJ,kBAAkB;YAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACrB,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;QAClB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;QAEf,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,uBAAuB;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAA;YAEzB,IAAI,MAAM,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YACxB,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,CAAC,GAAM;QACT,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC/B,IAAI,IAAI;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IAChC,CAAC;IAED,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;QACjB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;QACtB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;IAClB,CAAC;CACJ","sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any,@typescript-eslint/no-unsafe-assignment */\n/* eslint-disable @typescript-eslint/no-unsafe-argument */\n// ^^ because of performance reasons\nimport { LongMap } from './long-utils.js'\n\ninterface TwoWayLinkedList<K, T> {\n    // k = key\n    k: K\n    // v = value\n    v: T\n    // p = previous\n    p?: TwoWayLinkedList<K, T>\n    // n = next\n    n?: TwoWayLinkedList<K, T>\n}\n\n/**\n * Simple class implementing LRU-like behaviour for a Map\n *\n * Can be used to handle local cache of *something*\n *\n * Uses two-way linked list internally to keep track of insertion/access order\n */\nexport class LruMap<K extends string | number, V> {\n    private _capacity: number\n    private _first?: TwoWayLinkedList<K, V>\n    private _last?: TwoWayLinkedList<K, V>\n\n    private _map: Map<K, TwoWayLinkedList<K, V>>\n\n    private _size = 0\n\n    constructor(capacity: number, forLong = false) {\n        this._capacity = capacity\n\n        this._map = forLong ? (new LongMap() as any) : new Map()\n    }\n\n    private _markUsed(item: TwoWayLinkedList<K, V>): void {\n        if (item === this._first) {\n            return // already the most recently used\n        }\n\n        if (item.p) {\n            if (item === this._last) {\n                this._last = item.p\n            }\n            item.p.n = item.n\n        }\n\n        if (item.n) {\n            item.n.p = item.p\n        }\n\n        item.p = undefined\n        item.n = this._first\n\n        if (this._first) {\n            this._first.p = item\n        }\n        this._first = item\n    }\n\n    get(key: K): V | undefined {\n        const item = this._map.get(key)\n        if (!item) return undefined\n\n        this._markUsed(item)\n\n        return item.v\n    }\n\n    has(key: K): boolean {\n        return this._map.has(key)\n    }\n\n    private _remove(item: TwoWayLinkedList<K, V>): void {\n        if (item.p) {\n            this._last = item.p\n            this._last.n = undefined\n        } else {\n            // exhausted\n            this._last = undefined\n            this._first = undefined\n        }\n\n        // remove strong refs to and from the item\n        item.p = item.n = undefined\n        this._map.delete(item.k)\n        this._size -= 1\n    }\n\n    set(key: K, value: V): void {\n        let item = this._map.get(key)\n\n        if (item) {\n            // already in cache, update\n            item.v = value\n            this._markUsed(item)\n\n            return\n        }\n\n        item = {\n            k: key,\n            v: value,\n            // for jit to optimize stuff\n            n: undefined,\n            p: undefined,\n        }\n        this._map.set(key, item as any)\n\n        if (this._first) {\n            this._first.p = item\n            item.n = this._first\n        } else {\n            // first item ever\n            this._last = item\n        }\n\n        this._first = item\n        this._size += 1\n\n        if (this._size > this._capacity) {\n            // remove the last item\n            const oldest = this._last\n\n            if (oldest) {\n                this._remove(oldest)\n            }\n        }\n    }\n\n    delete(key: K): void {\n        const item = this._map.get(key)\n        if (item) this._remove(item)\n    }\n\n    clear(): void {\n        this._map.clear()\n        this._first = undefined\n        this._last = undefined\n        this._size = 0\n    }\n}\n"]}

package/esm/utils/lru-set.d.ts

@@ -1,22 +0,0 @@
-import Long from 'long';
-/**
- * Simple class implementing LRU-like behaviour for a Set.
- *
- * Note: this is not exactly LRU, but rather "least recently added"
- * and doesn't mark items as recently added if they are already in the set.
- * This is enough for our use case, so we don't bother with more complex implementation.
- *
- * Used to store recently received message IDs in {@link SessionConnection}
- *
- * Uses one-way linked list internally to keep track of insertion order
- */
-export declare class LruSet<T extends string | number | Long> {
-    private _capacity;
-    private _first?;
-    private _last?;
-    private _set;
-    constructor(capacity: number, forLong?: boolean);
-    clear(): void;
-    add(val: T): void;
-    has(val: T): boolean;
-}

package/esm/utils/lru-set.js

@@ -1,48 +0,0 @@
-import { LongSet } from './long-utils.js';
-/**
- * Simple class implementing LRU-like behaviour for a Set.
- *
- * Note: this is not exactly LRU, but rather "least recently added"
- * and doesn't mark items as recently added if they are already in the set.
- * This is enough for our use case, so we don't bother with more complex implementation.
- *
- * Used to store recently received message IDs in {@link SessionConnection}
- *
- * Uses one-way linked list internally to keep track of insertion order
- */
-export class LruSet {
-    _capacity;
-    _first;
-    _last;
-    _set;
-    constructor(capacity, forLong = false) {
-        this._capacity = capacity;
-        this._set = forLong ? new LongSet() : new Set();
-    }
-    clear() {
-        this._first = this._last = undefined;
-        this._set.clear();
-    }
-    add(val) {
-        if (this._set.has(val))
-            return;
-        if (!this._first)
-            this._first = { v: val };
-        if (!this._last)
-            this._last = this._first;
-        else {
-            this._last.n = { v: val };
-            this._last = this._last.n;
-        }
-        this._set.add(val);
-        if (this._set.size > this._capacity && this._first) {
-            // remove least recently used
-            this._set.delete(this._first.v);
-            this._first = this._first.n;
-        }
-    }
-    has(val) {
-        return this._set.has(val);
-    }
-}
-//# sourceMappingURL=lru-set.js.map

package/esm/utils/lru-set.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lru-set.js","sourceRoot":"","sources":["../../../src/utils/lru-set.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAA;AAOzC;;;;;;;;;;GAUG;AACH,MAAM,OAAO,MAAM;IACP,SAAS,CAAQ;IACjB,MAAM,CAAsB;IAC5B,KAAK,CAAsB;IAE3B,IAAI,CAAkB;IAE9B,YAAY,QAAgB,EAAE,OAAO,GAAG,KAAK;QACzC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAA;IACnD,CAAC;IAED,KAAK;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;QACpC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;IACrB,CAAC;IAED,GAAG,CAAC,GAAM;QACN,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAU,CAAC;YAAE,OAAM;QAErC,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;QAE1C,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAA;aACpC,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;YACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QAC7B,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAU,CAAC,CAAA;QAEzB,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjD,6BAA6B;YAC7B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAQ,CAAC,CAAA;YACtC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;QAC/B,CAAC;IACL,CAAC;IAED,GAAG,CAAC,GAAM;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAU,CAAC,CAAA;IACpC,CAAC;CACJ","sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any */\n/* eslint-disable @typescript-eslint/no-unsafe-argument */\n// ^^ because of performance reasons\nimport Long from 'long'\n\nimport { LongSet } from './long-utils.js'\n\ninterface OneWayLinkedList<T> {\n    v: T\n    n?: OneWayLinkedList<T>\n}\n\n/**\n * Simple class implementing LRU-like behaviour for a Set.\n *\n * Note: this is not exactly LRU, but rather \"least recently added\"\n * and doesn't mark items as recently added if they are already in the set.\n * This is enough for our use case, so we don't bother with more complex implementation.\n *\n * Used to store recently received message IDs in {@link SessionConnection}\n *\n * Uses one-way linked list internally to keep track of insertion order\n */\nexport class LruSet<T extends string | number | Long> {\n    private _capacity: number\n    private _first?: OneWayLinkedList<T>\n    private _last?: OneWayLinkedList<T>\n\n    private _set: Set<T> | LongSet\n\n    constructor(capacity: number, forLong = false) {\n        this._capacity = capacity\n\n        this._set = forLong ? new LongSet() : new Set()\n    }\n\n    clear() {\n        this._first = this._last = undefined\n        this._set.clear()\n    }\n\n    add(val: T) {\n        if (this._set.has(val as any)) return\n\n        if (!this._first) this._first = { v: val }\n\n        if (!this._last) this._last = this._first\n        else {\n            this._last.n = { v: val }\n            this._last = this._last.n\n        }\n\n        this._set.add(val as any)\n\n        if (this._set.size > this._capacity && this._first) {\n            // remove least recently used\n            this._set.delete(this._first.v as any)\n            this._first = this._first.n\n        }\n    }\n\n    has(val: T) {\n        return this._set.has(val as any)\n    }\n}\n"]}

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

@@ -1,8 +0,0 @@
-/**
- * Sleep for the given number of ms
- *
- * @param ms  Number of ms to sleep
- */
-export declare const sleep: (ms: number) => Promise<void>;
-export declare function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void>;
-export declare function getRandomInt(top: number): number;

package/esm/utils/misc-utils.js

@@ -1,25 +0,0 @@
-/**
- * Sleep for the given number of ms
- *
- * @param ms  Number of ms to sleep
- */
-export const sleep = (ms) => new Promise((resolve) => setTimeout(resolve, ms));
-export function sleepWithAbort(ms, signal) {
-    return new Promise((resolve, reject) => {
-        // eslint-disable-next-line prefer-const
-        let timeout;
-        const onAbort = () => {
-            clearTimeout(timeout);
-            reject(signal.reason);
-        };
-        signal.addEventListener('abort', onAbort);
-        timeout = setTimeout(() => {
-            signal.removeEventListener('abort', onAbort);
-            resolve();
-        }, ms);
-    });
-}
-export function getRandomInt(top) {
-    return Math.floor(Math.random() * top);
-}
-//# sourceMappingURL=misc-utils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"misc-utils.js","sourceRoot":"","sources":["../../../src/utils/misc-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAiB,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAA;AAErG,MAAM,UAAU,cAAc,CAAC,EAAU,EAAE,MAAmB;IAC1D,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACnC,wCAAwC;QACxC,IAAI,OAAuB,CAAA;QAE3B,MAAM,OAAO,GAAG,GAAG,EAAE;YACjB,YAAY,CAAC,OAAO,CAAC,CAAA;YACrB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QACzB,CAAC,CAAA;QAED,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;QAEzC,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE;YACtB,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;YAC5C,OAAO,EAAE,CAAA;QACb,CAAC,EAAE,EAAE,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;AACN,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,GAAW;IACpC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA;AAC1C,CAAC","sourcesContent":["/**\n * Sleep for the given number of ms\n *\n * @param ms  Number of ms to sleep\n */\nexport const sleep = (ms: number): Promise<void> => new Promise((resolve) => setTimeout(resolve, ms))\n\nexport function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void> {\n    return new Promise((resolve, reject) => {\n        // eslint-disable-next-line prefer-const\n        let timeout: NodeJS.Timeout\n\n        const onAbort = () => {\n            clearTimeout(timeout)\n            reject(signal.reason)\n        }\n\n        signal.addEventListener('abort', onAbort)\n\n        timeout = setTimeout(() => {\n            signal.removeEventListener('abort', onAbort)\n            resolve()\n        }, ms)\n    })\n}\n\nexport function getRandomInt(top: number): number {\n    return Math.floor(Math.random() * top)\n}\n"]}

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

@@ -1,29 +0,0 @@
-import { tl } from '@mtcute/tl';
-import { BasicPeerType } from '../types/peers.js';
-/**
- * Add or remove channel marker from ID
- */
-export declare function toggleChannelIdMark(id: number): number;
-/**
- * Get the bare (non-marked) ID from a {@link tl.TypePeer}
- */
-export declare function getBarePeerId(peer: tl.TypePeer): number;
-/**
- * Get the marked (non-bare) ID from a {@link tl.TypePeer}
- *
- * *Mark* is bot API compatible, which is:
- * - ID stays the same for users
- * - ID is negated for chats
- * - ID is negated and `-1e12` is subtracted for channels
- */
-export declare function getMarkedPeerId(peerId: number, peerType: BasicPeerType): number;
-export declare function getMarkedPeerId(peer: tl.TypePeer | tl.TypeInputPeer | tl.TypeInputUser | tl.TypeInputChannel): number;
-/**
- * Parse a marked ID into a {@link BasicPeerType} and a bare ID
- */
-export declare function parseMarkedPeerId(id: number): [BasicPeerType, number];
-/**
- * Extracts all (cacheable) entities from a TlObject or a list of them.
- * Only checks `.user`, `.chat`, `.channel`, `.users` and `.chats` properties
- */
-export declare function getAllPeersFrom(obj: tl.TlObject | tl.TlObject[]): Iterable<tl.TypeUser | tl.TypeChat>;

package/esm/utils/peer-utils.js

@@ -1,159 +0,0 @@
-import { MtArgumentError, MtUnsupportedError } from '../types/errors.js';
-// src: https://github.com/tdlib/td/blob/master/td/telegram/DialogId.h
-const ZERO_CHANNEL_ID = -1000000000000;
-const ZERO_SECRET_CHAT_ID = -2000000000000;
-const MAX_SECRET_CHAT_ID = -1997852516353; // ZERO_SECRET_CHAT_ID + 0x7fffffff
-// src: https://github.com/tdlib/td/blob/master/td/telegram/ChatId.h
-// const MAX_CHAT_ID = 999999999999
-const MIN_MARKED_CHAT_ID = -999999999999; // -MAX_CHAT_ID
-// src: https://github.com/tdlib/td/blob/master/td/telegram/UserId.h
-// MAX_USER_ID = (1ll << 40) - 1
-const MAX_USER_ID = 1099511627775;
-// src: https://github.com/tdlib/td/blob/master/td/telegram/ChannelId.h
-// the last (1 << 31) - 1 identifiers will be used for secret chat dialog identifiers
-// MAX_CHANNEL_ID = 1000000000000ll - (1ll << 31)
-// const MAX_CHANNEL_ID = 997852516352
-const MIN_MARKED_CHANNEL_ID = -1997852516352; // ZERO_CHANNEL_ID - MAX_CHANNEL_ID
-/**
- * Add or remove channel marker from ID
- */
-export function toggleChannelIdMark(id) {
-    return ZERO_CHANNEL_ID - id;
-}
-/**
- * Get the bare (non-marked) ID from a {@link tl.TypePeer}
- */
-export function getBarePeerId(peer) {
-    switch (peer._) {
-        case 'peerUser':
-            return peer.userId;
-        case 'peerChat':
-            return peer.chatId;
-        case 'peerChannel':
-            return peer.channelId;
-    }
-}
-export function getMarkedPeerId(peer, peerType) {
-    if (typeof peer === 'number') {
-        switch (peerType) {
-            case 'user':
-                return peer;
-            case 'chat':
-                return -peer;
-            case 'channel':
-                return ZERO_CHANNEL_ID - peer;
-        }
-        throw new MtArgumentError('Invalid peer type');
-    }
-    switch (peer._) {
-        case 'mtcute.dummyInputPeerMinUser':
-        case 'peerUser':
-        case 'inputPeerUser':
-        case 'inputPeerUserFromMessage':
-        case 'inputUser':
-        case 'inputUserFromMessage':
-            return peer.userId;
-        case 'peerChat':
-        case 'inputPeerChat':
-            return -peer.chatId;
-        case 'mtcute.dummyInputPeerMinChannel':
-        case 'peerChannel':
-        case 'inputPeerChannel':
-        case 'inputPeerChannelFromMessage':
-        case 'inputChannel':
-        case 'inputChannelFromMessage':
-            return ZERO_CHANNEL_ID - peer.channelId;
-    }
-    throw new MtArgumentError(`Invalid peer: ${peer._}`);
-}
-/**
- * Parse a marked ID into a {@link BasicPeerType} and a bare ID
- */
-export function parseMarkedPeerId(id) {
-    if (id < 0) {
-        if (MIN_MARKED_CHAT_ID <= id) {
-            return ['chat', -id];
-        }
-        if (MIN_MARKED_CHANNEL_ID <= id && id !== ZERO_CHANNEL_ID) {
-            return ['channel', ZERO_CHANNEL_ID - id];
-        }
-        if (MAX_SECRET_CHAT_ID >= id && id !== ZERO_SECRET_CHAT_ID) {
-            // return 'secret'
-            throw new MtUnsupportedError('Secret chats are not supported');
-        }
-    }
-    else if (id > 0 && id <= MAX_USER_ID) {
-        return ['user', id];
-    }
-    throw new MtArgumentError(`Invalid marked peer id: ${id}`);
-}
-/**
- * Extracts all (cacheable) entities from a TlObject or a list of them.
- * Only checks `.user`, `.chat`, `.channel`, `.users` and `.chats` properties
- */
-export function* getAllPeersFrom(obj) {
-    if (typeof obj !== 'object')
-        return;
-    if (Array.isArray(obj)) {
-        for (const it of obj) {
-            yield* getAllPeersFrom(it);
-        }
-        return;
-    }
-    switch (obj._) {
-        case 'user':
-        case 'chat':
-        case 'channel':
-        case 'chatForbidden':
-        case 'channelForbidden':
-            yield obj;
-            return;
-    }
-    if ('user' in obj && typeof obj.user === 'object' && obj.user._ === 'user') {
-        yield obj.user;
-    }
-    if ('chat' in obj && typeof obj.chat === 'object') {
-        switch (obj.chat._) {
-            case 'chat':
-            case 'channel':
-            case 'chatForbidden':
-            case 'channelForbidden':
-                yield obj.chat;
-                break;
-        }
-    }
-    if ('channel' in obj && typeof obj.channel === 'object') {
-        switch (obj.channel._) {
-            case 'chat':
-            case 'channel':
-            case 'chatForbidden':
-            case 'channelForbidden':
-                yield obj.channel;
-                break;
-        }
-    }
-    if ('users' in obj && Array.isArray(obj.users) && obj.users.length) {
-        for (const user of obj.users) {
-            // .users is sometimes number[]
-            if (typeof user === 'object' && user._ === 'user') {
-                yield user;
-            }
-        }
-    }
-    if ('chats' in obj && Array.isArray(obj.chats) && obj.chats.length) {
-        for (const chat of obj.chats) {
-            // .chats is sometimes number[]
-            if (typeof chat === 'object') {
-                switch (chat._) {
-                    case 'chat':
-                    case 'channel':
-                    case 'chatForbidden':
-                    case 'channelForbidden':
-                        yield chat;
-                        break;
-                }
-            }
-        }
-    }
-}
-//# sourceMappingURL=peer-utils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"peer-utils.js","sourceRoot":"","sources":["../../../src/utils/peer-utils.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAA;AAGxE,sEAAsE;AACtE,MAAM,eAAe,GAAG,CAAC,aAAa,CAAA;AACtC,MAAM,mBAAmB,GAAG,CAAC,aAAa,CAAA;AAC1C,MAAM,kBAAkB,GAAG,CAAC,aAAa,CAAA,CAAC,mCAAmC;AAC7E,oEAAoE;AACpE,mCAAmC;AACnC,MAAM,kBAAkB,GAAG,CAAC,YAAY,CAAA,CAAC,eAAe;AACxD,oEAAoE;AACpE,gCAAgC;AAChC,MAAM,WAAW,GAAG,aAAa,CAAA;AACjC,uEAAuE;AACvE,qFAAqF;AACrF,iDAAiD;AACjD,sCAAsC;AACtC,MAAM,qBAAqB,GAAG,CAAC,aAAa,CAAA,CAAC,mCAAmC;AAEhF;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC1C,OAAO,eAAe,GAAG,EAAE,CAAA;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAiB;IAC3C,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC;QACb,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,MAAM,CAAA;QACtB,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,MAAM,CAAA;QACtB,KAAK,aAAa;YACd,OAAO,IAAI,CAAC,SAAS,CAAA;IAC7B,CAAC;AACL,CAAC;AAeD,MAAM,UAAU,eAAe,CAC3B,IAAsF,EACtF,QAAwB;IAExB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,QAAQ,QAAQ,EAAE,CAAC;YACf,KAAK,MAAM;gBACP,OAAO,IAAI,CAAA;YACf,KAAK,MAAM;gBACP,OAAO,CAAC,IAAI,CAAA;YAChB,KAAK,SAAS;gBACV,OAAO,eAAe,GAAG,IAAI,CAAA;QACrC,CAAC;QACD,MAAM,IAAI,eAAe,CAAC,mBAAmB,CAAC,CAAA;IAClD,CAAC;IAED,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC;QACb,KAAK,8BAA8B,CAAC;QACpC,KAAK,UAAU,CAAC;QAChB,KAAK,eAAe,CAAC;QACrB,KAAK,0BAA0B,CAAC;QAChC,KAAK,WAAW,CAAC;QACjB,KAAK,sBAAsB;YACvB,OAAO,IAAI,CAAC,MAAM,CAAA;QACtB,KAAK,UAAU,CAAC;QAChB,KAAK,eAAe;YAChB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAA;QACvB,KAAK,iCAAiC,CAAC;QACvC,KAAK,aAAa,CAAC;QACnB,KAAK,kBAAkB,CAAC;QACxB,KAAK,6BAA6B,CAAC;QACnC,KAAK,cAAc,CAAC;QACpB,KAAK,yBAAyB;YAC1B,OAAO,eAAe,GAAG,IAAI,CAAC,SAAS,CAAA;IAC/C,CAAC;IAED,MAAM,IAAI,eAAe,CAAC,iBAAiB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAA;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAU;IACxC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACT,IAAI,kBAAkB,IAAI,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACxB,CAAC;QAED,IAAI,qBAAqB,IAAI,EAAE,IAAI,EAAE,KAAK,eAAe,EAAE,CAAC;YACxD,OAAO,CAAC,SAAS,EAAE,eAAe,GAAG,EAAE,CAAC,CAAA;QAC5C,CAAC;QAED,IAAI,kBAAkB,IAAI,EAAE,IAAI,EAAE,KAAK,mBAAmB,EAAE,CAAC;YACzD,kBAAkB;YAClB,MAAM,IAAI,kBAAkB,CAAC,gCAAgC,CAAC,CAAA;QAClE,CAAC;IACL,CAAC;SAAM,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,WAAW,EAAE,CAAC;QACrC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IACvB,CAAC;IAED,MAAM,IAAI,eAAe,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAAA;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,eAAe,CAAC,GAAgC;IAC7D,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAM;IAEnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACnB,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAA;QAC9B,CAAC;QAED,OAAM;IACV,CAAC;IAED,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC;QACf,KAAK,eAAe,CAAC;QACrB,KAAK,kBAAkB;YACnB,MAAM,GAAG,CAAA;YAET,OAAM;IACd,CAAC;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;QACzE,MAAM,GAAG,CAAC,IAAI,CAAA;IAClB,CAAC;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAChD,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,IAAI,CAAA;gBACd,MAAK;QACb,CAAC;IACL,CAAC;IAED,IAAI,SAAS,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;QACtD,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;YACpB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,OAAO,CAAA;gBACjB,MAAK;QACb,CAAC;IACL,CAAC;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACjE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC3B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;gBAChD,MAAM,IAAI,CAAA;YACd,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACjE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC3B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC3B,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC;oBACb,KAAK,MAAM,CAAC;oBACZ,KAAK,SAAS,CAAC;oBACf,KAAK,eAAe,CAAC;oBACrB,KAAK,kBAAkB;wBACnB,MAAM,IAAI,CAAA;wBACV,MAAK;gBACb,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC","sourcesContent":["import { tl } from '@mtcute/tl'\n\nimport { MtArgumentError, MtUnsupportedError } from '../types/errors.js'\nimport { BasicPeerType } from '../types/peers.js'\n\n// src: https://github.com/tdlib/td/blob/master/td/telegram/DialogId.h\nconst ZERO_CHANNEL_ID = -1000000000000\nconst ZERO_SECRET_CHAT_ID = -2000000000000\nconst MAX_SECRET_CHAT_ID = -1997852516353 // ZERO_SECRET_CHAT_ID + 0x7fffffff\n// src: https://github.com/tdlib/td/blob/master/td/telegram/ChatId.h\n// const MAX_CHAT_ID = 999999999999\nconst MIN_MARKED_CHAT_ID = -999999999999 // -MAX_CHAT_ID\n// src: https://github.com/tdlib/td/blob/master/td/telegram/UserId.h\n// MAX_USER_ID = (1ll << 40) - 1\nconst MAX_USER_ID = 1099511627775\n// src: https://github.com/tdlib/td/blob/master/td/telegram/ChannelId.h\n// the last (1 << 31) - 1 identifiers will be used for secret chat dialog identifiers\n// MAX_CHANNEL_ID = 1000000000000ll - (1ll << 31)\n// const MAX_CHANNEL_ID = 997852516352\nconst MIN_MARKED_CHANNEL_ID = -1997852516352 // ZERO_CHANNEL_ID - MAX_CHANNEL_ID\n\n/**\n * Add or remove channel marker from ID\n */\nexport function toggleChannelIdMark(id: number): number {\n    return ZERO_CHANNEL_ID - id\n}\n\n/**\n * Get the bare (non-marked) ID from a {@link tl.TypePeer}\n */\nexport function getBarePeerId(peer: tl.TypePeer): number {\n    switch (peer._) {\n        case 'peerUser':\n            return peer.userId\n        case 'peerChat':\n            return peer.chatId\n        case 'peerChannel':\n            return peer.channelId\n    }\n}\n\n// src: https://github.com/tdlib/td/blob/master/td/telegram/DialogId.cpp\n\n/**\n * Get the marked (non-bare) ID from a {@link tl.TypePeer}\n *\n * *Mark* is bot API compatible, which is:\n * - ID stays the same for users\n * - ID is negated for chats\n * - ID is negated and `-1e12` is subtracted for channels\n */\nexport function getMarkedPeerId(peerId: number, peerType: BasicPeerType): number\nexport function getMarkedPeerId(peer: tl.TypePeer | tl.TypeInputPeer | tl.TypeInputUser | tl.TypeInputChannel): number\n\nexport function getMarkedPeerId(\n    peer: tl.TypePeer | tl.TypeInputPeer | tl.TypeInputUser | tl.TypeInputChannel | number,\n    peerType?: BasicPeerType,\n): number {\n    if (typeof peer === 'number') {\n        switch (peerType) {\n            case 'user':\n                return peer\n            case 'chat':\n                return -peer\n            case 'channel':\n                return ZERO_CHANNEL_ID - peer\n        }\n        throw new MtArgumentError('Invalid peer type')\n    }\n\n    switch (peer._) {\n        case 'mtcute.dummyInputPeerMinUser':\n        case 'peerUser':\n        case 'inputPeerUser':\n        case 'inputPeerUserFromMessage':\n        case 'inputUser':\n        case 'inputUserFromMessage':\n            return peer.userId\n        case 'peerChat':\n        case 'inputPeerChat':\n            return -peer.chatId\n        case 'mtcute.dummyInputPeerMinChannel':\n        case 'peerChannel':\n        case 'inputPeerChannel':\n        case 'inputPeerChannelFromMessage':\n        case 'inputChannel':\n        case 'inputChannelFromMessage':\n            return ZERO_CHANNEL_ID - peer.channelId\n    }\n\n    throw new MtArgumentError(`Invalid peer: ${peer._}`)\n}\n\n/**\n * Parse a marked ID into a {@link BasicPeerType} and a bare ID\n */\nexport function parseMarkedPeerId(id: number): [BasicPeerType, number] {\n    if (id < 0) {\n        if (MIN_MARKED_CHAT_ID <= id) {\n            return ['chat', -id]\n        }\n\n        if (MIN_MARKED_CHANNEL_ID <= id && id !== ZERO_CHANNEL_ID) {\n            return ['channel', ZERO_CHANNEL_ID - id]\n        }\n\n        if (MAX_SECRET_CHAT_ID >= id && id !== ZERO_SECRET_CHAT_ID) {\n            // return 'secret'\n            throw new MtUnsupportedError('Secret chats are not supported')\n        }\n    } else if (id > 0 && id <= MAX_USER_ID) {\n        return ['user', id]\n    }\n\n    throw new MtArgumentError(`Invalid marked peer id: ${id}`)\n}\n\n/**\n * Extracts all (cacheable) entities from a TlObject or a list of them.\n * Only checks `.user`, `.chat`, `.channel`, `.users` and `.chats` properties\n */\nexport function* getAllPeersFrom(obj: tl.TlObject | tl.TlObject[]): Iterable<tl.TypeUser | tl.TypeChat> {\n    if (typeof obj !== 'object') return\n\n    if (Array.isArray(obj)) {\n        for (const it of obj) {\n            yield* getAllPeersFrom(it)\n        }\n\n        return\n    }\n\n    switch (obj._) {\n        case 'user':\n        case 'chat':\n        case 'channel':\n        case 'chatForbidden':\n        case 'channelForbidden':\n            yield obj\n\n            return\n    }\n\n    if ('user' in obj && typeof obj.user === 'object' && obj.user._ === 'user') {\n        yield obj.user\n    }\n\n    if ('chat' in obj && typeof obj.chat === 'object') {\n        switch (obj.chat._) {\n            case 'chat':\n            case 'channel':\n            case 'chatForbidden':\n            case 'channelForbidden':\n                yield obj.chat\n                break\n        }\n    }\n\n    if ('channel' in obj && typeof obj.channel === 'object') {\n        switch (obj.channel._) {\n            case 'chat':\n            case 'channel':\n            case 'chatForbidden':\n            case 'channelForbidden':\n                yield obj.channel\n                break\n        }\n    }\n\n    if ('users' in obj && Array.isArray(obj.users) && obj.users.length) {\n        for (const user of obj.users) {\n            // .users is sometimes number[]\n            if (typeof user === 'object' && user._ === 'user') {\n                yield user\n            }\n        }\n    }\n\n    if ('chats' in obj && Array.isArray(obj.chats) && obj.chats.length) {\n        for (const chat of obj.chats) {\n            // .chats is sometimes number[]\n            if (typeof chat === 'object') {\n                switch (chat._) {\n                    case 'chat':\n                    case 'channel':\n                    case 'chatForbidden':\n                    case 'channelForbidden':\n                        yield chat\n                        break\n                }\n            }\n        }\n    }\n}\n"]}

package/esm/utils/reloadable.d.ts

@@ -1,23 +0,0 @@
-export interface ReloadableParams<Data> {
-    reload: (old?: Data) => Promise<Data>;
-    getExpiresAt: (data: Data) => number;
-    onError?: (err: unknown) => void;
-    disableAutoReload?: boolean;
-}
-export declare class Reloadable<Data> {
-    readonly params: ReloadableParams<Data>;
-    constructor(params: ReloadableParams<Data>);
-    protected _data?: Data;
-    protected _expiresAt: number;
-    protected _listeners: ((data: Data) => void)[];
-    protected _timeout?: NodeJS.Timeout;
-    private _reload;
-    get isStale(): boolean;
-    setData(data: Data): void;
-    update(force?: boolean): Promise<void>;
-    onReload(cb: (data: Data) => void): void;
-    offReload(cb: (data: Data) => void): void;
-    getNow(): Data | undefined;
-    get(): Promise<Data>;
-    destroy(): void;
-}

package/esm/utils/reloadable.js

@@ -1,61 +0,0 @@
-import { asyncResettable } from './function-utils.js';
-export class Reloadable {
-    params;
-    constructor(params) {
-        this.params = params;
-    }
-    _data;
-    _expiresAt = 0;
-    _listeners = [];
-    _timeout;
-    _reload = asyncResettable(async () => {
-        const data = await this.params.reload(this._data);
-        this.setData(data);
-        this._listeners.forEach((cb) => cb(data));
-    });
-    get isStale() {
-        return !this._data || this._expiresAt <= Date.now();
-    }
-    setData(data) {
-        const expiresAt = this.params.getExpiresAt(data);
-        this._data = data;
-        this._expiresAt = expiresAt;
-        if (this._timeout)
-            clearTimeout(this._timeout);
-        if (!this.params.disableAutoReload) {
-            this._timeout = setTimeout(() => {
-                this._reload.reset();
-                this.update().catch((err) => {
-                    this.params.onError?.(err);
-                });
-            }, expiresAt - Date.now());
-        }
-    }
-    update(force = false) {
-        if (!force && !this.isStale)
-            return Promise.resolve();
-        return this._reload.run();
-    }
-    onReload(cb) {
-        this._listeners.push(cb);
-    }
-    offReload(cb) {
-        const idx = this._listeners.indexOf(cb);
-        if (idx >= 0)
-            this._listeners.splice(idx, 1);
-    }
-    getNow() {
-        return this._data;
-    }
-    async get() {
-        await this.update();
-        return this._data;
-    }
-    destroy() {
-        if (this._timeout)
-            clearTimeout(this._timeout);
-        this._listeners.length = 0;
-        this._reload.reset();
-    }
-}
-//# sourceMappingURL=reloadable.js.map

package/esm/utils/reloadable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reloadable.js","sourceRoot":"","sources":["../../../src/utils/reloadable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAA;AASrD,MAAM,OAAO,UAAU;IACE;IAArB,YAAqB,MAA8B;QAA9B,WAAM,GAAN,MAAM,CAAwB;IAAG,CAAC;IAE7C,KAAK,CAAO;IACZ,UAAU,GAAG,CAAC,CAAA;IACd,UAAU,GAA6B,EAAE,CAAA;IACzC,QAAQ,CAAiB;IAE3B,OAAO,GAAG,eAAe,CAAC,KAAK,IAAI,EAAE;QACzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACjD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAElB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,CAAC,CAAC,CAAA;IAEF,IAAI,OAAO;QACP,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,CAAA;IACvD,CAAC;IAED,OAAO,CAAC,IAAU;QACd,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;QAEhD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACjB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAA;QAE3B,IAAI,IAAI,CAAC,QAAQ;YAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAE9C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC;YACjC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC5B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;gBACpB,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;oBACjC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAA;gBAC9B,CAAC,CAAC,CAAA;YACN,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;QAC9B,CAAC;IACL,CAAC;IAED,MAAM,CAAC,KAAK,GAAG,KAAK;QAChB,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAA;QAErD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAA;IAC7B,CAAC;IAED,QAAQ,CAAC,EAAwB;QAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC5B,CAAC;IAED,SAAS,CAAC,EAAwB;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,GAAG,IAAI,CAAC;YAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IAChD,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,KAAK,CAAA;IACrB,CAAC;IAED,KAAK,CAAC,GAAG;QACL,MAAM,IAAI,CAAC,MAAM,EAAE,CAAA;QAEnB,OAAO,IAAI,CAAC,KAAM,CAAA;IACtB,CAAC;IAED,OAAO;QACH,IAAI,IAAI,CAAC,QAAQ;YAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;IACxB,CAAC;CACJ","sourcesContent":["import { asyncResettable } from './function-utils.js'\n\nexport interface ReloadableParams<Data> {\n    reload: (old?: Data) => Promise<Data>\n    getExpiresAt: (data: Data) => number\n    onError?: (err: unknown) => void\n    disableAutoReload?: boolean\n}\n\nexport class Reloadable<Data> {\n    constructor(readonly params: ReloadableParams<Data>) {}\n\n    protected _data?: Data\n    protected _expiresAt = 0\n    protected _listeners: ((data: Data) => void)[] = []\n    protected _timeout?: NodeJS.Timeout\n\n    private _reload = asyncResettable(async () => {\n        const data = await this.params.reload(this._data)\n        this.setData(data)\n\n        this._listeners.forEach((cb) => cb(data))\n    })\n\n    get isStale(): boolean {\n        return !this._data || this._expiresAt <= Date.now()\n    }\n\n    setData(data: Data): void {\n        const expiresAt = this.params.getExpiresAt(data)\n\n        this._data = data\n        this._expiresAt = expiresAt\n\n        if (this._timeout) clearTimeout(this._timeout)\n\n        if (!this.params.disableAutoReload) {\n            this._timeout = setTimeout(() => {\n                this._reload.reset()\n                this.update().catch((err: unknown) => {\n                    this.params.onError?.(err)\n                })\n            }, expiresAt - Date.now())\n        }\n    }\n\n    update(force = false): Promise<void> {\n        if (!force && !this.isStale) return Promise.resolve()\n\n        return this._reload.run()\n    }\n\n    onReload(cb: (data: Data) => void): void {\n        this._listeners.push(cb)\n    }\n\n    offReload(cb: (data: Data) => void): void {\n        const idx = this._listeners.indexOf(cb)\n        if (idx >= 0) this._listeners.splice(idx, 1)\n    }\n\n    getNow(): Data | undefined {\n        return this._data\n    }\n\n    async get(): Promise<Data> {\n        await this.update()\n\n        return this._data!\n    }\n\n    destroy(): void {\n        if (this._timeout) clearTimeout(this._timeout)\n        this._listeners.length = 0\n        this._reload.reset()\n    }\n}\n"]}

package/esm/utils/sorted-array.d.ts

@@ -1,17 +0,0 @@
-/**
- * Array that adds elements in sorted order.
- *
- * Comparator is always called like: comparator(itemFromSortedArray, yourItem)
- */
-export declare class SortedArray<T> {
-    readonly comparator: (a: T, b: T) => number;
-    readonly raw: T[];
-    constructor(array: T[] | undefined, comparator: (a: T, b: T) => number);
-    get length(): number;
-    insert(item: T | T[]): number;
-    index(item: T, closest?: boolean): number;
-    remove(item: T): void;
-    includes(item: T): boolean;
-    find(item: T): T | null;
-    clear(): void;
-}

package/esm/utils/sorted-array.js

@@ -1,82 +0,0 @@
-/**
- * Array that adds elements in sorted order.
- *
- * Comparator is always called like: comparator(itemFromSortedArray, yourItem)
- */
-export class SortedArray {
-    comparator;
-    raw;
-    constructor(array = [], comparator) {
-        this.comparator = comparator;
-        this.raw = array.sort(comparator);
-        this.comparator = comparator;
-    }
-    get length() {
-        return this.raw.length;
-    }
-    insert(item) {
-        if (Array.isArray(item)) {
-            let ind = -1;
-            item.forEach((it) => {
-                ind = this.insert(it);
-            });
-            return ind;
-        }
-        if (this.raw.length === 0) {
-            this.raw.push(item);
-            return 0;
-        }
-        // find insert position
-        let lo = 0;
-        let hi = this.raw.length;
-        while (lo < hi) {
-            const mid = Math.floor((lo + hi) / 2);
-            if (this.comparator(this.raw[mid], item) > 0) {
-                hi = mid;
-            }
-            else {
-                lo = mid + 1;
-            }
-        }
-        this.raw.splice(lo, 0, item);
-        return lo;
-    }
-    // closest: return the closest value (right-hand side)
-    // meaning that raw[idx - 1] <= item <= raw[idx]
-    // in other words, smallest idx such that raw[idx] >= item
-    index(item, closest = false) {
-        let lo = 0;
-        let hi = this.raw.length;
-        while (lo < hi) {
-            const mid = Math.floor((lo + hi) / 2);
-            const cmp = this.comparator(this.raw[mid], item);
-            if (cmp === 0) {
-                return mid;
-            }
-            if (cmp > 0) {
-                hi = mid;
-            }
-            else {
-                lo = mid + 1;
-            }
-        }
-        return closest ? lo : -1;
-    }
-    remove(item) {
-        const idx = this.index(item);
-        if (idx === -1)
-            return;
-        this.raw.splice(idx, 1);
-    }
-    includes(item) {
-        return this.index(item) !== -1;
-    }
-    find(item) {
-        const ind = this.index(item);
-        return ind === -1 ? null : this.raw[ind];
-    }
-    clear() {
-        this.raw.length = 0;
-    }
-}
-//# sourceMappingURL=sorted-array.js.map