@gitkraken/core-gitlens 0.5.116 → 0.7.0

package/dist/utils/trie.js

@@ -1,585 +1,443 @@
-import { filterMap } from './iterable.js';
-import { normalizePath as _normalizePath } from './path.js';
-import { isLinux } from './platform.js';
-const slash = 47; //CharCode.Slash
+import { filterMap } from "./iterable.js";
+import { isLinux } from "./platform.js";
+import { normalizePath as normalizePath$1 } from "./path.js";
+//#region ../utils/src/trie.ts
+const slash = 47;
 function normalizePath(path) {
-    path = _normalizePath(path);
-    if (path.charCodeAt(0) === slash) {
-        path = path.slice(1);
-    }
-    return path;
-}
-export class UriEntryTrie {
-    normalize;
-    trie;
-    constructor(normalize) {
-        this.normalize = normalize;
-        this.trie = new PathEntryTrie();
-    }
-    clear() {
-        this.trie.clear();
-    }
-    delete(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.delete(path, ignoreCase);
-    }
-    get(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.get(path, ignoreCase);
-    }
-    getChildren(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getChildren(path, ignoreCase);
-    }
-    getClosest(uri, excludeSelf, predicate) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getClosest(path, excludeSelf, predicate, ignoreCase);
-    }
-    getDescendants(uri, predicate) {
-        if (uri == null)
-            return this.trie.getDescendants();
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getDescendants(path, predicate, ignoreCase);
-    }
-    has(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.has(path, ignoreCase);
-    }
-    set(uri, value) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.set(path, value, ignoreCase);
-    }
-}
-export class UriTrie {
-    normalize;
-    trie;
-    constructor(normalize) {
-        this.normalize = normalize;
-        this.trie = new PathTrie();
-    }
-    clear() {
-        this.trie.clear();
-    }
-    delete(uri, dispose = true) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.delete(path, ignoreCase, dispose);
-    }
-    get(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.get(path, ignoreCase);
-    }
-    getChildren(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getChildren(path, ignoreCase);
-    }
-    getClosest(uri, excludeSelf, predicate) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getClosest(path, excludeSelf, predicate, ignoreCase);
-    }
-    getDescendants(uri, predicate) {
-        if (uri == null)
-            return this.trie.getDescendants();
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.getDescendants(path, predicate, ignoreCase);
-    }
-    has(uri) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.has(path, ignoreCase);
-    }
-    set(uri, value) {
-        const { path, ignoreCase } = this.normalize(uri);
-        return this.trie.set(path, value, ignoreCase);
-    }
-}
-class PathNode {
-    path;
-    value;
-    children;
-    constructor(path) {
-        this.path = path;
-    }
-}
-export class PathEntryTrie {
-    normalize;
-    root;
-    constructor(normalize = normalizePath) {
-        this.normalize = normalize;
-        this.root = new PathNode('');
-    }
-    clear() {
-        this.root.children = undefined;
-    }
-    delete(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        let parent;
-        for (const segment of path.split('/')) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return false;
-            parent = node ?? this.root;
-            node = n;
-        }
-        if (!node?.value)
-            return false;
-        node.value = undefined;
-        if ((node.children == null || node.children.size === 0) && parent?.children != null) {
-            parent.children.delete(ignoreCase ? node.path.toLowerCase() : node.path);
-            if (parent.children.size === 0) {
-                parent.children = undefined;
-            }
-        }
-        return true;
-    }
-    get(path, ignoreCase) {
-        return this.getCore(path, ignoreCase);
-    }
-    getCore(path, ignoreCase, existenceOnly) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let fullPath = '';
-        let node;
-        for (const segment of path.split('/')) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return existenceOnly ? false : undefined;
-            node = n;
-            if (!existenceOnly) {
-                fullPath += `${n.path}/`;
-            }
-        }
-        // Avoids allocations & garbage on `has` calls
-        if (existenceOnly)
-            return node?.value != null;
-        if (!node?.value)
-            return undefined;
-        return {
-            value: node.value,
-            path: node.path,
-            fullPath: fullPath.slice(0, -1),
-        };
-    }
-    getChildren(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let fullPath = '';
-        let node;
-        if (path) {
-            for (const segment of path.split('/')) {
-                const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-                if (n == null)
-                    return [];
-                node = n;
-                fullPath += `${n.path}/`;
-            }
-        }
-        else {
-            node = this.root;
-        }
-        if (node?.children == null)
-            return [];
-        return [
-            ...filterMap(node.children.values(), n => n.value ? { value: n.value, path: n.path, fullPath: fullPath } : undefined),
-        ];
-    }
-    getClosest(path, excludeSelf, predicate, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let fullPath = '';
-        let fullAncestorPath;
-        let node;
-        let ancestor;
-        for (const segment of path.split('/')) {
-            if (node?.value && (!predicate || predicate?.(node.value))) {
-                ancestor = node;
-                fullAncestorPath = fullPath;
-            }
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                break;
-            node = n;
-            fullPath += `${n.path}/`;
-        }
-        if (!excludeSelf && node?.value && (!predicate || predicate?.(node.value))) {
-            return { value: node.value, path: node.path, fullPath: fullPath.slice(0, -1) };
-        }
-        return ancestor?.value
-            ? { value: ancestor.value, path: ancestor.path, fullPath: fullAncestorPath.slice(0, -1) }
-            : undefined;
-    }
-    // getAncestors(
-    // 	path: string,
-    // 	predicate?: (value: T) => boolean,
-    // 	ignoreCase?: boolean,
-    // 	excludeSelf?: boolean,
-    // ): PathEntry<T>[] {
-    // 	path = this.normalize(path);
-    // 	ignoreCase = ignoreCase ?? !isLinux;
-    // 	const ancestors: PathEntry<T>[] = [];
-    // 	let fullPath = '';
-    // 	let node: PathNode<T> | undefined;
-    // 	for (const segment of path.split('/')) {
-    // 		if (node?.value && (!predicate || predicate?.(node.value))) {
-    // 			ancestors.push({ value: node.value, path: node.path, fullPath: fullPath.slice(0, -1) });
-    // 		}
-    // 		const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-    // 		if (n == null) break;
-    // 		node = n;
-    // 		fullPath += `${n.path}/`;
-    // 	}
-    // 	if (!excludeSelf && node?.value && (!predicate || predicate?.(node.value))) {
-    // 		ancestors.push({ value: node.value, path: node.path, fullPath: fullPath.slice(0, -1) });
-    // 	}
-    // 	return ancestors.reverse();
-    // }
-    *getDescendants(path, predicate, ignoreCase) {
-        path = path ? this.normalize(path) : '';
-        ignoreCase = ignoreCase ?? !isLinux;
-        let fullPath = '';
-        let node;
-        if (path) {
-            for (const segment of path.split('/')) {
-                const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-                if (n == null)
-                    return;
-                node = n;
-                fullPath += `${n.path}/`;
-            }
-        }
-        else {
-            node = this.root;
-        }
-        if (node?.children == null)
-            return;
-        function* getDescendantsCore(children, path, fullPath) {
-            for (const node of children.values()) {
-                const relativePath = path ? `${path}/${node.path}` : node.path;
-                if (node.value && (!predicate || predicate?.(node.value))) {
-                    yield {
-                        value: node.value,
-                        path: relativePath,
-                        fullPath: fullPath ? `${fullPath}/${relativePath}` : relativePath,
-                    };
-                }
-                if (node.children != null) {
-                    yield* getDescendantsCore(node.children, relativePath, fullPath);
-                }
-            }
-        }
-        yield* getDescendantsCore(node.children, '', fullPath);
-    }
-    has(path, ignoreCase) {
-        return this.getCore(path, ignoreCase, true);
-    }
-    set(path, value, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node = this.root;
-        for (const segment of path.split('/')) {
-            const key = ignoreCase ? segment.toLowerCase() : segment;
-            let n = node.children?.get(key);
-            if (n == null) {
-                node.children ??= new Map();
-                n = new PathNode(segment);
-                node.children.set(key, n);
-            }
-            node = n;
-        }
-        const added = node.value == null;
-        node.value = value;
-        return added;
-    }
-}
-export class PathTrie {
-    normalize;
-    root;
-    constructor(normalize = normalizePath) {
-        this.normalize = normalize;
-        this.root = new PathNode('');
-    }
-    clear() {
-        this.root.children = undefined;
-    }
-    delete(path, ignoreCase, dispose = true) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        let parent;
-        for (const segment of path.split('/')) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return false;
-            parent = node ?? this.root;
-            node = n;
-        }
-        if (node?.value == null)
-            return false;
-        if (dispose) {
-            disposeValue(node.value);
-        }
-        node.value = undefined;
-        if ((node.children == null || node.children.size === 0) && parent?.children != null) {
-            parent.children.delete(ignoreCase ? node.path.toLowerCase() : node.path);
-            if (parent.children.size === 0) {
-                parent.children = undefined;
-            }
-        }
-        return true;
-    }
-    get(path, ignoreCase) {
-        return this.getCore(path, ignoreCase);
-    }
-    getCore(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        for (const segment of path.split('/')) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return undefined;
-            node = n;
-        }
-        return node?.value;
-    }
-    getChildren(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        if (path) {
-            for (const segment of path.split('/')) {
-                const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-                if (n == null)
-                    return [];
-                node = n;
-            }
-        }
-        else {
-            node = this.root;
-        }
-        if (node?.children == null)
-            return [];
-        // oxlint-disable-next-line typescript/prefer-nullish-coalescing -- generic value may be falsy; `||` drops falsy entries by design
-        return [...filterMap(node.children.values(), n => n.value || undefined)];
-    }
-    getClosest(path, excludeSelf, predicate, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        let ancestor;
-        for (const segment of path.split('/')) {
-            if (node?.value && (!predicate || predicate?.(node.value))) {
-                ancestor = node;
-            }
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                break;
-            node = n;
-        }
-        if (!excludeSelf && node?.value && (!predicate || predicate?.(node.value))) {
-            return node.value;
-        }
-        return ancestor?.value;
-    }
-    *getDescendants(path, predicate, ignoreCase) {
-        path = path ? this.normalize(path) : '';
-        ignoreCase = ignoreCase ?? !isLinux;
-        let fullPath = '';
-        let node;
-        if (path) {
-            for (const segment of path.split('/')) {
-                const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-                if (n == null)
-                    return;
-                node = n;
-                fullPath += `${n.path}/`;
-            }
-        }
-        else {
-            node = this.root;
-        }
-        if (node?.children == null)
-            return;
-        function* getDescendantsCore(children, path, fullPath) {
-            for (const node of children.values()) {
-                const relativePath = path ? `${path}/${node.path}` : node.path;
-                if (node.value && (!predicate || predicate?.(node.value))) {
-                    yield node.value;
-                }
-                if (node.children != null) {
-                    yield* getDescendantsCore(node.children, relativePath, fullPath);
-                }
-            }
-        }
-        yield* getDescendantsCore(node.children, '', fullPath);
-    }
-    has(path, ignoreCase) {
-        return this.getCore(path, ignoreCase) != null;
-    }
-    set(path, value, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node = this.root;
-        for (const segment of path.split('/')) {
-            const key = ignoreCase ? segment.toLowerCase() : segment;
-            let n = node.children?.get(key);
-            if (n == null) {
-                node.children ??= new Map();
-                n = new PathNode(segment);
-                node.children.set(key, n);
-            }
-            node = n;
-        }
-        const added = node.value == null;
-        if (!added && node.value !== value) {
-            disposeValue(node.value);
-        }
-        node.value = value;
-        return added;
-    }
+	path = normalizePath$1(path);
+	if (path.charCodeAt(0) === slash) path = path.slice(1);
+	return path;
 }
+var UriEntryTrie = class {
+	normalize;
+	trie;
+	constructor(normalize) {
+		this.normalize = normalize;
+		this.trie = new PathEntryTrie();
+	}
+	clear() {
+		this.trie.clear();
+	}
+	delete(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.delete(path, ignoreCase);
+	}
+	get(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.get(path, ignoreCase);
+	}
+	getChildren(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getChildren(path, ignoreCase);
+	}
+	getClosest(uri, excludeSelf, predicate) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getClosest(path, excludeSelf, predicate, ignoreCase);
+	}
+	getDescendants(uri, predicate) {
+		if (uri == null) return this.trie.getDescendants();
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getDescendants(path, predicate, ignoreCase);
+	}
+	has(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.has(path, ignoreCase);
+	}
+	set(uri, value) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.set(path, value, ignoreCase);
+	}
+};
+var UriTrie = class {
+	normalize;
+	trie;
+	constructor(normalize) {
+		this.normalize = normalize;
+		this.trie = new PathTrie();
+	}
+	clear() {
+		this.trie.clear();
+	}
+	delete(uri, dispose = true) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.delete(path, ignoreCase, dispose);
+	}
+	get(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.get(path, ignoreCase);
+	}
+	getChildren(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getChildren(path, ignoreCase);
+	}
+	getClosest(uri, excludeSelf, predicate) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getClosest(path, excludeSelf, predicate, ignoreCase);
+	}
+	getDescendants(uri, predicate) {
+		if (uri == null) return this.trie.getDescendants();
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.getDescendants(path, predicate, ignoreCase);
+	}
+	has(uri) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.has(path, ignoreCase);
+	}
+	set(uri, value) {
+		const { path, ignoreCase } = this.normalize(uri);
+		return this.trie.set(path, value, ignoreCase);
+	}
+};
+var PathNode = class {
+	path;
+	value;
+	children;
+	constructor(path) {
+		this.path = path;
+	}
+};
+var PathEntryTrie = class {
+	normalize;
+	root;
+	constructor(normalize = normalizePath) {
+		this.normalize = normalize;
+		this.root = new PathNode("");
+	}
+	clear() {
+		this.root.children = void 0;
+	}
+	delete(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		let parent;
+		for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return false;
+			parent = node ?? this.root;
+			node = n;
+		}
+		if (!node?.value) return false;
+		node.value = void 0;
+		if ((node.children == null || node.children.size === 0) && parent?.children != null) {
+			parent.children.delete(ignoreCase ? node.path.toLowerCase() : node.path);
+			if (parent.children.size === 0) parent.children = void 0;
+		}
+		return true;
+	}
+	get(path, ignoreCase) {
+		return this.getCore(path, ignoreCase);
+	}
+	getCore(path, ignoreCase, existenceOnly) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let fullPath = "";
+		let node;
+		for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return existenceOnly ? false : void 0;
+			node = n;
+			if (!existenceOnly) fullPath += `${n.path}/`;
+		}
+		if (existenceOnly) return node?.value != null;
+		if (!node?.value) return void 0;
+		return {
+			value: node.value,
+			path: node.path,
+			fullPath: fullPath.slice(0, -1)
+		};
+	}
+	getChildren(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let fullPath = "";
+		let node;
+		if (path) for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return [];
+			node = n;
+			fullPath += `${n.path}/`;
+		}
+		else node = this.root;
+		if (node?.children == null) return [];
+		return [...filterMap(node.children.values(), (n) => n.value ? {
+			value: n.value,
+			path: n.path,
+			fullPath
+		} : void 0)];
+	}
+	getClosest(path, excludeSelf, predicate, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let fullPath = "";
+		let fullAncestorPath;
+		let node;
+		let ancestor;
+		for (const segment of path.split("/")) {
+			if (node?.value && (!predicate || predicate?.(node.value))) {
+				ancestor = node;
+				fullAncestorPath = fullPath;
+			}
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) break;
+			node = n;
+			fullPath += `${n.path}/`;
+		}
+		if (!excludeSelf && node?.value && (!predicate || predicate?.(node.value))) return {
+			value: node.value,
+			path: node.path,
+			fullPath: fullPath.slice(0, -1)
+		};
+		return ancestor?.value ? {
+			value: ancestor.value,
+			path: ancestor.path,
+			fullPath: fullAncestorPath.slice(0, -1)
+		} : void 0;
+	}
+	*getDescendants(path, predicate, ignoreCase) {
+		path = path ? this.normalize(path) : "";
+		ignoreCase = ignoreCase ?? !isLinux;
+		let fullPath = "";
+		let node;
+		if (path) for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return;
+			node = n;
+			fullPath += `${n.path}/`;
+		}
+		else node = this.root;
+		if (node?.children == null) return;
+		function* getDescendantsCore(children, path, fullPath) {
+			for (const node of children.values()) {
+				const relativePath = path ? `${path}/${node.path}` : node.path;
+				if (node.value && (!predicate || predicate?.(node.value))) yield {
+					value: node.value,
+					path: relativePath,
+					fullPath: fullPath ? `${fullPath}/${relativePath}` : relativePath
+				};
+				if (node.children != null) yield* getDescendantsCore(node.children, relativePath, fullPath);
+			}
+		}
+		yield* getDescendantsCore(node.children, "", fullPath);
+	}
+	has(path, ignoreCase) {
+		return this.getCore(path, ignoreCase, true);
+	}
+	set(path, value, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node = this.root;
+		for (const segment of path.split("/")) {
+			const key = ignoreCase ? segment.toLowerCase() : segment;
+			let n = node.children?.get(key);
+			if (n == null) {
+				node.children ??= /* @__PURE__ */ new Map();
+				n = new PathNode(segment);
+				node.children.set(key, n);
+			}
+			node = n;
+		}
+		const added = node.value == null;
+		node.value = value;
+		return added;
+	}
+};
+var PathTrie = class {
+	normalize;
+	root;
+	constructor(normalize = normalizePath) {
+		this.normalize = normalize;
+		this.root = new PathNode("");
+	}
+	clear() {
+		this.root.children = void 0;
+	}
+	delete(path, ignoreCase, dispose = true) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		let parent;
+		for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return false;
+			parent = node ?? this.root;
+			node = n;
+		}
+		if (node?.value == null) return false;
+		if (dispose) disposeValue(node.value);
+		node.value = void 0;
+		if ((node.children == null || node.children.size === 0) && parent?.children != null) {
+			parent.children.delete(ignoreCase ? node.path.toLowerCase() : node.path);
+			if (parent.children.size === 0) parent.children = void 0;
+		}
+		return true;
+	}
+	get(path, ignoreCase) {
+		return this.getCore(path, ignoreCase);
+	}
+	getCore(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return void 0;
+			node = n;
+		}
+		return node?.value;
+	}
+	getChildren(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		if (path) for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return [];
+			node = n;
+		}
+		else node = this.root;
+		if (node?.children == null) return [];
+		return [...filterMap(node.children.values(), (n) => n.value || void 0)];
+	}
+	getClosest(path, excludeSelf, predicate, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		let ancestor;
+		for (const segment of path.split("/")) {
+			if (node?.value && (!predicate || predicate?.(node.value))) ancestor = node;
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) break;
+			node = n;
+		}
+		if (!excludeSelf && node?.value && (!predicate || predicate?.(node.value))) return node.value;
+		return ancestor?.value;
+	}
+	*getDescendants(path, predicate, ignoreCase) {
+		path = path ? this.normalize(path) : "";
+		ignoreCase = ignoreCase ?? !isLinux;
+		let fullPath = "";
+		let node;
+		if (path) for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return;
+			node = n;
+			fullPath += `${n.path}/`;
+		}
+		else node = this.root;
+		if (node?.children == null) return;
+		function* getDescendantsCore(children, path, fullPath) {
+			for (const node of children.values()) {
+				const relativePath = path ? `${path}/${node.path}` : node.path;
+				if (node.value && (!predicate || predicate?.(node.value))) yield node.value;
+				if (node.children != null) yield* getDescendantsCore(node.children, relativePath, fullPath);
+			}
+		}
+		yield* getDescendantsCore(node.children, "", fullPath);
+	}
+	has(path, ignoreCase) {
+		return this.getCore(path, ignoreCase) != null;
+	}
+	set(path, value, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node = this.root;
+		for (const segment of path.split("/")) {
+			const key = ignoreCase ? segment.toLowerCase() : segment;
+			let n = node.children?.get(key);
+			if (n == null) {
+				node.children ??= /* @__PURE__ */ new Map();
+				n = new PathNode(segment);
+				node.children.set(key, n);
+			}
+			node = n;
+		}
+		const added = node.value == null;
+		if (!added && node.value !== value) disposeValue(node.value);
+		node.value = value;
+		return added;
+	}
+};
 function disposeValue(obj) {
-    if (obj != null && typeof obj === 'object' && 'dispose' in obj && typeof obj.dispose === 'function') {
-        obj.dispose();
-    }
-}
-class VisitedPathNode {
-    path;
-    children;
-    root = false;
-    constructor(path) {
-        this.path = path;
-    }
-}
-export class VisitedPathsTrie {
-    normalize;
-    root;
-    constructor(normalize = normalizePath) {
-        this.normalize = normalize;
-        this.root = new VisitedPathNode('');
-    }
-    clear() {
-        this.root.children = undefined;
-    }
-    // delete(path: string, ignoreCase?: boolean): boolean {
-    // 	path = this.normalize(path);
-    // 	ignoreCase = ignoreCase ?? !isLinux;
-    // 	let node: SeenPathNode | undefined;
-    // 	let parent: SeenPathNode | undefined;
-    // 	for (const segment of path.split('/')) {
-    // 		const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-    // 		if (n == null) return false;
-    // 		parent = node ?? this.root;
-    // 		node = n;
-    // 	}
-    // 	if (node == null) return false;
-    // 	if ((node.children == null || node.children.size === 0) && parent?.children != null) {
-    // 		parent.children.delete(ignoreCase ? node.path.toLowerCase() : node.path);
-    // 		if (parent.children.size === 0) {
-    // 			parent.children = undefined;
-    // 		}
-    // 	}
-    // 	return true;
-    // }
-    // getClosest(path: string, excludeSelf?: boolean, ignoreCase?: boolean): string | undefined {
-    // 	path = this.normalize(path);
-    // 	ignoreCase = ignoreCase ?? !isLinux;
-    // 	let fullPath = '';
-    // 	let fullAncestorPath!: string;
-    // 	let node: SeenPathNode | undefined;
-    // 	let ancestor: SeenPathNode | undefined;
-    // 	for (const segment of path.split('/')) {
-    // 		ancestor = node;
-    // 		fullAncestorPath = fullPath;
-    // 		const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-    // 		if (n == null) break;
-    // 		node = n;
-    // 		fullPath += `${n.path}/`;
-    // 	}
-    // 	if (!excludeSelf && node != null) return fullPath.slice(0, -1);
-    // 	return ancestor != null ? fullAncestorPath.slice(0, -1) : undefined;
-    // }
-    has(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node;
-        let foundRoot = false;
-        for (const segment of path.split('/')) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return false;
-            node = n;
-            if (node.root) {
-                foundRoot = true;
-            }
-        }
-        if (node == null)
-            return false;
-        // Return true if we found a root marker on the path
-        if (foundRoot) {
-            return true;
-        }
-        // Check if this node has any leaf children (indicating we searched a file here before with no root found)
-        if (node.children != null) {
-            for (const child of node.children.values()) {
-                if (child.children == null || child.children.size === 0) {
-                    return true;
-                }
-            }
-        }
-        return false;
-    }
-    hasParent(path, ignoreCase) {
-        path = this.normalize(path);
-        ignoreCase = ignoreCase ?? !isLinux;
-        const segments = path.split('/');
-        segments.pop(); // Remove the last segment (file name)
-        let node;
-        let foundRoot = false;
-        for (const segment of segments) {
-            const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
-            if (n == null)
-                return false;
-            node = n;
-            if (node.root) {
-                foundRoot = true;
-            }
-        }
-        if (node == null)
-            return false;
-        // Return true if we found a root marker on the path
-        if (foundRoot)
-            return true;
-        // Check if this node has any leaf children (indicating we searched a file here before with no root found)
-        if (node.children != null) {
-            for (const child of node.children.values()) {
-                if (!child.children?.size)
-                    return true;
-            }
-        }
-        return false;
-    }
-    set(path, rootPath, ignoreCase) {
-        path = this.normalize(path);
-        const normalizedRootPath = rootPath ? this.normalize(rootPath) : undefined;
-        ignoreCase = ignoreCase ?? !isLinux;
-        let node = this.root;
-        let currentPath = '';
-        for (const segment of path.split('/')) {
-            const key = ignoreCase ? segment.toLowerCase() : segment;
-            let n = node.children?.get(key);
-            if (n == null) {
-                node.children ??= new Map();
-                n = new VisitedPathNode(segment);
-                node.children.set(key, n);
-            }
-            node = n;
-            currentPath = currentPath ? `${currentPath}/${segment}` : segment;
-            // Mark the node as root if it matches the rootPath
-            if (normalizedRootPath != null && currentPath === normalizedRootPath) {
-                node.root = true;
-            }
-        }
-    }
+	if (obj != null && typeof obj === "object" && "dispose" in obj && typeof obj.dispose === "function") obj.dispose();
 }
+var VisitedPathNode = class {
+	path;
+	children;
+	root = false;
+	constructor(path) {
+		this.path = path;
+	}
+};
+var VisitedPathsTrie = class {
+	normalize;
+	root;
+	constructor(normalize = normalizePath) {
+		this.normalize = normalize;
+		this.root = new VisitedPathNode("");
+	}
+	clear() {
+		this.root.children = void 0;
+	}
+	has(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node;
+		let foundRoot = false;
+		for (const segment of path.split("/")) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return false;
+			node = n;
+			if (node.root) foundRoot = true;
+		}
+		if (node == null) return false;
+		if (foundRoot) return true;
+		if (node.children != null) {
+			for (const child of node.children.values()) if (child.children == null || child.children.size === 0) return true;
+		}
+		return false;
+	}
+	hasParent(path, ignoreCase) {
+		path = this.normalize(path);
+		ignoreCase = ignoreCase ?? !isLinux;
+		const segments = path.split("/");
+		segments.pop();
+		let node;
+		let foundRoot = false;
+		for (const segment of segments) {
+			const n = (node ?? this.root).children?.get(ignoreCase ? segment.toLowerCase() : segment);
+			if (n == null) return false;
+			node = n;
+			if (node.root) foundRoot = true;
+		}
+		if (node == null) return false;
+		if (foundRoot) return true;
+		if (node.children != null) {
+			for (const child of node.children.values()) if (!child.children?.size) return true;
+		}
+		return false;
+	}
+	set(path, rootPath, ignoreCase) {
+		path = this.normalize(path);
+		const normalizedRootPath = rootPath ? this.normalize(rootPath) : void 0;
+		ignoreCase = ignoreCase ?? !isLinux;
+		let node = this.root;
+		let currentPath = "";
+		for (const segment of path.split("/")) {
+			const key = ignoreCase ? segment.toLowerCase() : segment;
+			let n = node.children?.get(key);
+			if (n == null) {
+				node.children ??= /* @__PURE__ */ new Map();
+				n = new VisitedPathNode(segment);
+				node.children.set(key, n);
+			}
+			node = n;
+			currentPath = currentPath ? `${currentPath}/${segment}` : segment;
+			if (normalizedRootPath != null && currentPath === normalizedRootPath) node.root = true;
+		}
+	}
+};
+//#endregion
+export { PathEntryTrie, PathTrie, UriEntryTrie, UriTrie, VisitedPathsTrie };
+
 //# sourceMappingURL=trie.js.map