@vaitosoi/minejs 0.4.2 → 0.5.0

package/README.md

@@ -10,7 +10,7 @@ This is a Minecraft client package, written entirely in Typescript, using NodeJS
 
 This package is highly unstable for now, please report if there is any bug, glitch.
 
-Also, since there is some problem with authenticating and appId approval, you can not let the bot join "online server yet". [See more here](#iv-about-joining-online-server)
+Also, since there is some problem with authenticating and appId approval, I haven't completed the join "online server" part yet. [See more here](#iv-about-joining-online-server)
 
 ## II. Usage
 
@@ -38,8 +38,8 @@ const client = new Client({
     //     openBrowser: true,
     //     port: 12345
     // },
-    shouldVerifyMessageOrder: true,
-    shouldVerifyMessageSignature: true
+    // shouldVerifyMessageOrder: true,
+    // shouldVerifyMessageSignature: true
 });
 client.connect();
 client.on("disconnect", (...args) => console.dir({ name: "disconnect", args }, { depth: null }));
@@ -80,7 +80,15 @@ client.on("message", (message) => {
         case "at": {
             const [, x, y, z] = args.map(val => parseInt(val)) as [any, number, number, number];
             const state = client.at(x, y, z);
-            // console.log(state);
+            console.log(state);
+            break;
+        }
+
+        case "e":
+        case "echo":
+        case "say": {
+            const message = args.slice(1).join(" ");
+            client.chat(message);
             break;
         }
 
@@ -104,4 +112,44 @@ See [documentation](https://minejs.vaito.dev)
 
 ## IV. About joining online server:
 
-In order to join "online server" (the server require an account that have purchased Minecraft, to distinguish with the "offiline server", where you don't have to purchase Minecraft), you have to send some request to Minecraft server, which require an approved Azure App (more info in [here](https://minecraft.wiki/w/Microsoft_authentication#Microsoft_OAuth2_flow) and [here](https://help.minecraft.net/hc/en-us/articles/16254801392141p)), which I don't have at the moment. So I can not fully test the "join online server" feature right now. But still, if you somehow got an approved app and found some bug, please [create a issue](https://github.com/VaitoSoi/minejs/issues/new)
+### 1. What is `online server` and `offline server`:
+
++ `Offline server` is a server you can join with a cracked account, meaning that you don't have to own Minecraft to join.
+
++ `Online server`, on the other hand, require an account that owns Minecraft.
+
+### 2. Why I can't join online server yet:
+
+In order to join "online server", the client has to send some request to Minecraft server, which require an approved Azure App (more info in [here](https://minecraft.wiki/w/Microsoft_authentication#Microsoft_OAuth2_flow) and [here](https://help.minecraft.net/hc/en-us/articles/16254801392141p)), which I don't have at the moment. So I can not fully test the "join online server" feature right now. 
+
+### 3. So how do you know if the server is offline or online:
+
+#### a. If you are the server owner:
+
+Check your `server.properties` file:
+
+```
+...
+motd=A Minecraft Server
+network-compression-threshold=256
+online-mode=false # <- false is offline, true is onlune
+op-permission-level=4
+pause-when-empty-seconds=60
+...
+```
+
+#### b. If you are not the server owner:
+
+1. Ask the server owner
+
+or
+
+2. Try some crack launcher to join that sevrer
+
+### 4. Note:
+
+But still, if you somehow got an approved app and found some bug, please [create a issue](https://github.com/VaitoSoi/minejs/issues/new)
+
+**P/s:** They rejected me 😭
+
+![The rejected mail](./assets/doc/rejected.png)

package/assets/minecraft/26.2/effects.json

@@ -0,0 +1,42 @@
+{
+    "minecraft:absorption": 21,
+    "minecraft:bad_omen": 30,
+    "minecraft:blindness": 14,
+    "minecraft:breath_of_the_nautilus": 39,
+    "minecraft:conduit_power": 28,
+    "minecraft:darkness": 32,
+    "minecraft:dolphins_grace": 29,
+    "minecraft:fire_resistance": 11,
+    "minecraft:glowing": 23,
+    "minecraft:haste": 2,
+    "minecraft:health_boost": 20,
+    "minecraft:hero_of_the_village": 31,
+    "minecraft:hunger": 16,
+    "minecraft:infested": 38,
+    "minecraft:instant_damage": 6,
+    "minecraft:instant_health": 5,
+    "minecraft:invisibility": 13,
+    "minecraft:jump_boost": 7,
+    "minecraft:levitation": 24,
+    "minecraft:luck": 25,
+    "minecraft:mining_fatigue": 3,
+    "minecraft:nausea": 8,
+    "minecraft:night_vision": 15,
+    "minecraft:oozing": 37,
+    "minecraft:poison": 18,
+    "minecraft:raid_omen": 34,
+    "minecraft:regeneration": 9,
+    "minecraft:resistance": 10,
+    "minecraft:saturation": 22,
+    "minecraft:slow_falling": 27,
+    "minecraft:slowness": 1,
+    "minecraft:speed": 0,
+    "minecraft:strength": 4,
+    "minecraft:trial_omen": 33,
+    "minecraft:unluck": 26,
+    "minecraft:water_breathing": 12,
+    "minecraft:weakness": 17,
+    "minecraft:weaving": 36,
+    "minecraft:wind_charged": 35,
+    "minecraft:wither": 19
+}

package/assets/minecraft/26.2/packets.json

@@ -1503,7 +1503,8 @@
           },
           "light": {
             "type": "not_implemented",
-            "comment": "Light Data"
+            "comment": "Light Data",
+            "skip_able": true
           }
         }
       },
@@ -3711,7 +3712,7 @@
             "type": "var_int"
           },
           "acknowledged": {
-            "type": "not_implemented",
+            "type": "fixed_bitset",
             "length": 20
           },
           "checksum": {

package/dist/base/bitset.d.ts

@@ -1,9 +1,48 @@
-import BitSet_ from "bitset";
 /**
- * Custom implementation of BitSet to implement missing method
+ * Simplified implementation of the Java's BitSet class
+ *
+ * @see https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/java/util/BitSet.java
+ * @hidden
  */
-export declare class BitSet extends BitSet_ {
-    nextClearBit(fromIndex: number): number;
+export declare class BitSet {
+    static readonly ADDRESS_BITS_PER_WORD = 6;
+    static readonly BITS_PER_WORD: number;
+    static readonly WORD_MASK = 18446744073709551615n;
+    words: BigUint64Array;
+    wordsInUse: number;
+    private static wordIndex;
+    private static bitIndexInWord;
+    /**
+     * Create a mask with lowest `n` bits set to 1
+     *
+     * For example:
+     * * n = 0 -> `0b0n`
+     * * n = 3 -> `0b111n`
+     * * n = 5 -> `0b11111n`
+     *
+     * @param nBits
+     * @returns
+     */
+    private static lowBits;
+    private initWords;
+    private static checkRange;
+    constructor(nBits?: number);
     clone(): BitSet;
+    private expandTo;
+    private ensureCapacity;
+    private recalculateWordsInUse;
+    private checkInvariants;
+    toByteArray(): number[];
+    flip(bitIndex: number): void;
+    set(bitIndex: number): void;
+    setRange(fromIndex: number, toIndex: number): void;
+    clear(bitIndex: number): void;
+    clearRange(fromIndex: number, toIndex: number): void;
+    get(bitIndex: number): boolean;
+    nextSetBit(fromIndex: number): number;
+    nextClearBit(fromIndex: number): number;
+    length(): number;
+    isEmpty(): boolean;
 }
+export default BitSet;
 //# sourceMappingURL=bitset.d.ts.map

package/dist/base/bitset.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bitset.d.ts","sourceRoot":"","sources":["../../src/base/bitset.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,QAAQ,CAAC;AAE7B;;GAEG;AACH,qBAAa,MAAO,SAAQ,OAAO;IACxB,YAAY,CAAC,SAAS,EAAE,MAAM,UA8BpC;IAEe,KAAK,IAAI,MAAM,CAE9B;CACJ"}
+{"version":3,"file":"bitset.d.ts","sourceRoot":"","sources":["../../src/base/bitset.ts"],"names":[],"mappings":"AAKA;;;;;GAKG;AACH,qBAAa,MAAM;IACf,gBAAuB,qBAAqB,KAAK;IACjD,gBAAuB,aAAa,SAAmC;IACvE,gBAAuB,SAAS,yBAAuB;IAEhD,KAAK,EAAE,cAAc,CAAC;IACtB,UAAU,EAAE,MAAM,CAAK;IAE9B,OAAO,CAAC,MAAM,CAAC,SAAS;IAIxB,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,OAAO;IAItB,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,MAAM,CAAC,UAAU;IAUzB,YAAY,KAAK,CAAC,EAAE,MAAM,EAIzB;IAEM,KAAK,WAMX;IAED,OAAO,CAAC,QAAQ;IAQhB,OAAO,CAAC,cAAc;IAUtB,OAAO,CAAC,qBAAqB;IAM7B,OAAO,CAAC,eAAe;IAOhB,WAAW,aAiBjB;IAEM,IAAI,CAAC,QAAQ,EAAE,MAAM,QAW3B;IAEM,GAAG,CAAC,QAAQ,EAAE,MAAM,QAU1B;IACM,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,QAgDjD;IAGM,KAAK,CAAC,QAAQ,EAAE,MAAM,QAY5B;IACM,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,QAyCnD;IAGM,GAAG,CAAC,QAAQ,EAAE,MAAM,WAW1B;IAEM,UAAU,CAAC,SAAS,EAAE,MAAM,UAmBlC;IAEM,YAAY,CAAC,SAAS,EAAE,MAAM,UAqBpC;IAEM,MAAM,WAMZ;IAEM,OAAO,YAEb;CACJ;eAEc,MAAM"}

package/dist/base/bitset.js

@@ -4,43 +4,264 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BitSet = void 0;
-const bitset_1 = __importDefault(require("bitset"));
+const node_assert_1 = __importDefault(require("node:assert"));
+const error_1 = require("./error");
+const math_1 = require("./math");
 /**
- * Custom implementation of BitSet to implement missing method
+ * Simplified implementation of the Java's BitSet class
+ *
+ * @see https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/java/util/BitSet.java
+ * @hidden
  */
-class BitSet extends bitset_1.default {
+class BitSet {
+    static ADDRESS_BITS_PER_WORD = 6;
+    static BITS_PER_WORD = 1 << this.ADDRESS_BITS_PER_WORD;
+    static WORD_MASK = 0xffffffffffffffffn;
+    words;
+    wordsInUse = 0;
+    static wordIndex(bitIndex) {
+        return bitIndex >> this.ADDRESS_BITS_PER_WORD;
+    }
+    static bitIndexInWord(bitIndex) {
+        return bitIndex & (this.BITS_PER_WORD - 1); // should be bitIndex & 63
+    }
+    /**
+     * Create a mask with lowest `n` bits set to 1
+     *
+     * For example:
+     * * n = 0 -> `0b0n`
+     * * n = 3 -> `0b111n`
+     * * n = 5 -> `0b11111n`
+     *
+     * @param nBits
+     * @returns
+     */
+    static lowBits(nBits) {
+        return (1n << BigInt(nBits)) - 1n;
+    }
+    initWords(nBits) {
+        return new BigUint64Array(BitSet.wordIndex(nBits - 1) + 1);
+    }
+    static checkRange(fromIndex, toIndex) {
+        if (fromIndex < 0)
+            throw new error_1.UnexpectedValue("value of fromIndex", fromIndex.toString(), "non-negative number");
+        if (toIndex < 0)
+            throw new error_1.UnexpectedValue("value of toIndex", toIndex.toString(), "non-negative number");
+        if (fromIndex > toIndex)
+            throw new error_1.UnexpectedValue("fromIndex and toIndex", `fromIndex ${fromIndex}; toIndex ${toIndex}`, "fromIndex has to be smaller than toIndex");
+    }
+    constructor(nBits) {
+        if (nBits && nBits < 0)
+            throw new error_1.UnexpectedValue("length of bitset", nBits.toString(), "non-negative number");
+        this.words = this.initWords(nBits ?? BitSet.BITS_PER_WORD);
+    }
+    clone() {
+        const bitset = new BitSet(0);
+        bitset.words = structuredClone(this.words);
+        bitset.wordsInUse = this.wordsInUse;
+        bitset.checkInvariants();
+        return bitset;
+    }
+    expandTo(wordIndex) {
+        const wordsRequired = wordIndex + 1;
+        if (this.wordsInUse < wordsRequired) {
+            this.ensureCapacity(wordsRequired);
+            this.wordsInUse = wordsRequired;
+        }
+    }
+    ensureCapacity(wordsRequired) {
+        if (wordsRequired > this.words.length) {
+            // Allocate larger of doubled size or required size
+            const request = Math.max(2 * this.words.length, wordsRequired);
+            const newWords = new BigUint64Array(request);
+            newWords.set(this.words);
+            this.words = newWords;
+        }
+    }
+    recalculateWordsInUse() {
+        let i = this.wordsInUse - 1;
+        while (i >= 0 && this.words[i] === 0n)
+            i--;
+        this.wordsInUse = i + 1; // The new logical size
+    }
+    checkInvariants() {
+        (0, node_assert_1.default)(this.wordsInUse === 0 || this.words[this.wordsInUse - 1] !== 0n);
+        (0, node_assert_1.default)(this.wordsInUse >= 0 && this.wordsInUse <= this.words.length);
+        (0, node_assert_1.default)(this.wordsInUse === this.words.length || this.words[this.wordsInUse] === 0n);
+    }
+    toByteArray() {
+        const n = this.wordsInUse;
+        if (n == 0)
+            return [];
+        const bytes = [];
+        for (const word of this.words) {
+            let coppiedWord = structuredClone(word);
+            // Slice a 64-bit (or 8-byte word) into 8 8-bit (or 1-byte) slices
+            for (let i = 0; i < 8; i++) {
+                bytes.push(Number(coppiedWord & 0xffn));
+                coppiedWord >>= 8n;
+            }
+        }
+        while (bytes.length > 0 && bytes.at(-1) === 0)
+            bytes.pop();
+        return bytes;
+    }
+    flip(bitIndex) {
+        if (bitIndex < 0)
+            throw new error_1.UnexpectedValue("value of bitIndex", bitIndex.toString(), "non-negative number");
+        const wordIndex = BitSet.wordIndex(bitIndex);
+        this.expandTo(wordIndex);
+        this.words[wordIndex] ^= BigInt(BitSet.bitIndexInWord(bitIndex));
+        this.recalculateWordsInUse();
+        this.checkInvariants();
+    }
+    set(bitIndex) {
+        if (bitIndex < 0)
+            throw new error_1.UnexpectedValue("value of bitIndex", bitIndex.toString(), "non-negative number");
+        const wordIndex = BitSet.wordIndex(bitIndex);
+        this.expandTo(wordIndex);
+        this.words[wordIndex] |= 1n << BigInt(BitSet.bitIndexInWord(bitIndex)); // Restores invariants
+        this.checkInvariants();
+    }
+    setRange(fromIndex, toIndex) {
+        BitSet.checkRange(fromIndex, toIndex);
+        if (fromIndex == toIndex)
+            return;
+        // Increase capacity if necessary
+        const startWordIndex = BitSet.wordIndex(fromIndex);
+        const endWordIndex = BitSet.wordIndex(toIndex - 1);
+        this.expandTo(endWordIndex);
+        const fromBit = BitSet.bitIndexInWord(fromIndex), toBitInclusive = BitSet.bitIndexInWord(toIndex - 1) + 1, 
+        /**
+         * The NOT (~) bitwise meaning:
+         *
+         * Let say we want to set 2 to 6:
+         * ```
+         * 110010100
+         *    ^   ^
+         *    |   +-- this is the 2nd bit
+         *  and this is the 6th bit
+         * ```
+         *
+         * So we call lowBits(2) and it return `...0011`
+         *
+         * Then we have to flip it to `...1100` to access the '2nd bit and the bits after it'
+         */
+        firstWordMask = ~BitSet.lowBits(fromBit), lastWordMask = BitSet.lowBits(toBitInclusive);
+        if (startWordIndex == endWordIndex) {
+            // Case 1: One word
+            this.words[startWordIndex] |= (firstWordMask & lastWordMask);
+        }
+        else {
+            // Case 2: Multiple words
+            // Handle first word
+            this.words[startWordIndex] |= firstWordMask;
+            // Handle intermediate words, if any
+            for (let i = startWordIndex + 1; i < endWordIndex; i++)
+                this.words[i] = BitSet.WORD_MASK;
+            // Handle last word (restores invariants)
+            this.words[endWordIndex] |= lastWordMask;
+        }
+        this.checkInvariants();
+    }
+    clear(bitIndex) {
+        if (bitIndex < 0)
+            throw new error_1.UnexpectedValue("value of bitIndex", bitIndex.toString(), "non-negative number");
+        const wordIndex = BitSet.wordIndex(bitIndex);
+        if (wordIndex >= this.wordsInUse)
+            return;
+        this.words[wordIndex] &= ~(1n << BigInt(bitIndex));
+        this.recalculateWordsInUse();
+        this.checkInvariants();
+    }
+    clearRange(fromIndex, toIndex) {
+        BitSet.checkRange(fromIndex, toIndex);
+        if (fromIndex == toIndex)
+            return;
+        const startWordIndex = BitSet.wordIndex(fromIndex);
+        if (startWordIndex >= this.wordsInUse)
+            return;
+        let endWordIndex = BitSet.wordIndex(toIndex - 1);
+        if (endWordIndex >= this.wordsInUse) {
+            toIndex = this.length();
+            endWordIndex = this.wordsInUse - 1;
+        }
+        const fromBit = BitSet.bitIndexInWord(fromIndex), toBitInclusive = BitSet.bitIndexInWord(toIndex - 1) + 1, 
+        /**
+         * See the explaination in the setRange function
+         */
+        firstWordMask = ~BitSet.lowBits(fromBit), lastWordMask = BitSet.lowBits(toBitInclusive);
+        if (startWordIndex == endWordIndex) {
+            // Case 1: One word
+            this.words[startWordIndex] &= ~(firstWordMask & lastWordMask);
+        }
+        else {
+            // Case 2: Multiple words
+            // Handle first word
+            this.words[startWordIndex] &= ~firstWordMask;
+            // Handle intermediate words, if any
+            for (let i = startWordIndex + 1; i < endWordIndex; i++)
+                this.words[i] = 0n;
+            // Handle last word
+            this.words[endWordIndex] &= ~lastWordMask;
+        }
+        this.recalculateWordsInUse();
+        this.checkInvariants();
+    }
+    get(bitIndex) {
+        if (bitIndex < 0)
+            throw new error_1.UnexpectedValue("value of bitIndex", bitIndex.toString(), "non-negative number");
+        this.checkInvariants();
+        const wordIndex = BitSet.wordIndex(bitIndex);
+        if (wordIndex >= this.wordsInUse)
+            return false;
+        const bit = 1n << BigInt(BitSet.bitIndexInWord(bitIndex));
+        return (Number(this.words[wordIndex] & bit) != 0);
+    }
+    nextSetBit(fromIndex) {
+        if (fromIndex < 0)
+            throw new error_1.UnexpectedValue("value of fromIndex", fromIndex.toString(), "non-negative number");
+        this.checkInvariants();
+        let u = BitSet.wordIndex(fromIndex);
+        if (u >= this.wordsInUse)
+            return -1;
+        let word = this.words[u] & (~0n << BigInt(BitSet.bitIndexInWord(fromIndex)));
+        while (true) {
+            if (word != 0n)
+                return (u * BitSet.BITS_PER_WORD) + (0, math_1.numberOfTrailingZeros)(word);
+            if (++u == this.wordsInUse)
+                return -1;
+            word = this.words[u];
+        }
+    }
     nextClearBit(fromIndex) {
-        fromIndex = fromIndex || 0;
-        const data = this['data'];
-        let wordIndex = fromIndex >>> 5;
-        if (wordIndex >= data.length) {
-            // Past the stored words — depends on the infinite tail bit
-            return this['_'] === 0 ? fromIndex : Infinity;
-        }
-        // ~word marks clear bits; mask off anything before fromIndex.
-        // JS's << only uses the low 5 bits of the shift amount, so
-        // `-1 << fromIndex` masks correctly even when fromIndex > 31.
-        let word = ~data[wordIndex] & (-1 << fromIndex);
+        // Neither spec nor implementation handle bitsets of maximal length.
+        // See 4816253.
+        if (fromIndex < 0)
+            throw new error_1.UnexpectedValue("value of fromIndex", fromIndex.toString(), "non-negative number");
+        this.checkInvariants();
+        let u = BitSet.wordIndex(fromIndex);
+        if (u >= this.wordsInUse)
+            return fromIndex;
+        let word = ~this.words[u] & (BitSet.WORD_MASK << BigInt(fromIndex));
         while (true) {
-            if (word !== 0) {
-                const lowestSet = word & -word; // isolate lowest set bit
-                let c = 0;
-                for (let v = lowestSet; (v >>>= 1); c++) {
-                    //
-                }
-                return wordIndex * 32 + c;
-            }
-            wordIndex++;
-            if (wordIndex >= data.length) {
-                return this['_'] === 0 ? wordIndex * 32 : Infinity;
-            }
-            word = ~data[wordIndex];
+            if (word != 0n)
+                return (u * BitSet.BITS_PER_WORD) + (0, math_1.numberOfTrailingZeros)(word);
+            if (++u == this.wordsInUse)
+                return this.wordsInUse * BitSet.BITS_PER_WORD;
+            word = ~this.words[u];
         }
     }
-    ;
-    clone() {
-        return new BitSet(this.toString());
+    length() {
+        if (this.wordsInUse == 0)
+            return 0;
+        return BitSet.BITS_PER_WORD * (this.wordsInUse - 1) +
+            (BitSet.BITS_PER_WORD - (0, math_1.numberOfLeadingZeros)(this.words[this.wordsInUse - 1]));
+    }
+    isEmpty() {
+        return this.wordsInUse == 0;
     }
 }
 exports.BitSet = BitSet;
+exports.default = BitSet;
 //# sourceMappingURL=bitset.js.map

package/dist/base/bitset.js.map

@@ -1 +1 @@
-{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../src/base/bitset.ts"],"names":[],"mappings":";;;;;;AAAA,oDAA6B;AAE7B;;GAEG;AACH,YAAoB,SAAQ,gBAAO;IACxB,YAAY,CAAC,SAAiB;QACjC,SAAS,GAAG,SAAS,IAAI,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAI,IAAY,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,SAAS,KAAK,CAAC,CAAC;QAEhC,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,2DAA2D;YAC3D,OAAQ,IAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC3D,CAAC;QAED,8DAA8D;QAC9D,2DAA2D;QAC3D,8DAA8D;QAC9D,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;QAEhD,OAAO,IAAI,EAAE,CAAC;YACV,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACb,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAG,yBAAyB;gBAC3D,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,EAAE;gBACN,CAAC;gBACD,OAAO,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,CAAC;YACD,SAAS,EAAE,CAAC;YACZ,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC3B,OAAQ,IAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YAChE,CAAC;YACD,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAAA,CAAC;IAEc,KAAK;QACjB,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACvC,CAAC;CACJ"}
+{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../src/base/bitset.ts"],"names":[],"mappings":";;;;;;AAAA,8DAAiC;AACjC,mCAA0C;AAC1C,iCAAqE;AAGrE;;;;;GAKG;AACH;IACW,MAAM,CAAU,qBAAqB,GAAG,CAAC,CAAC;IAC1C,MAAM,CAAU,aAAa,GAAG,CAAC,IAAI,IAAI,CAAC,qBAAqB,CAAC;IAChE,MAAM,CAAU,SAAS,GAAG,mBAAmB,CAAC;IAEhD,KAAK,CAAiB;IACtB,UAAU,GAAW,CAAC,CAAC;IAEtB,MAAM,CAAC,SAAS,CAAC,QAAgB;QACrC,OAAO,QAAQ,IAAI,IAAI,CAAC,qBAAqB,CAAC;IAClD,CAAC;IAEO,MAAM,CAAC,cAAc,CAAC,QAAgB;QAC1C,OAAO,QAAQ,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,0BAA0B;IAC1E,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,OAAO,CAAC,KAAa;QAChC,OAAO,CAAC,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;IACtC,CAAC;IAEO,SAAS,CAAC,KAAa;QAC3B,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,SAAiB,EAAE,OAAe;QACxD,IAAI,SAAS,GAAG,CAAC;YACb,MAAM,IAAI,uBAAe,CAAC,oBAAoB,EAAE,SAAS,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QACjG,IAAI,OAAO,GAAG,CAAC;YACX,MAAM,IAAI,uBAAe,CAAC,kBAAkB,EAAE,OAAO,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAC7F,IAAI,SAAS,GAAG,OAAO;YACnB,MAAM,IAAI,uBAAe,CAAC,uBAAuB,EAAE,aAAa,SAAS,aAAa,OAAO,EAAE,EAAE,0CAA0C,CAAC,CAAC;IACrJ,CAAC;IAGD,YAAY,KAAc;QACtB,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC;YAClB,MAAM,IAAI,uBAAe,CAAC,kBAAkB,EAAE,KAAK,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAC3F,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC;IAC/D,CAAC;IAEM,KAAK;QACR,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACpC,MAAM,CAAC,eAAe,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,QAAQ,CAAC,SAAiB;QAC9B,MAAM,aAAa,GAAG,SAAS,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,UAAU,GAAG,aAAa,EAAE,CAAC;YAClC,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACnC,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC;QACpC,CAAC;IACL,CAAC;IAEO,cAAc,CAAC,aAAqB;QACxC,IAAI,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACpC,mDAAmD;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,IAAI,cAAc,CAAC,OAAO,CAAC,CAAC;YAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QAC1B,CAAC;IACL,CAAC;IAEO,qBAAqB;QACzB,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE;YAAE,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,uBAAuB;IACpD,CAAC;IAEO,eAAe;QACnB,IAAA,qBAAM,EAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACxE,IAAA,qBAAM,EAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrE,IAAA,qBAAM,EAAC,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IACxF,CAAC;IAGM,WAAW;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC;YACN,OAAO,EAAE,CAAC;QAEd,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,IAAI,WAAW,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACxC,kEAAkE;YAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC;gBACxC,WAAW,KAAK,EAAE,CAAC;YACvB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,GAAG,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACjB,CAAC;IAEM,IAAI,CAAC,QAAgB;QACxB,IAAI,QAAQ,GAAG,CAAC;YACZ,MAAM,IAAI,uBAAe,CAAC,mBAAmB,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAE/F,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAEzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAE,IAAI,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;QAElE,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,eAAe,EAAE,CAAC;IAC3B,CAAC;IAEM,GAAG,CAAC,QAAgB;QACvB,IAAI,QAAQ,GAAG,CAAC;YACZ,MAAM,IAAI,uBAAe,CAAC,mBAAmB,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAE/F,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAEzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAE,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,sBAAsB;QAE/F,IAAI,CAAC,eAAe,EAAE,CAAC;IAC3B,CAAC;IACM,QAAQ,CAAC,SAAiB,EAAE,OAAe;QAC9C,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAEtC,IAAI,SAAS,IAAI,OAAO;YACpB,OAAO;QAEX,iCAAiC;QACjC,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAE5B,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,EAC5C,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;QAEvD;;;;;;;;;;;;;;WAcG;QACH,aAAa,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EACxC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAClD,IAAI,cAAc,IAAI,YAAY,EAAE,CAAC;YACjC,mBAAmB;YACnB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACJ,yBAAyB;YACzB,oBAAoB;YACpB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,IAAI,aAAa,CAAC;YAE7C,oCAAoC;YACpC,KAAK,IAAI,CAAC,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;gBAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;YAErC,yCAAyC;YACzC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAE,IAAI,YAAY,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,eAAe,EAAE,CAAC;IAC3B,CAAC;IAGM,KAAK,CAAC,QAAgB;QACzB,IAAI,QAAQ,GAAG,CAAC;YACZ,MAAM,IAAI,uBAAe,CAAC,mBAAmB,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAE/F,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,SAAS,IAAI,IAAI,CAAC,UAAU;YAC5B,OAAO;QAEX,IAAI,CAAC,KAAK,CAAC,SAAS,CAAE,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAEpD,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,eAAe,EAAE,CAAC;IAC3B,CAAC;IACM,UAAU,CAAC,SAAiB,EAAE,OAAe;QAChD,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAEtC,IAAI,SAAS,IAAI,OAAO;YACpB,OAAO;QAEX,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACnD,IAAI,cAAc,IAAI,IAAI,CAAC,UAAU;YACjC,OAAO;QAEX,IAAI,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,YAAY,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACxB,YAAY,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,EAC5C,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;QACvD;;WAEG;QACH,aAAa,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EACxC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAClD,IAAI,cAAc,IAAI,YAAY,EAAE,CAAC;YACjC,mBAAmB;YACnB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,IAAI,CAAC,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC;QACnE,CAAC;aAAM,CAAC;YACJ,yBAAyB;YACzB,oBAAoB;YACpB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAE,IAAI,CAAC,aAAa,CAAC;YAE9C,oCAAoC;YACpC,KAAK,IAAI,CAAC,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;gBAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC;YAExB,mBAAmB;YACnB,IAAI,CAAC,KAAK,CAAC,YAAY,CAAE,IAAI,CAAC,YAAY,CAAC;QAC/C,CAAC;QAED,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,eAAe,EAAE,CAAC;IAC3B,CAAC;IAGM,GAAG,CAAC,QAAgB;QACvB,IAAI,QAAQ,GAAG,CAAC;YACZ,MAAM,IAAI,uBAAe,CAAC,mBAAmB,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAE/F,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,SAAS,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC;QAE/C,MAAM,GAAG,GAAG,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAEM,UAAU,CAAC,SAAiB;QAC/B,IAAI,SAAS,GAAG,CAAC;YACb,MAAM,IAAI,uBAAe,CAAC,oBAAoB,EAAE,SAAS,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAEjG,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU;YACpB,OAAO,CAAC,CAAC,CAAC;QAEd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAE9E,OAAO,IAAI,EAAE,CAAC;YACV,IAAI,IAAI,IAAI,EAAE;gBACV,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,IAAA,4BAAqB,EAAC,IAAI,CAAC,CAAC;YACpE,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,UAAU;gBACtB,OAAO,CAAC,CAAC,CAAC;YACd,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;QAC1B,CAAC;IACL,CAAC;IAEM,YAAY,CAAC,SAAiB;QACjC,oEAAoE;QACpE,eAAe;QACf,IAAI,SAAS,GAAG,CAAC;YACb,MAAM,IAAI,uBAAe,CAAC,oBAAoB,EAAE,SAAS,CAAC,QAAQ,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAEjG,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU;YACpB,OAAO,SAAS,CAAC;QAErB,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAErE,OAAO,IAAI,EAAE,CAAC;YACV,IAAI,IAAI,IAAI,EAAE;gBACV,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,IAAA,4BAAqB,EAAC,IAAI,CAAC,CAAC;YACpE,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,UAAU;gBACtB,OAAO,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC;YAClD,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;QAC3B,CAAC;IACL,CAAC;IAEM,MAAM;QACT,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC;YACpB,OAAO,CAAC,CAAC;QAEb,OAAO,MAAM,CAAC,aAAa,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;YAC/C,CAAC,MAAM,CAAC,aAAa,GAAG,IAAA,2BAAoB,EAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;IACxF,CAAC;IAEM,OAAO;QACV,OAAO,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;IAChC,CAAC;CACJ;;kBAEc,MAAM"}

package/dist/base/cache.d.ts

@@ -0,0 +1,24 @@
+/**
+ * The base implementation for the Cache class
+ */
+export declare abstract class CacheImplementation<T = any> {
+    abstract put(key: string, item: T): void;
+    abstract get(key: string): T | undefined;
+    abstract del(key: string): void;
+}
+/**
+ * The LRU cache implementation.
+ *
+ * @see https://en.wikipedia.org/wiki/Cache_replacement_policies#Time-Aware,_Least_Recently_Used_(TLRU)
+ */
+export declare class LRUCache<T> extends CacheImplementation<T> {
+    private capacity;
+    private hash;
+    private list;
+    constructor(capacity: number);
+    put(key: string, item: T): void;
+    get(key: string): T | undefined;
+    del(key: string): void;
+    private truncateHash;
+}
+//# sourceMappingURL=cache.d.ts.map

package/dist/base/cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.d.ts","sourceRoot":"","sources":["../../src/base/cache.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,8BAAsB,mBAAmB,CAAC,CAAC,GAAG,GAAG;IAC7C,SAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IAChD,SAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;IAChD,SAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1C;AAED;;;;GAIG;AACH,qBAAa,QAAQ,CAAC,CAAC,CAAE,SAAQ,mBAAmB,CAAC,CAAC,CAAC;IAIvC,OAAO,CAAC,QAAQ;IAH5B,OAAO,CAAC,IAAI,CAA6B;IACzC,OAAO,CAAC,IAAI,CAAgB;IAE5B,YAAoB,QAAQ,EAAE,MAAM,EAEnC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAWrC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,iBAUrB;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAK5B;IAED,OAAO,CAAC,YAAY;CAOvB"}

package/dist/base/cache.js

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LRUCache = exports.CacheImplementation = void 0;
+/**
+ * The base implementation for the Cache class
+ */
+class CacheImplementation {
+}
+exports.CacheImplementation = CacheImplementation;
+/**
+ * The LRU cache implementation.
+ *
+ * @see https://en.wikipedia.org/wiki/Cache_replacement_policies#Time-Aware,_Least_Recently_Used_(TLRU)
+ */
+class LRUCache extends CacheImplementation {
+    capacity;
+    hash = new Map();
+    list = [];
+    constructor(capacity) {
+        super();
+        this.capacity = capacity;
+    }
+    put(key, item) {
+        if (this.hash.has(key)) {
+            const oldIndex = this.list.indexOf(key);
+            if (oldIndex > -1)
+                this.list.splice(oldIndex, 1);
+        }
+        this.hash.set(key, item);
+        this.list.push(key);
+        this.truncateHash();
+    }
+    get(key) {
+        if (!this.hash.has(key))
+            return undefined;
+        const item = this.hash.get(key);
+        const oldIndex = this.list.indexOf(key);
+        if (oldIndex > -1)
+            this.list.splice(oldIndex, 1);
+        this.list.push(key);
+        return item;
+    }
+    del(key) {
+        const oldIndex = this.list.indexOf(key);
+        if (oldIndex > -1)
+            this.list.splice(oldIndex, 1);
+        this.hash.delete(key);
+    }
+    truncateHash() {
+        while (this.list.length > this.capacity) {
+            const popping = this.list.pop();
+            if (popping)
+                this.hash.delete(popping);
+        }
+    }
+}
+exports.LRUCache = LRUCache;
+//# sourceMappingURL=cache.js.map

package/dist/base/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/base/cache.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH;CAIC;;AAED;;;;GAIG;AACH,cAAyB,SAAQ,mBAAsB;IAI/B,QAAQ;IAHpB,IAAI,GAAmB,IAAI,GAAG,EAAE,CAAC;IACjC,IAAI,GAAa,EAAE,CAAC;IAE5B,YAAoB,QAAgB;QAChC,KAAK,EAAE,CAAC;wBADQ,QAAQ;IAE5B,CAAC;IAEM,GAAG,CAAC,GAAW,EAAE,IAAO;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEpB,IAAI,CAAC,YAAY,EAAE,CAAC;IACxB,CAAC;IAEM,GAAG,CAAC,GAAW;QAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QAE1C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEpB,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,GAAG,CAAC,GAAW;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEO,YAAY;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,OAAO;gBACP,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;IACL,CAAC;CACJ"}

package/dist/base/error.d.ts

@@ -80,6 +80,7 @@ export declare class AuthTokenExpired extends Error {
 export declare class MissingAuthOption extends Error {
     constructor();
 }
+/** @hidden */
 export declare class AuthRelatedNotFound extends Error {
     component: string;
     constructor(component: string);
@@ -122,11 +123,23 @@ export declare class MissingField extends Error {
 export declare class NotImplemented extends Error {
     constructor();
 }
+/** @hidden */
+export declare class SkippableNotImplemented extends Error {
+}
+/** @hidden */
 export declare class MessageLinkNotFound extends Error {
     senderUUID: string;
     constructor(senderUUID: string);
 }
+/** @hidden */
 export declare class HaveSignatureButNotIndex extends Error {
     constructor();
 }
+/**
+ * @hidden
+ */
+export declare class MessageTooLong extends Error {
+    message: string;
+    constructor(message: string);
+}
 //# sourceMappingURL=error.d.ts.map