@gitkraken/core-gitlens 0.5.116 → 0.7.0

package/dist/utils/lruMap.js

@@ -1,103 +1,99 @@
+//#region ../utils/src/lruMap.ts
 /**
- * Bounded LRU map. On `set` / `update`, the touched key becomes the
- * most-recently-used entry; on overflow, the least-recently-used key is
- * evicted until `size <= limit`. Built on a plain `Map`, exploiting that
- * `Map` preserves insertion order — re-inserting a key moves it to the end.
- *
- * Intentionally minimal — `get` / `set` / `delete` / `clear` / `size` /
- * `has` / `keys` / `values` / `update`. No expiry, no async, no events.
- * Callers that need invalidation rules layer them on top.
- *
- * `update(key, patch)` is a convenience for object-shaped values: merges
- * `patch` into the existing entry (or seeds a new one) and touches the key.
- * Use `set` for non-object values.
- */
-export class LruMap {
-    limit;
-    _map = new Map();
-    _pinned = new Set();
-    constructor(limit) {
-        this.limit = limit;
-    }
-    /**
-     * Pin a key so it's never evicted by capacity pressure (it can still be explicitly
-     * `delete`d / `clear`ed). Use for entries that must stay available regardless of how many
-     * other keys churn — e.g. the selected repo's WIP, which the header badge derives from.
-     * Pinning a key not yet present is fine; it takes effect once the key is `set`.
-     */
-    pin(key) {
-        this._pinned.add(key);
-    }
-    unpin(key) {
-        this._pinned.delete(key);
-    }
-    get size() {
-        return this._map.size;
-    }
-    get(key) {
-        return this._map.get(key);
-    }
-    has(key) {
-        return this._map.has(key);
-    }
-    set(key, value) {
-        // Re-insert to move the key to the end (most-recently-used).
-        this._map.delete(key);
-        this._map.set(key, value);
-        this.evict();
-        return this;
-    }
-    /**
-     * Merge `patch` into the existing entry (or seed a new entry from it) and
-     * touch the key. Returns the merged value. Object-shaped `V` only.
-     */
-    update(key, patch) {
-        const existing = this._map.get(key);
-        const next = { ...(existing ?? {}), ...patch };
-        this.set(key, next);
-        return next;
-    }
-    /**
-     * Promote an existing entry to most-recently-used without changing its value.
-     * Returns `true` if the key was present (and therefore touched), `false` otherwise.
-     * Use on cache hits when you want subsequent eviction pressure to skip this entry.
-     */
-    touch(key) {
-        if (!this._map.has(key))
-            return false;
-        const value = this._map.get(key);
-        this._map.delete(key);
-        this._map.set(key, value);
-        return true;
-    }
-    delete(key) {
-        return this._map.delete(key);
-    }
-    clear() {
-        this._map.clear();
-        // Drop pins too — a cleared map has no entries to protect, and leaving stale pins would
-        // wrongly shield the NEXT value set under a previously-pinned key from eviction.
-        this._pinned.clear();
-    }
-    keys() {
-        return this._map.keys();
-    }
-    values() {
-        return this._map.values();
-    }
-    evict() {
-        if (this._map.size <= this.limit)
-            return;
-        // Iterate oldest-first, deleting the first non-pinned keys until back at capacity.
-        // Pinned keys are skipped — if everything is pinned the map can exceed `limit`, which
-        // is the intended trade-off (pins are deliberate and few).
-        for (const key of this._map.keys()) {
-            if (this._map.size <= this.limit)
-                break;
-            if (this._pinned.has(key))
-                continue;
-            this._map.delete(key);
-        }
-    }
-}
+* Bounded LRU map. On `set` / `update`, the touched key becomes the
+* most-recently-used entry; on overflow, the least-recently-used key is
+* evicted until `size <= limit`. Built on a plain `Map`, exploiting that
+* `Map` preserves insertion order — re-inserting a key moves it to the end.
+*
+* Intentionally minimal — `get` / `set` / `delete` / `clear` / `size` /
+* `has` / `keys` / `values` / `update`. No expiry, no async, no events.
+* Callers that need invalidation rules layer them on top.
+*
+* `update(key, patch)` is a convenience for object-shaped values: merges
+* `patch` into the existing entry (or seeds a new one) and touches the key.
+* Use `set` for non-object values.
+*/
+var LruMap = class {
+	limit;
+	_map = /* @__PURE__ */ new Map();
+	_pinned = /* @__PURE__ */ new Set();
+	constructor(limit) {
+		this.limit = limit;
+	}
+	/**
+	* Pin a key so it's never evicted by capacity pressure (it can still be explicitly
+	* `delete`d / `clear`ed). Use for entries that must stay available regardless of how many
+	* other keys churn — e.g. the selected repo's WIP, which the header badge derives from.
+	* Pinning a key not yet present is fine; it takes effect once the key is `set`.
+	*/
+	pin(key) {
+		this._pinned.add(key);
+	}
+	unpin(key) {
+		this._pinned.delete(key);
+	}
+	get size() {
+		return this._map.size;
+	}
+	get(key) {
+		return this._map.get(key);
+	}
+	has(key) {
+		return this._map.has(key);
+	}
+	set(key, value) {
+		this._map.delete(key);
+		this._map.set(key, value);
+		this.evict();
+		return this;
+	}
+	/**
+	* Merge `patch` into the existing entry (or seed a new entry from it) and
+	* touch the key. Returns the merged value. Object-shaped `V` only.
+	*/
+	update(key, patch) {
+		const next = {
+			...this._map.get(key) ?? {},
+			...patch
+		};
+		this.set(key, next);
+		return next;
+	}
+	/**
+	* Promote an existing entry to most-recently-used without changing its value.
+	* Returns `true` if the key was present (and therefore touched), `false` otherwise.
+	* Use on cache hits when you want subsequent eviction pressure to skip this entry.
+	*/
+	touch(key) {
+		if (!this._map.has(key)) return false;
+		const value = this._map.get(key);
+		this._map.delete(key);
+		this._map.set(key, value);
+		return true;
+	}
+	delete(key) {
+		return this._map.delete(key);
+	}
+	clear() {
+		this._map.clear();
+		this._pinned.clear();
+	}
+	keys() {
+		return this._map.keys();
+	}
+	values() {
+		return this._map.values();
+	}
+	evict() {
+		if (this._map.size <= this.limit) return;
+		for (const key of this._map.keys()) {
+			if (this._map.size <= this.limit) break;
+			if (this._pinned.has(key)) continue;
+			this._map.delete(key);
+		}
+	}
+};
+//#endregion
+export { LruMap };
+
 //# sourceMappingURL=lruMap.js.map

package/dist/utils/lruMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"lruMap.js","sourceRoot":"","sources":["../../src/utils/lruMap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,MAAM;IAIW,KAAK;IAHjB,IAAI,GAAG,IAAI,GAAG,EAAQ,CAAC;IACvB,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;IAExC,YAA6B,KAAa;qBAAb,KAAK;IAAW,CAAC;IAE9C;;;;;OAKG;IACH,GAAG,CAAC,GAAM;QACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,CAAC,GAAM;QACX,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,GAAG,CAAC,GAAM;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAM;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QACnB,6DAA6D;QAC7D,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,GAAM,EAAE,KAAiB;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;QAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAS,CAAC,CAAC;QACzB,OAAO,IAAS,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAM;QACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,GAAM;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,wFAAwF;QACxF,iFAAiF;QACjF,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,IAAI;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACzB,CAAC;IAED,MAAM;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC3B,CAAC;IAEO,KAAK;QACZ,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QAEzC,mFAAmF;QACnF,sFAAsF;QACtF,2DAA2D;QAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;gBAAE,MAAM;YACxC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAEpC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACF,CAAC;CACD"}
+{"version":3,"file":"lruMap.js","names":[],"sources":["../../../utils/src/lruMap.ts"],"sourcesContent":["/**\n * Bounded LRU map. On `set` / `update`, the touched key becomes the\n * most-recently-used entry; on overflow, the least-recently-used key is\n * evicted until `size <= limit`. Built on a plain `Map`, exploiting that\n * `Map` preserves insertion order — re-inserting a key moves it to the end.\n *\n * Intentionally minimal — `get` / `set` / `delete` / `clear` / `size` /\n * `has` / `keys` / `values` / `update`. No expiry, no async, no events.\n * Callers that need invalidation rules layer them on top.\n *\n * `update(key, patch)` is a convenience for object-shaped values: merges\n * `patch` into the existing entry (or seeds a new one) and touches the key.\n * Use `set` for non-object values.\n */\nexport class LruMap<K, V> {\n\tprivate readonly _map = new Map<K, V>();\n\tprivate readonly _pinned = new Set<K>();\n\n\tconstructor(private readonly limit: number) {}\n\n\t/**\n\t * Pin a key so it's never evicted by capacity pressure (it can still be explicitly\n\t * `delete`d / `clear`ed). Use for entries that must stay available regardless of how many\n\t * other keys churn — e.g. the selected repo's WIP, which the header badge derives from.\n\t * Pinning a key not yet present is fine; it takes effect once the key is `set`.\n\t */\n\tpin(key: K): void {\n\t\tthis._pinned.add(key);\n\t}\n\n\tunpin(key: K): void {\n\t\tthis._pinned.delete(key);\n\t}\n\n\tget size(): number {\n\t\treturn this._map.size;\n\t}\n\n\tget(key: K): V | undefined {\n\t\treturn this._map.get(key);\n\t}\n\n\thas(key: K): boolean {\n\t\treturn this._map.has(key);\n\t}\n\n\tset(key: K, value: V): this {\n\t\t// Re-insert to move the key to the end (most-recently-used).\n\t\tthis._map.delete(key);\n\t\tthis._map.set(key, value);\n\t\tthis.evict();\n\t\treturn this;\n\t}\n\n\t/**\n\t * Merge `patch` into the existing entry (or seed a new entry from it) and\n\t * touch the key. Returns the merged value. Object-shaped `V` only.\n\t */\n\tupdate(key: K, patch: Partial<V>): V {\n\t\tconst existing = this._map.get(key);\n\t\tconst next = { ...(existing ?? {}), ...patch };\n\t\tthis.set(key, next as V);\n\t\treturn next as V;\n\t}\n\n\t/**\n\t * Promote an existing entry to most-recently-used without changing its value.\n\t * Returns `true` if the key was present (and therefore touched), `false` otherwise.\n\t * Use on cache hits when you want subsequent eviction pressure to skip this entry.\n\t */\n\ttouch(key: K): boolean {\n\t\tif (!this._map.has(key)) return false;\n\n\t\tconst value = this._map.get(key) as V;\n\t\tthis._map.delete(key);\n\t\tthis._map.set(key, value);\n\t\treturn true;\n\t}\n\n\tdelete(key: K): boolean {\n\t\treturn this._map.delete(key);\n\t}\n\n\tclear(): void {\n\t\tthis._map.clear();\n\t\t// Drop pins too — a cleared map has no entries to protect, and leaving stale pins would\n\t\t// wrongly shield the NEXT value set under a previously-pinned key from eviction.\n\t\tthis._pinned.clear();\n\t}\n\n\tkeys(): IterableIterator<K> {\n\t\treturn this._map.keys();\n\t}\n\n\tvalues(): IterableIterator<V> {\n\t\treturn this._map.values();\n\t}\n\n\tprivate evict(): void {\n\t\tif (this._map.size <= this.limit) return;\n\n\t\t// Iterate oldest-first, deleting the first non-pinned keys until back at capacity.\n\t\t// Pinned keys are skipped — if everything is pinned the map can exceed `limit`, which\n\t\t// is the intended trade-off (pins are deliberate and few).\n\t\tfor (const key of this._map.keys()) {\n\t\t\tif (this._map.size <= this.limit) break;\n\t\t\tif (this._pinned.has(key)) continue;\n\n\t\t\tthis._map.delete(key);\n\t\t}\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,IAAa,SAAb,MAA0B;CAII;CAH7B,uBAAwB,IAAI,IAAU;CACtC,0BAA2B,IAAI,IAAO;CAEtC,YAAY,OAAgC;EAAf,KAAA,QAAA;CAAgB;;;;;;;CAQ7C,IAAI,KAAc;EACjB,KAAK,QAAQ,IAAI,GAAG;CACrB;CAEA,MAAM,KAAc;EACnB,KAAK,QAAQ,OAAO,GAAG;CACxB;CAEA,IAAI,OAAe;EAClB,OAAO,KAAK,KAAK;CAClB;CAEA,IAAI,KAAuB;EAC1B,OAAO,KAAK,KAAK,IAAI,GAAG;CACzB;CAEA,IAAI,KAAiB;EACpB,OAAO,KAAK,KAAK,IAAI,GAAG;CACzB;CAEA,IAAI,KAAQ,OAAgB;EAE3B,KAAK,KAAK,OAAO,GAAG;EACpB,KAAK,KAAK,IAAI,KAAK,KAAK;EACxB,KAAK,MAAM;EACX,OAAO;CACR;;;;;CAMA,OAAO,KAAQ,OAAsB;EAEpC,MAAM,OAAO;GAAE,GADE,KAAK,KAAK,IAAI,GACL,KAAK,CAAC;GAAI,GAAG;EAAM;EAC7C,KAAK,IAAI,KAAK,IAAS;EACvB,OAAO;CACR;;;;;;CAOA,MAAM,KAAiB;EACtB,IAAI,CAAC,KAAK,KAAK,IAAI,GAAG,GAAG,OAAO;EAEhC,MAAM,QAAQ,KAAK,KAAK,IAAI,GAAG;EAC/B,KAAK,KAAK,OAAO,GAAG;EACpB,KAAK,KAAK,IAAI,KAAK,KAAK;EACxB,OAAO;CACR;CAEA,OAAO,KAAiB;EACvB,OAAO,KAAK,KAAK,OAAO,GAAG;CAC5B;CAEA,QAAc;EACb,KAAK,KAAK,MAAM;EAGhB,KAAK,QAAQ,MAAM;CACpB;CAEA,OAA4B;EAC3B,OAAO,KAAK,KAAK,KAAK;CACvB;CAEA,SAA8B;EAC7B,OAAO,KAAK,KAAK,OAAO;CACzB;CAEA,QAAsB;EACrB,IAAI,KAAK,KAAK,QAAQ,KAAK,OAAO;EAKlC,KAAK,MAAM,OAAO,KAAK,KAAK,KAAK,GAAG;GACnC,IAAI,KAAK,KAAK,QAAQ,KAAK,OAAO;GAClC,IAAI,KAAK,QAAQ,IAAI,GAAG,GAAG;GAE3B,KAAK,KAAK,OAAO,GAAG;EACrB;CACD;AACD"}

package/dist/utils/markdown.d.ts

@@ -1,9 +1,11 @@
+//#region ../utils/src/markdown.d.ts
 export declare function escapeMarkdown(s: string, options?: {
-    quoted?: boolean;
-    inlineBackticks?: boolean;
-    preserveLinks?: boolean;
+  quoted?: boolean;
+  inlineBackticks?: boolean;
+  preserveLinks?: boolean;
 }): string;
 /** escapes markdown code blocks */
 export declare function escapeMarkdownCodeBlocks(s: string): string;
 export declare function unescapeMarkdown(s: string): string;
+//#endregion
 //# sourceMappingURL=markdown.d.ts.map

package/dist/utils/markdown.js

@@ -1,100 +1,64 @@
+//#region ../utils/src/markdown.ts
 const escapeMarkdownRegex = /[\\*_{}[\]()#+\-.!<>]/g;
 const unescapeMarkdownRegex = /\\([\\`*_{}[\]()#+\-.!<>])/g;
-// Regex to find markdown links: [text](url) allowing for escaped brackets/parens within text/url
 const markdownLinkRegex = /(\[((?:\\.|[^[\]\\])+)\]\(((?:\\.|[^()\\])+)\))/g;
 const escapeMarkdownHeaderRegex = /^===/gm;
 const unescapeMarkdownHeaderRegex = /^\u200b===/gm;
-// const sampleMarkdown = '## message `not code` *not important* _no underline_ \n> don\'t quote me \n- don\'t list me \n+ don\'t list me \n1. don\'t list me \nnot h1 \n=== \nnot h2 \n---\n***\n---\n___';
 const markdownQuotedRegex = /\r?\n/g;
 const markdownBacktickRegex = /`/g;
-export function escapeMarkdown(s, options) {
-    // If preserving links, replace them with placeholders first
-    if (options?.preserveLinks) {
-        const links = new Map();
-        let linkIndex = 0;
-        s = s.replace(markdownLinkRegex, match => {
-            // Create a unique, unlikely-to-occur placeholder
-            const placeholder = `$$$GLLINK${linkIndex++}GLLINK$$$`;
-            links.set(placeholder, match);
-            return placeholder;
-        });
-        // Escape markdown characters
-        s = s.replace(escapeMarkdownRegex, '\\$&');
-        // Restore the original links if they were preserved
-        if (options?.preserveLinks && links.size) {
-            for (const [placeholder, originalLink] of links) {
-                s = s.replace(placeholder, originalLink);
-            }
-        }
-    }
-    else {
-        // Escape markdown characters
-        s = s.replace(escapeMarkdownRegex, '\\$&');
-    }
-    // Escape markdown header (since the above regex won't match it)
-    s = s.replace(escapeMarkdownHeaderRegex, '\u200b===');
-    if (options?.inlineBackticks) {
-        s = escapeMarkdownCodeBlocks(s);
-    }
-    else {
-        s = s.replace(markdownBacktickRegex, '\\$&');
-    }
-    if (!options?.quoted)
-        return s;
-    // Keep under the same block-quote but with line breaks
-    return s.trim().replace(markdownQuotedRegex, '\t\\\n>  ');
+function escapeMarkdown(s, options) {
+	if (options?.preserveLinks) {
+		const links = /* @__PURE__ */ new Map();
+		let linkIndex = 0;
+		s = s.replace(markdownLinkRegex, (match) => {
+			const placeholder = `$$$GLLINK${linkIndex++}GLLINK$$$`;
+			links.set(placeholder, match);
+			return placeholder;
+		});
+		s = s.replace(escapeMarkdownRegex, "\\$&");
+		if (options?.preserveLinks && links.size) for (const [placeholder, originalLink] of links) s = s.replace(placeholder, originalLink);
+	} else s = s.replace(escapeMarkdownRegex, "\\$&");
+	s = s.replace(escapeMarkdownHeaderRegex, "​===");
+	if (options?.inlineBackticks) s = escapeMarkdownCodeBlocks(s);
+	else s = s.replace(markdownBacktickRegex, "\\$&");
+	if (!options?.quoted) return s;
+	return s.trim().replace(markdownQuotedRegex, "	\\\n>  ");
 }
 /** escapes markdown code blocks */
-export function escapeMarkdownCodeBlocks(s) {
-    const tripleBackticks = '```';
-    const escapedTripleBackticks = '\\`\\`\\`';
-    let result = '';
-    let allowed = true;
-    let quotesOpened = false;
-    let buffer = '';
-    for (let i = 0; i < s.length; i += 1) {
-        const char = s[i];
-        const chain = s.substring(i, i + 3);
-        if (char === '\n' && quotesOpened) {
-            allowed = false;
-        }
-        if (chain === tripleBackticks) {
-            if (quotesOpened) {
-                quotesOpened = false;
-                if (allowed) {
-                    result += `${tripleBackticks}${buffer}${tripleBackticks}`;
-                }
-                else {
-                    result += `${escapedTripleBackticks}${buffer}${escapedTripleBackticks}`;
-                    allowed = true;
-                }
-                buffer = '';
-            }
-            else {
-                quotesOpened = true;
-            }
-            // skip chain
-            i += 2;
-            continue;
-        }
-        if (quotesOpened) {
-            buffer += char;
-        }
-        else {
-            result += char;
-        }
-    }
-    if (quotesOpened) {
-        // Handle unclosed code block
-        result += allowed ? tripleBackticks + buffer : escapedTripleBackticks + buffer;
-    }
-    return result;
+function escapeMarkdownCodeBlocks(s) {
+	const tripleBackticks = "```";
+	const escapedTripleBackticks = "\\`\\`\\`";
+	let result = "";
+	let allowed = true;
+	let quotesOpened = false;
+	let buffer = "";
+	for (let i = 0; i < s.length; i += 1) {
+		const char = s[i];
+		const chain = s.substring(i, i + 3);
+		if (char === "\n" && quotesOpened) allowed = false;
+		if (chain === tripleBackticks) {
+			if (quotesOpened) {
+				quotesOpened = false;
+				if (allowed) result += `${tripleBackticks}${buffer}${tripleBackticks}`;
+				else {
+					result += `${escapedTripleBackticks}${buffer}${escapedTripleBackticks}`;
+					allowed = true;
+				}
+				buffer = "";
+			} else quotesOpened = true;
+			i += 2;
+			continue;
+		}
+		if (quotesOpened) buffer += char;
+		else result += char;
+	}
+	if (quotesOpened) result += allowed ? tripleBackticks + buffer : escapedTripleBackticks + buffer;
+	return result;
 }
-export function unescapeMarkdown(s) {
-    return (s
-        // Unescape markdown
-        .replace(unescapeMarkdownRegex, '$1')
-        // Unescape markdown header
-        .replace(unescapeMarkdownHeaderRegex, '==='));
+function unescapeMarkdown(s) {
+	return s.replace(unescapeMarkdownRegex, "$1").replace(unescapeMarkdownHeaderRegex, "===");
 }
+//#endregion
+export { escapeMarkdown, escapeMarkdownCodeBlocks, unescapeMarkdown };
+
 //# sourceMappingURL=markdown.js.map

package/dist/utils/markdown.js.map

@@ -1 +1 @@
-{"version":3,"file":"markdown.js","sourceRoot":"","sources":["../../src/utils/markdown.ts"],"names":[],"mappings":"AAAA,MAAM,mBAAmB,GAAG,wBAAwB,CAAC;AACrD,MAAM,qBAAqB,GAAG,6BAA6B,CAAC;AAC5D,iGAAiG;AACjG,MAAM,iBAAiB,GAAG,kDAAkD,CAAC;AAE7E,MAAM,yBAAyB,GAAG,QAAQ,CAAC;AAC3C,MAAM,2BAA2B,GAAG,cAAc,CAAC;AAEnD,4MAA4M;AAC5M,MAAM,mBAAmB,GAAG,QAAQ,CAAC;AACrC,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC,MAAM,UAAU,cAAc,CAC7B,CAAS,EACT,OAAkF;IAElF,4DAA4D;IAC5D,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,KAAK,CAAC,EAAE;YACxC,iDAAiD;YACjD,MAAM,WAAW,GAAG,YAAY,SAAS,EAAE,WAAW,CAAC;YACvD,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;QACpB,CAAC,CAAC,CAAC;QAEH,6BAA6B;QAC7B,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,mBAAmB,EAAE,MAAM,CAAC,CAAC;QAE3C,oDAAoD;QACpD,IAAI,OAAO,EAAE,aAAa,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,IAAI,KAAK,EAAE,CAAC;gBACjD,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAC1C,CAAC;QACF,CAAC;IACF,CAAC;SAAM,CAAC;QACP,6BAA6B;QAC7B,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,mBAAmB,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED,gEAAgE;IAChE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,yBAAyB,EAAE,WAAW,CAAC,CAAC;IAEtD,IAAI,OAAO,EAAE,eAAe,EAAE,CAAC;QAC9B,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;SAAM,CAAC;QACP,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,OAAO,EAAE,MAAM;QAAE,OAAO,CAAC,CAAC;IAE/B,uDAAuD;IACvD,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,mBAAmB,EAAE,WAAW,CAAC,CAAC;AAC3D,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,wBAAwB,CAAC,CAAS;IACjD,MAAM,eAAe,GAAG,KAAK,CAAC;IAC9B,MAAM,sBAAsB,GAAG,WAAW,CAAC;IAE3C,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI,IAAI,YAAY,EAAE,CAAC;YACnC,OAAO,GAAG,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,KAAK,KAAK,eAAe,EAAE,CAAC;YAC/B,IAAI,YAAY,EAAE,CAAC;gBAClB,YAAY,GAAG,KAAK,CAAC;gBACrB,IAAI,OAAO,EAAE,CAAC;oBACb,MAAM,IAAI,GAAG,eAAe,GAAG,MAAM,GAAG,eAAe,EAAE,CAAC;gBAC3D,CAAC;qBAAM,CAAC;oBACP,MAAM,IAAI,GAAG,sBAAsB,GAAG,MAAM,GAAG,sBAAsB,EAAE,CAAC;oBACxE,OAAO,GAAG,IAAI,CAAC;gBAChB,CAAC;gBACD,MAAM,GAAG,EAAE,CAAC;YACb,CAAC;iBAAM,CAAC;gBACP,YAAY,GAAG,IAAI,CAAC;YACrB,CAAC;YACD,aAAa;YACb,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACV,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YAClB,MAAM,IAAI,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACP,MAAM,IAAI,IAAI,CAAC;QAChB,CAAC;IACF,CAAC;IAED,IAAI,YAAY,EAAE,CAAC;QAClB,6BAA6B;QAC7B,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,eAAe,GAAG,MAAM,CAAC,CAAC,CAAC,sBAAsB,GAAG,MAAM,CAAC;IAChF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAS;IACzC,OAAO,CACN,CAAC;QACA,oBAAoB;SACnB,OAAO,CAAC,qBAAqB,EAAE,IAAI,CAAC;QACrC,2BAA2B;SAC1B,OAAO,CAAC,2BAA2B,EAAE,KAAK,CAAC,CAC7C,CAAC;AACH,CAAC"}
+{"version":3,"file":"markdown.js","names":[],"sources":["../../../utils/src/markdown.ts"],"sourcesContent":["const escapeMarkdownRegex = /[\\\\*_{}[\\]()#+\\-.!<>]/g;\nconst unescapeMarkdownRegex = /\\\\([\\\\`*_{}[\\]()#+\\-.!<>])/g;\n// Regex to find markdown links: [text](url) allowing for escaped brackets/parens within text/url\nconst markdownLinkRegex = /(\\[((?:\\\\.|[^[\\]\\\\])+)\\]\\(((?:\\\\.|[^()\\\\])+)\\))/g;\n\nconst escapeMarkdownHeaderRegex = /^===/gm;\nconst unescapeMarkdownHeaderRegex = /^\\u200b===/gm;\n\n// const sampleMarkdown = '## message `not code` *not important* _no underline_ \\n> don\\'t quote me \\n- don\\'t list me \\n+ don\\'t list me \\n1. don\\'t list me \\nnot h1 \\n=== \\nnot h2 \\n---\\n***\\n---\\n___';\nconst markdownQuotedRegex = /\\r?\\n/g;\nconst markdownBacktickRegex = /`/g;\n\nexport function escapeMarkdown(\n\ts: string,\n\toptions?: { quoted?: boolean; inlineBackticks?: boolean; preserveLinks?: boolean },\n): string {\n\t// If preserving links, replace them with placeholders first\n\tif (options?.preserveLinks) {\n\t\tconst links = new Map<string, string>();\n\t\tlet linkIndex = 0;\n\n\t\ts = s.replace(markdownLinkRegex, match => {\n\t\t\t// Create a unique, unlikely-to-occur placeholder\n\t\t\tconst placeholder = `$$$GLLINK${linkIndex++}GLLINK$$$`;\n\t\t\tlinks.set(placeholder, match);\n\t\t\treturn placeholder;\n\t\t});\n\n\t\t// Escape markdown characters\n\t\ts = s.replace(escapeMarkdownRegex, '\\\\$&');\n\n\t\t// Restore the original links if they were preserved\n\t\tif (options?.preserveLinks && links.size) {\n\t\t\tfor (const [placeholder, originalLink] of links) {\n\t\t\t\ts = s.replace(placeholder, originalLink);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// Escape markdown characters\n\t\ts = s.replace(escapeMarkdownRegex, '\\\\$&');\n\t}\n\n\t// Escape markdown header (since the above regex won't match it)\n\ts = s.replace(escapeMarkdownHeaderRegex, '\\u200b===');\n\n\tif (options?.inlineBackticks) {\n\t\ts = escapeMarkdownCodeBlocks(s);\n\t} else {\n\t\ts = s.replace(markdownBacktickRegex, '\\\\$&');\n\t}\n\n\tif (!options?.quoted) return s;\n\n\t// Keep under the same block-quote but with line breaks\n\treturn s.trim().replace(markdownQuotedRegex, '\\t\\\\\\n>  ');\n}\n\n/** escapes markdown code blocks */\nexport function escapeMarkdownCodeBlocks(s: string): string {\n\tconst tripleBackticks = '```';\n\tconst escapedTripleBackticks = '\\\\`\\\\`\\\\`';\n\n\tlet result = '';\n\tlet allowed = true;\n\tlet quotesOpened = false;\n\tlet buffer = '';\n\n\tfor (let i = 0; i < s.length; i += 1) {\n\t\tconst char = s[i];\n\t\tconst chain = s.substring(i, i + 3);\n\t\tif (char === '\\n' && quotesOpened) {\n\t\t\tallowed = false;\n\t\t}\n\t\tif (chain === tripleBackticks) {\n\t\t\tif (quotesOpened) {\n\t\t\t\tquotesOpened = false;\n\t\t\t\tif (allowed) {\n\t\t\t\t\tresult += `${tripleBackticks}${buffer}${tripleBackticks}`;\n\t\t\t\t} else {\n\t\t\t\t\tresult += `${escapedTripleBackticks}${buffer}${escapedTripleBackticks}`;\n\t\t\t\t\tallowed = true;\n\t\t\t\t}\n\t\t\t\tbuffer = '';\n\t\t\t} else {\n\t\t\t\tquotesOpened = true;\n\t\t\t}\n\t\t\t// skip chain\n\t\t\ti += 2;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (quotesOpened) {\n\t\t\tbuffer += char;\n\t\t} else {\n\t\t\tresult += char;\n\t\t}\n\t}\n\n\tif (quotesOpened) {\n\t\t// Handle unclosed code block\n\t\tresult += allowed ? tripleBackticks + buffer : escapedTripleBackticks + buffer;\n\t}\n\n\treturn result;\n}\n\nexport function unescapeMarkdown(s: string): string {\n\treturn (\n\t\ts\n\t\t\t// Unescape markdown\n\t\t\t.replace(unescapeMarkdownRegex, '$1')\n\t\t\t// Unescape markdown header\n\t\t\t.replace(unescapeMarkdownHeaderRegex, '===')\n\t);\n}\n"],"mappings":";AAAA,MAAM,sBAAsB;AAC5B,MAAM,wBAAwB;AAE9B,MAAM,oBAAoB;AAE1B,MAAM,4BAA4B;AAClC,MAAM,8BAA8B;AAGpC,MAAM,sBAAsB;AAC5B,MAAM,wBAAwB;AAE9B,SAAgB,eACf,GACA,SACS;CAET,IAAI,SAAS,eAAe;EAC3B,MAAM,wBAAQ,IAAI,IAAoB;EACtC,IAAI,YAAY;EAEhB,IAAI,EAAE,QAAQ,oBAAmB,UAAS;GAEzC,MAAM,cAAc,YAAY,YAAY;GAC5C,MAAM,IAAI,aAAa,KAAK;GAC5B,OAAO;EACR,CAAC;EAGD,IAAI,EAAE,QAAQ,qBAAqB,MAAM;EAGzC,IAAI,SAAS,iBAAiB,MAAM,MACnC,KAAK,MAAM,CAAC,aAAa,iBAAiB,OACzC,IAAI,EAAE,QAAQ,aAAa,YAAY;CAG1C,OAEC,IAAI,EAAE,QAAQ,qBAAqB,MAAM;CAI1C,IAAI,EAAE,QAAQ,2BAA2B,MAAW;CAEpD,IAAI,SAAS,iBACZ,IAAI,yBAAyB,CAAC;MAE9B,IAAI,EAAE,QAAQ,uBAAuB,MAAM;CAG5C,IAAI,CAAC,SAAS,QAAQ,OAAO;CAG7B,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,qBAAqB,UAAW;AACzD;;AAGA,SAAgB,yBAAyB,GAAmB;CAC3D,MAAM,kBAAkB;CACxB,MAAM,yBAAyB;CAE/B,IAAI,SAAS;CACb,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,IAAI,SAAS;CAEb,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;EACrC,MAAM,OAAO,EAAE;EACf,MAAM,QAAQ,EAAE,UAAU,GAAG,IAAI,CAAC;EAClC,IAAI,SAAS,QAAQ,cACpB,UAAU;EAEX,IAAI,UAAU,iBAAiB;GAC9B,IAAI,cAAc;IACjB,eAAe;IACf,IAAI,SACH,UAAU,GAAG,kBAAkB,SAAS;SAClC;KACN,UAAU,GAAG,yBAAyB,SAAS;KAC/C,UAAU;IACX;IACA,SAAS;GACV,OACC,eAAe;GAGhB,KAAK;GACL;EACD;EAEA,IAAI,cACH,UAAU;OAEV,UAAU;CAEZ;CAEA,IAAI,cAEH,UAAU,UAAU,kBAAkB,SAAS,yBAAyB;CAGzE,OAAO;AACR;AAEA,SAAgB,iBAAiB,GAAmB;CACnD,OACC,EAEE,QAAQ,uBAAuB,IAAI,CAAC,CAEpC,QAAQ,6BAA6B,KAAK;AAE9C"}

package/dist/utils/mru.d.ts

@@ -1,14 +1,16 @@
+//#region ../utils/src/mru.d.ts
 export declare class MRU<T> {
-    readonly maxSize: number;
-    private readonly comparator?;
-    private stack;
-    constructor(maxSize?: number, comparator?: ((a: T, b: T) => boolean) | undefined);
-    get count(): number;
-    private _position;
-    get position(): number;
-    add(item: T): void;
-    get(position?: number): T | undefined;
-    insert(item: T): void;
-    navigate(direction: 'back' | 'forward'): T | undefined;
+  readonly maxSize: number;
+  private readonly comparator?;
+  private stack;
+  constructor(maxSize?: number, comparator?: ((a: T, b: T) => boolean) | undefined);
+  get count(): number;
+  private _position;
+  get position(): number;
+  add(item: T): void;
+  get(position?: number): T | undefined;
+  insert(item: T): void;
+  navigate(direction: 'back' | 'forward'): T | undefined;
 }
+//#endregion
 //# sourceMappingURL=mru.d.ts.map

package/dist/utils/mru.js

@@ -1,63 +1,58 @@
-export class MRU {
-    maxSize;
-    comparator;
-    stack = [];
-    constructor(maxSize = 10, comparator) {
-        this.maxSize = maxSize;
-        this.comparator = comparator;
-    }
-    get count() {
-        return this.stack.length;
-    }
-    _position = 0;
-    get position() {
-        return this._position;
-    }
-    add(item) {
-        if (this._position > 0) {
-            this.stack.splice(0, this._position);
-            this._position = 0;
-        }
-        const index = this.comparator != null ? this.stack.findIndex(i => this.comparator(item, i)) : this.stack.indexOf(item);
-        if (index !== -1) {
-            this.stack.splice(index, 1);
-        }
-        else if (this.stack.length === this.maxSize) {
-            this.stack.pop();
-        }
-        this.stack.unshift(item);
-        this._position = 0;
-    }
-    get(position) {
-        if (position != null) {
-            if (position < 0 || position >= this.stack.length)
-                return undefined;
-            return this.stack[position];
-        }
-        return this.stack.length > 0 ? this.stack[0] : undefined;
-    }
-    insert(item) {
-        if (this._position > 0) {
-            this.stack.splice(0, this._position);
-            this._position = 0;
-        }
-        this.stack.unshift(item);
-        this._position++;
-    }
-    navigate(direction) {
-        if (this.stack.length <= 1)
-            return undefined;
-        if (direction === 'back') {
-            if (this._position >= this.stack.length - 1)
-                return undefined;
-            this._position += 1;
-        }
-        else {
-            if (this._position <= 0)
-                return undefined;
-            this._position -= 1;
-        }
-        return this.stack[this._position];
-    }
-}
+//#region ../utils/src/mru.ts
+var MRU = class {
+	maxSize;
+	comparator;
+	stack = [];
+	constructor(maxSize = 10, comparator) {
+		this.maxSize = maxSize;
+		this.comparator = comparator;
+	}
+	get count() {
+		return this.stack.length;
+	}
+	_position = 0;
+	get position() {
+		return this._position;
+	}
+	add(item) {
+		if (this._position > 0) {
+			this.stack.splice(0, this._position);
+			this._position = 0;
+		}
+		const index = this.comparator != null ? this.stack.findIndex((i) => this.comparator(item, i)) : this.stack.indexOf(item);
+		if (index !== -1) this.stack.splice(index, 1);
+		else if (this.stack.length === this.maxSize) this.stack.pop();
+		this.stack.unshift(item);
+		this._position = 0;
+	}
+	get(position) {
+		if (position != null) {
+			if (position < 0 || position >= this.stack.length) return void 0;
+			return this.stack[position];
+		}
+		return this.stack.length > 0 ? this.stack[0] : void 0;
+	}
+	insert(item) {
+		if (this._position > 0) {
+			this.stack.splice(0, this._position);
+			this._position = 0;
+		}
+		this.stack.unshift(item);
+		this._position++;
+	}
+	navigate(direction) {
+		if (this.stack.length <= 1) return void 0;
+		if (direction === "back") {
+			if (this._position >= this.stack.length - 1) return void 0;
+			this._position += 1;
+		} else {
+			if (this._position <= 0) return void 0;
+			this._position -= 1;
+		}
+		return this.stack[this._position];
+	}
+};
+//#endregion
+export { MRU };
+
 //# sourceMappingURL=mru.js.map

package/dist/utils/mru.js.map

@@ -1 +1 @@
-{"version":3,"file":"mru.js","sourceRoot":"","sources":["../../src/utils/mru.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,GAAG;IAIE,OAAO;IACN,UAAU;IAJpB,KAAK,GAAQ,EAAE,CAAC;IAExB,YACiB,OAAO,GAAW,EAAE,EACnB,UAAoC;uBADrC,OAAO;0BACN,UAAU;IACzB,CAAC;IAEJ,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAEO,SAAS,GAAW,CAAC,CAAC;IAC9B,IAAI,QAAQ;QACX,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED,GAAG,CAAC,IAAO;QACV,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,KAAK,GACV,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3G,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,QAAiB;QACpB,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YACpE,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1D,CAAC;IAED,MAAM,CAAC,IAAO;QACb,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,SAA6B;QACrC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC;YAE9D,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACP,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC;gBAAE,OAAO,SAAS,CAAC;YAE1C,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;CACD"}
+{"version":3,"file":"mru.js","names":[],"sources":["../../../utils/src/mru.ts"],"sourcesContent":["export class MRU<T> {\n\tprivate stack: T[] = [];\n\n\tconstructor(\n\t\tpublic readonly maxSize: number = 10,\n\t\tprivate readonly comparator?: (a: T, b: T) => boolean,\n\t) {}\n\n\tget count(): number {\n\t\treturn this.stack.length;\n\t}\n\n\tprivate _position: number = 0;\n\tget position(): number {\n\t\treturn this._position;\n\t}\n\n\tadd(item: T): void {\n\t\tif (this._position > 0) {\n\t\t\tthis.stack.splice(0, this._position);\n\t\t\tthis._position = 0;\n\t\t}\n\n\t\tconst index =\n\t\t\tthis.comparator != null ? this.stack.findIndex(i => this.comparator!(item, i)) : this.stack.indexOf(item);\n\t\tif (index !== -1) {\n\t\t\tthis.stack.splice(index, 1);\n\t\t} else if (this.stack.length === this.maxSize) {\n\t\t\tthis.stack.pop();\n\t\t}\n\n\t\tthis.stack.unshift(item);\n\t\tthis._position = 0;\n\t}\n\n\tget(position?: number): T | undefined {\n\t\tif (position != null) {\n\t\t\tif (position < 0 || position >= this.stack.length) return undefined;\n\t\t\treturn this.stack[position];\n\t\t}\n\t\treturn this.stack.length > 0 ? this.stack[0] : undefined;\n\t}\n\n\tinsert(item: T): void {\n\t\tif (this._position > 0) {\n\t\t\tthis.stack.splice(0, this._position);\n\t\t\tthis._position = 0;\n\t\t}\n\t\tthis.stack.unshift(item);\n\t\tthis._position++;\n\t}\n\n\tnavigate(direction: 'back' | 'forward'): T | undefined {\n\t\tif (this.stack.length <= 1) return undefined;\n\n\t\tif (direction === 'back') {\n\t\t\tif (this._position >= this.stack.length - 1) return undefined;\n\n\t\t\tthis._position += 1;\n\t\t} else {\n\t\t\tif (this._position <= 0) return undefined;\n\n\t\t\tthis._position -= 1;\n\t\t}\n\n\t\treturn this.stack[this._position];\n\t}\n}\n"],"mappings":";AAAA,IAAa,MAAb,MAAoB;CAIF;CACC;CAJlB,QAAqB,CAAC;CAEtB,YACC,UAAkC,IAClC,YACC;EAFe,KAAA,UAAA;EACC,KAAA,aAAA;CACf;CAEH,IAAI,QAAgB;EACnB,OAAO,KAAK,MAAM;CACnB;CAEA,YAA4B;CAC5B,IAAI,WAAmB;EACtB,OAAO,KAAK;CACb;CAEA,IAAI,MAAe;EAClB,IAAI,KAAK,YAAY,GAAG;GACvB,KAAK,MAAM,OAAO,GAAG,KAAK,SAAS;GACnC,KAAK,YAAY;EAClB;EAEA,MAAM,QACL,KAAK,cAAc,OAAO,KAAK,MAAM,WAAU,MAAK,KAAK,WAAY,MAAM,CAAC,CAAC,IAAI,KAAK,MAAM,QAAQ,IAAI;EACzG,IAAI,UAAU,IACb,KAAK,MAAM,OAAO,OAAO,CAAC;OACpB,IAAI,KAAK,MAAM,WAAW,KAAK,SACrC,KAAK,MAAM,IAAI;EAGhB,KAAK,MAAM,QAAQ,IAAI;EACvB,KAAK,YAAY;CAClB;CAEA,IAAI,UAAkC;EACrC,IAAI,YAAY,MAAM;GACrB,IAAI,WAAW,KAAK,YAAY,KAAK,MAAM,QAAQ,OAAO,KAAA;GAC1D,OAAO,KAAK,MAAM;EACnB;EACA,OAAO,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,KAAK,KAAA;CAChD;CAEA,OAAO,MAAe;EACrB,IAAI,KAAK,YAAY,GAAG;GACvB,KAAK,MAAM,OAAO,GAAG,KAAK,SAAS;GACnC,KAAK,YAAY;EAClB;EACA,KAAK,MAAM,QAAQ,IAAI;EACvB,KAAK;CACN;CAEA,SAAS,WAA8C;EACtD,IAAI,KAAK,MAAM,UAAU,GAAG,OAAO,KAAA;EAEnC,IAAI,cAAc,QAAQ;GACzB,IAAI,KAAK,aAAa,KAAK,MAAM,SAAS,GAAG,OAAO,KAAA;GAEpD,KAAK,aAAa;EACnB,OAAO;GACN,IAAI,KAAK,aAAa,GAAG,OAAO,KAAA;GAEhC,KAAK,aAAa;EACnB;EAEA,OAAO,KAAK,MAAM,KAAK;CACxB;AACD"}