@mtcute/core 0.1.0 → 0.1.2

package/esm/utils/long-utils.test.js

@@ -0,0 +1,153 @@
+import Long from 'long';
+import { describe, expect, it } from 'vitest';
+import { longFromBuffer, longFromFastString, LongMap, LongSet, longToFastString, randomLong, removeFromLongArray, } from './long-utils.js';
+describe('randomLong', () => {
+    it('should return a random Long', () => {
+        const long = randomLong();
+        const long2 = randomLong();
+        expect(long).toBeInstanceOf(Long);
+        expect(long.eq(long2)).toBeFalsy();
+    });
+});
+describe('longFromBuffer', () => {
+    it('should correctly read LE longs', () => {
+        expect(longFromBuffer(new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0]))).toEqual(Long.fromInt(0));
+        expect(longFromBuffer(new Uint8Array([1, 2, 3, 4, 5, 6, 7, 8]))).toEqual(Long.fromBits(0x04030201, 0x08070605));
+    });
+    it('should correctly read BE longs', () => {
+        expect(longFromBuffer(new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0]), false, false)).toEqual(Long.fromInt(0));
+        expect(longFromBuffer(new Uint8Array([8, 7, 6, 5, 4, 3, 2, 1]), false, false)).toEqual(Long.fromBits(0x04030201, 0x08070605));
+    });
+});
+describe('removeFromLongArray', () => {
+    it('should remove a Long from an array', () => {
+        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)];
+        expect(removeFromLongArray(arr, Long.fromInt(2))).toBeTruthy();
+        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(3)]);
+    });
+    it('should return false if the Long was not found', () => {
+        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)];
+        expect(removeFromLongArray(arr, Long.fromInt(4))).toBeFalsy();
+        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)]);
+    });
+    it('should only remove one matching element', () => {
+        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(2), Long.fromInt(3)];
+        expect(removeFromLongArray(arr, Long.fromInt(2))).toBeTruthy();
+        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)]);
+    });
+});
+describe('longToFastString', () => {
+    it('should correctly serialize a Long', () => {
+        expect(longToFastString(Long.fromInt(0))).toEqual('0|0');
+        expect(longToFastString(Long.fromBits(123, 456))).toEqual('123|456');
+    });
+    it('should work with negative numbers', () => {
+        expect(longToFastString(Long.fromInt(-1))).toEqual('-1|-1');
+        expect(longToFastString(Long.fromBits(-123, -456))).toEqual('-123|-456');
+    });
+});
+describe('longFromFastString', () => {
+    it('should correctly deserialize a Long', () => {
+        expect(longFromFastString('0|0')).toEqual(Long.fromInt(0));
+        expect(longFromFastString('123|456')).toEqual(Long.fromBits(123, 456));
+    });
+    it('should work with negative numbers', () => {
+        expect(longFromFastString('-1|-1')).toEqual(Long.fromInt(-1));
+        expect(longFromFastString('-123|-456')).toEqual(Long.fromBits(-123, -456));
+    });
+    it('should throw on invalid strings', () => {
+        expect(() => longFromFastString('0')).toThrow();
+        expect(() => longFromFastString('0|0|0')).toThrow();
+        expect(() => longFromFastString('abc|def')).toThrow();
+    });
+});
+describe('LongMap', () => {
+    it('should set and get values', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        expect(map.get(Long.fromInt(123))).toEqual('test');
+    });
+    it('should return undefined for non-existing keys', () => {
+        const map = new LongMap();
+        expect(map.get(Long.fromInt(123))).toEqual(undefined);
+    });
+    it('should check for existing keys', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        expect(map.has(Long.fromInt(123))).toBeTruthy();
+        expect(map.has(Long.fromInt(456))).toBeFalsy();
+    });
+    it('should delete keys', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        map.delete(Long.fromInt(123));
+        expect(map.has(Long.fromInt(123))).toBeFalsy();
+    });
+    it('should iterate over keys', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        map.set(Long.fromInt(456), 'test2');
+        expect([...map.keys()]).toEqual([Long.fromInt(123), Long.fromInt(456)]);
+    });
+    it('should iterate over values', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        map.set(Long.fromInt(456), 'test2');
+        expect([...map.values()]).toEqual(['test', 'test2']);
+    });
+    it('should clear', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        map.set(Long.fromInt(456), 'test2');
+        map.clear();
+        expect(map.has(Long.fromInt(123))).toBeFalsy();
+        expect(map.has(Long.fromInt(456))).toBeFalsy();
+    });
+    it('should return the size', () => {
+        const map = new LongMap();
+        map.set(Long.fromInt(123), 'test');
+        map.set(Long.fromInt(456), 'test2');
+        expect(map.size()).toEqual(2);
+    });
+});
+describe('LongSet', () => {
+    it('should add and check for values', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        expect(set.has(Long.fromInt(123))).toBeTruthy();
+    });
+    it('should remove values', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        set.add(Long.fromInt(456));
+        set.delete(Long.fromInt(123));
+        expect(set.has(Long.fromInt(123))).toBeFalsy();
+    });
+    it('should return the size', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        set.add(Long.fromInt(456));
+        expect(set.size).toEqual(2);
+    });
+    it('should clear', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        set.add(Long.fromInt(456));
+        set.clear();
+        expect(set.has(Long.fromInt(123))).toBeFalsy();
+        expect(set.has(Long.fromInt(456))).toBeFalsy();
+    });
+    it('should return the size', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        set.add(Long.fromInt(456));
+        expect(set.size).toEqual(2);
+    });
+    it('should convert to array', () => {
+        const set = new LongSet();
+        set.add(Long.fromInt(123));
+        set.add(Long.fromInt(456));
+        expect(set.toArray()).toEqual([Long.fromInt(123), Long.fromInt(456)]);
+    });
+});
+//# sourceMappingURL=long-utils.test.js.map

package/esm/utils/long-utils.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"long-utils.test.js","sourceRoot":"","sources":["../../../src/utils/long-utils.test.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,MAAM,CAAA;AACvB,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAE7C,OAAO,EACH,cAAc,EACd,kBAAkB,EAClB,OAAO,EACP,OAAO,EACP,gBAAgB,EAChB,UAAU,EACV,mBAAmB,GACtB,MAAM,iBAAiB,CAAA;AAExB,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IACxB,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,UAAU,EAAE,CAAA;QACzB,MAAM,KAAK,GAAG,UAAU,EAAE,CAAA;QAE1B,MAAM,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IACtC,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACzF,MAAM,CAAC,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAA;IACnH,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACvG,MAAM,CAAC,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAClF,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CACxC,CAAA;IACL,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAE/D,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;QAC9D,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3D,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAE/D,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5E,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAC/C,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAEhF,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;QAC9D,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5E,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACxD,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IACxE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAC3D,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC5E,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1D,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;IAC1E,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7D,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;IAC9E,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;QAC/C,MAAM,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;QACnD,MAAM,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;IACzD,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACrB,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACjC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAElC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IACtD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAElC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;QAC/C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC1B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAClC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAChC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAClC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;QAEnC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC3E,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAClC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAClC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;QAEnC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IACxD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACpB,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAClC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;QAEnC,GAAG,CAAC,KAAK,EAAE,CAAA;QAEX,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC9C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAU,CAAA;QAEjC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;QAClC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;QAEnC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACrB,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;IACnD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC5B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACpB,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1B,GAAG,CAAC,KAAK,EAAE,CAAA;QAEX,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QAC9C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAC/B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAA;QAEzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAE1B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import Long from 'long'\nimport { describe, expect, it } from 'vitest'\n\nimport {\n    longFromBuffer,\n    longFromFastString,\n    LongMap,\n    LongSet,\n    longToFastString,\n    randomLong,\n    removeFromLongArray,\n} from './long-utils.js'\n\ndescribe('randomLong', () => {\n    it('should return a random Long', () => {\n        const long = randomLong()\n        const long2 = randomLong()\n\n        expect(long).toBeInstanceOf(Long)\n        expect(long.eq(long2)).toBeFalsy()\n    })\n})\n\ndescribe('longFromBuffer', () => {\n    it('should correctly read LE longs', () => {\n        expect(longFromBuffer(new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0]))).toEqual(Long.fromInt(0))\n        expect(longFromBuffer(new Uint8Array([1, 2, 3, 4, 5, 6, 7, 8]))).toEqual(Long.fromBits(0x04030201, 0x08070605))\n    })\n\n    it('should correctly read BE longs', () => {\n        expect(longFromBuffer(new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0]), false, false)).toEqual(Long.fromInt(0))\n        expect(longFromBuffer(new Uint8Array([8, 7, 6, 5, 4, 3, 2, 1]), false, false)).toEqual(\n            Long.fromBits(0x04030201, 0x08070605),\n        )\n    })\n})\n\ndescribe('removeFromLongArray', () => {\n    it('should remove a Long from an array', () => {\n        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)]\n\n        expect(removeFromLongArray(arr, Long.fromInt(2))).toBeTruthy()\n        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(3)])\n    })\n\n    it('should return false if the Long was not found', () => {\n        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)]\n\n        expect(removeFromLongArray(arr, Long.fromInt(4))).toBeFalsy()\n        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)])\n    })\n\n    it('should only remove one matching element', () => {\n        const arr = [Long.fromInt(1), Long.fromInt(2), Long.fromInt(2), Long.fromInt(3)]\n\n        expect(removeFromLongArray(arr, Long.fromInt(2))).toBeTruthy()\n        expect(arr).toEqual([Long.fromInt(1), Long.fromInt(2), Long.fromInt(3)])\n    })\n})\n\ndescribe('longToFastString', () => {\n    it('should correctly serialize a Long', () => {\n        expect(longToFastString(Long.fromInt(0))).toEqual('0|0')\n        expect(longToFastString(Long.fromBits(123, 456))).toEqual('123|456')\n    })\n\n    it('should work with negative numbers', () => {\n        expect(longToFastString(Long.fromInt(-1))).toEqual('-1|-1')\n        expect(longToFastString(Long.fromBits(-123, -456))).toEqual('-123|-456')\n    })\n})\n\ndescribe('longFromFastString', () => {\n    it('should correctly deserialize a Long', () => {\n        expect(longFromFastString('0|0')).toEqual(Long.fromInt(0))\n        expect(longFromFastString('123|456')).toEqual(Long.fromBits(123, 456))\n    })\n\n    it('should work with negative numbers', () => {\n        expect(longFromFastString('-1|-1')).toEqual(Long.fromInt(-1))\n        expect(longFromFastString('-123|-456')).toEqual(Long.fromBits(-123, -456))\n    })\n\n    it('should throw on invalid strings', () => {\n        expect(() => longFromFastString('0')).toThrow()\n        expect(() => longFromFastString('0|0|0')).toThrow()\n        expect(() => longFromFastString('abc|def')).toThrow()\n    })\n})\n\ndescribe('LongMap', () => {\n    it('should set and get values', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n\n        expect(map.get(Long.fromInt(123))).toEqual('test')\n    })\n\n    it('should return undefined for non-existing keys', () => {\n        const map = new LongMap<string>()\n\n        expect(map.get(Long.fromInt(123))).toEqual(undefined)\n    })\n\n    it('should check for existing keys', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n\n        expect(map.has(Long.fromInt(123))).toBeTruthy()\n        expect(map.has(Long.fromInt(456))).toBeFalsy()\n    })\n\n    it('should delete keys', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n        map.delete(Long.fromInt(123))\n\n        expect(map.has(Long.fromInt(123))).toBeFalsy()\n    })\n\n    it('should iterate over keys', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n        map.set(Long.fromInt(456), 'test2')\n\n        expect([...map.keys()]).toEqual([Long.fromInt(123), Long.fromInt(456)])\n    })\n\n    it('should iterate over values', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n        map.set(Long.fromInt(456), 'test2')\n\n        expect([...map.values()]).toEqual(['test', 'test2'])\n    })\n\n    it('should clear', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n        map.set(Long.fromInt(456), 'test2')\n\n        map.clear()\n\n        expect(map.has(Long.fromInt(123))).toBeFalsy()\n        expect(map.has(Long.fromInt(456))).toBeFalsy()\n    })\n\n    it('should return the size', () => {\n        const map = new LongMap<string>()\n\n        map.set(Long.fromInt(123), 'test')\n        map.set(Long.fromInt(456), 'test2')\n\n        expect(map.size()).toEqual(2)\n    })\n})\n\ndescribe('LongSet', () => {\n    it('should add and check for values', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n\n        expect(set.has(Long.fromInt(123))).toBeTruthy()\n    })\n\n    it('should remove values', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n        set.add(Long.fromInt(456))\n        set.delete(Long.fromInt(123))\n\n        expect(set.has(Long.fromInt(123))).toBeFalsy()\n    })\n\n    it('should return the size', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n        set.add(Long.fromInt(456))\n\n        expect(set.size).toEqual(2)\n    })\n\n    it('should clear', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n        set.add(Long.fromInt(456))\n\n        set.clear()\n\n        expect(set.has(Long.fromInt(123))).toBeFalsy()\n        expect(set.has(Long.fromInt(456))).toBeFalsy()\n    })\n\n    it('should return the size', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n        set.add(Long.fromInt(456))\n\n        expect(set.size).toEqual(2)\n    })\n\n    it('should convert to array', () => {\n        const set = new LongSet()\n\n        set.add(Long.fromInt(123))\n        set.add(Long.fromInt(456))\n\n        expect(set.toArray()).toEqual([Long.fromInt(123), Long.fromInt(456)])\n    })\n})\n"]}

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

@@ -18,4 +18,5 @@ export declare class LruMap<K extends string | number, V> {
     private _remove;
     set(key: K, value: V): void;
     delete(key: K): void;
+    clear(): void;
 }

package/esm/utils/lru-map.js

@@ -99,5 +99,11 @@ export class LruMap {
         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 +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,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAA;AAazC;;;;;;GAMG;AACH,MAAM,OAAO,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,OAAO,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","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"]}
+{"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;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,OAAO,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;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-map.test.d.ts

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,94 @@
+import { describe, expect, it } from 'vitest';
+import { LruMap } from './lru-map.js';
+describe('LruMap', () => {
+    it('should maintain maximum size by removing oldest added', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        lru.set('third', 3);
+        expect(lru.has('first')).toBeFalsy();
+    });
+    it('should update the last added item', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        lru.set('first', 42);
+        lru.set('third', 3);
+        expect(lru.get('first')).toEqual(42);
+        expect(lru.has('second')).toBeFalsy();
+    });
+    it('should update the last used item', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        lru.get('first');
+        lru.set('third', 3);
+        lru.get('third');
+        expect(lru.get('first')).toEqual(1);
+        expect(lru.has('second')).toBeFalsy();
+    });
+    it('should allow deleting items', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        lru.set('third', 3); // first is now deleted
+        lru.delete('second');
+        expect(lru.has('first')).toBeFalsy();
+        expect(lru.has('second')).toBeFalsy();
+        expect(lru.has('third')).toBeTruthy();
+    });
+    it('should handle deleting all items', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        lru.delete('second');
+        lru.delete('first');
+        expect(lru.has('first')).toBeFalsy();
+        expect(lru.has('second')).toBeFalsy();
+    });
+    it('should return undefined for non-existing items', () => {
+        const lru = new LruMap(2);
+        lru.set('first', 1);
+        lru.set('second', 2);
+        expect(lru.get('third')).toEqual(undefined);
+    });
+    // it('Map backend', () => {
+    //     const lru = new LruMap<string, number>(2)
+    //
+    //     lru.set('first', 1)
+    //     expect(lru.has('first')).true
+    //     expect(lru.has('second')).false
+    //     expect(lru.get('first')).eq(1)
+    //
+    //     lru.set('first', 42)
+    //     expect(lru.has('first')).true
+    //     expect(lru.has('second')).false
+    //     expect(lru.get('first')).eq(42)
+    //
+    //     lru.set('second', 2)
+    //     expect(lru.has('first')).true
+    //     expect(lru.has('second')).true
+    //     expect(lru.get('first')).eq(42)
+    //     expect(lru.get('second')).eq(2)
+    //
+    //     lru.set('third', 3)
+    //     expect(lru.has('first')).false
+    //     expect(lru.has('second')).true
+    //     expect(lru.has('third')).true
+    //     expect(lru.get('first')).eq(undefined)
+    //     expect(lru.get('second')).eq(2)
+    //     expect(lru.get('third')).eq(3)
+    //
+    //     lru.get('second') // update lru so that last = third
+    //     lru.set('fourth', 4)
+    //     expect(lru.has('first')).false
+    //     expect(lru.has('second')).true
+    //     expect(lru.has('third')).false
+    //     expect(lru.has('fourth')).true
+    //     expect(lru.get('first')).eq(undefined)
+    //     expect(lru.get('second')).eq(2)
+    //     expect(lru.get('third')).eq(undefined)
+    //     expect(lru.get('fourth')).eq(4)
+    // })
+});
+//# sourceMappingURL=lru-map.test.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru-map.test.js","sourceRoot":"","sources":["../../../src/utils/lru-map.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAE7C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAA;AAErC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACpB,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC7D,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QAEnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IACxC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAA;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QAEnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAChB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEhB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;QACnC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACnC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA,CAAC,uBAAuB;QAC3C,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QAEpB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QACrC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QACpB,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QACpB,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAEnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;QACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAG,IAAI,MAAM,CAAiB,CAAC,CAAC,CAAA;QAEzC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;QAEpB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IAC/C,CAAC,CAAC,CAAA;IAEF,4BAA4B;IAC5B,gDAAgD;IAChD,EAAE;IACF,0BAA0B;IAC1B,oCAAoC;IACpC,sCAAsC;IACtC,qCAAqC;IACrC,EAAE;IACF,2BAA2B;IAC3B,oCAAoC;IACpC,sCAAsC;IACtC,sCAAsC;IACtC,EAAE;IACF,2BAA2B;IAC3B,oCAAoC;IACpC,qCAAqC;IACrC,sCAAsC;IACtC,sCAAsC;IACtC,EAAE;IACF,0BAA0B;IAC1B,qCAAqC;IACrC,qCAAqC;IACrC,oCAAoC;IACpC,6CAA6C;IAC7C,sCAAsC;IACtC,qCAAqC;IACrC,EAAE;IACF,2DAA2D;IAC3D,2BAA2B;IAC3B,qCAAqC;IACrC,qCAAqC;IACrC,qCAAqC;IACrC,qCAAqC;IACrC,6CAA6C;IAC7C,sCAAsC;IACtC,6CAA6C;IAC7C,sCAAsC;IACtC,KAAK;AACT,CAAC,CAAC,CAAA","sourcesContent":["import { describe, expect, it } from 'vitest'\n\nimport { LruMap } from './lru-map.js'\n\ndescribe('LruMap', () => {\n    it('should maintain maximum size by removing oldest added', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n        lru.set('third', 3)\n\n        expect(lru.has('first')).toBeFalsy()\n    })\n\n    it('should update the last added item', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n        lru.set('first', 42)\n        lru.set('third', 3)\n\n        expect(lru.get('first')).toEqual(42)\n        expect(lru.has('second')).toBeFalsy()\n    })\n\n    it('should update the last used item', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n        lru.get('first')\n        lru.set('third', 3)\n        lru.get('third')\n\n        expect(lru.get('first')).toEqual(1)\n        expect(lru.has('second')).toBeFalsy()\n    })\n\n    it('should allow deleting items', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n        lru.set('third', 3) // first is now deleted\n        lru.delete('second')\n\n        expect(lru.has('first')).toBeFalsy()\n        expect(lru.has('second')).toBeFalsy()\n        expect(lru.has('third')).toBeTruthy()\n    })\n\n    it('should handle deleting all items', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n        lru.delete('second')\n        lru.delete('first')\n\n        expect(lru.has('first')).toBeFalsy()\n        expect(lru.has('second')).toBeFalsy()\n    })\n\n    it('should return undefined for non-existing items', () => {\n        const lru = new LruMap<string, number>(2)\n\n        lru.set('first', 1)\n        lru.set('second', 2)\n\n        expect(lru.get('third')).toEqual(undefined)\n    })\n\n    // it('Map backend', () => {\n    //     const lru = new LruMap<string, number>(2)\n    //\n    //     lru.set('first', 1)\n    //     expect(lru.has('first')).true\n    //     expect(lru.has('second')).false\n    //     expect(lru.get('first')).eq(1)\n    //\n    //     lru.set('first', 42)\n    //     expect(lru.has('first')).true\n    //     expect(lru.has('second')).false\n    //     expect(lru.get('first')).eq(42)\n    //\n    //     lru.set('second', 2)\n    //     expect(lru.has('first')).true\n    //     expect(lru.has('second')).true\n    //     expect(lru.get('first')).eq(42)\n    //     expect(lru.get('second')).eq(2)\n    //\n    //     lru.set('third', 3)\n    //     expect(lru.has('first')).false\n    //     expect(lru.has('second')).true\n    //     expect(lru.has('third')).true\n    //     expect(lru.get('first')).eq(undefined)\n    //     expect(lru.get('second')).eq(2)\n    //     expect(lru.get('third')).eq(3)\n    //\n    //     lru.get('second') // update lru so that last = third\n    //     lru.set('fourth', 4)\n    //     expect(lru.has('first')).false\n    //     expect(lru.has('second')).true\n    //     expect(lru.has('third')).false\n    //     expect(lru.has('fourth')).true\n    //     expect(lru.get('first')).eq(undefined)\n    //     expect(lru.get('second')).eq(2)\n    //     expect(lru.get('third')).eq(undefined)\n    //     expect(lru.get('fourth')).eq(4)\n    // })\n})\n"]}

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,72 @@
+import Long from 'long';
+import { describe, expect, it } from 'vitest';
+import { LruSet } from './lru-set.js';
+describe('LruSet', () => {
+    describe('for strings', () => {
+        it('when 1 item is added, it is in the set', () => {
+            const set = new LruSet(2);
+            set.add('first');
+            expect(set.has('first')).true;
+        });
+        it('when =capacity items are added, they are all in the set', () => {
+            const set = new LruSet(2);
+            set.add('first');
+            set.add('second');
+            expect(set.has('first')).true;
+            expect(set.has('second')).true;
+        });
+        it('when >capacity items are added, only the last <capacity> are in the set', () => {
+            const set = new LruSet(2);
+            set.add('first');
+            set.add('second');
+            set.add('third');
+            expect(set.has('first')).false;
+            expect(set.has('second')).true;
+            expect(set.has('third')).true;
+        });
+        it('when the same added is while not eliminated, it is ignored', () => {
+            const set = new LruSet(2);
+            set.add('first');
+            set.add('second');
+            set.add('first');
+            set.add('third');
+            expect(set.has('first')).false;
+            expect(set.has('second')).true;
+            expect(set.has('third')).true;
+        });
+    });
+    describe('for Longs', () => {
+        it('when 1 item is added, it is in the set', () => {
+            const set = new LruSet(2, true);
+            set.add(Long.fromNumber(1));
+            expect(set.has(Long.fromNumber(1))).true;
+        });
+        it('when =capacity items are added, they are all in the set', () => {
+            const set = new LruSet(2, true);
+            set.add(Long.fromNumber(1));
+            set.add(Long.fromNumber(2));
+            expect(set.has(Long.fromNumber(1))).true;
+            expect(set.has(Long.fromNumber(2))).true;
+        });
+        it('when >capacity items are added, only the last <capacity> are in the set', () => {
+            const set = new LruSet(2, true);
+            set.add(Long.fromNumber(1));
+            set.add(Long.fromNumber(2));
+            set.add(Long.fromNumber(3));
+            expect(set.has(Long.fromNumber(1))).false;
+            expect(set.has(Long.fromNumber(2))).true;
+            expect(set.has(Long.fromNumber(3))).true;
+        });
+        it('when the same added is while not eliminated, it is ignored', () => {
+            const set = new LruSet(2, true);
+            set.add(Long.fromNumber(1));
+            set.add(Long.fromNumber(2));
+            set.add(Long.fromNumber(1));
+            set.add(Long.fromNumber(3));
+            expect(set.has(Long.fromNumber(1))).false;
+            expect(set.has(Long.fromNumber(2))).true;
+            expect(set.has(Long.fromNumber(3))).true;
+        });
+    });
+});
+//# sourceMappingURL=lru-set.test.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru-set.test.js","sourceRoot":"","sources":["../../../src/utils/lru-set.test.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,MAAM,CAAA;AACvB,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAE7C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAA;AAErC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACpB,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAA;YAEzB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAA;QACjC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAC/D,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAA;YAEzB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChB,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YAEjB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAA;YAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;QAClC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;YAC/E,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAA;YAEzB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChB,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACjB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAEhB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAA;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAA;QACjC,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;YAClE,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAA;YAEzB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChB,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACjB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAEhB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAA;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAA;QACjC,CAAC,CAAC,CAAA;IACN,CAAC,CAAC,CAAA;IAEF,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAE/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAC5C,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAC/D,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAE/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAE3B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;YACxC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAC5C,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;YAC/E,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAE/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAE3B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;YACzC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;YACxC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAC5C,CAAC,CAAC,CAAA;QAEF,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;YAClE,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAE/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAE3B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;YACzC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;YACxC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAC5C,CAAC,CAAC,CAAA;IACN,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import Long from 'long'\nimport { describe, expect, it } from 'vitest'\n\nimport { LruSet } from './lru-set.js'\n\ndescribe('LruSet', () => {\n    describe('for strings', () => {\n        it('when 1 item is added, it is in the set', () => {\n            const set = new LruSet(2)\n\n            set.add('first')\n            expect(set.has('first')).true\n        })\n\n        it('when =capacity items are added, they are all in the set', () => {\n            const set = new LruSet(2)\n\n            set.add('first')\n            set.add('second')\n\n            expect(set.has('first')).true\n            expect(set.has('second')).true\n        })\n\n        it('when >capacity items are added, only the last <capacity> are in the set', () => {\n            const set = new LruSet(2)\n\n            set.add('first')\n            set.add('second')\n            set.add('third')\n\n            expect(set.has('first')).false\n            expect(set.has('second')).true\n            expect(set.has('third')).true\n        })\n\n        it('when the same added is while not eliminated, it is ignored', () => {\n            const set = new LruSet(2)\n\n            set.add('first')\n            set.add('second')\n            set.add('first')\n            set.add('third')\n\n            expect(set.has('first')).false\n            expect(set.has('second')).true\n            expect(set.has('third')).true\n        })\n    })\n\n    describe('for Longs', () => {\n        it('when 1 item is added, it is in the set', () => {\n            const set = new LruSet(2, true)\n\n            set.add(Long.fromNumber(1))\n            expect(set.has(Long.fromNumber(1))).true\n        })\n\n        it('when =capacity items are added, they are all in the set', () => {\n            const set = new LruSet(2, true)\n\n            set.add(Long.fromNumber(1))\n            set.add(Long.fromNumber(2))\n\n            expect(set.has(Long.fromNumber(1))).true\n            expect(set.has(Long.fromNumber(2))).true\n        })\n\n        it('when >capacity items are added, only the last <capacity> are in the set', () => {\n            const set = new LruSet(2, true)\n\n            set.add(Long.fromNumber(1))\n            set.add(Long.fromNumber(2))\n            set.add(Long.fromNumber(3))\n\n            expect(set.has(Long.fromNumber(1))).false\n            expect(set.has(Long.fromNumber(2))).true\n            expect(set.has(Long.fromNumber(3))).true\n        })\n\n        it('when the same added is while not eliminated, it is ignored', () => {\n            const set = new LruSet(2, true)\n\n            set.add(Long.fromNumber(1))\n            set.add(Long.fromNumber(2))\n            set.add(Long.fromNumber(1))\n            set.add(Long.fromNumber(3))\n\n            expect(set.has(Long.fromNumber(1))).false\n            expect(set.has(Long.fromNumber(2))).true\n            expect(set.has(Long.fromNumber(3))).true\n        })\n    })\n})\n"]}

package/esm/utils/peer-utils.js

@@ -48,14 +48,18 @@ export function getMarkedPeerId(peer, peerType) {
     switch (peer._) {
         case 'peerUser':
         case 'inputPeerUser':
+        case 'inputPeerUserFromMessage':
         case 'inputUser':
+        case 'inputUserFromMessage':
             return peer.userId;
         case 'peerChat':
         case 'inputPeerChat':
             return -peer.chatId;
         case 'peerChannel':
         case 'inputPeerChannel':
+        case 'inputPeerChannelFromMessage':
         case 'inputChannel':
+        case 'inputChannelFromMessage':
             return ZERO_CHANNEL_ID - peer.channelId;
     }
     throw new MtArgumentError('Invalid peer');
@@ -81,7 +85,7 @@ export function getBasicPeerType(peer) {
         if (MIN_MARKED_CHANNEL_ID <= peer && peer !== ZERO_CHANNEL_ID) {
             return 'channel';
         }
-        if (MAX_SECRET_CHAT_ID <= peer && peer !== ZERO_SECRET_CHAT_ID) {
+        if (MAX_SECRET_CHAT_ID >= peer && peer !== ZERO_SECRET_CHAT_ID) {
             // return 'secret'
             throw new MtUnsupportedError('Secret chats are not supported');
         }

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

@@ -1 +1 @@
-{"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;QACZ,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;KAC5B;AACL,CAAC;AAeD,MAAM,UAAU,eAAe,CAC3B,IAAsF,EACtF,QAAwB;IAExB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,QAAQ,QAAQ,EAAE;YACd,KAAK,MAAM;gBACP,OAAO,IAAI,CAAA;YACf,KAAK,MAAM;gBACP,OAAO,CAAC,IAAI,CAAA;YAChB,KAAK,SAAS;gBACV,OAAO,eAAe,GAAG,IAAI,CAAA;SACpC;QACD,MAAM,IAAI,eAAe,CAAC,mBAAmB,CAAC,CAAA;KACjD;IAED,QAAQ,IAAI,CAAC,CAAC,EAAE;QACZ,KAAK,UAAU,CAAC;QAChB,KAAK,eAAe,CAAC;QACrB,KAAK,WAAW;YACZ,OAAO,IAAI,CAAC,MAAM,CAAA;QACtB,KAAK,UAAU,CAAC;QAChB,KAAK,eAAe;YAChB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAA;QACvB,KAAK,aAAa,CAAC;QACnB,KAAK,kBAAkB,CAAC;QACxB,KAAK,cAAc;YACf,OAAO,eAAe,GAAG,IAAI,CAAC,SAAS,CAAA;KAC9C;IAED,MAAM,IAAI,eAAe,CAAC,cAAc,CAAC,CAAA;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAA0B;IACvD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,QAAQ,IAAI,CAAC,CAAC,EAAE;YACZ,KAAK,UAAU;gBACX,OAAO,MAAM,CAAA;YACjB,KAAK,UAAU;gBACX,OAAO,MAAM,CAAA;YACjB,KAAK,aAAa;gBACd,OAAO,SAAS,CAAA;SACvB;KACJ;IAED,IAAI,IAAI,GAAG,CAAC,EAAE;QACV,IAAI,kBAAkB,IAAI,IAAI,EAAE;YAC5B,OAAO,MAAM,CAAA;SAChB;QAED,IAAI,qBAAqB,IAAI,IAAI,IAAI,IAAI,KAAK,eAAe,EAAE;YAC3D,OAAO,SAAS,CAAA;SACnB;QAED,IAAI,kBAAkB,IAAI,IAAI,IAAI,IAAI,KAAK,mBAAmB,EAAE;YAC5D,kBAAkB;YAClB,MAAM,IAAI,kBAAkB,CAAC,gCAAgC,CAAC,CAAA;SACjE;KACJ;SAAM,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,WAAW,EAAE;QACxC,OAAO,MAAM,CAAA;KAChB;IAED,MAAM,IAAI,eAAe,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAA;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc;IAC7C,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAA;IAErC,QAAQ,IAAI,EAAE;QACV,KAAK,MAAM;YACP,OAAO,MAAM,CAAA;QACjB,KAAK,MAAM;YACP,OAAO,CAAC,MAAM,CAAA;QAClB,KAAK,SAAS;YACV,OAAO,mBAAmB,CAAC,MAAM,CAAC,CAAA;KACzC;AACL,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;QACpB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE;YAClB,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAA;SAC7B;QAED,OAAM;KACT;IAED,QAAQ,GAAG,CAAC,CAAC,EAAE;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC;QACf,KAAK,eAAe,CAAC;QACrB,KAAK,kBAAkB;YACnB,MAAM,GAAG,CAAA;YAET,OAAM;KACb;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE;QACxE,MAAM,GAAG,CAAC,IAAI,CAAA;KACjB;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE;QAC/C,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;YAChB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,IAAI,CAAA;gBACd,MAAK;SACZ;KACJ;IAED,IAAI,SAAS,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,EAAE;QACrD,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE;YACnB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,OAAO,CAAA;gBACjB,MAAK;SACZ;KACJ;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;QAChE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;YAC1B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE;gBAC/C,MAAM,IAAI,CAAA;aACb;SACJ;KACJ;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;QAChE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;YAC1B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC1B,QAAQ,IAAI,CAAC,CAAC,EAAE;oBACZ,KAAK,MAAM,CAAC;oBACZ,KAAK,SAAS,CAAC;oBACf,KAAK,eAAe,CAAC;oBACrB,KAAK,kBAAkB;wBACnB,MAAM,IAAI,CAAA;wBACV,MAAK;iBACZ;aACJ;SACJ;KACJ;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 'peerUser':\n        case 'inputPeerUser':\n        case 'inputUser':\n            return peer.userId\n        case 'peerChat':\n        case 'inputPeerChat':\n            return -peer.chatId\n        case 'peerChannel':\n        case 'inputPeerChannel':\n        case 'inputChannel':\n            return ZERO_CHANNEL_ID - peer.channelId\n    }\n\n    throw new MtArgumentError('Invalid peer')\n}\n\n/**\n * Extract basic peer type from {@link tl.TypePeer} or its marked ID.\n */\nexport function getBasicPeerType(peer: tl.TypePeer | number): BasicPeerType {\n    if (typeof peer !== 'number') {\n        switch (peer._) {\n            case 'peerUser':\n                return 'user'\n            case 'peerChat':\n                return 'chat'\n            case 'peerChannel':\n                return 'channel'\n        }\n    }\n\n    if (peer < 0) {\n        if (MIN_MARKED_CHAT_ID <= peer) {\n            return 'chat'\n        }\n\n        if (MIN_MARKED_CHANNEL_ID <= peer && peer !== ZERO_CHANNEL_ID) {\n            return 'channel'\n        }\n\n        if (MAX_SECRET_CHAT_ID <= peer && peer !== ZERO_SECRET_CHAT_ID) {\n            // return 'secret'\n            throw new MtUnsupportedError('Secret chats are not supported')\n        }\n    } else if (peer > 0 && peer <= MAX_USER_ID) {\n        return 'user'\n    }\n\n    throw new MtArgumentError(`Invalid marked peer id: ${peer}`)\n}\n\n/**\n * Extract bare peer ID from marked ID.\n *\n * @param peerId  Marked peer ID\n */\nexport function markedPeerIdToBare(peerId: number): number {\n    const type = getBasicPeerType(peerId)\n\n    switch (type) {\n        case 'user':\n            return peerId\n        case 'chat':\n            return -peerId\n        case 'channel':\n            return toggleChannelIdMark(peerId)\n    }\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"]}
+{"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;QACZ,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;KAC5B;AACL,CAAC;AAeD,MAAM,UAAU,eAAe,CAC3B,IAAsF,EACtF,QAAwB;IAExB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,QAAQ,QAAQ,EAAE;YACd,KAAK,MAAM;gBACP,OAAO,IAAI,CAAA;YACf,KAAK,MAAM;gBACP,OAAO,CAAC,IAAI,CAAA;YAChB,KAAK,SAAS;gBACV,OAAO,eAAe,GAAG,IAAI,CAAA;SACpC;QACD,MAAM,IAAI,eAAe,CAAC,mBAAmB,CAAC,CAAA;KACjD;IAED,QAAQ,IAAI,CAAC,CAAC,EAAE;QACZ,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,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;KAC9C;IAED,MAAM,IAAI,eAAe,CAAC,cAAc,CAAC,CAAA;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAA0B;IACvD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,QAAQ,IAAI,CAAC,CAAC,EAAE;YACZ,KAAK,UAAU;gBACX,OAAO,MAAM,CAAA;YACjB,KAAK,UAAU;gBACX,OAAO,MAAM,CAAA;YACjB,KAAK,aAAa;gBACd,OAAO,SAAS,CAAA;SACvB;KACJ;IAED,IAAI,IAAI,GAAG,CAAC,EAAE;QACV,IAAI,kBAAkB,IAAI,IAAI,EAAE;YAC5B,OAAO,MAAM,CAAA;SAChB;QAED,IAAI,qBAAqB,IAAI,IAAI,IAAI,IAAI,KAAK,eAAe,EAAE;YAC3D,OAAO,SAAS,CAAA;SACnB;QAED,IAAI,kBAAkB,IAAI,IAAI,IAAI,IAAI,KAAK,mBAAmB,EAAE;YAC5D,kBAAkB;YAClB,MAAM,IAAI,kBAAkB,CAAC,gCAAgC,CAAC,CAAA;SACjE;KACJ;SAAM,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,WAAW,EAAE;QACxC,OAAO,MAAM,CAAA;KAChB;IAED,MAAM,IAAI,eAAe,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAA;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc;IAC7C,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAA;IAErC,QAAQ,IAAI,EAAE;QACV,KAAK,MAAM;YACP,OAAO,MAAM,CAAA;QACjB,KAAK,MAAM;YACP,OAAO,CAAC,MAAM,CAAA;QAClB,KAAK,SAAS;YACV,OAAO,mBAAmB,CAAC,MAAM,CAAC,CAAA;KACzC;AACL,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;QACpB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE;YAClB,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAA;SAC7B;QAED,OAAM;KACT;IAED,QAAQ,GAAG,CAAC,CAAC,EAAE;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC;QACf,KAAK,eAAe,CAAC;QACrB,KAAK,kBAAkB;YACnB,MAAM,GAAG,CAAA;YAET,OAAM;KACb;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE;QACxE,MAAM,GAAG,CAAC,IAAI,CAAA;KACjB;IAED,IAAI,MAAM,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE;QAC/C,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;YAChB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,IAAI,CAAA;gBACd,MAAK;SACZ;KACJ;IAED,IAAI,SAAS,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,EAAE;QACrD,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE;YACnB,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,kBAAkB;gBACnB,MAAM,GAAG,CAAC,OAAO,CAAA;gBACjB,MAAK;SACZ;KACJ;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;QAChE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;YAC1B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE;gBAC/C,MAAM,IAAI,CAAA;aACb;SACJ;KACJ;IAED,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;QAChE,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;YAC1B,+BAA+B;YAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC1B,QAAQ,IAAI,CAAC,CAAC,EAAE;oBACZ,KAAK,MAAM,CAAC;oBACZ,KAAK,SAAS,CAAC;oBACf,KAAK,eAAe,CAAC;oBACrB,KAAK,kBAAkB;wBACnB,MAAM,IAAI,CAAA;wBACV,MAAK;iBACZ;aACJ;SACJ;KACJ;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 '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 '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')\n}\n\n/**\n * Extract basic peer type from {@link tl.TypePeer} or its marked ID.\n */\nexport function getBasicPeerType(peer: tl.TypePeer | number): BasicPeerType {\n    if (typeof peer !== 'number') {\n        switch (peer._) {\n            case 'peerUser':\n                return 'user'\n            case 'peerChat':\n                return 'chat'\n            case 'peerChannel':\n                return 'channel'\n        }\n    }\n\n    if (peer < 0) {\n        if (MIN_MARKED_CHAT_ID <= peer) {\n            return 'chat'\n        }\n\n        if (MIN_MARKED_CHANNEL_ID <= peer && peer !== ZERO_CHANNEL_ID) {\n            return 'channel'\n        }\n\n        if (MAX_SECRET_CHAT_ID >= peer && peer !== ZERO_SECRET_CHAT_ID) {\n            // return 'secret'\n            throw new MtUnsupportedError('Secret chats are not supported')\n        }\n    } else if (peer > 0 && peer <= MAX_USER_ID) {\n        return 'user'\n    }\n\n    throw new MtArgumentError(`Invalid marked peer id: ${peer}`)\n}\n\n/**\n * Extract bare peer ID from marked ID.\n *\n * @param peerId  Marked peer ID\n */\nexport function markedPeerIdToBare(peerId: number): number {\n    const type = getBasicPeerType(peerId)\n\n    switch (type) {\n        case 'user':\n            return peerId\n        case 'chat':\n            return -peerId\n        case 'channel':\n            return toggleChannelIdMark(peerId)\n    }\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/peer-utils.test.d.ts

@@ -0,0 +1 @@
+export {};