@mtcute/core 0.16.7 → 0.16.9

package/esm/utils/deque.js

@@ -1,218 +0,0 @@
-// ^^ because of performance reasons
-const MIN_INITIAL_CAPACITY = 8;
-// System.arraycopy from java
-function arraycopy(src, srcPos, dest, destPos, length) {
-    for (let i = 0; i < length; i++) {
-        dest[destPos + i] = src[srcPos + i];
-    }
-}
-/**
- * Deque implementation.
- * `undefined` values are not allowed
- *
- * Based on Java implementation
- */
-export class Deque {
-    maxLength;
-    // another implementation variant would be to use
-    // blocks of fixed size instead of a single array
-    // to avoid copying stuff around
-    _elements;
-    _head = 0;
-    _tail = 0;
-    _capacity;
-    constructor(maxLength = Infinity, minCapacity = maxLength === Infinity ? MIN_INITIAL_CAPACITY : maxLength) {
-        this.maxLength = maxLength;
-        let capacity = minCapacity;
-        if (capacity < MIN_INITIAL_CAPACITY) {
-            capacity = MIN_INITIAL_CAPACITY;
-        }
-        if (capacity !== MIN_INITIAL_CAPACITY) {
-            // Find the best power of two to hold elements.
-            capacity |= capacity >>> 1;
-            capacity |= capacity >>> 2;
-            capacity |= capacity >>> 4;
-            capacity |= capacity >>> 8;
-            capacity |= capacity >>> 16;
-            capacity += 1;
-            if (capacity < 0) {
-                // too many
-                capacity >>>= 1;
-            }
-        }
-        this._elements = new Array(capacity);
-        this._capacity = capacity;
-    }
-    _resize() {
-        const p = this._head;
-        const n = this._capacity;
-        const r = n - p; // number of elements to the right of the head
-        const newCapacity = n << 1;
-        if (newCapacity < 0)
-            throw new Error('Deque is too big');
-        const arr = new Array(newCapacity);
-        // copy items to the new array
-        // copy head till the end of arr
-        arraycopy(this._elements, p, arr, 0, r);
-        // copy from start to tail
-        arraycopy(this._elements, 0, arr, r, p);
-        this._elements = arr;
-        this._head = 0;
-        this._tail = n;
-        this._capacity = newCapacity;
-    }
-    pushBack(item) {
-        if (item === undefined)
-            throw new Error('item can not be undefined');
-        this._elements[this._tail] = item;
-        if ((this._tail = (this._tail + 1) & (this._capacity - 1)) === this._head) {
-            this._resize();
-        }
-        if (this.length > this.maxLength) {
-            this.popFront();
-        }
-    }
-    pushFront(item) {
-        if (item === undefined)
-            throw new Error('item can not be undefined');
-        this._elements[(this._head = (this._head - 1) & (this._capacity - 1))] = item;
-        if (this._head === this._tail) {
-            this._resize();
-        }
-        if (this.length > this.maxLength) {
-            this.popBack();
-        }
-    }
-    popFront() {
-        const h = this._head;
-        const res = this._elements[h];
-        if (res === undefined)
-            return undefined;
-        this._elements[h] = undefined;
-        this._head = (h + 1) & (this._capacity - 1);
-        return res;
-    }
-    popBack() {
-        const t = (this._tail - 1) & (this._capacity - 1);
-        const res = this._elements[t];
-        if (res === undefined)
-            return undefined;
-        this._elements[t] = undefined;
-        this._tail = t;
-        return res;
-    }
-    peekFront() {
-        return this._elements[this._head];
-    }
-    peekBack() {
-        return this._elements[(this._tail - 1) & (this._capacity - 1)];
-    }
-    get length() {
-        return (this._tail - this._head) & (this._capacity - 1);
-    }
-    toArray() {
-        const sz = this.length;
-        if (sz === 0)
-            return [];
-        const arr = new Array(sz);
-        if (this._head < this._tail) {
-            // copy as-is, head to tail
-            arraycopy(this._elements, this._head, arr, 0, sz);
-        }
-        else {
-            const headPortion = this._capacity - this._head;
-            // copy from head to end
-            arraycopy(this._elements, this._head, arr, 0, headPortion);
-            // copy from start to tail
-            arraycopy(this._elements, 0, arr, headPortion, this._tail);
-        }
-        return arr;
-    }
-    _delete(i) {
-        const els = this._elements;
-        const mask = this._capacity - 1;
-        const h = this._head;
-        const t = this._tail;
-        const front = (i - h) & mask;
-        const back = (t - i) & mask;
-        if (front < back) {
-            if (h <= i) {
-                arraycopy(els, h, els, h + 1, front);
-            }
-            else {
-                // wrap
-                arraycopy(els, 0, els, 1, i);
-                els[0] = els[mask];
-                arraycopy(els, h, els, h + 1, mask - h);
-            }
-            els[h] = undefined;
-            this._head = (h + 1) & mask;
-        }
-        else if (i < t) {
-            // copy null tail as well
-            arraycopy(els, i + 1, els, i, back);
-            this._tail = t - 1;
-        }
-        else {
-            // wrap
-            arraycopy(els, i + 1, els, i, mask - i);
-            els[mask] = els[0];
-            arraycopy(els, 1, els, 0, t);
-            this._tail = (t - 1) & mask;
-        }
-    }
-    remove(item) {
-        const mask = this._capacity - 1;
-        let i = this._head;
-        let val;
-        while ((val = this._elements[i]) !== undefined) {
-            if (item === val) {
-                this._delete(i);
-                return;
-            }
-            i = (i + 1) & mask;
-        }
-    }
-    removeBy(pred) {
-        const mask = this._capacity - 1;
-        let i = this._head;
-        let val;
-        while ((val = this._elements[i]) !== undefined) {
-            if (pred(val)) {
-                this._delete(i);
-                return;
-            }
-            i = (i + 1) & mask;
-        }
-    }
-    at(idx) {
-        return this._elements[(this._head + idx) & (this._capacity - 1)];
-    }
-    *iter() {
-        const sz = this.length;
-        if (sz === 0)
-            return;
-        if (this._head < this._tail) {
-            // head to tail
-            for (let i = 0; i < sz; i++) {
-                yield this._elements[this._head + i];
-            }
-        }
-        else {
-            const headPortion = this._capacity - this._head;
-            // head to end
-            for (let i = 0; i < headPortion; i++) {
-                yield this._elements[this._head + i];
-            }
-            // start to tail
-            for (let i = 0; i < this._tail; i++) {
-                yield this._elements[i];
-            }
-        }
-    }
-    clear() {
-        this._elements = new Array(this._capacity);
-        this._head = this._tail = 0;
-    }
-}
-//# sourceMappingURL=deque.js.map

package/esm/utils/deque.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../src/utils/deque.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AAE9B,6BAA6B;AAC7B,SAAS,SAAS,CAAI,GAAQ,EAAE,MAAc,EAAE,IAAS,EAAE,OAAe,EAAE,MAAc;IACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,KAAK;IAUD;IATb,iDAAiD;IACjD,iDAAiD;IACjD,gCAAgC;IACtB,SAAS,CAAmB;IAC5B,KAAK,GAAG,CAAC,CAAA;IACT,KAAK,GAAG,CAAC,CAAA;IACT,SAAS,CAAQ;IAE3B,YACa,YAAoB,QAAQ,EACrC,cAAsB,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,SAAS;QADtE,cAAS,GAAT,SAAS,CAAmB;QAGrC,IAAI,QAAQ,GAAG,WAAW,CAAA;QAE1B,IAAI,QAAQ,GAAG,oBAAoB,EAAE,CAAC;YAClC,QAAQ,GAAG,oBAAoB,CAAA;QACnC,CAAC;QACD,IAAI,QAAQ,KAAK,oBAAoB,EAAE,CAAC;YACpC,+CAA+C;YAC/C,QAAQ,IAAI,QAAQ,KAAK,CAAC,CAAA;YAC1B,QAAQ,IAAI,QAAQ,KAAK,CAAC,CAAA;YAC1B,QAAQ,IAAI,QAAQ,KAAK,CAAC,CAAA;YAC1B,QAAQ,IAAI,QAAQ,KAAK,CAAC,CAAA;YAC1B,QAAQ,IAAI,QAAQ,KAAK,EAAE,CAAA;YAC3B,QAAQ,IAAI,CAAC,CAAA;YAEb,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACf,WAAW;gBACX,QAAQ,MAAM,CAAC,CAAA;YACnB,CAAC;QACL,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,IAAI,KAAK,CAAgB,QAAQ,CAAC,CAAA;QACnD,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;IAC7B,CAAC;IAES,OAAO;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;QACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA,CAAC,8CAA8C;QAE9D,MAAM,WAAW,GAAG,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,WAAW,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAA;QAExD,MAAM,GAAG,GAAG,IAAI,KAAK,CAAgB,WAAW,CAAC,CAAA;QAEjD,8BAA8B;QAC9B,gCAAgC;QAChC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QACvC,0BAA0B;QAC1B,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAEvC,IAAI,CAAC,SAAS,GAAG,GAAG,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,SAAS,GAAG,WAAW,CAAA;IAChC,CAAC;IAED,QAAQ,CAAC,IAAO;QACZ,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;QAEpE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAA;QAEjC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACxE,IAAI,CAAC,OAAO,EAAE,CAAA;QAClB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnB,CAAC;IACL,CAAC;IAED,SAAS,CAAC,IAAO;QACb,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;QAEpE,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAE7E,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,EAAE,CAAA;QAClB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,EAAE,CAAA;QAClB,CAAC;IACL,CAAC;IAED,QAAQ;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC7B,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAEvC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;QAE3C,OAAO,GAAG,CAAA;IACd,CAAC;IAED,OAAO;QACH,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC7B,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAEvC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QAEd,OAAO,GAAG,CAAA;IACd,CAAC;IAED,SAAS;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACrC,CAAC;IAED,QAAQ;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAA;IAClE,CAAC;IAED,IAAI,MAAM;QACN,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED,OAAO;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAA;QACtB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,CAAA;QAEvB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAA;QAEzB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1B,2BAA2B;YAC3B,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAA;QACrD,CAAC;aAAM,CAAC;YACJ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;YAE/C,wBAAwB;YACxB,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;YAC1D,0BAA0B;YAC1B,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAC9D,CAAC;QAED,OAAO,GAAU,CAAA;IACrB,CAAC;IAES,OAAO,CAAC,CAAS;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAA;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QAE3B,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACT,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;YACxC,CAAC;iBAAM,CAAC;gBACJ,OAAO;gBACP,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC5B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;gBAClB,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;YAC3C,CAAC;YACD,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;YAClB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QAC/B,CAAC;aAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACf,yBAAyB;YACzB,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;YACnC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,CAAC;aAAM,CAAC;YACJ,OAAO;YACP,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;YACvC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;YAClB,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YAC5B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QAC/B,CAAC;IACL,CAAC;IAED,MAAM,CAAC,IAAO;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QAClB,IAAI,GAAkB,CAAA;QAEtB,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAC7C,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBAEf,OAAM;YACV,CAAC;YACD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QACtB,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAwB;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAA;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QAClB,IAAI,GAAkB,CAAA;QAEtB,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBAEf,OAAM;YACV,CAAC;YACD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QACtB,CAAC;IACL,CAAC;IAED,EAAE,CAAC,GAAW;QACV,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAA;IACpE,CAAC;IAED,CAAC,IAAI;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAA;QACtB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAM;QAEpB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1B,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAA;YACzC,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;YAE/C,cAAc;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAA;YACzC,CAAC;YACD,gBAAgB;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC,CAAE,CAAA;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IAED,KAAK;QACD,IAAI,CAAC,SAAS,GAAG,IAAI,KAAK,CAAgB,IAAI,CAAC,SAAS,CAAC,CAAA;QACzD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;IAC/B,CAAC;CACJ","sourcesContent":["// ^^ because of performance reasons\nconst MIN_INITIAL_CAPACITY = 8\n\n// System.arraycopy from java\nfunction arraycopy<T>(src: T[], srcPos: number, dest: T[], destPos: number, length: number) {\n    for (let i = 0; i < length; i++) {\n        dest[destPos + i] = src[srcPos + i]\n    }\n}\n\n/**\n * Deque implementation.\n * `undefined` values are not allowed\n *\n * Based on Java implementation\n */\nexport class Deque<T> {\n    // another implementation variant would be to use\n    // blocks of fixed size instead of a single array\n    // to avoid copying stuff around\n    protected _elements: (T | undefined)[]\n    protected _head = 0\n    protected _tail = 0\n    protected _capacity: number\n\n    constructor(\n        readonly maxLength: number = Infinity,\n        minCapacity: number = maxLength === Infinity ? MIN_INITIAL_CAPACITY : maxLength,\n    ) {\n        let capacity = minCapacity\n\n        if (capacity < MIN_INITIAL_CAPACITY) {\n            capacity = MIN_INITIAL_CAPACITY\n        }\n        if (capacity !== MIN_INITIAL_CAPACITY) {\n            // Find the best power of two to hold elements.\n            capacity |= capacity >>> 1\n            capacity |= capacity >>> 2\n            capacity |= capacity >>> 4\n            capacity |= capacity >>> 8\n            capacity |= capacity >>> 16\n            capacity += 1\n\n            if (capacity < 0) {\n                // too many\n                capacity >>>= 1\n            }\n        }\n\n        this._elements = new Array<T | undefined>(capacity)\n        this._capacity = capacity\n    }\n\n    protected _resize(): void {\n        const p = this._head\n        const n = this._capacity\n        const r = n - p // number of elements to the right of the head\n\n        const newCapacity = n << 1\n        if (newCapacity < 0) throw new Error('Deque is too big')\n\n        const arr = new Array<T | undefined>(newCapacity)\n\n        // copy items to the new array\n        // copy head till the end of arr\n        arraycopy(this._elements, p, arr, 0, r)\n        // copy from start to tail\n        arraycopy(this._elements, 0, arr, r, p)\n\n        this._elements = arr\n        this._head = 0\n        this._tail = n\n        this._capacity = newCapacity\n    }\n\n    pushBack(item: T): void {\n        if (item === undefined) throw new Error('item can not be undefined')\n\n        this._elements[this._tail] = item\n\n        if ((this._tail = (this._tail + 1) & (this._capacity - 1)) === this._head) {\n            this._resize()\n        }\n\n        if (this.length > this.maxLength) {\n            this.popFront()\n        }\n    }\n\n    pushFront(item: T): void {\n        if (item === undefined) throw new Error('item can not be undefined')\n\n        this._elements[(this._head = (this._head - 1) & (this._capacity - 1))] = item\n\n        if (this._head === this._tail) {\n            this._resize()\n        }\n\n        if (this.length > this.maxLength) {\n            this.popBack()\n        }\n    }\n\n    popFront(): T | undefined {\n        const h = this._head\n        const res = this._elements[h]\n        if (res === undefined) return undefined\n\n        this._elements[h] = undefined\n        this._head = (h + 1) & (this._capacity - 1)\n\n        return res\n    }\n\n    popBack(): T | undefined {\n        const t = (this._tail - 1) & (this._capacity - 1)\n        const res = this._elements[t]\n        if (res === undefined) return undefined\n\n        this._elements[t] = undefined\n        this._tail = t\n\n        return res\n    }\n\n    peekFront(): T | undefined {\n        return this._elements[this._head]\n    }\n\n    peekBack(): T | undefined {\n        return this._elements[(this._tail - 1) & (this._capacity - 1)]\n    }\n\n    get length(): number {\n        return (this._tail - this._head) & (this._capacity - 1)\n    }\n\n    toArray(): T[] {\n        const sz = this.length\n        if (sz === 0) return []\n\n        const arr = new Array(sz)\n\n        if (this._head < this._tail) {\n            // copy as-is, head to tail\n            arraycopy(this._elements, this._head, arr, 0, sz)\n        } else {\n            const headPortion = this._capacity - this._head\n\n            // copy from head to end\n            arraycopy(this._elements, this._head, arr, 0, headPortion)\n            // copy from start to tail\n            arraycopy(this._elements, 0, arr, headPortion, this._tail)\n        }\n\n        return arr as T[]\n    }\n\n    protected _delete(i: number): void {\n        const els = this._elements\n        const mask = this._capacity - 1\n        const h = this._head\n        const t = this._tail\n        const front = (i - h) & mask\n        const back = (t - i) & mask\n\n        if (front < back) {\n            if (h <= i) {\n                arraycopy(els, h, els, h + 1, front)\n            } else {\n                // wrap\n                arraycopy(els, 0, els, 1, i)\n                els[0] = els[mask]\n                arraycopy(els, h, els, h + 1, mask - h)\n            }\n            els[h] = undefined\n            this._head = (h + 1) & mask\n        } else if (i < t) {\n            // copy null tail as well\n            arraycopy(els, i + 1, els, i, back)\n            this._tail = t - 1\n        } else {\n            // wrap\n            arraycopy(els, i + 1, els, i, mask - i)\n            els[mask] = els[0]\n            arraycopy(els, 1, els, 0, t)\n            this._tail = (t - 1) & mask\n        }\n    }\n\n    remove(item: T): void {\n        const mask = this._capacity - 1\n        let i = this._head\n        let val: T | undefined\n\n        while ((val = this._elements[i]) !== undefined) {\n            if (item === val) {\n                this._delete(i)\n\n                return\n            }\n            i = (i + 1) & mask\n        }\n    }\n\n    removeBy(pred: (it: T) => boolean): void {\n        const mask = this._capacity - 1\n        let i = this._head\n        let val: T | undefined\n\n        while ((val = this._elements[i]) !== undefined) {\n            if (pred(val)) {\n                this._delete(i)\n\n                return\n            }\n            i = (i + 1) & mask\n        }\n    }\n\n    at(idx: number): T | undefined {\n        return this._elements[(this._head + idx) & (this._capacity - 1)]\n    }\n\n    *iter(): IterableIterator<T> {\n        const sz = this.length\n        if (sz === 0) return\n\n        if (this._head < this._tail) {\n            // head to tail\n            for (let i = 0; i < sz; i++) {\n                yield this._elements[this._head + i]!\n            }\n        } else {\n            const headPortion = this._capacity - this._head\n\n            // head to end\n            for (let i = 0; i < headPortion; i++) {\n                yield this._elements[this._head + i]!\n            }\n            // start to tail\n            for (let i = 0; i < this._tail; i++) {\n                yield this._elements[i]!\n            }\n        }\n    }\n\n    clear(): void {\n        this._elements = new Array<T | undefined>(this._capacity)\n        this._head = this._tail = 0\n    }\n}\n"]}

package/esm/utils/early-timer.d.ts

@@ -1,42 +0,0 @@
-/**
- * Wrapper over JS timers that allows re-scheduling them
- * to earlier time
- */
-export declare class EarlyTimer {
-    private _timeout?;
-    private _immediate?;
-    private _timeoutTs?;
-    private _handler;
-    constructor();
-    /**
-     * Emit the timer when the event loop is idle
-     * (basically `setImmediate()`)
-     */
-    emitWhenIdle(): void;
-    /**
-     * Emit the timer before the next given milliseconds
-     *
-     * Shorthand for `emitBefore(Date.now() + ms)`
-     *
-     * @param ms  Milliseconds to schedule for
-     */
-    emitBeforeNext(ms: number): void;
-    /**
-     * Emit the timer before the given time
-     *
-     * @param ts  Unix time in MS
-     */
-    emitBefore(ts: number): void;
-    /**
-     * Emit the timer right now
-     */
-    emitNow(): void;
-    /**
-     * Cancel the timer
-     */
-    reset(): void;
-    /**
-     * Set timeout handler
-     */
-    onTimeout(handler: () => void): void;
-}

package/esm/utils/early-timer.js

@@ -1,78 +0,0 @@
-/**
- * Wrapper over JS timers that allows re-scheduling them
- * to earlier time
- */
-export class EarlyTimer {
-    _timeout;
-    _immediate;
-    _timeoutTs;
-    _handler = () => { };
-    constructor() {
-        this.emitNow = this.emitNow.bind(this);
-    }
-    /**
-     * Emit the timer when the event loop is idle
-     * (basically `setImmediate()`)
-     */
-    emitWhenIdle() {
-        if (this._immediate)
-            return;
-        clearTimeout(this._timeout);
-        this._timeoutTs = Date.now();
-        if (typeof setImmediate !== 'undefined') {
-            this._immediate = setImmediate(this.emitNow);
-        }
-        else {
-            this._timeout = setTimeout(this.emitNow, 0);
-        }
-    }
-    /**
-     * Emit the timer before the next given milliseconds
-     *
-     * Shorthand for `emitBefore(Date.now() + ms)`
-     *
-     * @param ms  Milliseconds to schedule for
-     */
-    emitBeforeNext(ms) {
-        return this.emitBefore(Date.now() + ms);
-    }
-    /**
-     * Emit the timer before the given time
-     *
-     * @param ts  Unix time in MS
-     */
-    emitBefore(ts) {
-        if (!this._timeoutTs || ts < this._timeoutTs) {
-            this.reset();
-            this._timeout = setTimeout(this.emitNow, ts - Date.now());
-            this._timeoutTs = ts;
-        }
-    }
-    /**
-     * Emit the timer right now
-     */
-    emitNow() {
-        this.reset();
-        this._handler();
-    }
-    /**
-     * Cancel the timer
-     */
-    reset() {
-        if (this._immediate) {
-            clearImmediate(this._immediate);
-            this._immediate = undefined;
-        }
-        else {
-            clearTimeout(this._timeout);
-        }
-        this._timeoutTs = undefined;
-    }
-    /**
-     * Set timeout handler
-     */
-    onTimeout(handler) {
-        this._handler = handler;
-    }
-}
-//# sourceMappingURL=early-timer.js.map

package/esm/utils/early-timer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"early-timer.js","sourceRoot":"","sources":["../../../src/utils/early-timer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,UAAU;IACX,QAAQ,CAAiB;IACzB,UAAU,CAAmB;IAC7B,UAAU,CAAS;IAEnB,QAAQ,GAAe,GAAG,EAAE,GAAE,CAAC,CAAA;IAEvC;QACI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IAED;;;OAGG;IACH,YAAY;QACR,IAAI,IAAI,CAAC,UAAU;YAAE,OAAM;QAE3B,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAE5B,IAAI,OAAO,YAAY,KAAK,WAAW,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAChD,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QAC/C,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,EAAU;QACrB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IAC3C,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,EAAU;QACjB,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,IAAI,CAAC,KAAK,EAAE,CAAA;YACZ,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;YACzD,IAAI,CAAC,UAAU,GAAG,EAAE,CAAA;QACxB,CAAC;IACL,CAAC;IAED;;OAEG;IACH,OAAO;QACH,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,IAAI,CAAC,QAAQ,EAAE,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YAC/B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAA;QAC/B,CAAC;aAAM,CAAC;YACJ,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC/B,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAA;IAC/B,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAmB;QACzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;IAC3B,CAAC;CACJ","sourcesContent":["/**\n * Wrapper over JS timers that allows re-scheduling them\n * to earlier time\n */\nexport class EarlyTimer {\n    private _timeout?: NodeJS.Timeout\n    private _immediate?: NodeJS.Immediate\n    private _timeoutTs?: number\n\n    private _handler: () => void = () => {}\n\n    constructor() {\n        this.emitNow = this.emitNow.bind(this)\n    }\n\n    /**\n     * Emit the timer when the event loop is idle\n     * (basically `setImmediate()`)\n     */\n    emitWhenIdle(): void {\n        if (this._immediate) return\n\n        clearTimeout(this._timeout)\n        this._timeoutTs = Date.now()\n\n        if (typeof setImmediate !== 'undefined') {\n            this._immediate = setImmediate(this.emitNow)\n        } else {\n            this._timeout = setTimeout(this.emitNow, 0)\n        }\n    }\n\n    /**\n     * Emit the timer before the next given milliseconds\n     *\n     * Shorthand for `emitBefore(Date.now() + ms)`\n     *\n     * @param ms  Milliseconds to schedule for\n     */\n    emitBeforeNext(ms: number): void {\n        return this.emitBefore(Date.now() + ms)\n    }\n\n    /**\n     * Emit the timer before the given time\n     *\n     * @param ts  Unix time in MS\n     */\n    emitBefore(ts: number): void {\n        if (!this._timeoutTs || ts < this._timeoutTs) {\n            this.reset()\n            this._timeout = setTimeout(this.emitNow, ts - Date.now())\n            this._timeoutTs = ts\n        }\n    }\n\n    /**\n     * Emit the timer right now\n     */\n    emitNow(): void {\n        this.reset()\n        this._handler()\n    }\n\n    /**\n     * Cancel the timer\n     */\n    reset(): void {\n        if (this._immediate) {\n            clearImmediate(this._immediate)\n            this._immediate = undefined\n        } else {\n            clearTimeout(this._timeout)\n        }\n        this._timeoutTs = undefined\n    }\n\n    /**\n     * Set timeout handler\n     */\n    onTimeout(handler: () => void): void {\n        this._handler = handler\n    }\n}\n"]}

package/esm/utils/error-reporting.d.ts

@@ -1,3 +0,0 @@
-import type { tl } from '@mtcute/tl';
-import type { Logger } from './logger.js';
-export declare function reportUnknownError(log: Logger, error: tl.RpcError, method: string): void;

package/esm/utils/error-reporting.js

@@ -1,18 +0,0 @@
-export function reportUnknownError(log, error, method) {
-    if (typeof fetch !== 'function')
-        return;
-    fetch(`https://rpc.pwrtelegram.xyz/?code=${error.code}&method=${method}&error=${error.text}`)
-        .then(r => r.json())
-        .then((r) => {
-        if (r.ok) {
-            log.info('telerpc responded with error info for %s: %s', error.text, r.result);
-        }
-        else {
-            log.info('Reported error %s to telerpc. You can disable this using `enableErrorReporting: false`', error.text);
-        }
-    })
-        .catch((e) => {
-        log.debug('failed to report error %s to telerpc: %e', error.text, e);
-    });
-}
-//# sourceMappingURL=error-reporting.js.map

package/esm/utils/error-reporting.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"error-reporting.js","sourceRoot":"","sources":["../../../src/utils/error-reporting.ts"],"names":[],"mappings":"AAIA,MAAM,UAAU,kBAAkB,CAAC,GAAW,EAAE,KAAkB,EAAE,MAAc;IAC9E,IAAI,OAAO,KAAK,KAAK,UAAU;QAAE,OAAM;IAEvC,KAAK,CAAC,qCAAqC,KAAK,CAAC,IAAI,WAAW,MAAM,UAAU,KAAK,CAAC,IAAI,EAAE,CAAC;SACxF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACnB,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACR,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;YACP,GAAG,CAAC,IAAI,CAAC,8CAA8C,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;QAClF,CAAC;aAAM,CAAC;YACJ,GAAG,CAAC,IAAI,CACJ,wFAAwF,EACxF,KAAK,CAAC,IAAI,CACb,CAAA;QACL,CAAC;IACL,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,GAAG,CAAC,KAAK,CAAC,0CAA0C,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACxE,CAAC,CAAC,CAAA;AACV,CAAC","sourcesContent":["import type { tl } from '@mtcute/tl'\n\nimport type { Logger } from './logger.js'\n\nexport function reportUnknownError(log: Logger, error: tl.RpcError, method: string): void {\n    if (typeof fetch !== 'function') return\n\n    fetch(`https://rpc.pwrtelegram.xyz/?code=${error.code}&method=${method}&error=${error.text}`)\n        .then(r => r.json())\n        .then((r) => {\n            if (r.ok) {\n                log.info('telerpc responded with error info for %s: %s', error.text, r.result)\n            } else {\n                log.info(\n                    'Reported error %s to telerpc. You can disable this using `enableErrorReporting: false`',\n                    error.text,\n                )\n            }\n        })\n        .catch((e) => {\n            log.debug('failed to report error %s to telerpc: %e', error.text, e)\n        })\n}\n"]}

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

@@ -1,22 +0,0 @@
-export type ThrottledFunction = (() => void) & {
-    reset: () => void;
-};
-/**
- * Throttle a function with a given delay.
- * Similar to lodash.
- *
- * Throttling `F` for a delay of `D` means that
- * `F` will be called no more than 1 time every `D`.
- * In this implementation, `F` is called after `D`
- * has passed since the previous non-throttled invocation
- *
- * @param func  Function to throttle
- * @param delay  Throttle delay
- */
-export declare function throttle(func: () => void, delay: number): ThrottledFunction;
-export declare function asyncResettable<T extends (...args: any[]) => Promise<any>>(func: T): {
-    run: T;
-    finished: () => boolean;
-    wait: () => Promise<any> | null;
-    reset: () => void;
-};

package/esm/utils/function-utils.js

@@ -1,59 +0,0 @@
-/**
- * Throttle a function with a given delay.
- * Similar to lodash.
- *
- * Throttling `F` for a delay of `D` means that
- * `F` will be called no more than 1 time every `D`.
- * In this implementation, `F` is called after `D`
- * has passed since the previous non-throttled invocation
- *
- * @param func  Function to throttle
- * @param delay  Throttle delay
- */
-export function throttle(func, delay) {
-    let timeout;
-    const res = function () {
-        if (timeout) {
-            return;
-        }
-        const later = () => {
-            timeout = null;
-            func();
-        };
-        timeout = setTimeout(later, delay);
-    };
-    res.reset = () => {
-        if (timeout) {
-            clearTimeout(timeout);
-            timeout = null;
-        }
-    };
-    return res;
-}
-export function asyncResettable(func) {
-    let runningPromise = null;
-    let finished = false;
-    const run = function (...args) {
-        if (finished)
-            return Promise.resolve();
-        if (runningPromise) {
-            return runningPromise;
-        }
-        // eslint-disable-next-line ts/no-unsafe-argument
-        runningPromise = func(...args);
-        void runningPromise.then(() => {
-            runningPromise = null;
-            finished = true;
-        });
-        return runningPromise;
-    };
-    return {
-        run,
-        finished: () => finished,
-        wait: () => runningPromise,
-        reset: () => {
-            finished = false;
-        },
-    };
-}
-//# sourceMappingURL=function-utils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"function-utils.js","sourceRoot":"","sources":["../../../src/utils/function-utils.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAgB,EAAE,KAAa;IACpD,IAAI,OAA8B,CAAA;IAElC,MAAM,GAAG,GAAsB;QAC3B,IAAI,OAAO,EAAE,CAAC;YACV,OAAM;QACV,CAAC;QAED,MAAM,KAAK,GAAG,GAAG,EAAE;YACf,OAAO,GAAG,IAAI,CAAA;YACd,IAAI,EAAE,CAAA;QACV,CAAC,CAAA;QACD,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IACtC,CAAC,CAAA;IAED,GAAG,CAAC,KAAK,GAAG,GAAG,EAAE;QACb,IAAI,OAAO,EAAE,CAAC;YACV,YAAY,CAAC,OAAO,CAAC,CAAA;YACrB,OAAO,GAAG,IAAI,CAAA;QAClB,CAAC;IACL,CAAC,CAAA;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAED,MAAM,UAAU,eAAe,CAA4C,IAAO;IAM9E,IAAI,cAAc,GAAwB,IAAI,CAAA;IAC9C,IAAI,QAAQ,GAAG,KAAK,CAAA;IAEpB,MAAM,GAAG,GAAG,UAAU,GAAG,IAAW;QAChC,IAAI,QAAQ;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAA;QAEtC,IAAI,cAAc,EAAE,CAAC;YACjB,OAAO,cAAc,CAAA;QACzB,CAAC;QAED,iDAAiD;QACjD,cAAc,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;QAC9B,KAAK,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE;YAC1B,cAAc,GAAG,IAAI,CAAA;YACrB,QAAQ,GAAG,IAAI,CAAA;QACnB,CAAC,CAAC,CAAA;QAEF,OAAO,cAAc,CAAA;IACzB,CAAM,CAAA;IAEN,OAAO;QACH,GAAG;QACH,QAAQ,EAAE,GAAG,EAAE,CAAC,QAAQ;QACxB,IAAI,EAAE,GAAG,EAAE,CAAC,cAAc;QAC1B,KAAK,EAAE,GAAG,EAAE;YACR,QAAQ,GAAG,KAAK,CAAA;QACpB,CAAC;KACJ,CAAA;AACL,CAAC","sourcesContent":["export type ThrottledFunction = (() => void) & {\n    reset: () => void\n}\n\n/**\n * Throttle a function with a given delay.\n * Similar to lodash.\n *\n * Throttling `F` for a delay of `D` means that\n * `F` will be called no more than 1 time every `D`.\n * In this implementation, `F` is called after `D`\n * has passed since the previous non-throttled invocation\n *\n * @param func  Function to throttle\n * @param delay  Throttle delay\n */\nexport function throttle(func: () => void, delay: number): ThrottledFunction {\n    let timeout: NodeJS.Timeout | null\n\n    const res: ThrottledFunction = function () {\n        if (timeout) {\n            return\n        }\n\n        const later = () => {\n            timeout = null\n            func()\n        }\n        timeout = setTimeout(later, delay)\n    }\n\n    res.reset = () => {\n        if (timeout) {\n            clearTimeout(timeout)\n            timeout = null\n        }\n    }\n\n    return res\n}\n\nexport function asyncResettable<T extends(...args: any[]) => Promise<any>>(func: T): {\n    run: T\n    finished: () => boolean\n    wait: () => Promise<any> | null\n    reset: () => void\n} {\n    let runningPromise: Promise<any> | null = null\n    let finished = false\n\n    const run = function (...args: any[]) {\n        if (finished) return Promise.resolve()\n\n        if (runningPromise) {\n            return runningPromise\n        }\n\n        // eslint-disable-next-line ts/no-unsafe-argument\n        runningPromise = func(...args)\n        void runningPromise.then(() => {\n            runningPromise = null\n            finished = true\n        })\n\n        return runningPromise\n    } as T\n\n    return {\n        run,\n        finished: () => finished,\n        wait: () => runningPromise,\n        reset: () => {\n            finished = false\n        },\n    }\n}\n"]}

package/esm/utils/index.d.ts

@@ -1,28 +0,0 @@
-export * from '../highlevel/utils/index.js';
-export * from '../highlevel/storage/service/current-user.js';
-export * from '../highlevel/storage/service/updates.js';
-export * from '../storage/service/base.js';
-export * from '../storage/service/default-dcs.js';
-export * from './async-lock.js';
-export * from './bigint-utils.js';
-export * from './buffer-utils.js';
-export * from './composer.js';
-export * from './condition-variable.js';
-export * from './controllable-promise.js';
-export * from './crypto/index.js';
-export * from './dcs.js';
-export * from './deque.js';
-export * from './early-timer.js';
-export * from './function-utils.js';
-export * from './linked-list.js';
-export * from './links/index.js';
-export * from './logger.js';
-export * from './long-utils.js';
-export * from './lru-map.js';
-export * from './lru-set.js';
-export * from './misc-utils.js';
-export * from './peer-utils.js';
-export * from './sorted-array.js';
-export * from './tl-json.js';
-export * from './type-assertions.js';
-export * from '@mtcute/tl-runtime';

package/esm/utils/index.js

@@ -1,31 +0,0 @@
-export * from '../highlevel/utils/index.js';
-// todo: remove after 1.0.0
-export * from '../highlevel/storage/service/current-user.js';
-export * from '../highlevel/storage/service/updates.js';
-export * from '../storage/service/base.js';
-export * from '../storage/service/default-dcs.js';
-// end todo
-export * from './async-lock.js';
-export * from './bigint-utils.js';
-export * from './buffer-utils.js';
-export * from './composer.js';
-export * from './condition-variable.js';
-export * from './controllable-promise.js';
-export * from './crypto/index.js';
-export * from './dcs.js';
-export * from './deque.js';
-export * from './early-timer.js';
-export * from './function-utils.js';
-export * from './linked-list.js';
-export * from './links/index.js';
-export * from './logger.js';
-export * from './long-utils.js';
-export * from './lru-map.js';
-export * from './lru-set.js';
-export * from './misc-utils.js';
-export * from './peer-utils.js';
-export * from './sorted-array.js';
-export * from './tl-json.js';
-export * from './type-assertions.js';
-export * from '@mtcute/tl-runtime';
-//# sourceMappingURL=index.js.map

package/esm/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAA;AAC3C,2BAA2B;AAC3B,cAAc,8CAA8C,CAAA;AAC5D,cAAc,yCAAyC,CAAA;AACvD,cAAc,4BAA4B,CAAA;AAC1C,cAAc,mCAAmC,CAAA;AACjD,WAAW;AACX,cAAc,iBAAiB,CAAA;AAC/B,cAAc,mBAAmB,CAAA;AACjC,cAAc,mBAAmB,CAAA;AACjC,cAAc,eAAe,CAAA;AAC7B,cAAc,yBAAyB,CAAA;AACvC,cAAc,2BAA2B,CAAA;AACzC,cAAc,mBAAmB,CAAA;AACjC,cAAc,UAAU,CAAA;AACxB,cAAc,YAAY,CAAA;AAC1B,cAAc,kBAAkB,CAAA;AAChC,cAAc,qBAAqB,CAAA;AACnC,cAAc,kBAAkB,CAAA;AAChC,cAAc,kBAAkB,CAAA;AAChC,cAAc,aAAa,CAAA;AAC3B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,cAAc,CAAA;AAC5B,cAAc,cAAc,CAAA;AAC5B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,mBAAmB,CAAA;AACjC,cAAc,cAAc,CAAA;AAC5B,cAAc,sBAAsB,CAAA;AACpC,cAAc,oBAAoB,CAAA","sourcesContent":["export * from '../highlevel/utils/index.js'\n// todo: remove after 1.0.0\nexport * from '../highlevel/storage/service/current-user.js'\nexport * from '../highlevel/storage/service/updates.js'\nexport * from '../storage/service/base.js'\nexport * from '../storage/service/default-dcs.js'\n// end todo\nexport * from './async-lock.js'\nexport * from './bigint-utils.js'\nexport * from './buffer-utils.js'\nexport * from './composer.js'\nexport * from './condition-variable.js'\nexport * from './controllable-promise.js'\nexport * from './crypto/index.js'\nexport * from './dcs.js'\nexport * from './deque.js'\nexport * from './early-timer.js'\nexport * from './function-utils.js'\nexport * from './linked-list.js'\nexport * from './links/index.js'\nexport * from './logger.js'\nexport * from './long-utils.js'\nexport * from './lru-map.js'\nexport * from './lru-set.js'\nexport * from './misc-utils.js'\nexport * from './peer-utils.js'\nexport * from './sorted-array.js'\nexport * from './tl-json.js'\nexport * from './type-assertions.js'\nexport * from '@mtcute/tl-runtime'\n"]}

package/esm/utils/linked-list.d.ts

@@ -1,21 +0,0 @@
-interface LinkedListItem<T> {
-    v: T;
-    n?: LinkedListItem<T>;
-    p?: LinkedListItem<T>;
-}
-/**
- * A sorted linked list.
- */
-export declare class SortedLinkedList<T> {
-    private comparator;
-    _first?: LinkedListItem<T>;
-    _last?: LinkedListItem<T>;
-    _size: number;
-    constructor(comparator: (a: T, b: T) => number);
-    get length(): number;
-    _remove(item: LinkedListItem<T>): void;
-    popFront(): T | undefined;
-    add(item: T): void;
-    clear(): void;
-}
-export {};

package/esm/utils/linked-list.js

@@ -1,72 +0,0 @@
-/**
- * A sorted linked list.
- */
-export class SortedLinkedList {
-    comparator;
-    _first;
-    _last;
-    _size = 0;
-    constructor(comparator) {
-        this.comparator = comparator;
-    }
-    get length() {
-        return this._size;
-    }
-    _remove(item) {
-        if (this._first === item) {
-            this._first = item.n;
-        }
-        if (this._last === item) {
-            this._last = item.p;
-        }
-        if (item.p)
-            item.p.n = item.n;
-        if (item.n)
-            item.n.p = item.p;
-        this._size -= 1;
-    }
-    popFront() {
-        if (!this._first)
-            return undefined;
-        const it = this._first;
-        this._first = this._first.n;
-        if (!this._first)
-            this._last = undefined;
-        this._size -= 1;
-        return it.v;
-    }
-    add(item) {
-        const it = { v: item };
-        if (!this._first) {
-            this._first = this._last = it;
-        }
-        else {
-            let cur = this._first;
-            while (cur && this.comparator(cur.v, it.v) < 0) {
-                cur = cur.n;
-            }
-            if (!cur) {
-                // reached end, the item should be new last
-                this._last.n = it;
-                it.p = this._last;
-                this._last = it;
-            }
-            else {
-                // `cur` is the first item greater or equal than the given
-                it.n = cur;
-                it.p = cur.p;
-                if (cur.p)
-                    cur.p.n = it;
-                cur.p = it;
-                if (cur === this._first)
-                    this._first = it;
-            }
-        }
-        this._size += 1;
-    }
-    clear() {
-        this._first = this._last = undefined;
-        this._size = 0;
-    }
-}
-//# sourceMappingURL=linked-list.js.map