@fgv/ts-web-extras 5.0.2 → 5.1.0-1

package/lib/packlets/file-tree/localStorageTreeAccessors.js

@@ -0,0 +1,363 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LocalStorageTreeAccessors = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const ts_json_base_1 = require("@fgv/ts-json-base");
+const ts_json_base_2 = require("@fgv/ts-json-base");
+/**
+ * Browser localStorage-backed file tree accessors with persistence support.
+ *
+ * Maps filesystem-like directory paths to localStorage keys, where each key stores
+ * multiple collections as a JSON object. This provides a general-purpose implementation
+ * for browser-based file tree persistence without requiring File System Access API.
+ *
+ * Storage format per key: `{ "collection-id": "<raw file content>" }`
+ * File paths map as: `/data/ingredients/collection-id.yaml` → stored in key for `/data/ingredients`
+ *
+ * Legacy format (v1): `{ "collection-id": { ...parsedJsonObject } }` is auto-migrated on load.
+ *
+ * @public
+ */
+class LocalStorageTreeAccessors extends ts_json_base_1.FileTree.InMemoryTreeAccessors {
+    /**
+     * Private constructor. Use fromStorage() factory method instead.
+     * @internal
+     */
+    constructor(files, storage, pathToKeyMap, params) {
+        var _a;
+        super(files, params);
+        this._storage = storage;
+        this._pathToKeyMap = pathToKeyMap;
+        this._keyToPathMap = new Map(Array.from(pathToKeyMap.entries()).map(([k, v]) => [v, k]));
+        this._dirtyFiles = new Set();
+        /* c8 ignore next 1 - intermittent branch coverage: ?? false branch when params is undefined */
+        this._autoSync = (_a = params === null || params === void 0 ? void 0 : params.autoSync) !== null && _a !== void 0 ? _a : false;
+    }
+    /**
+     * Create LocalStorageTreeAccessors from browser localStorage.
+     * Loads all collections from the configured storage keys.
+     *
+     * @param params - Configuration including path-to-key mappings
+     * @returns Result containing the accessors or an error
+     * @public
+     */
+    static fromStorage(params) {
+        var _a;
+        try {
+            /* c8 ignore next 1 - intermittent branch coverage: window.localStorage branch when params.storage is undefined */
+            const storage = (_a = params.storage) !== null && _a !== void 0 ? _a : (typeof window !== 'undefined' ? window.localStorage : undefined);
+            if (!storage) {
+                return (0, ts_utils_1.fail)('localStorage is not available');
+            }
+            const pathToKeyMap = new Map(Object.entries(params.pathToKeyMap));
+            const files = this._loadFromStorage(storage, pathToKeyMap, params);
+            return (0, ts_utils_1.succeed)(new LocalStorageTreeAccessors(files, storage, pathToKeyMap, params));
+            /* c8 ignore next 4 - defensive: outer catch for unexpected errors */
+        }
+        catch (error) {
+            const message = error instanceof Error ? error.message : String(error);
+            return (0, ts_utils_1.fail)(`Failed to create LocalStorageTreeAccessors: ${message}`);
+        }
+    }
+    /**
+     * Load all files from localStorage based on path-to-key mappings.
+     * @internal
+     */
+    static _loadFromStorage(storage, pathToKeyMap, params) {
+        const files = [];
+        for (const [dataPath, storageKey] of pathToKeyMap.entries()) {
+            const rawJson = storage.getItem(storageKey);
+            if (!rawJson) {
+                continue;
+            }
+            try {
+                const parsed = JSON.parse(rawJson);
+                if (!(0, ts_json_base_2.isJsonObject)(parsed)) {
+                    continue;
+                }
+                for (const [collectionId, contents] of Object.entries(parsed)) {
+                    // Support both new format (string values) and legacy format (JsonObject values)
+                    let rawContent;
+                    let extension;
+                    if (typeof contents === 'string') {
+                        rawContent = contents;
+                        // Infer extension: if content looks like JSON, use .json; otherwise .yaml
+                        extension = this._looksLikeJson(contents) ? '.json' : '.yaml';
+                    }
+                    else if ((0, ts_json_base_2.isJsonObject)(contents)) {
+                        // Legacy format: migrate by stringifying
+                        rawContent = JSON.stringify(contents);
+                        extension = '.json';
+                    }
+                    else {
+                        continue;
+                    }
+                    const filePath = this._joinPath(dataPath, `${collectionId}${extension}`);
+                    /* c8 ignore next 3 - intermittent branch coverage: ternary branches in tight loop */
+                    const contentType = (params === null || params === void 0 ? void 0 : params.inferContentType)
+                        ? params.inferContentType(filePath, undefined).orDefault()
+                        : undefined;
+                    files.push({
+                        path: filePath,
+                        contents: rawContent,
+                        contentType
+                    });
+                }
+            }
+            catch (_a) {
+                // Skip corrupted data
+                continue;
+            }
+        }
+        return files;
+    }
+    /**
+     * Heuristic check: does the content look like JSON?
+     * @internal
+     */
+    static _looksLikeJson(content) {
+        const trimmed = content.trimStart();
+        return trimmed.startsWith('{') || trimmed.startsWith('[');
+    }
+    /**
+     * Join path components, handling leading/trailing slashes.
+     * @internal
+     */
+    static _joinPath(base, name) {
+        /* c8 ignore next 2 - intermittent branch coverage: slash-trimming edge cases */
+        const cleanBase = base.endsWith('/') ? base.slice(0, -1) : base;
+        const cleanName = name.startsWith('/') ? name.slice(1) : name;
+        return `${cleanBase}/${cleanName}`;
+    }
+    /**
+     * Get the storage key for a given file path.
+     * @internal
+     */
+    _getStorageKeyForPath(path) {
+        // Find the longest matching prefix
+        let bestMatch;
+        for (const [prefix, key] of this._pathToKeyMap.entries()) {
+            if (path.startsWith(prefix)) {
+                /* c8 ignore next 1 - intermittent: overlapping-prefix branch requires two matching prefixes in iteration order */
+                if (!bestMatch || prefix.length > bestMatch.prefix.length) {
+                    bestMatch = { prefix, key };
+                }
+            }
+        }
+        return bestMatch === null || bestMatch === void 0 ? void 0 : bestMatch.key;
+    }
+    /**
+     * Get the data path prefix for a given file path.
+     * @internal
+     */
+    _getDataPathForPath(path) {
+        for (const prefix of this._pathToKeyMap.keys()) {
+            if (path.startsWith(prefix)) {
+                return prefix;
+            }
+        }
+        /* c8 ignore next 2 - coverage intermittently missed in full suite */
+        return undefined;
+    }
+    /**
+     * Extract collection ID from a file path.
+     * Example: '/data/ingredients/my-collection.yaml' → 'my-collection'
+     * @internal
+     */
+    _getCollectionIdFromPath(path) {
+        const dataPath = this._getDataPathForPath(path);
+        /* c8 ignore next 3 - coverage intermittently missed in full suite */
+        if (!dataPath) {
+            return path;
+        }
+        const relativePath = path.slice(dataPath.length);
+        /* c8 ignore next 1 - defensive: relativePath always starts with / when paths are absolute */
+        const cleanPath = relativePath.startsWith('/') ? relativePath.slice(1) : relativePath;
+        // Remove any file extension
+        const dotIndex = cleanPath.lastIndexOf('.');
+        return dotIndex > 0 ? cleanPath.slice(0, dotIndex) : cleanPath;
+    }
+    /**
+     * Remove a file's entry from its localStorage key.
+     * @internal
+     */
+    _deleteFileFromStorage(path) {
+        const storageKey = this._getStorageKeyForPath(path);
+        if (!storageKey) {
+            return;
+        }
+        const collectionId = this._getCollectionIdFromPath(path);
+        const existingJson = this._storage.getItem(storageKey);
+        if (!existingJson) {
+            return;
+        }
+        try {
+            const parsed = JSON.parse(existingJson);
+            if ((0, ts_json_base_2.isJsonObject)(parsed)) {
+                const existing = parsed;
+                delete existing[collectionId];
+                if (Object.keys(existing).length > 0) {
+                    this._storage.setItem(storageKey, JSON.stringify(existing));
+                }
+                else {
+                    this._storage.removeItem(storageKey);
+                }
+            }
+        }
+        catch (_a) {
+            // Storage is corrupted — nothing to clean up
+        }
+    }
+    /**
+     * Sync a single dirty file to localStorage.
+     * @internal
+     */
+    _syncFile(path) {
+        const storageKey = this._getStorageKeyForPath(path);
+        if (!storageKey) {
+            return (0, ts_utils_1.fail)(`No storage key configured for path: ${path}`);
+        }
+        const collectionId = this._getCollectionIdFromPath(path);
+        const contentsResult = this.getFileContents(path);
+        if (contentsResult.isFailure()) {
+            return (0, ts_utils_1.fail)(`Failed to get file contents for ${path}: ${contentsResult.message}`);
+        }
+        try {
+            const contents = contentsResult.value;
+            // Load existing data from storage
+            const existingJson = this._storage.getItem(storageKey);
+            let existing = {};
+            if (existingJson) {
+                try {
+                    const parsed = JSON.parse(existingJson);
+                    if ((0, ts_json_base_2.isJsonObject)(parsed)) {
+                        existing = parsed;
+                    }
+                }
+                catch (_a) {
+                    // Start fresh if corrupted
+                }
+            }
+            // Store raw content string (content-agnostic: JSON, YAML, etc.)
+            existing[collectionId] = contents;
+            this._storage.setItem(storageKey, JSON.stringify(existing));
+            return (0, ts_utils_1.succeed)(undefined);
+            /* c8 ignore next 4 - defensive: only triggers on storage quota or similar runtime errors */
+        }
+        catch (error) {
+            const message = error instanceof Error ? error.message : String(error);
+            return (0, ts_utils_1.fail)(`Failed to sync file ${path}: ${message}`);
+        }
+    }
+    /**
+     * Sync all dirty files to localStorage.
+     * @returns Result indicating success or failure
+     * @public
+     */
+    async syncToDisk() {
+        if (this._dirtyFiles.size === 0) {
+            return (0, ts_utils_1.succeed)(undefined);
+        }
+        const errors = [];
+        for (const path of this._dirtyFiles) {
+            const result = this._syncFile(path);
+            if (result.isFailure()) {
+                errors.push(result.message);
+            }
+        }
+        if (errors.length > 0) {
+            return (0, ts_utils_1.fail)(`Failed to sync ${errors.length} file(s): ${errors.join('; ')}`);
+        }
+        this._dirtyFiles.clear();
+        return (0, ts_utils_1.succeed)(undefined);
+    }
+    /**
+     * Check if there are unsaved changes.
+     * @returns True if there are dirty files
+     * @public
+     */
+    isDirty() {
+        return this._dirtyFiles.size > 0;
+    }
+    /**
+     * Get list of file paths with unsaved changes.
+     * @returns Array of dirty file paths
+     * @public
+     */
+    getDirtyPaths() {
+        return Array.from(this._dirtyFiles);
+    }
+    /**
+     * Delete a file and remove it from localStorage.
+     * @param path - File path to delete
+     * @returns Result with true if deleted, or error
+     * @public
+     */
+    deleteFile(path) {
+        const result = super.deleteFile(path);
+        if (result.isSuccess()) {
+            this._dirtyFiles.delete(path);
+            this._deleteFileFromStorage(path);
+        }
+        return result;
+    }
+    /**
+     * Save file contents. Marks file as dirty and optionally auto-syncs.
+     * @param path - File path
+     * @param contents - New file contents
+     * @returns Result with the saved contents or error
+     * @public
+     */
+    saveFileContents(path, contents) {
+        const result = super.saveFileContents(path, contents);
+        if (result.isSuccess()) {
+            this._dirtyFiles.add(path);
+            if (this._autoSync) {
+                const syncResult = this._syncFile(path);
+                if (syncResult.isSuccess()) {
+                    this._dirtyFiles.delete(path);
+                }
+                else {
+                    return (0, ts_utils_1.fail)(syncResult.message);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Check if a file is mutable and return persistence detail.
+     * @param path - File path to check
+     * @returns DetailedResult with mutability status and 'persistent' detail if mutable
+     * @public
+     */
+    fileIsMutable(path) {
+        const baseResult = super.fileIsMutable(path);
+        if (baseResult.isSuccess() && baseResult.value === true) {
+            return (0, ts_utils_1.succeedWithDetail)(true, 'persistent');
+        }
+        return baseResult;
+    }
+}
+exports.LocalStorageTreeAccessors = LocalStorageTreeAccessors;
+//# sourceMappingURL=localStorageTreeAccessors.js.map

package/lib/packlets/file-tree/localStorageTreeAccessors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"localStorageTreeAccessors.js","sourceRoot":"","sources":["../../../src/packlets/file-tree/localStorageTreeAccessors.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAEH,4CAAyF;AACzF,oDAA6C;AAC7C,oDAAkE;AA4BlE;;;;;;;;;;;;;GAaG;AACH,MAAa,yBACX,SAAQ,uBAAQ,CAAC,qBAA0B;IAS3C;;;OAGG;IACH,YACE,KAAoC,EACpC,OAAgB,EAChB,YAAiC,EACjC,MAAqC;;QAErC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,+FAA+F;QAC/F,IAAI,CAAC,SAAS,GAAG,MAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,QAAQ,mCAAI,KAAK,CAAC;IAC7C,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,WAAW,CACvB,MAAoC;;QAEpC,IAAI,CAAC;YACH,kHAAkH;YAClH,MAAM,OAAO,GAAG,MAAA,MAAM,CAAC,OAAO,mCAAI,CAAC,OAAO,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACpG,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,IAAA,eAAI,EAAC,+BAA+B,CAAC,CAAC;YAC/C,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;YAClE,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAM,OAAO,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;YAExE,OAAO,IAAA,kBAAO,EAAC,IAAI,yBAAyB,CAAM,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC;YACzF,qEAAqE;QACvE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,OAAO,IAAA,eAAI,EAAC,+CAA+C,OAAO,EAAE,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,gBAAgB,CAC7B,OAAgB,EAChB,YAAiC,EACjC,MAAqC;QAErC,MAAM,KAAK,GAAkC,EAAE,CAAC;QAEhD,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC5C,IAAI,CAAC,IAAA,2BAAY,EAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,SAAS;gBACX,CAAC;gBAED,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9D,gFAAgF;oBAChF,IAAI,UAAkB,CAAC;oBACvB,IAAI,SAAiB,CAAC;oBACtB,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;wBACjC,UAAU,GAAG,QAAQ,CAAC;wBACtB,0EAA0E;wBAC1E,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;oBAChE,CAAC;yBAAM,IAAI,IAAA,2BAAY,EAAC,QAAQ,CAAC,EAAE,CAAC;wBAClC,yCAAyC;wBACzC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;wBACtC,SAAS,GAAG,OAAO,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACN,SAAS;oBACX,CAAC;oBAED,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,GAAG,YAAY,GAAG,SAAS,EAAE,CAAC,CAAC;oBACzE,qFAAqF;oBACrF,MAAM,WAAW,GAAG,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,gBAAgB;wBAC1C,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,SAAS,EAAE;wBAC1D,CAAC,CAAC,SAAS,CAAC;oBAEd,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,QAAQ;wBACd,QAAQ,EAAE,UAAU;wBACpB,WAAW;qBACZ,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,WAAM,CAAC;gBACP,sBAAsB;gBACtB,SAAS;YACX,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,cAAc,CAAC,OAAe;QAC3C,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;QACpC,OAAO,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,SAAS,CAAC,IAAY,EAAE,IAAY;QACjD,gFAAgF;QAChF,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9D,OAAO,GAAG,SAAS,IAAI,SAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;OAGG;IACK,qBAAqB,CAAC,IAAY;QACxC,mCAAmC;QACnC,IAAI,SAAsD,CAAC;QAC3D,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;YACzD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,kHAAkH;gBAClH,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC1D,SAAS,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,GAAG,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,mBAAmB,CAAC,IAAY;QACtC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,qEAAqE;QACrE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACK,wBAAwB,CAAC,IAAY;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAChD,qEAAqE;QACrE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjD,6FAA6F;QAC7F,MAAM,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;QAEtF,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC5C,OAAO,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAAC,IAAY;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YACxC,IAAI,IAAA,2BAAY,EAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,MAAiC,CAAC;gBACnD,OAAO,QAAQ,CAAC,YAAY,CAAC,CAAC;gBAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC9D,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAAC,WAAM,CAAC;YACP,6CAA6C;QAC/C,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,IAAY;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,IAAA,eAAI,EAAC,uCAAuC,IAAI,EAAE,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,mCAAmC,IAAI,KAAK,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;QACpF,CAAC;QAED,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;YAEtC,kCAAkC;YAClC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACvD,IAAI,QAAQ,GAA4B,EAAE,CAAC;YAC3C,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;oBACxC,IAAI,IAAA,2BAAY,EAAC,MAAM,CAAC,EAAE,CAAC;wBACzB,QAAQ,GAAG,MAAiC,CAAC;oBAC/C,CAAC;gBACH,CAAC;gBAAC,WAAM,CAAC;oBACP,2BAA2B;gBAC7B,CAAC;YACH,CAAC;YAED,gEAAgE;YAChE,QAAQ,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;YAE5D,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;YAC1B,4FAA4F;QAC9F,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,OAAO,IAAA,eAAI,EAAC,uBAAuB,IAAI,KAAK,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,UAAU;QACrB,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,IAAA,eAAI,EAAC,kBAAkB,MAAM,CAAC,MAAM,aAAa,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACI,aAAa;QAClB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED;;;;;OAKG;IACI,UAAU,CAAC,IAAY;QAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,gBAAgB,CAAC,IAAY,EAAE,QAAgB;QACpD,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACtD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;oBAC3B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,aAAa,CAAC,IAAY;QAC/B,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,UAAU,CAAC,SAAS,EAAE,IAAI,UAAU,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxD,OAAO,IAAA,4BAAiB,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;CACF;AA3WD,8DA2WC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { DetailedResult, fail, Result, succeed, succeedWithDetail } from '@fgv/ts-utils';\nimport { FileTree } from '@fgv/ts-json-base';\nimport { isJsonObject, type JsonObject } from '@fgv/ts-json-base';\n\n/**\n * Configuration for LocalStorageTreeAccessors.\n * @public\n */\nexport interface ILocalStorageTreeParams<TCT extends string = string>\n  extends FileTree.IFileTreeInitParams<TCT> {\n  /**\n   * Map of directory path prefixes to localStorage keys.\n   * Files under each prefix are stored in the corresponding localStorage key.\n   * Example: \\{ '/data/ingredients': 'myapp:ingredients:v1' \\}\n   */\n  pathToKeyMap: Record<string, string>;\n\n  /**\n   * Storage instance to use. Defaults to window.localStorage.\n   * Can be overridden for testing with mock storage.\n   */\n  storage?: Storage;\n\n  /**\n   * If true, automatically sync changes to localStorage on every modification.\n   * If false (default), changes are only synced when syncToDisk() is called.\n   */\n  autoSync?: boolean;\n}\n\n/**\n * Browser localStorage-backed file tree accessors with persistence support.\n *\n * Maps filesystem-like directory paths to localStorage keys, where each key stores\n * multiple collections as a JSON object. This provides a general-purpose implementation\n * for browser-based file tree persistence without requiring File System Access API.\n *\n * Storage format per key: `{ \"collection-id\": \"<raw file content>\" }`\n * File paths map as: `/data/ingredients/collection-id.yaml` → stored in key for `/data/ingredients`\n *\n * Legacy format (v1): `{ \"collection-id\": { ...parsedJsonObject } }` is auto-migrated on load.\n *\n * @public\n */\nexport class LocalStorageTreeAccessors<TCT extends string = string>\n  extends FileTree.InMemoryTreeAccessors<TCT>\n  implements FileTree.IPersistentFileTreeAccessors<TCT>\n{\n  private readonly _storage: Storage;\n  private readonly _pathToKeyMap: Map<string, string>;\n  private readonly _keyToPathMap: Map<string, string>;\n  private readonly _dirtyFiles: Set<string>;\n  private readonly _autoSync: boolean;\n\n  /**\n   * Private constructor. Use fromStorage() factory method instead.\n   * @internal\n   */\n  private constructor(\n    files: FileTree.IInMemoryFile<TCT>[],\n    storage: Storage,\n    pathToKeyMap: Map<string, string>,\n    params?: ILocalStorageTreeParams<TCT>\n  ) {\n    super(files, params);\n    this._storage = storage;\n    this._pathToKeyMap = pathToKeyMap;\n    this._keyToPathMap = new Map(Array.from(pathToKeyMap.entries()).map(([k, v]) => [v, k]));\n    this._dirtyFiles = new Set();\n    /* c8 ignore next 1 - intermittent branch coverage: ?? false branch when params is undefined */\n    this._autoSync = params?.autoSync ?? false;\n  }\n\n  /**\n   * Create LocalStorageTreeAccessors from browser localStorage.\n   * Loads all collections from the configured storage keys.\n   *\n   * @param params - Configuration including path-to-key mappings\n   * @returns Result containing the accessors or an error\n   * @public\n   */\n  public static fromStorage<TCT extends string = string>(\n    params: ILocalStorageTreeParams<TCT>\n  ): Result<LocalStorageTreeAccessors<TCT>> {\n    try {\n      /* c8 ignore next 1 - intermittent branch coverage: window.localStorage branch when params.storage is undefined */\n      const storage = params.storage ?? (typeof window !== 'undefined' ? window.localStorage : undefined);\n      if (!storage) {\n        return fail('localStorage is not available');\n      }\n\n      const pathToKeyMap = new Map(Object.entries(params.pathToKeyMap));\n      const files = this._loadFromStorage<TCT>(storage, pathToKeyMap, params);\n\n      return succeed(new LocalStorageTreeAccessors<TCT>(files, storage, pathToKeyMap, params));\n      /* c8 ignore next 4 - defensive: outer catch for unexpected errors */\n    } catch (error) {\n      const message = error instanceof Error ? error.message : String(error);\n      return fail(`Failed to create LocalStorageTreeAccessors: ${message}`);\n    }\n  }\n\n  /**\n   * Load all files from localStorage based on path-to-key mappings.\n   * @internal\n   */\n  private static _loadFromStorage<TCT extends string = string>(\n    storage: Storage,\n    pathToKeyMap: Map<string, string>,\n    params?: ILocalStorageTreeParams<TCT>\n  ): FileTree.IInMemoryFile<TCT>[] {\n    const files: FileTree.IInMemoryFile<TCT>[] = [];\n\n    for (const [dataPath, storageKey] of pathToKeyMap.entries()) {\n      const rawJson = storage.getItem(storageKey);\n      if (!rawJson) {\n        continue;\n      }\n\n      try {\n        const parsed: unknown = JSON.parse(rawJson);\n        if (!isJsonObject(parsed)) {\n          continue;\n        }\n\n        for (const [collectionId, contents] of Object.entries(parsed)) {\n          // Support both new format (string values) and legacy format (JsonObject values)\n          let rawContent: string;\n          let extension: string;\n          if (typeof contents === 'string') {\n            rawContent = contents;\n            // Infer extension: if content looks like JSON, use .json; otherwise .yaml\n            extension = this._looksLikeJson(contents) ? '.json' : '.yaml';\n          } else if (isJsonObject(contents)) {\n            // Legacy format: migrate by stringifying\n            rawContent = JSON.stringify(contents);\n            extension = '.json';\n          } else {\n            continue;\n          }\n\n          const filePath = this._joinPath(dataPath, `${collectionId}${extension}`);\n          /* c8 ignore next 3 - intermittent branch coverage: ternary branches in tight loop */\n          const contentType = params?.inferContentType\n            ? params.inferContentType(filePath, undefined).orDefault()\n            : undefined;\n\n          files.push({\n            path: filePath,\n            contents: rawContent,\n            contentType\n          });\n        }\n      } catch {\n        // Skip corrupted data\n        continue;\n      }\n    }\n\n    return files;\n  }\n\n  /**\n   * Heuristic check: does the content look like JSON?\n   * @internal\n   */\n  private static _looksLikeJson(content: string): boolean {\n    const trimmed = content.trimStart();\n    return trimmed.startsWith('{') || trimmed.startsWith('[');\n  }\n\n  /**\n   * Join path components, handling leading/trailing slashes.\n   * @internal\n   */\n  private static _joinPath(base: string, name: string): string {\n    /* c8 ignore next 2 - intermittent branch coverage: slash-trimming edge cases */\n    const cleanBase = base.endsWith('/') ? base.slice(0, -1) : base;\n    const cleanName = name.startsWith('/') ? name.slice(1) : name;\n    return `${cleanBase}/${cleanName}`;\n  }\n\n  /**\n   * Get the storage key for a given file path.\n   * @internal\n   */\n  private _getStorageKeyForPath(path: string): string | undefined {\n    // Find the longest matching prefix\n    let bestMatch: { prefix: string; key: string } | undefined;\n    for (const [prefix, key] of this._pathToKeyMap.entries()) {\n      if (path.startsWith(prefix)) {\n        /* c8 ignore next 1 - intermittent: overlapping-prefix branch requires two matching prefixes in iteration order */\n        if (!bestMatch || prefix.length > bestMatch.prefix.length) {\n          bestMatch = { prefix, key };\n        }\n      }\n    }\n    return bestMatch?.key;\n  }\n\n  /**\n   * Get the data path prefix for a given file path.\n   * @internal\n   */\n  private _getDataPathForPath(path: string): string | undefined {\n    for (const prefix of this._pathToKeyMap.keys()) {\n      if (path.startsWith(prefix)) {\n        return prefix;\n      }\n    }\n    /* c8 ignore next 2 - coverage intermittently missed in full suite */\n    return undefined;\n  }\n\n  /**\n   * Extract collection ID from a file path.\n   * Example: '/data/ingredients/my-collection.yaml' → 'my-collection'\n   * @internal\n   */\n  private _getCollectionIdFromPath(path: string): string {\n    const dataPath = this._getDataPathForPath(path);\n    /* c8 ignore next 3 - coverage intermittently missed in full suite */\n    if (!dataPath) {\n      return path;\n    }\n\n    const relativePath = path.slice(dataPath.length);\n    /* c8 ignore next 1 - defensive: relativePath always starts with / when paths are absolute */\n    const cleanPath = relativePath.startsWith('/') ? relativePath.slice(1) : relativePath;\n\n    // Remove any file extension\n    const dotIndex = cleanPath.lastIndexOf('.');\n    return dotIndex > 0 ? cleanPath.slice(0, dotIndex) : cleanPath;\n  }\n\n  /**\n   * Remove a file's entry from its localStorage key.\n   * @internal\n   */\n  private _deleteFileFromStorage(path: string): void {\n    const storageKey = this._getStorageKeyForPath(path);\n    if (!storageKey) {\n      return;\n    }\n\n    const collectionId = this._getCollectionIdFromPath(path);\n    const existingJson = this._storage.getItem(storageKey);\n    if (!existingJson) {\n      return;\n    }\n\n    try {\n      const parsed = JSON.parse(existingJson);\n      if (isJsonObject(parsed)) {\n        const existing = parsed as Record<string, unknown>;\n        delete existing[collectionId];\n        if (Object.keys(existing).length > 0) {\n          this._storage.setItem(storageKey, JSON.stringify(existing));\n        } else {\n          this._storage.removeItem(storageKey);\n        }\n      }\n    } catch {\n      // Storage is corrupted — nothing to clean up\n    }\n  }\n\n  /**\n   * Sync a single dirty file to localStorage.\n   * @internal\n   */\n  private _syncFile(path: string): Result<void> {\n    const storageKey = this._getStorageKeyForPath(path);\n    if (!storageKey) {\n      return fail(`No storage key configured for path: ${path}`);\n    }\n\n    const collectionId = this._getCollectionIdFromPath(path);\n    const contentsResult = this.getFileContents(path);\n    if (contentsResult.isFailure()) {\n      return fail(`Failed to get file contents for ${path}: ${contentsResult.message}`);\n    }\n\n    try {\n      const contents = contentsResult.value;\n\n      // Load existing data from storage\n      const existingJson = this._storage.getItem(storageKey);\n      let existing: Record<string, unknown> = {};\n      if (existingJson) {\n        try {\n          const parsed = JSON.parse(existingJson);\n          if (isJsonObject(parsed)) {\n            existing = parsed as Record<string, unknown>;\n          }\n        } catch {\n          // Start fresh if corrupted\n        }\n      }\n\n      // Store raw content string (content-agnostic: JSON, YAML, etc.)\n      existing[collectionId] = contents;\n      this._storage.setItem(storageKey, JSON.stringify(existing));\n\n      return succeed(undefined);\n      /* c8 ignore next 4 - defensive: only triggers on storage quota or similar runtime errors */\n    } catch (error) {\n      const message = error instanceof Error ? error.message : String(error);\n      return fail(`Failed to sync file ${path}: ${message}`);\n    }\n  }\n\n  /**\n   * Sync all dirty files to localStorage.\n   * @returns Result indicating success or failure\n   * @public\n   */\n  public async syncToDisk(): Promise<Result<void>> {\n    if (this._dirtyFiles.size === 0) {\n      return succeed(undefined);\n    }\n\n    const errors: string[] = [];\n    for (const path of this._dirtyFiles) {\n      const result = this._syncFile(path);\n      if (result.isFailure()) {\n        errors.push(result.message);\n      }\n    }\n\n    if (errors.length > 0) {\n      return fail(`Failed to sync ${errors.length} file(s): ${errors.join('; ')}`);\n    }\n\n    this._dirtyFiles.clear();\n    return succeed(undefined);\n  }\n\n  /**\n   * Check if there are unsaved changes.\n   * @returns True if there are dirty files\n   * @public\n   */\n  public isDirty(): boolean {\n    return this._dirtyFiles.size > 0;\n  }\n\n  /**\n   * Get list of file paths with unsaved changes.\n   * @returns Array of dirty file paths\n   * @public\n   */\n  public getDirtyPaths(): string[] {\n    return Array.from(this._dirtyFiles);\n  }\n\n  /**\n   * Delete a file and remove it from localStorage.\n   * @param path - File path to delete\n   * @returns Result with true if deleted, or error\n   * @public\n   */\n  public deleteFile(path: string): Result<boolean> {\n    const result = super.deleteFile(path);\n    if (result.isSuccess()) {\n      this._dirtyFiles.delete(path);\n      this._deleteFileFromStorage(path);\n    }\n    return result;\n  }\n\n  /**\n   * Save file contents. Marks file as dirty and optionally auto-syncs.\n   * @param path - File path\n   * @param contents - New file contents\n   * @returns Result with the saved contents or error\n   * @public\n   */\n  public saveFileContents(path: string, contents: string): Result<string> {\n    const result = super.saveFileContents(path, contents);\n    if (result.isSuccess()) {\n      this._dirtyFiles.add(path);\n      if (this._autoSync) {\n        const syncResult = this._syncFile(path);\n        if (syncResult.isSuccess()) {\n          this._dirtyFiles.delete(path);\n        } else {\n          return fail(syncResult.message);\n        }\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Check if a file is mutable and return persistence detail.\n   * @param path - File path to check\n   * @returns DetailedResult with mutability status and 'persistent' detail if mutable\n   * @public\n   */\n  public fileIsMutable(path: string): DetailedResult<boolean, FileTree.SaveDetail> {\n    const baseResult = super.fileIsMutable(path);\n    if (baseResult.isSuccess() && baseResult.value === true) {\n      return succeedWithDetail(true, 'persistent');\n    }\n    return baseResult;\n  }\n}\n"]}

package/lib/test/mocks/idb-keyval.d.ts

@@ -0,0 +1,6 @@
+export declare const createStore: jest.Mock<{}, [], any>;
+export declare const get: jest.Mock<any, any, any>;
+export declare const set: jest.Mock<any, any, any>;
+export declare const del: jest.Mock<any, any, any>;
+export declare const keys: jest.Mock<any, any, any>;
+//# sourceMappingURL=idb-keyval.d.ts.map

package/lib/test/mocks/idb-keyval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"idb-keyval.d.ts","sourceRoot":"","sources":["../../../src/test/mocks/idb-keyval.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,WAAW,wBAAsB,CAAC;AAC/C,eAAO,MAAM,GAAG,0BAAY,CAAC;AAC7B,eAAO,MAAM,GAAG,0BAAY,CAAC;AAC7B,eAAO,MAAM,GAAG,0BAAY,CAAC;AAC7B,eAAO,MAAM,IAAI,0BAAY,CAAC"}

package/lib/test/mocks/idb-keyval.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.keys = exports.del = exports.set = exports.get = exports.createStore = void 0;
+exports.createStore = jest.fn(() => ({}));
+exports.get = jest.fn();
+exports.set = jest.fn();
+exports.del = jest.fn();
+exports.keys = jest.fn();
+//# sourceMappingURL=idb-keyval.js.map

package/lib/test/mocks/idb-keyval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"idb-keyval.js","sourceRoot":"","sources":["../../../src/test/mocks/idb-keyval.ts"],"names":[],"mappings":";;;AAAa,QAAA,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,QAAA,GAAG,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC;AAChB,QAAA,GAAG,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC;AAChB,QAAA,GAAG,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC;AAChB,QAAA,IAAI,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC","sourcesContent":["export const createStore = jest.fn(() => ({}));\nexport const get = jest.fn();\nexport const set = jest.fn();\nexport const del = jest.fn();\nexport const keys = jest.fn();\n"]}

package/lib/test/unit/browserHashProvider.test.js

@@ -22,40 +22,40 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 require("@fgv/ts-utils-jest");
-const crypto_1 = require("../../packlets/crypto");
+const crypto_utils_1 = require("../../packlets/crypto-utils");
 describe('BrowserHashProvider', () => {
     describe('hashString', () => {
         test('successfully hashes a string with SHA-256', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('test data', 'SHA-256');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test data', 'SHA-256');
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(typeof hash).toBe('string');
                 expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters
             });
         });
         test('successfully hashes a string with SHA-1', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('test data', 'SHA-1');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test data', 'SHA-1');
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(typeof hash).toBe('string');
                 expect(hash).toMatch(/^[a-f0-9]{40}$/); // SHA-1 produces 40 hex characters
             });
         });
         test('successfully hashes a string with SHA-512', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('test data', 'SHA-512');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test data', 'SHA-512');
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(typeof hash).toBe('string');
                 expect(hash).toMatch(/^[a-f0-9]{128}$/); // SHA-512 produces 128 hex characters
             });
         });
         test('uses SHA-256 as default algorithm', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('test data');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test data');
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters
             });
         });
         test('produces consistent hash for same input', async () => {
             const input = 'consistent input';
-            const result1 = await crypto_1.BrowserHashProvider.hashString(input);
-            const result2 = await crypto_1.BrowserHashProvider.hashString(input);
+            const result1 = await crypto_utils_1.BrowserHashProvider.hashString(input);
+            const result2 = await crypto_utils_1.BrowserHashProvider.hashString(input);
             expect(result1).toSucceed();
             expect(result2).toSucceed();
             if (result1.isSuccess() && result2.isSuccess()) {
@@ -63,8 +63,8 @@ describe('BrowserHashProvider', () => {
             }
         });
         test('produces different hashes for different inputs', async () => {
-            const result1 = await crypto_1.BrowserHashProvider.hashString('input1');
-            const result2 = await crypto_1.BrowserHashProvider.hashString('input2');
+            const result1 = await crypto_utils_1.BrowserHashProvider.hashString('input1');
+            const result2 = await crypto_utils_1.BrowserHashProvider.hashString('input2');
             expect(result1).toSucceed();
             expect(result2).toSucceed();
             if (result1.isSuccess() && result2.isSuccess()) {
@@ -72,11 +72,11 @@ describe('BrowserHashProvider', () => {
             }
         });
         test('handles empty string input', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('');
             expect(result).toSucceed();
         });
         test('handles unicode input', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('🚀 Unicode test 测试');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('🚀 Unicode test 测试');
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(hash).toMatch(/^[a-f0-9]{64}$/);
             });
@@ -85,27 +85,27 @@ describe('BrowserHashProvider', () => {
             const originalCrypto = global.crypto;
             // @ts-ignore - Intentionally removing crypto for test
             delete global.crypto;
-            const result = await crypto_1.BrowserHashProvider.hashString('test');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test');
             expect(result).toFailWith(/Hash computation failed/);
             global.crypto = originalCrypto;
         });
         test('handles invalid algorithm gracefully', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashString('test', 'INVALID-ALG');
+            const result = await crypto_utils_1.BrowserHashProvider.hashString('test', 'INVALID-ALG');
             expect(result).toFailWith(/Hash computation failed/);
         });
     });
     describe('hashParts', () => {
         test('hashes multiple parts with default separator', async () => {
             const parts = ['part1', 'part2', 'part3'];
-            const result = await crypto_1.BrowserHashProvider.hashParts(parts);
+            const result = await crypto_utils_1.BrowserHashProvider.hashParts(parts);
             expect(result).toSucceedAndSatisfy((hash) => {
                 expect(hash).toMatch(/^[a-f0-9]{64}$/);
             });
         });
         test('hashes multiple parts with custom separator', async () => {
             const parts = ['part1', 'part2', 'part3'];
-            const result1 = await crypto_1.BrowserHashProvider.hashParts(parts, 'SHA-256', '|');
-            const result2 = await crypto_1.BrowserHashProvider.hashParts(parts, 'SHA-256', ',');
+            const result1 = await crypto_utils_1.BrowserHashProvider.hashParts(parts, 'SHA-256', '|');
+            const result2 = await crypto_utils_1.BrowserHashProvider.hashParts(parts, 'SHA-256', ',');
             expect(result1).toSucceed();
             expect(result2).toSucceed();
             if (result1.isSuccess() && result2.isSuccess()) {
@@ -116,8 +116,8 @@ describe('BrowserHashProvider', () => {
             const parts = ['a', 'b', 'c'];
             const separator = '-';
             const joined = parts.join(separator);
-            const partsResult = await crypto_1.BrowserHashProvider.hashParts(parts, 'SHA-256', separator);
-            const stringResult = await crypto_1.BrowserHashProvider.hashString(joined);
+            const partsResult = await crypto_utils_1.BrowserHashProvider.hashParts(parts, 'SHA-256', separator);
+            const stringResult = await crypto_utils_1.BrowserHashProvider.hashString(joined);
             expect(partsResult).toSucceed();
             expect(stringResult).toSucceed();
             if (partsResult.isSuccess() && stringResult.isSuccess()) {
@@ -125,12 +125,12 @@ describe('BrowserHashProvider', () => {
             }
         });
         test('handles empty array', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashParts([]);
+            const result = await crypto_utils_1.BrowserHashProvider.hashParts([]);
             expect(result).toSucceed();
         });
         test('handles single part', async () => {
-            const result = await crypto_1.BrowserHashProvider.hashParts(['single']);
-            const stringResult = await crypto_1.BrowserHashProvider.hashString('single');
+            const result = await crypto_utils_1.BrowserHashProvider.hashParts(['single']);
+            const stringResult = await crypto_utils_1.BrowserHashProvider.hashString('single');
             expect(result).toSucceed();
             expect(stringResult).toSucceed();
             if (result.isSuccess() && stringResult.isSuccess()) {

package/lib/test/unit/browserHashProvider.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"browserHashProvider.test.js","sourceRoot":"","sources":["../../../src/test/unit/browserHashProvider.test.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;AAEH,8BAA4B;AAC5B,kDAA4D;AAE5D,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAC5E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,qCAAqC;YAC/E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,mCAAmC;YAC7E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAC5E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,sCAAsC;YACjF,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;YACnD,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YACjE,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,qCAAqC;YAC/E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,KAAK,GAAG,kBAAkB,CAAC;YACjC,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC5D,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;YAChE,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,KAAK,IAAI,EAAE;YAC5C,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uBAAuB,EAAE,KAAK,IAAI,EAAE;YACvC,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;YACrC,sDAAsD;YACtD,OAAO,MAAM,CAAC,MAAM,CAAC;YACrB,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC5D,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC;YACrD,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;YACtD,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;YAC9D,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;YAC7D,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAC3E,MAAM,OAAO,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAC3E,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;YACnE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,MAAM,SAAS,GAAG,GAAG,CAAC;YACtB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,WAAW,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACrF,MAAM,YAAY,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,CAAC,WAAW,CAAC,CAAC,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,WAAW,CAAC,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;gBACxD,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YACrD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAqB,EAAE,KAAK,IAAI,EAAE;YACrC,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAqB,EAAE,KAAK,IAAI,EAAE;YACrC,MAAM,MAAM,GAAG,MAAM,4BAAmB,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/D,MAAM,YAAY,GAAG,MAAM,4BAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACpE,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;YAC3B,MAAM,CAAC,YAAY,CAAC,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;gBACnD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2025 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport '@fgv/ts-utils-jest';\nimport { BrowserHashProvider } from '../../packlets/crypto';\n\ndescribe('BrowserHashProvider', () => {\n  describe('hashString', () => {\n    test('successfully hashes a string with SHA-256', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-256');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters\n      });\n    });\n\n    test('successfully hashes a string with SHA-1', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-1');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{40}$/); // SHA-1 produces 40 hex characters\n      });\n    });\n\n    test('successfully hashes a string with SHA-512', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-512');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{128}$/); // SHA-512 produces 128 hex characters\n      });\n    });\n\n    test('uses SHA-256 as default algorithm', async () => {\n      const result = await BrowserHashProvider.hashString('test data');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters\n      });\n    });\n\n    test('produces consistent hash for same input', async () => {\n      const input = 'consistent input';\n      const result1 = await BrowserHashProvider.hashString(input);\n      const result2 = await BrowserHashProvider.hashString(input);\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).toBe(result2.value);\n      }\n    });\n\n    test('produces different hashes for different inputs', async () => {\n      const result1 = await BrowserHashProvider.hashString('input1');\n      const result2 = await BrowserHashProvider.hashString('input2');\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).not.toBe(result2.value);\n      }\n    });\n\n    test('handles empty string input', async () => {\n      const result = await BrowserHashProvider.hashString('');\n      expect(result).toSucceed();\n    });\n\n    test('handles unicode input', async () => {\n      const result = await BrowserHashProvider.hashString('🚀 Unicode test 测试');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/);\n      });\n    });\n\n    test('fails when crypto.subtle is unavailable', async () => {\n      const originalCrypto = global.crypto;\n      // @ts-ignore - Intentionally removing crypto for test\n      delete global.crypto;\n      const result = await BrowserHashProvider.hashString('test');\n      expect(result).toFailWith(/Hash computation failed/);\n      global.crypto = originalCrypto;\n    });\n\n    test('handles invalid algorithm gracefully', async () => {\n      const result = await BrowserHashProvider.hashString('test', 'INVALID-ALG');\n      expect(result).toFailWith(/Hash computation failed/);\n    });\n  });\n\n  describe('hashParts', () => {\n    test('hashes multiple parts with default separator', async () => {\n      const parts = ['part1', 'part2', 'part3'];\n      const result = await BrowserHashProvider.hashParts(parts);\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/);\n      });\n    });\n\n    test('hashes multiple parts with custom separator', async () => {\n      const parts = ['part1', 'part2', 'part3'];\n      const result1 = await BrowserHashProvider.hashParts(parts, 'SHA-256', '|');\n      const result2 = await BrowserHashProvider.hashParts(parts, 'SHA-256', ',');\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).not.toBe(result2.value);\n      }\n    });\n\n    test('produces same hash as hashString for joined parts', async () => {\n      const parts = ['a', 'b', 'c'];\n      const separator = '-';\n      const joined = parts.join(separator);\n      const partsResult = await BrowserHashProvider.hashParts(parts, 'SHA-256', separator);\n      const stringResult = await BrowserHashProvider.hashString(joined);\n      expect(partsResult).toSucceed();\n      expect(stringResult).toSucceed();\n      if (partsResult.isSuccess() && stringResult.isSuccess()) {\n        expect(partsResult.value).toBe(stringResult.value);\n      }\n    });\n\n    test('handles empty array', async () => {\n      const result = await BrowserHashProvider.hashParts([]);\n      expect(result).toSucceed();\n    });\n\n    test('handles single part', async () => {\n      const result = await BrowserHashProvider.hashParts(['single']);\n      const stringResult = await BrowserHashProvider.hashString('single');\n      expect(result).toSucceed();\n      expect(stringResult).toSucceed();\n      if (result.isSuccess() && stringResult.isSuccess()) {\n        expect(result.value).toBe(stringResult.value);\n      }\n    });\n  });\n});\n"]}
+{"version":3,"file":"browserHashProvider.test.js","sourceRoot":"","sources":["../../../src/test/unit/browserHashProvider.test.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;AAEH,8BAA4B;AAC5B,8DAAkE;AAElE,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAC5E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,qCAAqC;YAC/E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,mCAAmC;YAC7E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAC5E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,sCAAsC;YACjF,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;YACnD,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YACjE,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,qCAAqC;YAC/E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,KAAK,GAAG,kBAAkB,CAAC;YACjC,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC5D,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;YAChE,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,KAAK,IAAI,EAAE;YAC5C,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uBAAuB,EAAE,KAAK,IAAI,EAAE;YACvC,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;YACrC,sDAAsD;YACtD,OAAO,MAAM,CAAC,MAAM,CAAC;YACrB,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC5D,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC;YACrD,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;YACtD,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;YAC9D,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;YAC7D,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAC3E,MAAM,OAAO,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAC3E,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;YACnE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,MAAM,SAAS,GAAG,GAAG,CAAC;YACtB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,WAAW,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACrF,MAAM,YAAY,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,CAAC,WAAW,CAAC,CAAC,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,WAAW,CAAC,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;gBACxD,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YACrD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAqB,EAAE,KAAK,IAAI,EAAE;YACrC,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAqB,EAAE,KAAK,IAAI,EAAE;YACrC,MAAM,MAAM,GAAG,MAAM,kCAAmB,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/D,MAAM,YAAY,GAAG,MAAM,kCAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACpE,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;YAC3B,MAAM,CAAC,YAAY,CAAC,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;gBACnD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2025 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport '@fgv/ts-utils-jest';\nimport { BrowserHashProvider } from '../../packlets/crypto-utils';\n\ndescribe('BrowserHashProvider', () => {\n  describe('hashString', () => {\n    test('successfully hashes a string with SHA-256', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-256');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters\n      });\n    });\n\n    test('successfully hashes a string with SHA-1', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-1');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{40}$/); // SHA-1 produces 40 hex characters\n      });\n    });\n\n    test('successfully hashes a string with SHA-512', async () => {\n      const result = await BrowserHashProvider.hashString('test data', 'SHA-512');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(typeof hash).toBe('string');\n        expect(hash).toMatch(/^[a-f0-9]{128}$/); // SHA-512 produces 128 hex characters\n      });\n    });\n\n    test('uses SHA-256 as default algorithm', async () => {\n      const result = await BrowserHashProvider.hashString('test data');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/); // SHA-256 produces 64 hex characters\n      });\n    });\n\n    test('produces consistent hash for same input', async () => {\n      const input = 'consistent input';\n      const result1 = await BrowserHashProvider.hashString(input);\n      const result2 = await BrowserHashProvider.hashString(input);\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).toBe(result2.value);\n      }\n    });\n\n    test('produces different hashes for different inputs', async () => {\n      const result1 = await BrowserHashProvider.hashString('input1');\n      const result2 = await BrowserHashProvider.hashString('input2');\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).not.toBe(result2.value);\n      }\n    });\n\n    test('handles empty string input', async () => {\n      const result = await BrowserHashProvider.hashString('');\n      expect(result).toSucceed();\n    });\n\n    test('handles unicode input', async () => {\n      const result = await BrowserHashProvider.hashString('🚀 Unicode test 测试');\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/);\n      });\n    });\n\n    test('fails when crypto.subtle is unavailable', async () => {\n      const originalCrypto = global.crypto;\n      // @ts-ignore - Intentionally removing crypto for test\n      delete global.crypto;\n      const result = await BrowserHashProvider.hashString('test');\n      expect(result).toFailWith(/Hash computation failed/);\n      global.crypto = originalCrypto;\n    });\n\n    test('handles invalid algorithm gracefully', async () => {\n      const result = await BrowserHashProvider.hashString('test', 'INVALID-ALG');\n      expect(result).toFailWith(/Hash computation failed/);\n    });\n  });\n\n  describe('hashParts', () => {\n    test('hashes multiple parts with default separator', async () => {\n      const parts = ['part1', 'part2', 'part3'];\n      const result = await BrowserHashProvider.hashParts(parts);\n      expect(result).toSucceedAndSatisfy((hash) => {\n        expect(hash).toMatch(/^[a-f0-9]{64}$/);\n      });\n    });\n\n    test('hashes multiple parts with custom separator', async () => {\n      const parts = ['part1', 'part2', 'part3'];\n      const result1 = await BrowserHashProvider.hashParts(parts, 'SHA-256', '|');\n      const result2 = await BrowserHashProvider.hashParts(parts, 'SHA-256', ',');\n      expect(result1).toSucceed();\n      expect(result2).toSucceed();\n      if (result1.isSuccess() && result2.isSuccess()) {\n        expect(result1.value).not.toBe(result2.value);\n      }\n    });\n\n    test('produces same hash as hashString for joined parts', async () => {\n      const parts = ['a', 'b', 'c'];\n      const separator = '-';\n      const joined = parts.join(separator);\n      const partsResult = await BrowserHashProvider.hashParts(parts, 'SHA-256', separator);\n      const stringResult = await BrowserHashProvider.hashString(joined);\n      expect(partsResult).toSucceed();\n      expect(stringResult).toSucceed();\n      if (partsResult.isSuccess() && stringResult.isSuccess()) {\n        expect(partsResult.value).toBe(stringResult.value);\n      }\n    });\n\n    test('handles empty array', async () => {\n      const result = await BrowserHashProvider.hashParts([]);\n      expect(result).toSucceed();\n    });\n\n    test('handles single part', async () => {\n      const result = await BrowserHashProvider.hashParts(['single']);\n      const stringResult = await BrowserHashProvider.hashString('single');\n      expect(result).toSucceed();\n      expect(stringResult).toSucceed();\n      if (result.isSuccess() && stringResult.isSuccess()) {\n        expect(result.value).toBe(stringResult.value);\n      }\n    });\n  });\n});\n"]}

package/lib/test/unit/directoryHandleStore.test.d.ts

@@ -0,0 +1,2 @@
+import '@fgv/ts-utils-jest';
+//# sourceMappingURL=directoryHandleStore.test.d.ts.map

package/lib/test/unit/directoryHandleStore.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"directoryHandleStore.test.d.ts","sourceRoot":"","sources":["../../../src/test/unit/directoryHandleStore.test.ts"],"names":[],"mappings":"AAsBA,OAAO,oBAAoB,CAAC"}