@mtcute/core 0.1.0

package/cjs/utils/long-utils.js

@@ -0,0 +1,161 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LongSet = exports.LongMap = exports.longFromFastString = exports.longToFastString = exports.removeFromLongArray = exports.longFromBuffer = exports.randomLong = void 0;
+const long_1 = __importDefault(require("long"));
+const buffer_utils_js_1 = require("./buffer-utils.js");
+const misc_utils_js_1 = require("./misc-utils.js");
+/**
+ * Get a random Long
+ *
+ * @param unsigned  Whether the number should be unsigned
+ */
+function randomLong(unsigned = false) {
+    const lo = (0, misc_utils_js_1.getRandomInt)(0xffffffff);
+    const hi = (0, misc_utils_js_1.getRandomInt)(0xffffffff);
+    return new long_1.default(lo, hi, unsigned);
+}
+exports.randomLong = randomLong;
+/**
+ * Read a Long from a buffer
+ *
+ * @param buf  Buffer to read from
+ * @param unsigned  Whether the number should be unsigned
+ * @param le  Whether the number is little-endian
+ */
+function longFromBuffer(buf, unsigned = false, le = true) {
+    const dv = (0, buffer_utils_js_1.dataViewFromBuffer)(buf);
+    if (le) {
+        return new long_1.default(dv.getInt32(0, true), dv.getInt32(4, true), unsigned);
+    }
+    return new long_1.default(dv.getInt32(4, false), dv.getInt32(0, false), unsigned);
+}
+exports.longFromBuffer = longFromBuffer;
+/**
+ * Remove a Long from an array
+ *
+ * @param arr  Array to remove from
+ * @param val  Value to remove
+ */
+function removeFromLongArray(arr, val) {
+    for (let i = 0; i < arr.length; i++) {
+        const v = arr[i];
+        // v === val for the case when the exact same object was passed
+        if (v === val || v.eq(val)) {
+            arr.splice(i, 1);
+            return true;
+        }
+    }
+    return false;
+}
+exports.removeFromLongArray = removeFromLongArray;
+/**
+ * Serialize a Long (int64) to its fast string representation:
+ * `$high|$low`.
+ *
+ * This method is about 500* times faster than using `Long.toString()`,
+ * and very useful when the string will only ever be used internally
+ * (e.g. for keying a map)
+ *
+ * _\* benchmark result, YMMV_
+ *
+ * @param val
+ */
+function longToFastString(val) {
+    return `${val.low}|${val.high}`;
+}
+exports.longToFastString = longToFastString;
+/**
+ * Parse a Long (int64) from its fast string representation:
+ * `$high|$low`.
+ *
+ * This method is about 2 times faster than using Long.fromString.
+ *
+ * @param val
+ * @param unsigned
+ */
+function longFromFastString(val, unsigned = false) {
+    const parts = val.split('|');
+    if (parts.length !== 2)
+        throw new Error(`Invalid long fast string: ${val}`);
+    const low = parseInt(parts[0]);
+    const high = parseInt(parts[1]);
+    if (isNaN(low) || isNaN(high)) {
+        throw new Error(`Invalid long fast string: ${val}`);
+    }
+    return new long_1.default(low, high, unsigned);
+}
+exports.longFromFastString = longFromFastString;
+/**
+ * Map with Longs as key.
+ *
+ * Uses fast string representation internally.
+ */
+class LongMap {
+    constructor() {
+        this._map = new Map();
+    }
+    set(key, value) {
+        this._map.set(longToFastString(key), value);
+    }
+    has(key) {
+        return this._map.has(longToFastString(key));
+    }
+    get(key) {
+        return this._map.get(longToFastString(key));
+    }
+    delete(key) {
+        this._map.delete(longToFastString(key));
+    }
+    *keys(unsigned) {
+        for (const v of this._map.keys()) {
+            yield longFromFastString(v, unsigned);
+        }
+    }
+    values() {
+        return this._map.values();
+    }
+    clear() {
+        this._map.clear();
+    }
+    size() {
+        return this._map.size;
+    }
+}
+exports.LongMap = LongMap;
+/**
+ * Set for Longs.
+ *
+ * Uses fast string representation internally
+ */
+class LongSet {
+    constructor() {
+        this._set = new Set();
+    }
+    get size() {
+        return this._set.size;
+    }
+    add(val) {
+        this._set.add(longToFastString(val));
+    }
+    delete(val) {
+        this._set.delete(longToFastString(val));
+    }
+    has(val) {
+        return this._set.has(longToFastString(val));
+    }
+    clear() {
+        this._set.clear();
+    }
+    toArray() {
+        const arr = [];
+        for (const v of this._set) {
+            arr.push(longFromFastString(v));
+        }
+        return arr;
+    }
+}
+exports.LongSet = LongSet;
+//# sourceMappingURL=long-utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"long-utils.js","sourceRoot":"","sources":["../../../src/utils/long-utils.ts"],"names":[],"mappings":";;;;;;AAAA,gDAAuB;AAEvB,uDAAsD;AACtD,mDAA8C;AAE9C;;;;GAIG;AACH,SAAgB,UAAU,CAAC,QAAQ,GAAG,KAAK;IACvC,MAAM,EAAE,GAAG,IAAA,4BAAY,EAAC,UAAU,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAA,4BAAY,EAAC,UAAU,CAAC,CAAA;IAEnC,OAAO,IAAI,cAAI,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAA;AACrC,CAAC;AALD,gCAKC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,GAAe,EAAE,QAAQ,GAAG,KAAK,EAAE,EAAE,GAAG,IAAI;IACvE,MAAM,EAAE,GAAG,IAAA,oCAAkB,EAAC,GAAG,CAAC,CAAA;IAElC,IAAI,EAAE,EAAE;QACJ,OAAO,IAAI,cAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAA;KACxE;IAED,OAAO,IAAI,cAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAA;AAC3E,CAAC;AARD,wCAQC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,GAAW,EAAE,GAAS;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QAEhB,+DAA+D;QAC/D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YACxB,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAEhB,OAAO,IAAI,CAAA;SACd;KACJ;IAED,OAAO,KAAK,CAAA;AAChB,CAAC;AAbD,kDAaC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,gBAAgB,CAAC,GAAS;IACtC,OAAO,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAA;AACnC,CAAC;AAFD,4CAEC;AAED;;;;;;;;GAQG;AACH,SAAgB,kBAAkB,CAAC,GAAW,EAAE,QAAQ,GAAG,KAAK;IAC5D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAE5B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,GAAG,EAAE,CAAC,CAAA;IAC3E,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAE/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE;QAC3B,MAAM,IAAI,KAAK,CAAC,6BAA6B,GAAG,EAAE,CAAC,CAAA;KACtD;IAED,OAAO,IAAI,cAAI,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;AACxC,CAAC;AAZD,gDAYC;AAED;;;;GAIG;AACH,MAAa,OAAO;IAApB;QACY,SAAI,GAAG,IAAI,GAAG,EAAa,CAAA;IAmCvC,CAAC;IAjCG,GAAG,CAAC,GAAS,EAAE,KAAQ;QACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;IAC/C,CAAC;IAED,GAAG,CAAC,GAAS;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED,GAAG,CAAC,GAAS;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED,MAAM,CAAC,GAAS;QACZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,CAAC,IAAI,CAAC,QAAkB;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE;YAC9B,MAAM,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;SACxC;IACL,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;IACrB,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IACzB,CAAC;CACJ;AApCD,0BAoCC;AAED;;;;GAIG;AACH,MAAa,OAAO;IAApB;QACY,SAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IA+BpC,CAAC;IA7BG,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IACzB,CAAC;IAED,GAAG,CAAC,GAAS;QACT,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IACxC,CAAC;IAED,MAAM,CAAC,GAAS;QACZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,GAAG,CAAC,GAAS;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;IACrB,CAAC;IAED,OAAO;QACH,MAAM,GAAG,GAAW,EAAE,CAAA;QAEtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;YACvB,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;SAClC;QAED,OAAO,GAAG,CAAA;IACd,CAAC;CACJ;AAhCD,0BAgCC","sourcesContent":["import Long from 'long'\n\nimport { dataViewFromBuffer } from './buffer-utils.js'\nimport { getRandomInt } from './misc-utils.js'\n\n/**\n * Get a random Long\n *\n * @param unsigned  Whether the number should be unsigned\n */\nexport function randomLong(unsigned = false): Long {\n    const lo = getRandomInt(0xffffffff)\n    const hi = getRandomInt(0xffffffff)\n\n    return new Long(lo, hi, unsigned)\n}\n\n/**\n * Read a Long from a buffer\n *\n * @param buf  Buffer to read from\n * @param unsigned  Whether the number should be unsigned\n * @param le  Whether the number is little-endian\n */\nexport function longFromBuffer(buf: Uint8Array, unsigned = false, le = true): Long {\n    const dv = dataViewFromBuffer(buf)\n\n    if (le) {\n        return new Long(dv.getInt32(0, true), dv.getInt32(4, true), unsigned)\n    }\n\n    return new Long(dv.getInt32(4, false), dv.getInt32(0, false), unsigned)\n}\n\n/**\n * Remove a Long from an array\n *\n * @param arr  Array to remove from\n * @param val  Value to remove\n */\nexport function removeFromLongArray(arr: Long[], val: Long): boolean {\n    for (let i = 0; i < arr.length; i++) {\n        const v = arr[i]\n\n        // v === val for the case when the exact same object was passed\n        if (v === val || v.eq(val)) {\n            arr.splice(i, 1)\n\n            return true\n        }\n    }\n\n    return false\n}\n\n/**\n * Serialize a Long (int64) to its fast string representation:\n * `$high|$low`.\n *\n * This method is about 500* times faster than using `Long.toString()`,\n * and very useful when the string will only ever be used internally\n * (e.g. for keying a map)\n *\n * _\\* benchmark result, YMMV_\n *\n * @param val\n */\nexport function longToFastString(val: Long): string {\n    return `${val.low}|${val.high}`\n}\n\n/**\n * Parse a Long (int64) from its fast string representation:\n * `$high|$low`.\n *\n * This method is about 2 times faster than using Long.fromString.\n *\n * @param val\n * @param unsigned\n */\nexport function longFromFastString(val: string, unsigned = false): Long {\n    const parts = val.split('|')\n\n    if (parts.length !== 2) throw new Error(`Invalid long fast string: ${val}`)\n    const low = parseInt(parts[0])\n    const high = parseInt(parts[1])\n\n    if (isNaN(low) || isNaN(high)) {\n        throw new Error(`Invalid long fast string: ${val}`)\n    }\n\n    return new Long(low, high, unsigned)\n}\n\n/**\n * Map with Longs as key.\n *\n * Uses fast string representation internally.\n */\nexport class LongMap<V> {\n    private _map = new Map<string, V>()\n\n    set(key: Long, value: V): void {\n        this._map.set(longToFastString(key), value)\n    }\n\n    has(key: Long): boolean {\n        return this._map.has(longToFastString(key))\n    }\n\n    get(key: Long): V | undefined {\n        return this._map.get(longToFastString(key))\n    }\n\n    delete(key: Long): void {\n        this._map.delete(longToFastString(key))\n    }\n\n    *keys(unsigned?: boolean): IterableIterator<Long> {\n        for (const v of this._map.keys()) {\n            yield longFromFastString(v, unsigned)\n        }\n    }\n\n    values(): IterableIterator<V> {\n        return this._map.values()\n    }\n\n    clear(): void {\n        this._map.clear()\n    }\n\n    size(): number {\n        return this._map.size\n    }\n}\n\n/**\n * Set for Longs.\n *\n * Uses fast string representation internally\n */\nexport class LongSet {\n    private _set = new Set<string>()\n\n    get size(): number {\n        return this._set.size\n    }\n\n    add(val: Long) {\n        this._set.add(longToFastString(val))\n    }\n\n    delete(val: Long) {\n        this._set.delete(longToFastString(val))\n    }\n\n    has(val: Long) {\n        return this._set.has(longToFastString(val))\n    }\n\n    clear() {\n        this._set.clear()\n    }\n\n    toArray() {\n        const arr: Long[] = []\n\n        for (const v of this._set) {\n            arr.push(longFromFastString(v))\n        }\n\n        return arr\n    }\n}\n"]}

package/cjs/utils/lru-map.d.ts

@@ -0,0 +1,21 @@
+/**
+ * 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 declare class LruMap<K extends string | number, V> {
+    private _capacity;
+    private _first?;
+    private _last?;
+    private _map;
+    private _size;
+    constructor(capacity: number, forLong?: boolean);
+    private _markUsed;
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    private _remove;
+    set(key: K, value: V): void;
+    delete(key: K): void;
+}

package/cjs/utils/lru-map.js

@@ -0,0 +1,107 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LruMap = void 0;
+/* eslint-disable @typescript-eslint/no-explicit-any,@typescript-eslint/no-unsafe-assignment */
+/* eslint-disable @typescript-eslint/no-unsafe-argument */
+// ^^ because of performance reasons
+const long_utils_js_1 = require("./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
+ */
+class LruMap {
+    constructor(capacity, forLong = false) {
+        this._size = 0;
+        this._capacity = capacity;
+        this._map = forLong ? new long_utils_js_1.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);
+    }
+}
+exports.LruMap = LruMap;
+//# sourceMappingURL=lru-map.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru-map.js","sourceRoot":"","sources":["../../../src/utils/lru-map.ts"],"names":[],"mappings":";;;AAAA,+FAA+F;AAC/F,0DAA0D;AAC1D,oCAAoC;AACpC,mDAAyC;AAazC;;;;;;GAMG;AACH,MAAa,MAAM;IASf,YAAY,QAAgB,EAAE,OAAO,GAAG,KAAK;QAFrC,UAAK,GAAG,CAAC,CAAA;QAGb,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAE,IAAI,uBAAO,EAAU,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAA;IAC5D,CAAC;IAEO,SAAS,CAAC,IAA4B;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;YACtB,OAAM,CAAC,iCAAiC;SAC3C;QAED,IAAI,IAAI,CAAC,CAAC,EAAE;YACR,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;aACtB;YACD,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;SACpB;QAED,IAAI,IAAI,CAAC,CAAC,EAAE;YACR,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;SACpB;QAED,IAAI,CAAC,CAAC,GAAG,SAAS,CAAA;QAClB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QAEpB,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;SACvB;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;YACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAA;SAC3B;aAAM;YACH,YAAY;YACZ,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;YACtB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAA;SAC1B;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;YACN,2BAA2B;YAC3B,IAAI,CAAC,CAAC,GAAG,KAAK,CAAA;YACd,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YAEpB,OAAM;SACT;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;YACb,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;YACpB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;SACvB;aAAM;YACH,kBAAkB;YAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;SACpB;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;QAClB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;QAEf,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE;YAC7B,uBAAuB;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAA;YAEzB,IAAI,MAAM,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;aACvB;SACJ;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;CACJ;AAlHD,wBAkHC","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"]}

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

@@ -0,0 +1,22 @@
+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/cjs/utils/lru-set.js

@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LruSet = void 0;
+const long_utils_js_1 = require("./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
+ */
+class LruSet {
+    constructor(capacity, forLong = false) {
+        this._capacity = capacity;
+        this._set = forLong ? new long_utils_js_1.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);
+    }
+}
+exports.LruSet = LruSet;
+//# sourceMappingURL=lru-set.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru-set.js","sourceRoot":"","sources":["../../../src/utils/lru-set.ts"],"names":[],"mappings":";;;AAKA,mDAAyC;AAOzC;;;;;;;;;;GAUG;AACH,MAAa,MAAM;IAOf,YAAY,QAAgB,EAAE,OAAO,GAAG,KAAK;QACzC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,uBAAO,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;YACD,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;YACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;SAC5B;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;YAChD,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;SAC9B;IACL,CAAC;IAED,GAAG,CAAC,GAAM;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAU,CAAC,CAAA;IACpC,CAAC;CACJ;AAzCD,wBAyCC","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/cjs/utils/misc-utils.d.ts

@@ -0,0 +1,7 @@
+/**
+ * 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 getRandomInt(top: number): number;

package/cjs/utils/misc-utils.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRandomInt = exports.sleep = void 0;
+/**
+ * Sleep for the given number of ms
+ *
+ * @param ms  Number of ms to sleep
+ */
+const sleep = (ms) => new Promise((resolve) => setTimeout(resolve, ms));
+exports.sleep = sleep;
+function getRandomInt(top) {
+    return Math.floor(Math.random() * top);
+}
+exports.getRandomInt = getRandomInt;
+//# sourceMappingURL=misc-utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"misc-utils.js","sourceRoot":"","sources":["../../../src/utils/misc-utils.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACI,MAAM,KAAK,GAAG,CAAC,EAAU,EAAiB,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAA;AAAxF,QAAA,KAAK,SAAmF;AAErG,SAAgB,YAAY,CAAC,GAAW;IACpC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA;AAC1C,CAAC;AAFD,oCAEC","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 getRandomInt(top: number): number {\n    return Math.floor(Math.random() * top)\n}\n"]}

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

@@ -0,0 +1,35 @@
+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;
+/**
+ * Extract basic peer type from {@link tl.TypePeer} or its marked ID.
+ */
+export declare function getBasicPeerType(peer: tl.TypePeer | number): BasicPeerType;
+/**
+ * Extract bare peer ID from marked ID.
+ *
+ * @param peerId  Marked peer ID
+ */
+export declare function markedPeerIdToBare(peerId: number): 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/cjs/utils/peer-utils.js

@@ -0,0 +1,188 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAllPeersFrom = exports.markedPeerIdToBare = exports.getBasicPeerType = exports.getMarkedPeerId = exports.getBarePeerId = exports.toggleChannelIdMark = void 0;
+const errors_js_1 = require("../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
+ */
+function toggleChannelIdMark(id) {
+    return ZERO_CHANNEL_ID - id;
+}
+exports.toggleChannelIdMark = toggleChannelIdMark;
+/**
+ * Get the bare (non-marked) ID from a {@link tl.TypePeer}
+ */
+function getBarePeerId(peer) {
+    switch (peer._) {
+        case 'peerUser':
+            return peer.userId;
+        case 'peerChat':
+            return peer.chatId;
+        case 'peerChannel':
+            return peer.channelId;
+    }
+}
+exports.getBarePeerId = getBarePeerId;
+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 errors_js_1.MtArgumentError('Invalid peer type');
+    }
+    switch (peer._) {
+        case 'peerUser':
+        case 'inputPeerUser':
+        case 'inputUser':
+            return peer.userId;
+        case 'peerChat':
+        case 'inputPeerChat':
+            return -peer.chatId;
+        case 'peerChannel':
+        case 'inputPeerChannel':
+        case 'inputChannel':
+            return ZERO_CHANNEL_ID - peer.channelId;
+    }
+    throw new errors_js_1.MtArgumentError('Invalid peer');
+}
+exports.getMarkedPeerId = getMarkedPeerId;
+/**
+ * Extract basic peer type from {@link tl.TypePeer} or its marked ID.
+ */
+function getBasicPeerType(peer) {
+    if (typeof peer !== 'number') {
+        switch (peer._) {
+            case 'peerUser':
+                return 'user';
+            case 'peerChat':
+                return 'chat';
+            case 'peerChannel':
+                return 'channel';
+        }
+    }
+    if (peer < 0) {
+        if (MIN_MARKED_CHAT_ID <= peer) {
+            return 'chat';
+        }
+        if (MIN_MARKED_CHANNEL_ID <= peer && peer !== ZERO_CHANNEL_ID) {
+            return 'channel';
+        }
+        if (MAX_SECRET_CHAT_ID <= peer && peer !== ZERO_SECRET_CHAT_ID) {
+            // return 'secret'
+            throw new errors_js_1.MtUnsupportedError('Secret chats are not supported');
+        }
+    }
+    else if (peer > 0 && peer <= MAX_USER_ID) {
+        return 'user';
+    }
+    throw new errors_js_1.MtArgumentError(`Invalid marked peer id: ${peer}`);
+}
+exports.getBasicPeerType = getBasicPeerType;
+/**
+ * Extract bare peer ID from marked ID.
+ *
+ * @param peerId  Marked peer ID
+ */
+function markedPeerIdToBare(peerId) {
+    const type = getBasicPeerType(peerId);
+    switch (type) {
+        case 'user':
+            return peerId;
+        case 'chat':
+            return -peerId;
+        case 'channel':
+            return toggleChannelIdMark(peerId);
+    }
+}
+exports.markedPeerIdToBare = markedPeerIdToBare;
+/**
+ * Extracts all (cacheable) entities from a TlObject or a list of them.
+ * Only checks `.user`, `.chat`, `.channel`, `.users` and `.chats` properties
+ */
+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;
+                }
+            }
+        }
+    }
+}
+exports.getAllPeersFrom = getAllPeersFrom;
+//# sourceMappingURL=peer-utils.js.map