@fgv/ts-extras 5.0.0-3 → 5.0.0-30

package/CHANGELOG.json

@@ -1,21 +1,6 @@
 {
   "name": "@fgv/ts-extras",
   "entries": [
-    {
-      "version": "5.0.0",
-      "tag": "@fgv/ts-extras_v5.0.0",
-      "date": "Thu, 17 Jul 2025 00:13:24 GMT",
-      "comments": {
-        "none": [
-          {
-            "comment": "upgrade dependencies"
-          },
-          {
-            "comment": "bump version"
-          }
-        ]
-      }
-    },
     {
       "version": "4.6.0",
       "tag": "@fgv/ts-extras_v4.6.0",

package/dist/ts-extras.d.ts

@@ -523,9 +523,9 @@ export { ZipFileTree }
  */
 declare class ZipFileTreeAccessors implements FileTree.IFileTreeAccessors {
     /**
-     * The AdmZip instance containing the archive.
+     * The unzipped file data.
      */
-    private readonly _zip;
+    private readonly _files;
     /**
      * Optional prefix to prepend to paths.
      */
@@ -536,17 +536,24 @@ declare class ZipFileTreeAccessors implements FileTree.IFileTreeAccessors {
     private readonly _itemCache;
     /**
      * Constructor for ZipFileTreeAccessors.
-     * @param zip - The AdmZip instance.
+     * @param files - The unzipped file data from fflate.
      * @param prefix - Optional prefix to prepend to paths.
      */
     private constructor();
     /**
-     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer.
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (synchronous).
      * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
      * @param prefix - Optional prefix to prepend to paths.
      * @returns Result containing the ZipFileTreeAccessors instance.
      */
     static fromBuffer(zipBuffer: ArrayBuffer | Uint8Array, prefix?: string): Result<ZipFileTreeAccessors>;
+    /**
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (asynchronous).
+     * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
+     * @param prefix - Optional prefix to prepend to paths.
+     * @returns Promise containing Result with the ZipFileTreeAccessors instance.
+     */
+    static fromBufferAsync(zipBuffer: ArrayBuffer | Uint8Array, prefix?: string): Promise<Result<ZipFileTreeAccessors>>;
     /**
      * Creates a new ZipFileTreeAccessors instance from a File object (browser environment).
      * @param file - The File object containing ZIP data.

package/dist/tsdoc-metadata.json

@@ -5,7 +5,7 @@
   "toolPackages": [
     {
       "packageName": "@microsoft/api-extractor",
-      "packageVersion": "7.49.1"
+      "packageVersion": "7.52.12"
     }
   ]
 }

package/eslint.config.js

@@ -0,0 +1,16 @@
+// ESLint 9 flat config
+const nodeProfile = require('@rushstack/eslint-config/flat/profile/node');
+const packletsPlugin = require('@rushstack/eslint-config/flat/mixins/packlets');
+const tsdocPlugin = require('@rushstack/eslint-config/flat/mixins/tsdoc');
+
+module.exports = [
+  ...nodeProfile,
+  packletsPlugin,
+  ...tsdocPlugin,
+  {
+    // Override specific rules if needed
+    rules: {
+      '@rushstack/packlets/mechanics': 'warn'
+    }
+  }
+];

package/lib/packlets/csv/csvHelpers.js

@@ -71,7 +71,6 @@ function readCsvFileSync(srcPath, options) {
         const fullPath = path.resolve(srcPath);
         const body = fs.readFileSync(fullPath, 'utf8').toString();
         options = options !== null && options !== void 0 ? options : {};
-        // eslint-disable-next-line
         return (0, papaparse_1.parse)(body, Object.assign({ transform: (s) => s.trim(), header: false, dynamicTyping: false, skipEmptyLines: 'greedy' }, options)).data.slice(1);
     });
 }

package/lib/packlets/record-jar/recordJarHelpers.js

@@ -60,7 +60,6 @@ const fs = __importStar(require("fs"));
 const path = __importStar(require("path"));
 const ts_utils_1 = require("@fgv/ts-utils");
 class RecordParser {
-    // eslint-disable-next-line @typescript-eslint/no-empty-function
     constructor(options) {
         this.records = [];
         this._fields = {};

package/lib/packlets/zip-file-tree/zipFileTreeAccessors.d.ts

@@ -87,9 +87,9 @@ export declare class ZipDirectoryItem implements FileTree.IFileTreeDirectoryItem
  */
 export declare class ZipFileTreeAccessors implements FileTree.IFileTreeAccessors {
     /**
-     * The AdmZip instance containing the archive.
+     * The unzipped file data.
      */
-    private readonly _zip;
+    private readonly _files;
     /**
      * Optional prefix to prepend to paths.
      */
@@ -100,17 +100,24 @@ export declare class ZipFileTreeAccessors implements FileTree.IFileTreeAccessors
     private readonly _itemCache;
     /**
      * Constructor for ZipFileTreeAccessors.
-     * @param zip - The AdmZip instance.
+     * @param files - The unzipped file data from fflate.
      * @param prefix - Optional prefix to prepend to paths.
      */
     private constructor();
     /**
-     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer.
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (synchronous).
      * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
      * @param prefix - Optional prefix to prepend to paths.
      * @returns Result containing the ZipFileTreeAccessors instance.
      */
     static fromBuffer(zipBuffer: ArrayBuffer | Uint8Array, prefix?: string): Result<ZipFileTreeAccessors>;
+    /**
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (asynchronous).
+     * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
+     * @param prefix - Optional prefix to prepend to paths.
+     * @returns Promise containing Result with the ZipFileTreeAccessors instance.
+     */
+    static fromBufferAsync(zipBuffer: ArrayBuffer | Uint8Array, prefix?: string): Promise<Result<ZipFileTreeAccessors>>;
     /**
      * Creates a new ZipFileTreeAccessors instance from a File object (browser environment).
      * @param file - The File object containing ZIP data.

package/lib/packlets/zip-file-tree/zipFileTreeAccessors.js

@@ -20,12 +20,9 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  * SOFTWARE.
  */
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ZipFileTreeAccessors = exports.ZipDirectoryItem = exports.ZipFileItem = void 0;
-const adm_zip_1 = __importDefault(require("adm-zip"));
+const fflate_1 = require("fflate");
 const ts_utils_1 = require("@fgv/ts-utils");
 /**
  * Implementation of `FileTree.IFileTreeFileItem` for files in a ZIP archive.
@@ -56,12 +53,7 @@ class ZipFileItem {
             return (0, ts_utils_1.captureResult)(() => {
                 const parsed = JSON.parse(contents);
                 if (converter) {
-                    if ('convert' in converter) {
-                        return converter.convert(parsed);
-                    } /* c8 ignore next 3 - validator branch functionally tested but coverage tool misses due to interface complexity */
-                    else {
-                        return converter.validate(parsed);
-                    }
+                    return converter.convert(parsed);
                 }
                 return (0, ts_utils_1.succeed)(parsed);
             }).onFailure(() => {
@@ -114,35 +106,62 @@ exports.ZipDirectoryItem = ZipDirectoryItem;
 class ZipFileTreeAccessors {
     /**
      * Constructor for ZipFileTreeAccessors.
-     * @param zip - The AdmZip instance.
+     * @param files - The unzipped file data from fflate.
      * @param prefix - Optional prefix to prepend to paths.
      */
-    constructor(zip, prefix) {
+    constructor(files, prefix) {
         /**
          * Cache of all items in the ZIP for efficient lookups.
          */
         this._itemCache = new Map();
-        this._zip = zip;
+        this._files = files;
         this._prefix = prefix || '';
         this._buildItemCache();
     }
     /**
-     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer.
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (synchronous).
      * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
      * @param prefix - Optional prefix to prepend to paths.
      * @returns Result containing the ZipFileTreeAccessors instance.
      */
     static fromBuffer(zipBuffer, prefix) {
         try {
-            const buffer = Buffer.from(zipBuffer);
-            const zip = new adm_zip_1.default(buffer);
-            return (0, ts_utils_1.succeed)(new ZipFileTreeAccessors(zip, prefix));
+            /* c8 ignore next 1 - defense in depth */
+            const uint8Buffer = zipBuffer instanceof Uint8Array ? zipBuffer : new Uint8Array(zipBuffer);
+            const files = (0, fflate_1.unzipSync)(uint8Buffer);
+            return (0, ts_utils_1.succeed)(new ZipFileTreeAccessors(files, prefix));
         }
         catch (error) {
-            /* c8 ignore next 1 - defensive coding: AdmZip always throws Error objects in practice */
+            /* c8 ignore next 1 - defensive coding: fflate always throws Error objects in practice */
             return (0, ts_utils_1.fail)(`Failed to load ZIP archive: ${error instanceof Error ? error.message : String(error)}`);
         }
     }
+    /**
+     * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer (asynchronous).
+     * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.
+     * @param prefix - Optional prefix to prepend to paths.
+     * @returns Promise containing Result with the ZipFileTreeAccessors instance.
+     */
+    static async fromBufferAsync(zipBuffer, prefix) {
+        return new Promise((resolve) => {
+            try {
+                /* c8 ignore next 1 - defense in depth */
+                const uint8Buffer = zipBuffer instanceof Uint8Array ? zipBuffer : new Uint8Array(zipBuffer);
+                (0, fflate_1.unzip)(uint8Buffer, (err, files) => {
+                    if (err) {
+                        resolve((0, ts_utils_1.fail)(`Failed to load ZIP archive: ${err.message}`));
+                    }
+                    else {
+                        resolve((0, ts_utils_1.succeed)(new ZipFileTreeAccessors(files, prefix)));
+                    }
+                });
+            }
+            catch (error) {
+                /* c8 ignore next 5 - defensive coding: fflate always throws Error objects in practice */
+                resolve((0, ts_utils_1.fail)(`Failed to load ZIP archive: ${error instanceof Error ? error.message : String(error)}`));
+            }
+        });
+    }
     /**
      * Creates a new ZipFileTreeAccessors instance from a File object (browser environment).
      * @param file - The File object containing ZIP data.
@@ -152,7 +171,7 @@ class ZipFileTreeAccessors {
     static async fromFile(file, prefix) {
         try {
             const arrayBuffer = await file.arrayBuffer();
-            return ZipFileTreeAccessors.fromBuffer(new Uint8Array(arrayBuffer), prefix);
+            return await ZipFileTreeAccessors.fromBufferAsync(new Uint8Array(arrayBuffer), prefix);
         }
         catch (error) {
             return (0, ts_utils_1.fail)(`Failed to read file: ${error instanceof Error ? error.message : String(error)}`);
@@ -163,40 +182,38 @@ class ZipFileTreeAccessors {
      */
     _buildItemCache() {
         const directories = new Set();
-        const entries = this._zip.getEntries();
-        // First pass: collect all directories from file paths
-        entries.forEach((entry) => {
-            if (!entry.isDirectory) {
-                // Extract directory path from file path
-                const pathParts = entry.entryName.split('/');
-                for (let i = 1; i < pathParts.length; i++) {
-                    const dirPath = pathParts.slice(0, i).join('/');
+        // Process all files and collect directory paths
+        for (const [relativePath, fileData] of Object.entries(this._files)) {
+            // Skip directories in fflate output (they have null data)
+            /* c8 ignore next 5 - handles explicit directory entries from external ZIP tools (fflate doesn't create these) */
+            if (fileData === null || fileData === undefined) {
+                const dirPath = relativePath.replace(/\/$/, '');
+                if (dirPath) {
                     directories.add(dirPath);
                 }
             }
             else {
-                // Also add explicit directories
-                const dirPath = entry.entryName.replace(/\/$/, ''); // Remove trailing slash
-                if (dirPath) {
-                    directories.add(dirPath);
+                // Extract directory paths from file paths
+                const pathParts = relativePath.split('/');
+                for (let i = 1; i < pathParts.length; i++) {
+                    const dirPath = pathParts.slice(0, i).join('/');
+                    if (dirPath) {
+                        directories.add(dirPath);
+                    }
                 }
+                // Add the file item with its contents
+                const absolutePath = this.resolveAbsolutePath(relativePath);
+                const contents = new TextDecoder().decode(fileData);
+                const item = new ZipFileItem(relativePath, contents, this);
+                this._itemCache.set(absolutePath, item);
             }
-        });
+        }
         // Add directory items to cache
         directories.forEach((dirPath) => {
             const absolutePath = this.resolveAbsolutePath(dirPath);
             const item = new ZipDirectoryItem(dirPath, this);
             this._itemCache.set(absolutePath, item);
         });
-        // Add file items to cache
-        entries.forEach((entry) => {
-            if (!entry.isDirectory) {
-                const absolutePath = this.resolveAbsolutePath(entry.entryName);
-                const contents = entry.getData().toString('utf8');
-                const item = new ZipFileItem(entry.entryName, contents, this);
-                this._itemCache.set(absolutePath, item);
-            }
-        });
     }
     /**
      * Resolves paths to an absolute path.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fgv/ts-extras",
-  "version": "5.0.0-3",
+  "version": "5.0.0-30",
   "description": "Assorted Typescript Utilities",
   "main": "lib/index.js",
   "types": "dist/ts-extras.d.ts",
@@ -17,46 +17,45 @@
   "homepage": "https://github.com/ErikFortune/fgv/tree/main/libraries/ts-extras#ts-utils",
   "devDependencies": {
     "@jest/expect-utils": "^29.7.0",
-    "@microsoft/api-documenter": "^7.26.29",
-    "@microsoft/api-extractor": "^7.49.1",
+    "@microsoft/api-documenter": "^7.26.31",
+    "@microsoft/api-extractor": "^7.52.10",
     "@types/jest": "^29.5.14",
-    "@types/luxon": "^3.6.2",
+    "@types/luxon": "^3.7.1",
     "@types/mustache": "^4.2.5",
     "@types/node": "^20.14.9",
     "@types/papaparse": "^5.3.14",
-    "@typescript-eslint/eslint-plugin": "^7.14.1",
-    "@typescript-eslint/parser": "^7.14.1",
-    "eslint": "^8.57.0",
+    "@typescript-eslint/eslint-plugin": "^8.42.0",
+    "@typescript-eslint/parser": "^8.42.0",
+    "eslint": "^9.35.0",
     "eslint-plugin-import": "^2.32.0",
     "eslint-plugin-node": "^11.1.0",
-    "eslint-plugin-promise": "^6.2.0",
+    "eslint-plugin-promise": "^7.2.1",
     "jest": "^29.7.0",
     "jest-extended": "^4.0.2",
     "jest-matcher-utils": "^29.7.0",
-    "rimraf": "^5.0.7",
-    "ts-jest": "^29.4.0",
+    "rimraf": "^6.0.1",
+    "ts-jest": "^29.4.1",
     "ts-node": "^10.9.2",
-    "typescript": "^5.7.3",
-    "eslint-plugin-n": "^16.6.2",
+    "typescript": "5.8.3",
+    "eslint-plugin-n": "^17.21.3",
     "jest-snapshot": "~29.7.0",
-    "@rushstack/heft": "~0.74.0",
-    "@rushstack/heft-node-rig": "~2.9.0",
-    "@rushstack/eslint-config": "~4.4.0",
+    "@rushstack/heft": "0.74.4",
+    "@rushstack/heft-node-rig": "2.9.5",
+    "@rushstack/eslint-config": "4.4.0",
     "@types/heft-jest": "1.0.6",
-    "@rushstack/heft-jest-plugin": "~0.16.9",
+    "@rushstack/heft-jest-plugin": "0.16.13",
     "eslint-plugin-tsdoc": "~0.4.0",
-    "@fgv/ts-utils-jest": "5.0.0-3",
-    "@fgv/ts-utils": "5.0.0-3"
+    "@fgv/ts-utils-jest": "5.0.0-30",
+    "@fgv/ts-utils": "5.0.0-30"
   },
   "dependencies": {
-    "luxon": "^3.6.1",
+    "luxon": "^3.7.2",
     "mustache": "^4.2.0",
     "papaparse": "^5.4.1",
-    "@types/adm-zip": "~0.5.7",
-    "adm-zip": "~0.5.16"
+    "fflate": "~0.8.2"
   },
   "peerDependencies": {
-    "@fgv/ts-utils": "5.0.0-3"
+    "@fgv/ts-utils": "5.0.0-30"
   },
   "scripts": {
     "build": "heft test --clean",

package/CHANGELOG.md

@@ -1,98 +0,0 @@
-# Change Log - @fgv/ts-extras
-
-This log was last generated on Thu, 17 Jul 2025 00:13:24 GMT and should not be manually modified.
-
-## 5.0.0
-Thu, 17 Jul 2025 00:13:24 GMT
-
-### Updates
-
-- upgrade dependencies
-- bump version
-
-## 4.6.0
-Wed, 02 Jul 2025 05:48:16 GMT
-
-_Version update only_
-
-## 4.5.1
-Wed, 02 Jul 2025 05:47:11 GMT
-
-### Updates
-
-- update rushstack
-
-## 4.5.0
-Tue, 01 Jul 2025 03:26:11 GMT
-
-_Version update only_
-
-## 4.4.0
-Sat, 01 Feb 2025 17:13:10 GMT
-
-_Version update only_
-
-## 4.3.0
-Thu, 30 Jan 2025 00:35:17 GMT
-
-_Version update only_
-
-## 4.2.2
-Thu, 23 Jan 2025 06:19:32 GMT
-
-_Version update only_
-
-## 4.2.1
-Tue, 21 Jan 2025 04:19:21 GMT
-
-_Version update only_
-
-## 4.2.0
-Mon, 20 Jan 2025 09:46:53 GMT
-
-_Version update only_
-
-## 4.1.0
-Thu, 09 Jan 2025 05:33:39 GMT
-
-### Updates
-
-- update dependencies
-
-## 4.0.2
-Tue, 14 May 2024 14:45:53 GMT
-
-_Version update only_
-
-## 4.0.1
-Tue, 14 May 2024 05:02:20 GMT
-
-### Updates
-
-- publish
-
-## 4.0.0
-Tue, 14 May 2024 03:09:27 GMT
-
-### Updates
-
-- move templateString, rangeOf and isoDate converters from ts-utils
-- update generated api docs
-
-## 3.0.0
-Mon, 22 Jan 2024 07:00:18 GMT
-
-### Updates
-
-- refactor hash implementation
-- refactor and cleanup
-- Factor extras into their own package
-
-## 2.2.0
-Thu, 18 Jan 2024 05:45:04 GMT
-
-### Updates
-
-- refactor and cleanup
-- Factor extras into their own package
-

package/lib/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,YAAY,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,SAAS,MAAM,uBAAuB,CAAC;AACnD,OAAO,KAAK,WAAW,MAAM,0BAA0B,CAAC;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAEnD,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC"}

package/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,oDAAsC;AAQjB,kBAAG;AAPxB,sEAAwD;AAO9B,oCAAY;AANtC,sDAAwC;AAMA,oBAAI;AAL5C,iEAAmD;AAKL,8BAAS;AAJvD,sEAAwD;AAIC,kCAAW;AAFpE,sDAAmD;AAE1C,2FAFA,uBAAU,OAEA","sourcesContent":["/*\n * Copyright (c) 2020 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 * as Csv from './packlets/csv';\nimport * as Experimental from './packlets/experimental';\nimport * as Hash from './packlets/hash';\nimport * as RecordJar from './packlets/record-jar';\nimport * as ZipFileTree from './packlets/zip-file-tree';\n\nimport { Converters } from './packlets/conversion';\n\nexport { Converters, Csv, Experimental, Hash, RecordJar, ZipFileTree };\n"]}

package/lib/packlets/conversion/converters.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"converters.d.ts","sourceRoot":"","sources":["../../../src/packlets/conversion/converters.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAc,MAAM,EAAgC,MAAM,eAAe,CAAC;AAGxG,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAE5E;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,cAAc,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,CAWpG;AAED;;;;GAIG;AACH,eAAO,MAAM,OAAO,EAAE,SAAS,CAAC,IAAI,EAAE,OAAO,CAa3C,CAAC;AAEH;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,EAC/C,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAC3B,OAAO,GAAE,UAAU,CAAC,OAAuB,GAC1C,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAIjC;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,EAAE,SAAS,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,OAAO,EAChE,SAAS,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAC3B,WAAW,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,CAAC,GACtD,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAcnB;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAE/F"}

package/lib/packlets/conversion/converters.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"converters.js","sourceRoot":"","sources":["../../../src/packlets/conversion/converters.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;AAiBH,wCAWC;AA+BD,0CAQC;AASD,kCAiBC;AAQD,0BAEC;AArGD,4CAAwG;AACxG,iCAAiC;AACjC,wDAAgC;AAChC,kDAA4E;AAE5E;;;;;;;;;GASG;AACH,SAAgB,cAAc,CAAC,cAAwB;IACrD,OAAO,IAAI,qBAAU,CAAC,eAAe,CACnC,cAAc,EACd,SAAS,EACT,CAAC,IAAa,EAAE,MAAkC,EAAE,OAAiB,EAAE,EAAE;QACvE,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO,IAAA,eAAI,EAAC,iBAAiB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,kBAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IAC7D,CAAC,CACF,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACU,QAAA,OAAO,GAA6B,IAAI,qBAAU,CAAC,aAAa,CAAO,CAAC,IAAa,EAAE,EAAE;IACpG,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,gBAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,IAAA,kBAAO,EAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAA,eAAI,EAAC,iBAAiB,EAAE,CAAC,kBAAkB,EAAE,CAAC,CAAC;IACxD,CAAC;SAAM,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QACpC,OAAO,IAAA,kBAAO,EAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACjC,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAA,eAAI,EAAC,kBAAkB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AAChE,CAAC,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,SAAgB,eAAe,CAC7B,KAAa,EACb,SAA2B,EAC3B,UAA8B,aAAa;IAE3C,OAAO,qBAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAU,EAAE,EAAE;QAC/D,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,IAAI,4BAAa,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CACzB,SAA2B,EAC3B,WAAuD;IAEvD,OAAO,IAAI,qBAAU,CAAC,aAAa,CAAC,CAAC,IAAa,EAAE,MAAM,EAAE,OAAY,EAAE,EAAE;QAC1E,MAAM,MAAM,GAAG,qBAAU,CAAC,MAAM,CAC9B;YACE,GAAG,EAAE,SAAS;YACd,GAAG,EAAE,SAAS;SACf,EACD,EAAE,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CACnC,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,OAAO,WAAW,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAkB,SAA2B;IAClE,OAAO,WAAW,CAAoB,SAAS,EAAE,sBAAO,CAAC,WAAW,CAAC,CAAC;AACxE,CAAC","sourcesContent":["/*\n * Copyright (c) 2020 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 { Conversion, Converter, Converters, Result, captureResult, fail, succeed } from '@fgv/ts-utils';\nimport { DateTime } from 'luxon';\nimport Mustache from 'mustache';\nimport { ExtendedArray, RangeOf, RangeOfProperties } from '../experimental';\n\n/**\n * Helper function to create a `StringConverter` which converts\n * `unknown` to `string`, applying template conversions supplied at construction time or at\n * runtime as context.\n * @remarks\n * Template conversions are applied using `mustache` syntax.\n * @param defaultContext - Optional default context to use for template values.\n * @returns A new `Converter` returning `string`.\n * @public\n */\nexport function templateString(defaultContext?: unknown): Conversion.StringConverter<string, unknown> {\n  return new Conversion.StringConverter<string, unknown>(\n    defaultContext,\n    undefined,\n    (from: unknown, __self: Converter<string, unknown>, context?: unknown) => {\n      if (typeof from !== 'string') {\n        return fail(`Not a string: ${JSON.stringify(from)}`);\n      }\n      return captureResult(() => Mustache.render(from, context));\n    }\n  );\n}\n\n/**\n * A `Converter` which converts an iso formatted string, a number or a `Date` object to\n * a `Date` object.\n * @public\n */\nexport const isoDate: Converter<Date, unknown> = new Conversion.BaseConverter<Date>((from: unknown) => {\n  if (typeof from === 'string') {\n    const dt = DateTime.fromISO(from);\n    if (dt.isValid) {\n      return succeed(dt.toJSDate());\n    }\n    return fail(`Invalid date: ${dt.invalidExplanation}`);\n  } else if (typeof from === 'number') {\n    return succeed(new Date(from));\n  } else if (from instanceof Date) {\n    return succeed(from);\n  }\n  return fail(`Cannot convert ${JSON.stringify(from)} to Date`);\n});\n\n/**\n * A helper function to create a `Converter` which converts `unknown` to {@link Experimental.ExtendedArray | ExtendedArray<T>}.\n * @remarks\n * If `onError` is `'failOnError'` (default), then the entire conversion fails if any element cannot\n * be converted.  If `onError` is `'ignoreErrors'`, then failing elements are silently ignored.\n * @param converter - `Converter` used to convert each item in the array\n * @param ignoreErrors - Specifies treatment of unconvertible elements\n * @beta\n */\nexport function extendedArrayOf<T, TC = undefined>(\n  label: string,\n  converter: Converter<T, TC>,\n  onError: Conversion.OnError = 'failOnError'\n): Converter<ExtendedArray<T>, TC> {\n  return Converters.arrayOf(converter, onError).map((items: T[]) => {\n    return captureResult(() => new ExtendedArray(label, ...items));\n  });\n}\n\n/**\n * A helper wrapper to construct a `Converter` which converts to an arbitrary strongly-typed\n * range of some comparable type.\n * @param converter - `Converter` used to convert `min` and `max` extent of the range.\n * @param constructor - Static constructor to instantiate the object.\n * @public\n */\nexport function rangeTypeOf<T, RT extends RangeOf<T>, TC = unknown>(\n  converter: Converter<T, TC>,\n  constructor: (init: RangeOfProperties<T>) => Result<RT>\n): Converter<RT, TC> {\n  return new Conversion.BaseConverter((from: unknown, __self, context?: TC) => {\n    const result = Converters.object(\n      {\n        min: converter,\n        max: converter\n      },\n      { optionalFields: ['min', 'max'] }\n    ).convert(from, context);\n    if (result.isSuccess()) {\n      return constructor({ min: result.value.min, max: result.value.max });\n    }\n    return fail(result.message);\n  });\n}\n\n/**\n * A helper wrapper to construct a `Converter` which converts to {@link Experimental.RangeOf | RangeOf<T>}\n * where `<T>` is some comparable type.\n * @param converter - `Converter` used to convert `min` and `max` extent of the range.\n * @public\n */\nexport function rangeOf<T, TC = unknown>(converter: Converter<T, TC>): Converter<RangeOf<T>, TC> {\n  return rangeTypeOf<T, RangeOf<T>, TC>(converter, RangeOf.createRange);\n}\n"]}

package/lib/packlets/conversion/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/conversion/index.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,UAAU,MAAM,cAAc,CAAC;AAE3C,OAAO,EAAE,UAAU,EAAE,CAAC"}

package/lib/packlets/conversion/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/conversion/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,yDAA2C;AAElC,gCAAU","sourcesContent":["/*\n * Copyright (c) 2023 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 * as Converters from './converters';\n\nexport { Converters };\n"]}

package/lib/packlets/csv/csvHelpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"csvHelpers.d.ts","sourceRoot":"","sources":["../../../src/packlets/csv/csvHelpers.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AAKtD;;;GAGG;AAEH,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,CActF"}

package/lib/packlets/csv/csvHelpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"csvHelpers.js","sourceRoot":"","sources":["../../../src/packlets/csv/csvHelpers.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBH,0CAcC;AAnCD,4CAAsD;AACtD,uCAAyB;AACzB,yCAAkC;AAClC,2CAA6B;AAW7B;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,OAAe,EAAE,OAAoB;IACnE,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC1D,OAAO,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,EAAE,CAAC;QACxB,2BAA2B;QAC3B,OAAO,IAAA,iBAAK,EAAC,IAAI,kBACf,SAAS,EAAE,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAClC,MAAM,EAAE,KAAK,EACb,aAAa,EAAE,KAAK,EACpB,cAAc,EAAE,QAAQ,IACrB,OAAO,EACV,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/*\n * Copyright (c) 2020 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 { Result, captureResult } from '@fgv/ts-utils';\nimport * as fs from 'fs';\nimport { parse } from 'papaparse';\nimport * as path from 'path';\n\n/**\n * Options for {@link Csv.readCsvFileSync | readCsvFileSync}\n * @beta\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface CsvOptions {\n  delimiter?: string;\n}\n\n/**\n * Reads a CSV file from a supplied path.\n * @param srcPath - Source path from which the file is read.\n * @param options - optional parameters to control the processing\n * @returns The contents of the file.\n * @beta\n */\nexport function readCsvFileSync(srcPath: string, options?: CsvOptions): Result<unknown> {\n  return captureResult(() => {\n    const fullPath = path.resolve(srcPath);\n    const body = fs.readFileSync(fullPath, 'utf8').toString();\n    options = options ?? {};\n    // eslint-disable-next-line\n    return parse(body, {\n      transform: (s: string) => s.trim(),\n      header: false,\n      dynamicTyping: false,\n      skipEmptyLines: 'greedy',\n      ...options\n    }).data.slice(1);\n  });\n}\n"]}

package/lib/packlets/csv/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/csv/index.ts"],"names":[],"mappings":"AAsBA,cAAc,cAAc,CAAC"}

package/lib/packlets/csv/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/csv/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,+CAA6B","sourcesContent":["/*\n * Copyright (c) 2020 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\nexport * from './csvHelpers';\n"]}

package/lib/packlets/experimental/extendedArray.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"extendedArray.d.ts","sourceRoot":"","sources":["../../../src/packlets/experimental/extendedArray.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AAEtD;;;;GAIG;AACH,qBAAa,aAAa,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAC5C,SAAgB,eAAe,EAAE,MAAM,CAAC;IAExC;;;;OAIG;gBACgB,eAAe,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE;IAKzD;;;;;;OAMG;WACW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC;IAIhE;;;;;;;OAOG;IACI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC;IAW1D;;;;;;OAMG;IACI,KAAK,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IAO7C;;;;;;;OAOG;IACI,UAAU,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;IAOpD;;;;OAIG;IACI,GAAG,IAAI,CAAC,EAAE;CAGlB"}

package/lib/packlets/experimental/extendedArray.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"extendedArray.js","sourceRoot":"","sources":["../../../src/packlets/experimental/extendedArray.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAEH,4CAAsD;AAEtD;;;;GAIG;AACH,MAAa,aAAiB,SAAQ,KAAQ;IAG5C;;;;OAIG;IACH,YAAmB,eAAuB,EAAE,GAAG,KAAU;QACvD,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;QAChB,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,eAAe,CAAI,CAAO;QACtC,OAAO,CAAC,YAAY,aAAa,CAAC;IACpC,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,SAAgC;QAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,GAAG,IAAI,CAAC,eAAe,YAAY,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAA,eAAI,EAAC,GAAG,IAAI,CAAC,eAAe,YAAY,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IACvE,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,WAAoB;QAC/B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,IAAA,eAAI,EAAC,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,GAAG,IAAI,CAAC,eAAe,YAAY,CAAC,CAAC;IAClE,CAAC;IAED;;;;;;;OAOG;IACI,UAAU,CAAC,WAAoB;QACpC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAA,eAAI,EAAC,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,GAAG,IAAI,CAAC,eAAe,YAAY,CAAC,CAAC;IAClE,CAAC;IAED;;;;OAIG;IACI,GAAG;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF;AAhFD,sCAgFC","sourcesContent":["/*\r\n * Copyright (c) 2020 Erik Fortune\r\n *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n *\r\n * The above copyright notice and this permission notice shall be included in all\r\n * copies or substantial portions of the Software.\r\n *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n * SOFTWARE.\r\n */\r\n\r\nimport { Result, fail, succeed } from '@fgv/ts-utils';\r\n\r\n/**\r\n * An experimental array template which extend built-in `Array` to include a handful\r\n * of predicates which return `Result<T>`.\r\n * @beta\r\n */\r\nexport class ExtendedArray<T> extends Array<T> {\r\n  public readonly itemDescription: string;\r\n\r\n  /**\r\n   * Constructs an {@link Experimental.ExtendedArray | ExtendedArray}.\r\n   * @param itemDescription - Brief description of the type of each item in this array.\r\n   * @param items - The initial contents of the array.\r\n   */\r\n  public constructor(itemDescription: string, ...items: T[]) {\r\n    super(...items);\r\n    this.itemDescription = itemDescription;\r\n  }\r\n\r\n  /**\r\n   * Type guard to determine if some arbitrary array is an\r\n   * {@link Experimental.ExtendedArray}\r\n   * @param a - The `Array` to be tested.\r\n   * @returns Returns `true` if `a` is an {@link Experimental.ExtendedArray | ExtendedArray},\r\n   * `false` otherwise.\r\n   */\r\n  public static isExtendedArray<T>(a?: T[]): a is ExtendedArray<T> {\r\n    return a instanceof ExtendedArray;\r\n  }\r\n\r\n  /**\r\n   * Determines if this array contains exactly one element which matches\r\n   * a supplied predicate.\r\n   * @param predicate - The predicate function to be applied.\r\n   * @returns Returns `Success<T>` with the single matching\r\n   * result if exactly one item matches `predicate`.  Returns `Failure<T>`\r\n   * with an error message if there are no matches or more than one match.\r\n   */\r\n  public single(predicate?: (item: T) => boolean): Result<T> {\r\n    const match = predicate ? this.filter(predicate) : this;\r\n    if (match.length === 1) {\r\n      return succeed(match[0]);\r\n    }\r\n    if (match.length === 0) {\r\n      return fail(`${this.itemDescription} not found`);\r\n    }\r\n    return fail(`${this.itemDescription} matches ${match.length} items`);\r\n  }\r\n\r\n  /**\r\n   * Returns the first element of an {@link Experimental.ExtendedArray | ExtendedArray}. Fails with an\r\n   * error message if the array is empty.\r\n   * @param failMessage - Optional message to be displayed in the event of failure.\r\n   * @returns Returns `Success<T>` with the value of the first element\r\n   * in the array, or `Failure<T>` with an error message if the array is empty.\r\n   */\r\n  public first(failMessage?: string): Result<T> {\r\n    if (this.length > 0) {\r\n      return succeed(this[0]);\r\n    }\r\n    return fail(failMessage ?? `${this.itemDescription} not found`);\r\n  }\r\n\r\n  /**\r\n   * Returns an array containing all elements of an {@link Experimental.ExtendedArray | ExtendedArray}.\r\n   * Fails with an error message if the array is empty.\r\n   * @param failMessage - Optional message to be displayed in the event of failure.\r\n   * @returns Returns `Success<T>` with a new (non-extended) `Array`\r\n   * containing the elements of this array, or `Failure<T>` with an error message\r\n   * if the array is empty.\r\n   */\r\n  public atLeastOne(failMessage?: string): Result<T[]> {\r\n    if (this.length > 0) {\r\n      return succeed(Array.from(this));\r\n    }\r\n    return fail(failMessage ?? `${this.itemDescription} not found`);\r\n  }\r\n\r\n  /**\r\n   * Gets a new (non-extended) `Array` containing all of the elements from this\r\n   * {@link Experimental.ExtendedArray | ExtendedArray}.\r\n   * @returns A new (non-extended) `Array<T>`.\r\n   */\r\n  public all(): T[] {\r\n    return Array.from(this);\r\n  }\r\n}\r\n"]}

package/lib/packlets/experimental/formatter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatter.d.ts","sourceRoot":"","sources":["../../../src/packlets/experimental/formatter.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,MAAM,EAAsC,MAAM,eAAe,CAAC;AAK3E;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,UAAU,GAAG,OAAO,CAAC;AAE1D;;;GAGG;AAEH,MAAM,WAAW,WAAW;IAC1B;;;;;OAKG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;CACxC;AAED;;;GAGG;AACH,qBAAa,eAAe;IAC1B;;;;;;OAMG;IACH,SAAS,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAOjG;;OAEG;IACI,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAGhD;AAED;;;;GAIG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC;AAEvE;;;;GAIG;AACH,MAAM,MAAM,0BAA0B,CAAC,GAAG,SAAS,aAAa,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AACjG;;;;GAIG;AACH,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,0BAA0B,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;AAEjF;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CASrG"}

package/lib/packlets/experimental/formatter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatter.js","sourceRoot":"","sources":["../../../src/packlets/experimental/formatter.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;AAoFH,gCASC;AA3FD,4CAA2E;AAC3E,wDAAgC;AAEhC,kBAAQ,CAAC,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC;AAuBnC;;;GAGG;AACH,MAAa,eAAe;IAC1B;;;;;;OAMG;IACO,MAAM,CAAC,aAAa,CAAC,OAAiB,EAAE,KAAa,EAAE,KAAyB;QACxF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,KAAK,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC7C,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,QAAgB;QAC5B,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,kBAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC;CACF;AArBD,0CAqBC;AAsBD;;;;;;;;GAQG;AACH,SAAgB,UAAU,CAAI,MAAc,EAAE,KAAU,EAAE,aAA2B;IACnF,OAAO,IAAA,qBAAU,EACf,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACjB,OAAO,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CACH,CAAC,SAAS,CAAC,CAAC,OAAiB,EAAE,EAAE;QAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACjD,OAAO,IAAA,kBAAO,EAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/*\n * Copyright (c) 2020 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 { Result, captureResult, mapResults, succeed } from '@fgv/ts-utils';\nimport Mustache from 'mustache';\n\nMustache.escape = (s: string) => s;\n\n/**\n * Destination format for some formatted string.\n * @beta\n */\nexport type FormatTargets = 'text' | 'markdown' | 'embed';\n\n/**\n * Interface for an object that can be formatted.\n * @beta\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface Formattable {\n  /**\n   * Formats an object using the supplied mustache template.\n   * @param format - A mustache template used to format the object.\n   * @returns `Success<string>` with the resulting string, or `Failure<string>`\n   * with an error message if an error occurs.\n   */\n  format(format: string): Result<string>;\n}\n\n/**\n * Base class which adds common formatting.\n * @beta\n */\nexport class FormattableBase {\n  /**\n   * Helper enables derived classes to add named details to a formatted presentation.\n   * @param details - An array of detail description strings.\n   * @param label - Label to use for the new detail.\n   * @param value - Value to use for the new detail.\n   * @internal\n   */\n  protected static _tryAddDetail(details: string[], label: string, value: string | undefined): void {\n    if (value !== undefined) {\n      const padded = `  ${label}:`.padEnd(20, ' ');\n      details.push(`${padded} ${value}`);\n    }\n  }\n\n  /**\n   * {@inheritdoc Experimental.Formattable.format}\n   */\n  public format(template: string): Result<string> {\n    return captureResult(() => Mustache.render(template, this));\n  }\n}\n\n/**\n * Type definition for a formatting function, which takes a `string` and an\n * item and returns `Result<string>`.\n * @beta\n */\nexport type Formatter<T> = (format: string, item: T) => Result<string>;\n\n/**\n * A collection of {@link Experimental.Formatter | formatters} indexed by target name, to enable\n * different format methods per output target.\n * @beta\n */\nexport type FormattersByExtendedTarget<TFT extends FormatTargets, T> = Record<TFT, Formatter<T>>;\n/**\n * A collection of {@link Experimental.Formatter | formatters} indexed by the\n * {@link Experimental.FormatTargets | default supported target formats}.\n * @beta\n */\nexport type FormattersByTarget<T> = FormattersByExtendedTarget<FormatTargets, T>;\n\n/**\n * Formats a list of items using the supplied template and formatter, one result\n * per output line.\n * @param format - A mustache template used to format each item.\n * @param items - The items to be formatted.\n * @param itemFormatter - The {@link Experimental.Formatter | Formatter<T>} used to format each item.\n * @returns The resulting string.\n * @beta\n */\nexport function formatList<T>(format: string, items: T[], itemFormatter: Formatter<T>): Result<string> {\n  return mapResults(\n    items.map((item) => {\n      return itemFormatter(format, item);\n    })\n  ).onSuccess((results: string[]) => {\n    const filtered = results.filter((s) => s !== '');\n    return succeed(filtered.join('\\n'));\n  });\n}\n"]}

package/lib/packlets/experimental/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/experimental/index.ts"],"names":[],"mappings":"AAsBA,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC"}

package/lib/packlets/experimental/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/experimental/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,kDAAgC;AAChC,8CAA4B;AAC5B,4CAA0B","sourcesContent":["/*\n * Copyright (c) 2023 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\nexport * from './extendedArray';\nexport * from './formatter';\nexport * from './rangeOf';\n"]}

package/lib/packlets/experimental/rangeOf.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rangeOf.d.ts","sourceRoot":"","sources":["../../../src/packlets/experimental/rangeOf.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AAGtD;;;GAGG;AAEH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB;AAED;;;;;GAKG;AAEH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,EAAE,cAIrC,CAAC;AAEF;;;;GAIG;AACH,qBAAa,OAAO,CAAC,CAAC,CAAE,YAAW,iBAAiB,CAAC,CAAC,CAAC;IACrD;;OAEG;IACH,SAAgB,GAAG,CAAC,EAAE,CAAC,CAAC;IACxB;;OAEG;IACH,SAAgB,GAAG,CAAC,EAAE,CAAC,CAAC;IAExB;;;;OAIG;gBACgB,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;IAQnC;;;;OAIG;WACW,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAI7E;;;;;;;;OAQG;WACW,kBAAkB,CAAC,CAAC,EAChC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAC3B,OAAO,CAAC,EAAE,cAAc,EACxB,UAAU,CAAC,EAAE,CAAC,GACb,MAAM,GAAG,SAAS;IAcrB;;;;;;;OAOG;IACH,SAAS,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS;IAS/E;;;;;;OAMG;IACI,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,UAAU,GAAG,SAAS;IAUnD;;;;OAIG;IACI,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO;IAI9B;;;;;;;OAOG;IACI,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAU1C;;;;;;;OAOG;IACI,qBAAqB,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,GAAG,SAAS,GAAG,iBAAiB,CAAC,MAAM,CAAC;IAOjG;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,GAAG,SAAS,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAIrG;;;;;;;OAOG;IACH,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS;CAG/D"}

package/lib/packlets/experimental/rangeOf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rangeOf.js","sourceRoot":"","sources":["../../../src/packlets/experimental/rangeOf.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;AAEH,4CAAsD;AACtD,wDAAgC;AAyBhC;;;;GAIG;AACU,QAAA,uBAAuB,GAAmB;IACrD,OAAO,EAAE,UAAU;IACnB,OAAO,EAAE,UAAU;IACnB,MAAM,EAAE,iBAAiB;CAC1B,CAAC;AAEF;;;;GAIG;AACH,MAAa,OAAO;IAUlB;;;;OAIG;IACH,YAAmB,GAAO,EAAE,GAAO;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;YACpF,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChG,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAI,IAA2B;QACtD,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,IAAI,OAAO,CAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,GAAG,EAAE,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,GAAG,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,kBAAkB,CAC9B,KAA2B,EAC3B,OAAwB,EACxB,UAAc;QAEd,OAAO,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,+BAAuB,CAAC;QAC7C,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,UAAU,EAAE,CAAC;YACxD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,UAAU,EAAE,CAAC;gBACxD,OAAO,kBAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,OAAO,kBAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,UAAU,EAAE,CAAC;YAC/D,OAAO,kBAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACO,MAAM,CAAC,eAAe,CAAI,EAAK,EAAE,EAAK;QAC9C,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,OAAO,MAAM,CAAC;QAChB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,CAAI;QACf,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC;YACpE,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC;YACpE,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,CAAI;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC;IACtC,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,CAAI;QACxB,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,GAAG,CAAC;YAClB,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,GAAG,CAAC;QACpB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,qBAAqB,CAAC,MAAwC;QACnE,OAAO;YACL,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;YAC1D,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;SAC3D,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,MAAwC,EAAE,OAAwB;QAC9E,OAAO,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;OAOG;IACO,QAAQ,CAAC,EAAK,EAAE,EAAK;QAC7B,OAAO,OAAO,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;CACF;AA7JD,0BA6JC","sourcesContent":["/*\n * Copyright (c) 2020 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 { Result, captureResult } from '@fgv/ts-utils';\nimport Mustache from 'mustache';\n\n/**\n * Represents a generic range of some comparable type `<T>`.\n * @public\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface RangeOfProperties<T> {\n  readonly min?: T;\n  readonly max?: T;\n}\n\n/**\n * Format strings (in mustache format) to\n * use for both open-ended and complete\n * {@link Experimental.RangeOf | RangeOf<T>}.\n * @public\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface RangeOfFormats {\n  minOnly: string;\n  maxOnly: string;\n  minMax: string;\n}\n\n/**\n * Default {@link Experimental.RangeOfFormats | formats} to use for both\n * open-ended and complete {@link Experimental.RangeOf | RangeOf<T>}.\n * @public\n */\nexport const DEFAULT_RANGEOF_FORMATS: RangeOfFormats = {\n  minOnly: '{{min}}-',\n  maxOnly: '-{{max}}',\n  minMax: '{{min}}-{{max}}'\n};\n\n/**\n * Simple implementation of a possibly open-ended range of some comparable\n * type `<T>` with test and formatting.\n * @public\n */\nexport class RangeOf<T> implements RangeOfProperties<T> {\n  /**\n   * Minimum extent of the range.\n   */\n  public readonly min?: T;\n  /**\n   * Maximum extent of the range.\n   */\n  public readonly max?: T;\n\n  /**\n   * Creates a new {@link Experimental.RangeOf | RangeOf<T>}.\n   * @param min - Optional minimum extent of the range.\n   * @param max - Optional maximum extent of the range.\n   */\n  public constructor(min?: T, max?: T) {\n    if (min !== undefined && max !== undefined && this._compare(min, max) === 'greater') {\n      throw new Error(`Inverted range - ${JSON.stringify(min)} must be <= ${JSON.stringify(max)}.`);\n    }\n    this.min = min;\n    this.max = max;\n  }\n\n  /**\n   * Static constructor for a {@link Experimental.RangeOf | RangeOf<T>}.\n   * @param init - {@link Experimental.RangeOfProperties | Range initializer}.\n   * @returns A new {@link Experimental.RangeOf | RangeOf<T>}.\n   */\n  public static createRange<T>(init?: RangeOfProperties<T>): Result<RangeOf<T>> {\n    return captureResult(() => new RangeOf<T>(init?.min, init?.max));\n  }\n\n  /**\n   * Gets a formatted description of a {@link Experimental.RangeOfProperties | RangeOfProperties<T>} given an\n   * optional set of formats and 'empty' value to use.\n   * @param range - The {@link Experimental.RangeOfProperties | RangeOfProperties<T>} to be formatted.\n   * @param formats - Optional {@link Experimental.RangeOfFormats | formats} to use. Default is\n   * {@link Experimental.DEFAULT_RANGEOF_FORMATS | DEFAULT_RANGEOF_FORMATS}.\n   * @param emptyValue - Value which represents unbounded minimum or maximum for this range. Default is `undefined`.\n   * @returns A string representation of the range.\n   */\n  public static propertiesToString<T>(\n    range: RangeOfProperties<T>,\n    formats?: RangeOfFormats,\n    emptyValue?: T\n  ): string | undefined {\n    formats = formats ?? DEFAULT_RANGEOF_FORMATS;\n    if (range.min !== undefined && range.min !== emptyValue) {\n      if (range.max !== undefined && range.max !== emptyValue) {\n        return Mustache.render(formats.minMax, range);\n      } else {\n        return Mustache.render(formats.minOnly, range);\n      }\n    } else if (range.max !== undefined && range.max !== emptyValue) {\n      return Mustache.render(formats.maxOnly, range);\n    }\n    return undefined;\n  }\n\n  /**\n   * Default comparison uses javascript built-in comparison.\n   * @param t1 - First value to be compared.\n   * @param t2 - Second value to be compared.\n   * @returns `'less'` if `t1` is less than `t2`, `'greater'` if `t1` is larger\n   * and `'equal'` if `t1` and `t2` are equal.\n   * @internal\n   */\n  protected static _defaultCompare<T>(t1: T, t2: T): 'less' | 'equal' | 'greater' {\n    if (t1 < t2) {\n      return 'less';\n    } else if (t1 > t2) {\n      return 'greater';\n    }\n    return 'equal';\n  }\n\n  /**\n   * Checks if a supplied value is within this range.\n   * @param t - The value to be tested.\n   * @returns `'included'` if `t` falls within the range, `'less'` if `t` falls\n   * below the minimum extent of the range and `'greater'` if `t` is above the\n   * maximum extent.\n   */\n  public check(t: T): 'less' | 'included' | 'greater' {\n    if (this.min !== undefined && this._compare(t, this.min) === 'less') {\n      return 'less';\n    }\n    if (this.max !== undefined && this._compare(t, this.max) !== 'less') {\n      return 'greater';\n    }\n    return 'included';\n  }\n\n  /**\n   * Determines if a supplied value is within this range.\n   * @param t - The value to be tested.\n   * @returns Returns `true` if `t` falls within the range, `false` otherwise.\n   */\n  public includes(t: T): boolean {\n    return this.check(t) === 'included';\n  }\n\n  /**\n   * Finds the transition value that would bring a supplied value `t` into\n   * range.\n   * @param t - The value to be tested.\n   * @returns The minimum extent of the range if `t` is below the range or\n   * the maximum extent of the range if `t` is above the range.  Returns\n   * `undefined` if `t` already falls within the range.\n   */\n  public findTransition(t: T): T | undefined {\n    switch (this.check(t)) {\n      case 'less':\n        return this.min;\n      case 'included':\n        return this.max;\n    }\n    return undefined;\n  }\n\n  /**\n   * Formats the minimum and maximum values of this range.\n   * @param format - A format function used to format the values.\n   * @returns A {@link Experimental.RangeOfProperties | RangeOfProperties<string>} containing the\n   * formatted representation of the {@link Experimental.RangeOf.min | minimum} and\n   * {@link Experimental.RangeOf.max | maximum}\n   * extent of the range, or `undefined` for an extent that is not present.\n   */\n  public toFormattedProperties(format: (value: T) => string | undefined): RangeOfProperties<string> {\n    return {\n      min: this.min !== undefined ? format(this.min) : undefined,\n      max: this.max !== undefined ? format(this.max) : undefined\n    };\n  }\n\n  /**\n   * Formats this range using the supplied format function.\n   * @param format - Format function used to format minimum and maximum extent values.\n   * @param formats - The {@link Experimental.RangeOfFormats | format strings} used to format the range\n   * (default {@link Experimental.DEFAULT_RANGEOF_FORMATS}).\n   * @returns Returns a formatted representation of this range.\n   */\n  public format(format: (value: T) => string | undefined, formats?: RangeOfFormats): string | undefined {\n    return RangeOf.propertiesToString(this.toFormattedProperties(format), formats);\n  }\n\n  /**\n   * Inner compare method can be overridden by a derived class.\n   * @param t1 - First value to compare.\n   * @param t2 - Second value to compare.\n   * @returns `'less'` if `t1` is less than `t2`, `'greater'` if `t1` is larger\n   * and `'equal'` if `t1` and `t2` are equal.\n   * @internal\n   */\n  protected _compare(t1: T, t2: T): 'less' | 'equal' | 'greater' {\n    return RangeOf._defaultCompare(t1, t2);\n  }\n}\n"]}

package/lib/packlets/hash/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/hash/index.ts"],"names":[],"mappings":"AAsBA,cAAc,iBAAiB,CAAC"}

package/lib/packlets/hash/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/hash/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,kDAAgC","sourcesContent":["/*\n * Copyright (c) 2020 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\nexport * from './md5Normalizer';\n"]}

package/lib/packlets/hash/md5Normalizer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"md5Normalizer.d.ts","sourceRoot":"","sources":["../../../src/packlets/hash/md5Normalizer.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAErC;;;;GAIG;AACH,qBAAa,aAAc,SAAQ,IAAI,CAAC,iBAAiB;;WAKzC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM;CAG/C"}

package/lib/packlets/hash/md5Normalizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"md5Normalizer.js","sourceRoot":"","sources":["../../../src/packlets/hash/md5Normalizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,4CAAqC;AACrC,+CAAiC;AACjC;;;;GAIG;AACH,MAAa,aAAc,SAAQ,eAAI,CAAC,iBAAiB;IACvD;QACE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAEM,MAAM,CAAC,OAAO,CAAC,KAAe;QACnC,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChF,CAAC;CACF;AARD,sCAQC","sourcesContent":["/*\n * Copyright (c) 2023 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 { Hash } from '@fgv/ts-utils';\nimport * as crypto from 'crypto';\n/**\n * A hashing normalizer which computes object\n * hash using the MD5 algorithm.\n * @public\n */\nexport class Md5Normalizer extends Hash.HashingNormalizer {\n  public constructor() {\n    super(Md5Normalizer.md5Hash);\n  }\n\n  public static md5Hash(parts: string[]): string {\n    return crypto.createHash('md5').update(parts.join('|'), 'utf8').digest('hex');\n  }\n}\n"]}

package/lib/packlets/record-jar/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/record-jar/index.ts"],"names":[],"mappings":"AAsBA,cAAc,oBAAoB,CAAC"}

package/lib/packlets/record-jar/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/record-jar/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,qDAAmC","sourcesContent":["/*\n * Copyright (c) 2023 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\nexport * from './recordJarHelpers';\n"]}

package/lib/packlets/record-jar/recordJarHelpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"recordJarHelpers.d.ts","sourceRoot":"","sources":["../../../src/packlets/record-jar/recordJarHelpers.ts"],"names":[],"mappings":"AAyBA,OAAO,EAAE,MAAM,EAAyC,MAAM,eAAe,CAAC;AAO9E;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC;AAE1D;;GAEG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;AAEzF;;;GAGG;AAEH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC;IACjD,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;CACzC;AAoMD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,sBAAsB,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC,CAE1G;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,sBAAsB,GAC/B,MAAM,CAAC,SAAS,EAAE,CAAC,CAOrB"}

package/lib/packlets/record-jar/recordJarHelpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"recordJarHelpers.js","sourceRoot":"","sources":["../../../src/packlets/record-jar/recordJarHelpers.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2OH,kDAEC;AAUD,sDAUC;AA/PD,uCAAyB;AACzB,2CAA6B;AAE7B,4CAA8E;AA4B9E,MAAM,YAAY;IAQhB,gEAAgE;IAChE,YAAoB,OAAgC;QARpC,YAAO,GAAgB,EAAE,CAAC;QAGhC,YAAO,GAAc,EAAE,CAAC;QACxB,UAAK,GAAuB,SAAS,CAAC;QACtC,UAAK,GAA4B,SAAS,CAAC;QAInD,IAAI,CAAC,OAAO,GAAG,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,EAAE,CAAC;IAC/B,CAAC;IAEM,MAAM,CAAC,KAAK,CAAC,KAAe,EAAE,OAAgC;QACnE,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAES,MAAM,CAAC,gBAAgB,CAAC,IAAY;QAC5C,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,cAAc,EAAE,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;gBACvB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;YACD,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;IAC3C,CAAC;IAES,MAAM,CAAC,WAAW,CAAC,IAAY;QACvC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAES,MAAM,CAAC,eAAe,CAAC,IAAY;QAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,+BAA+B,EAAE,CAAC,KAAK,EAAE,EAAE;YACtE,QAAQ,KAAK,EAAE,CAAC;gBACd,KAAK,MAAM;oBACT,OAAO,IAAI,CAAC;gBACd,KAAK,KAAK;oBACR,OAAO,GAAG,CAAC;gBACb,KAAK,KAAK;oBACR,OAAO,IAAI,CAAC;gBACd,KAAK,KAAK;oBACR,OAAO,IAAI,CAAC;gBACd,KAAK,KAAK;oBACR,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC9C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACvC,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,wBAAwB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QAChF,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAES,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAA+B;QAC/E,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,MAAM,qBAAQ,MAAM,CAAE,CAAC,CAAC,6BAA6B;YACrD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;gBACpD,CAAC,CAAC,OAAO,CAAC,WAAW;gBACrB,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;gBAChC,IAAI,IAAA,kBAAO,EAAC,KAAK,EAAE,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;oBAChE,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;oBACxC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAES,MAAM,CAAC,KAAe;;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA,MAAA,IAAI,CAAC,KAAK,0CAAE,cAAc,CAAA,EAAE,CAAC;gBACzD,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;oBACvB,OAAO,IAAA,eAAI,EAAC,GAAG,CAAC,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,6CAA6C;gBAC7C,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACf,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC;gBACpC,CAAC;gBACD,SAAS;YACX,CAAC;iBAAM,IAAI,CAAA,MAAA,IAAI,CAAC,KAAK,0CAAE,cAAc,KAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3D,4EAA4E;gBAC5E,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBAC7B,OAAO,IAAA,eAAI,EAAC,GAAG,CAAC,oBAAoB,IAAI,yBAAyB,CAAC,CAAC;gBACrE,CAAC;gBACD,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;oBACvB,OAAO,IAAA,eAAI,EAAC,GAAG,CAAC,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBACzC,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACtC,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;oBACvB,OAAO,IAAA,eAAI,EAAC,GAAG,CAAC,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,GAAG,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAES,WAAW,CAAC,IAAY;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,oBAAoB,IAAI,mBAAmB,CAAC,CAAC;QAC3D,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,OAAO,IAAI,CAAC,kBAAkB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE;YAC9C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChC,OAAO,YAAY,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;gBACvE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;gBAClB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAES,kBAAkB,CAAC,IAAY;;QACvC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,cAAc,EAAE,CAAC;YAChC,oBAAoB;YACpB,MAAM,SAAS,GAAG,MAAA,MAAA,IAAI,CAAC,OAAO,0CAAE,qBAAqB,mCAAI,CAAC,CAAC;YAC3D,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;oBAC7C,sBAAsB;oBACtB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;YAClE,OAAO,IAAA,kBAAO,EAAC;gBACb,IAAI,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE;gBAC1C,cAAc,EAAE,OAAO,CAAC,cAAc;aACvC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAES,kBAAkB;QAC1B,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9C,CAAC;IAES,mBAAmB;QAC3B,OAAO,IAAI,CAAC,kBAAkB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE;YAC9C,IAAI,MAAM,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;YAClE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,GAAG,YAAY,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC1D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACpB,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAES,kBAAkB;QAC1B,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAA,eAAI,EAAC,8BAA8B,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAM,CAAC,IAAI,CAAC;YAC9C,CAAC;iBAAM,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACxD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAW,CAAC;gBACnD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAa,CAAC;gBACrD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC;YACjC,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACzB,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;IACvB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,SAAgB,mBAAmB,CAAC,KAAe,EAAE,OAAgC;IACnF,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CACnC,OAAe,EACf,OAAgC;IAEhC,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACvC,OAAO,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QACrB,OAAO,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/*\n * Copyright (c) 2022 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 * as fs from 'fs';\nimport * as path from 'path';\n\nimport { Result, captureResult, fail, isKeyOf, succeed } from '@fgv/ts-utils';\n\ninterface IRecordBody {\n  body: string;\n  isContinuation: boolean;\n}\n\n/**\n * Represents a single record in a JAR file\n * @public\n */\nexport type JarRecord = Record<string, string | string[]>;\n\n/**\n * @public\n */\nexport type JarFieldPicker<T extends JarRecord = JarRecord> = (record: T) => (keyof T)[];\n\n/**\n * Options for a JAR record parser.\n * @public\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface JarRecordParserOptions {\n  readonly arrayFields?: string[] | JarFieldPicker;\n  readonly fixedContinuationSize?: number;\n}\n\nclass RecordParser {\n  public readonly records: JarRecord[] = [];\n  public readonly options: JarRecordParserOptions;\n\n  protected _fields: JarRecord = {};\n  protected _name: string | undefined = undefined;\n  protected _body: IRecordBody | undefined = undefined;\n\n  // eslint-disable-next-line @typescript-eslint/no-empty-function\n  private constructor(options?: JarRecordParserOptions) {\n    this.options = options ?? {};\n  }\n\n  public static parse(lines: string[], options?: JarRecordParserOptions): Result<JarRecord[]> {\n    return new RecordParser(options)._parse(lines);\n  }\n\n  protected static _parseRecordBody(body: string): Result<IRecordBody> {\n    const isContinuation = body.endsWith('\\\\');\n    if (isContinuation) {\n      body = body.slice(0, body.length - 1);\n    }\n    if (this._hasEscapes(body)) {\n      const result = this._replaceEscapes(body);\n      if (result.isFailure()) {\n        return fail(result.message);\n      }\n      body = result.value;\n    }\n    return succeed({ body, isContinuation });\n  }\n\n  protected static _hasEscapes(from: string): boolean {\n    return from.includes('\\\\') || from.includes('&');\n  }\n\n  protected static _replaceEscapes(body: string): Result<string> {\n    const invalid: string[] = [];\n    const escaped = body.replace(/(\\\\.)|(&#x[a-fA-F0-9]{2,6};)/g, (match) => {\n      switch (match) {\n        case '\\\\\\\\':\n          return '\\\\';\n        case '\\\\&':\n          return '&';\n        case '\\\\r':\n          return '\\r';\n        case '\\\\n':\n          return '\\n';\n        case '\\\\t':\n          return '\\t';\n      }\n      if (match.startsWith('&')) {\n        const hexCode = `0x${match.slice(3, match.length - 1)}`;\n        const charCode = Number.parseInt(hexCode, 16);\n        return String.fromCharCode(charCode);\n      }\n      invalid.push(match);\n      return '\\\\';\n    });\n    if (invalid.length > 0) {\n      return fail(`unrecognized escape \"${invalid.join(', ')}\" in record-jar body`);\n    }\n    return succeed(escaped);\n  }\n\n  protected static _applyOptions(record: JarRecord, options: JarRecordParserOptions): JarRecord {\n    if (options.arrayFields) {\n      record = { ...record }; // don't edit incoming values\n      const arrayFields = Array.isArray(options.arrayFields)\n        ? options.arrayFields\n        : options.arrayFields(record);\n\n      for (const field of arrayFields) {\n        if (isKeyOf(field, record) && typeof record[field] === 'string') {\n          const current = record[field] as string;\n          record[field] = [current];\n        }\n      }\n    }\n    return record;\n  }\n\n  protected _parse(lines: string[]): Result<JarRecord[]> {\n    for (let n = 0; n < lines.length; n++) {\n      const line = lines[n];\n      if (line.startsWith('%%') && !this._body?.isContinuation) {\n        const result = this._writePendingRecord();\n        if (result.isFailure()) {\n          return fail(`${n}: ${result.message}`);\n        }\n      } else if (/^\\s*$/.test(line)) {\n        // ignore blank lines but cancel continuation\n        if (this._body) {\n          this._body.isContinuation = false;\n        }\n        continue;\n      } else if (this._body?.isContinuation || /^\\s+/.test(line)) {\n        // explicit continuation on previous line or implicit starts with whitespace\n        if (this._body === undefined) {\n          return fail(`${n}: continuation (\"${line}\") without prior value.`);\n        }\n        const result = this._parseContinuation(line);\n        if (result.isFailure()) {\n          return fail(`${n}: ${result.message}`);\n        }\n        this._body = result.value;\n      } else {\n        const result = this._parseField(line);\n        if (result.isFailure()) {\n          return fail(`${n}: ${result.message}`);\n        }\n      }\n    }\n\n    const result = this._writePendingRecord();\n    if (result.isFailure()) {\n      return fail(`${lines.length}: ${result.message}`);\n    }\n    return succeed(this.records);\n  }\n\n  protected _parseField(line: string): Result<boolean> {\n    const separatorIndex = line.indexOf(':');\n    if (separatorIndex < 1) {\n      return fail(`malformed line (\"${line}\") in record-jar.`);\n    }\n    const parts = [line.slice(0, separatorIndex), line.slice(separatorIndex + 1)];\n\n    return this._writePendingField().onSuccess(() => {\n      this._name = parts[0].trimEnd();\n      return RecordParser._parseRecordBody(parts[1].trim()).onSuccess((body) => {\n        this._body = body;\n        return succeed(true);\n      });\n    });\n  }\n\n  protected _parseContinuation(line: string): Result<IRecordBody> {\n    let trimmed = line.trim();\n    if (!this._body!.isContinuation) {\n      /* c8 ignore next */\n      const fixedSize = this.options?.fixedContinuationSize ?? 0;\n      if (fixedSize > 0) {\n        if (trimmed.length < line.length - fixedSize) {\n          // oops, took too much\n          trimmed = line.slice(fixedSize);\n        }\n      }\n    }\n    return RecordParser._parseRecordBody(trimmed).onSuccess((newBody) => {\n      return succeed({\n        body: `${this._body!.body}${newBody.body}`,\n        isContinuation: newBody.isContinuation\n      });\n    });\n  }\n\n  protected _havePendingRecord(): boolean {\n    return Object.keys(this._fields).length > 0;\n  }\n\n  protected _writePendingRecord(): Result<JarRecord | undefined> {\n    return this._writePendingField().onSuccess(() => {\n      let record = this._havePendingRecord() ? this._fields : undefined;\n      if (record !== undefined) {\n        record = RecordParser._applyOptions(record, this.options);\n        this.records.push(record);\n        this._fields = {};\n      }\n      return succeed(undefined);\n    });\n  }\n\n  protected _writePendingField(): Result<boolean> {\n    if (this._name !== undefined) {\n      if (this._body!.body.length < 1) {\n        return fail('empty body value not allowed');\n      }\n      if (!isKeyOf(this._name, this._fields)) {\n        this._fields[this._name] = this._body!.body;\n      } else if (typeof this._fields[this._name] === 'string') {\n        const current = this._fields[this._name] as string;\n        this._fields[this._name] = [current, this._body!.body];\n      } else {\n        const current = this._fields[this._name] as string[];\n        current.push(this._body!.body);\n      }\n      this._name = undefined;\n      this._body = undefined;\n    }\n    return succeed(true);\n  }\n}\n\n/**\n * Reads a record-jar from an array of strings, each of which represents one\n * line in the source file.\n * @param lines - the array of strings to be parsed\n * @param options - Optional parser configuration\n * @returns a corresponding array of `Record<string, string>`\n * @public\n */\nexport function parseRecordJarLines(lines: string[], options?: JarRecordParserOptions): Result<JarRecord[]> {\n  return RecordParser.parse(lines, options);\n}\n\n/**\n * Reads a record-jar file from a supplied path.\n * @param srcPath - Source path from which the file is read.\n * @param options - Optional parser configuration\n * @returns The contents of the file as an array of `Record<string, string>`\n * @see https://datatracker.ietf.org/doc/html/draft-phillips-record-jar-01\n * @public\n */\nexport function readRecordJarFileSync(\n  srcPath: string,\n  options?: JarRecordParserOptions\n): Result<JarRecord[]> {\n  return captureResult(() => {\n    const fullPath = path.resolve(srcPath);\n    return fs.readFileSync(fullPath, 'utf8').toString().split(/\\r?\\n/);\n  }).onSuccess((lines) => {\n    return parseRecordJarLines(lines, options);\n  });\n}\n"]}

package/lib/packlets/zip-file-tree/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/zip-file-tree/index.ts"],"names":[],"mappings":"AAsBA;;;;;;;;GAQG;AAEH,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC"}

package/lib/packlets/zip-file-tree/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/zip-file-tree/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAEH;;;;;;;;GAQG;AAEH,+DAA6F;AAApF,4HAAA,oBAAoB,OAAA;AAAE,mHAAA,WAAW,OAAA;AAAE,wHAAA,gBAAgB,OAAA","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\n/**\n * ZIP-based FileTree implementation for ts-extras.\n *\n * This packlet provides a FileTree accessor implementation that can read from ZIP archives,\n * making it useful for browser environments where files need to be bundled and transferred\n * as a single archive.\n *\n * @packageDocumentation\n */\n\nexport { ZipFileTreeAccessors, ZipFileItem, ZipDirectoryItem } from './zipFileTreeAccessors';\n"]}

package/lib/packlets/zip-file-tree/zipFileTreeAccessors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"zipFileTreeAccessors.d.ts","sourceRoot":"","sources":["../../../src/packlets/zip-file-tree/zipFileTreeAccessors.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,MAAM,EAAgC,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAErG;;;GAGG;AACH,qBAAa,WAAY,YAAW,QAAQ,CAAC,iBAAiB;IAC5D;;OAEG;IACH,SAAgB,IAAI,EAAE,MAAM,CAAU;IAEtC;;OAEG;IACH,SAAgB,YAAY,EAAE,MAAM,CAAC;IAErC;;OAEG;IACH,SAAgB,IAAI,EAAE,MAAM,CAAC;IAE7B;;OAEG;IACH,SAAgB,QAAQ,EAAE,MAAM,CAAC;IAEjC;;OAEG;IACH,SAAgB,SAAS,EAAE,MAAM,CAAC;IAElC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IAEnC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuB;IAElD;;;;;OAKG;gBACgB,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,oBAAoB;IASzF;;OAEG;IACI,WAAW,IAAI,MAAM,CAAC,OAAO,CAAC;IAC9B,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAuBxE;;OAEG;IACI,cAAc,IAAI,MAAM,CAAC,MAAM,CAAC;CAGxC;AAED;;;GAGG;AACH,qBAAa,gBAAiB,YAAW,QAAQ,CAAC,sBAAsB;IACtE;;OAEG;IACH,SAAgB,IAAI,EAAE,WAAW,CAAe;IAEhD;;OAEG;IACH,SAAgB,YAAY,EAAE,MAAM,CAAC;IAErC;;OAEG;IACH,SAAgB,IAAI,EAAE,MAAM,CAAC;IAE7B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuB;IAElD;;;;OAIG;gBACgB,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,oBAAoB;IAMzE;;OAEG;IACI,WAAW,IAAI,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;CAGnE;AAED;;;GAGG;AACH,qBAAa,oBAAqB,YAAW,QAAQ,CAAC,kBAAkB;IACtE;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAE9B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IAEjC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAiD;IAE5E;;;;OAIG;IACH,OAAO;IAMP;;;;;OAKG;WACW,UAAU,CACtB,SAAS,EAAE,WAAW,GAAG,UAAU,EACnC,MAAM,CAAC,EAAE,MAAM,GACd,MAAM,CAAC,oBAAoB,CAAC;IAW/B;;;;;OAKG;WACiB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;IAShG;;OAEG;IACH,OAAO,CAAC,eAAe;IAwCvB;;OAEG;IACI,mBAAmB,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM;IAMtD;;OAEG;IACI,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAMzC;;OAEG;IACI,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM;IAYzD;;OAEG;IACI,SAAS,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM;IAQ5C;;OAEG;IACI,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC;IAW3D;;OAEG;IACI,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IASpD;;OAEG;IACI,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;IAc9E;;OAEG;IACH,OAAO,CAAC,cAAc;CAgBvB"}

package/lib/packlets/zip-file-tree/zipFileTreeAccessors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"zipFileTreeAccessors.js","sourceRoot":"","sources":["../../../src/packlets/zip-file-tree/zipFileTreeAccessors.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;AAEH,sDAA6B;AAC7B,4CAAqG;AAErG;;;GAGG;AACH,MAAa,WAAW;IAoCtB;;;;;OAKG;IACH,YAAmB,WAAmB,EAAE,QAAgB,EAAE,SAA+B;QAzCzF;;WAEG;QACa,SAAI,GAAW,MAAM,CAAC;QAuCpC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,GAAG,GAAG,WAAW,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,WAAW,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACrE,CAAC;IAOM,WAAW,CAAI,SAAuC;QAC3D,OAAO,IAAI,CAAC,cAAc,EAAE;aACzB,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YACtB,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACpC,IAAI,SAAS,EAAE,CAAC;oBACd,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;wBAC3B,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACnC,CAAC,CAAC,kHAAkH;yBAAM,CAAC;wBACzH,OAAQ,SAA0B,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;gBACD,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE;gBAChB,OAAO,IAAA,eAAI,EAAC,mCAAmC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;YACtE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;aACD,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;YACnB,OAAO,IAAA,eAAI,EAAC,qCAAqC,KAAK,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;OAEG;IACI,cAAc;QACnB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;CACF;AApFD,kCAoFC;AAED;;;GAGG;AACH,MAAa,gBAAgB;IAqB3B;;;;OAIG;IACH,YAAmB,aAAqB,EAAE,SAA+B;QAzBzE;;WAEG;QACa,SAAI,GAAgB,WAAW,CAAC;QAuB9C,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB;QAC7E,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxD,CAAC;CACF;AAtCD,4CAsCC;AAED;;;GAGG;AACH,MAAa,oBAAoB;IAgB/B;;;;OAIG;IACH,YAAoB,GAAW,EAAE,MAAe;QAVhD;;WAEG;QACc,eAAU,GAAuC,IAAI,GAAG,EAAE,CAAC;QAQ1E,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,UAAU,CACtB,SAAmC,EACnC,MAAe;QAEf,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,IAAI,iBAAM,CAAC,MAAM,CAAC,CAAC;YAC/B,OAAO,IAAA,kBAAO,EAAC,IAAI,oBAAoB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,yFAAyF;YACzF,OAAO,IAAA,eAAI,EAAC,+BAA+B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvG,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAU,EAAE,MAAe;QACtD,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAC7C,OAAO,oBAAoB,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9E,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,IAAA,eAAI,EAAC,wBAAwB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;QAEvC,sDAAsD;QACtD,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvB,wCAAwC;gBACxC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChD,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,gCAAgC;gBAChC,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,wBAAwB;gBAC5E,IAAI,OAAO,EAAE,CAAC;oBACZ,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,+BAA+B;QAC/B,WAAW,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACjD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,0BAA0B;QAC1B,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvB,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAC9D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,mBAAmB,CAAC,GAAG,KAAe;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACtF,OAAO,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,QAAQ,CAAC;IAC9D,CAAC;IAED;;OAEG;IACI,YAAY,CAAC,IAAY;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC3C,OAAO,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,IAAY,EAAE,MAAe;QAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,wBAAwB;QACxE,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE7C,IAAI,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QACpE,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,GAAG,KAAe;QACjC,OAAO,KAAK;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,kCAAkC;aAC1E,IAAI,CAAC,GAAG,CAAC;aACT,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,6BAA6B;IACxD,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,IAAY;QACzB,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAE/C,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,IAAA,eAAI,EAAC,mBAAmB,YAAY,EAAE,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,IAAY;QACjC,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,IAAA,eAAI,EAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC;QAC/B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,IAAY;QAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,QAAQ,GAA4B,EAAE,CAAC;QAE7C,4DAA4D;QAC5D,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAChD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAA,kBAAO,EAAC,QAAQ,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,UAAkB,EAAE,SAAiB;QAC1D,kBAAkB;QAClB,MAAM,gBAAgB,GAAG,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACvD,MAAM,eAAe,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAErD,oCAAoC;QACpC,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,gBAAgB,GAAG,GAAG,CAAC,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,6CAA6C;QAC7C,MAAM,YAAY,GAAG,eAAe,CAAC,SAAS,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE5E,gEAAgE;QAChE,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;CACF;AAnND,oDAmNC","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 AdmZip from 'adm-zip';\nimport { Result, succeed, fail, captureResult, Converter, Validator, FileTree } from '@fgv/ts-utils';\n\n/**\n * Implementation of `FileTree.IFileTreeFileItem` for files in a ZIP archive.\n * @public\n */\nexport class ZipFileItem implements FileTree.IFileTreeFileItem {\n  /**\n   * Indicates that this `FileTree.FileTreeItem` is a file.\n   */\n  public readonly type: 'file' = 'file';\n\n  /**\n   * The absolute path of the file within the ZIP archive.\n   */\n  public readonly absolutePath: string;\n\n  /**\n   * The name of the file\n   */\n  public readonly name: string;\n\n  /**\n   * The base name of the file (without extension)\n   */\n  public readonly baseName: string;\n\n  /**\n   * The extension of the file\n   */\n  public readonly extension: string;\n\n  /**\n   * The pre-loaded contents of the file.\n   */\n  private readonly _contents: string;\n\n  /**\n   * The ZIP file tree accessors that created this item.\n   */\n  private readonly _accessors: ZipFileTreeAccessors;\n\n  /**\n   * Constructor for ZipFileItem.\n   * @param zipFilePath - The path of the file within the ZIP.\n   * @param contents - The pre-loaded contents of the file.\n   * @param accessors - The ZIP file tree accessors.\n   */\n  public constructor(zipFilePath: string, contents: string, accessors: ZipFileTreeAccessors) {\n    this._contents = contents;\n    this._accessors = accessors;\n    this.absolutePath = '/' + zipFilePath;\n    this.name = accessors.getBaseName(zipFilePath);\n    this.extension = accessors.getExtension(zipFilePath);\n    this.baseName = accessors.getBaseName(zipFilePath, this.extension);\n  }\n\n  /**\n   * Gets the contents of the file as parsed JSON.\n   */\n  public getContents(): Result<unknown>;\n  public getContents<T>(converter: Validator<T> | Converter<T>): Result<T>;\n  public getContents<T>(converter?: Validator<T> | Converter<T>): Result<T | unknown> {\n    return this.getRawContents()\n      .onSuccess((contents) => {\n        return captureResult(() => {\n          const parsed = JSON.parse(contents);\n          if (converter) {\n            if ('convert' in converter) {\n              return converter.convert(parsed);\n            } /* c8 ignore next 3 - validator branch functionally tested but coverage tool misses due to interface complexity */ else {\n              return (converter as Validator<T>).validate(parsed);\n            }\n          }\n          return succeed(parsed);\n        }).onFailure(() => {\n          return fail(`Failed to parse JSON from file: ${this.absolutePath}`);\n        });\n      })\n      .onFailure((error) => {\n        return fail(`Failed to get contents from file: ${error}`);\n      });\n  }\n\n  /**\n   * Gets the raw contents of the file as a string.\n   */\n  public getRawContents(): Result<string> {\n    return succeed(this._contents);\n  }\n}\n\n/**\n * Implementation of `IFileTreeDirectoryItem` for directories in a ZIP archive.\n * @public\n */\nexport class ZipDirectoryItem implements FileTree.IFileTreeDirectoryItem {\n  /**\n   * Indicates that this `FileTree.FileTreeItem` is a directory.\n   */\n  public readonly type: 'directory' = 'directory';\n\n  /**\n   * The absolute path of the directory within the ZIP archive.\n   */\n  public readonly absolutePath: string;\n\n  /**\n   * The name of the directory\n   */\n  public readonly name: string;\n\n  /**\n   * The ZIP file tree accessors that created this item.\n   */\n  private readonly _accessors: ZipFileTreeAccessors;\n\n  /**\n   * Constructor for ZipDirectoryItem.\n   * @param directoryPath - The path of the directory within the ZIP.\n   * @param accessors - The ZIP file tree accessors.\n   */\n  public constructor(directoryPath: string, accessors: ZipFileTreeAccessors) {\n    this._accessors = accessors;\n    this.absolutePath = '/' + directoryPath.replace(/\\/$/, ''); // Normalize path\n    this.name = accessors.getBaseName(directoryPath);\n  }\n\n  /**\n   * Gets the children of the directory.\n   */\n  public getChildren(): Result<ReadonlyArray<FileTree.FileTreeItem>> {\n    return this._accessors.getChildren(this.absolutePath);\n  }\n}\n\n/**\n * File tree accessors for ZIP archives.\n * @public\n */\nexport class ZipFileTreeAccessors implements FileTree.IFileTreeAccessors {\n  /**\n   * The AdmZip instance containing the archive.\n   */\n  private readonly _zip: AdmZip;\n\n  /**\n   * Optional prefix to prepend to paths.\n   */\n  private readonly _prefix: string;\n\n  /**\n   * Cache of all items in the ZIP for efficient lookups.\n   */\n  private readonly _itemCache: Map<string, FileTree.FileTreeItem> = new Map();\n\n  /**\n   * Constructor for ZipFileTreeAccessors.\n   * @param zip - The AdmZip instance.\n   * @param prefix - Optional prefix to prepend to paths.\n   */\n  private constructor(zip: AdmZip, prefix?: string) {\n    this._zip = zip;\n    this._prefix = prefix || '';\n    this._buildItemCache();\n  }\n\n  /**\n   * Creates a new ZipFileTreeAccessors instance from a ZIP file buffer.\n   * @param zipBuffer - The ZIP file as an ArrayBuffer or Uint8Array.\n   * @param prefix - Optional prefix to prepend to paths.\n   * @returns Result containing the ZipFileTreeAccessors instance.\n   */\n  public static fromBuffer(\n    zipBuffer: ArrayBuffer | Uint8Array,\n    prefix?: string\n  ): Result<ZipFileTreeAccessors> {\n    try {\n      const buffer = Buffer.from(zipBuffer);\n      const zip = new AdmZip(buffer);\n      return succeed(new ZipFileTreeAccessors(zip, prefix));\n    } catch (error) {\n      /* c8 ignore next 1 - defensive coding: AdmZip always throws Error objects in practice */\n      return fail(`Failed to load ZIP archive: ${error instanceof Error ? error.message : String(error)}`);\n    }\n  }\n\n  /**\n   * Creates a new ZipFileTreeAccessors instance from a File object (browser environment).\n   * @param file - The File object containing ZIP data.\n   * @param prefix - Optional prefix to prepend to paths.\n   * @returns Result containing the ZipFileTreeAccessors instance.\n   */\n  public static async fromFile(file: File, prefix?: string): Promise<Result<ZipFileTreeAccessors>> {\n    try {\n      const arrayBuffer = await file.arrayBuffer();\n      return ZipFileTreeAccessors.fromBuffer(new Uint8Array(arrayBuffer), prefix);\n    } catch (error) {\n      return fail(`Failed to read file: ${error instanceof Error ? error.message : String(error)}`);\n    }\n  }\n\n  /**\n   * Builds the cache of all items in the ZIP archive.\n   */\n  private _buildItemCache(): void {\n    const directories = new Set<string>();\n    const entries = this._zip.getEntries();\n\n    // First pass: collect all directories from file paths\n    entries.forEach((entry) => {\n      if (!entry.isDirectory) {\n        // Extract directory path from file path\n        const pathParts = entry.entryName.split('/');\n        for (let i = 1; i < pathParts.length; i++) {\n          const dirPath = pathParts.slice(0, i).join('/');\n          directories.add(dirPath);\n        }\n      } else {\n        // Also add explicit directories\n        const dirPath = entry.entryName.replace(/\\/$/, ''); // Remove trailing slash\n        if (dirPath) {\n          directories.add(dirPath);\n        }\n      }\n    });\n\n    // Add directory items to cache\n    directories.forEach((dirPath) => {\n      const absolutePath = this.resolveAbsolutePath(dirPath);\n      const item = new ZipDirectoryItem(dirPath, this);\n      this._itemCache.set(absolutePath, item);\n    });\n\n    // Add file items to cache\n    entries.forEach((entry) => {\n      if (!entry.isDirectory) {\n        const absolutePath = this.resolveAbsolutePath(entry.entryName);\n        const contents = entry.getData().toString('utf8');\n        const item = new ZipFileItem(entry.entryName, contents, this);\n        this._itemCache.set(absolutePath, item);\n      }\n    });\n  }\n\n  /**\n   * Resolves paths to an absolute path.\n   */\n  public resolveAbsolutePath(...paths: string[]): string {\n    const joinedPath = this.joinPaths(...paths);\n    const prefixed = this._prefix ? this.joinPaths(this._prefix, joinedPath) : joinedPath;\n    return prefixed.startsWith('/') ? prefixed : '/' + prefixed;\n  }\n\n  /**\n   * Gets the extension of a path.\n   */\n  public getExtension(path: string): string {\n    const name = this.getBaseName(path);\n    const lastDotIndex = name.lastIndexOf('.');\n    return lastDotIndex >= 0 ? name.substring(lastDotIndex) : '';\n  }\n\n  /**\n   * Gets the base name of a path.\n   */\n  public getBaseName(path: string, suffix?: string): string {\n    const normalizedPath = path.replace(/\\/$/, ''); // Remove trailing slash\n    const parts = normalizedPath.split('/');\n    let baseName = parts[parts.length - 1] || '';\n\n    if (suffix && baseName.endsWith(suffix)) {\n      baseName = baseName.substring(0, baseName.length - suffix.length);\n    }\n\n    return baseName;\n  }\n\n  /**\n   * Joins paths together.\n   */\n  public joinPaths(...paths: string[]): string {\n    return paths\n      .filter((p) => p && p.length > 0)\n      .map((p) => p.replace(/^\\/+|\\/+$/g, '')) // Remove leading/trailing slashes\n      .join('/')\n      .replace(/\\/+/g, '/'); // Normalize multiple slashes\n  }\n\n  /**\n   * Gets an item from the file tree.\n   */\n  public getItem(path: string): Result<FileTree.FileTreeItem> {\n    const absolutePath = this.resolveAbsolutePath(path);\n    const item = this._itemCache.get(absolutePath);\n\n    if (item) {\n      return succeed(item);\n    }\n\n    return fail(`Item not found: ${absolutePath}`);\n  }\n\n  /**\n   * Gets the contents of a file in the file tree.\n   */\n  public getFileContents(path: string): Result<string> {\n    return this.getItem(path).onSuccess((item) => {\n      if (item.type !== 'file') {\n        return fail(`Path is not a file: ${path}`);\n      }\n      return item.getRawContents();\n    });\n  }\n\n  /**\n   * Gets the children of a directory in the file tree.\n   */\n  public getChildren(path: string): Result<ReadonlyArray<FileTree.FileTreeItem>> {\n    const absolutePath = this.resolveAbsolutePath(path);\n    const children: FileTree.FileTreeItem[] = [];\n\n    // Find all items that are direct children of this directory\n    for (const [itemPath, item] of this._itemCache) {\n      if (this._isDirectChild(absolutePath, itemPath)) {\n        children.push(item);\n      }\n    }\n\n    return succeed(children);\n  }\n\n  /**\n   * Checks if childPath is a direct child of parentPath.\n   */\n  private _isDirectChild(parentPath: string, childPath: string): boolean {\n    // Normalize paths\n    const normalizedParent = parentPath.replace(/\\/$/, '');\n    const normalizedChild = childPath.replace(/\\/$/, '');\n\n    // Child must start with parent path\n    if (!normalizedChild.startsWith(normalizedParent + '/')) {\n      return false;\n    }\n\n    // Get the relative path from parent to child\n    const relativePath = normalizedChild.substring(normalizedParent.length + 1);\n\n    // Direct child means no additional slashes in the relative path\n    return !relativePath.includes('/');\n  }\n}\n"]}