diff --git a/extractors/cds/tools/dist/cds-extractor.bundle.js b/extractors/cds/tools/dist/cds-extractor.bundle.js
index 2d7c9e62d..47e6b3584 100644
--- a/extractors/cds/tools/dist/cds-extractor.bundle.js
+++ b/extractors/cds/tools/dist/cds-extractor.bundle.js
@@ -24,7 +24,7 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
 ));
 
 // cds-extractor.ts
-var import_path16 = require("path");
+var import_path17 = require("path");
 
 // node_modules/glob/dist/esm/index.min.js
 var import_node_url = require("node:url");
@@ -8487,6 +8487,9 @@ function createSpawnOptions(projectBaseDir, cdsCommand, cacheDir) {
   return spawnOptions;
 }
 
+// src/cds/compiler/retry.ts
+var import_path11 = require("path");
+
 // src/cds/compiler/validator.ts
 var import_fs6 = require("fs");
 var import_path7 = require("path");
@@ -8690,7 +8693,7 @@ function addCompilationDiagnostic(cdsFilePath, errorMessage, codeqlExePath2, sou
     codeqlExePath2,
     "cds/compilation-failure",
     "Failure to compile one or more SAP CAP CDS files",
-    "error" /* Error */,
+    "warning" /* Warning */,
     "source file",
     sourceRoot2
   );
@@ -9341,14 +9344,14 @@ function addCompilationDiagnosticsForFailedTasks(dependencyGraph2, codeqlExePath
       if (task.status === "failed") {
         const shouldAddDiagnostic = task.retryInfo?.hasBeenRetried ?? !task.retryInfo;
         if (shouldAddDiagnostic) {
-          for (const sourceFile of task.sourceFiles) {
-            addCompilationDiagnostic(
-              sourceFile,
-              task.errorSummary ?? "Compilation failed",
-              codeqlExePath2,
-              sourceRoot2
-            );
-          }
+          const diagnosticPath = project.packageJson ? (0, import_path11.join)(project.projectDir, "package.json") : project.projectDir;
+          const fileCount = task.sourceFiles.length;
+          const fileWord = fileCount === 1 ? "file" : "files";
+          const baseMessage = task.errorSummary ?? "Compilation failed";
+          const messageWithCount = `${baseMessage}
+
+${fileCount} CDS ${fileWord} in this project ${fileCount === 1 ? "was" : "were"} not extracted.`;
+          addCompilationDiagnostic(diagnosticPath, messageWithCount, codeqlExePath2, sourceRoot2);
         }
       }
     }
@@ -9840,11 +9843,11 @@ function planCompilationTasks(dependencyGraph2, projectCacheDirMap2) {
 }
 
 // src/cds/compiler/project.ts
-var import_path11 = require("path");
+var import_path12 = require("path");
 
 // src/cds/indexer.ts
 var import_child_process9 = require("child_process");
-var import_path12 = require("path");
+var import_path13 = require("path");
 var CDS_INDEXER_TIMEOUT_MS = 6e5;
 var CDS_INDEXER_PACKAGE = "@sap/cds-indexer";
 function projectUsesCdsIndexer(project) {
@@ -9856,7 +9859,7 @@ function projectUsesCdsIndexer(project) {
   return inDeps || inDevDeps;
 }
 function runCdsIndexer(project, sourceRoot2, cacheDir) {
-  const projectAbsPath = (0, import_path12.join)(sourceRoot2, project.projectDir);
+  const projectAbsPath = (0, import_path13.join)(sourceRoot2, project.projectDir);
   const startTime = Date.now();
   const result = {
     success: false,
@@ -9867,12 +9870,12 @@ function runCdsIndexer(project, sourceRoot2, cacheDir) {
   try {
     const nodePaths = [];
     if (cacheDir) {
-      nodePaths.push((0, import_path12.join)(cacheDir, "node_modules"));
+      nodePaths.push((0, import_path13.join)(cacheDir, "node_modules"));
     }
-    nodePaths.push((0, import_path12.join)(projectAbsPath, "node_modules"));
+    nodePaths.push((0, import_path13.join)(projectAbsPath, "node_modules"));
     const env = {
       ...process.env,
-      NODE_PATH: nodePaths.join(import_path12.delimiter)
+      NODE_PATH: nodePaths.join(import_path13.delimiter)
     };
     cdsExtractorLog(
       "info",
@@ -9965,11 +9968,11 @@ function orchestrateCdsIndexer(dependencyGraph2, sourceRoot2, projectCacheDirMap
 }
 
 // src/cds/parser/graph.ts
-var import_path14 = require("path");
+var import_path15 = require("path");
 
 // src/cds/parser/functions.ts
 var import_fs8 = require("fs");
-var import_path13 = require("path");
+var import_path14 = require("path");
 function determineCdsFilesForProjectDir(sourceRootDir, projectDir) {
   if (!sourceRootDir || !projectDir) {
     throw new Error(
@@ -9984,12 +9987,12 @@ function determineCdsFilesForProjectDir(sourceRootDir, projectDir) {
     );
   }
   try {
-    const cdsFiles = Ui((0, import_path13.join)(projectDir, "**/*.cds"), {
+    const cdsFiles = Ui((0, import_path14.join)(projectDir, "**/*.cds"), {
       nodir: true,
       ignore: ["**/node_modules/**", "**/*.testproj/**"],
       windowsPathsNoEscape: true
     });
-    const relativePaths = cdsFiles.map((file) => (0, import_path13.relative)(sourceRootDir, file));
+    const relativePaths = cdsFiles.map((file) => (0, import_path14.relative)(sourceRootDir, file));
     const pathsIgnorePatterns = getPathsIgnorePatterns(sourceRootDir);
     if (pathsIgnorePatterns.length > 0) {
       const filtered = filterIgnoredPaths(relativePaths, pathsIgnorePatterns);
@@ -9997,7 +10000,7 @@ function determineCdsFilesForProjectDir(sourceRootDir, projectDir) {
       if (ignoredCount > 0) {
         cdsExtractorLog(
           "info",
-          `Filtered ${ignoredCount} CDS file(s) matching paths-ignore patterns in project ${(0, import_path13.relative)(sourceRootDir, projectDir) || "."}`
+          `Filtered ${ignoredCount} CDS file(s) matching paths-ignore patterns in project ${(0, import_path14.relative)(sourceRootDir, projectDir) || "."}`
         );
       }
       return filtered;
@@ -10013,22 +10016,22 @@ function determineCdsProjectsUnderSourceDir(sourceRootDir) {
     throw new Error(`Source root directory '${sourceRootDir}' does not exist.`);
   }
   const foundProjects = /* @__PURE__ */ new Set();
-  const packageJsonFiles = Ui((0, import_path13.join)(sourceRootDir, "**/package.json"), {
+  const packageJsonFiles = Ui((0, import_path14.join)(sourceRootDir, "**/package.json"), {
     nodir: true,
     ignore: ["**/node_modules/**", "**/*.testproj/**"],
     windowsPathsNoEscape: true
   });
-  const cdsFiles = Ui((0, import_path13.join)(sourceRootDir, "**/*.cds"), {
+  const cdsFiles = Ui((0, import_path14.join)(sourceRootDir, "**/*.cds"), {
     nodir: true,
     ignore: ["**/node_modules/**", "**/*.testproj/**"],
     windowsPathsNoEscape: true
   });
   const candidateDirectories = /* @__PURE__ */ new Set();
   for (const packageJsonFile of packageJsonFiles) {
-    candidateDirectories.add((0, import_path13.dirname)(packageJsonFile));
+    candidateDirectories.add((0, import_path14.dirname)(packageJsonFile));
   }
   for (const cdsFile of cdsFiles) {
-    const cdsDir = (0, import_path13.dirname)(cdsFile);
+    const cdsDir = (0, import_path14.dirname)(cdsFile);
     const projectRoot = findProjectRootFromCdsFile(cdsDir, sourceRootDir);
     if (projectRoot) {
       candidateDirectories.add(projectRoot);
@@ -10038,14 +10041,14 @@ function determineCdsProjectsUnderSourceDir(sourceRootDir) {
   }
   for (const dir of candidateDirectories) {
     if (isLikelyCdsProject(dir)) {
-      const relativePath = (0, import_path13.relative)(sourceRootDir, dir);
+      const relativePath = (0, import_path14.relative)(sourceRootDir, dir);
       const projectDir = relativePath || ".";
       let shouldAdd = true;
       const existingProjects = Array.from(foundProjects);
       for (const existingProject of existingProjects) {
-        const existingAbsPath = (0, import_path13.join)(sourceRootDir, existingProject);
-        if (dir.startsWith(existingAbsPath + import_path13.sep)) {
-          const parentPackageJsonPath = (0, import_path13.join)(existingAbsPath, "package.json");
+        const existingAbsPath = (0, import_path14.join)(sourceRootDir, existingProject);
+        if (dir.startsWith(existingAbsPath + import_path14.sep)) {
+          const parentPackageJsonPath = (0, import_path14.join)(existingAbsPath, "package.json");
           const parentPackageJson = readPackageJsonFile(parentPackageJsonPath);
           const isParentMonorepo = parentPackageJson?.workspaces && Array.isArray(parentPackageJson.workspaces) && parentPackageJson.workspaces.length > 0;
           if (isParentMonorepo && (hasStandardCdsContent(existingAbsPath) || hasDirectCdsContent(existingAbsPath))) {
@@ -10055,8 +10058,8 @@ function determineCdsProjectsUnderSourceDir(sourceRootDir) {
           }
           break;
         }
-        if (existingAbsPath.startsWith(dir + import_path13.sep)) {
-          const currentPackageJsonPath = (0, import_path13.join)(dir, "package.json");
+        if (existingAbsPath.startsWith(dir + import_path14.sep)) {
+          const currentPackageJsonPath = (0, import_path14.join)(dir, "package.json");
           const currentPackageJson = readPackageJsonFile(currentPackageJsonPath);
           const isCurrentMonorepo = currentPackageJson?.workspaces && Array.isArray(currentPackageJson.workspaces) && currentPackageJson.workspaces.length > 0;
           if (!(isCurrentMonorepo && isLikelyCdsProject(existingAbsPath))) {
@@ -10097,32 +10100,32 @@ function findProjectRootFromCdsFile(cdsFileDir, sourceRootDir) {
   let currentDir = cdsFileDir;
   while (currentDir.startsWith(sourceRootDir)) {
     if (isLikelyCdsProject(currentDir)) {
-      const currentDirName = (0, import_path13.basename)(currentDir);
+      const currentDirName = (0, import_path14.basename)(currentDir);
       const isStandardSubdir = ["srv", "db", "app"].includes(currentDirName);
       if (isStandardSubdir) {
-        const parentDir3 = (0, import_path13.dirname)(currentDir);
+        const parentDir3 = (0, import_path14.dirname)(currentDir);
         if (parentDir3 !== currentDir && parentDir3.startsWith(sourceRootDir) && !parentDir3.includes("node_modules") && !parentDir3.includes(".testproj") && isLikelyCdsProject(parentDir3)) {
           return parentDir3;
         }
       }
-      const parentDir2 = (0, import_path13.dirname)(currentDir);
+      const parentDir2 = (0, import_path14.dirname)(currentDir);
       if (parentDir2 !== currentDir && parentDir2.startsWith(sourceRootDir) && !parentDir2.includes("node_modules") && !parentDir2.includes(".testproj")) {
-        const hasDbDir2 = (0, import_fs8.existsSync)((0, import_path13.join)(parentDir2, "db")) && (0, import_fs8.statSync)((0, import_path13.join)(parentDir2, "db")).isDirectory();
-        const hasSrvDir2 = (0, import_fs8.existsSync)((0, import_path13.join)(parentDir2, "srv")) && (0, import_fs8.statSync)((0, import_path13.join)(parentDir2, "srv")).isDirectory();
-        const hasAppDir2 = (0, import_fs8.existsSync)((0, import_path13.join)(parentDir2, "app")) && (0, import_fs8.statSync)((0, import_path13.join)(parentDir2, "app")).isDirectory();
+        const hasDbDir2 = (0, import_fs8.existsSync)((0, import_path14.join)(parentDir2, "db")) && (0, import_fs8.statSync)((0, import_path14.join)(parentDir2, "db")).isDirectory();
+        const hasSrvDir2 = (0, import_fs8.existsSync)((0, import_path14.join)(parentDir2, "srv")) && (0, import_fs8.statSync)((0, import_path14.join)(parentDir2, "srv")).isDirectory();
+        const hasAppDir2 = (0, import_fs8.existsSync)((0, import_path14.join)(parentDir2, "app")) && (0, import_fs8.statSync)((0, import_path14.join)(parentDir2, "app")).isDirectory();
         if (hasDbDir2 && hasSrvDir2 || hasSrvDir2 && hasAppDir2) {
           return parentDir2;
         }
       }
       return currentDir;
     }
-    const hasDbDir = (0, import_fs8.existsSync)((0, import_path13.join)(currentDir, "db")) && (0, import_fs8.statSync)((0, import_path13.join)(currentDir, "db")).isDirectory();
-    const hasSrvDir = (0, import_fs8.existsSync)((0, import_path13.join)(currentDir, "srv")) && (0, import_fs8.statSync)((0, import_path13.join)(currentDir, "srv")).isDirectory();
-    const hasAppDir = (0, import_fs8.existsSync)((0, import_path13.join)(currentDir, "app")) && (0, import_fs8.statSync)((0, import_path13.join)(currentDir, "app")).isDirectory();
+    const hasDbDir = (0, import_fs8.existsSync)((0, import_path14.join)(currentDir, "db")) && (0, import_fs8.statSync)((0, import_path14.join)(currentDir, "db")).isDirectory();
+    const hasSrvDir = (0, import_fs8.existsSync)((0, import_path14.join)(currentDir, "srv")) && (0, import_fs8.statSync)((0, import_path14.join)(currentDir, "srv")).isDirectory();
+    const hasAppDir = (0, import_fs8.existsSync)((0, import_path14.join)(currentDir, "app")) && (0, import_fs8.statSync)((0, import_path14.join)(currentDir, "app")).isDirectory();
     if (hasDbDir && hasSrvDir || hasSrvDir && hasAppDir) {
       return currentDir;
     }
-    const parentDir = (0, import_path13.dirname)(currentDir);
+    const parentDir = (0, import_path14.dirname)(currentDir);
     if (parentDir === currentDir) {
       break;
     }
@@ -10143,7 +10146,7 @@ function isLikelyCdsProject(dir) {
       if (!hasCdsFiles) {
         return false;
       }
-      const packageJsonPath = (0, import_path13.join)(dir, "package.json");
+      const packageJsonPath = (0, import_path14.join)(dir, "package.json");
       const packageJson = readPackageJsonFile(packageJsonPath);
       if (packageJson?.workspaces && Array.isArray(packageJson.workspaces) && packageJson.workspaces.length > 0) {
         if (!hasCdsFiles) {
@@ -10159,10 +10162,10 @@ function isLikelyCdsProject(dir) {
   }
 }
 function hasStandardCdsContent(dir) {
-  const standardLocations = [(0, import_path13.join)(dir, "db"), (0, import_path13.join)(dir, "srv"), (0, import_path13.join)(dir, "app")];
+  const standardLocations = [(0, import_path14.join)(dir, "db"), (0, import_path14.join)(dir, "srv"), (0, import_path14.join)(dir, "app")];
   for (const location of standardLocations) {
     if ((0, import_fs8.existsSync)(location) && (0, import_fs8.statSync)(location).isDirectory()) {
-      const cdsFiles = Ui((0, import_path13.join)(location, "**/*.cds"), {
+      const cdsFiles = Ui((0, import_path14.join)(location, "**/*.cds"), {
         nodir: true,
         windowsPathsNoEscape: true
       });
@@ -10174,7 +10177,7 @@ function hasStandardCdsContent(dir) {
   return false;
 }
 function hasDirectCdsContent(dir) {
-  const directCdsFiles = Ui((0, import_path13.join)(dir, "*.cds"), { windowsPathsNoEscape: true });
+  const directCdsFiles = Ui((0, import_path14.join)(dir, "*.cds"), { windowsPathsNoEscape: true });
   return directCdsFiles.length > 0;
 }
 function readPackageJsonFile(filePath) {
@@ -10194,36 +10197,36 @@ function determineCdsFilesToCompile(sourceRootDir, project) {
   if (!project.cdsFiles || project.cdsFiles.length === 0) {
     return {
       compilationTargets: [],
-      expectedOutputFile: (0, import_path13.join)(project.projectDir, modelCdsJsonFile)
+      expectedOutputFile: (0, import_path14.join)(project.projectDir, modelCdsJsonFile)
     };
   }
-  const absoluteProjectDir = (0, import_path13.join)(sourceRootDir, project.projectDir);
+  const absoluteProjectDir = (0, import_path14.join)(sourceRootDir, project.projectDir);
   const capDirectories = ["db", "srv", "app"];
-  const existingCapDirs = capDirectories.filter((dir) => (0, import_fs8.existsSync)((0, import_path13.join)(absoluteProjectDir, dir)));
+  const existingCapDirs = capDirectories.filter((dir) => (0, import_fs8.existsSync)((0, import_path14.join)(absoluteProjectDir, dir)));
   if (existingCapDirs.length > 0) {
     return {
       compilationTargets: existingCapDirs,
-      expectedOutputFile: (0, import_path13.join)(project.projectDir, modelCdsJsonFile)
+      expectedOutputFile: (0, import_path14.join)(project.projectDir, modelCdsJsonFile)
     };
   }
-  const rootCdsFiles = project.cdsFiles.filter((file) => (0, import_path13.dirname)((0, import_path13.join)(sourceRootDir, file)) === absoluteProjectDir).map((file) => (0, import_path13.basename)(file));
+  const rootCdsFiles = project.cdsFiles.filter((file) => (0, import_path14.dirname)((0, import_path14.join)(sourceRootDir, file)) === absoluteProjectDir).map((file) => (0, import_path14.basename)(file));
   if (rootCdsFiles.length > 0) {
     return {
       compilationTargets: rootCdsFiles,
-      expectedOutputFile: (0, import_path13.join)(project.projectDir, modelCdsJsonFile)
+      expectedOutputFile: (0, import_path14.join)(project.projectDir, modelCdsJsonFile)
     };
   }
   const compilationTargets = project.cdsFiles.map(
-    (file) => (0, import_path13.relative)(absoluteProjectDir, (0, import_path13.join)(sourceRootDir, file))
+    (file) => (0, import_path14.relative)(absoluteProjectDir, (0, import_path14.join)(sourceRootDir, file))
   );
   return {
     compilationTargets,
-    expectedOutputFile: (0, import_path13.join)(project.projectDir, modelCdsJsonFile)
+    expectedOutputFile: (0, import_path14.join)(project.projectDir, modelCdsJsonFile)
   };
 }
 function hasPackageJsonWithCapDeps(dir) {
   try {
-    const packageJsonPath = (0, import_path13.join)(dir, "package.json");
+    const packageJsonPath = (0, import_path14.join)(dir, "package.json");
     const packageJson = readPackageJsonFile(packageJsonPath);
     if (packageJson) {
       const dependencies = {
@@ -10254,7 +10257,7 @@ function buildBasicCdsProjectDependencyGraph(sourceRootDir) {
       cdsExtractorLog("info", `Skipping project '${projectDir}' \u2014 matches paths-ignore pattern`);
       continue;
     }
-    const absoluteProjectDir = (0, import_path14.join)(sourceRootDir, projectDir);
+    const absoluteProjectDir = (0, import_path15.join)(sourceRootDir, projectDir);
     const cdsFiles = determineCdsFilesForProjectDir(sourceRootDir, absoluteProjectDir);
     if (cdsFiles.length === 0) {
       cdsExtractorLog(
@@ -10263,14 +10266,14 @@ function buildBasicCdsProjectDependencyGraph(sourceRootDir) {
       );
       continue;
     }
-    const packageJsonPath = (0, import_path14.join)(absoluteProjectDir, "package.json");
+    const packageJsonPath = (0, import_path15.join)(absoluteProjectDir, "package.json");
     const packageJson = readPackageJsonFile(packageJsonPath);
     projectMap.set(projectDir, {
       projectDir,
       cdsFiles,
       compilationTargets: [],
       // Will be populated in the third pass
-      expectedOutputFile: (0, import_path14.join)(projectDir, modelCdsJsonFile),
+      expectedOutputFile: (0, import_path15.join)(projectDir, modelCdsJsonFile),
       packageJson,
       dependencies: [],
       imports: /* @__PURE__ */ new Map()
@@ -10279,18 +10282,18 @@ function buildBasicCdsProjectDependencyGraph(sourceRootDir) {
   cdsExtractorLog("info", "Analyzing dependencies between CDS projects...");
   for (const [projectDir, project] of projectMap.entries()) {
     for (const relativeFilePath of project.cdsFiles) {
-      const absoluteFilePath = (0, import_path14.join)(sourceRootDir, relativeFilePath);
+      const absoluteFilePath = (0, import_path15.join)(sourceRootDir, relativeFilePath);
       try {
         const imports = extractCdsImports(absoluteFilePath);
         const enrichedImports = [];
         for (const importInfo of imports) {
           const enrichedImport = { ...importInfo };
           if (importInfo.isRelative) {
-            const importedFilePath = (0, import_path14.resolve)((0, import_path14.dirname)(absoluteFilePath), importInfo.path);
+            const importedFilePath = (0, import_path15.resolve)((0, import_path15.dirname)(absoluteFilePath), importInfo.path);
             const normalizedImportedPath = importedFilePath.endsWith(".cds") ? importedFilePath : `${importedFilePath}.cds`;
             try {
-              const relativeToDirPath = (0, import_path14.dirname)(relativeFilePath);
-              const resolvedPath = (0, import_path14.resolve)((0, import_path14.join)(sourceRootDir, relativeToDirPath), importInfo.path);
+              const relativeToDirPath = (0, import_path15.dirname)(relativeFilePath);
+              const resolvedPath = (0, import_path15.resolve)((0, import_path15.join)(sourceRootDir, relativeToDirPath), importInfo.path);
               const normalizedResolvedPath = resolvedPath.endsWith(".cds") ? resolvedPath : `${resolvedPath}.cds`;
               if (normalizedResolvedPath.startsWith(sourceRootDir)) {
                 enrichedImport.resolvedPath = normalizedResolvedPath.substring(sourceRootDir.length).replace(/^[/\\]/, "");
@@ -10303,10 +10306,10 @@ function buildBasicCdsProjectDependencyGraph(sourceRootDir) {
             }
             for (const [otherProjectDir, otherProject] of projectMap.entries()) {
               if (otherProjectDir === projectDir) continue;
-              const otherProjectAbsoluteDir = (0, import_path14.join)(sourceRootDir, otherProjectDir);
+              const otherProjectAbsoluteDir = (0, import_path15.join)(sourceRootDir, otherProjectDir);
               const isInOtherProject = otherProject.cdsFiles.some((otherFile) => {
-                const otherAbsolutePath = (0, import_path14.join)(sourceRootDir, otherFile);
-                return otherAbsolutePath === normalizedImportedPath || normalizedImportedPath.startsWith(otherProjectAbsoluteDir + import_path14.sep);
+                const otherAbsolutePath = (0, import_path15.join)(sourceRootDir, otherFile);
+                return otherAbsolutePath === normalizedImportedPath || normalizedImportedPath.startsWith(otherProjectAbsoluteDir + import_path15.sep);
               });
               if (isInOtherProject) {
                 project.dependencies ??= [];
@@ -10349,8 +10352,8 @@ function buildBasicCdsProjectDependencyGraph(sourceRootDir) {
         "warn",
         `Error determining files to compile for project ${project.projectDir}: ${String(error)}`
       );
-      project.compilationTargets = project.cdsFiles.map((file) => (0, import_path14.basename)(file));
-      project.expectedOutputFile = (0, import_path14.join)(project.projectDir, modelCdsJsonFile);
+      project.compilationTargets = project.cdsFiles.map((file) => (0, import_path15.basename)(file));
+      project.expectedOutputFile = (0, import_path15.join)(project.projectDir, modelCdsJsonFile);
     }
   }
   return projectMap;
@@ -10558,13 +10561,13 @@ function handleEarlyExit(sourceRoot2, autobuildScriptPath2, codeqlExePath2, skip
 }
 
 // src/utils.ts
-var import_path15 = require("path");
+var import_path16 = require("path");
 var USAGE_MESSAGE = `	Usage: node <script> <source-root>`;
 function resolveSourceRoot(sourceRoot2) {
   if (!sourceRoot2 || typeof sourceRoot2 !== "string") {
     throw new Error("Source root must be a non-empty string");
   }
-  const normalizedPath = (0, import_path15.resolve)(sourceRoot2);
+  const normalizedPath = (0, import_path16.resolve)(sourceRoot2);
   if (!normalizedPath || normalizedPath === "/") {
     throw new Error("Source root must point to a valid directory");
   }
@@ -10661,7 +10664,7 @@ try {
     try {
       const allCdsFiles = Array.from(
         /* @__PURE__ */ new Set([
-          ...Ui((0, import_path16.join)(sourceRoot, "**/*.cds"), {
+          ...Ui((0, import_path17.join)(sourceRoot, "**/*.cds"), {
             ignore: ["**/node_modules/**", "**/.git/**"],
             windowsPathsNoEscape: true
           })
diff --git a/extractors/cds/tools/dist/cds-extractor.bundle.js.map b/extractors/cds/tools/dist/cds-extractor.bundle.js.map
index 2a70f0949..f80bee084 100644
--- a/extractors/cds/tools/dist/cds-extractor.bundle.js.map
+++ b/extractors/cds/tools/dist/cds-extractor.bundle.js.map
@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../cds-extractor.ts", "../node_modules/glob/node_modules/balanced-match/src/index.ts", "../node_modules/glob/node_modules/brace-expansion/src/index.ts", "../node_modules/glob/node_modules/minimatch/src/assert-valid-pattern.ts", "../node_modules/glob/node_modules/minimatch/src/brace-expressions.ts", "../node_modules/glob/node_modules/minimatch/src/unescape.ts", "../node_modules/glob/node_modules/minimatch/src/ast.ts", "../node_modules/glob/node_modules/minimatch/src/escape.ts", "../node_modules/glob/node_modules/minimatch/src/index.ts", "../node_modules/glob/src/glob.ts", "../node_modules/glob/node_modules/lru-cache/src/index.ts", "../node_modules/glob/node_modules/path-scurry/src/index.ts", "../node_modules/glob/node_modules/minipass/src/index.ts", "../node_modules/glob/src/pattern.ts", "../node_modules/glob/src/ignore.ts", "../node_modules/glob/src/processor.ts", "../node_modules/glob/src/walker.ts", "../node_modules/glob/src/has-magic.ts", "../node_modules/glob/src/index.ts", "../src/cds/compiler/command.ts", "../src/filesystem.ts", "../src/constants.ts", "../src/logging/cdsExtractorLog.ts", "../src/logging/statusReport.ts", "../src/cds/compiler/compile.ts", "../src/cds/compiler/version.ts", "../src/environment.ts", "../src/paths-ignore.ts", "../node_modules/js-yaml/dist/js-yaml.mjs", "../node_modules/brace-expansion/node_modules/balanced-match/src/index.ts", "../node_modules/brace-expansion/src/index.ts", "../node_modules/minimatch/src/assert-valid-pattern.ts", "../node_modules/minimatch/src/brace-expressions.ts", "../node_modules/minimatch/src/unescape.ts", "../node_modules/minimatch/src/ast.ts", "../node_modules/minimatch/src/escape.ts", "../node_modules/minimatch/src/index.ts", "../src/cds/compiler/validator.ts", "../src/diagnostics.ts", "../src/packageManager/cacheInstaller.ts", "../src/packageManager/versionResolver.ts", "../src/packageManager/projectInstaller.ts", "../src/cds/compiler/retry.ts", "../src/cds/compiler/graph.ts", "../src/cds/compiler/project.ts", "../src/cds/indexer.ts", "../src/cds/parser/graph.ts", "../src/cds/parser/functions.ts", "../src/codeql.ts", "../src/utils.ts"],
-  "sourcesContent": ["import { join } from 'path';\n\nimport { sync as globSync } from 'glob';\n\nimport { orchestrateCompilation } from './src/cds/compiler';\nimport { orchestrateCdsIndexer } from './src/cds/indexer';\nimport { buildCdsProjectDependencyGraph, type CdsDependencyGraph } from './src/cds/parser';\nimport { handleEarlyExit, runJavaScriptExtractionWithMarker } from './src/codeql';\nimport {\n  addCompilationDiagnostic,\n  addDependencyGraphDiagnostic,\n  addDependencyInstallationDiagnostic,\n  addEnvironmentSetupDiagnostic,\n  addNoCdsProjectsDiagnostic,\n} from './src/diagnostics';\nimport { setupAndValidateEnvironment } from './src/environment';\nimport {\n  cdsExtractorLog,\n  generateStatusReport,\n  logExtractorStart,\n  logExtractorStop,\n  logPerformanceMilestone,\n  logPerformanceTrackingStart,\n  logPerformanceTrackingStop,\n  setSourceRootDirectory,\n} from './src/logging';\nimport { cacheInstallDependencies } from './src/packageManager';\nimport { validateArguments } from './src/utils';\n\n// ============================================================================\n// Main Extraction Flow\n// ============================================================================\n\n// Validate arguments\nconst validationResult = validateArguments(process.argv);\nif (!validationResult.isValid) {\n  console.warn(validationResult.usageMessage);\n  console.log(\n    `CDS extractor terminated due to invalid arguments: ${validationResult.usageMessage}`,\n  );\n  console.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n  process.exit(0);\n}\n\nconst { sourceRoot } = validationResult.args!;\n\n// Initialize logging\nsetSourceRootDirectory(sourceRoot);\nlogExtractorStart(sourceRoot);\n\n// Setup and validate environment\nlogPerformanceTrackingStart('Environment Setup');\nconst {\n  success: envSetupSuccess,\n  errorMessages,\n  codeqlExePath,\n  autobuildScriptPath,\n  platformInfo,\n} = setupAndValidateEnvironment(sourceRoot);\nlogPerformanceTrackingStop('Environment Setup');\n\nif (!envSetupSuccess) {\n  const codeqlExe = platformInfo.isWindows ? 'codeql.exe' : 'codeql';\n  const errorMessage = `'${codeqlExe} database index-files --language cds' terminated early due to: ${errorMessages.join(', ')}.`;\n  cdsExtractorLog('warn', errorMessage);\n\n  if (codeqlExePath) {\n    addEnvironmentSetupDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n  }\n\n  logExtractorStop(\n    false,\n    'Warning: Environment setup failed, continuing with limited functionality',\n  );\n} else {\n  process.chdir(sourceRoot);\n}\n\ncdsExtractorLog(\n  'info',\n  `CodeQL CDS extractor using autobuild mode for scan of project source root directory '${sourceRoot}'.`,\n);\n\n// Build CDS project dependency graph\ncdsExtractorLog('info', 'Building CDS project dependency graph...');\nlet dependencyGraph: CdsDependencyGraph;\n\ntry {\n  logPerformanceTrackingStart('Dependency Graph Build');\n  dependencyGraph = buildCdsProjectDependencyGraph(sourceRoot);\n  logPerformanceTrackingStop('Dependency Graph Build');\n\n  logPerformanceMilestone(\n    'Dependency graph created',\n    `${dependencyGraph.projects.size} projects, ${dependencyGraph.statusSummary.totalCdsFiles} CDS files`,\n  );\n\n  // Log project details\n  if (dependencyGraph.projects.size > 0) {\n    for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n      cdsExtractorLog(\n        'info',\n        `Project: ${projectDir}, Status: ${project.status}, CDS files: ${project.cdsFiles.length}, Compilation targets: ${project.compilationTargets.length}`,\n      );\n    }\n  } else {\n    // No CDS projects detected - try direct file search as diagnostic\n    cdsExtractorLog(\n      'error',\n      'No CDS projects were detected. This is an unrecoverable error as there is nothing to scan.',\n    );\n\n    try {\n      const allCdsFiles = Array.from(\n        new Set([\n          ...globSync(join(sourceRoot, '**/*.cds'), {\n            ignore: ['**/node_modules/**', '**/.git/**'],\n            windowsPathsNoEscape: true,\n          }),\n        ]),\n      );\n      cdsExtractorLog(\n        'info',\n        `Direct search found ${allCdsFiles.length} CDS files in the source tree.`,\n      );\n\n      if (allCdsFiles.length > 0) {\n        cdsExtractorLog(\n          'info',\n          `Sample CDS files: ${allCdsFiles.slice(0, 5).join(', ')}${allCdsFiles.length > 5 ? ', ...' : ''}`,\n        );\n        cdsExtractorLog(\n          'error',\n          'CDS files were found but no projects were detected. This indicates a problem with project detection logic.',\n        );\n      } else {\n        cdsExtractorLog(\n          'info',\n          'No CDS files found in the source tree. This may be expected if the source does not contain CAP/CDS projects.',\n        );\n      }\n    } catch (globError) {\n      cdsExtractorLog('warn', `Could not perform direct CDS file search: ${String(globError)}`);\n    }\n\n    const warningMessage =\n      'No CDS projects were detected. This may be expected if the source does not contain CAP/CDS projects.';\n    if (codeqlExePath) {\n      addNoCdsProjectsDiagnostic(sourceRoot, warningMessage, codeqlExePath);\n    }\n\n    logExtractorStop(false, 'Warning: No CDS projects detected, skipping CDS-specific processing');\n    handleEarlyExit(\n      sourceRoot,\n      autobuildScriptPath || '',\n      codeqlExePath,\n      'JavaScript extraction completed (CDS processing was skipped)',\n    );\n  }\n} catch (error) {\n  const errorMessage = `Failed to build CDS dependency graph: ${String(error)}`;\n  cdsExtractorLog('error', errorMessage);\n\n  if (codeqlExePath) {\n    addDependencyGraphDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n  }\n\n  logExtractorStop(\n    false,\n    'Warning: Dependency graph build failed, skipping CDS-specific processing',\n  );\n  handleEarlyExit(\n    sourceRoot,\n    autobuildScriptPath || '',\n    codeqlExePath,\n    'JavaScript extraction completed (CDS processing was skipped)',\n  );\n}\n\n// Install dependencies\nlogPerformanceTrackingStart('Dependency Installation');\nconst projectCacheDirMap = cacheInstallDependencies(dependencyGraph, sourceRoot, codeqlExePath);\nlogPerformanceTrackingStop('Dependency Installation');\n\nif (projectCacheDirMap.size === 0) {\n  cdsExtractorLog(\n    'error',\n    'No project cache directory mappings were created. This indicates that dependency installation failed for all discovered projects.',\n  );\n\n  if (dependencyGraph.projects.size > 0) {\n    const errorMessage = `Found ${dependencyGraph.projects.size} CDS projects but failed to install dependencies for any of them. Cannot proceed with compilation.`;\n    cdsExtractorLog('error', errorMessage);\n\n    if (codeqlExePath) {\n      addDependencyInstallationDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n    }\n\n    logExtractorStop(\n      false,\n      'Warning: Dependency installation failed for all projects, continuing with limited functionality',\n    );\n  }\n\n  cdsExtractorLog(\n    'warn',\n    'No projects and no cache mappings - this should have been detected earlier.',\n  );\n}\n\n// Run cds-indexer for projects that use it (before compilation)\nlogPerformanceTrackingStart('CDS Indexer');\nconst cdsIndexerSummary = orchestrateCdsIndexer(\n  dependencyGraph,\n  sourceRoot,\n  projectCacheDirMap,\n  codeqlExePath,\n);\nlogPerformanceTrackingStop('CDS Indexer');\n\nif (cdsIndexerSummary.projectsRequiringIndexer > 0) {\n  logPerformanceMilestone(\n    'CDS indexer completed',\n    `${cdsIndexerSummary.successfulRuns} succeeded, ${cdsIndexerSummary.failedRuns} failed`,\n  );\n}\n\n// Collect all CDS files to process\nconst cdsFilePathsToProcess: string[] = [];\nfor (const project of dependencyGraph.projects.values()) {\n  cdsFilePathsToProcess.push(...project.cdsFiles);\n}\n\ncdsExtractorLog(\n  'info',\n  `Found ${cdsFilePathsToProcess.length} total CDS files, ${dependencyGraph.statusSummary.totalCdsFiles} CDS files in dependency graph`,\n);\n\n// Compile CDS files\nlogPerformanceTrackingStart('CDS Compilation');\ntry {\n  orchestrateCompilation(dependencyGraph, projectCacheDirMap, codeqlExePath);\n\n  if (!dependencyGraph.statusSummary.overallSuccess) {\n    cdsExtractorLog(\n      'error',\n      `Compilation completed with failures: ${dependencyGraph.statusSummary.failedCompilations} failed out of ${dependencyGraph.statusSummary.totalCompilationTasks} total tasks`,\n    );\n\n    for (const error of dependencyGraph.errors.critical) {\n      cdsExtractorLog('error', `Critical error in ${error.phase}: ${error.message}`);\n    }\n  }\n\n  logPerformanceTrackingStop('CDS Compilation');\n  logPerformanceMilestone('CDS compilation completed');\n} catch (error) {\n  logPerformanceTrackingStop('CDS Compilation');\n  cdsExtractorLog('error', `Compilation orchestration failed: ${String(error)}`);\n\n  if (cdsFilePathsToProcess.length > 0) {\n    addCompilationDiagnostic(\n      cdsFilePathsToProcess[0],\n      `Compilation orchestration failed: ${String(error)}`,\n      codeqlExePath,\n      sourceRoot,\n    );\n  }\n}\n\n// Run JavaScript extraction with marker file handling\nconst extractionSuccess = runJavaScriptExtractionWithMarker(\n  sourceRoot,\n  autobuildScriptPath,\n  codeqlExePath,\n  dependencyGraph,\n);\n\nlogExtractorStop(\n  extractionSuccess,\n  extractionSuccess ? 'CDS extraction completed successfully' : 'JavaScript extractor failed',\n);\n\ncdsExtractorLog(\n  'info',\n  'CDS Extractor Status Report : Final...\\n' + generateStatusReport(dependencyGraph),\n);\n\nconsole.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ? Math.abs(numeric(n[2])) : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: any) => void = (\n  pattern: any,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string): c is ExtglobType =>\n  types.has(c as ExtglobType)\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  readonly #parent?: AST\n  readonly #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n  ): number {\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        if (!opt.noext && isExtglobType(c) && str.charAt(i) === '(') {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      if (isExtglobType(c) && str.charAt(i) === '(') {\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) this.#fillNegs()\n    if (!this.type) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      this.#parts = [s]\n      this.type = null\n      this.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    // XXX abstract out this map method\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #partsToRegExp(dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    const options = this.options\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          if (pdi > fdi) {\n            pattern = pattern.slice(pdi)\n          } else if (fdi > pdi) {\n            file = file.slice(fdi)\n          }\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    this.debug('matchOne', this, { file, pattern })\n    this.debug('matchOne', file.length, pattern.length)\n\n    for (\n      var fi = 0, pi = 0, fl = file.length, pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      var p = pattern[pi]\n      var f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      if (p === GLOBSTAR) {\n        this.debug('GLOBSTAR', [pattern, p, f])\n\n        // \"**\"\n        // a/**/b/**/c would match the following:\n        // a/b/x/y/z/c\n        // a/x/y/z/b/c\n        // a/b/x/b/x/c\n        // a/b/c\n        // To do this, take the rest of the pattern after\n        // the **, and see if it would match the file remainder.\n        // If so, return success.\n        // If not, the ** \"swallows\" a segment, and try again.\n        // This is recursively awful.\n        //\n        // a/**/b/**/c matching a/b/x/y/z/c\n        // - a matches a\n        // - doublestar\n        //   - matchOne(b/x/y/z/c, b/**/c)\n        //     - b matches b\n        //     - doublestar\n        //       - matchOne(x/y/z/c, c) -> no\n        //       - matchOne(y/z/c, c) -> no\n        //       - matchOne(z/c, c) -> no\n        //       - matchOne(c, c) yes, hit\n        var fr = fi\n        var pr = pi + 1\n        if (pr === pl) {\n          this.debug('** at the end')\n          // a ** at the end will just swallow the rest.\n          // We have found a match.\n          // however, it will not swallow /.x, unless\n          // options.dot is set.\n          // . and .. are *never* matched by **, for explosively\n          // exponential reasons.\n          for (; fi < fl; fi++) {\n            if (\n              file[fi] === '.' ||\n              file[fi] === '..' ||\n              (!options.dot && file[fi].charAt(0) === '.')\n            )\n              return false\n          }\n          return true\n        }\n\n        // ok, let's see if we can swallow whatever we can.\n        while (fr < fl) {\n          var swallowee = file[fr]\n\n          this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n          // XXX remove this slice.  Just pass the start index.\n          if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n            this.debug('globstar found match!', fr, fl, swallowee)\n            // found a match.\n            return true\n          } else {\n            // can't swallow \".\" or \"..\" ever.\n            // can only swallow \".foo\" when explicitly asked.\n            if (\n              swallowee === '.' ||\n              swallowee === '..' ||\n              (!options.dot && swallowee.charAt(0) === '.')\n            ) {\n              this.debug('dot detected!', file, fr, pattern, pr)\n              break\n            }\n\n            // ** swallows a segment, and continue.\n            this.debug('globstar swallow a segment, and continue')\n            fr++\n          }\n        }\n\n        // no match was found.\n        // However, in partial mode, we can't say this is necessarily over.\n        /* c8 ignore start */\n        if (partial) {\n          // ran out of file\n          this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n          if (fr === fl) {\n            return true\n          }\n        }\n        /* c8 ignore stop */\n        return false\n      }\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { fileURLToPath } from 'node:url'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignored` and `childrenIgnored`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n\n  /**\n   * Do not match any children of any matches. For example, the pattern\n   * `**\\/foo` would match `a/foo`, but not `a/foo/b/foo` in this mode.\n   *\n   * This is especially useful for cases like \"find all `node_modules`\n   * folders, but not the ones in `node_modules`\".\n   *\n   * In order to support this, the `Ignore` implementation must support an\n   * `add(pattern: string)` method. If using the default `Ignore` class, then\n   * this is fine, but if this is set to `false`, and a custom `Ignore` is\n   * provided that does not have an `add()` method, then it will throw an\n   * error.\n   *\n   * **Caveat** It *only* ignores matches that would be a descendant of a\n   * previous match, and only if that descendant is matched *after* the\n   * ancestor is encountered. Since the file system walk happens in\n   * indeterminate order, it's possible that a match will already be added\n   * before its ancestor, if multiple or braced patterns are used.\n   *\n   * For example:\n   *\n   * ```ts\n   * const results = await glob([\n   *   // likely to match first, since it's just a stat\n   *   'a/b/c/d/e/f',\n   *\n   *   // this pattern is more complicated! It must to various readdir()\n   *   // calls and test the results against a regular expression, and that\n   *   // is certainly going to take a little bit longer.\n   *   //\n   *   // So, later on, it encounters a match at 'a/b/c/d/e', but it's too\n   *   // late to ignore a/b/c/d/e/f, because it's already been emitted.\n   *   'a/[bdf]/?/[a-z]/*',\n   * ], { includeChildMatches: false })\n   * ```\n   *\n   * It's best to only set this to `false` if you can be reasonably sure that\n   * no components of the pattern will potentially match one another's file\n   * system descendants, or if the occasional included child entry will not\n   * cause problems.\n   *\n   * @default true\n   */\n  includeChildMatches?: boolean\n\n  /**\n   * max number of `{...}` patterns to expand. Default `1_000`.\n   *\n   * Note: this is much less than minimatch's default of `100_000`,\n   * because Glob has higher memory requirements due to walking\n   * the file system tree.\n   */\n  braceExpandMax?: number\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse ? string\n  : Opts extends GlobOptionsWithFileTypesUnset ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? true\n  : Opts extends GlobOptionsWithFileTypesFalse ? false\n  : Opts extends GlobOptionsWithFileTypesUnset ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n  includeChildMatches: boolean\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n    this.includeChildMatches = opts.includeChildMatches !== false\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as { allowWindowsEscape?: boolean }).allowWindowsEscape ===\n        false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32' ? PathScurryWin32\n        : opts.platform === 'darwin' ? PathScurryDarwin\n        : opts.platform ? PathScurryPosix\n        : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      braceExpandMax: 10_000,\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      // default nocase based on platform\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []],\n    )\n    this.patterns = matchSet.map((set, i) => {\n      const g = globParts[i]\n      /* c8 ignore start */\n      if (!g) throw new Error('invalid pattern object')\n      /* c8 ignore stop */\n      return new Pattern(set, g, 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n", "/**\n * @module LRUCache\n */\n\n// module-private names and types\n// this provides the default Perf object source.\n// it can be passed in via configuration to override it\n// for a single LRU object.\nexport type Perf = { now: () => number }\nconst defaultPerf: Perf =\n  (\n    typeof performance === 'object' &&\n    performance &&\n    typeof performance.now === 'function'\n  ) ?\n    performance\n  : Date\n\nconst warned = new Set<string>()\n\n// either a function or a class\ntype ForC = ((...a: any[]) => any) | { new (...a: any[]): any }\n\n/* c8 ignore start */\nconst PROCESS = (\n  typeof process === 'object' && !!process ?\n    process\n  : {}) as { [k: string]: any }\n/* c8 ignore start */\n\nconst emitWarning = (\n  msg: string,\n  type: string,\n  code: string,\n  fn: ForC,\n) => {\n  typeof PROCESS.emitWarning === 'function' ?\n    PROCESS.emitWarning(msg, type, code, fn)\n  : console.error(`[${code}] ${type}: ${msg}`)\n}\n\nlet AC = globalThis.AbortController\nlet AS = globalThis.AbortSignal\n\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n  //@ts-ignore\n  AS = class AbortSignal {\n    onabort?: (...a: any[]) => any\n    _onabort: ((...a: any[]) => any)[] = []\n    reason?: any\n    aborted: boolean = false\n    addEventListener(_: string, fn: (...a: any[]) => any) {\n      this._onabort.push(fn)\n    }\n  }\n  //@ts-ignore\n  AC = class AbortController {\n    constructor() {\n      warnACPolyfill()\n    }\n    signal = new AS()\n    abort(reason: any) {\n      if (this.signal.aborted) return\n      //@ts-ignore\n      this.signal.reason = reason\n      //@ts-ignore\n      this.signal.aborted = true\n      //@ts-ignore\n      for (const fn of this.signal._onabort) {\n        fn(reason)\n      }\n      this.signal.onabort?.(reason)\n    }\n  }\n  let printACPolyfillWarning =\n    PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1'\n  const warnACPolyfill = () => {\n    if (!printACPolyfillWarning) return\n    printACPolyfillWarning = false\n    emitWarning(\n      'AbortController is not defined. If using lru-cache in ' +\n        'node 14, load an AbortController polyfill from the ' +\n        '`node-abort-controller` package. A minimal polyfill is ' +\n        'provided for use by LRUCache.fetch(), but it should not be ' +\n        'relied upon in other contexts (eg, passing it to other APIs that ' +\n        'use AbortController/AbortSignal might have undesirable effects). ' +\n        'You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.',\n      'NO_ABORT_CONTROLLER',\n      'ENOTSUP',\n      warnACPolyfill,\n    )\n  }\n}\n/* c8 ignore stop */\n\nconst shouldWarn = (code: string) => !warned.has(code)\n\nconst TYPE = Symbol('type')\nexport type PosInt = number & { [TYPE]: 'Positive Integer' }\nexport type Index = number & { [TYPE]: 'LRUCache Index' }\n\nconst isPosInt = (n: any): n is PosInt =>\n  n && n === Math.floor(n) && n > 0 && isFinite(n)\n\nexport type UintArray = Uint8Array | Uint16Array | Uint32Array\nexport type NumberArray = UintArray | number[]\n\n/* c8 ignore start */\n// This is a little bit ridiculous, tbh.\n// The maximum array length is 2^32-1 or thereabouts on most JS impls.\n// And well before that point, you're caching the entire world, I mean,\n// that's ~32GB of just integers for the next/prev links, plus whatever\n// else to hold that many keys and values.  Just filling the memory with\n// zeroes at init time is brutal when you get that big.\n// But why not be complete?\n// Maybe in the future, these limits will have expanded.\nconst getUintArray = (max: number) =>\n  !isPosInt(max) ? null\n  : max <= Math.pow(2, 8) ? Uint8Array\n  : max <= Math.pow(2, 16) ? Uint16Array\n  : max <= Math.pow(2, 32) ? Uint32Array\n  : max <= Number.MAX_SAFE_INTEGER ? ZeroArray\n  : null\n/* c8 ignore stop */\n\nclass ZeroArray extends Array<number> {\n  constructor(size: number) {\n    super(size)\n    this.fill(0)\n  }\n}\nexport type { ZeroArray }\nexport type { Stack }\n\nexport type StackLike = Stack | Index[]\nclass Stack {\n  heap: NumberArray\n  length: number\n  // private constructor\n  static #constructing: boolean = false\n  static create(max: number): StackLike {\n    const HeapCls = getUintArray(max)\n    if (!HeapCls) return []\n    Stack.#constructing = true\n    const s = new Stack(max, HeapCls)\n    Stack.#constructing = false\n    return s\n  }\n  constructor(max: number, HeapCls: { new (n: number): NumberArray }) {\n    /* c8 ignore start */\n    if (!Stack.#constructing) {\n      throw new TypeError('instantiate Stack using Stack.create(n)')\n    }\n    /* c8 ignore stop */\n    this.heap = new HeapCls(max)\n    this.length = 0\n  }\n  push(n: Index) {\n    this.heap[this.length++] = n\n  }\n  pop(): Index {\n    return this.heap[--this.length] as Index\n  }\n}\n\n/**\n * Promise representing an in-progress {@link LRUCache#fetch} call\n */\nexport type BackgroundFetch<V> = Promise<V | undefined> & {\n  __returned: BackgroundFetch<V> | undefined\n  __abortController: AbortController\n  __staleWhileFetching: V | undefined\n}\n\nexport type DisposeTask<K, V> = [\n  value: V,\n  key: K,\n  reason: LRUCache.DisposeReason,\n]\n\nexport namespace LRUCache {\n  /**\n   * An integer greater than 0, reflecting the calculated size of items\n   */\n  export type Size = number\n\n  /**\n   * Integer greater than 0, representing some number of milliseconds, or the\n   * time at which a TTL started counting from.\n   */\n  export type Milliseconds = number\n\n  /**\n   * An integer greater than 0, reflecting a number of items\n   */\n  export type Count = number\n\n  /**\n   * The reason why an item was removed from the cache, passed\n   * to the {@link Disposer} methods.\n   *\n   * - `evict`: The item was evicted because it is the least recently used,\n   *   and the cache is full.\n   * - `set`: A new value was set, overwriting the old value being disposed.\n   * - `delete`: The item was explicitly deleted, either by calling\n   *   {@link LRUCache#delete}, {@link LRUCache#clear}, or\n   *   {@link LRUCache#set} with an undefined value.\n   * - `expire`: The item was removed due to exceeding its TTL.\n   * - `fetch`: A {@link OptionsBase#fetchMethod} operation returned\n   *   `undefined` or was aborted, causing the item to be deleted.\n   */\n  export type DisposeReason =\n    | 'evict'\n    | 'set'\n    | 'delete'\n    | 'expire'\n    | 'fetch'\n  /**\n   * A method called upon item removal, passed as the\n   * {@link OptionsBase.dispose} and/or\n   * {@link OptionsBase.disposeAfter} options.\n   */\n  export type Disposer<K, V> = (\n    value: V,\n    key: K,\n    reason: DisposeReason,\n  ) => void\n\n  /**\n   * The reason why an item was added to the cache, passed\n   * to the {@link Inserter} methods.\n   *\n   * - `add`: the item was not found in the cache, and was added\n   * - `update`: the item was in the cache, with the same value provided\n   * - `replace`: the item was in the cache, and replaced\n   */\n  export type InsertReason = 'add' | 'update' | 'replace'\n\n  /**\n   * A method called upon item insertion, passed as the\n   * {@link OptionsBase.insert}\n   */\n  export type Inserter<K, V> = (\n    value: V,\n    key: K,\n    reason: InsertReason,\n  ) => void\n\n  /**\n   * A function that returns the effective calculated size\n   * of an entry in the cache.\n   */\n  export type SizeCalculator<K, V> = (value: V, key: K) => Size\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.fetchMethod} function.\n   */\n  export interface FetcherOptions<K, V, FC = unknown> {\n    signal: AbortSignal\n    options: FetcherFetchOptions<K, V, FC>\n    /**\n     * Object provided in the {@link FetchOptions.context} option to\n     * {@link LRUCache#fetch}\n     */\n    context: FC\n  }\n\n  /**\n   * Occasionally, it may be useful to track the internal behavior of the\n   * cache, particularly for logging, debugging, or for behavior within the\n   * `fetchMethod`. To do this, you can pass a `status` object to the\n   * {@link LRUCache#fetch}, {@link LRUCache#get}, {@link LRUCache#set},\n   * {@link LRUCache#memo}, and {@link LRUCache#has} methods.\n   *\n   * The `status` option should be a plain JavaScript object. The following\n   * fields will be set on it appropriately, depending on the situation.\n   */\n  export interface Status<V> {\n    /**\n     * The status of a set() operation.\n     *\n     * - add: the item was not found in the cache, and was added\n     * - update: the item was in the cache, with the same value provided\n     * - replace: the item was in the cache, and replaced\n     * - miss: the item was not added to the cache for some reason\n     */\n    set?: 'add' | 'update' | 'replace' | 'miss'\n\n    /**\n     * the ttl stored for the item, or undefined if ttls are not used.\n     */\n    ttl?: Milliseconds\n\n    /**\n     * the start time for the item, or undefined if ttls are not used.\n     */\n    start?: Milliseconds\n\n    /**\n     * The timestamp used for TTL calculation\n     */\n    now?: Milliseconds\n\n    /**\n     * the remaining ttl for the item, or undefined if ttls are not used.\n     */\n    remainingTTL?: Milliseconds\n\n    /**\n     * The calculated size for the item, if sizes are used.\n     */\n    entrySize?: Size\n\n    /**\n     * The total calculated size of the cache, if sizes are used.\n     */\n    totalCalculatedSize?: Size\n\n    /**\n     * A flag indicating that the item was not stored, due to exceeding the\n     * {@link OptionsBase.maxEntrySize}\n     */\n    maxEntrySizeExceeded?: true\n\n    /**\n     * The old value, specified in the case of `set:'update'` or\n     * `set:'replace'`\n     */\n    oldValue?: V\n\n    /**\n     * The results of a {@link LRUCache#has} operation\n     *\n     * - hit: the item was found in the cache\n     * - stale: the item was found in the cache, but is stale\n     * - miss: the item was not found in the cache\n     */\n    has?: 'hit' | 'stale' | 'miss'\n\n    /**\n     * The status of a {@link LRUCache#fetch} operation.\n     * Note that this can change as the underlying fetch() moves through\n     * various states.\n     *\n     * - inflight: there is another fetch() for this key which is in process\n     * - get: there is no {@link OptionsBase.fetchMethod}, so\n     *   {@link LRUCache#get} was called.\n     * - miss: the item is not in cache, and will be fetched.\n     * - hit: the item is in the cache, and was resolved immediately.\n     * - stale: the item is in the cache, but stale.\n     * - refresh: the item is in the cache, and not stale, but\n     *   {@link FetchOptions.forceRefresh} was specified.\n     */\n    fetch?: 'get' | 'inflight' | 'miss' | 'hit' | 'stale' | 'refresh'\n\n    /**\n     * The {@link OptionsBase.fetchMethod} was called\n     */\n    fetchDispatched?: true\n\n    /**\n     * The cached value was updated after a successful call to\n     * {@link OptionsBase.fetchMethod}\n     */\n    fetchUpdated?: true\n\n    /**\n     * The reason for a fetch() rejection.  Either the error raised by the\n     * {@link OptionsBase.fetchMethod}, or the reason for an\n     * AbortSignal.\n     */\n    fetchError?: Error\n\n    /**\n     * The fetch received an abort signal\n     */\n    fetchAborted?: true\n\n    /**\n     * The abort signal received was ignored, and the fetch was allowed to\n     * continue.\n     */\n    fetchAbortIgnored?: true\n\n    /**\n     * The fetchMethod promise resolved successfully\n     */\n    fetchResolved?: true\n\n    /**\n     * The fetchMethod promise was rejected\n     */\n    fetchRejected?: true\n\n    /**\n     * The status of a {@link LRUCache#get} operation.\n     *\n     * - fetching: The item is currently being fetched.  If a previous value\n     *   is present and allowed, that will be returned.\n     * - stale: The item is in the cache, and is stale.\n     * - hit: the item is in the cache\n     * - miss: the item is not in the cache\n     */\n    get?: 'stale' | 'hit' | 'miss'\n\n    /**\n     * A fetch or get operation returned a stale value.\n     */\n    returnedStale?: true\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#fetch}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link OptionsBase.noDeleteOnFetchRejection},\n   * {@link OptionsBase.allowStaleOnFetchRejection},\n   * {@link FetchOptions.forceRefresh}, and\n   * {@link FetcherOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.fetchMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the fetchMethod is called.\n   */\n  export interface FetcherFetchOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    status?: Status<V>\n    size?: Size\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#fetch} method.\n   */\n  export interface FetchOptions<K, V, FC>\n    extends FetcherFetchOptions<K, V, FC> {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.fetchMethod} as\n     * the {@link FetcherOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    signal?: AbortSignal\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface FetchOptionsWithContext<K, V, FC>\n    extends FetchOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface FetchOptionsNoContext<K, V>\n    extends FetchOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  export interface MemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.memoMethod} as\n     * the {@link MemoizerOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface MemoOptionsWithContext<K, V, FC>\n    extends MemoOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface MemoOptionsNoContext<K, V>\n    extends MemoOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.memoMethod} function.\n   */\n  export interface MemoizerOptions<K, V, FC = unknown> {\n    options: MemoizerMemoOptions<K, V, FC>\n    /**\n     * Object provided in the {@link MemoOptions.context} option to\n     * {@link LRUCache#memo}\n     */\n    context: FC\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#memo}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link MemoOptions.forceRefresh}, and\n   * {@link MemoOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.memoMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the memoMethod is called.\n   */\n  export interface MemoizerMemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n    > {\n    status?: Status<V>\n    size?: Size\n    start?: Milliseconds\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#has} method.\n   */\n  export interface HasOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'updateAgeOnHas'> {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#get} method.\n   */\n  export interface GetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'allowStale' | 'updateAgeOnGet' | 'noDeleteOnStaleGet'\n    > {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#peek} method.\n   */\n  export interface PeekOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'allowStale'> {}\n\n  /**\n   * Options that may be passed to the {@link LRUCache#set} method.\n   */\n  export interface SetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'sizeCalculation' | 'ttl' | 'noDisposeOnSet' | 'noUpdateTTL'\n    > {\n    /**\n     * If size tracking is enabled, then setting an explicit size\n     * in the {@link LRUCache#set} call will prevent calling the\n     * {@link OptionsBase.sizeCalculation} function.\n     */\n    size?: Size\n    /**\n     * If TTL tracking is enabled, then setting an explicit start\n     * time in the {@link LRUCache#set} call will override the\n     * default time from `performance.now()` or `Date.now()`.\n     *\n     * Note that it must be a valid value for whichever time-tracking\n     * method is in use.\n     */\n    start?: Milliseconds\n    status?: Status<V>\n  }\n\n  /**\n   * The type signature for the {@link OptionsBase.fetchMethod} option.\n   */\n  export type Fetcher<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: FetcherOptions<K, V, FC>,\n  ) => Promise<V | undefined | void> | V | undefined | void\n\n  /**\n   * the type signature for the {@link OptionsBase.memoMethod} option.\n   */\n  export type Memoizer<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: MemoizerOptions<K, V, FC>,\n  ) => V\n\n  /**\n   * Options which may be passed to the {@link LRUCache} constructor.\n   *\n   * Most of these may be overridden in the various options that use\n   * them.\n   *\n   * Despite all being technically optional, the constructor requires that\n   * a cache is at minimum limited by one or more of {@link OptionsBase.max},\n   * {@link OptionsBase.ttl}, or {@link OptionsBase.maxSize}.\n   *\n   * If {@link OptionsBase.ttl} is used alone, then it is strongly advised\n   * (and in fact required by the type definitions here) that the cache\n   * also set {@link OptionsBase.ttlAutopurge}, to prevent potentially\n   * unbounded storage.\n   *\n   * All options are also available on the {@link LRUCache} instance, making\n   * it safe to pass an LRUCache instance as the options argumemnt to\n   * make another empty cache of the same type.\n   *\n   * Some options are marked as read-only, because changing them after\n   * instantiation is not safe. Changing any of the other options will of\n   * course only have an effect on subsequent method calls.\n   */\n  export interface OptionsBase<K, V, FC> {\n    /**\n     * The maximum number of items to store in the cache before evicting\n     * old entries. This is read-only on the {@link LRUCache} instance,\n     * and may not be overridden.\n     *\n     * If set, then storage space will be pre-allocated at construction\n     * time, and the cache will perform significantly faster.\n     *\n     * Note that significantly fewer items may be stored, if\n     * {@link OptionsBase.maxSize} and/or {@link OptionsBase.ttl} are also\n     * set.\n     *\n     * **It is strongly recommended to set a `max` to prevent unbounded growth\n     * of the cache.**\n     */\n    max?: Count\n\n    /**\n     * Max time in milliseconds for items to live in cache before they are\n     * considered stale.  Note that stale items are NOT preemptively removed by\n     * default, and MAY live in the cache, contributing to its LRU max, long\n     * after they have expired, unless {@link OptionsBase.ttlAutopurge} is\n     * set.\n     *\n     * If set to `0` (the default value), then that means \"do not track\n     * TTL\", not \"expire immediately\".\n     *\n     * Also, as this cache is optimized for LRU/MRU operations, some of\n     * the staleness/TTL checks will reduce performance, as they will incur\n     * overhead by deleting items.\n     *\n     * This is not primarily a TTL cache, and does not make strong TTL\n     * guarantees. There is no pre-emptive pruning of expired items, but you\n     * _may_ set a TTL on the cache, and it will treat expired items as missing\n     * when they are fetched, and delete them.\n     *\n     * Optional, but must be a non-negative integer in ms if specified.\n     *\n     * This may be overridden by passing an options object to `cache.set()`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if ttl tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * If ttl tracking is enabled, and `max` and `maxSize` are not set,\n     * and `ttlAutopurge` is not set, then a warning will be emitted\n     * cautioning about the potential for unbounded memory consumption.\n     * (The TypeScript definitions will also discourage this.)\n     */\n    ttl?: Milliseconds\n\n    /**\n     * Minimum amount of time in ms in which to check for staleness.\n     * Defaults to 1, which means that the current time is checked\n     * at most once per millisecond.\n     *\n     * Set to 0 to check the current time every time staleness is tested.\n     * (This reduces performance, and is theoretically unnecessary.)\n     *\n     * Setting this to a higher value will improve performance somewhat\n     * while using ttl tracking, albeit at the expense of keeping stale\n     * items around a bit longer than their TTLs would indicate.\n     *\n     * @default 1\n     */\n    ttlResolution?: Milliseconds\n\n    /**\n     * Preemptively remove stale items from the cache.\n     *\n     * Note that this may *significantly* degrade performance, especially if\n     * the cache is storing a large number of items. It is almost always best\n     * to just leave the stale items in the cache, and let them fall out as new\n     * items are added.\n     *\n     * Note that this means that {@link OptionsBase.allowStale} is a bit\n     * pointless, as stale items will be deleted almost as soon as they\n     * expire.\n     *\n     * Use with caution!\n     */\n    ttlAutopurge?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever it is retrieved from cache with\n     * {@link LRUCache#get}, causing it to not expire. (It can still fall out\n     * of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     */\n    updateAgeOnGet?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever its presence in the cache is\n     * checked with {@link LRUCache#has}, causing it to not expire. (It can\n     * still fall out of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     */\n    updateAgeOnHas?: boolean\n\n    /**\n     * Allow {@link LRUCache#get} and {@link LRUCache#fetch} calls to return\n     * stale data, if available.\n     *\n     * By default, if you set `ttl`, stale items will only be deleted from the\n     * cache when you `get(key)`. That is, it's not preemptively pruning items,\n     * unless {@link OptionsBase.ttlAutopurge} is set.\n     *\n     * If you set `allowStale:true`, it'll return the stale value *as well as*\n     * deleting it. If you don't set this, then it'll return `undefined` when\n     * you try to get a stale entry.\n     *\n     * Note that when a stale entry is fetched, _even if it is returned due to\n     * `allowStale` being set_, it is removed from the cache immediately. You\n     * can suppress this behavior by setting\n     * {@link OptionsBase.noDeleteOnStaleGet}, either in the constructor, or in\n     * the options provided to {@link LRUCache#get}.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     * The `cache.has()` method will always return `false` for stale items.\n     *\n     * Only relevant if a ttl is set.\n     */\n    allowStale?: boolean\n\n    /**\n     * Function that is called on items when they are dropped from the\n     * cache, as `dispose(value, key, reason)`.\n     *\n     * This can be handy if you want to close file descriptors or do\n     * other cleanup tasks when items are no longer stored in the cache.\n     *\n     * **NOTE**: It is called _before_ the item has been fully removed\n     * from the cache, so if you want to put it right back in, you need\n     * to wait until the next tick. If you try to add it back in during\n     * the `dispose()` function call, it will break things in subtle and\n     * weird ways.\n     *\n     * Unlike several other options, this may _not_ be overridden by\n     * passing an option to `set()`, for performance reasons.\n     *\n     * The `reason` will be one of the following strings, corresponding\n     * to the reason for the item's deletion:\n     *\n     * - `evict` Item was evicted to make space for a new addition\n     * - `set` Item was overwritten by a new value\n     * - `expire` Item expired its TTL\n     * - `fetch` Item was deleted due to a failed or aborted fetch, or a\n     *   fetchMethod returning `undefined.\n     * - `delete` Item was removed by explicit `cache.delete(key)`,\n     *   `cache.clear()`, or `cache.set(key, undefined)`.\n     */\n    dispose?: Disposer<K, V>\n\n    /**\n     * Function that is called when new items are inserted into the cache,\n     * as `onInsert(value, key, reason)`.\n     *\n     * This can be useful if you need to perform actions when an item is\n     * added, such as logging or tracking insertions.\n     *\n     * Unlike some other options, this may _not_ be overridden by passing\n     * an option to `set()`, for performance and consistency reasons.\n     */\n    onInsert?: Inserter<K, V>\n\n    /**\n     * The same as {@link OptionsBase.dispose}, but called *after* the entry\n     * is completely removed and the cache is once again in a clean state.\n     *\n     * It is safe to add an item right back into the cache at this point.\n     * However, note that it is *very* easy to inadvertently create infinite\n     * recursion this way.\n     */\n    disposeAfter?: Disposer<K, V>\n\n    /**\n     * Set to true to suppress calling the\n     * {@link OptionsBase.dispose} function if the entry key is\n     * still accessible within the cache.\n     *\n     * This may be overridden by passing an options object to\n     * {@link LRUCache#set}.\n     *\n     * Only relevant if `dispose` or `disposeAfter` are set.\n     */\n    noDisposeOnSet?: boolean\n\n    /**\n     * Boolean flag to tell the cache to not update the TTL when setting a new\n     * value for an existing key (ie, when updating a value rather than\n     * inserting a new value).  Note that the TTL value is _always_ set (if\n     * provided) when adding a new entry into the cache.\n     *\n     * Has no effect if a {@link OptionsBase.ttl} is not set.\n     *\n     * May be passed as an option to {@link LRUCache#set}.\n     */\n    noUpdateTTL?: boolean\n\n    /**\n     * Set to a positive integer to track the sizes of items added to the\n     * cache, and automatically evict items in order to stay below this size.\n     * Note that this may result in fewer than `max` items being stored.\n     *\n     * Attempting to add an item to the cache whose calculated size is greater\n     * that this amount will be a no-op. The item will not be cached, and no\n     * other items will be evicted.\n     *\n     * Optional, must be a positive integer if provided.\n     *\n     * Sets `maxEntrySize` to the same value, unless a different value is\n     * provided for `maxEntrySize`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if size tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * Note also that size tracking can negatively impact performance,\n     * though for most cases, only minimally.\n     */\n    maxSize?: Size\n\n    /**\n     * The maximum allowed size for any single item in the cache.\n     *\n     * If a larger item is passed to {@link LRUCache#set} or returned by a\n     * {@link OptionsBase.fetchMethod} or {@link OptionsBase.memoMethod}, then\n     * it will not be stored in the cache.\n     *\n     * Attempting to add an item whose calculated size is greater than\n     * this amount will not cache the item or evict any old items, but\n     * WILL delete an existing value if one is already present.\n     *\n     * Optional, must be a positive integer if provided. Defaults to\n     * the value of `maxSize` if provided.\n     */\n    maxEntrySize?: Size\n\n    /**\n     * A function that returns a number indicating the item's size.\n     *\n     * Requires {@link OptionsBase.maxSize} to be set.\n     *\n     * If not provided, and {@link OptionsBase.maxSize} or\n     * {@link OptionsBase.maxEntrySize} are set, then all\n     * {@link LRUCache#set} calls **must** provide an explicit\n     * {@link SetOptions.size} or sizeCalculation param.\n     */\n    sizeCalculation?: SizeCalculator<K, V>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#fetch}\n     *\n     * ```ts\n     * fetchMethod(key, staleValue, { signal, options, context })\n     * ```\n     *\n     * If `fetchMethod` is not provided, then `cache.fetch(key)` is equivalent\n     * to `Promise.resolve(cache.get(key))`.\n     *\n     * If at any time, `signal.aborted` is set to `true`, or if the\n     * `signal.onabort` method is called, or if it emits an `'abort'` event\n     * which you can listen to with `addEventListener`, then that means that\n     * the fetch should be abandoned. This may be passed along to async\n     * functions aware of AbortController/AbortSignal behavior.\n     *\n     * The `fetchMethod` should **only** return `undefined` or a Promise\n     * resolving to `undefined` if the AbortController signaled an `abort`\n     * event. In all other cases, it should return or resolve to a value\n     * suitable for adding to the cache.\n     *\n     * The `options` object is a union of the options that may be provided to\n     * `set()` and `get()`. If they are modified, then that will result in\n     * modifying the settings to `cache.set()` when the value is resolved, and\n     * in the case of\n     * {@link OptionsBase.noDeleteOnFetchRejection} and\n     * {@link OptionsBase.allowStaleOnFetchRejection}, the handling of\n     * `fetchMethod` failures.\n     *\n     * For example, a DNS cache may update the TTL based on the value returned\n     * from a remote DNS server by changing `options.ttl` in the `fetchMethod`.\n     */\n    fetchMethod?: Fetcher<K, V, FC>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#memo}\n     */\n    memoMethod?: Memoizer<K, V, FC>\n\n    /**\n     * Set to true to suppress the deletion of stale data when a\n     * {@link OptionsBase.fetchMethod} returns a rejected promise.\n     */\n    noDeleteOnFetchRejection?: boolean\n\n    /**\n     * Do not delete stale items when they are retrieved with\n     * {@link LRUCache#get}.\n     *\n     * Note that the `get` return value will still be `undefined`\n     * unless {@link OptionsBase.allowStale} is true.\n     *\n     * When using time-expiring entries with `ttl`, by default stale\n     * items will be removed from the cache when the key is accessed\n     * with `cache.get()`.\n     *\n     * Setting this option will cause stale items to remain in the cache, until\n     * they are explicitly deleted with `cache.delete(key)`, or retrieved with\n     * `noDeleteOnStaleGet` set to `false`.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     *\n     * Only relevant if a ttl is used.\n     */\n    noDeleteOnStaleGet?: boolean\n\n    /**\n     * Set to true to allow returning stale data when a\n     * {@link OptionsBase.fetchMethod} throws an error or returns a rejected\n     * promise.\n     *\n     * This differs from using {@link OptionsBase.allowStale} in that stale\n     * data will ONLY be returned in the case that the {@link LRUCache#fetch}\n     * fails, not any other times.\n     *\n     * If a `fetchMethod` fails, and there is no stale value available, the\n     * `fetch()` will resolve to `undefined`. Ie, all `fetchMethod` errors are\n     * suppressed.\n     *\n     * Implies `noDeleteOnFetchRejection`.\n     *\n     * This may be set in calls to `fetch()`, or defaulted on the constructor,\n     * or overridden by modifying the options object in the `fetchMethod`.\n     */\n    allowStaleOnFetchRejection?: boolean\n\n    /**\n     * Set to true to return a stale value from the cache when the\n     * `AbortSignal` passed to the {@link OptionsBase.fetchMethod} dispatches\n     * an `'abort'` event, whether user-triggered, or due to internal cache\n     * behavior.\n     *\n     * Unless {@link OptionsBase.ignoreFetchAbort} is also set, the underlying\n     * {@link OptionsBase.fetchMethod} will still be considered canceled, and\n     * any value it returns will be ignored and not cached.\n     *\n     * Caveat: since fetches are aborted when a new value is explicitly\n     * set in the cache, this can lead to fetch returning a stale value,\n     * since that was the fallback value _at the moment the `fetch()` was\n     * initiated_, even though the new updated value is now present in\n     * the cache.\n     *\n     * For example:\n     *\n     * ```ts\n     * const cache = new LRUCache<string, any>({\n     *   ttl: 100,\n     *   fetchMethod: async (url, oldValue, { signal }) =>  {\n     *     const res = await fetch(url, { signal })\n     *     return await res.json()\n     *   }\n     * })\n     * cache.set('https://example.com/', { some: 'data' })\n     * // 100ms go by...\n     * const result = cache.fetch('https://example.com/')\n     * cache.set('https://example.com/', { other: 'thing' })\n     * console.log(await result) // { some: 'data' }\n     * console.log(cache.get('https://example.com/')) // { other: 'thing' }\n     * ```\n     */\n    allowStaleOnFetchAbort?: boolean\n\n    /**\n     * Set to true to ignore the `abort` event emitted by the `AbortSignal`\n     * object passed to {@link OptionsBase.fetchMethod}, and still cache the\n     * resulting resolution value, as long as it is not `undefined`.\n     *\n     * When used on its own, this means aborted {@link LRUCache#fetch} calls\n     * are not immediately resolved or rejected when they are aborted, and\n     * instead take the full time to await.\n     *\n     * When used with {@link OptionsBase.allowStaleOnFetchAbort}, aborted\n     * {@link LRUCache#fetch} calls will resolve immediately to their stale\n     * cached value or `undefined`, and will continue to process and eventually\n     * update the cache when they resolve, as long as the resulting value is\n     * not `undefined`, thus supporting a \"return stale on timeout while\n     * refreshing\" mechanism by passing `AbortSignal.timeout(n)` as the signal.\n     *\n     * For example:\n     *\n     * ```ts\n     * const c = new LRUCache({\n     *   ttl: 100,\n     *   ignoreFetchAbort: true,\n     *   allowStaleOnFetchAbort: true,\n     *   fetchMethod: async (key, oldValue, { signal }) => {\n     *     // note: do NOT pass the signal to fetch()!\n     *     // let's say this fetch can take a long time.\n     *     const res = await fetch(`https://slow-backend-server/${key}`)\n     *     return await res.json()\n     *   },\n     * })\n     *\n     * // this will return the stale value after 100ms, while still\n     * // updating in the background for next time.\n     * const val = await c.fetch('key', { signal: AbortSignal.timeout(100) })\n     * ```\n     *\n     * **Note**: regardless of this setting, an `abort` event _is still\n     * emitted on the `AbortSignal` object_, so may result in invalid results\n     * when passed to other underlying APIs that use AbortSignals.\n     *\n     * This may be overridden in the {@link OptionsBase.fetchMethod} or the\n     * call to {@link LRUCache#fetch}.\n     */\n    ignoreFetchAbort?: boolean\n\n    /**\n     * In some cases, you may want to swap out the performance/Date object\n     * used for TTL tracking. This should almost certainly NOT be done in\n     * production environments!\n     *\n     * This value defaults to `global.performance` if it has a `now()` method,\n     * or the `global.Date` object otherwise.\n     */\n    perf?: Perf\n  }\n\n  export interface OptionsMaxLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    max: Count\n  }\n  export interface OptionsTTLLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    ttl: Milliseconds\n    ttlAutopurge: boolean\n  }\n  export interface OptionsSizeLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    maxSize: Size\n  }\n\n  /**\n   * The valid safe options for the {@link LRUCache} constructor\n   */\n  export type Options<K, V, FC> =\n    | OptionsMaxLimit<K, V, FC>\n    | OptionsSizeLimit<K, V, FC>\n    | OptionsTTLLimit<K, V, FC>\n\n  /**\n   * Entry objects used by {@link LRUCache#load} and {@link LRUCache#dump},\n   * and returned by {@link LRUCache#info}.\n   */\n  export interface Entry<V> {\n    value: V\n    ttl?: Milliseconds\n    size?: Size\n    start?: Milliseconds\n  }\n}\n\n/**\n * Default export, the thing you're using this module to get.\n *\n * The `K` and `V` types define the key and value types, respectively. The\n * optional `FC` type defines the type of the `context` object passed to\n * `cache.fetch()` and `cache.memo()`.\n *\n * Keys and values **must not** be `null` or `undefined`.\n *\n * All properties from the options object (with the exception of `max`,\n * `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are\n * added as normal public members. (The listed options are read-only getters.)\n *\n * Changing any of these will alter the defaults for subsequent method calls.\n */\nexport class LRUCache<K extends {}, V extends {}, FC = unknown> {\n  // options that cannot be changed without disaster\n  readonly #max: LRUCache.Count\n  readonly #maxSize: LRUCache.Size\n  readonly #dispose?: LRUCache.Disposer<K, V>\n  readonly #onInsert?: LRUCache.Inserter<K, V>\n  readonly #disposeAfter?: LRUCache.Disposer<K, V>\n  readonly #fetchMethod?: LRUCache.Fetcher<K, V, FC>\n  readonly #memoMethod?: LRUCache.Memoizer<K, V, FC>\n  readonly #perf: Perf\n\n  /**\n   * {@link LRUCache.OptionsBase.perf}\n   */\n  get perf() {\n    return this.#perf\n  }\n\n  /**\n   * {@link LRUCache.OptionsBase.ttl}\n   */\n  ttl: LRUCache.Milliseconds\n\n  /**\n   * {@link LRUCache.OptionsBase.ttlResolution}\n   */\n  ttlResolution: LRUCache.Milliseconds\n  /**\n   * {@link LRUCache.OptionsBase.ttlAutopurge}\n   */\n  ttlAutopurge: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnGet}\n   */\n  updateAgeOnGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnHas}\n   */\n  updateAgeOnHas: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStale}\n   */\n  allowStale: boolean\n\n  /**\n   * {@link LRUCache.OptionsBase.noDisposeOnSet}\n   */\n  noDisposeOnSet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noUpdateTTL}\n   */\n  noUpdateTTL: boolean\n  /**\n   * {@link LRUCache.OptionsBase.maxEntrySize}\n   */\n  maxEntrySize: LRUCache.Size\n  /**\n   * {@link LRUCache.OptionsBase.sizeCalculation}\n   */\n  sizeCalculation?: LRUCache.SizeCalculator<K, V>\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n   */\n  noDeleteOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n   */\n  noDeleteOnStaleGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n   */\n  allowStaleOnFetchAbort: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n   */\n  allowStaleOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n   */\n  ignoreFetchAbort: boolean\n\n  // computed properties\n  #size: LRUCache.Count\n  #calculatedSize: LRUCache.Size\n  #keyMap: Map<K, Index>\n  #keyList: (K | undefined)[]\n  #valList: (V | BackgroundFetch<V> | undefined)[]\n  #next: NumberArray\n  #prev: NumberArray\n  #head: Index\n  #tail: Index\n  #free: StackLike\n  #disposed?: DisposeTask<K, V>[]\n  #sizes?: ZeroArray\n  #starts?: ZeroArray\n  #ttls?: ZeroArray\n  #autopurgeTimers?: (undefined | ReturnType<typeof setTimeout>)[]\n\n  #hasDispose: boolean\n  #hasFetchMethod: boolean\n  #hasDisposeAfter: boolean\n  #hasOnInsert: boolean\n\n  /**\n   * Do not call this method unless you need to inspect the\n   * inner workings of the cache.  If anything returned by this\n   * object is modified in any way, strange breakage may occur.\n   *\n   * These fields are private for a reason!\n   *\n   * @internal\n   */\n  static unsafeExposeInternals<\n    K extends {},\n    V extends {},\n    FC extends unknown = unknown,\n  >(c: LRUCache<K, V, FC>) {\n    return {\n      // properties\n      starts: c.#starts,\n      ttls: c.#ttls,\n      autopurgeTimers: c.#autopurgeTimers,\n      sizes: c.#sizes,\n      keyMap: c.#keyMap as Map<K, number>,\n      keyList: c.#keyList,\n      valList: c.#valList,\n      next: c.#next,\n      prev: c.#prev,\n      get head() {\n        return c.#head\n      },\n      get tail() {\n        return c.#tail\n      },\n      free: c.#free,\n      // methods\n      isBackgroundFetch: (p: any) => c.#isBackgroundFetch(p),\n      backgroundFetch: (\n        k: K,\n        index: number | undefined,\n        options: LRUCache.FetchOptions<K, V, FC>,\n        context: any,\n      ): BackgroundFetch<V> =>\n        c.#backgroundFetch(\n          k,\n          index as Index | undefined,\n          options,\n          context,\n        ),\n      moveToTail: (index: number): void => c.#moveToTail(index as Index),\n      indexes: (options?: { allowStale: boolean }) => c.#indexes(options),\n      rindexes: (options?: { allowStale: boolean }) =>\n        c.#rindexes(options),\n      isStale: (index: number | undefined) => c.#isStale(index as Index),\n    }\n  }\n\n  // Protected read-only members\n\n  /**\n   * {@link LRUCache.OptionsBase.max} (read-only)\n   */\n  get max(): LRUCache.Count {\n    return this.#max\n  }\n  /**\n   * {@link LRUCache.OptionsBase.maxSize} (read-only)\n   */\n  get maxSize(): LRUCache.Count {\n    return this.#maxSize\n  }\n  /**\n   * The total computed size of items in the cache (read-only)\n   */\n  get calculatedSize(): LRUCache.Size {\n    return this.#calculatedSize\n  }\n  /**\n   * The number of items stored in the cache (read-only)\n   */\n  get size(): LRUCache.Count {\n    return this.#size\n  }\n  /**\n   * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n   */\n  get fetchMethod(): LRUCache.Fetcher<K, V, FC> | undefined {\n    return this.#fetchMethod\n  }\n  get memoMethod(): LRUCache.Memoizer<K, V, FC> | undefined {\n    return this.#memoMethod\n  }\n  /**\n   * {@link LRUCache.OptionsBase.dispose} (read-only)\n   */\n  get dispose() {\n    return this.#dispose\n  }\n  /**\n   * {@link LRUCache.OptionsBase.onInsert} (read-only)\n   */\n  get onInsert() {\n    return this.#onInsert\n  }\n  /**\n   * {@link LRUCache.OptionsBase.disposeAfter} (read-only)\n   */\n  get disposeAfter() {\n    return this.#disposeAfter\n  }\n\n  constructor(options: LRUCache.Options<K, V, FC> | LRUCache<K, V, FC>) {\n    const {\n      max = 0,\n      ttl,\n      ttlResolution = 1,\n      ttlAutopurge,\n      updateAgeOnGet,\n      updateAgeOnHas,\n      allowStale,\n      dispose,\n      onInsert,\n      disposeAfter,\n      noDisposeOnSet,\n      noUpdateTTL,\n      maxSize = 0,\n      maxEntrySize = 0,\n      sizeCalculation,\n      fetchMethod,\n      memoMethod,\n      noDeleteOnFetchRejection,\n      noDeleteOnStaleGet,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      perf,\n    } = options\n\n    if (perf !== undefined) {\n      if (typeof perf?.now !== 'function') {\n        throw new TypeError(\n          'perf option must have a now() method if specified',\n        )\n      }\n    }\n\n    this.#perf = perf ?? defaultPerf\n\n    if (max !== 0 && !isPosInt(max)) {\n      throw new TypeError('max option must be a nonnegative integer')\n    }\n\n    const UintArray = max ? getUintArray(max) : Array\n    if (!UintArray) {\n      throw new Error('invalid max value: ' + max)\n    }\n\n    this.#max = max\n    this.#maxSize = maxSize\n    this.maxEntrySize = maxEntrySize || this.#maxSize\n    this.sizeCalculation = sizeCalculation\n    if (this.sizeCalculation) {\n      if (!this.#maxSize && !this.maxEntrySize) {\n        throw new TypeError(\n          'cannot set sizeCalculation without setting maxSize or maxEntrySize',\n        )\n      }\n      if (typeof this.sizeCalculation !== 'function') {\n        throw new TypeError('sizeCalculation set to non-function')\n      }\n    }\n\n    if (memoMethod !== undefined && typeof memoMethod !== 'function') {\n      throw new TypeError('memoMethod must be a function if defined')\n    }\n    this.#memoMethod = memoMethod\n\n    if (fetchMethod !== undefined && typeof fetchMethod !== 'function') {\n      throw new TypeError('fetchMethod must be a function if specified')\n    }\n    this.#fetchMethod = fetchMethod\n    this.#hasFetchMethod = !!fetchMethod\n\n    this.#keyMap = new Map()\n    this.#keyList = new Array(max).fill(undefined)\n    this.#valList = new Array(max).fill(undefined)\n    this.#next = new UintArray(max)\n    this.#prev = new UintArray(max)\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free = Stack.create(max)\n    this.#size = 0\n    this.#calculatedSize = 0\n\n    if (typeof dispose === 'function') {\n      this.#dispose = dispose\n    }\n    if (typeof onInsert === 'function') {\n      this.#onInsert = onInsert\n    }\n    if (typeof disposeAfter === 'function') {\n      this.#disposeAfter = disposeAfter\n      this.#disposed = []\n    } else {\n      this.#disposeAfter = undefined\n      this.#disposed = undefined\n    }\n    this.#hasDispose = !!this.#dispose\n    this.#hasOnInsert = !!this.#onInsert\n    this.#hasDisposeAfter = !!this.#disposeAfter\n\n    this.noDisposeOnSet = !!noDisposeOnSet\n    this.noUpdateTTL = !!noUpdateTTL\n    this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection\n    this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection\n    this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort\n    this.ignoreFetchAbort = !!ignoreFetchAbort\n\n    // NB: maxEntrySize is set to maxSize if it's set\n    if (this.maxEntrySize !== 0) {\n      if (this.#maxSize !== 0) {\n        if (!isPosInt(this.#maxSize)) {\n          throw new TypeError(\n            'maxSize must be a positive integer if specified',\n          )\n        }\n      }\n      if (!isPosInt(this.maxEntrySize)) {\n        throw new TypeError(\n          'maxEntrySize must be a positive integer if specified',\n        )\n      }\n      this.#initializeSizeTracking()\n    }\n\n    this.allowStale = !!allowStale\n    this.noDeleteOnStaleGet = !!noDeleteOnStaleGet\n    this.updateAgeOnGet = !!updateAgeOnGet\n    this.updateAgeOnHas = !!updateAgeOnHas\n    this.ttlResolution =\n      isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1\n    this.ttlAutopurge = !!ttlAutopurge\n    this.ttl = ttl || 0\n    if (this.ttl) {\n      if (!isPosInt(this.ttl)) {\n        throw new TypeError('ttl must be a positive integer if specified')\n      }\n      this.#initializeTTLTracking()\n    }\n\n    // do not allow completely unbounded caches\n    if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n      throw new TypeError(\n        'At least one of max, maxSize, or ttl is required',\n      )\n    }\n    if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {\n      const code = 'LRU_CACHE_UNBOUNDED'\n      if (shouldWarn(code)) {\n        warned.add(code)\n        const msg =\n          'TTL caching without ttlAutopurge, max, or maxSize can ' +\n          'result in unbounded memory consumption.'\n        emitWarning(msg, 'UnboundedCacheWarning', code, LRUCache)\n      }\n    }\n  }\n\n  /**\n   * Return the number of ms left in the item's TTL. If item is not in cache,\n   * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.\n   */\n  getRemainingTTL(key: K) {\n    return this.#keyMap.has(key) ? Infinity : 0\n  }\n\n  #initializeTTLTracking() {\n    const ttls = new ZeroArray(this.#max)\n    const starts = new ZeroArray(this.#max)\n    this.#ttls = ttls\n    this.#starts = starts\n    const purgeTimers =\n      this.ttlAutopurge ?\n        new Array<undefined | ReturnType<typeof setTimeout>>(this.#max)\n      : undefined\n    this.#autopurgeTimers = purgeTimers\n\n    this.#setItemTTL = (index, ttl, start = this.#perf.now()) => {\n      starts[index] = ttl !== 0 ? start : 0\n      ttls[index] = ttl\n      // clear out the purge timer if we're setting TTL to 0, and\n      // previously had a ttl purge timer running, so it doesn't\n      // fire unnecessarily.\n      if (purgeTimers?.[index]) {\n        clearTimeout(purgeTimers[index])\n        purgeTimers[index] = undefined\n      }\n      if (ttl !== 0 && purgeTimers) {\n        const t = setTimeout(() => {\n          if (this.#isStale(index)) {\n            this.#delete(this.#keyList[index] as K, 'expire')\n          }\n        }, ttl + 1)\n        // unref() not supported on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n        purgeTimers[index] = t\n      }\n    }\n\n    this.#updateItemAge = index => {\n      starts[index] = ttls[index] !== 0 ? this.#perf.now() : 0\n    }\n\n    this.#statusTTL = (status, index) => {\n      if (ttls[index]) {\n        const ttl = ttls[index]\n        const start = starts[index]\n        /* c8 ignore next */\n        if (!ttl || !start) return\n        status.ttl = ttl\n        status.start = start\n        status.now = cachedNow || getNow()\n        const age = status.now - start\n        status.remainingTTL = ttl - age\n      }\n    }\n\n    // debounce calls to perf.now() to 1s so we're not hitting\n    // that costly call repeatedly.\n    let cachedNow = 0\n    const getNow = () => {\n      const n = this.#perf.now()\n      if (this.ttlResolution > 0) {\n        cachedNow = n\n        const t = setTimeout(() => (cachedNow = 0), this.ttlResolution)\n        // not available on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n      }\n      return n\n    }\n\n    this.getRemainingTTL = key => {\n      const index = this.#keyMap.get(key)\n      if (index === undefined) {\n        return 0\n      }\n      const ttl = ttls[index]\n      const start = starts[index]\n      if (!ttl || !start) {\n        return Infinity\n      }\n      const age = (cachedNow || getNow()) - start\n      return ttl - age\n    }\n\n    this.#isStale = index => {\n      const s = starts[index]\n      const t = ttls[index]\n      return !!t && !!s && (cachedNow || getNow()) - s > t\n    }\n  }\n\n  // conditionally set private methods related to TTL\n  #updateItemAge: (index: Index) => void = () => {}\n  #statusTTL: (status: LRUCache.Status<V>, index: Index) => void = () => {}\n  #setItemTTL: (\n    index: Index,\n    ttl: LRUCache.Milliseconds,\n    start?: LRUCache.Milliseconds,\n    // ignore because we never call this if we're not already in TTL mode\n    /* c8 ignore start */\n  ) => void = () => {}\n  /* c8 ignore stop */\n\n  #isStale: (index: Index) => boolean = () => false\n\n  #initializeSizeTracking() {\n    const sizes = new ZeroArray(this.#max)\n    this.#calculatedSize = 0\n    this.#sizes = sizes\n    this.#removeItemSize = index => {\n      this.#calculatedSize -= sizes[index] as number\n      sizes[index] = 0\n    }\n    this.#requireSize = (k, v, size, sizeCalculation) => {\n      // provisionally accept background fetches.\n      // actual value size will be checked when they return.\n      if (this.#isBackgroundFetch(v)) {\n        return 0\n      }\n      if (!isPosInt(size)) {\n        if (sizeCalculation) {\n          if (typeof sizeCalculation !== 'function') {\n            throw new TypeError('sizeCalculation must be a function')\n          }\n          size = sizeCalculation(v, k)\n          if (!isPosInt(size)) {\n            throw new TypeError(\n              'sizeCalculation return invalid (expect positive integer)',\n            )\n          }\n        } else {\n          throw new TypeError(\n            'invalid size value (must be positive integer). ' +\n              'When maxSize or maxEntrySize is used, sizeCalculation ' +\n              'or size must be set.',\n          )\n        }\n      }\n      return size\n    }\n    this.#addItemSize = (\n      index: Index,\n      size: LRUCache.Size,\n      status?: LRUCache.Status<V>,\n    ) => {\n      sizes[index] = size\n      if (this.#maxSize) {\n        const maxSize = this.#maxSize - (sizes[index] as number)\n        while (this.#calculatedSize > maxSize) {\n          this.#evict(true)\n        }\n      }\n      this.#calculatedSize += sizes[index] as number\n      if (status) {\n        status.entrySize = size\n        status.totalCalculatedSize = this.#calculatedSize\n      }\n    }\n  }\n\n  #removeItemSize: (index: Index) => void = _i => {}\n  #addItemSize: (\n    index: Index,\n    size: LRUCache.Size,\n    status?: LRUCache.Status<V>,\n  ) => void = (_i, _s, _st) => {}\n  #requireSize: (\n    k: K,\n    v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => LRUCache.Size = (\n    _k: K,\n    _v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => {\n    if (size || sizeCalculation) {\n      throw new TypeError(\n        'cannot set size without setting maxSize or maxEntrySize on cache',\n      )\n    }\n    return 0\n  };\n\n  *#indexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#tail; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#head) {\n          break\n        } else {\n          i = this.#prev[i] as Index\n        }\n      }\n    }\n  }\n\n  *#rindexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#head; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#tail) {\n          break\n        } else {\n          i = this.#next[i] as Index\n        }\n      }\n    }\n  }\n\n  #isValidIndex(index: Index) {\n    return (\n      index !== undefined &&\n      this.#keyMap.get(this.#keyList[index] as K) === index\n    )\n  }\n\n  /**\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from most recently used to least recently used.\n   */\n  *entries() {\n    for (const i of this.#indexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]] as [K, V]\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.entries}\n   *\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from least recently used to most recently used.\n   */\n  *rentries() {\n    for (const i of this.#rindexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]]\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the keys in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *keys() {\n    for (const i of this.#indexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.keys}\n   *\n   * Return a generator yielding the keys in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rkeys() {\n    for (const i of this.#rindexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the values in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *values() {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i] as V\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.values}\n   *\n   * Return a generator yielding the values in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rvalues() {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i]\n      }\n    }\n  }\n\n  /**\n   * Iterating over the cache itself yields the same results as\n   * {@link LRUCache.entries}\n   */\n  [Symbol.iterator]() {\n    return this.entries()\n  }\n\n  /**\n   * A String value that is used in the creation of the default string\n   * description of an object. Called by the built-in method\n   * `Object.prototype.toString`.\n   */\n  [Symbol.toStringTag] = 'LRUCache'\n\n  /**\n   * Find a value for which the supplied fn method returns a truthy value,\n   * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.\n   */\n  find(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => boolean,\n    getOptions: LRUCache.GetOptions<K, V, FC> = {},\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      if (fn(value, this.#keyList[i] as K, this)) {\n        return this.get(this.#keyList[i] as K, getOptions)\n      }\n    }\n  }\n\n  /**\n   * Call the supplied function on each item in the cache, in order from most\n   * recently used to least recently used.\n   *\n   * `fn` is called as `fn(value, key, cache)`.\n   *\n   * If `thisp` is provided, function will be called in the `this`-context of\n   * the provided object, or the cache if no `thisp` object is provided.\n   *\n   * Does not update age or recenty of use, or iterate over stale values.\n   */\n  forEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * The same as {@link LRUCache.forEach} but items are iterated over in\n   * reverse order.  (ie, less recently used items are iterated over first.)\n   */\n  rforEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * Delete any stale entries. Returns true if anything was removed,\n   * false otherwise.\n   */\n  purgeStale() {\n    let deleted = false\n    for (const i of this.#rindexes({ allowStale: true })) {\n      if (this.#isStale(i)) {\n        this.#delete(this.#keyList[i] as K, 'expire')\n        deleted = true\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Get the extended info about a given entry, to get its value, size, and\n   * TTL info simultaneously. Returns `undefined` if the key is not present.\n   *\n   * Unlike {@link LRUCache#dump}, which is designed to be portable and survive\n   * serialization, the `start` value is always the current timestamp, and the\n   * `ttl` is a calculated remaining time to live (negative if expired).\n   *\n   * Always returns stale values, if their info is found in the cache, so be\n   * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})\n   * if relevant.\n   */\n  info(key: K): LRUCache.Entry<V> | undefined {\n    const i = this.#keyMap.get(key)\n    if (i === undefined) return undefined\n    const v = this.#valList[i]\n    /* c8 ignore start - this isn't tested for the info function,\n     * but it's the same logic as found in other places. */\n    const value: V | undefined =\n      this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n    if (value === undefined) return undefined\n    /* c8 ignore end */\n    const entry: LRUCache.Entry<V> = { value }\n    if (this.#ttls && this.#starts) {\n      const ttl = this.#ttls[i]\n      const start = this.#starts[i]\n      if (ttl && start) {\n        const remain = ttl - (this.#perf.now() - start)\n        entry.ttl = remain\n        entry.start = Date.now()\n      }\n    }\n    if (this.#sizes) {\n      entry.size = this.#sizes[i]\n    }\n    return entry\n  }\n\n  /**\n   * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n   * passed to {@link LRUCache#load}.\n   *\n   * The `start` fields are calculated relative to a portable `Date.now()`\n   * timestamp, even if `performance.now()` is available.\n   *\n   * Stale entries are always included in the `dump`, even if\n   * {@link LRUCache.OptionsBase.allowStale} is false.\n   *\n   * Note: this returns an actual array, not a generator, so it can be more\n   * easily passed around.\n   */\n  dump() {\n    const arr: [K, LRUCache.Entry<V>][] = []\n    for (const i of this.#indexes({ allowStale: true })) {\n      const key = this.#keyList[i]\n      const v = this.#valList[i]\n      const value: V | undefined =\n        this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined || key === undefined) continue\n      const entry: LRUCache.Entry<V> = { value }\n      if (this.#ttls && this.#starts) {\n        entry.ttl = this.#ttls[i]\n        // always dump the start relative to a portable timestamp\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = this.#perf.now() - (this.#starts[i] as number)\n        entry.start = Math.floor(Date.now() - age)\n      }\n      if (this.#sizes) {\n        entry.size = this.#sizes[i]\n      }\n      arr.unshift([key, entry])\n    }\n    return arr\n  }\n\n  /**\n   * Reset the cache and load in the items in entries in the order listed.\n   *\n   * The shape of the resulting cache may be different if the same options are\n   * not used in both caches.\n   *\n   * The `start` fields are assumed to be calculated relative to a portable\n   * `Date.now()` timestamp, even if `performance.now()` is available.\n   */\n  load(arr: [K, LRUCache.Entry<V>][]) {\n    this.clear()\n    for (const [key, entry] of arr) {\n      if (entry.start) {\n        // entry.start is a portable timestamp, but we may be using\n        // node's performance.now(), so calculate the offset, so that\n        // we get the intended remaining TTL, no matter how long it's\n        // been on ice.\n        //\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = Date.now() - entry.start\n        entry.start = this.#perf.now() - age\n      }\n      this.set(key, entry.value, entry)\n    }\n  }\n\n  /**\n   * Add a value to the cache.\n   *\n   * Note: if `undefined` is specified as a value, this is an alias for\n   * {@link LRUCache#delete}\n   *\n   * Fields on the {@link LRUCache.SetOptions} options param will override\n   * their corresponding values in the constructor options for the scope\n   * of this single `set()` operation.\n   *\n   * If `start` is provided, then that will set the effective start\n   * time for the TTL calculation. Note that this must be a previous\n   * value of `performance.now()` if supported, or a previous value of\n   * `Date.now()` if not.\n   *\n   * Options object may also include `size`, which will prevent\n   * calling the `sizeCalculation` function and just use the specified\n   * number if it is a positive integer, and `noDisposeOnSet` which\n   * will prevent calling a `dispose` function in the case of\n   * overwrites.\n   *\n   * If the `size` (or return value of `sizeCalculation`) for a given\n   * entry is greater than `maxEntrySize`, then the item will not be\n   * added to the cache.\n   *\n   * Will update the recency of the entry.\n   *\n   * If the value is `undefined`, then this is an alias for\n   * `cache.delete(key)`. `undefined` is never stored in the cache.\n   */\n  set(\n    k: K,\n    v: V | BackgroundFetch<V> | undefined,\n    setOptions: LRUCache.SetOptions<K, V, FC> = {},\n  ) {\n    if (v === undefined) {\n      this.delete(k)\n      return this\n    }\n    const {\n      ttl = this.ttl,\n      start,\n      noDisposeOnSet = this.noDisposeOnSet,\n      sizeCalculation = this.sizeCalculation,\n      status,\n    } = setOptions\n    let { noUpdateTTL = this.noUpdateTTL } = setOptions\n\n    const size = this.#requireSize(\n      k,\n      v,\n      setOptions.size || 0,\n      sizeCalculation,\n    )\n    // if the item doesn't fit, don't do anything\n    // NB: maxEntrySize set to maxSize by default\n    if (this.maxEntrySize && size > this.maxEntrySize) {\n      if (status) {\n        status.set = 'miss'\n        status.maxEntrySizeExceeded = true\n      }\n      // have to delete, in case something is there already.\n      this.#delete(k, 'set')\n      return this\n    }\n    let index = this.#size === 0 ? undefined : this.#keyMap.get(k)\n    if (index === undefined) {\n      // addition\n      index = (\n        this.#size === 0 ? this.#tail\n        : this.#free.length !== 0 ? this.#free.pop()\n        : this.#size === this.#max ? this.#evict(false)\n        : this.#size) as Index\n      this.#keyList[index] = k\n      this.#valList[index] = v\n      this.#keyMap.set(k, index)\n      this.#next[this.#tail] = index\n      this.#prev[index] = this.#tail\n      this.#tail = index\n      this.#size++\n      this.#addItemSize(index, size, status)\n      if (status) status.set = 'add'\n      noUpdateTTL = false\n      if (this.#hasOnInsert) {\n        this.#onInsert?.(v as V, k, 'add')\n      }\n    } else {\n      // update\n      this.#moveToTail(index)\n      const oldVal = this.#valList[index] as V | BackgroundFetch<V>\n      if (v !== oldVal) {\n        if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {\n          oldVal.__abortController.abort(new Error('replaced'))\n          const { __staleWhileFetching: s } = oldVal\n          if (s !== undefined && !noDisposeOnSet) {\n            if (this.#hasDispose) {\n              this.#dispose?.(s as V, k, 'set')\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([s as V, k, 'set'])\n            }\n          }\n        } else if (!noDisposeOnSet) {\n          if (this.#hasDispose) {\n            this.#dispose?.(oldVal as V, k, 'set')\n          }\n          if (this.#hasDisposeAfter) {\n            this.#disposed?.push([oldVal as V, k, 'set'])\n          }\n        }\n        this.#removeItemSize(index)\n        this.#addItemSize(index, size, status)\n        this.#valList[index] = v\n        if (status) {\n          status.set = 'replace'\n          const oldValue =\n            oldVal && this.#isBackgroundFetch(oldVal) ?\n              oldVal.__staleWhileFetching\n            : oldVal\n          if (oldValue !== undefined) status.oldValue = oldValue\n        }\n      } else if (status) {\n        status.set = 'update'\n      }\n\n      if (this.#hasOnInsert) {\n        this.onInsert?.(v as V, k, v === oldVal ? 'update' : 'replace')\n      }\n    }\n    if (ttl !== 0 && !this.#ttls) {\n      this.#initializeTTLTracking()\n    }\n    if (this.#ttls) {\n      if (!noUpdateTTL) {\n        this.#setItemTTL(index, ttl, start)\n      }\n      if (status) this.#statusTTL(status, index)\n    }\n    if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return this\n  }\n\n  /**\n   * Evict the least recently used item, returning its value or\n   * `undefined` if cache is empty.\n   */\n  pop(): V | undefined {\n    try {\n      while (this.#size) {\n        const val = this.#valList[this.#head]\n        this.#evict(true)\n        if (this.#isBackgroundFetch(val)) {\n          if (val.__staleWhileFetching) {\n            return val.__staleWhileFetching\n          }\n        } else if (val !== undefined) {\n          return val\n        }\n      }\n    } finally {\n      if (this.#hasDisposeAfter && this.#disposed) {\n        const dt = this.#disposed\n        let task: DisposeTask<K, V> | undefined\n        while ((task = dt?.shift())) {\n          this.#disposeAfter?.(...task)\n        }\n      }\n    }\n  }\n\n  #evict(free: boolean) {\n    const head = this.#head\n    const k = this.#keyList[head] as K\n    const v = this.#valList[head] as V\n    if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n      v.__abortController.abort(new Error('evicted'))\n    } else if (this.#hasDispose || this.#hasDisposeAfter) {\n      if (this.#hasDispose) {\n        this.#dispose?.(v, k, 'evict')\n      }\n      if (this.#hasDisposeAfter) {\n        this.#disposed?.push([v, k, 'evict'])\n      }\n    }\n    this.#removeItemSize(head)\n    if (this.#autopurgeTimers?.[head]) {\n      clearTimeout(this.#autopurgeTimers[head])\n      this.#autopurgeTimers[head] = undefined\n    }\n    // if we aren't about to use the index, then null these out\n    if (free) {\n      this.#keyList[head] = undefined\n      this.#valList[head] = undefined\n      this.#free.push(head)\n    }\n    if (this.#size === 1) {\n      this.#head = this.#tail = 0 as Index\n      this.#free.length = 0\n    } else {\n      this.#head = this.#next[head] as Index\n    }\n    this.#keyMap.delete(k)\n    this.#size--\n    return head\n  }\n\n  /**\n   * Check if a key is in the cache, without updating the recency of use.\n   * Will return false if the item is stale, even though it is technically\n   * in the cache.\n   *\n   * Check if a key is in the cache, without updating the recency of\n   * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set\n   * to `true` in either the options or the constructor.\n   *\n   * Will return `false` if the item is stale, even though it is technically in\n   * the cache. The difference can be determined (if it matters) by using a\n   * `status` argument, and inspecting the `has` field.\n   *\n   * Will not update item age unless\n   * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.\n   */\n  has(k: K, hasOptions: LRUCache.HasOptions<K, V, FC> = {}) {\n    const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const v = this.#valList[index]\n      if (\n        this.#isBackgroundFetch(v) &&\n        v.__staleWhileFetching === undefined\n      ) {\n        return false\n      }\n      if (!this.#isStale(index)) {\n        if (updateAgeOnHas) {\n          this.#updateItemAge(index)\n        }\n        if (status) {\n          status.has = 'hit'\n          this.#statusTTL(status, index)\n        }\n        return true\n      } else if (status) {\n        status.has = 'stale'\n        this.#statusTTL(status, index)\n      }\n    } else if (status) {\n      status.has = 'miss'\n    }\n    return false\n  }\n\n  /**\n   * Like {@link LRUCache#get} but doesn't update recency or delete stale\n   * items.\n   *\n   * Returns `undefined` if the item is stale, unless\n   * {@link LRUCache.OptionsBase.allowStale} is set.\n   */\n  peek(k: K, peekOptions: LRUCache.PeekOptions<K, V, FC> = {}) {\n    const { allowStale = this.allowStale } = peekOptions\n    const index = this.#keyMap.get(k)\n    if (index === undefined || (!allowStale && this.#isStale(index))) {\n      return\n    }\n    const v = this.#valList[index]\n    // either stale and allowed, or forcing a refresh of non-stale value\n    return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n  }\n\n  #backgroundFetch(\n    k: K,\n    index: Index | undefined,\n    options: LRUCache.FetchOptions<K, V, FC>,\n    context: any,\n  ): BackgroundFetch<V> {\n    const v = index === undefined ? undefined : this.#valList[index]\n    if (this.#isBackgroundFetch(v)) {\n      return v\n    }\n\n    const ac = new AC()\n    const { signal } = options\n    // when/if our AC signals, then stop listening to theirs.\n    signal?.addEventListener('abort', () => ac.abort(signal.reason), {\n      signal: ac.signal,\n    })\n\n    const fetchOpts = {\n      signal: ac.signal,\n      options,\n      context,\n    }\n\n    const cb = (v: V | undefined, updateCache = false): V | undefined => {\n      const { aborted } = ac.signal\n      const ignoreAbort = options.ignoreFetchAbort && v !== undefined\n      const proceed = options.ignoreFetchAbort ||\n        !!(options.allowStaleOnFetchAbort && v !== undefined)\n      if (options.status) {\n        if (aborted && !updateCache) {\n          options.status.fetchAborted = true\n          options.status.fetchError = ac.signal.reason\n          if (ignoreAbort) options.status.fetchAbortIgnored = true\n        } else {\n          options.status.fetchResolved = true\n        }\n      }\n      if (aborted && !ignoreAbort && !updateCache) {\n        return fetchFail(ac.signal.reason, proceed)\n      }\n      // either we didn't abort, and are still here, or we did, and ignored\n      const bf = p as BackgroundFetch<V>\n      // if nothing else has been written there but we're set to update the\n      // cache and ignore the abort, or if it's still pending on this specific\n      // background request, then write it to the cache.\n      const vl = this.#valList[index as Index]\n      if (vl === p || (ignoreAbort && updateCache && vl === undefined)) {\n        if (v === undefined) {\n          if (bf.__staleWhileFetching !== undefined) {\n            this.#valList[index as Index] = bf.__staleWhileFetching\n          } else {\n            this.#delete(k, 'fetch')\n          }\n        } else {\n          if (options.status) options.status.fetchUpdated = true\n          this.set(k, v, fetchOpts.options)\n        }\n      }\n      return v\n    }\n\n    const eb = (er: any) => {\n      if (options.status) {\n        options.status.fetchRejected = true\n        options.status.fetchError = er\n      }\n      // do not pass go, do not collect $200\n      return fetchFail(er, false)\n    }\n\n    const fetchFail = (er: any, proceed: boolean): V | undefined => {\n      const { aborted } = ac.signal\n      const allowStaleAborted = aborted && options.allowStaleOnFetchAbort\n      const allowStale =\n        allowStaleAborted || options.allowStaleOnFetchRejection\n      const noDelete = allowStale || options.noDeleteOnFetchRejection\n      const bf = p as BackgroundFetch<V>\n      if (this.#valList[index as Index] === p) {\n        // if we allow stale on fetch rejections, then we need to ensure that\n        // the stale value is not removed from the cache when the fetch fails.\n        const del = !noDelete ||\n          !proceed && bf.__staleWhileFetching === undefined\n        if (del) {\n          this.#delete(k, 'fetch')\n        } else if (!allowStaleAborted) {\n          // still replace the *promise* with the stale value,\n          // since we are done with the promise at this point.\n          // leave it untouched if we're still waiting for an\n          // aborted background fetch that hasn't yet returned.\n          this.#valList[index as Index] = bf.__staleWhileFetching\n        }\n      }\n      if (allowStale) {\n        if (options.status && bf.__staleWhileFetching !== undefined) {\n          options.status.returnedStale = true\n        }\n        return bf.__staleWhileFetching\n      } else if (bf.__returned === bf) {\n        throw er\n      }\n    }\n\n    const pcall = (\n      res: (v: V | undefined) => void,\n      rej: (e: any) => void,\n    ) => {\n      const fmp = this.#fetchMethod?.(k, v, fetchOpts)\n      if (fmp && fmp instanceof Promise) {\n        fmp.then(v => res(v === undefined ? undefined : v), rej)\n      }\n      // ignored, we go until we finish, regardless.\n      // defer check until we are actually aborting,\n      // so fetchMethod can override.\n      ac.signal.addEventListener('abort', () => {\n        if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {\n          res(undefined)\n          // when it eventually resolves, update the cache.\n          if (options.allowStaleOnFetchAbort) {\n            res = v => cb(v, true)\n          }\n        }\n      })\n    }\n\n    if (options.status) options.status.fetchDispatched = true\n    const p = new Promise(pcall).then(cb, eb)\n    const bf: BackgroundFetch<V> = Object.assign(p, {\n      __abortController: ac,\n      __staleWhileFetching: v,\n      __returned: undefined,\n    })\n\n    if (index === undefined) {\n      // internal, don't expose status.\n      this.set(k, bf, { ...fetchOpts.options, status: undefined })\n      index = this.#keyMap.get(k)\n    } else {\n      this.#valList[index] = bf\n    }\n    return bf\n  }\n\n  #isBackgroundFetch(p: any): p is BackgroundFetch<V> {\n    if (!this.#hasFetchMethod) return false\n    const b = p as BackgroundFetch<V>\n    return (\n      !!b &&\n      b instanceof Promise &&\n      b.hasOwnProperty('__staleWhileFetching') &&\n      b.__abortController instanceof AC\n    )\n  }\n\n  /**\n   * Make an asynchronous cached fetch using the\n   * {@link LRUCache.OptionsBase.fetchMethod} function.\n   *\n   * If the value is in the cache and not stale, then the returned\n   * Promise resolves to the value.\n   *\n   * If not in the cache, or beyond its TTL staleness, then\n   * `fetchMethod(key, staleValue, { options, signal, context })` is\n   * called, and the value returned will be added to the cache once\n   * resolved.\n   *\n   * If called with `allowStale`, and an asynchronous fetch is\n   * currently in progress to reload a stale value, then the former\n   * stale value will be returned.\n   *\n   * If called with `forceRefresh`, then the cached item will be\n   * re-fetched, even if it is not stale. However, if `allowStale` is also\n   * set, then the old value will still be returned. This is useful\n   * in cases where you want to force a reload of a cached value. If\n   * a background fetch is already in progress, then `forceRefresh`\n   * has no effect.\n   *\n   * If multiple fetches for the same key are issued, then they will all be\n   * coalesced into a single call to fetchMethod.\n   *\n   * Note that this means that handling options such as\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort},\n   * {@link LRUCache.FetchOptions.signal},\n   * and {@link LRUCache.OptionsBase.allowStaleOnFetchRejection} will be\n   * determined by the FIRST fetch() call for a given key.\n   *\n   * This is a known (fixable) shortcoming which will be addresed on when\n   * someone complains about it, as the fix would involve added complexity and\n   * may not be worth the costs for this edge case.\n   *\n   * If {@link LRUCache.OptionsBase.fetchMethod} is not specified, then this is\n   * effectively an alias for `Promise.resolve(cache.get(key))`.\n   *\n   * When the fetch method resolves to a value, if the fetch has not\n   * been aborted due to deletion, eviction, or being overwritten,\n   * then it is added to the cache using the options provided.\n   *\n   * If the key is evicted or deleted before the `fetchMethod`\n   * resolves, then the AbortSignal passed to the `fetchMethod` will\n   * receive an `abort` event, and the promise returned by `fetch()`\n   * will reject with the reason for the abort.\n   *\n   * If a `signal` is passed to the `fetch()` call, then aborting the\n   * signal will abort the fetch and cause the `fetch()` promise to\n   * reject with the reason provided.\n   *\n   * **Setting `context`**\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the {@link LRUCache} constructor, then all\n   * calls to `cache.fetch()` _must_ provide a `context` option. If\n   * set to `undefined` or `void`, then calls to fetch _must not_\n   * provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that\n   * might be relevant in the course of fetching the data. It is only\n   * relevant for the course of a single `fetch()` operation, and\n   * discarded afterwards.\n   *\n   * **Note: `fetch()` calls are inflight-unique**\n   *\n   * If you call `fetch()` multiple times with the same key value,\n   * then every call after the first will resolve on the same\n   * promise<sup>1</sup>,\n   * _even if they have different settings that would otherwise change\n   * the behavior of the fetch_, such as `noDeleteOnFetchRejection`\n   * or `ignoreFetchAbort`.\n   *\n   * In most cases, this is not a problem (in fact, only fetching\n   * something once is what you probably want, if you're caching in\n   * the first place). If you are changing the fetch() options\n   * dramatically between runs, there's a good chance that you might\n   * be trying to fit divergent semantics into a single object, and\n   * would be better off with multiple cache instances.\n   *\n   * **1**: Ie, they're not the \"same Promise\", but they resolve at\n   * the same time, because they're both waiting on the same\n   * underlying fetchMethod response.\n   */\n\n  fetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<undefined | V>\n\n  // this overload not allowed if context is required\n  fetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<undefined | V>\n\n  async fetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<undefined | V> {\n    const {\n      // get options\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      // set options\n      ttl = this.ttl,\n      noDisposeOnSet = this.noDisposeOnSet,\n      size = 0,\n      sizeCalculation = this.sizeCalculation,\n      noUpdateTTL = this.noUpdateTTL,\n      // fetch exclusive options\n      noDeleteOnFetchRejection = this.noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection = this.allowStaleOnFetchRejection,\n      ignoreFetchAbort = this.ignoreFetchAbort,\n      allowStaleOnFetchAbort = this.allowStaleOnFetchAbort,\n      context,\n      forceRefresh = false,\n      status,\n      signal,\n    } = fetchOptions\n\n    if (!this.#hasFetchMethod) {\n      if (status) status.fetch = 'get'\n      return this.get(k, {\n        allowStale,\n        updateAgeOnGet,\n        noDeleteOnStaleGet,\n        status,\n      })\n    }\n\n    const options = {\n      allowStale,\n      updateAgeOnGet,\n      noDeleteOnStaleGet,\n      ttl,\n      noDisposeOnSet,\n      size,\n      sizeCalculation,\n      noUpdateTTL,\n      noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      status,\n      signal,\n    }\n\n    let index = this.#keyMap.get(k)\n    if (index === undefined) {\n      if (status) status.fetch = 'miss'\n      const p = this.#backgroundFetch(k, index, options, context)\n      return (p.__returned = p)\n    } else {\n      // in cache, maybe already fetching\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        const stale = allowStale && v.__staleWhileFetching !== undefined\n        if (status) {\n          status.fetch = 'inflight'\n          if (stale) status.returnedStale = true\n        }\n        return stale ? v.__staleWhileFetching : (v.__returned = v)\n      }\n\n      // if we force a refresh, that means do NOT serve the cached value,\n      // unless we are already in the process of refreshing the cache.\n      const isStale = this.#isStale(index)\n      if (!forceRefresh && !isStale) {\n        if (status) status.fetch = 'hit'\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        if (status) this.#statusTTL(status, index)\n        return v\n      }\n\n      // ok, it is stale or a forced refresh, and not already fetching.\n      // refresh the cache.\n      const p = this.#backgroundFetch(k, index, options, context)\n      const hasStale = p.__staleWhileFetching !== undefined\n      const staleVal = hasStale && allowStale\n      if (status) {\n        status.fetch = isStale ? 'stale' : 'refresh'\n        if (staleVal && isStale) status.returnedStale = true\n      }\n      return staleVal ? p.__staleWhileFetching : (p.__returned = p)\n    }\n  }\n\n  /**\n   * In some cases, `cache.fetch()` may resolve to `undefined`, either because\n   * a {@link LRUCache.OptionsBase#fetchMethod} was not provided (turning\n   * `cache.fetch(k)` into just an async wrapper around `cache.get(k)`) or\n   * because `ignoreFetchAbort` was specified (either to the constructor or\n   * in the {@link LRUCache.FetchOptions}). Also, the\n   * {@link LRUCache.OptionsBase.fetchMethod} may return `undefined` or `void`, making\n   * the test even more complicated.\n   *\n   * Because inferring the cases where `undefined` might be returned are so\n   * cumbersome, but testing for `undefined` can also be annoying, this method\n   * can be used, which will reject if `this.fetch()` resolves to undefined.\n   */\n  forceFetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<V>\n  // this overload not allowed if context is required\n  forceFetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<V>\n  async forceFetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<V> {\n    const v = await this.fetch(\n      k,\n      fetchOptions as unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n      : LRUCache.FetchOptionsWithContext<K, V, FC>,\n    )\n    if (v === undefined) throw new Error('fetch() returned undefined')\n    return v\n  }\n\n  /**\n   * If the key is found in the cache, then this is equivalent to\n   * {@link LRUCache#get}. If not, in the cache, then calculate the value using\n   * the {@link LRUCache.OptionsBase.memoMethod}, and add it to the cache.\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the LRUCache constructor, then all calls to `cache.memo()`\n   * _must_ provide a `context` option. If set to `undefined` or `void`, then\n   * calls to memo _must not_ provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that might be\n   * relevant in the course of fetching the data. It is only relevant for the\n   * course of a single `memo()` operation, and discarded afterwards.\n   */\n  memo(\n    k: K,\n    memoOptions: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : LRUCache.MemoOptionsWithContext<K, V, FC>,\n  ): V\n  // this overload not allowed if context is required\n  memo(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    memoOptions?: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : never,\n  ): V\n  memo(k: K, memoOptions: LRUCache.MemoOptions<K, V, FC> = {}) {\n    const memoMethod = this.#memoMethod\n    if (!memoMethod) {\n      throw new Error('no memoMethod provided to constructor')\n    }\n    const { context, forceRefresh, ...options } = memoOptions\n    const v = this.get(k, options)\n    if (!forceRefresh && v !== undefined) return v\n    const vv = memoMethod(k, v, {\n      options,\n      context,\n    } as LRUCache.MemoizerOptions<K, V, FC>)\n    this.set(k, vv, options)\n    return vv\n  }\n\n  /**\n   * Return a value from the cache. Will update the recency of the cache\n   * entry found.\n   *\n   * If the key is not found, get() will return `undefined`.\n   */\n  get(k: K, getOptions: LRUCache.GetOptions<K, V, FC> = {}) {\n    const {\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      status,\n    } = getOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const value = this.#valList[index]\n      const fetching = this.#isBackgroundFetch(value)\n      if (status) this.#statusTTL(status, index)\n      if (this.#isStale(index)) {\n        if (status) status.get = 'stale'\n        // delete only if not an in-flight background fetch\n        if (!fetching) {\n          if (!noDeleteOnStaleGet) {\n            this.#delete(k, 'expire')\n          }\n          if (status && allowStale) status.returnedStale = true\n          return allowStale ? value : undefined\n        } else {\n          if (\n            status &&\n            allowStale &&\n            value.__staleWhileFetching !== undefined\n          ) {\n            status.returnedStale = true\n          }\n          return allowStale ? value.__staleWhileFetching : undefined\n        }\n      } else {\n        if (status) status.get = 'hit'\n        // if we're currently fetching it, we don't actually have it yet\n        // it's not stale, which means this isn't a staleWhileRefetching.\n        // If it's not stale, and fetching, AND has a __staleWhileFetching\n        // value, then that means the user fetched with {forceRefresh:true},\n        // so it's safe to return that value.\n        if (fetching) {\n          return value.__staleWhileFetching\n        }\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        return value\n      }\n    } else if (status) {\n      status.get = 'miss'\n    }\n  }\n\n  #connect(p: Index, n: Index) {\n    this.#prev[n] = p\n    this.#next[p] = n\n  }\n\n  #moveToTail(index: Index): void {\n    // if tail already, nothing to do\n    // if head, move head to next[index]\n    // else\n    //   move next[prev[index]] to next[index] (head has no prev)\n    //   move prev[next[index]] to prev[index]\n    // prev[index] = tail\n    // next[tail] = index\n    // tail = index\n    if (index !== this.#tail) {\n      if (index === this.#head) {\n        this.#head = this.#next[index] as Index\n      } else {\n        this.#connect(\n          this.#prev[index] as Index,\n          this.#next[index] as Index,\n        )\n      }\n      this.#connect(this.#tail, index)\n      this.#tail = index\n    }\n  }\n\n  /**\n   * Deletes a key out of the cache.\n   *\n   * Returns true if the key was deleted, false otherwise.\n   */\n  delete(k: K) {\n    return this.#delete(k, 'delete')\n  }\n\n  #delete(k: K, reason: LRUCache.DisposeReason) {\n    let deleted = false\n    if (this.#size !== 0) {\n      const index = this.#keyMap.get(k)\n      if (index !== undefined) {\n        if (this.#autopurgeTimers?.[index]) {\n          clearTimeout(this.#autopurgeTimers?.[index])\n          this.#autopurgeTimers[index] = undefined\n        }\n        deleted = true\n        if (this.#size === 1) {\n          this.#clear(reason)\n        } else {\n          this.#removeItemSize(index)\n          const v = this.#valList[index]\n          if (this.#isBackgroundFetch(v)) {\n            v.__abortController.abort(new Error('deleted'))\n          } else if (this.#hasDispose || this.#hasDisposeAfter) {\n            if (this.#hasDispose) {\n              this.#dispose?.(v as V, k, reason)\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([v as V, k, reason])\n            }\n          }\n          this.#keyMap.delete(k)\n          this.#keyList[index] = undefined\n          this.#valList[index] = undefined\n          if (index === this.#tail) {\n            this.#tail = this.#prev[index] as Index\n          } else if (index === this.#head) {\n            this.#head = this.#next[index] as Index\n          } else {\n            const pi = this.#prev[index] as number\n            this.#next[pi] = this.#next[index] as number\n            const ni = this.#next[index] as number\n            this.#prev[ni] = this.#prev[index] as number\n          }\n          this.#size--\n          this.#free.push(index)\n        }\n      }\n    }\n    if (this.#hasDisposeAfter && this.#disposed?.length) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Clear the cache entirely, throwing away all values.\n   */\n  clear() {\n    return this.#clear('delete')\n  }\n  #clear(reason: LRUCache.DisposeReason) {\n    for (const index of this.#rindexes({ allowStale: true })) {\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        v.__abortController.abort(new Error('deleted'))\n      } else {\n        const k = this.#keyList[index]\n        if (this.#hasDispose) {\n          this.#dispose?.(v as V, k as K, reason)\n        }\n        if (this.#hasDisposeAfter) {\n          this.#disposed?.push([v as V, k as K, reason])\n        }\n      }\n    }\n\n    this.#keyMap.clear()\n    this.#valList.fill(undefined)\n    this.#keyList.fill(undefined)\n    if (this.#ttls && this.#starts) {\n      this.#ttls.fill(0)\n      this.#starts.fill(0)\n      for (const t of this.#autopurgeTimers ?? []) {\n        if (t !== undefined) clearTimeout(t)\n      }\n      this.#autopurgeTimers?.fill(undefined)\n    }\n    if (this.#sizes) {\n      this.#sizes.fill(0)\n    }\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free.length = 0\n    this.#calculatedSize = 0\n    this.#size = 0\n    if (this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n  }\n}\n", "import { LRUCache } from 'lru-cache'\nimport { posix, win32 } from 'node:path'\n\nimport { fileURLToPath } from 'node:url'\n\nimport {\n  lstatSync,\n  readdir as readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync as rps,\n} from 'fs'\nimport * as actualFS from 'node:fs'\n\nconst realpathSync = rps.native\n// TODO: test perf of fs/promises realpath vs realpathCB,\n// since the promises one uses realpath.native\n\nimport { lstat, readdir, readlink, realpath } from 'node:fs/promises'\n\nimport { Minipass } from 'minipass'\nimport type { Dirent, Stats } from 'node:fs'\n\n/**\n * An object that will be used to override the default `fs`\n * methods.  Any methods that are not overridden will use Node's\n * built-in implementations.\n *\n * - lstatSync\n * - readdir (callback `withFileTypes` Dirent variant, used for\n *   readdirCB and most walks)\n * - readdirSync\n * - readlinkSync\n * - realpathSync\n * - promises: Object containing the following async methods:\n *   - lstat\n *   - readdir (Dirent variant only)\n *   - readlink\n *   - realpath\n */\nexport interface FSOption {\n  lstatSync?: (path: string) => Stats\n  readdir?: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync?: (\n    path: string,\n    options: { withFileTypes: true },\n  ) => Dirent[]\n  readlinkSync?: (path: string) => string\n  realpathSync?: (path: string) => string\n  promises?: {\n    lstat?: (path: string) => Promise<Stats>\n    readdir?: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink?: (path: string) => Promise<string>\n    realpath?: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\ninterface FSValue {\n  lstatSync: (path: string) => Stats\n  readdir: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync: (path: string, options: { withFileTypes: true }) => Dirent[]\n  readlinkSync: (path: string) => string\n  realpathSync: (path: string) => string\n  promises: {\n    lstat: (path: string) => Promise<Stats>\n    readdir: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink: (path: string) => Promise<string>\n    realpath: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\nconst defaultFS: FSValue = {\n  lstatSync,\n  readdir: readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync,\n  promises: {\n    lstat,\n    readdir,\n    readlink,\n    realpath,\n  },\n}\n\n// if they just gave us require('fs') then use our default\nconst fsFromOption = (fsOption?: FSOption): FSValue =>\n  !fsOption || fsOption === defaultFS || fsOption === actualFS ?\n    defaultFS\n  : {\n      ...defaultFS,\n      ...fsOption,\n      promises: {\n        ...defaultFS.promises,\n        ...(fsOption.promises || {}),\n      },\n    }\n\n// turn something like //?/c:/ into c:\\\nconst uncDriveRegexp = /^\\\\\\\\\\?\\\\([a-z]:)\\\\?$/i\nconst uncToDrive = (rootPath: string): string =>\n  rootPath.replace(/\\//g, '\\\\').replace(uncDriveRegexp, '$1\\\\')\n\n// windows paths are separated by either / or \\\nconst eitherSep = /[\\\\\\/]/\n\nconst UNKNOWN = 0 // may not even exist, for all we know\nconst IFIFO = 0b0001\nconst IFCHR = 0b0010\nconst IFDIR = 0b0100\nconst IFBLK = 0b0110\nconst IFREG = 0b1000\nconst IFLNK = 0b1010\nconst IFSOCK = 0b1100\nconst IFMT = 0b1111\n\nexport type Type =\n  | 'Unknown'\n  | 'FIFO'\n  | 'CharacterDevice'\n  | 'Directory'\n  | 'BlockDevice'\n  | 'File'\n  | 'SymbolicLink'\n  | 'Socket'\n\n// mask to unset low 4 bits\nconst IFMT_UNKNOWN = ~IFMT\n\n// set after successfully calling readdir() and getting entries.\nconst READDIR_CALLED = 0b0000_0001_0000\n// set after a successful lstat()\nconst LSTAT_CALLED = 0b0000_0010_0000\n// set if an entry (or one of its parents) is definitely not a dir\nconst ENOTDIR = 0b0000_0100_0000\n// set if an entry (or one of its parents) does not exist\n// (can also be set on lstat errors like EACCES or ENAMETOOLONG)\nconst ENOENT = 0b0000_1000_0000\n// cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK\n// set if we fail to readlink\nconst ENOREADLINK = 0b0001_0000_0000\n// set if we know realpath() will fail\nconst ENOREALPATH = 0b0010_0000_0000\n\nconst ENOCHILD = ENOTDIR | ENOENT | ENOREALPATH\nconst TYPEMASK = 0b0011_1111_1111\n\nconst entToType = (s: Dirent | Stats) =>\n  s.isFile() ? IFREG\n  : s.isDirectory() ? IFDIR\n  : s.isSymbolicLink() ? IFLNK\n  : s.isCharacterDevice() ? IFCHR\n  : s.isBlockDevice() ? IFBLK\n  : s.isSocket() ? IFSOCK\n  : s.isFIFO() ? IFIFO\n  : UNKNOWN\n\n// normalize unicode path names\nconst normalizeCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalize = (s: string) => {\n  const c = normalizeCache.get(s)\n  if (c) return c\n  const n = s.normalize('NFKD')\n  normalizeCache.set(s, n)\n  return n\n}\n\nconst normalizeNocaseCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalizeNocase = (s: string) => {\n  const c = normalizeNocaseCache.get(s)\n  if (c) return c\n  const n = normalize(s.toLowerCase())\n  normalizeNocaseCache.set(s, n)\n  return n\n}\n\n/**\n * Options that may be provided to the Path constructor\n */\nexport interface PathOpts {\n  fullpath?: string\n  relative?: string\n  relativePosix?: string\n  parent?: PathBase\n  /**\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * An LRUCache for storing resolved path strings or Path objects.\n * @internal\n */\nexport class ResolveCache extends LRUCache<string, string> {\n  constructor() {\n    super({ max: 256 })\n  }\n}\n\n// In order to prevent blowing out the js heap by allocating hundreds of\n// thousands of Path entries when walking extremely large trees, the \"children\"\n// in this tree are represented by storing an array of Path entries in an\n// LRUCache, indexed by the parent.  At any time, Path.children() may return an\n// empty array, indicating that it doesn't know about any of its children, and\n// thus has to rebuild that cache.  This is fine, it just means that we don't\n// benefit as much from having the cached entries, but huge directory walks\n// don't blow out the stack, and smaller ones are still as fast as possible.\n//\n//It does impose some complexity when building up the readdir data, because we\n//need to pass a reference to the children array that we started with.\n\n/**\n * an LRUCache for storing child entries.\n * @internal\n */\nexport class ChildrenCache extends LRUCache<PathBase, Children> {\n  constructor(maxSize: number = 16 * 1024) {\n    super({\n      maxSize,\n      // parent + children\n      sizeCalculation: a => a.length + 1,\n    })\n  }\n}\n\n/**\n * Array of Path objects, plus a marker indicating the first provisional entry\n *\n * @internal\n */\nexport type Children = PathBase[] & { provisional: number }\n\nconst setAsCwd = Symbol('PathScurry setAsCwd')\n\n/**\n * Path objects are sort of like a super-powered\n * {@link https://nodejs.org/docs/latest/api/fs.html#class-fsdirent fs.Dirent}\n *\n * Each one represents a single filesystem entry on disk, which may or may not\n * exist. It includes methods for reading various types of information via\n * lstat, readlink, and readdir, and caches all information to the greatest\n * degree possible.\n *\n * Note that fs operations that would normally throw will instead return an\n * \"empty\" value. This is in order to prevent excessive overhead from error\n * stack traces.\n */\nexport abstract class PathBase implements Dirent {\n  /**\n   * the basename of this path\n   *\n   * **Important**: *always* test the path name against any test string\n   * usingthe {@link isNamed} method, and not by directly comparing this\n   * string. Otherwise, unicode path strings that the system sees as identical\n   * will not be properly treated as the same path, leading to incorrect\n   * behavior and possible security issues.\n   */\n  name: string\n  /**\n   * the Path entry corresponding to the path root.\n   *\n   * @internal\n   */\n  root: PathBase\n  /**\n   * All roots found within the current PathScurry family\n   *\n   * @internal\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * a reference to the parent path, or undefined in the case of root entries\n   *\n   * @internal\n   */\n  parent?: PathBase\n  /**\n   * boolean indicating whether paths are compared case-insensitively\n   * @internal\n   */\n  nocase: boolean\n\n  /**\n   * boolean indicating that this path is the current working directory\n   * of the PathScurry collection that contains it.\n   */\n  isCWD: boolean = false\n\n  /**\n   * the string or regexp used to split paths. On posix, it is `'/'`, and on\n   * windows it is a RegExp matching either `'/'` or `'\\\\'`\n   */\n  abstract splitSep: string | RegExp\n  /**\n   * The path separator string to use when joining paths\n   */\n  abstract sep: string\n\n  // potential default fs override\n  #fs: FSValue\n\n  // Stats fields\n  #dev?: number\n  get dev() {\n    return this.#dev\n  }\n  #mode?: number\n  get mode() {\n    return this.#mode\n  }\n  #nlink?: number\n  get nlink() {\n    return this.#nlink\n  }\n  #uid?: number\n  get uid() {\n    return this.#uid\n  }\n  #gid?: number\n  get gid() {\n    return this.#gid\n  }\n  #rdev?: number\n  get rdev() {\n    return this.#rdev\n  }\n  #blksize?: number\n  get blksize() {\n    return this.#blksize\n  }\n  #ino?: number\n  get ino() {\n    return this.#ino\n  }\n  #size?: number\n  get size() {\n    return this.#size\n  }\n  #blocks?: number\n  get blocks() {\n    return this.#blocks\n  }\n  #atimeMs?: number\n  get atimeMs() {\n    return this.#atimeMs\n  }\n  #mtimeMs?: number\n  get mtimeMs() {\n    return this.#mtimeMs\n  }\n  #ctimeMs?: number\n  get ctimeMs() {\n    return this.#ctimeMs\n  }\n  #birthtimeMs?: number\n  get birthtimeMs() {\n    return this.#birthtimeMs\n  }\n  #atime?: Date\n  get atime() {\n    return this.#atime\n  }\n  #mtime?: Date\n  get mtime() {\n    return this.#mtime\n  }\n  #ctime?: Date\n  get ctime() {\n    return this.#ctime\n  }\n  #birthtime?: Date\n  get birthtime() {\n    return this.#birthtime\n  }\n\n  #matchName: string\n  #depth?: number\n  #fullpath?: string\n  #fullpathPosix?: string\n  #relative?: string\n  #relativePosix?: string\n  #type: number\n  #children: ChildrenCache\n  #linkTarget?: PathBase\n  #realpath?: PathBase\n\n  /**\n   * This property is for compatibility with the Dirent class as of\n   * Node v20, where Dirent['parentPath'] refers to the path of the\n   * directory that was passed to readdir. For root entries, it's the path\n   * to the entry itself.\n   */\n  get parentPath(): string {\n    return (this.parent || this).fullpath()\n  }\n\n  /* c8 ignore start */\n  /**\n   * Deprecated alias for Dirent['parentPath'] Somewhat counterintuitively,\n   * this property refers to the *parent* path, not the path object itself.\n   *\n   * @deprecated\n   */\n  get path(): string {\n    return this.parentPath\n  }\n  /* c8 ignore stop */\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    this.name = name\n    this.#matchName = nocase ? normalizeNocase(name) : normalize(name)\n    this.#type = type & TYPEMASK\n    this.nocase = nocase\n    this.roots = roots\n    this.root = root || this\n    this.#children = children\n    this.#fullpath = opts.fullpath\n    this.#relative = opts.relative\n    this.#relativePosix = opts.relativePosix\n    this.parent = opts.parent\n    if (this.parent) {\n      this.#fs = this.parent.#fs\n    } else {\n      this.#fs = fsFromOption(opts.fs)\n    }\n  }\n\n  /**\n   * Returns the depth of the Path object from its root.\n   *\n   * For example, a path at `/foo/bar` would have a depth of 2.\n   */\n  depth(): number {\n    if (this.#depth !== undefined) return this.#depth\n    if (!this.parent) return (this.#depth = 0)\n    return (this.#depth = this.parent.depth() + 1)\n  }\n\n  /**\n   * @internal\n   */\n  abstract getRootString(path: string): string\n  /**\n   * @internal\n   */\n  abstract getRoot(rootPath: string): PathBase\n  /**\n   * @internal\n   */\n  abstract newChild(name: string, type?: number, opts?: PathOpts): PathBase\n\n  /**\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Get the Path object referenced by the string path, resolved from this Path\n   */\n  resolve(path?: string): PathBase {\n    if (!path) {\n      return this\n    }\n    const rootPath = this.getRootString(path)\n    const dir = path.substring(rootPath.length)\n    const dirParts = dir.split(this.splitSep)\n    const result: PathBase =\n      rootPath ?\n        this.getRoot(rootPath).#resolveParts(dirParts)\n      : this.#resolveParts(dirParts)\n    return result\n  }\n\n  #resolveParts(dirParts: string[]) {\n    let p: PathBase = this\n    for (const part of dirParts) {\n      p = p.child(part)\n    }\n    return p\n  }\n\n  /**\n   * Returns the cached children Path objects, if still available.  If they\n   * have fallen out of the cache, then returns an empty array, and resets the\n   * READDIR_CALLED bit, so that future calls to readdir() will require an fs\n   * lookup.\n   *\n   * @internal\n   */\n  children(): Children {\n    const cached = this.#children.get(this)\n    if (cached) {\n      return cached\n    }\n    const children: Children = Object.assign([], { provisional: 0 })\n    this.#children.set(this, children)\n    this.#type &= ~READDIR_CALLED\n    return children\n  }\n\n  /**\n   * Resolves a path portion and returns or creates the child Path.\n   *\n   * Returns `this` if pathPart is `''` or `'.'`, or `parent` if pathPart is\n   * `'..'`.\n   *\n   * This should not be called directly.  If `pathPart` contains any path\n   * separators, it will lead to unsafe undefined behavior.\n   *\n   * Use `Path.resolve()` instead.\n   *\n   * @internal\n   */\n  child(pathPart: string, opts?: PathOpts): PathBase {\n    if (pathPart === '' || pathPart === '.') {\n      return this\n    }\n    if (pathPart === '..') {\n      return this.parent || this\n    }\n\n    // find the child\n    const children = this.children()\n    const name =\n      this.nocase ? normalizeNocase(pathPart) : normalize(pathPart)\n    for (const p of children) {\n      if (p.#matchName === name) {\n        return p\n      }\n    }\n\n    // didn't find it, create provisional child, since it might not\n    // actually exist.  If we know the parent isn't a dir, then\n    // in fact it CAN'T exist.\n    const s = this.parent ? this.sep : ''\n    const fullpath =\n      this.#fullpath ? this.#fullpath + s + pathPart : undefined\n    const pchild = this.newChild(pathPart, UNKNOWN, {\n      ...opts,\n      parent: this,\n      fullpath,\n    })\n\n    if (!this.canReaddir()) {\n      pchild.#type |= ENOENT\n    }\n\n    // don't have to update provisional, because if we have real children,\n    // then provisional is set to children.length, otherwise a lower number\n    children.push(pchild)\n    return pchild\n  }\n\n  /**\n   * The relative path from the cwd. If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpath()\n   */\n  relative(): string {\n    if (this.isCWD) return ''\n    if (this.#relative !== undefined) {\n      return this.#relative\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relative = this.name)\n    }\n    const pv = p.relative()\n    return pv + (!pv || !p.parent ? '' : this.sep) + name\n  }\n\n  /**\n   * The relative path from the cwd, using / as the path separator.\n   * If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpathPosix()\n   * On posix systems, this is identical to relative().\n   */\n  relativePosix(): string {\n    if (this.sep === '/') return this.relative()\n    if (this.isCWD) return ''\n    if (this.#relativePosix !== undefined) return this.#relativePosix\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relativePosix = this.fullpathPosix())\n    }\n    const pv = p.relativePosix()\n    return pv + (!pv || !p.parent ? '' : '/') + name\n  }\n\n  /**\n   * The fully resolved path string for this Path entry\n   */\n  fullpath(): string {\n    if (this.#fullpath !== undefined) {\n      return this.#fullpath\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#fullpath = this.name)\n    }\n    const pv = p.fullpath()\n    const fp = pv + (!p.parent ? '' : this.sep) + name\n    return (this.#fullpath = fp)\n  }\n\n  /**\n   * On platforms other than windows, this is identical to fullpath.\n   *\n   * On windows, this is overridden to return the forward-slash form of the\n   * full UNC path.\n   */\n  fullpathPosix(): string {\n    if (this.#fullpathPosix !== undefined) return this.#fullpathPosix\n    if (this.sep === '/') return (this.#fullpathPosix = this.fullpath())\n    if (!this.parent) {\n      const p = this.fullpath().replace(/\\\\/g, '/')\n      if (/^[a-z]:\\//i.test(p)) {\n        return (this.#fullpathPosix = `//?/${p}`)\n      } else {\n        return (this.#fullpathPosix = p)\n      }\n    }\n    const p = this.parent\n    const pfpp = p.fullpathPosix()\n    const fpp = pfpp + (!pfpp || !p.parent ? '' : '/') + this.name\n    return (this.#fullpathPosix = fpp)\n  }\n\n  /**\n   * Is the Path of an unknown type?\n   *\n   * Note that we might know *something* about it if there has been a previous\n   * filesystem operation, for example that it does not exist, or is not a\n   * link, or whether it has child entries.\n   */\n  isUnknown(): boolean {\n    return (this.#type & IFMT) === UNKNOWN\n  }\n\n  isType(type: Type): boolean {\n    return this[`is${type}`]()\n  }\n\n  getType(): Type {\n    return (\n      this.isUnknown() ? 'Unknown'\n      : this.isDirectory() ? 'Directory'\n      : this.isFile() ? 'File'\n      : this.isSymbolicLink() ? 'SymbolicLink'\n      : this.isFIFO() ? 'FIFO'\n      : this.isCharacterDevice() ? 'CharacterDevice'\n      : this.isBlockDevice() ? 'BlockDevice'\n      : /* c8 ignore start */ this.isSocket() ? 'Socket'\n      : 'Unknown'\n    )\n    /* c8 ignore stop */\n  }\n\n  /**\n   * Is the Path a regular file?\n   */\n  isFile(): boolean {\n    return (this.#type & IFMT) === IFREG\n  }\n\n  /**\n   * Is the Path a directory?\n   */\n  isDirectory(): boolean {\n    return (this.#type & IFMT) === IFDIR\n  }\n\n  /**\n   * Is the path a character device?\n   */\n  isCharacterDevice(): boolean {\n    return (this.#type & IFMT) === IFCHR\n  }\n\n  /**\n   * Is the path a block device?\n   */\n  isBlockDevice(): boolean {\n    return (this.#type & IFMT) === IFBLK\n  }\n\n  /**\n   * Is the path a FIFO pipe?\n   */\n  isFIFO(): boolean {\n    return (this.#type & IFMT) === IFIFO\n  }\n\n  /**\n   * Is the path a socket?\n   */\n  isSocket(): boolean {\n    return (this.#type & IFMT) === IFSOCK\n  }\n\n  /**\n   * Is the path a symbolic link?\n   */\n  isSymbolicLink(): boolean {\n    return (this.#type & IFLNK) === IFLNK\n  }\n\n  /**\n   * Return the entry if it has been subject of a successful lstat, or\n   * undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* simply\n   * mean that we haven't called lstat on it.\n   */\n  lstatCached(): PathBase | undefined {\n    return this.#type & LSTAT_CALLED ? this : undefined\n  }\n\n  /**\n   * Return the cached link target if the entry has been the subject of a\n   * successful readlink, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readlink() has been called at some point.\n   */\n  readlinkCached(): PathBase | undefined {\n    return this.#linkTarget\n  }\n\n  /**\n   * Returns the cached realpath target if the entry has been the subject\n   * of a successful realpath, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * realpath() has been called at some point.\n   */\n  realpathCached(): PathBase | undefined {\n    return this.#realpath\n  }\n\n  /**\n   * Returns the cached child Path entries array if the entry has been the\n   * subject of a successful readdir(), or [] otherwise.\n   *\n   * Does not read the filesystem, so an empty array *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readdir() has been called recently enough to still be valid.\n   */\n  readdirCached(): PathBase[] {\n    const children = this.children()\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * Return true if it's worth trying to readlink.  Ie, we don't (yet) have\n   * any indication that readlink will definitely fail.\n   *\n   * Returns false if the path is known to not be a symlink, if a previous\n   * readlink failed, or if the entry does not exist.\n   */\n  canReadlink(): boolean {\n    if (this.#linkTarget) return true\n    if (!this.parent) return false\n    // cases where it cannot possibly succeed\n    const ifmt = this.#type & IFMT\n    return !(\n      (ifmt !== UNKNOWN && ifmt !== IFLNK) ||\n      this.#type & ENOREADLINK ||\n      this.#type & ENOENT\n    )\n  }\n\n  /**\n   * Return true if readdir has previously been successfully called on this\n   * path, indicating that cachedReaddir() is likely valid.\n   */\n  calledReaddir(): boolean {\n    return !!(this.#type & READDIR_CALLED)\n  }\n\n  /**\n   * Returns true if the path is known to not exist. That is, a previous lstat\n   * or readdir failed to verify its existence when that would have been\n   * expected, or a parent entry was marked either enoent or enotdir.\n   */\n  isENOENT(): boolean {\n    return !!(this.#type & ENOENT)\n  }\n\n  /**\n   * Return true if the path is a match for the given path name.  This handles\n   * case sensitivity and unicode normalization.\n   *\n   * Note: even on case-sensitive systems, it is **not** safe to test the\n   * equality of the `.name` property to determine whether a given pathname\n   * matches, due to unicode normalization mismatches.\n   *\n   * Always use this method instead of testing the `path.name` property\n   * directly.\n   */\n  isNamed(n: string): boolean {\n    return !this.nocase ?\n        this.#matchName === normalize(n)\n      : this.#matchName === normalizeNocase(n)\n  }\n\n  /**\n   * Return the Path object corresponding to the target of a symbolic link.\n   *\n   * If the Path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   */\n  async readlink(): Promise<PathBase | undefined> {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = await this.#fs.promises.readlink(this.fullpath())\n      const linkTarget = (await this.parent.realpath())?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  /**\n   * Synchronous {@link PathBase.readlink}\n   */\n  readlinkSync(): PathBase | undefined {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = this.#fs.readlinkSync(this.fullpath())\n      const linkTarget = this.parent.realpathSync()?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  #readdirSuccess(children: Children) {\n    // succeeded, mark readdir called bit\n    this.#type |= READDIR_CALLED\n    // mark all remaining provisional children as ENOENT\n    for (let p = children.provisional; p < children.length; p++) {\n      const c = children[p]\n      if (c) c.#markENOENT()\n    }\n  }\n\n  #markENOENT() {\n    // mark as UNKNOWN and ENOENT\n    if (this.#type & ENOENT) return\n    this.#type = (this.#type | ENOENT) & IFMT_UNKNOWN\n    this.#markChildrenENOENT()\n  }\n\n  #markChildrenENOENT() {\n    // all children are provisional and do not exist\n    const children = this.children()\n    children.provisional = 0\n    for (const p of children) {\n      p.#markENOENT()\n    }\n  }\n\n  #markENOREALPATH() {\n    this.#type |= ENOREALPATH\n    this.#markENOTDIR()\n  }\n\n  // save the information when we know the entry is not a dir\n  #markENOTDIR() {\n    // entry is not a directory, so any children can't exist.\n    // this *should* be impossible, since any children created\n    // after it's been marked ENOTDIR should be marked ENOENT,\n    // so it won't even get to this point.\n    /* c8 ignore start */\n    if (this.#type & ENOTDIR) return\n    /* c8 ignore stop */\n    let t = this.#type\n    // this could happen if we stat a dir, then delete it,\n    // then try to read it or one of its children.\n    if ((t & IFMT) === IFDIR) t &= IFMT_UNKNOWN\n    this.#type = t | ENOTDIR\n    this.#markChildrenENOENT()\n  }\n\n  #readdirFail(code: string = '') {\n    // markENOTDIR and markENOENT also set provisional=0\n    if (code === 'ENOTDIR' || code === 'EPERM') {\n      this.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      this.#markENOENT()\n    } else {\n      this.children().provisional = 0\n    }\n  }\n\n  #lstatFail(code: string = '') {\n    // Windows just raises ENOENT in this case, disable for win CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR') {\n      // already know it has a parent by this point\n      const p = this.parent as PathBase\n      p.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      /* c8 ignore stop */\n      this.#markENOENT()\n    }\n  }\n\n  #readlinkFail(code: string = '') {\n    let ter = this.#type\n    ter |= ENOREADLINK\n    if (code === 'ENOENT') ter |= ENOENT\n    // windows gets a weird error when you try to readlink a file\n    if (code === 'EINVAL' || code === 'UNKNOWN') {\n      // exists, but not a symlink, we don't know WHAT it is, so remove\n      // all IFMT bits.\n      ter &= IFMT_UNKNOWN\n    }\n    this.#type = ter\n    // windows just gets ENOENT in this case.  We do cover the case,\n    // just disabled because it's impossible on Windows CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR' && this.parent) {\n      this.parent.#markENOTDIR()\n    }\n    /* c8 ignore stop */\n  }\n\n  #readdirAddChild(e: Dirent, c: Children) {\n    return (\n      this.#readdirMaybePromoteChild(e, c) ||\n      this.#readdirAddNewChild(e, c)\n    )\n  }\n\n  #readdirAddNewChild(e: Dirent, c: Children): PathBase {\n    // alloc new entry at head, so it's never provisional\n    const type = entToType(e)\n    const child = this.newChild(e.name, type, { parent: this })\n    const ifmt = child.#type & IFMT\n    if (ifmt !== IFDIR && ifmt !== IFLNK && ifmt !== UNKNOWN) {\n      child.#type |= ENOTDIR\n    }\n    c.unshift(child)\n    c.provisional++\n    return child\n  }\n\n  #readdirMaybePromoteChild(e: Dirent, c: Children): PathBase | undefined {\n    for (let p = c.provisional; p < c.length; p++) {\n      const pchild = c[p]\n      const name =\n        this.nocase ? normalizeNocase(e.name) : normalize(e.name)\n      if (name !== pchild!.#matchName) {\n        continue\n      }\n\n      return this.#readdirPromoteChild(e, pchild!, p, c)\n    }\n  }\n\n  #readdirPromoteChild(\n    e: Dirent,\n    p: PathBase,\n    index: number,\n    c: Children,\n  ): PathBase {\n    const v = p.name\n    // retain any other flags, but set ifmt from dirent\n    p.#type = (p.#type & IFMT_UNKNOWN) | entToType(e)\n    // case sensitivity fixing when we learn the true name.\n    if (v !== e.name) p.name = e.name\n\n    // just advance provisional index (potentially off the list),\n    // otherwise we have to splice/pop it out and re-insert at head\n    if (index !== c.provisional) {\n      if (index === c.length - 1) c.pop()\n      else c.splice(index, 1)\n      c.unshift(p)\n    }\n    c.provisional++\n    return p\n  }\n\n  /**\n   * Call lstat() on this Path, and update all known information that can be\n   * determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(): Promise<PathBase | undefined> {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(await this.#fs.promises.lstat(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  /**\n   * synchronous {@link PathBase.lstat}\n   */\n  lstatSync(): PathBase | undefined {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(this.#fs.lstatSync(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  #applyStat(st: Stats) {\n    const {\n      atime,\n      atimeMs,\n      birthtime,\n      birthtimeMs,\n      blksize,\n      blocks,\n      ctime,\n      ctimeMs,\n      dev,\n      gid,\n      ino,\n      mode,\n      mtime,\n      mtimeMs,\n      nlink,\n      rdev,\n      size,\n      uid,\n    } = st\n    this.#atime = atime\n    this.#atimeMs = atimeMs\n    this.#birthtime = birthtime\n    this.#birthtimeMs = birthtimeMs\n    this.#blksize = blksize\n    this.#blocks = blocks\n    this.#ctime = ctime\n    this.#ctimeMs = ctimeMs\n    this.#dev = dev\n    this.#gid = gid\n    this.#ino = ino\n    this.#mode = mode\n    this.#mtime = mtime\n    this.#mtimeMs = mtimeMs\n    this.#nlink = nlink\n    this.#rdev = rdev\n    this.#size = size\n    this.#uid = uid\n    const ifmt = entToType(st)\n    // retain any other flags, but set the ifmt\n    this.#type = (this.#type & IFMT_UNKNOWN) | ifmt | LSTAT_CALLED\n    if (ifmt !== UNKNOWN && ifmt !== IFDIR && ifmt !== IFLNK) {\n      this.#type |= ENOTDIR\n    }\n  }\n\n  #onReaddirCB: ((\n    er: NodeJS.ErrnoException | null,\n    entries: Path[],\n  ) => any)[] = []\n  #readdirCBInFlight: boolean = false\n  #callOnReaddirCB(children: Path[]) {\n    this.#readdirCBInFlight = false\n    const cbs = this.#onReaddirCB.slice()\n    this.#onReaddirCB.length = 0\n    cbs.forEach(cb => cb(null, children))\n  }\n\n  /**\n   * Standard node-style callback interface to get list of directory entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * @param cb The callback called with (er, entries).  Note that the `er`\n   * param is somewhat extraneous, as all readdir() errors are handled and\n   * simply result in an empty set of entries being returned.\n   * @param allowZalgo Boolean indicating that immediately known results should\n   * *not* be deferred with `queueMicrotask`. Defaults to `false`. Release\n   * zalgo at your peril, the dark pony lord is devious and unforgiving.\n   */\n  readdirCB(\n    cb: (er: NodeJS.ErrnoException | null, entries: PathBase[]) => any,\n    allowZalgo: boolean = false,\n  ): void {\n    if (!this.canReaddir()) {\n      if (allowZalgo) cb(null, [])\n      else queueMicrotask(() => cb(null, []))\n      return\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      const c = children.slice(0, children.provisional)\n      if (allowZalgo) cb(null, c)\n      else queueMicrotask(() => cb(null, c))\n      return\n    }\n\n    // don't have to worry about zalgo at this point.\n    this.#onReaddirCB.push(cb)\n    if (this.#readdirCBInFlight) {\n      return\n    }\n    this.#readdirCBInFlight = true\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    this.#fs.readdir(fullpath, { withFileTypes: true }, (er, entries) => {\n      if (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      } else {\n        // if we didn't get an error, we always get entries.\n        //@ts-ignore\n        for (const e of entries) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      }\n      this.#callOnReaddirCB(children.slice(0, children.provisional))\n      return\n    })\n  }\n\n  #asyncReaddirInFlight?: Promise<void>\n\n  /**\n   * Return an array of known child entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async readdir(): Promise<PathBase[]> {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    if (this.#asyncReaddirInFlight) {\n      await this.#asyncReaddirInFlight\n    } else {\n      /* c8 ignore start */\n      let resolve: () => void = () => {}\n      /* c8 ignore stop */\n      this.#asyncReaddirInFlight = new Promise<void>(\n        res => (resolve = res),\n      )\n      try {\n        for (const e of await this.#fs.promises.readdir(fullpath, {\n          withFileTypes: true,\n        })) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      } catch (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      }\n      this.#asyncReaddirInFlight = undefined\n      resolve()\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * synchronous {@link PathBase.readdir}\n   */\n  readdirSync(): PathBase[] {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    try {\n      for (const e of this.#fs.readdirSync(fullpath, {\n        withFileTypes: true,\n      })) {\n        this.#readdirAddChild(e, children)\n      }\n      this.#readdirSuccess(children)\n    } catch (er) {\n      this.#readdirFail((er as NodeJS.ErrnoException).code)\n      children.provisional = 0\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  canReaddir() {\n    if (this.#type & ENOCHILD) return false\n    const ifmt = IFMT & this.#type\n    // we always set ENOTDIR when setting IFMT, so should be impossible\n    /* c8 ignore start */\n    if (!(ifmt === UNKNOWN || ifmt === IFDIR || ifmt === IFLNK)) {\n      return false\n    }\n    /* c8 ignore stop */\n    return true\n  }\n\n  shouldWalk(\n    dirs: Set<PathBase | undefined>,\n    walkFilter?: (e: PathBase) => boolean,\n  ): boolean {\n    return (\n      (this.#type & IFDIR) === IFDIR &&\n      !(this.#type & ENOCHILD) &&\n      !dirs.has(this) &&\n      (!walkFilter || walkFilter(this))\n    )\n  }\n\n  /**\n   * Return the Path object corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   * On success, returns a Path object.\n   */\n  async realpath(): Promise<PathBase | undefined> {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = await this.#fs.promises.realpath(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Synchronous {@link realpath}\n   */\n  realpathSync(): PathBase | undefined {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = this.#fs.realpathSync(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Internal method to mark this Path object as the scurry cwd,\n   * called by {@link PathScurry#chdir}\n   *\n   * @internal\n   */\n  [setAsCwd](oldCwd: PathBase): void {\n    if (oldCwd === this) return\n    oldCwd.isCWD = false\n    this.isCWD = true\n\n    const changed = new Set<PathBase>([])\n    let rp = []\n    let p: PathBase = this\n    while (p && p.parent) {\n      changed.add(p)\n      p.#relative = rp.join(this.sep)\n      p.#relativePosix = rp.join('/')\n      p = p.parent\n      rp.push('..')\n    }\n    // now un-memoize parents of old cwd\n    p = oldCwd\n    while (p && p.parent && !changed.has(p)) {\n      p.#relative = undefined\n      p.#relativePosix = undefined\n      p = p.parent\n    }\n  }\n}\n\n/**\n * Path class used on win32 systems\n *\n * Uses `'\\\\'` as the path separator for returned paths, either `'\\\\'` or `'/'`\n * as the path separator for parsing paths.\n */\nexport class PathWin32 extends PathBase {\n  /**\n   * Separator for generating path strings.\n   */\n  sep: '\\\\' = '\\\\'\n  /**\n   * Separator for parsing path strings.\n   */\n  splitSep: RegExp = eitherSep\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathWin32(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return win32.parse(path).root\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(rootPath: string): PathBase {\n    rootPath = uncToDrive(rootPath.toUpperCase())\n    if (rootPath === this.root.name) {\n      return this.root\n    }\n    // ok, not that one, check if it matches another we know about\n    for (const [compare, root] of Object.entries(this.roots)) {\n      if (this.sameRoot(rootPath, compare)) {\n        return (this.roots[rootPath] = root)\n      }\n    }\n    // otherwise, have to create a new one.\n    return (this.roots[rootPath] = new PathScurryWin32(\n      rootPath,\n      this,\n    ).root)\n  }\n\n  /**\n   * @internal\n   */\n  sameRoot(rootPath: string, compare: string = this.root.name): boolean {\n    // windows can (rarely) have case-sensitive filesystem, but\n    // UNC and drive letters are always case-insensitive, and canonically\n    // represented uppercase.\n    rootPath = rootPath\n      .toUpperCase()\n      .replace(/\\//g, '\\\\')\n      .replace(uncDriveRegexp, '$1\\\\')\n    return rootPath === compare\n  }\n}\n\n/**\n * Path class used on all posix systems.\n *\n * Uses `'/'` as the path separator.\n */\nexport class PathPosix extends PathBase {\n  /**\n   * separator for parsing path strings\n   */\n  splitSep: '/' = '/'\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return path.startsWith('/') ? '/' : ''\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(_rootPath: string): PathBase {\n    return this.root\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathPosix(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n}\n\n/**\n * Options that may be provided to the PathScurry constructor\n */\nexport interface PathScurryOpts {\n  /**\n   * perform case-insensitive path matching. Default based on platform\n   * subclass.\n   */\n  nocase?: boolean\n  /**\n   * Number of Path entries to keep in the cache of Path child references.\n   *\n   * Setting this higher than 65536 will dramatically increase the data\n   * consumption and construction time overhead of each PathScurry.\n   *\n   * Setting this value to 256 or lower will significantly reduce the data\n   * consumption and construction time overhead, but may also reduce resolve()\n   * and readdir() performance on large filesystems.\n   *\n   * Default `16384`.\n   */\n  childrenCacheSize?: number\n  /**\n   * An object that overrides the built-in functions from the fs and\n   * fs/promises modules.\n   *\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * The base class for all PathScurry classes, providing the interface for path\n * resolution and filesystem operations.\n *\n * Typically, you should *not* instantiate this class directly, but rather one\n * of the platform-specific classes, or the exported {@link PathScurry} which\n * defaults to the current platform.\n */\nexport abstract class PathScurryBase {\n  /**\n   * The root Path entry for the current working directory of this Scurry\n   */\n  root: PathBase\n  /**\n   * The string path for the root of this Scurry's current working directory\n   */\n  rootPath: string\n  /**\n   * A collection of all roots encountered, referenced by rootPath\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * The Path entry corresponding to this PathScurry's current working directory.\n   */\n  cwd: PathBase\n  #resolveCache: ResolveCache\n  #resolvePosixCache: ResolveCache\n  #children: ChildrenCache\n  /**\n   * Perform path comparisons case-insensitively.\n   *\n   * Defaults true on Darwin and Windows systems, false elsewhere.\n   */\n  nocase: boolean\n\n  /**\n   * The path separator used for parsing paths\n   *\n   * `'/'` on Posix systems, either `'/'` or `'\\\\'` on Windows\n   */\n  abstract sep: string | RegExp\n\n  #fs: FSValue\n\n  /**\n   * This class should not be instantiated directly.\n   *\n   * Use PathScurryWin32, PathScurryDarwin, PathScurryPosix, or PathScurry\n   *\n   * @internal\n   */\n  constructor(\n    cwd: URL | string = process.cwd(),\n    pathImpl: typeof win32 | typeof posix,\n    sep: string | RegExp,\n    {\n      nocase,\n      childrenCacheSize = 16 * 1024,\n      fs = defaultFS,\n    }: PathScurryOpts = {},\n  ) {\n    this.#fs = fsFromOption(fs)\n    if (cwd instanceof URL || cwd.startsWith('file://')) {\n      cwd = fileURLToPath(cwd)\n    }\n    // resolve and split root, and then add to the store.\n    // this is the only time we call path.resolve()\n    const cwdPath = pathImpl.resolve(cwd)\n    this.roots = Object.create(null)\n    this.rootPath = this.parseRootPath(cwdPath)\n    this.#resolveCache = new ResolveCache()\n    this.#resolvePosixCache = new ResolveCache()\n    this.#children = new ChildrenCache(childrenCacheSize)\n\n    const split = cwdPath.substring(this.rootPath.length).split(sep)\n    // resolve('/') leaves '', splits to [''], we don't want that.\n    if (split.length === 1 && !split[0]) {\n      split.pop()\n    }\n    /* c8 ignore start */\n    if (nocase === undefined) {\n      throw new TypeError(\n        'must provide nocase setting to PathScurryBase ctor',\n      )\n    }\n    /* c8 ignore stop */\n    this.nocase = nocase\n    this.root = this.newRoot(this.#fs)\n    this.roots[this.rootPath] = this.root\n    let prev: PathBase = this.root\n    let len = split.length - 1\n    const joinSep = pathImpl.sep\n    let abs = this.rootPath\n    let sawFirst = false\n    for (const part of split) {\n      const l = len--\n      prev = prev.child(part, {\n        relative: new Array(l).fill('..').join(joinSep),\n        relativePosix: new Array(l).fill('..').join('/'),\n        fullpath: (abs += (sawFirst ? '' : joinSep) + part),\n      })\n      sawFirst = true\n    }\n    this.cwd = prev\n  }\n\n  /**\n   * Get the depth of a provided path, string, or the cwd\n   */\n  depth(path: Path | string = this.cwd): number {\n    if (typeof path === 'string') {\n      path = this.cwd.resolve(path)\n    }\n    return path.depth()\n  }\n\n  /**\n   * Parse the root portion of a path string\n   *\n   * @internal\n   */\n  abstract parseRootPath(dir: string): string\n  /**\n   * create a new Path to use as root during construction.\n   *\n   * @internal\n   */\n  abstract newRoot(fs: FSValue): PathBase\n  /**\n   * Determine whether a given path string is absolute\n   */\n  abstract isAbsolute(p: string): boolean\n\n  /**\n   * Return the cache of child entries.  Exposed so subclasses can create\n   * child Path objects in a platform-specific way.\n   *\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolve(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolveCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpath()\n    this.#resolveCache.set(r, result)\n    return result\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string, returning\n   * the posix path.  Identical to .resolve() on posix systems, but on\n   * windows will return a forward-slash separated UNC path.\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolvePosix(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolvePosixCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpathPosix()\n    this.#resolvePosixCache.set(r, result)\n    return result\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or entry\n   */\n  relative(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relative()\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or\n   * entry, using / as the path delimiter, even on Windows.\n   */\n  relativePosix(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relativePosix()\n  }\n\n  /**\n   * Return the basename for the provided string or Path object\n   */\n  basename(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.name\n  }\n\n  /**\n   * Return the dirname for the provided string or Path object\n   */\n  dirname(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return (entry.parent || entry).fullpath()\n  }\n\n  /**\n   * Return an array of known child entries.\n   *\n   * First argument may be either a string, or a Path object.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * Unlike `fs.readdir()`, the `withFileTypes` option defaults to `true`. Set\n   * `{ withFileTypes: false }` to return strings.\n   */\n\n  readdir(): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: true }): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: false }): Promise<string[]>\n  readdir(opts: { withFileTypes: boolean }): Promise<PathBase[] | string[]>\n  readdir(entry: PathBase | string): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): Promise<string[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): Promise<PathBase[] | string[]>\n  async readdir(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else {\n      const p = await entry.readdir()\n      return withFileTypes ? p : p.map(e => e.name)\n    }\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readdir}\n   */\n  readdirSync(): PathBase[]\n  readdirSync(opts: { withFileTypes: true }): PathBase[]\n  readdirSync(opts: { withFileTypes: false }): string[]\n  readdirSync(opts: { withFileTypes: boolean }): PathBase[] | string[]\n  readdirSync(entry: PathBase | string): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): string[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): PathBase[] | string[]\n  readdirSync(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes = true } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else if (withFileTypes) {\n      return entry.readdirSync()\n    } else {\n      return entry.readdirSync().map(e => e.name)\n    }\n  }\n\n  /**\n   * Call lstat() on the string or Path object, and update all known\n   * information that can be determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(\n    entry: string | PathBase = this.cwd,\n  ): Promise<PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstat()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.lstat}\n   */\n  lstatSync(entry: string | PathBase = this.cwd): PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstatSync()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to the target of a\n   * symbolic link.\n   *\n   * If the path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  readlink(): Promise<string | undefined>\n  readlink(opt: { withFileTypes: false }): Promise<string | undefined>\n  readlink(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  readlink(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async readlink(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.readlink()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readlink}\n   */\n  readlinkSync(): string | undefined\n  readlinkSync(opt: { withFileTypes: false }): string | undefined\n  readlinkSync(opt: { withFileTypes: true }): PathBase | undefined\n  readlinkSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.readlinkSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  realpath(): Promise<string | undefined>\n  realpath(opt: { withFileTypes: false }): Promise<string | undefined>\n  realpath(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  realpath(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async realpath(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.realpath()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  realpathSync(): string | undefined\n  realpathSync(opt: { withFileTypes: false }): string | undefined\n  realpathSync(opt: { withFileTypes: true }): PathBase | undefined\n  realpathSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  realpathSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.realpathSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Asynchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walk(): Promise<PathBase[]>\n  walk(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(opts: WalkOptionsWithFileTypesFalse): Promise<string[]>\n  walk(opts: WalkOptions): Promise<string[] | PathBase[]>\n  walk(entry: string | PathBase): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Promise<string[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Promise<PathBase[] | string[]>\n  async walk(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const walk = (\n      dir: PathBase,\n      cb: (er?: NodeJS.ErrnoException) => void,\n    ) => {\n      dirs.add(dir)\n      dir.readdirCB((er, entries) => {\n        /* c8 ignore start */\n        if (er) {\n          return cb(er)\n        }\n        /* c8 ignore stop */\n        let len = entries.length\n        if (!len) return cb()\n        const next = () => {\n          if (--len === 0) {\n            cb()\n          }\n        }\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            results.push(withFileTypes ? e : e.fullpath())\n          }\n          if (follow && e.isSymbolicLink()) {\n            e.realpath()\n              .then(r => (r?.isUnknown() ? r.lstat() : r))\n              .then(r =>\n                r?.shouldWalk(dirs, walkFilter) ? walk(r, next) : next(),\n              )\n          } else {\n            if (e.shouldWalk(dirs, walkFilter)) {\n              walk(e, next)\n            } else {\n              next()\n            }\n          }\n        }\n      }, true) // zalgooooooo\n    }\n\n    const start = entry\n    return new Promise<PathBase[] | string[]>((res, rej) => {\n      walk(start, er => {\n        /* c8 ignore start */\n        if (er) return rej(er)\n        /* c8 ignore stop */\n        res(results as PathBase[] | string[])\n      })\n    })\n  }\n\n  /**\n   * Synchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walkSync(): PathBase[]\n  walkSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): PathBase[]\n  walkSync(opts: WalkOptionsWithFileTypesFalse): string[]\n  walkSync(opts: WalkOptions): string[] | PathBase[]\n  walkSync(entry: string | PathBase): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): string[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): PathBase[] | string[]\n  walkSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          results.push(withFileTypes ? e : e.fullpath())\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n    return results as string[] | PathBase[]\n  }\n\n  /**\n   * Support for `for await`\n   *\n   * Alias for {@link PathScurryBase.iterate}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n\n  /**\n   * Async generator form of {@link PathScurryBase.walk}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking, especially if most/all of the directory tree has been previously\n   * walked.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  iterate(): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(opts: WalkOptions): AsyncGenerator<string | PathBase, void, void>\n  iterate(entry: string | PathBase): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): AsyncGenerator<PathBase | string, void, void>\n  iterate(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    options: WalkOptions = {},\n  ): AsyncGenerator<PathBase | string, void, void> {\n    // iterating async over the stream is significantly more performant,\n    // especially in the warm-cache scenario, because it buffers up directory\n    // entries in the background instead of waiting for a yield for each one.\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      options = entry\n      entry = this.cwd\n    }\n    return this.stream(entry, options)[Symbol.asyncIterator]()\n  }\n\n  /**\n   * Iterating over a PathScurry performs a synchronous walk.\n   *\n   * Alias for {@link PathScurryBase.iterateSync}\n   */\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  iterateSync(): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(opts: WalkOptions): Generator<string | PathBase, void, void>\n  iterateSync(entry: string | PathBase): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Generator<PathBase | string, void, void>\n  *iterateSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Generator<PathBase | string, void, void> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    if (!filter || filter(entry)) {\n      yield withFileTypes ? entry : entry.fullpath()\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          yield withFileTypes ? e : e.fullpath()\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n  }\n\n  /**\n   * Stream form of {@link PathScurryBase.walk}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   */\n  stream(): Minipass<PathBase>\n  stream(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  stream(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  stream(opts: WalkOptions): Minipass<string | PathBase>\n  stream(entry: string | PathBase): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  stream(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n\n        processing++\n        dirs.add(dir)\n\n        const onReaddir = (\n          er: null | NodeJS.ErrnoException,\n          entries: PathBase[],\n          didRealpaths: boolean = false,\n        ) => {\n          /* c8 ignore start */\n          if (er) return results.emit('error', er)\n          /* c8 ignore stop */\n          if (follow && !didRealpaths) {\n            const promises: Promise<PathBase | undefined>[] = []\n            for (const e of entries) {\n              if (e.isSymbolicLink()) {\n                promises.push(\n                  e\n                    .realpath()\n                    .then((r: PathBase | undefined) =>\n                      r?.isUnknown() ? r.lstat() : r,\n                    ),\n                )\n              }\n            }\n            if (promises.length) {\n              Promise.all(promises).then(() =>\n                onReaddir(null, entries, true),\n              )\n              return\n            }\n          }\n\n          for (const e of entries) {\n            if (e && (!filter || filter(e))) {\n              if (!results.write(withFileTypes ? e : e.fullpath())) {\n                paused = true\n              }\n            }\n          }\n\n          processing--\n          for (const e of entries) {\n            const r = e.realpathCached() || e\n            if (r.shouldWalk(dirs, walkFilter)) {\n              queue.push(r)\n            }\n          }\n          if (paused && !results.flowing) {\n            results.once('drain', process)\n          } else if (!sync) {\n            process()\n          }\n        }\n\n        // zalgo containment\n        let sync = true\n        dir.readdirCB(onReaddir, true)\n        sync = false\n      }\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  /**\n   * Synchronous form of {@link PathScurryBase.stream}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   *\n   * Will complete the walk in a single tick if the stream is consumed fully.\n   * Otherwise, will pause as needed for stream backpressure.\n   */\n  streamSync(): Minipass<PathBase>\n  streamSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  streamSync(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  streamSync(opts: WalkOptions): Minipass<string | PathBase>\n  streamSync(entry: string | PathBase): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    const dirs = new Set<PathBase>()\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n        processing++\n        dirs.add(dir)\n\n        const entries = dir.readdirSync()\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            if (!results.write(withFileTypes ? e : e.fullpath())) {\n              paused = true\n            }\n          }\n        }\n        processing--\n        for (const e of entries) {\n          let r: PathBase | undefined = e\n          if (e.isSymbolicLink()) {\n            if (!(follow && (r = e.realpathSync()))) continue\n            if (r.isUnknown()) r.lstatSync()\n          }\n          if (r.shouldWalk(dirs, walkFilter)) {\n            queue.push(r)\n          }\n        }\n      }\n      if (paused && !results.flowing) results.once('drain', process)\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  chdir(path: string | Path = this.cwd) {\n    const oldCwd = this.cwd\n    this.cwd = typeof path === 'string' ? this.cwd.resolve(path) : path\n    this.cwd[setAsCwd](oldCwd)\n  }\n}\n\n/**\n * Options provided to all walk methods.\n */\nexport interface WalkOptions {\n  /**\n   * Return results as {@link PathBase} objects rather than strings.\n   * When set to false, results are fully resolved paths, as returned by\n   * {@link PathBase.fullpath}.\n   * @default true\n   */\n  withFileTypes?: boolean\n\n  /**\n   *  Attempt to read directory entries from symbolic links. Otherwise, only\n   *  actual directories are traversed. Regardless of this setting, a given\n   *  target path will only ever be walked once, meaning that a symbolic link\n   *  to a previously traversed directory will never be followed.\n   *\n   *  Setting this imposes a slight performance penalty, because `readlink`\n   *  must be called on all symbolic links encountered, in order to avoid\n   *  infinite cycles.\n   * @default false\n   */\n  follow?: boolean\n\n  /**\n   * Only return entries where the provided function returns true.\n   *\n   * This will not prevent directories from being traversed, even if they do\n   * not pass the filter, though it will prevent directories themselves from\n   * being included in the result set.  See {@link walkFilter}\n   *\n   * Asynchronous functions are not supported here.\n   *\n   * By default, if no filter is provided, all entries and traversed\n   * directories are included.\n   */\n  filter?: (entry: PathBase) => boolean\n\n  /**\n   * Only traverse directories (and in the case of {@link follow} being set to\n   * true, symbolic links to directories) if the provided function returns\n   * true.\n   *\n   * This will not prevent directories from being included in the result set,\n   * even if they do not pass the supplied filter function.  See {@link filter}\n   * to do that.\n   *\n   * Asynchronous functions are not supported here.\n   */\n  walkFilter?: (entry: PathBase) => boolean\n}\n\nexport type WalkOptionsWithFileTypesUnset = WalkOptions & {\n  withFileTypes?: undefined\n}\nexport type WalkOptionsWithFileTypesTrue = WalkOptions & {\n  withFileTypes: true\n}\nexport type WalkOptionsWithFileTypesFalse = WalkOptions & {\n  withFileTypes: false\n}\n\n/**\n * Windows implementation of {@link PathScurryBase}\n *\n * Defaults to case insensitve, uses `'\\\\'` to generate path strings.  Uses\n * {@link PathWin32} for Path objects.\n */\nexport class PathScurryWin32 extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '\\\\' = '\\\\'\n\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, win32, '\\\\', { ...opts, nocase })\n    this.nocase = nocase\n    for (let p: PathBase | undefined = this.cwd; p; p = p.parent) {\n      p.nocase = this.nocase\n    }\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(dir: string): string {\n    // if the path starts with a single separator, it's not a UNC, and we'll\n    // just get separator as the root, and driveFromUNC will return \\\n    // In that case, mount \\ on the root from the cwd.\n    return win32.parse(dir).root.toUpperCase()\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathWin32(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return (\n      p.startsWith('/') || p.startsWith('\\\\') || /^[a-z]:(\\/|\\\\)/i.test(p)\n    )\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for all posix systems other than Darwin.\n *\n * Defaults to case-sensitive matching, uses `'/'` to generate path strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryPosix extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = false } = opts\n    super(cwd, posix, '/', { ...opts, nocase })\n    this.nocase = nocase\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(_dir: string): string {\n    return '/'\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathPosix(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return p.startsWith('/')\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for Darwin (macOS) systems.\n *\n * Defaults to case-insensitive matching, uses `'/'` for generating path\n * strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryDarwin extends PathScurryPosix {\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, { ...opts, nocase })\n  }\n}\n\n/**\n * Default {@link PathBase} implementation for the current platform.\n *\n * {@link PathWin32} on Windows systems, {@link PathPosix} on all others.\n */\nexport const Path = process.platform === 'win32' ? PathWin32 : PathPosix\nexport type Path = PathBase | InstanceType<typeof Path>\n\n/**\n * Default {@link PathScurryBase} implementation for the current platform.\n *\n * {@link PathScurryWin32} on Windows systems, {@link PathScurryDarwin} on\n * Darwin (macOS) systems, {@link PathScurryPosix} on all others.\n */\nexport const PathScurry:\n  | typeof PathScurryWin32\n  | typeof PathScurryDarwin\n  | typeof PathScurryPosix =\n  process.platform === 'win32' ? PathScurryWin32\n  : process.platform === 'darwin' ? PathScurryDarwin\n  : PathScurryPosix\nexport type PathScurry = PathScurryBase | InstanceType<typeof PathScurry>\n", "const proc =\n  typeof process === 'object' && process\n    ? process\n    : {\n        stdout: null,\n        stderr: null,\n      }\nimport { EventEmitter } from 'node:events'\nimport Stream from 'node:stream'\nimport { StringDecoder } from 'node:string_decoder'\n\n/**\n * Same as StringDecoder, but exposing the `lastNeed` flag on the type\n */\ntype SD = StringDecoder & { lastNeed: boolean }\n\nexport type { SD, Pipe, PipeProxyErrors }\n\n/**\n * Return true if the argument is a Minipass stream, Node stream, or something\n * else that Minipass can interact with.\n */\nexport const isStream = (\n  s: any\n): s is Minipass.Readable | Minipass.Writable =>\n  !!s &&\n  typeof s === 'object' &&\n  (s instanceof Minipass ||\n    s instanceof Stream ||\n    isReadable(s) ||\n    isWritable(s))\n\n/**\n * Return true if the argument is a valid {@link Minipass.Readable}\n */\nexport const isReadable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Readable).pipe === 'function' &&\n  // node core Writable streams have a pipe() method, but it throws\n  (s as Minipass.Readable).pipe !== Stream.Writable.prototype.pipe\n\n/**\n * Return true if the argument is a valid {@link Minipass.Writable}\n */\nexport const isWritable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Writable).write === 'function' &&\n  typeof (s as Minipass.Writable).end === 'function'\n\nconst EOF = Symbol('EOF')\nconst MAYBE_EMIT_END = Symbol('maybeEmitEnd')\nconst EMITTED_END = Symbol('emittedEnd')\nconst EMITTING_END = Symbol('emittingEnd')\nconst EMITTED_ERROR = Symbol('emittedError')\nconst CLOSED = Symbol('closed')\nconst READ = Symbol('read')\nconst FLUSH = Symbol('flush')\nconst FLUSHCHUNK = Symbol('flushChunk')\nconst ENCODING = Symbol('encoding')\nconst DECODER = Symbol('decoder')\nconst FLOWING = Symbol('flowing')\nconst PAUSED = Symbol('paused')\nconst RESUME = Symbol('resume')\nconst BUFFER = Symbol('buffer')\nconst PIPES = Symbol('pipes')\nconst BUFFERLENGTH = Symbol('bufferLength')\nconst BUFFERPUSH = Symbol('bufferPush')\nconst BUFFERSHIFT = Symbol('bufferShift')\nconst OBJECTMODE = Symbol('objectMode')\n// internal event when stream is destroyed\nconst DESTROYED = Symbol('destroyed')\n// internal event when stream has an error\nconst ERROR = Symbol('error')\nconst EMITDATA = Symbol('emitData')\nconst EMITEND = Symbol('emitEnd')\nconst EMITEND2 = Symbol('emitEnd2')\nconst ASYNC = Symbol('async')\nconst ABORT = Symbol('abort')\nconst ABORTED = Symbol('aborted')\nconst SIGNAL = Symbol('signal')\nconst DATALISTENERS = Symbol('dataListeners')\nconst DISCARDED = Symbol('discarded')\n\nconst defer = (fn: (...a: any[]) => any) => Promise.resolve().then(fn)\nconst nodefer = (fn: (...a: any[]) => any) => fn()\n\n// events that mean 'the stream is over'\n// these are treated specially, and re-emitted\n// if they are listened for after emitting.\ntype EndishEvent = 'end' | 'finish' | 'prefinish'\nconst isEndish = (ev: any): ev is EndishEvent =>\n  ev === 'end' || ev === 'finish' || ev === 'prefinish'\n\nconst isArrayBufferLike = (b: any): b is ArrayBufferLike =>\n  b instanceof ArrayBuffer ||\n  (!!b &&\n    typeof b === 'object' &&\n    b.constructor &&\n    b.constructor.name === 'ArrayBuffer' &&\n    b.byteLength >= 0)\n\nconst isArrayBufferView = (b: any): b is ArrayBufferView =>\n  !Buffer.isBuffer(b) && ArrayBuffer.isView(b)\n\n/**\n * Options that may be passed to stream.pipe()\n */\nexport interface PipeOptions {\n  /**\n   * end the destination stream when the source stream ends\n   */\n  end?: boolean\n  /**\n   * proxy errors from the source stream to the destination stream\n   */\n  proxyErrors?: boolean\n}\n\n/**\n * Internal class representing a pipe to a destination stream.\n *\n * @internal\n */\nclass Pipe<T extends unknown> {\n  src: Minipass<T>\n  dest: Minipass<any, T>\n  opts: PipeOptions\n  ondrain: () => any\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    this.src = src\n    this.dest = dest as Minipass<any, T>\n    this.opts = opts\n    this.ondrain = () => src[RESUME]()\n    this.dest.on('drain', this.ondrain)\n  }\n  unpipe() {\n    this.dest.removeListener('drain', this.ondrain)\n  }\n  // only here for the prototype\n  /* c8 ignore start */\n  proxyErrors(_er: any) {}\n  /* c8 ignore stop */\n  end() {\n    this.unpipe()\n    if (this.opts.end) this.dest.end()\n  }\n}\n\n/**\n * Internal class representing a pipe to a destination stream where\n * errors are proxied.\n *\n * @internal\n */\nclass PipeProxyErrors<T> extends Pipe<T> {\n  unpipe() {\n    this.src.removeListener('error', this.proxyErrors)\n    super.unpipe()\n  }\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    super(src, dest, opts)\n    this.proxyErrors = (er: Error) => this.dest.emit('error', er)\n    src.on('error', this.proxyErrors)\n  }\n}\n\nexport namespace Minipass {\n  /**\n   * Encoding used to create a stream that outputs strings rather than\n   * Buffer objects.\n   */\n  export type Encoding = BufferEncoding | 'buffer' | null\n\n  /**\n   * Any stream that Minipass can pipe into\n   */\n  export type Writable =\n    | Minipass<any, any, any>\n    | NodeJS.WriteStream\n    | (NodeJS.WriteStream & { fd: number })\n    | (EventEmitter & {\n        end(): any\n        write(chunk: any, ...args: any[]): any\n      })\n\n  /**\n   * Any stream that can be read from\n   */\n  export type Readable =\n    | Minipass<any, any, any>\n    | NodeJS.ReadStream\n    | (NodeJS.ReadStream & { fd: number })\n    | (EventEmitter & {\n        pause(): any\n        resume(): any\n        pipe(...destArgs: any[]): any\n      })\n\n  /**\n   * Utility type that can be iterated sync or async\n   */\n  export type DualIterable<T> = Iterable<T> & AsyncIterable<T>\n\n  type EventArguments = Record<string | symbol, unknown[]>\n\n  /**\n   * The listing of events that a Minipass class can emit.\n   * Extend this when extending the Minipass class, and pass as\n   * the third template argument.  The key is the name of the event,\n   * and the value is the argument list.\n   *\n   * Any undeclared events will still be allowed, but the handler will get\n   * arguments as `unknown[]`.\n   */\n  export interface Events<RType extends any = Buffer>\n    extends EventArguments {\n    readable: []\n    data: [chunk: RType]\n    error: [er: unknown]\n    abort: [reason: unknown]\n    drain: []\n    resume: []\n    end: []\n    finish: []\n    prefinish: []\n    close: []\n    [DESTROYED]: [er?: unknown]\n    [ERROR]: [er: unknown]\n  }\n\n  /**\n   * String or buffer-like data that can be joined and sliced\n   */\n  export type ContiguousData =\n    | Buffer\n    | ArrayBufferLike\n    | ArrayBufferView\n    | string\n  export type BufferOrString = Buffer | string\n\n  /**\n   * Options passed to the Minipass constructor.\n   */\n  export type SharedOptions = {\n    /**\n     * Defer all data emission and other events until the end of the\n     * current tick, similar to Node core streams\n     */\n    async?: boolean\n    /**\n     * A signal which will abort the stream\n     */\n    signal?: AbortSignal\n    /**\n     * Output string encoding. Set to `null` or `'buffer'` (or omit) to\n     * emit Buffer objects rather than strings.\n     *\n     * Conflicts with `objectMode`\n     */\n    encoding?: BufferEncoding | null | 'buffer'\n    /**\n     * Output data exactly as it was written, supporting non-buffer/string\n     * data (such as arbitrary objects, falsey values, etc.)\n     *\n     * Conflicts with `encoding`\n     */\n    objectMode?: boolean\n  }\n\n  /**\n   * Options for a string encoded output\n   */\n  export type EncodingOptions = SharedOptions & {\n    encoding: BufferEncoding\n    objectMode?: false\n  }\n\n  /**\n   * Options for contiguous data buffer output\n   */\n  export type BufferOptions = SharedOptions & {\n    encoding?: null | 'buffer'\n    objectMode?: false\n  }\n\n  /**\n   * Options for objectMode arbitrary output\n   */\n  export type ObjectModeOptions = SharedOptions & {\n    objectMode: true\n    encoding?: null\n  }\n\n  /**\n   * Utility type to determine allowed options based on read type\n   */\n  export type Options<T> =\n    | ObjectModeOptions\n    | (T extends string\n        ? EncodingOptions\n        : T extends Buffer\n        ? BufferOptions\n        : SharedOptions)\n}\n\nconst isObjectModeOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.ObjectModeOptions => !!o.objectMode\n\nconst isEncodingOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.EncodingOptions =>\n  !o.objectMode && !!o.encoding && o.encoding !== 'buffer'\n\n/**\n * Main export, the Minipass class\n *\n * `RType` is the type of data emitted, defaults to Buffer\n *\n * `WType` is the type of data to be written, if RType is buffer or string,\n * then any {@link Minipass.ContiguousData} is allowed.\n *\n * `Events` is the set of event handler signatures that this object\n * will emit, see {@link Minipass.Events}\n */\nexport class Minipass<\n    RType extends unknown = Buffer,\n    WType extends unknown = RType extends Minipass.BufferOrString\n      ? Minipass.ContiguousData\n      : RType,\n    Events extends Minipass.Events<RType> = Minipass.Events<RType>\n  >\n  extends EventEmitter\n  implements Minipass.DualIterable<RType>\n{\n  [FLOWING]: boolean = false;\n  [PAUSED]: boolean = false;\n  [PIPES]: Pipe<RType>[] = [];\n  [BUFFER]: RType[] = [];\n  [OBJECTMODE]: boolean;\n  [ENCODING]: BufferEncoding | null;\n  [ASYNC]: boolean;\n  [DECODER]: SD | null;\n  [EOF]: boolean = false;\n  [EMITTED_END]: boolean = false;\n  [EMITTING_END]: boolean = false;\n  [CLOSED]: boolean = false;\n  [EMITTED_ERROR]: unknown = null;\n  [BUFFERLENGTH]: number = 0;\n  [DESTROYED]: boolean = false;\n  [SIGNAL]?: AbortSignal;\n  [ABORTED]: boolean = false;\n  [DATALISTENERS]: number = 0;\n  [DISCARDED]: boolean = false\n\n  /**\n   * true if the stream can be written\n   */\n  writable: boolean = true\n  /**\n   * true if the stream can be read\n   */\n  readable: boolean = true\n\n  /**\n   * If `RType` is Buffer, then options do not need to be provided.\n   * Otherwise, an options object must be provided to specify either\n   * {@link Minipass.SharedOptions.objectMode} or\n   * {@link Minipass.SharedOptions.encoding}, as appropriate.\n   */\n  constructor(\n    ...args:\n      | [Minipass.ObjectModeOptions]\n      | (RType extends Buffer\n          ? [] | [Minipass.Options<RType>]\n          : [Minipass.Options<RType>])\n  ) {\n    const options: Minipass.Options<RType> = (args[0] ||\n      {}) as Minipass.Options<RType>\n    super()\n    if (options.objectMode && typeof options.encoding === 'string') {\n      throw new TypeError(\n        'Encoding and objectMode may not be used together'\n      )\n    }\n    if (isObjectModeOptions(options)) {\n      this[OBJECTMODE] = true\n      this[ENCODING] = null\n    } else if (isEncodingOptions(options)) {\n      this[ENCODING] = options.encoding\n      this[OBJECTMODE] = false\n    } else {\n      this[OBJECTMODE] = false\n      this[ENCODING] = null\n    }\n    this[ASYNC] = !!options.async\n    this[DECODER] = this[ENCODING]\n      ? (new StringDecoder(this[ENCODING]) as SD)\n      : null\n\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposeBuffer === true) {\n      Object.defineProperty(this, 'buffer', { get: () => this[BUFFER] })\n    }\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposePipes === true) {\n      Object.defineProperty(this, 'pipes', { get: () => this[PIPES] })\n    }\n\n    const { signal } = options\n    if (signal) {\n      this[SIGNAL] = signal\n      if (signal.aborted) {\n        this[ABORT]()\n      } else {\n        signal.addEventListener('abort', () => this[ABORT]())\n      }\n    }\n  }\n\n  /**\n   * The amount of data stored in the buffer waiting to be read.\n   *\n   * For Buffer strings, this will be the total byte length.\n   * For string encoding streams, this will be the string character length,\n   * according to JavaScript's `string.length` logic.\n   * For objectMode streams, this is a count of the items waiting to be\n   * emitted.\n   */\n  get bufferLength() {\n    return this[BUFFERLENGTH]\n  }\n\n  /**\n   * The `BufferEncoding` currently in use, or `null`\n   */\n  get encoding() {\n    return this[ENCODING]\n  }\n\n  /**\n   * @deprecated - This is a read only property\n   */\n  set encoding(_enc) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * @deprecated - Encoding may only be set at instantiation time\n   */\n  setEncoding(_enc: Minipass.Encoding) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * True if this is an objectMode stream\n   */\n  get objectMode() {\n    return this[OBJECTMODE]\n  }\n\n  /**\n   * @deprecated - This is a read-only property\n   */\n  set objectMode(_om) {\n    throw new Error('objectMode must be set at instantiation time')\n  }\n\n  /**\n   * true if this is an async stream\n   */\n  get ['async'](): boolean {\n    return this[ASYNC]\n  }\n  /**\n   * Set to true to make this stream async.\n   *\n   * Once set, it cannot be unset, as this would potentially cause incorrect\n   * behavior.  Ie, a sync stream can be made async, but an async stream\n   * cannot be safely made sync.\n   */\n  set ['async'](a: boolean) {\n    this[ASYNC] = this[ASYNC] || !!a\n  }\n\n  // drop everything and get out of the flow completely\n  [ABORT]() {\n    this[ABORTED] = true\n    this.emit('abort', this[SIGNAL]?.reason)\n    this.destroy(this[SIGNAL]?.reason)\n  }\n\n  /**\n   * True if the stream has been aborted.\n   */\n  get aborted() {\n    return this[ABORTED]\n  }\n  /**\n   * No-op setter. Stream aborted status is set via the AbortSignal provided\n   * in the constructor options.\n   */\n  set aborted(_) {}\n\n  /**\n   * Write data into the stream\n   *\n   * If the chunk written is a string, and encoding is not specified, then\n   * `utf8` will be assumed. If the stream encoding matches the encoding of\n   * a written string, and the state of the string decoder allows it, then\n   * the string will be passed through to either the output or the internal\n   * buffer without any processing. Otherwise, it will be turned into a\n   * Buffer object for processing into the desired encoding.\n   *\n   * If provided, `cb` function is called immediately before return for\n   * sync streams, or on next tick for async streams, because for this\n   * base class, a chunk is considered \"processed\" once it is accepted\n   * and either emitted or buffered. That is, the callback does not indicate\n   * that the chunk has been eventually emitted, though of course child\n   * classes can override this function to do whatever processing is required\n   * and call `super.write(...)` only once processing is completed.\n   */\n  write(chunk: WType, cb?: () => void): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding,\n    cb?: () => void\n  ): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): boolean {\n    if (this[ABORTED]) return false\n    if (this[EOF]) throw new Error('write after end')\n\n    if (this[DESTROYED]) {\n      this.emit(\n        'error',\n        Object.assign(\n          new Error('Cannot call write after a stream was destroyed'),\n          { code: 'ERR_STREAM_DESTROYED' }\n        )\n      )\n      return true\n    }\n\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n\n    if (!encoding) encoding = 'utf8'\n\n    const fn = this[ASYNC] ? defer : nodefer\n\n    // convert array buffers and typed array views into buffers\n    // at some point in the future, we may want to do the opposite!\n    // leave strings and buffers as-is\n    // anything is only allowed if in object mode, so throw\n    if (!this[OBJECTMODE] && !Buffer.isBuffer(chunk)) {\n      if (isArrayBufferView(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(\n          chunk.buffer,\n          chunk.byteOffset,\n          chunk.byteLength\n        )\n      } else if (isArrayBufferLike(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(chunk)\n      } else if (typeof chunk !== 'string') {\n        throw new Error(\n          'Non-contiguous data written to non-objectMode stream'\n        )\n      }\n    }\n\n    // handle object mode up front, since it's simpler\n    // this yields better performance, fewer checks later.\n    if (this[OBJECTMODE]) {\n      // maybe impossible?\n      /* c8 ignore start */\n      if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n      /* c8 ignore stop */\n\n      if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n      else this[BUFFERPUSH](chunk as unknown as RType)\n\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n      if (cb) fn(cb)\n\n      return this[FLOWING]\n    }\n\n    // at this point the chunk is a buffer or string\n    // don't buffer it up or send it to the decoder\n    if (!(chunk as Minipass.BufferOrString).length) {\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n      if (cb) fn(cb)\n      return this[FLOWING]\n    }\n\n    // fast-path writing strings of same encoding to a stream with\n    // an empty buffer, skipping the buffer/decoder dance\n    if (\n      typeof chunk === 'string' &&\n      // unless it is a string already ready for us to use\n      !(encoding === this[ENCODING] && !this[DECODER]?.lastNeed)\n    ) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = Buffer.from(chunk, encoding)\n    }\n\n    if (Buffer.isBuffer(chunk) && this[ENCODING]) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = this[DECODER].write(chunk)\n    }\n\n    // Note: flushing CAN potentially switch us into not-flowing mode\n    if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n\n    if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n    else this[BUFFERPUSH](chunk as unknown as RType)\n\n    if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n    if (cb) fn(cb)\n\n    return this[FLOWING]\n  }\n\n  /**\n   * Low-level explicit read method.\n   *\n   * In objectMode, the argument is ignored, and one item is returned if\n   * available.\n   *\n   * `n` is the number of bytes (or in the case of encoding streams,\n   * characters) to consume. If `n` is not provided, then the entire buffer\n   * is returned, or `null` is returned if no data is available.\n   *\n   * If `n` is greater that the amount of data in the internal buffer,\n   * then `null` is returned.\n   */\n  read(n?: number | null): RType | null {\n    if (this[DESTROYED]) return null\n    this[DISCARDED] = false\n\n    if (\n      this[BUFFERLENGTH] === 0 ||\n      n === 0 ||\n      (n && n > this[BUFFERLENGTH])\n    ) {\n      this[MAYBE_EMIT_END]()\n      return null\n    }\n\n    if (this[OBJECTMODE]) n = null\n\n    if (this[BUFFER].length > 1 && !this[OBJECTMODE]) {\n      // not object mode, so if we have an encoding, then RType is string\n      // otherwise, must be Buffer\n      this[BUFFER] = [\n        (this[ENCODING]\n          ? this[BUFFER].join('')\n          : Buffer.concat(\n              this[BUFFER] as Buffer[],\n              this[BUFFERLENGTH]\n            )) as RType,\n      ]\n    }\n\n    const ret = this[READ](n || null, this[BUFFER][0] as RType)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [READ](n: number | null, chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERSHIFT]()\n    else {\n      const c = chunk as Minipass.BufferOrString\n      if (n === c.length || n === null) this[BUFFERSHIFT]()\n      else if (typeof c === 'string') {\n        this[BUFFER][0] = c.slice(n) as RType\n        chunk = c.slice(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      } else {\n        this[BUFFER][0] = c.subarray(n) as RType\n        chunk = c.subarray(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      }\n    }\n\n    this.emit('data', chunk)\n\n    if (!this[BUFFER].length && !this[EOF]) this.emit('drain')\n\n    return chunk\n  }\n\n  /**\n   * End the stream, optionally providing a final write.\n   *\n   * See {@link Minipass#write} for argument descriptions\n   */\n  end(cb?: () => void): this\n  end(chunk: WType, cb?: () => void): this\n  end(chunk: WType, encoding?: Minipass.Encoding, cb?: () => void): this\n  end(\n    chunk?: WType | (() => void),\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): this {\n    if (typeof chunk === 'function') {\n      cb = chunk as () => void\n      chunk = undefined\n    }\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n    if (chunk !== undefined) this.write(chunk, encoding)\n    if (cb) this.once('end', cb)\n    this[EOF] = true\n    this.writable = false\n\n    // if we haven't written anything, then go ahead and emit,\n    // even if we're not reading.\n    // we'll re-emit if a new 'end' listener is added anyway.\n    // This makes MP more suitable to write-only use cases.\n    if (this[FLOWING] || !this[PAUSED]) this[MAYBE_EMIT_END]()\n    return this\n  }\n\n  // don't let the internal resume be overwritten\n  [RESUME]() {\n    if (this[DESTROYED]) return\n\n    if (!this[DATALISTENERS] && !this[PIPES].length) {\n      this[DISCARDED] = true\n    }\n    this[PAUSED] = false\n    this[FLOWING] = true\n    this.emit('resume')\n    if (this[BUFFER].length) this[FLUSH]()\n    else if (this[EOF]) this[MAYBE_EMIT_END]()\n    else this.emit('drain')\n  }\n\n  /**\n   * Resume the stream if it is currently in a paused state\n   *\n   * If called when there are no pipe destinations or `data` event listeners,\n   * this will place the stream in a \"discarded\" state, where all data will\n   * be thrown away. The discarded state is removed if a pipe destination or\n   * data handler is added, if pause() is called, or if any synchronous or\n   * asynchronous iteration is started.\n   */\n  resume() {\n    return this[RESUME]()\n  }\n\n  /**\n   * Pause the stream\n   */\n  pause() {\n    this[FLOWING] = false\n    this[PAUSED] = true\n    this[DISCARDED] = false\n  }\n\n  /**\n   * true if the stream has been forcibly destroyed\n   */\n  get destroyed() {\n    return this[DESTROYED]\n  }\n\n  /**\n   * true if the stream is currently in a flowing state, meaning that\n   * any writes will be immediately emitted.\n   */\n  get flowing() {\n    return this[FLOWING]\n  }\n\n  /**\n   * true if the stream is currently in a paused state\n   */\n  get paused() {\n    return this[PAUSED]\n  }\n\n  [BUFFERPUSH](chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] += 1\n    else this[BUFFERLENGTH] += (chunk as Minipass.BufferOrString).length\n    this[BUFFER].push(chunk)\n  }\n\n  [BUFFERSHIFT](): RType {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] -= 1\n    else\n      this[BUFFERLENGTH] -= (\n        this[BUFFER][0] as Minipass.BufferOrString\n      ).length\n    return this[BUFFER].shift() as RType\n  }\n\n  [FLUSH](noDrain: boolean = false) {\n    do {} while (\n      this[FLUSHCHUNK](this[BUFFERSHIFT]()) &&\n      this[BUFFER].length\n    )\n\n    if (!noDrain && !this[BUFFER].length && !this[EOF]) this.emit('drain')\n  }\n\n  [FLUSHCHUNK](chunk: RType) {\n    this.emit('data', chunk)\n    return this[FLOWING]\n  }\n\n  /**\n   * Pipe all data emitted by this stream into the destination provided.\n   *\n   * Triggers the flow of data.\n   */\n  pipe<W extends Minipass.Writable>(dest: W, opts?: PipeOptions): W {\n    if (this[DESTROYED]) return dest\n    this[DISCARDED] = false\n\n    const ended = this[EMITTED_END]\n    opts = opts || {}\n    if (dest === proc.stdout || dest === proc.stderr) opts.end = false\n    else opts.end = opts.end !== false\n    opts.proxyErrors = !!opts.proxyErrors\n\n    // piping an ended stream ends immediately\n    if (ended) {\n      if (opts.end) dest.end()\n    } else {\n      // \"as\" here just ignores the WType, which pipes don't care about,\n      // since they're only consuming from us, and writing to the dest\n      this[PIPES].push(\n        !opts.proxyErrors\n          ? new Pipe<RType>(this as Minipass<RType>, dest, opts)\n          : new PipeProxyErrors<RType>(this as Minipass<RType>, dest, opts)\n      )\n      if (this[ASYNC]) defer(() => this[RESUME]())\n      else this[RESUME]()\n    }\n\n    return dest\n  }\n\n  /**\n   * Fully unhook a piped destination stream.\n   *\n   * If the destination stream was the only consumer of this stream (ie,\n   * there are no other piped destinations or `'data'` event listeners)\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  unpipe<W extends Minipass.Writable>(dest: W) {\n    const p = this[PIPES].find(p => p.dest === dest)\n    if (p) {\n      if (this[PIPES].length === 1) {\n        if (this[FLOWING] && this[DATALISTENERS] === 0) {\n          this[FLOWING] = false\n        }\n        this[PIPES] = []\n      } else this[PIPES].splice(this[PIPES].indexOf(p), 1)\n      p.unpipe()\n    }\n  }\n\n  /**\n   * Alias for {@link Minipass#on}\n   */\n  addListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    return this.on(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.on`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * - Adding a 'data' event handler will trigger the flow of data\n   *\n   * - Adding a 'readable' event handler when there is data waiting to be read\n   *   will cause 'readable' to be emitted immediately.\n   *\n   * - Adding an 'endish' event handler ('end', 'finish', etc.) which has\n   *   already passed will cause the event to be emitted immediately and all\n   *   handlers removed.\n   *\n   * - Adding an 'error' event handler after an error has been emitted will\n   *   cause the event to be re-emitted immediately with the error previously\n   *   raised.\n   */\n  on<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    const ret = super.on(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    if (ev === 'data') {\n      this[DISCARDED] = false\n      this[DATALISTENERS]++\n      if (!this[PIPES].length && !this[FLOWING]) {\n        this[RESUME]()\n      }\n    } else if (ev === 'readable' && this[BUFFERLENGTH] !== 0) {\n      super.emit('readable')\n    } else if (isEndish(ev) && this[EMITTED_END]) {\n      super.emit(ev)\n      this.removeAllListeners(ev)\n    } else if (ev === 'error' && this[EMITTED_ERROR]) {\n      const h = handler as (...a: Events['error']) => any\n      if (this[ASYNC]) defer(() => h.call(this, this[EMITTED_ERROR]))\n      else h.call(this, this[EMITTED_ERROR])\n    }\n    return ret\n  }\n\n  /**\n   * Alias for {@link Minipass#off}\n   */\n  removeListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    return this.off(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.off`\n   *\n   * If a 'data' event handler is removed, and it was the last consumer\n   * (ie, there are no pipe destinations or other 'data' event listeners),\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  off<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    const ret = super.off(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    // if we previously had listeners, and now we don't, and we don't\n    // have any pipes, then stop the flow, unless it's been explicitly\n    // put in a discarded flowing state via stream.resume().\n    if (ev === 'data') {\n      this[DATALISTENERS] = this.listeners('data').length\n      if (\n        this[DATALISTENERS] === 0 &&\n        !this[DISCARDED] &&\n        !this[PIPES].length\n      ) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.removeAllListeners`\n   *\n   * If all 'data' event handlers are removed, and they were the last consumer\n   * (ie, there are no pipe destinations), then the flow of data will stop\n   * until there is another consumer or {@link Minipass#resume} is explicitly\n   * called.\n   */\n  removeAllListeners<Event extends keyof Events>(ev?: Event) {\n    const ret = super.removeAllListeners(ev as string | symbol | undefined)\n    if (ev === 'data' || ev === undefined) {\n      this[DATALISTENERS] = 0\n      if (!this[DISCARDED] && !this[PIPES].length) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * true if the 'end' event has been emitted\n   */\n  get emittedEnd() {\n    return this[EMITTED_END]\n  }\n\n  [MAYBE_EMIT_END]() {\n    if (\n      !this[EMITTING_END] &&\n      !this[EMITTED_END] &&\n      !this[DESTROYED] &&\n      this[BUFFER].length === 0 &&\n      this[EOF]\n    ) {\n      this[EMITTING_END] = true\n      this.emit('end')\n      this.emit('prefinish')\n      this.emit('finish')\n      if (this[CLOSED]) this.emit('close')\n      this[EMITTING_END] = false\n    }\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.emit`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * If the stream has been destroyed, and the event is something other\n   * than 'close' or 'error', then `false` is returned and no handlers\n   * are called.\n   *\n   * If the event is 'end', and has already been emitted, then the event\n   * is ignored. If the stream is in a paused or non-flowing state, then\n   * the event will be deferred until data flow resumes. If the stream is\n   * async, then handlers will be called on the next tick rather than\n   * immediately.\n   *\n   * If the event is 'close', and 'end' has not yet been emitted, then\n   * the event will be deferred until after 'end' is emitted.\n   *\n   * If the event is 'error', and an AbortSignal was provided for the stream,\n   * and there are no listeners, then the event is ignored, matching the\n   * behavior of node core streams in the presense of an AbortSignal.\n   *\n   * If the event is 'finish' or 'prefinish', then all listeners will be\n   * removed after emitting the event, to prevent double-firing.\n   */\n  emit<Event extends keyof Events>(\n    ev: Event,\n    ...args: Events[Event]\n  ): boolean {\n    const data = args[0]\n    // error and close are only events allowed after calling destroy()\n    if (\n      ev !== 'error' &&\n      ev !== 'close' &&\n      ev !== DESTROYED &&\n      this[DESTROYED]\n    ) {\n      return false\n    } else if (ev === 'data') {\n      return !this[OBJECTMODE] && !data\n        ? false\n        : this[ASYNC]\n        ? (defer(() => this[EMITDATA](data as RType)), true)\n        : this[EMITDATA](data as RType)\n    } else if (ev === 'end') {\n      return this[EMITEND]()\n    } else if (ev === 'close') {\n      this[CLOSED] = true\n      // don't emit close before 'end' and 'finish'\n      if (!this[EMITTED_END] && !this[DESTROYED]) return false\n      const ret = super.emit('close')\n      this.removeAllListeners('close')\n      return ret\n    } else if (ev === 'error') {\n      this[EMITTED_ERROR] = data\n      super.emit(ERROR, data)\n      const ret =\n        !this[SIGNAL] || this.listeners('error').length\n          ? super.emit('error', data)\n          : false\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'resume') {\n      const ret = super.emit('resume')\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'finish' || ev === 'prefinish') {\n      const ret = super.emit(ev)\n      this.removeAllListeners(ev)\n      return ret\n    }\n\n    // Some other unknown event\n    const ret = super.emit(ev as string, ...args)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITDATA](data: RType) {\n    for (const p of this[PIPES]) {\n      if (p.dest.write(data as RType) === false) this.pause()\n    }\n    const ret = this[DISCARDED] ? false : super.emit('data', data)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITEND]() {\n    if (this[EMITTED_END]) return false\n\n    this[EMITTED_END] = true\n    this.readable = false\n    return this[ASYNC]\n      ? (defer(() => this[EMITEND2]()), true)\n      : this[EMITEND2]()\n  }\n\n  [EMITEND2]() {\n    if (this[DECODER]) {\n      const data = this[DECODER].end()\n      if (data) {\n        for (const p of this[PIPES]) {\n          p.dest.write(data as RType)\n        }\n        if (!this[DISCARDED]) super.emit('data', data)\n      }\n    }\n\n    for (const p of this[PIPES]) {\n      p.end()\n    }\n    const ret = super.emit('end')\n    this.removeAllListeners('end')\n    return ret\n  }\n\n  /**\n   * Return a Promise that resolves to an array of all emitted data once\n   * the stream ends.\n   */\n  async collect(): Promise<RType[] & { dataLength: number }> {\n    const buf: RType[] & { dataLength: number } = Object.assign([], {\n      dataLength: 0,\n    })\n    if (!this[OBJECTMODE]) buf.dataLength = 0\n    // set the promise first, in case an error is raised\n    // by triggering the flow here.\n    const p = this.promise()\n    this.on('data', c => {\n      buf.push(c)\n      if (!this[OBJECTMODE])\n        buf.dataLength += (c as Minipass.BufferOrString).length\n    })\n    await p\n    return buf\n  }\n\n  /**\n   * Return a Promise that resolves to the concatenation of all emitted data\n   * once the stream ends.\n   *\n   * Not allowed on objectMode streams.\n   */\n  async concat(): Promise<RType> {\n    if (this[OBJECTMODE]) {\n      throw new Error('cannot concat in objectMode')\n    }\n    const buf = await this.collect()\n    return (\n      this[ENCODING]\n        ? buf.join('')\n        : Buffer.concat(buf as Buffer[], buf.dataLength)\n    ) as RType\n  }\n\n  /**\n   * Return a void Promise that resolves once the stream ends.\n   */\n  async promise(): Promise<void> {\n    return new Promise<void>((resolve, reject) => {\n      this.on(DESTROYED, () => reject(new Error('stream destroyed')))\n      this.on('error', er => reject(er))\n      this.on('end', () => resolve())\n    })\n  }\n\n  /**\n   * Asynchronous `for await of` iteration.\n   *\n   * This will continue emitting all chunks until the stream terminates.\n   */\n  [Symbol.asyncIterator](): AsyncGenerator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = async (): Promise<IteratorReturnResult<void>> => {\n      this.pause()\n      stopped = true\n      return { value: undefined, done: true }\n    }\n    const next = (): Promise<IteratorResult<RType, void>> => {\n      if (stopped) return stop()\n      const res = this.read()\n      if (res !== null) return Promise.resolve({ done: false, value: res })\n\n      if (this[EOF]) return stop()\n\n      let resolve!: (res: IteratorResult<RType>) => void\n      let reject!: (er: unknown) => void\n      const onerr = (er: unknown) => {\n        this.off('data', ondata)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        reject(er)\n      }\n      const ondata = (value: RType) => {\n        this.off('error', onerr)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        this.pause()\n        resolve({ value, done: !!this[EOF] })\n      }\n      const onend = () => {\n        this.off('error', onerr)\n        this.off('data', ondata)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        resolve({ done: true, value: undefined })\n      }\n      const ondestroy = () => onerr(new Error('stream destroyed'))\n      return new Promise<IteratorResult<RType>>((res, rej) => {\n        reject = rej\n        resolve = res\n        this.once(DESTROYED, ondestroy)\n        this.once('error', onerr)\n        this.once('end', onend)\n        this.once('data', ondata)\n      })\n    }\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.asyncIterator]() {\n        return this\n      },\n      [Symbol.asyncDispose]: async () => {},\n    }\n  }\n\n  /**\n   * Synchronous `for of` iteration.\n   *\n   * The iteration will terminate when the internal buffer runs out, even\n   * if the stream has not yet terminated.\n   */\n  [Symbol.iterator](): Generator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = (): IteratorReturnResult<void> => {\n      this.pause()\n      this.off(ERROR, stop)\n      this.off(DESTROYED, stop)\n      this.off('end', stop)\n      stopped = true\n      return { done: true, value: undefined }\n    }\n\n    const next = (): IteratorResult<RType, void> => {\n      if (stopped) return stop()\n      const value = this.read()\n      return value === null ? stop() : { done: false, value }\n    }\n\n    this.once('end', stop)\n    this.once(ERROR, stop)\n    this.once(DESTROYED, stop)\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.iterator]() {\n        return this\n      },\n      [Symbol.dispose]: () => {},\n    }\n  }\n\n  /**\n   * Destroy a stream, preventing it from being used for any further purpose.\n   *\n   * If the stream has a `close()` method, then it will be called on\n   * destruction.\n   *\n   * After destruction, any attempt to write data, read data, or emit most\n   * events will be ignored.\n   *\n   * If an error argument is provided, then it will be emitted in an\n   * 'error' event.\n   */\n  destroy(er?: unknown) {\n    if (this[DESTROYED]) {\n      if (er) this.emit('error', er)\n      else this.emit(DESTROYED)\n      return this\n    }\n\n    this[DESTROYED] = true\n    this[DISCARDED] = true\n\n    // throw away all buffered data, it's never coming out\n    this[BUFFER].length = 0\n    this[BUFFERLENGTH] = 0\n\n    const wc = this as Minipass<RType, WType, Events> & {\n      close?: () => void\n    }\n    if (typeof wc.close === 'function' && !this[CLOSED]) wc.close()\n\n    if (er) this.emit('error', er)\n    // if no error to emit, still reject pending promises\n    else this.emit(DESTROYED)\n\n    return this\n  }\n\n  /**\n   * Alias for {@link isStream}\n   *\n   * Former export location, maintained for backwards compatibility.\n   *\n   * @deprecated\n   */\n  static get isStream() {\n    return isStream\n  }\n}\n", "// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[],\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\nconst customInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform,\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  [customInspect]() {\n    return 'Pattern <' + this.#globList.slice(this.#index).join('/') + '>'\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index] as MMPattern\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0 ?\n        this.isAbsolute() ?\n          this.#globList[0] + this.#globList.slice(1).join('/')\n        : this.#globList.join('/')\n      : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform,\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined ?\n        this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined ?\n        this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined ?\n        this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return (\n        typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ) ?\n        p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n", "// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n  add?: (ignore: string) => void\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n  platform: NodeJS.Platform\n  mmopts: MinimatchOptions\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts,\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    this.platform = platform\n    this.mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n    for (const ign of ignored) this.add(ign)\n  }\n\n  add(ign: string) {\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    const mm = new Minimatch(ign, this.mmopts)\n    for (let i = 0; i < mm.set.length; i++) {\n      const parsed = mm.set[i]\n      const globParts = mm.globParts[i]\n      /* c8 ignore start */\n      if (!parsed || !globParts) {\n        throw new Error('invalid pattern object')\n      }\n      // strip off leading ./ portions\n      // https://github.com/isaacs/node-glob/issues/570\n      while (parsed[0] === '.' && globParts[0] === '.') {\n        parsed.shift()\n        globParts.shift()\n      }\n      /* c8 ignore stop */\n      const p = new Pattern(parsed, globParts, 0, this.platform)\n      const m = new Minimatch(p.globString(), this.mmopts)\n      const children = globParts[globParts.length - 1] === '**'\n      const absolute = p.isAbsolute()\n      if (absolute) this.absolute.push(m)\n      else this.relative.push(m)\n      if (children) {\n        if (absolute) this.absoluteChildren.push(m)\n        else this.relativeChildren.push(m)\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) return true\n    }\n    return false\n  }\n}\n", "// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache =\n      hasWalkedCache ? hasWalkedCache.copy() : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined ?\n            this.opts.root\n          : root,\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must not be final entry, otherwise we would have\n        // concatenated it earlier.\n        const ifDir = p === '..' || p === '' || p === '.'\n        this.matches.add(t.resolve(p), absolute, ifDir)\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n", "/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport { Ignore, IgnoreLike } from './ignore.js'\n\n// XXX can we somehow make it so that it NEVER processes a given path more than\n// once, enough that the match set tracking is no longer needed?  that'd speed\n// things up a lot.  Or maybe bring back nounique, and skip it in that case?\n\n// a single minimatch set entry with 1 or more parts\nimport { Pattern } from './pattern.js'\nimport { Processor } from './processor.js'\n\nexport interface GlobWalkerOpts {\n  absolute?: boolean\n  allowWindowsEscape?: boolean\n  cwd?: string | URL\n  dot?: boolean\n  dotRelative?: boolean\n  follow?: boolean\n  ignore?: string | string[] | IgnoreLike\n  mark?: boolean\n  matchBase?: boolean\n  // Note: maxDepth here means \"maximum actual Path.depth()\",\n  // not \"maximum depth beyond cwd\"\n  maxDepth?: number\n  nobrace?: boolean\n  nocase?: boolean\n  nodir?: boolean\n  noext?: boolean\n  noglobstar?: boolean\n  platform?: NodeJS.Platform\n  posix?: boolean\n  realpath?: boolean\n  root?: string\n  stat?: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape?: boolean\n  withFileTypes?: boolean\n  includeChildMatches?: boolean\n}\n\nexport type GWOFileTypesTrue = GlobWalkerOpts & {\n  withFileTypes: true\n}\nexport type GWOFileTypesFalse = GlobWalkerOpts & {\n  withFileTypes: false\n}\nexport type GWOFileTypesUnset = GlobWalkerOpts & {\n  withFileTypes?: undefined\n}\n\nexport type Result<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Path\n  : O extends GWOFileTypesFalse ? string\n  : O extends GWOFileTypesUnset ? string\n  : Path | string\n\nexport type Matches<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Set<Path>\n  : O extends GWOFileTypesFalse ? Set<string>\n  : O extends GWOFileTypesUnset ? Set<string>\n  : Set<Path | string>\n\nexport type MatchStream<O extends GlobWalkerOpts> = Minipass<\n  Result<O>,\n  Result<O>\n>\n\nconst makeIgnore = (\n  ignore: string | string[] | IgnoreLike,\n  opts: GlobWalkerOpts,\n): IgnoreLike =>\n  typeof ignore === 'string' ? new Ignore([ignore], opts)\n  : Array.isArray(ignore) ? new Ignore(ignore, opts)\n  : ignore\n\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport abstract class GlobUtil<O extends GlobWalkerOpts = GlobWalkerOpts> {\n  path: Path\n  patterns: Pattern[]\n  opts: O\n  seen: Set<Path> = new Set<Path>()\n  paused: boolean = false\n  aborted: boolean = false\n  #onResume: (() => any)[] = []\n  #ignore?: IgnoreLike\n  #sep: '\\\\' | '/'\n  signal?: AbortSignal\n  maxDepth: number\n  includeChildMatches: boolean\n\n  constructor(patterns: Pattern[], path: Path, opts: O)\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    this.patterns = patterns\n    this.path = path\n    this.opts = opts\n    this.#sep = !opts.posix && opts.platform === 'win32' ? '\\\\' : '/'\n    this.includeChildMatches = opts.includeChildMatches !== false\n    if (opts.ignore || !this.includeChildMatches) {\n      this.#ignore = makeIgnore(opts.ignore ?? [], opts)\n      if (\n        !this.includeChildMatches &&\n        typeof this.#ignore.add !== 'function'\n      ) {\n        const m = 'cannot ignore child matches, ignore lacks add() method.'\n        throw new Error(m)\n      }\n    }\n    // ignore, always set with maxDepth, but it's optional on the\n    // GlobOptions type\n    /* c8 ignore start */\n    this.maxDepth = opts.maxDepth || Infinity\n    /* c8 ignore stop */\n    if (opts.signal) {\n      this.signal = opts.signal\n      this.signal.addEventListener('abort', () => {\n        this.#onResume.length = 0\n      })\n    }\n  }\n\n  #ignored(path: Path): boolean {\n    return this.seen.has(path) || !!this.#ignore?.ignored?.(path)\n  }\n  #childrenIgnored(path: Path): boolean {\n    return !!this.#ignore?.childrenIgnored?.(path)\n  }\n\n  // backpressure mechanism\n  pause() {\n    this.paused = true\n  }\n  resume() {\n    /* c8 ignore start */\n    if (this.signal?.aborted) return\n    /* c8 ignore stop */\n    this.paused = false\n    let fn: (() => any) | undefined = undefined\n    while (!this.paused && (fn = this.#onResume.shift())) {\n      fn()\n    }\n  }\n  onResume(fn: () => any) {\n    if (this.signal?.aborted) return\n    /* c8 ignore start */\n    if (!this.paused) {\n      fn()\n    } else {\n      /* c8 ignore stop */\n      this.#onResume.push(fn)\n    }\n  }\n\n  // do the requisite realpath/stat checking, and return the path\n  // to add or undefined to filter it out.\n  async matchCheck(e: Path, ifDir: boolean): Promise<Path | undefined> {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || (await e.realpath())\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? await e.lstat() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = await s.realpath()\n      /* c8 ignore start */\n      if (target && (target.isUnknown() || this.opts.stat)) {\n        await target.lstat()\n      }\n      /* c8 ignore stop */\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  matchCheckTest(e: Path | undefined, ifDir: boolean): Path | undefined {\n    return (\n        e &&\n          (this.maxDepth === Infinity || e.depth() <= this.maxDepth) &&\n          (!ifDir || e.canReaddir()) &&\n          (!this.opts.nodir || !e.isDirectory()) &&\n          (!this.opts.nodir ||\n            !this.opts.follow ||\n            !e.isSymbolicLink() ||\n            !e.realpathCached()?.isDirectory()) &&\n          !this.#ignored(e)\n      ) ?\n        e\n      : undefined\n  }\n\n  matchCheckSync(e: Path, ifDir: boolean): Path | undefined {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || e.realpathSync()\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? e.lstatSync() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = s.realpathSync()\n      if (target && (target?.isUnknown() || this.opts.stat)) {\n        target.lstatSync()\n      }\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  abstract matchEmit(p: Result<O>): void\n  abstract matchEmit(p: string | Path): void\n\n  matchFinish(e: Path, absolute: boolean) {\n    if (this.#ignored(e)) return\n    // we know we have an ignore if this is false, but TS doesn't\n    if (!this.includeChildMatches && this.#ignore?.add) {\n      const ign = `${e.relativePosix()}/**`\n      this.#ignore.add(ign)\n    }\n    const abs =\n      this.opts.absolute === undefined ? absolute : this.opts.absolute\n    this.seen.add(e)\n    const mark = this.opts.mark && e.isDirectory() ? this.#sep : ''\n    // ok, we have what we need!\n    if (this.opts.withFileTypes) {\n      this.matchEmit(e)\n    } else if (abs) {\n      const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath()\n      this.matchEmit(abs + mark)\n    } else {\n      const rel = this.opts.posix ? e.relativePosix() : e.relative()\n      const pre =\n        this.opts.dotRelative && !rel.startsWith('..' + this.#sep) ?\n          '.' + this.#sep\n        : ''\n      this.matchEmit(!rel ? '.' + mark : pre + rel + mark)\n    }\n  }\n\n  async match(e: Path, absolute: boolean, ifDir: boolean): Promise<void> {\n    const p = await this.matchCheck(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  matchSync(e: Path, absolute: boolean, ifDir: boolean): void {\n    const p = this.matchCheckSync(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  walkCB(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() => this.walkCB2(target, patterns, processor, cb))\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const childrenCached = t.readdirCached()\n      if (t.calledReaddir())\n        this.walkCB3(t, childrenCached, processor, next)\n      else {\n        t.readdirCB(\n          (_, entries) => this.walkCB3(t, entries, processor, next),\n          true,\n        )\n      }\n    }\n\n    next()\n  }\n\n  walkCB3(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n\n  walkCBSync(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2Sync(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2Sync(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() =>\n        this.walkCB2Sync(target, patterns, processor, cb),\n      )\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const children = t.readdirSync()\n      this.walkCB3Sync(t, children, processor, next)\n    }\n\n    next()\n  }\n\n  walkCB3Sync(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2Sync(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n}\n\nexport class GlobWalker<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  matches = new Set<Result<O>>()\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.matches.add(e)\n  }\n\n  async walk(): Promise<Set<Result<O>>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      await this.path.lstat()\n    }\n    await new Promise((res, rej) => {\n      this.walkCB(this.path, this.patterns, () => {\n        if (this.signal?.aborted) {\n          rej(this.signal.reason)\n        } else {\n          res(this.matches)\n        }\n      })\n    })\n    return this.matches\n  }\n\n  walkSync(): Set<Result<O>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    // nothing for the callback to do, because this never pauses\n    this.walkCBSync(this.path, this.patterns, () => {\n      if (this.signal?.aborted) throw this.signal.reason\n    })\n    return this.matches\n  }\n}\n\nexport class GlobStream<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  results: Minipass<Result<O>, Result<O>>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.results = new Minipass<Result<O>, Result<O>>({\n      signal: this.signal,\n      objectMode: true,\n    })\n    this.results.on('drain', () => this.resume())\n    this.results.on('resume', () => this.resume())\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.results.write(e)\n    if (!this.results.flowing) this.pause()\n  }\n\n  stream(): MatchStream<O> {\n    const target = this.path\n    if (target.isUnknown()) {\n      target.lstat().then(() => {\n        this.walkCB(target, this.patterns, () => this.results.end())\n      })\n    } else {\n      this.walkCB(target, this.patterns, () => this.results.end())\n    }\n    return this.results\n  }\n\n  streamSync(): MatchStream<O> {\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    this.walkCBSync(this.path, this.patterns, () => this.results.end())\n    return this.results\n  }\n}\n", "import { Minimatch } from 'minimatch'\nimport { GlobOptions } from './glob.js'\n\n/**\n * Return true if the patterns provided contain any magic glob characters,\n * given the options provided.\n *\n * Brace expansion is not considered \"magic\" unless the `magicalBraces` option\n * is set, as brace expansion just turns one string into an array of strings.\n * So a pattern like `'x{a,b}y'` would return `false`, because `'xay'` and\n * `'xby'` both do not contain any magic glob characters, and it's treated the\n * same as if you had called it on `['xay', 'xby']`. When `magicalBraces:true`\n * is in the options, brace expansion _is_ treated as a pattern having magic.\n */\nexport const hasMagic = (\n  pattern: string | string[],\n  options: GlobOptions = {},\n): boolean => {\n  if (!Array.isArray(pattern)) {\n    pattern = [pattern]\n  }\n  for (const p of pattern) {\n    if (new Minimatch(p, options).hasMagic()) return true\n  }\n  return false\n}\n", "import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\nexport { escape, unescape } from 'minimatch'\nexport type {\n  FSOption,\n  Path,\n  WalkOptions,\n  WalkOptionsWithFileTypesTrue,\n  WalkOptionsWithFileTypesUnset,\n} from 'path-scurry'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport { Ignore } from './ignore.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions,\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions,\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n", "import { execFileSync } from 'child_process';\nimport { existsSync, readdirSync } from 'fs';\nimport { join, resolve } from 'path';\n\nimport type { ValidatedCdsCommand } from './types';\nimport { fileExists } from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport type { CdsDependencyGraph } from '../parser/types';\n\n/** Default timeout for command execution in milliseconds. **/\nexport const DEFAULT_COMMAND_TIMEOUT_MS = 10000;\n\n/**\n * Cache for CDS command test results to avoid running the same CLI commands repeatedly.\n */\ninterface CdsCommandCache {\n  /** Map of command strings to their test results */\n  commandResults: Map<string, { works: boolean; version?: string; error?: string }>;\n  /** Available cache directories discovered during testing */\n  availableCacheDirs: string[];\n  /** Global command test results */\n  globalCommand?: string;\n  /** Whether cache has been initialized */\n  initialized: boolean;\n}\n\n// Global cache instance to share results across all calls\nconst cdsCommandCache: CdsCommandCache = {\n  commandResults: new Map(),\n  availableCacheDirs: [],\n  initialized: false,\n};\n\n/**\n * Information about CDS version dependencies from a project's package.json\n */\ninterface CdsVersionInfo {\n  /** Semver range for @sap/cds */\n  cdsVersion?: string;\n  /** Semver range for @sap/cds-dk */\n  cdsDkVersion?: string;\n  /** Computed compatible @sap/cds-dk version */\n  preferredDkVersion?: string;\n}\n\n/**\n * Factory functions to create {@link ValidatedCdsCommand} instances.\n */\nconst createCdsCommands = {\n  // Global CDS command\n  cds: (): ValidatedCdsCommand => ({\n    executable: 'cds',\n    args: [],\n    originalCommand: 'cds',\n  }),\n  // NPX with @sap/cds package\n  npxCds: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', '@sap/cds', 'cds'],\n    originalCommand: 'npx --yes --package @sap/cds cds',\n  }),\n  // NPX with @sap/cds-dk package\n  npxCdsDk: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', '@sap/cds-dk', 'cds'],\n    originalCommand: 'npx --yes --package @sap/cds-dk cds',\n  }),\n  // NPX with @sap/cds-dk package (alternative flag)\n  npxCdsDkAlt: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '@sap/cds-dk', 'cds'],\n    originalCommand: 'npx --yes @sap/cds-dk cds',\n  }),\n  // NPX with versioned @sap/cds-dk package\n  npxCdsDkWithVersion: (version: string): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', `@sap/cds-dk@${version}`, 'cds'],\n    originalCommand: `npx --yes --package @sap/cds-dk@${version} cds`,\n  }),\n  // NPX with versioned @sap/cds package\n  npxCdsWithVersion: (version: string): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', `@sap/cds@${version}`, 'cds'],\n    originalCommand: `npx --yes --package @sap/cds@${version} cds`,\n  }),\n};\n\n/**\n * Converts a command string to a ValidatedCdsCommand object\n * @param commandString The command string to convert\n * @returns A ValidatedCdsCommand object\n */\nfunction parseCommandString(commandString: string): ValidatedCdsCommand {\n  const parts = commandString.trim().split(/\\s+/);\n  if (parts.length === 0) {\n    throw new Error('Empty command string');\n  }\n\n  const executable = parts[0];\n  const args = parts.slice(1);\n\n  return {\n    executable,\n    args,\n    originalCommand: commandString,\n  };\n}\n\n/**\n * Determines version-aware CDS commands for both primary and retry scenarios\n * @param cacheDir Optional cache directory\n * @param sourceRoot Source root directory\n * @param projectPath Project path for version resolution\n * @param dependencyGraph Dependency graph for version information\n * @returns Object containing both primary and retry commands\n */\nexport function determineVersionAwareCdsCommands(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): { primaryCommand: ValidatedCdsCommand; retryCommand: ValidatedCdsCommand } {\n  try {\n    // Get the best command string using existing logic\n    const commandString = getBestCdsCommand(cacheDir, sourceRoot, projectPath, dependencyGraph);\n\n    // Convert to ValidatedCdsCommand for primary use\n    const primaryCommand = parseCommandString(commandString);\n\n    // For retry command, always try to use a version-aware npx command if project context is available\n    let retryCommand: ValidatedCdsCommand;\n\n    if (projectPath && dependencyGraph) {\n      try {\n        const versionInfo = resolveCdsVersions(projectPath, dependencyGraph);\n        if (versionInfo?.preferredDkVersion) {\n          // Use version-specific command for retry\n          retryCommand = createCdsCommands.npxCdsDkWithVersion(versionInfo.preferredDkVersion);\n        } else if (versionInfo?.cdsDkVersion) {\n          // Use explicit cds-dk version\n          retryCommand = createCdsCommands.npxCdsDkWithVersion(versionInfo.cdsDkVersion);\n        } else {\n          // Fall back to generic npx cds-dk\n          retryCommand = createCdsCommands.npxCdsDk();\n        }\n      } catch (error) {\n        // If version resolution fails, fall back to generic npx\n        cdsExtractorLog(\n          'warn',\n          `Failed to resolve version info for ${projectPath}: ${String(error)}`,\n        );\n        retryCommand = createCdsCommands.npxCdsDk();\n      }\n    } else {\n      // No project context - use generic npx as fallback\n      retryCommand = createCdsCommands.npxCdsDk();\n    }\n\n    return { primaryCommand, retryCommand };\n  } catch (error) {\n    // If anything fails, fall back to simple commands\n    cdsExtractorLog('error', `Failed to determine version-aware commands: ${String(error)}`);\n    const fallbackCommand = parseCommandString('cds');\n    return {\n      primaryCommand: fallbackCommand,\n      retryCommand: createCdsCommands.npxCdsDk(),\n    };\n  }\n} /**\n * Creates a validated CDS command for an absolute path to a CDS executable.\n * @param absolutePath The absolute path to the CDS executable\n * @returns A {@link ValidatedCdsCommand} if the path exists and is valid, null otherwise\n */\nfunction createCdsCommandForPath(absolutePath: string): ValidatedCdsCommand | null {\n  try {\n    const resolvedPath = resolve(absolutePath);\n    if (resolvedPath && fileExists(resolvedPath)) {\n      return {\n        executable: resolvedPath,\n        args: [],\n        originalCommand: absolutePath,\n      };\n    }\n  } catch {\n    // Ignore path resolution errors\n  }\n  return null;\n}\n\n/**\n * Resolve CDS version information from a project's package.json via dependency graph\n * @param projectPath The path to the project\n * @param dependencyGraph The CDS dependency graph containing project information\n * @returns CDS version information or undefined if not available\n */\nfunction resolveCdsVersions(\n  projectPath: string,\n  dependencyGraph: CdsDependencyGraph,\n): CdsVersionInfo | undefined {\n  const project = dependencyGraph.projects.get(projectPath);\n  if (!project?.packageJson) {\n    return undefined;\n  }\n\n  const { dependencies = {}, devDependencies = {} } = project.packageJson;\n  const allDependencies = { ...dependencies, ...devDependencies };\n\n  const cdsVersion = allDependencies['@sap/cds'];\n  const cdsDkVersion = allDependencies['@sap/cds-dk'];\n\n  if (!cdsVersion && !cdsDkVersion) {\n    return undefined;\n  }\n\n  let preferredDkVersion: string | undefined;\n  if (cdsDkVersion) {\n    // Use explicit @sap/cds-dk version if available, but enforce minimum\n    preferredDkVersion = enforceMinimumCdsDkVersion(cdsDkVersion);\n  } else if (cdsVersion) {\n    // Derive compatible @sap/cds-dk version from @sap/cds version\n    preferredDkVersion = deriveCompatibleCdsDkVersion(cdsVersion);\n  }\n\n  return {\n    cdsVersion,\n    cdsDkVersion,\n    preferredDkVersion,\n  };\n}\n\n/**\n * Enforce minimum @sap/cds-dk version requirement\n * @param version The version string to check\n * @returns The version string with minimum version enforcement applied\n */\nfunction enforceMinimumCdsDkVersion(version: string): string {\n  const minimumVersion = 8;\n  const majorVersionMatch = version.match(/\\^?(\\d+)/);\n\n  if (majorVersionMatch) {\n    const majorVersion = parseInt(majorVersionMatch[1], 10);\n    if (majorVersion < minimumVersion) {\n      // Use the minimum version if derived version is too low\n      return `^${minimumVersion}`;\n    }\n  }\n\n  // Return original version if it meets minimum requirement or can't be parsed\n  return version;\n}\n\n/**\n * Derive a compatible @sap/cds-dk version from an @sap/cds version\n * @param cdsVersion The @sap/cds version semver range\n * @returns A compatible @sap/cds-dk version range with minimum version enforcement\n */\nfunction deriveCompatibleCdsDkVersion(cdsVersion: string): string {\n  // For simplicity, we'll use the same major version range\n  // This can be enhanced with more sophisticated logic as needed\n  const majorVersionMatch = cdsVersion.match(/\\^?(\\d+)/);\n  let derivedVersion: string;\n\n  if (majorVersionMatch) {\n    const majorVersion = majorVersionMatch[1];\n    derivedVersion = `^${majorVersion}`;\n  } else {\n    // Fallback to the original version if we can't parse it\n    derivedVersion = cdsVersion;\n  }\n\n  // Apply minimum version enforcement\n  return enforceMinimumCdsDkVersion(derivedVersion);\n}\n\n/**\n * Create a version-aware CDS command based on project information\n * @param projectPath The path to the project\n * @param dependencyGraph The CDS dependency graph containing project information\n * @returns A ValidatedCdsCommand if version information is available, null otherwise\n */\nfunction createVersionAwareCdsCommand(\n  projectPath: string,\n  dependencyGraph: CdsDependencyGraph,\n): ValidatedCdsCommand | null {\n  const versionInfo = resolveCdsVersions(projectPath, dependencyGraph);\n\n  if (!versionInfo?.preferredDkVersion) {\n    return null;\n  }\n\n  return createCdsCommands.npxCdsDkWithVersion(versionInfo.preferredDkVersion);\n}\n\n/**\n * Determine the `cds` command to use based on the environment and cache directory.\n *\n * This function uses a caching strategy to minimize repeated CLI command testing:\n * - Initializes a global cache on first call\n * - Tests global commands once and caches results\n * - Discovers all available cache directories upfront\n * - Reuses test results across multiple calls\n * - Supports project-specific version-aware command generation\n */\nexport function determineCdsCommand(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): string {\n  try {\n    // Always use the efficient path - debug information is collected separately\n    return getBestCdsCommand(cacheDir, sourceRoot, projectPath, dependencyGraph);\n  } catch (error) {\n    const errorMessage = `Failed to determine CDS command: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n    throw new Error(errorMessage);\n  }\n}\n\n/**\n * Discover all available cache directories in the source tree\n * @param sourceRoot The source root directory\n * @returns Array of cache directory paths\n */\nfunction discoverAvailableCacheDirs(sourceRoot: string): string[] {\n  if (cdsCommandCache.availableCacheDirs.length > 0) {\n    return cdsCommandCache.availableCacheDirs;\n  }\n\n  const cacheRootDir = join(sourceRoot, '.cds-extractor-cache');\n  const availableDirs: string[] = [];\n\n  try {\n    if (existsSync(cacheRootDir)) {\n      const entries = readdirSync(cacheRootDir, { withFileTypes: true });\n      for (const entry of entries) {\n        if (entry.isDirectory() && entry.name.startsWith('cds-')) {\n          const cacheDir = join(cacheRootDir, entry.name);\n          const cdsBin = join(cacheDir, 'node_modules', '.bin', 'cds');\n          if (fileExists(cdsBin)) {\n            availableDirs.push(cacheDir);\n          }\n        }\n      }\n    }\n  } catch (error) {\n    cdsExtractorLog('debug', `Failed to discover cache directories: ${String(error)}`);\n  }\n\n  cdsCommandCache.availableCacheDirs = availableDirs;\n  return availableDirs;\n}\n\n/**\n * Get the best CDS command for a specific cache directory\n * @param cacheDir Optional specific cache directory\n * @param sourceRoot The source root directory\n * @param projectPath Optional project path for version-aware commands\n * @param dependencyGraph Optional dependency graph for version information\n * @returns The best CDS command to use\n */\nfunction getBestCdsCommand(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): string {\n  // Initialize cache if needed\n  initializeCdsCommandCache(sourceRoot);\n\n  // If a specific cache directory is provided and valid, prefer it\n  if (cacheDir) {\n    const localCdsBin = join(cacheDir, 'node_modules', '.bin', 'cds');\n    const command = createCdsCommandForPath(localCdsBin);\n    if (command) {\n      const result = testCdsCommand(command, sourceRoot, true);\n      if (result.works) {\n        return localCdsBin;\n      }\n    }\n  }\n\n  // Try any available cache directories\n  for (const availableCacheDir of cdsCommandCache.availableCacheDirs) {\n    const localCdsBin = join(availableCacheDir, 'node_modules', '.bin', 'cds');\n    const command = createCdsCommandForPath(localCdsBin);\n    if (command) {\n      const result = testCdsCommand(command, sourceRoot, true);\n      if (result.works) {\n        return localCdsBin;\n      }\n    }\n  }\n\n  // Try project-specific version-aware commands if information is available\n  if (projectPath && dependencyGraph) {\n    const versionAwareCommand = createVersionAwareCdsCommand(projectPath, dependencyGraph);\n    if (versionAwareCommand) {\n      const result = testCdsCommand(versionAwareCommand, sourceRoot, true);\n      if (result.works) {\n        return versionAwareCommand.originalCommand;\n      }\n    }\n  }\n\n  // Fall back to global command\n  if (cdsCommandCache.globalCommand) {\n    return cdsCommandCache.globalCommand;\n  }\n\n  // Final fallback: test remaining npx options\n  const fallbackCommands = [createCdsCommands.npxCds(), createCdsCommands.npxCdsDk()];\n\n  for (const command of fallbackCommands) {\n    const result = testCdsCommand(command, sourceRoot, true);\n    if (result.works) {\n      return command.originalCommand;\n    }\n  }\n\n  // Return the default fallback even if it doesn't work, as tests expect this behavior\n  return createCdsCommands.npxCdsDk().originalCommand;\n}\n\n/**\n * Initialize the CDS command cache by testing global commands\n * @param sourceRoot The source root directory\n */\nfunction initializeCdsCommandCache(sourceRoot: string): void {\n  if (cdsCommandCache.initialized) {\n    return;\n  }\n\n  cdsExtractorLog('info', 'Initializing CDS command cache...');\n\n  // Test global commands first (most commonly used)\n  const globalCommands = [createCdsCommands.cds(), createCdsCommands.npxCdsDk()];\n\n  for (const command of globalCommands) {\n    const result = testCdsCommand(command, sourceRoot, true); // Silent testing\n    if (result.works) {\n      cdsCommandCache.globalCommand = command.originalCommand;\n      cdsExtractorLog(\n        'info',\n        `Found working global CDS command: ${command.originalCommand} (v${result.version ?? 'unknown'})`,\n      );\n      break;\n    }\n  }\n\n  // Discover available cache directories\n  const cacheDirs = discoverAvailableCacheDirs(sourceRoot);\n  if (cacheDirs.length > 0) {\n    cdsExtractorLog(\n      'info',\n      `Discovered ${cacheDirs.length} CDS cache director${cacheDirs.length === 1 ? 'y' : 'ies'}`,\n    );\n  }\n\n  cdsCommandCache.initialized = true;\n}\n\n/**\n * Reset the command cache - primarily for testing\n */\nexport function resetCdsCommandCache(): void {\n  cdsCommandCache.commandResults.clear();\n  cdsCommandCache.availableCacheDirs = [];\n  cdsCommandCache.globalCommand = undefined;\n  cdsCommandCache.initialized = false;\n}\n\n/**\n * Check if a CDS command is available and working.\n * @param validatedCommand The {@link ValidatedCdsCommand} instance for the command to test\n * @param sourceRoot The source root directory to use as cwd when testing the command\n * @param silent Whether to suppress logging of test failures\n * @returns Object with test result and version information\n */\nfunction testCdsCommand(\n  validatedCommand: ValidatedCdsCommand,\n  sourceRoot: string,\n  silent: boolean = false,\n): { works: boolean; version?: string; error?: string } {\n  const cacheKey = validatedCommand.originalCommand;\n\n  // Check cache first\n  const cachedResult = cdsCommandCache.commandResults.get(cacheKey);\n  if (cachedResult) {\n    return cachedResult;\n  }\n\n  try {\n    // Run the validated `cds` command with `--version` to test if it works.\n    const cleanEnv = {\n      ...process.env,\n      // Remove any CodeQL-specific environment variables that might interfere.\n      CODEQL_EXTRACTOR_CDS_WIP_DATABASE: undefined,\n      CODEQL_RUNNER: undefined,\n    };\n\n    const result = execFileSync(\n      validatedCommand.executable,\n      [...validatedCommand.args, '--version'],\n      {\n        encoding: 'utf8',\n        stdio: 'pipe',\n        timeout: DEFAULT_COMMAND_TIMEOUT_MS, // timeout after 10 seconds\n        cwd: sourceRoot,\n        env: cleanEnv,\n      },\n    ).toString();\n\n    // Extract version from output (typically in format \"@sap/cds-dk: 6.1.3\" or just \"6.1.3\")\n    const versionMatch = result.match(/(\\d+\\.\\d+\\.\\d+)/);\n    const version = versionMatch ? versionMatch[1] : undefined;\n\n    const testResult = { works: true, version };\n    cdsCommandCache.commandResults.set(cacheKey, testResult);\n    return testResult;\n  } catch (error) {\n    const errorMessage = String(error);\n    if (!silent) {\n      cdsExtractorLog('debug', `CDS command test failed for '${cacheKey}': ${errorMessage}`);\n    }\n\n    const testResult = { works: false, error: errorMessage };\n    cdsCommandCache.commandResults.set(cacheKey, testResult);\n    return testResult;\n  }\n}\n", "import {\n  existsSync,\n  readFileSync,\n  readdirSync,\n  renameSync,\n  statSync,\n  unlinkSync,\n  writeFileSync,\n} from 'fs';\nimport { format, join, parse } from 'path';\n\nimport { cdsExtractorMarkerFileContent, cdsExtractorMarkerFileName } from './constants';\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Check if a directory exists\n * @param dirPath Path to the directory to check\n * @returns True if the directory exists, false otherwise\n */\nexport function dirExists(dirPath: string): boolean {\n  return existsSync(dirPath) && statSync(dirPath).isDirectory();\n}\n\n/**\n * Check if a file exists and can be read\n * @param filePath Path to the file to check\n * @returns True if the file exists and can be read, false otherwise\n */\nexport function fileExists(filePath: string): boolean {\n  return existsSync(filePath) && statSync(filePath).isFile();\n}\n\n/**\n * Recursively renames all .json files to .cds.json in the given directory and\n * its subdirectories, except for those that already have .cds.json extension.\n *\n * @param {string} dirPath - The directory path to start recursion from\n */\nexport function recursivelyRenameJsonFiles(dirPath: string): void {\n  // Make sure the directory exists\n  if (!dirExists(dirPath)) {\n    cdsExtractorLog('info', `Directory not found: ${dirPath}`);\n    return;\n  }\n  cdsExtractorLog('info', `Processing JSON files in directory: ${dirPath}`);\n\n  // Get all entries in the directory\n  const entries = readdirSync(dirPath, { withFileTypes: true });\n\n  for (const entry of entries) {\n    const fullPath = join(dirPath, entry.name);\n\n    if (entry.isDirectory()) {\n      // Recursively process subdirectories\n      recursivelyRenameJsonFiles(fullPath);\n    } else if (\n      entry.isFile() &&\n      entry.name.endsWith('.json') &&\n      !entry.name.endsWith('.cds.json')\n    ) {\n      // Rename .json files to .cds.json\n      const newPath = format({ ...parse(fullPath), base: '', ext: '.cds.json' });\n      renameSync(fullPath, newPath);\n      cdsExtractorLog('info', `Renamed CDS output file from ${fullPath} to ${newPath}`);\n    }\n  }\n}\n\n/**\n * Create the marker file with dummy content.\n * This file is required by the JavaScript extractor starting with CodeQL CLI v2.23.5.\n * @param sourceRoot The source root directory where the marker file should be created\n * @returns The path to the created marker file\n */\nexport function createMarkerFile(sourceRoot: string): string {\n  const markerFilePath = join(sourceRoot, cdsExtractorMarkerFileName);\n  try {\n    writeFileSync(markerFilePath, cdsExtractorMarkerFileContent, 'utf8');\n    cdsExtractorLog('info', `Created marker file: ${markerFilePath}`);\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to create marker file: ${String(error)}`);\n  }\n  return markerFilePath;\n}\n\n/**\n * Remove the cdsExtractorMarkerFileName file if it exists.\n * This cleanup prevents the marker file from being accidentally committed.\n * @param markerFilePath The path to the marker file to remove\n */\nexport function removeMarkerFile(markerFilePath: string): void {\n  if (existsSync(markerFilePath)) {\n    try {\n      unlinkSync(markerFilePath);\n      cdsExtractorLog('info', `Removed marker file: ${markerFilePath}`);\n    } catch (error) {\n      cdsExtractorLog('warn', `Failed to remove marker file: ${String(error)}`);\n    }\n  }\n}\n\n/**\n * Normalize all `$location.file` values in a parsed CDS JSON object to use\n * POSIX forward slashes. The CDS compiler on Windows produces backslash paths\n * (e.g. `\"srv\\\\service1.cds\"`), but the CodeQL libraries expect forward slashes\n * (e.g. `\"srv/service1.cds\"`).\n *\n * Mutates the object in place and returns it for convenience.\n */\nexport function normalizeCdsJsonLocations(data: Record<string, unknown>): Record<string, unknown> {\n  if (typeof data !== 'object' || data === null) return data;\n\n  // Normalize top-level $location.file\n  const topLoc = data['$location'] as Record<string, unknown> | undefined;\n  if (topLoc?.file && typeof topLoc.file === 'string') {\n    topLoc.file = topLoc.file.split('\\\\').join('/');\n  }\n\n  // Normalize $location.file in all definitions (and their nested elements/params)\n  const definitions = data['definitions'] as Record<string, Record<string, unknown>> | undefined;\n  if (definitions) {\n    for (const defn of Object.values(definitions)) {\n      normalizeLocationsRecursive(defn);\n    }\n  }\n\n  return data;\n}\n\n/**\n * Recursively normalize `$location.file` values in a CDS JSON object node.\n */\nfunction normalizeLocationsRecursive(obj: unknown): void {\n  if (typeof obj !== 'object' || obj === null) return;\n\n  const record = obj as Record<string, unknown>;\n  const loc = record['$location'] as Record<string, unknown> | undefined;\n  if (loc?.file && typeof loc.file === 'string') {\n    loc.file = loc.file.split('\\\\').join('/');\n  }\n\n  // Recurse into known nested structures: elements, params, actions, functions\n  for (const key of ['elements', 'params', 'actions', 'functions', 'items', 'returns']) {\n    const nested = record[key];\n    if (typeof nested === 'object' && nested !== null && !Array.isArray(nested)) {\n      for (const child of Object.values(nested as Record<string, unknown>)) {\n        normalizeLocationsRecursive(child);\n      }\n    }\n  }\n}\n\n/**\n * Read a `.cds.json` file, normalize all `$location.file` values to POSIX\n * forward slashes, and write it back. No-op if the file doesn't change.\n *\n * @param filePath Absolute path to the `.cds.json` file\n */\nexport function normalizeLocationPathsInFile(filePath: string): void {\n  if (!fileExists(filePath)) return;\n\n  const raw = readFileSync(filePath, 'utf8');\n  const data = JSON.parse(raw) as Record<string, unknown>;\n  normalizeCdsJsonLocations(data);\n  const normalized = JSON.stringify(data, null, 2) + '\\n';\n\n  if (normalized !== raw) {\n    writeFileSync(filePath, normalized, 'utf8');\n    cdsExtractorLog('info', `Normalized $location paths in: ${filePath}`);\n  }\n}\n", "/** Common constants used throughout the CDS extractor. */\n\n/**\n * Common, expected name of the JSON file created by CDS compilation\n * tasks performed by, or on behalf of, the CDS extractor.\n */\nexport const modelCdsJsonFile = 'model.cds.json';\n\n/**\n * Common, expected name of the marker file created to meet the JavaScript\n * extractor's requirement for at least one .js file to be present under\n * the source root. This file is auto-created in the source root directory\n * prior to invoking the JavaScript extractor, and removed afterwards, to\n * enable extraction of the .cds.json files by the JavaScript extractor.\n */\nexport const cdsExtractorMarkerFileName = 'cds-extractor-marker.js';\n\n/**\n * Expected content of the {@link cdsExtractorMarkerFileName} file.\n */\nexport const cdsExtractorMarkerFileContent =\n  '\"Placeholder content created by the CDS extractor. This file can be safely deleted.\";';\n", "import type { LogLevel } from './types';\n\n/**\n * Source root directory for logging context.\n */\nlet sourceRootDirectory: string | undefined;\n\n/**\n * Unique session ID for this CDS extractor run to help distinguish\n * between multiple concurrent or sequential runs in logs.\n * Uses the extractor start timestamp for uniqueness.\n */\nconst sessionId = Date.now().toString();\n\n/**\n * Start time of the CDS extractor session for performance tracking.\n */\nconst extractorStartTime = Date.now();\n\n/**\n * Performance tracking state for timing critical operations.\n */\nconst performanceTracking = new Map<string, number>();\n\n/**\n * Unified logging function for the CDS extractor. Provides consistent\n * log formatting with level prefixes, elapsed time, and session IDs.\n *\n * @param level - The log level ('debug', 'info', 'warn', 'error')\n * @param message - The primary message or data to log\n * @param optionalParams - Additional parameters to log (same as console.log)\n */\nexport function cdsExtractorLog(\n  level: LogLevel,\n  message: unknown,\n  ...optionalParams: unknown[]\n): void {\n  if (!sourceRootDirectory) {\n    throw new Error('Source root directory is not set. Call setSourceRootDirectory() first.');\n  }\n\n  const currentTime = Date.now();\n  const elapsedMs = currentTime - extractorStartTime;\n  const levelPrefix = `[CDS-${sessionId} ${elapsedMs}] ${level.toUpperCase()}: `;\n\n  // Select the appropriate console function based on log level\n  switch (level) {\n    case 'debug':\n    case 'info':\n      if (typeof message === 'string') {\n        console.log(levelPrefix + message, ...optionalParams);\n      } else {\n        console.log(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    case 'warn':\n      if (typeof message === 'string') {\n        console.warn(levelPrefix + message, ...optionalParams);\n      } else {\n        console.warn(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    case 'error':\n      if (typeof message === 'string') {\n        console.error(levelPrefix + message, ...optionalParams);\n      } else {\n        console.error(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    default:\n      // This should never happen due to TypeScript typing\n      throw new Error(`Invalid log level: ${String(level)}`);\n  }\n}\n/**\n * Calculates elapsed time from start and formats it with appropriate units.\n *\n * @param startTime - The start timestamp in milliseconds\n * @param endTime - The end timestamp in milliseconds (defaults to current time)\n * @returns Formatted duration string\n */\nfunction formatDuration(startTime: number, endTime: number = Date.now()): string {\n  const durationMs = endTime - startTime;\n\n  if (durationMs < 1000) {\n    return `${durationMs}ms`;\n  } else if (durationMs < 60000) {\n    return `${(durationMs / 1000).toFixed(2)}s`;\n  } else {\n    const minutes = Math.floor(durationMs / 60000);\n    const seconds = ((durationMs % 60000) / 1000).toFixed(2);\n    return `${minutes}m ${seconds}s`;\n  }\n}\n\n/**\n * Logs the start of the CDS extractor session with session information.\n *\n * @param sourceRoot - The source root directory being processed\n */\nexport function logExtractorStart(sourceRoot: string): void {\n  cdsExtractorLog('info', `=== CDS EXTRACTOR START [${sessionId}] ===`);\n  cdsExtractorLog('info', `Source Root: ${sourceRoot}`);\n}\n\n/**\n * Logs the end of the CDS extractor session with final performance summary.\n *\n * @param success - Whether the extraction completed successfully\n * @param additionalSummary - Optional additional summary information\n */\nexport function logExtractorStop(success: boolean = true, additionalSummary?: string): void {\n  const endTime = Date.now();\n  const totalDuration = formatDuration(extractorStartTime, endTime);\n  const status = success ? 'SUCCESS' : 'FAILURE';\n\n  if (additionalSummary) {\n    cdsExtractorLog('info', additionalSummary);\n  }\n\n  cdsExtractorLog('info', `=== CDS EXTRACTOR END [${sessionId}] - ${status} ===`);\n  cdsExtractorLog('info', `Total Duration: ${totalDuration}`);\n}\n\n/**\n * Logs a performance milestone with timing information.\n *\n * @param milestone - Description of the milestone reached\n * @param additionalInfo - Optional additional information to include\n */\nexport function logPerformanceMilestone(milestone: string, additionalInfo?: string): void {\n  const currentTime = Date.now();\n  const overallDuration = formatDuration(extractorStartTime, currentTime);\n  const info = additionalInfo ? ` - ${additionalInfo}` : '';\n  cdsExtractorLog('info', `MILESTONE: ${milestone} (after ${overallDuration})${info}`);\n}\n\n/**\n * Starts tracking performance for a named operation.\n *\n * @param operationName - Name of the operation to track\n */\nexport function logPerformanceTrackingStart(operationName: string): void {\n  performanceTracking.set(operationName, Date.now());\n  cdsExtractorLog('debug', `Started: ${operationName}`);\n}\n\n/**\n * Ends tracking performance for a named operation and logs the duration.\n *\n * @param operationName - Name of the operation to stop tracking\n */\nexport function logPerformanceTrackingStop(operationName: string): void {\n  const startTime = performanceTracking.get(operationName);\n  if (startTime) {\n    const duration = formatDuration(startTime);\n    performanceTracking.delete(operationName);\n    cdsExtractorLog('info', `Completed: ${operationName} (took ${duration})`);\n  } else {\n    cdsExtractorLog('warn', `No start time found for operation: ${operationName}`);\n  }\n}\n\n/**\n * Sets the source root directory for logging context.\n * This should typically be called once at the start of the CDS extractor.\n *\n * @param sourceRoot - The absolute path to the source root directory\n */\nexport function setSourceRootDirectory(sourceRoot: string): void {\n  sourceRootDirectory = sourceRoot;\n}\n", "import type { CdsDependencyGraph } from '../cds/parser';\n\n/**\n * Generate a comprehensive status report for the dependency graph\n * Supports both normal execution and debug modes\n */\nexport function generateStatusReport(dependencyGraph: CdsDependencyGraph): string {\n  const summary = dependencyGraph.statusSummary;\n  const lines: string[] = [];\n\n  lines.push('='.repeat(80));\n  lines.push(`CDS EXTRACTOR STATUS REPORT`);\n  lines.push('='.repeat(80));\n  lines.push('');\n\n  // OVERALL SUMMARY\n  lines.push('OVERALL SUMMARY:');\n  lines.push(`  Status: ${summary.overallSuccess ? 'SUCCESS' : 'FAILED'}`);\n  lines.push(`  Current Phase: ${dependencyGraph.currentPhase.toUpperCase()}`);\n  lines.push(`  Projects: ${summary.totalProjects}`);\n  lines.push(`  CDS Files: ${summary.totalCdsFiles}`);\n  lines.push(`  JSON Files Generated: ${summary.jsonFilesGenerated}`);\n  lines.push('');\n\n  // COMPILATION SUMMARY\n  lines.push('COMPILATION SUMMARY:');\n  lines.push(`  Total Tasks: ${summary.totalCompilationTasks}`);\n  lines.push(`  Successful: ${summary.successfulCompilations}`);\n  lines.push(`  Retried: ${dependencyGraph.retryStatus.totalRetryAttempts}`);\n  lines.push(`  Failed: ${summary.failedCompilations}`);\n  lines.push(`  Skipped: ${summary.skippedCompilations}`);\n  lines.push('');\n\n  // RETRY SUMMARY (if retry attempts were made)\n  if (dependencyGraph.retryStatus.totalRetryAttempts > 0) {\n    lines.push('RETRY SUMMARY:');\n    lines.push(`  Tasks Requiring Retry: ${dependencyGraph.retryStatus.totalTasksRequiringRetry}`);\n    lines.push(\n      `  Tasks Successfully Retried: ${dependencyGraph.retryStatus.totalTasksSuccessfullyRetried}`,\n    );\n    lines.push(`  Total Retry Attempts: ${dependencyGraph.retryStatus.totalRetryAttempts}`);\n    lines.push(\n      `  Projects Requiring Full Dependencies: ${dependencyGraph.retryStatus.projectsRequiringFullDependencies.size}`,\n    );\n    lines.push(\n      `  Projects with Full Dependencies: ${dependencyGraph.retryStatus.projectsWithFullDependencies.size}`,\n    );\n    lines.push('');\n  }\n\n  // PERFORMANCE metrics\n  lines.push('PERFORMANCE:');\n  lines.push(`  Total Duration: ${summary.performance.totalDurationMs}ms`);\n  lines.push(`  Parsing: ${summary.performance.parsingDurationMs}ms`);\n  lines.push(`  Compilation: ${summary.performance.compilationDurationMs}ms`);\n  lines.push(`  Extraction: ${summary.performance.extractionDurationMs}ms`);\n\n  // Add percentage breakdown if total duration > 0\n  if (summary.performance.totalDurationMs > 0) {\n    const parsingPct = Math.round(\n      (summary.performance.parsingDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n    const compilationPct = Math.round(\n      (summary.performance.compilationDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n    const extractionPct = Math.round(\n      (summary.performance.extractionDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n\n    lines.push('  Breakdown:');\n    lines.push(`    Parsing: ${parsingPct}%`);\n    lines.push(`    Compilation: ${compilationPct}%`);\n    lines.push(`    Extraction: ${extractionPct}%`);\n  }\n  lines.push('');\n\n  // Errors and warnings\n  if (summary.criticalErrors.length > 0) {\n    lines.push('CRITICAL ERRORS:');\n    for (const error of summary.criticalErrors) {\n      lines.push(`  - ${error}`);\n    }\n    lines.push('');\n  }\n\n  if (summary.warnings.length > 0) {\n    lines.push('WARNINGS:');\n    for (const warning of summary.warnings) {\n      lines.push(`  - ${warning}`);\n    }\n    lines.push('');\n  }\n\n  lines.push('='.repeat(80));\n\n  return lines.join('\\n');\n}\n", "import { spawnSync, SpawnSyncOptions } from 'child_process';\nimport { basename, delimiter, dirname, join, relative, resolve, sep } from 'path';\n\nimport { CdsCompilationResult } from './types';\nimport { getCdsVersion } from './version';\nimport { modelCdsJsonFile } from '../../constants';\nimport { getPlatformInfo } from '../../environment';\nimport {\n  fileExists,\n  dirExists,\n  recursivelyRenameJsonFiles,\n  normalizeLocationPathsInFile,\n} from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport { BasicCdsProject } from '../parser/types';\n\n/**\n * Parses a command string for use with spawnSync, handling multi-word commands like 'npx cds'.\n * @param commandString The command string to parse (e.g., 'npx cds' or 'cds')\n * @returns Object with executable and args arrays for spawnSync\n */\nfunction parseCommandForSpawn(commandString: string): { executable: string; baseArgs: string[] } {\n  const parts = commandString.trim().split(/\\s+/);\n  const executable = parts[0];\n  const baseArgs = parts.slice(1);\n  return { executable, baseArgs };\n}\n\n/**\n * Determines compilation targets for a CDS project according to the new project-only compilation approach.\n * @param project The CDS project\n * @param sourceRoot The source root directory\n * @returns Array of compilation targets (directories or files relative to project base)\n */\nfunction determineCompilationTargets(project: BasicCdsProject, sourceRoot: string): string[] {\n  const projectAbsolutePath = join(sourceRoot, project.projectDir);\n\n  // Check for index.cds in the project root first, which takes precedence over CAP directories.\n  const rootCdsFiles = project.cdsFiles\n    .filter(file => dirname(join(sourceRoot, file)) === projectAbsolutePath)\n    .map(file => basename(file));\n\n  if (rootCdsFiles.includes('index.cds')) {\n    // Use only index.cds when it exists in the project root\n    return ['index.cds'];\n  }\n\n  // Check for standard CAP directories\n  const capDirectories = ['db', 'srv', 'app'];\n  const existingCapDirs = capDirectories.filter(dir => dirExists(join(projectAbsolutePath, dir)));\n\n  if (existingCapDirs.length > 0) {\n    // Use standard CAP directories\n    return existingCapDirs;\n  }\n\n  if (rootCdsFiles.length > 0) {\n    // Use other root-level files\n    return rootCdsFiles;\n  }\n\n  // Use all CDS files with their relative paths\n  return project.cdsFiles.map(file => relative(projectAbsolutePath, join(sourceRoot, file)));\n}\n\n/**\n * Compiles a CDS project to JSON using project-level compilation only.\n * This function has been simplified to only use project-level compilation,\n * eliminating all individual file compilation logic and standardizing output\n * to a single {@link modelCdsJsonFile} file per project.\n *\n *\n * @param cdsFilePath The path to the CDS file to compile, relative to the `sourceRoot`.\n * @param sourceRoot The source root directory scanned by the CDS extractor.\n * CRITICAL: All spawned processes will use the project base directory as their `cwd` to\n * ensure that paths in generated JSON are relative to the project base directory.\n *\n * @param cdsCommand The actual shell command to use for `cds compile`.\n * @param cacheDir Full path to the cache directory where dependencies are stored.\n * @param projectMap Map of project directories to {@link BasicCdsProject} instances.\n * @param projectDir The project directory to which `cdsFilePath` belongs.\n *\n * @returns The {@link CdsCompilationResult} of the compilation attempt.\n */\nexport function compileCdsToJson(\n  cdsFilePath: string,\n  sourceRoot: string,\n  cdsCommand: string,\n  cacheDir: string | undefined,\n  projectMap: Map<string, BasicCdsProject>,\n  projectDir: string,\n): CdsCompilationResult {\n  try {\n    const resolvedCdsFilePath = resolve(cdsFilePath);\n    if (!fileExists(resolvedCdsFilePath)) {\n      throw new Error(`Expected CDS file '${resolvedCdsFilePath}' does not exist.`);\n    }\n\n    // Get and log the CDS version\n    const cdsVersion = getCdsVersion(cdsCommand, cacheDir);\n    const versionInfo = cdsVersion ? `with CDS v${cdsVersion}` : '';\n\n    // Calculate project base directory for consistent working directory\n    const projectBaseDir = join(sourceRoot, projectDir);\n\n    // Create spawn options with project base directory as cwd.\n    const spawnOptions = createSpawnOptions(projectBaseDir, cdsCommand, cacheDir);\n\n    // Throw an error if projectDir cannot be found in the projectMap.\n    if (!projectMap || !projectDir || !projectMap.has(projectDir)) {\n      throw new Error(\n        `Project directory '${projectDir}' not found in projectMap. Ensure the project is properly initialized.`,\n      );\n    }\n\n    const project = projectMap.get(projectDir);\n\n    // Always use project-level compilation\n    return compileProject(sourceRoot, projectDir, cdsCommand, spawnOptions, versionInfo, project!);\n  } catch (error) {\n    return { success: false, message: String(error) };\n  }\n}\n\n/**\n * Handles project-level compilation for CAP projects.\n * CRITICAL: Uses the project base directory as cwd and calculates paths relative to project base directory.\n *\n * @param sourceRoot The source root directory\n * @param projectDir The project directory (relative to sourceRoot)\n * @param cdsCommand The CDS command to use\n * @param spawnOptions Pre-configured spawn options with project base directory as cwd\n * @param versionInfo Version information for logging\n * @param project The CDS project instance\n * @returns Compilation result\n */\nfunction compileProject(\n  sourceRoot: string,\n  projectDir: string,\n  cdsCommand: string,\n  spawnOptions: SpawnSyncOptions,\n  versionInfo: string,\n  project: BasicCdsProject,\n): CdsCompilationResult {\n  cdsExtractorLog('info', `Compiling CDS project '${projectDir}' using ${versionInfo}...`);\n\n  // Determine compilation targets using the new centralized logic\n  const compilationTargets = determineCompilationTargets(project, sourceRoot);\n\n  if (compilationTargets.length === 0) {\n    throw new Error(\n      `Project directory '${projectDir}' does not contain any CDS files and cannot be compiled`,\n    );\n  }\n\n  const projectJsonOutPath = join(sourceRoot, projectDir, modelCdsJsonFile);\n\n  const compileArgs = [\n    'compile',\n    ...compilationTargets,\n    '--to',\n    'json',\n    '--dest',\n    modelCdsJsonFile,\n    '--locations',\n    '--log-level',\n    'warn',\n  ];\n\n  cdsExtractorLog('info', `Compiling CDS project targets: ${compilationTargets.join(', ')}`);\n  cdsExtractorLog(\n    'info',\n    `Running compilation task for CDS project '${projectDir}': command='${cdsCommand}' args='${JSON.stringify(compileArgs)}'`,\n  );\n\n  // Parse command for proper spawnSync execution\n  const { executable, baseArgs } = parseCommandForSpawn(cdsCommand);\n  const allArgs = [...baseArgs, ...compileArgs];\n\n  const result = spawnSync(executable, allArgs, spawnOptions);\n\n  if (result.error) {\n    cdsExtractorLog('error', `SpawnSync error: ${result.error.message}`);\n    throw new Error(`Error executing CDS compiler: ${result.error.message}`);\n  }\n\n  // Log stderr for debugging even on success (CDS often writes warnings to stderr).\n  if (result.stderr && result.stderr.length > 0) {\n    cdsExtractorLog('warn', `CDS stderr output: ${result.stderr.toString()}`);\n  }\n\n  if (result.status !== 0) {\n    cdsExtractorLog('error', `CDS command failed with status ${result.status}`);\n    cdsExtractorLog(\n      'error',\n      `Command: ${cdsCommand} ${compileArgs.map(arg => (arg.includes(' ') ? `\"${arg}\"` : arg)).join(' ')}`,\n    );\n    cdsExtractorLog('error', `Stdout: ${result.stdout?.toString() || 'No stdout'}`);\n    cdsExtractorLog('error', `Stderr: ${result.stderr?.toString() || 'No stderr'}`);\n    throw new Error(\n      `Could not compile the CAP project ${projectDir}.\\nReported error(s):\\n\\`\\`\\`\\n${\n        result.stderr?.toString() || 'Unknown error'\n      }\\n\\`\\`\\``,\n    );\n  }\n\n  if (!fileExists(projectJsonOutPath) && !dirExists(projectJsonOutPath)) {\n    throw new Error(\n      `CAP project '${projectDir}' was not compiled to JSON. This is likely because the project structure is invalid.`,\n    );\n  }\n\n  // Handle directory output if the CDS compiler generated a directory.\n  if (dirExists(projectJsonOutPath)) {\n    cdsExtractorLog(\n      'info',\n      `CDS compiler generated JSON to output directory: ${projectJsonOutPath}`,\n    );\n    // Recursively rename generated .json files to have a .cds.json extension\n    recursivelyRenameJsonFiles(projectJsonOutPath);\n  } else {\n    cdsExtractorLog('info', `CDS compiler generated JSON to file: ${projectJsonOutPath}`);\n  }\n\n  // Normalize $location.file paths to POSIX forward slashes.\n  // The CDS compiler on Windows produces backslash paths (e.g. \"srv\\\\service1.cds\")\n  // but CodeQL libraries expect forward slashes (e.g. \"srv/service1.cds\").\n  normalizeLocationPathsInFile(projectJsonOutPath);\n\n  return {\n    success: true,\n    outputPath: projectJsonOutPath,\n    compiledAsProject: true,\n    message: 'Project was compiled using project-aware compilation',\n  };\n}\n\n/**\n * Creates spawn options for CDS compilation processes.\n * CRITICAL: Always sets cwd to project base directory to ensure generated JSON paths are relative to project base directory.\n *\n * @param projectBaseDir The project base directory (where package.json is located) - used as cwd for all spawned processes\n * @param cdsCommand The CDS command to determine if we need Node.js environment setup\n * @param cacheDir Optional cache directory for dependencies\n * @returns Spawn options configured for CDS compilation\n */\nfunction createSpawnOptions(\n  projectBaseDir: string,\n  cdsCommand: string,\n  cacheDir?: string,\n): SpawnSyncOptions {\n  // Check if we're using a direct binary path (contains node_modules/.bin/ or node_modules\\.bin\\) or npx-style command\n  // Check both platform-native separator and forward slash for cross-platform compatibility\n  const binPathNative = `node_modules${sep}.bin${sep}`;\n  const binPathPosix = 'node_modules/.bin/';\n  const isDirectBinary = cdsCommand.includes(binPathNative) || cdsCommand.includes(binPathPosix);\n\n  // Only enable shell on Windows for npx-style commands where .cmd resolution is needed.\n  // Direct binary paths (node_modules/.bin/cds) don't need shell on any platform.\n  const useShell = getPlatformInfo().isWindows && !isDirectBinary;\n\n  const spawnOptions: SpawnSyncOptions = {\n    cwd: projectBaseDir, // CRITICAL: Always use project base directory as cwd to ensure correct path generation\n    shell: useShell,\n    stdio: 'pipe',\n    env: { ...process.env },\n  };\n\n  // Only set up Node.js environment for npx-style commands, not for direct binary execution\n  if (cacheDir && !isDirectBinary) {\n    const nodePath = join(cacheDir, 'node_modules');\n\n    // Set up environment to use the cached dependencies\n    spawnOptions.env = {\n      ...process.env,\n      NODE_PATH: `${nodePath}${delimiter}${process.env.NODE_PATH ?? ''}`,\n      PATH: `${join(nodePath, '.bin')}${delimiter}${process.env.PATH}`,\n      // Add NPM configuration to ensure dependencies are resolved from the cache directory\n      npm_config_prefix: cacheDir,\n      // Ensure we don't pick up global CDS installations that might conflict\n      npm_config_global: 'false',\n      // Clear any existing CDS environment variables that might interfere\n      CDS_HOME: cacheDir,\n    };\n  } else if (isDirectBinary) {\n    // For direct binary execution, use minimal environment to avoid conflicts\n    // Remove Node.js-specific environment variables that might interfere\n    const cleanEnv = { ...process.env };\n    delete cleanEnv.NODE_PATH;\n    delete cleanEnv.npm_config_prefix;\n    delete cleanEnv.npm_config_global;\n    delete cleanEnv.CDS_HOME;\n\n    spawnOptions.env = cleanEnv;\n  }\n\n  return spawnOptions;\n}\n", "import { spawnSync, SpawnSyncOptions } from 'child_process';\nimport { join, delimiter } from 'path';\n\n/**\n * Get the CDS compiler version from a specific command or cache directory.\n * @param cdsCommand The CDS command to use.\n * @param cacheDir Optional path to a directory containing installed dependencies.\n * @returns The CDS compiler version string, or undefined if it couldn't be determined.\n */\nexport function getCdsVersion(cdsCommand: string, cacheDir?: string): string | undefined {\n  try {\n    // Set up environment vars if using a cache directory\n    const spawnOptions: SpawnSyncOptions = {\n      shell: true,\n      stdio: 'pipe',\n      env: { ...process.env },\n    };\n\n    // If a cache directory is provided, set NODE_PATH to use that cache\n    if (cacheDir) {\n      const nodePath = join(cacheDir, 'node_modules');\n\n      // Set up environment to use the cached dependencies\n      spawnOptions.env = {\n        ...process.env,\n        NODE_PATH: `${nodePath}${delimiter}${process.env.NODE_PATH ?? ''}`,\n        PATH: `${join(nodePath, '.bin')}${delimiter}${process.env.PATH}`,\n        npm_config_prefix: cacheDir,\n      };\n    }\n\n    // Execute the CDS command with the --version flag\n    // When shell: true is used, concatenate command and args to avoid DEP0190 deprecation warning\n    const result = spawnSync(`${cdsCommand} --version`, spawnOptions);\n    if (result.status === 0 && result.stdout) {\n      const versionOutput = result.stdout.toString().trim();\n      // Extract version number, which is typically in formats like \"@sap/cds: 6.1.3\" or similar\n      const match = versionOutput.match(/@sap\\/cds[^0-9]*([0-9]+\\.[0-9]+\\.[0-9]+)/);\n      if (match?.[1]) {\n        return match[1]; // Return just the version number\n      }\n      return versionOutput; // Return full output if we couldn't parse it\n    }\n    return undefined;\n  } catch {\n    return undefined;\n  }\n}\n", "import { execFileSync } from 'child_process';\nimport { existsSync } from 'fs';\nimport { arch, platform } from 'os';\nimport { join, resolve } from 'path';\n\nimport { cdsExtractorMarkerFileName } from './constants';\nimport { dirExists } from './filesystem';\nimport { cdsExtractorLog } from './logging';\nimport { getPathsIgnorePatterns } from './paths-ignore';\n\n/**\n * Interface for platform information\n */\nexport interface PlatformInfo {\n  platform: string;\n  arch: string;\n  isWindows: boolean;\n  exeExtension: string;\n}\n\n/**\n * Interface for environment validation results\n */\nexport interface EnvironmentSetupResult {\n  success: boolean;\n  errorMessages: string[];\n  codeqlExePath: string;\n  jsExtractorRoot: string;\n  autobuildScriptPath: string;\n  platformInfo: PlatformInfo;\n}\n\n/**\n * Get platform information\n * @returns Platform information including OS platform, architecture, and whether it's Windows\n */\nexport function getPlatformInfo(): PlatformInfo {\n  const osPlatform: string = platform();\n  const osPlatformArch: string = arch();\n  const isWindows = osPlatform === 'win32';\n  const exeExtension = isWindows ? '.exe' : '';\n\n  return {\n    platform: osPlatform,\n    arch: osPlatformArch,\n    isWindows,\n    exeExtension,\n  };\n}\n\n/**\n * Returns the platform-specific `npm` executable name.\n * On Windows, npm is a `.cmd` script that requires the full name for\n * `execFileSync`/`spawnSync` when `shell` is `false`.\n *\n * @returns `'npm.cmd'` on Windows, `'npm'` elsewhere.\n */\nexport function npmExecutable(): string {\n  return getPlatformInfo().isWindows ? 'npm.cmd' : 'npm';\n}\n\n/**\n * Returns the platform-specific `npx` executable name.\n * On Windows, npx is a `.cmd` script that requires the full name for\n * `execFileSync`/`spawnSync` when `shell` is `false`.\n *\n * @returns `'npx.cmd'` on Windows, `'npx'` elsewhere.\n */\nexport function npxExecutable(): string {\n  return getPlatformInfo().isWindows ? 'npx.cmd' : 'npx';\n}\n\n/**\n * Get the path to the CodeQL executable.\n * Prioritizes CODEQL_DIST if set and valid. Otherwise, tries to find CodeQL via system PATH.\n * @returns The resolved path to the CodeQL executable, or an empty string if not found.\n */\nexport function getCodeQLExePath(): string {\n  const platformInfo = getPlatformInfo();\n  const codeqlExeName: string = platformInfo.isWindows ? 'codeql.exe' : 'codeql';\n\n  // First, check if CODEQL_DIST is set and valid\n  const codeqlDist = process.env.CODEQL_DIST;\n  if (codeqlDist) {\n    const codeqlPathFromDist = resolve(join(codeqlDist, codeqlExeName));\n    if (existsSync(codeqlPathFromDist)) {\n      cdsExtractorLog('info', `Using CodeQL executable from CODEQL_DIST: ${codeqlPathFromDist}`);\n      return codeqlPathFromDist;\n    } else {\n      cdsExtractorLog(\n        'error',\n        `CODEQL_DIST is set to '${codeqlDist}', but CodeQL executable was not found at '${codeqlPathFromDist}'. Please ensure this path is correct. Falling back to PATH-based discovery.`,\n      );\n      // Fall through to PATH-based discovery\n    }\n  }\n\n  // CODEQL_DIST is not set or was invalid, attempt to find CodeQL via system PATH using 'codeql version --format=json'\n  cdsExtractorLog(\n    'info',\n    'CODEQL_DIST environment variable not set or invalid. Attempting to find CodeQL executable via system PATH using \"codeql version --format=json\".',\n  );\n  try {\n    const versionOutput = execFileSync(codeqlExeName, ['version', '--format=json'], {\n      encoding: 'utf8',\n      timeout: 5000, // 5 seconds timeout\n      stdio: 'pipe', // Suppress output to console\n    });\n\n    interface CodeQLVersionInfo {\n      unpackedLocation?: string;\n      cliVersion?: string; // For potential future use or richer logging\n    }\n\n    try {\n      const versionInfo = JSON.parse(versionOutput) as CodeQLVersionInfo;\n\n      if (\n        versionInfo &&\n        typeof versionInfo.unpackedLocation === 'string' &&\n        versionInfo.unpackedLocation\n      ) {\n        const resolvedPathFromVersion = resolve(join(versionInfo.unpackedLocation, codeqlExeName));\n        if (existsSync(resolvedPathFromVersion)) {\n          cdsExtractorLog(\n            'info',\n            `CodeQL executable found via 'codeql version --format=json' at: ${resolvedPathFromVersion}`,\n          );\n          return resolvedPathFromVersion;\n        }\n        cdsExtractorLog(\n          'warn',\n          `'codeql version --format=json' provided unpackedLocation '${versionInfo.unpackedLocation}', but executable not found at '${resolvedPathFromVersion}'.`,\n        );\n      } else {\n        cdsExtractorLog(\n          'warn',\n          \"Could not determine CodeQL executable path from 'codeql version --format=json' output. 'unpackedLocation' field missing, empty, or invalid.\",\n        );\n      }\n    } catch (parseError) {\n      cdsExtractorLog(\n        'warn',\n        `Failed to parse 'codeql version --format=json' output: ${String(parseError)}. Output was: ${versionOutput}`,\n      );\n    }\n  } catch (error) {\n    let errorMessage = `INFO: Failed to find CodeQL executable via 'codeql version --format=json'. Error: ${String(error)}`;\n    if (error && typeof error === 'object' && 'code' in error && error.code === 'ENOENT') {\n      errorMessage += `\\nINFO: The command '${codeqlExeName}' was not found in your system PATH.`;\n    }\n    cdsExtractorLog('info', errorMessage);\n  }\n\n  cdsExtractorLog(\n    'error',\n    'Failed to determine CodeQL executable path. Please ensure the CODEQL_DIST environment variable is set and points to a valid CodeQL distribution, or that the CodeQL CLI (codeql) is available in your system PATH and \"codeql version --format=json\" can provide its location.',\n  );\n  return ''; // Return empty string if all attempts fail\n}\n\n/**\n * Get the JavaScript extractor root path.\n * @param codeqlExePath The path to the CodeQL executable. If empty, resolution will be skipped.\n * @returns The JavaScript extractor root path, or an empty string if not found or if codeqlExePath is empty.\n */\nexport function getJavaScriptExtractorRoot(codeqlExePath: string): string {\n  let jsExtractorRoot = process.env.CODEQL_EXTRACTOR_JAVASCRIPT_ROOT ?? '';\n\n  if (jsExtractorRoot) {\n    cdsExtractorLog(\n      'info',\n      `Using JavaScript extractor root from environment variable CODEQL_EXTRACTOR_JAVASCRIPT_ROOT: ${jsExtractorRoot}`,\n    );\n    return jsExtractorRoot;\n  }\n\n  if (!codeqlExePath) {\n    cdsExtractorLog(\n      'warn',\n      'Cannot resolve JavaScript extractor root because the CodeQL executable path was not provided or found.',\n    );\n    return '';\n  }\n\n  try {\n    jsExtractorRoot = execFileSync(\n      codeqlExePath,\n      ['resolve', 'extractor', '--language=javascript'],\n      { stdio: 'pipe' }, // Suppress output from the command itself\n    )\n      .toString()\n      .trim();\n    if (jsExtractorRoot) {\n      cdsExtractorLog('info', `JavaScript extractor root resolved to: ${jsExtractorRoot}`);\n    } else {\n      cdsExtractorLog(\n        'warn',\n        `'codeql resolve extractor --language=javascript' using '${codeqlExePath}' returned an empty path.`,\n      );\n    }\n  } catch (error) {\n    cdsExtractorLog(\n      'error',\n      `Error resolving JavaScript extractor root using '${codeqlExePath}': ${String(error)}`,\n    );\n    jsExtractorRoot = ''; // Ensure it's empty on error\n  }\n  return jsExtractorRoot;\n}\n\n/**\n * Set JavaScript extractor environment variables using CDS extractor variables\n */\nexport function setupJavaScriptExtractorEnv(): void {\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_WIP_DATABASE =\n    process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_DIAGNOSTIC_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_DIAGNOSTIC_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_LOG_DIR = process.env.CODEQL_EXTRACTOR_CDS_LOG_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_SCRATCH_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_SCRATCH_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_TRAP_DIR = process.env.CODEQL_EXTRACTOR_CDS_TRAP_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_SOURCE_ARCHIVE_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_SOURCE_ARCHIVE_DIR;\n}\n\n/**\n * Get the path to the autobuild script\n * @param jsExtractorRoot The JavaScript extractor root path\n * @returns The path to the autobuild script, or an empty string if jsExtractorRoot is empty.\n */\nexport function getAutobuildScriptPath(jsExtractorRoot: string): string {\n  if (!jsExtractorRoot) return '';\n  const platformInfo = getPlatformInfo();\n  const autobuildScriptName: string = platformInfo.isWindows ? 'autobuild.cmd' : 'autobuild.sh';\n  return resolve(join(jsExtractorRoot, 'tools', autobuildScriptName));\n}\n\n/**\n * Configure LGTM index filters for CDS files\n */\nexport function configureLgtmIndexFilters(): void {\n  let excludeFilters = '';\n\n  if (process.env.LGTM_INDEX_FILTERS) {\n    cdsExtractorLog(\n      'info',\n      `Found $LGTM_INDEX_FILTERS already set to:\n${process.env.LGTM_INDEX_FILTERS}`,\n    );\n    // Use forward slashes explicitly \u2014 join() uses backslashes on Windows\n    // which causes 'Illegal use of **' errors in the JS extractor.\n    const allowedExcludePatterns = ['exclude:**/*', 'exclude:**/*.*'];\n\n    excludeFilters =\n      '\\n' +\n      process.env.LGTM_INDEX_FILTERS.split('\\n')\n        .filter(\n          line =>\n            line.startsWith('exclude') &&\n            !allowedExcludePatterns.some(pattern => line.includes(pattern)),\n        )\n        .join('\\n');\n  }\n\n  // Enable extraction of the .cds.json files only.\n  //\n  // The cdsExtractorMarkerFileName file is auto-created by the CDS extractor in order\n  // to force the underlying JS extractor to see at least one .js file, which became a\n  // requirement starting with v2.23.5 of the CodeQL CLI.\n  // Use forward slashes explicitly \u2014 join() uses backslashes on Windows\n  // which causes 'Illegal use of **' errors in the JS extractor.\n  const lgtmIndexFiltersPatterns = [\n    'exclude:**/*.*',\n    'include:**/*.cds.json',\n    'include:**/*.cds',\n    `include:**/${cdsExtractorMarkerFileName}`,\n    'exclude:**/node_modules/**/*.*',\n  ].join('\\n');\n\n  process.env.LGTM_INDEX_FILTERS = lgtmIndexFiltersPatterns + excludeFilters;\n  process.env.LGTM_INDEX_TYPESCRIPT = 'NONE';\n  // Configure to copy over the .cds files as well, by pretending they are JSON.\n  process.env.LGTM_INDEX_FILETYPES = '.cds:JSON';\n}\n\n/**\n * Applies paths-ignore patterns from the CodeQL configuration to the\n * LGTM_INDEX_FILTERS environment variable. This ensures the JavaScript\n * extractor also respects the user's paths-ignore configuration for\n * compiled .cds.json output files.\n *\n * @param sourceRoot - The source root directory used to locate the config file\n */\nexport function applyPathsIgnoreToLgtmFilters(sourceRoot: string): void {\n  const patterns = getPathsIgnorePatterns(sourceRoot);\n  if (patterns.length === 0) {\n    return;\n  }\n\n  const excludeLines = patterns.map(p => `exclude:${p}`).join('\\n');\n  const current = process.env.LGTM_INDEX_FILTERS ?? '';\n  process.env.LGTM_INDEX_FILTERS = current + '\\n' + excludeLines;\n\n  cdsExtractorLog(\n    'info',\n    `Applied ${patterns.length} paths-ignore pattern(s) to LGTM_INDEX_FILTERS`,\n  );\n}\n\n/**\n * Sets up the environment and validates key components for running the CDS extractor.\n * This includes checking for the CodeQL executable, validating the source root directory,\n * and setting up environment variables for the JavaScript extractor.\n *\n * @param sourceRoot The source root directory.\n *\n * @returns The {@link EnvironmentSetupResult} containing success status, error messages,\n *          CodeQL executable path, JavaScript extractor root, autobuild script path,\n *          and platform information.\n *\n * @throws Will throw an error if the environment setup fails.\n */\nexport function setupAndValidateEnvironment(sourceRoot: string): EnvironmentSetupResult {\n  const errorMessages: string[] = [];\n  const platformInfo = getPlatformInfo();\n\n  // Get the CodeQL executable path\n  const codeqlExePath = getCodeQLExePath();\n  if (!codeqlExePath) {\n    errorMessages.push(\n      'Failed to find CodeQL executable. Ensure CODEQL_DIST is set and valid, or CodeQL CLI is in PATH.',\n    );\n  }\n\n  // Validate that the required source root directory exists\n  if (!dirExists(sourceRoot)) {\n    errorMessages.push(`Project root directory '${sourceRoot}' does not exist.`);\n  }\n\n  // Get JavaScript extractor root\n  const jsExtractorRoot = getJavaScriptExtractorRoot(codeqlExePath);\n  if (!jsExtractorRoot) {\n    if (codeqlExePath) {\n      // Only add this error if codeqlExePath was found but JS extractor root wasn't\n      errorMessages.push(\n        'Failed to determine JavaScript extractor root using the found CodeQL executable.',\n      );\n    } else {\n      // If codeqlExePath is empty, the error from getCodeQLExePath is usually sufficient.\n      // However, we can add a more specific one if needed.\n      errorMessages.push(\n        'Cannot determine JavaScript extractor root because CodeQL executable was not found.',\n      );\n    }\n  }\n\n  // Set environment variables for JavaScript extractor only if jsExtractorRoot is valid\n  if (jsExtractorRoot) {\n    process.env.CODEQL_EXTRACTOR_JAVASCRIPT_ROOT = jsExtractorRoot;\n    setupJavaScriptExtractorEnv();\n  }\n\n  // Get autobuild script path\n  const autobuildScriptPath = jsExtractorRoot ? getAutobuildScriptPath(jsExtractorRoot) : '';\n  // Not having an autobuild script path might be an error depending on the run mode,\n  // but for now, the function just returns what it found.\n\n  return {\n    success: errorMessages.length === 0,\n    errorMessages,\n    codeqlExePath, // Will be '' if not found\n    jsExtractorRoot, // Will be '' if not found\n    autobuildScriptPath,\n    platformInfo,\n  };\n}\n", "import { existsSync, readFileSync } from 'fs';\nimport { join, relative, resolve } from 'path';\n\nimport { load as yamlLoad } from 'js-yaml';\nimport { minimatch } from 'minimatch';\n\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Well-known paths where a CodeQL configuration file may be located,\n * relative to the source root directory. Checked in order of priority.\n */\nconst DEFAULT_CONFIG_RELATIVE_PATHS = [\n  '.github/codeql/codeql-config.yml',\n  '.github/codeql/codeql-config.yaml',\n];\n\n/**\n * Cache for parsed paths-ignore patterns, keyed by source root.\n * Avoids re-reading and re-parsing the config file on every call.\n */\nconst patternsCache = new Map<string, string[]>();\n\n/**\n * Shape of the subset of a CodeQL configuration file that we care about.\n */\ninterface CodeqlConfig {\n  'paths-ignore'?: string[];\n}\n\n/**\n * Finds the CodeQL configuration file in the source root directory.\n *\n * When the `CODEQL_CONFIG_PATH` environment variable is set, its value\n * is treated as a path (relative to `sourceRoot`) to the config file.\n * The resolved path must reside under `sourceRoot`; otherwise it is\n * rejected to prevent path-traversal issues.\n *\n * When the environment variable is not set, the well-known default\n * paths are checked in order.\n *\n * @param sourceRoot - The source root directory\n * @returns The absolute path to the config file, or undefined if not found\n */\nexport function findCodeqlConfigFile(sourceRoot: string): string | undefined {\n  const envConfigPath = process.env.CODEQL_CONFIG_PATH;\n  if (envConfigPath) {\n    const resolvedRoot = resolve(sourceRoot);\n    const fullPath = resolve(resolvedRoot, envConfigPath);\n    const rel = relative(resolvedRoot, fullPath);\n    if (rel.startsWith('..') || resolve(resolvedRoot, rel) !== fullPath) {\n      cdsExtractorLog(\n        'warn',\n        `CODEQL_CONFIG_PATH '${envConfigPath}' resolves outside the source root. Ignoring.`,\n      );\n      return undefined;\n    }\n    if (existsSync(fullPath)) {\n      cdsExtractorLog('info', `Using CodeQL config file from CODEQL_CONFIG_PATH: ${fullPath}`);\n      return fullPath;\n    }\n    cdsExtractorLog(\n      'warn',\n      `CODEQL_CONFIG_PATH is set to '${envConfigPath}', but no file exists at '${fullPath}'.`,\n    );\n    return undefined;\n  }\n\n  for (const configPath of DEFAULT_CONFIG_RELATIVE_PATHS) {\n    const fullPath = join(sourceRoot, configPath);\n    if (existsSync(fullPath)) {\n      return fullPath;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Reads the CodeQL configuration file and extracts the `paths-ignore`\n * patterns list.\n *\n * @param sourceRoot - The source root directory\n * @returns Array of paths-ignore glob patterns, or empty array if none\n */\nexport function getPathsIgnorePatterns(sourceRoot: string): string[] {\n  const cached = patternsCache.get(sourceRoot);\n  if (cached !== undefined) {\n    return cached;\n  }\n\n  const configPath = findCodeqlConfigFile(sourceRoot);\n  if (!configPath) {\n    patternsCache.set(sourceRoot, []);\n    return [];\n  }\n\n  try {\n    const content = readFileSync(configPath, 'utf8');\n    const config = yamlLoad(content) as CodeqlConfig | null;\n\n    if (!config || !Array.isArray(config['paths-ignore'])) {\n      patternsCache.set(sourceRoot, []);\n      return [];\n    }\n\n    const patterns = config['paths-ignore'].filter(\n      (p): p is string => typeof p === 'string' && p.length > 0,\n    );\n\n    if (patterns.length > 0) {\n      cdsExtractorLog(\n        'info',\n        `Found ${patterns.length} paths-ignore pattern(s) in ${configPath}: ${patterns.join(', ')}`,\n      );\n    }\n\n    patternsCache.set(sourceRoot, patterns);\n    return patterns;\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to read CodeQL config file at ${configPath}: ${String(error)}`);\n    patternsCache.set(sourceRoot, []);\n    return [];\n  }\n}\n\n/**\n * Tests whether a single relative file path matches any of the given\n * paths-ignore patterns.\n *\n * Pattern matching follows the CodeQL `paths-ignore` semantics:\n *  - A bare directory name `vendor` matches anything under `vendor/`\n *  - `**` matches across directory boundaries\n *  - `*` matches within a single path segment\n *\n * @param relativePath - File path relative to the source root\n * @param patterns     - Array of paths-ignore glob patterns\n * @returns true if the path should be ignored\n */\nexport function shouldIgnorePath(relativePath: string, patterns: string[]): boolean {\n  const matchOptions = { dot: true, windowsPathsNoEscape: true };\n\n  for (const raw of patterns) {\n    // Strip trailing slashes so `vendor/` is treated the same as `vendor`\n    const pattern = raw.replace(/\\/+$/, '');\n\n    // Direct minimatch check\n    if (minimatch(relativePath, pattern, matchOptions)) {\n      return true;\n    }\n\n    // Also match as a directory prefix: pattern `vendor` should\n    // match `vendor/lib/foo.cds` (i.e. anything nested underneath).\n    if (minimatch(relativePath, `${pattern}/**`, matchOptions)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Filters a list of relative file paths, removing any that match the\n * given paths-ignore patterns.\n *\n * @param relativePaths - File paths relative to the source root\n * @param patterns      - Array of paths-ignore glob patterns\n * @returns Filtered list of paths that do NOT match any ignore pattern\n */\nexport function filterIgnoredPaths(relativePaths: string[], patterns: string[]): string[] {\n  if (patterns.length === 0) {\n    return relativePaths;\n  }\n  return relativePaths.filter(p => !shouldIgnorePath(p, patterns));\n}\n\n/**\n * Clears the internal patterns cache. Intended for testing only.\n */\nexport function clearPathsIgnoreCache(): void {\n  patternsCache.clear();\n}\n", "\n/*! js-yaml 4.1.1 https://github.com/nodeca/js-yaml @license MIT */\nfunction isNothing(subject) {\n  return (typeof subject === 'undefined') || (subject === null);\n}\n\n\nfunction isObject(subject) {\n  return (typeof subject === 'object') && (subject !== null);\n}\n\n\nfunction toArray(sequence) {\n  if (Array.isArray(sequence)) return sequence;\n  else if (isNothing(sequence)) return [];\n\n  return [ sequence ];\n}\n\n\nfunction extend(target, source) {\n  var index, length, key, sourceKeys;\n\n  if (source) {\n    sourceKeys = Object.keys(source);\n\n    for (index = 0, length = sourceKeys.length; index < length; index += 1) {\n      key = sourceKeys[index];\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}\n\n\nfunction repeat(string, count) {\n  var result = '', cycle;\n\n  for (cycle = 0; cycle < count; cycle += 1) {\n    result += string;\n  }\n\n  return result;\n}\n\n\nfunction isNegativeZero(number) {\n  return (number === 0) && (Number.NEGATIVE_INFINITY === 1 / number);\n}\n\n\nvar isNothing_1      = isNothing;\nvar isObject_1       = isObject;\nvar toArray_1        = toArray;\nvar repeat_1         = repeat;\nvar isNegativeZero_1 = isNegativeZero;\nvar extend_1         = extend;\n\nvar common = {\n\tisNothing: isNothing_1,\n\tisObject: isObject_1,\n\ttoArray: toArray_1,\n\trepeat: repeat_1,\n\tisNegativeZero: isNegativeZero_1,\n\textend: extend_1\n};\n\n// YAML error class. http://stackoverflow.com/questions/8458984\n\n\nfunction formatError(exception, compact) {\n  var where = '', message = exception.reason || '(unknown reason)';\n\n  if (!exception.mark) return message;\n\n  if (exception.mark.name) {\n    where += 'in \"' + exception.mark.name + '\" ';\n  }\n\n  where += '(' + (exception.mark.line + 1) + ':' + (exception.mark.column + 1) + ')';\n\n  if (!compact && exception.mark.snippet) {\n    where += '\\n\\n' + exception.mark.snippet;\n  }\n\n  return message + ' ' + where;\n}\n\n\nfunction YAMLException$1(reason, mark) {\n  // Super constructor\n  Error.call(this);\n\n  this.name = 'YAMLException';\n  this.reason = reason;\n  this.mark = mark;\n  this.message = formatError(this, false);\n\n  // Include stack trace in error object\n  if (Error.captureStackTrace) {\n    // Chrome and NodeJS\n    Error.captureStackTrace(this, this.constructor);\n  } else {\n    // FF, IE 10+ and Safari 6+. Fallback for others\n    this.stack = (new Error()).stack || '';\n  }\n}\n\n\n// Inherit from Error\nYAMLException$1.prototype = Object.create(Error.prototype);\nYAMLException$1.prototype.constructor = YAMLException$1;\n\n\nYAMLException$1.prototype.toString = function toString(compact) {\n  return this.name + ': ' + formatError(this, compact);\n};\n\n\nvar exception = YAMLException$1;\n\n// get snippet for a single line, respecting maxLength\nfunction getLine(buffer, lineStart, lineEnd, position, maxLineLength) {\n  var head = '';\n  var tail = '';\n  var maxHalfLength = Math.floor(maxLineLength / 2) - 1;\n\n  if (position - lineStart > maxHalfLength) {\n    head = ' ... ';\n    lineStart = position - maxHalfLength + head.length;\n  }\n\n  if (lineEnd - position > maxHalfLength) {\n    tail = ' ...';\n    lineEnd = position + maxHalfLength - tail.length;\n  }\n\n  return {\n    str: head + buffer.slice(lineStart, lineEnd).replace(/\\t/g, '\u2192') + tail,\n    pos: position - lineStart + head.length // relative position\n  };\n}\n\n\nfunction padStart(string, max) {\n  return common.repeat(' ', max - string.length) + string;\n}\n\n\nfunction makeSnippet(mark, options) {\n  options = Object.create(options || null);\n\n  if (!mark.buffer) return null;\n\n  if (!options.maxLength) options.maxLength = 79;\n  if (typeof options.indent      !== 'number') options.indent      = 1;\n  if (typeof options.linesBefore !== 'number') options.linesBefore = 3;\n  if (typeof options.linesAfter  !== 'number') options.linesAfter  = 2;\n\n  var re = /\\r?\\n|\\r|\\0/g;\n  var lineStarts = [ 0 ];\n  var lineEnds = [];\n  var match;\n  var foundLineNo = -1;\n\n  while ((match = re.exec(mark.buffer))) {\n    lineEnds.push(match.index);\n    lineStarts.push(match.index + match[0].length);\n\n    if (mark.position <= match.index && foundLineNo < 0) {\n      foundLineNo = lineStarts.length - 2;\n    }\n  }\n\n  if (foundLineNo < 0) foundLineNo = lineStarts.length - 1;\n\n  var result = '', i, line;\n  var lineNoLength = Math.min(mark.line + options.linesAfter, lineEnds.length).toString().length;\n  var maxLineLength = options.maxLength - (options.indent + lineNoLength + 3);\n\n  for (i = 1; i <= options.linesBefore; i++) {\n    if (foundLineNo - i < 0) break;\n    line = getLine(\n      mark.buffer,\n      lineStarts[foundLineNo - i],\n      lineEnds[foundLineNo - i],\n      mark.position - (lineStarts[foundLineNo] - lineStarts[foundLineNo - i]),\n      maxLineLength\n    );\n    result = common.repeat(' ', options.indent) + padStart((mark.line - i + 1).toString(), lineNoLength) +\n      ' | ' + line.str + '\\n' + result;\n  }\n\n  line = getLine(mark.buffer, lineStarts[foundLineNo], lineEnds[foundLineNo], mark.position, maxLineLength);\n  result += common.repeat(' ', options.indent) + padStart((mark.line + 1).toString(), lineNoLength) +\n    ' | ' + line.str + '\\n';\n  result += common.repeat('-', options.indent + lineNoLength + 3 + line.pos) + '^' + '\\n';\n\n  for (i = 1; i <= options.linesAfter; i++) {\n    if (foundLineNo + i >= lineEnds.length) break;\n    line = getLine(\n      mark.buffer,\n      lineStarts[foundLineNo + i],\n      lineEnds[foundLineNo + i],\n      mark.position - (lineStarts[foundLineNo] - lineStarts[foundLineNo + i]),\n      maxLineLength\n    );\n    result += common.repeat(' ', options.indent) + padStart((mark.line + i + 1).toString(), lineNoLength) +\n      ' | ' + line.str + '\\n';\n  }\n\n  return result.replace(/\\n$/, '');\n}\n\n\nvar snippet = makeSnippet;\n\nvar TYPE_CONSTRUCTOR_OPTIONS = [\n  'kind',\n  'multi',\n  'resolve',\n  'construct',\n  'instanceOf',\n  'predicate',\n  'represent',\n  'representName',\n  'defaultStyle',\n  'styleAliases'\n];\n\nvar YAML_NODE_KINDS = [\n  'scalar',\n  'sequence',\n  'mapping'\n];\n\nfunction compileStyleAliases(map) {\n  var result = {};\n\n  if (map !== null) {\n    Object.keys(map).forEach(function (style) {\n      map[style].forEach(function (alias) {\n        result[String(alias)] = style;\n      });\n    });\n  }\n\n  return result;\n}\n\nfunction Type$1(tag, options) {\n  options = options || {};\n\n  Object.keys(options).forEach(function (name) {\n    if (TYPE_CONSTRUCTOR_OPTIONS.indexOf(name) === -1) {\n      throw new exception('Unknown option \"' + name + '\" is met in definition of \"' + tag + '\" YAML type.');\n    }\n  });\n\n  // TODO: Add tag format check.\n  this.options       = options; // keep original options in case user wants to extend this type later\n  this.tag           = tag;\n  this.kind          = options['kind']          || null;\n  this.resolve       = options['resolve']       || function () { return true; };\n  this.construct     = options['construct']     || function (data) { return data; };\n  this.instanceOf    = options['instanceOf']    || null;\n  this.predicate     = options['predicate']     || null;\n  this.represent     = options['represent']     || null;\n  this.representName = options['representName'] || null;\n  this.defaultStyle  = options['defaultStyle']  || null;\n  this.multi         = options['multi']         || false;\n  this.styleAliases  = compileStyleAliases(options['styleAliases'] || null);\n\n  if (YAML_NODE_KINDS.indexOf(this.kind) === -1) {\n    throw new exception('Unknown kind \"' + this.kind + '\" is specified for \"' + tag + '\" YAML type.');\n  }\n}\n\nvar type = Type$1;\n\n/*eslint-disable max-len*/\n\n\n\n\n\nfunction compileList(schema, name) {\n  var result = [];\n\n  schema[name].forEach(function (currentType) {\n    var newIndex = result.length;\n\n    result.forEach(function (previousType, previousIndex) {\n      if (previousType.tag === currentType.tag &&\n          previousType.kind === currentType.kind &&\n          previousType.multi === currentType.multi) {\n\n        newIndex = previousIndex;\n      }\n    });\n\n    result[newIndex] = currentType;\n  });\n\n  return result;\n}\n\n\nfunction compileMap(/* lists... */) {\n  var result = {\n        scalar: {},\n        sequence: {},\n        mapping: {},\n        fallback: {},\n        multi: {\n          scalar: [],\n          sequence: [],\n          mapping: [],\n          fallback: []\n        }\n      }, index, length;\n\n  function collectType(type) {\n    if (type.multi) {\n      result.multi[type.kind].push(type);\n      result.multi['fallback'].push(type);\n    } else {\n      result[type.kind][type.tag] = result['fallback'][type.tag] = type;\n    }\n  }\n\n  for (index = 0, length = arguments.length; index < length; index += 1) {\n    arguments[index].forEach(collectType);\n  }\n  return result;\n}\n\n\nfunction Schema$1(definition) {\n  return this.extend(definition);\n}\n\n\nSchema$1.prototype.extend = function extend(definition) {\n  var implicit = [];\n  var explicit = [];\n\n  if (definition instanceof type) {\n    // Schema.extend(type)\n    explicit.push(definition);\n\n  } else if (Array.isArray(definition)) {\n    // Schema.extend([ type1, type2, ... ])\n    explicit = explicit.concat(definition);\n\n  } else if (definition && (Array.isArray(definition.implicit) || Array.isArray(definition.explicit))) {\n    // Schema.extend({ explicit: [ type1, type2, ... ], implicit: [ type1, type2, ... ] })\n    if (definition.implicit) implicit = implicit.concat(definition.implicit);\n    if (definition.explicit) explicit = explicit.concat(definition.explicit);\n\n  } else {\n    throw new exception('Schema.extend argument should be a Type, [ Type ], ' +\n      'or a schema definition ({ implicit: [...], explicit: [...] })');\n  }\n\n  implicit.forEach(function (type$1) {\n    if (!(type$1 instanceof type)) {\n      throw new exception('Specified list of YAML types (or a single Type object) contains a non-Type object.');\n    }\n\n    if (type$1.loadKind && type$1.loadKind !== 'scalar') {\n      throw new exception('There is a non-scalar type in the implicit list of a schema. Implicit resolving of such types is not supported.');\n    }\n\n    if (type$1.multi) {\n      throw new exception('There is a multi type in the implicit list of a schema. Multi tags can only be listed as explicit.');\n    }\n  });\n\n  explicit.forEach(function (type$1) {\n    if (!(type$1 instanceof type)) {\n      throw new exception('Specified list of YAML types (or a single Type object) contains a non-Type object.');\n    }\n  });\n\n  var result = Object.create(Schema$1.prototype);\n\n  result.implicit = (this.implicit || []).concat(implicit);\n  result.explicit = (this.explicit || []).concat(explicit);\n\n  result.compiledImplicit = compileList(result, 'implicit');\n  result.compiledExplicit = compileList(result, 'explicit');\n  result.compiledTypeMap  = compileMap(result.compiledImplicit, result.compiledExplicit);\n\n  return result;\n};\n\n\nvar schema = Schema$1;\n\nvar str = new type('tag:yaml.org,2002:str', {\n  kind: 'scalar',\n  construct: function (data) { return data !== null ? data : ''; }\n});\n\nvar seq = new type('tag:yaml.org,2002:seq', {\n  kind: 'sequence',\n  construct: function (data) { return data !== null ? data : []; }\n});\n\nvar map = new type('tag:yaml.org,2002:map', {\n  kind: 'mapping',\n  construct: function (data) { return data !== null ? data : {}; }\n});\n\nvar failsafe = new schema({\n  explicit: [\n    str,\n    seq,\n    map\n  ]\n});\n\nfunction resolveYamlNull(data) {\n  if (data === null) return true;\n\n  var max = data.length;\n\n  return (max === 1 && data === '~') ||\n         (max === 4 && (data === 'null' || data === 'Null' || data === 'NULL'));\n}\n\nfunction constructYamlNull() {\n  return null;\n}\n\nfunction isNull(object) {\n  return object === null;\n}\n\nvar _null = new type('tag:yaml.org,2002:null', {\n  kind: 'scalar',\n  resolve: resolveYamlNull,\n  construct: constructYamlNull,\n  predicate: isNull,\n  represent: {\n    canonical: function () { return '~';    },\n    lowercase: function () { return 'null'; },\n    uppercase: function () { return 'NULL'; },\n    camelcase: function () { return 'Null'; },\n    empty:     function () { return '';     }\n  },\n  defaultStyle: 'lowercase'\n});\n\nfunction resolveYamlBoolean(data) {\n  if (data === null) return false;\n\n  var max = data.length;\n\n  return (max === 4 && (data === 'true' || data === 'True' || data === 'TRUE')) ||\n         (max === 5 && (data === 'false' || data === 'False' || data === 'FALSE'));\n}\n\nfunction constructYamlBoolean(data) {\n  return data === 'true' ||\n         data === 'True' ||\n         data === 'TRUE';\n}\n\nfunction isBoolean(object) {\n  return Object.prototype.toString.call(object) === '[object Boolean]';\n}\n\nvar bool = new type('tag:yaml.org,2002:bool', {\n  kind: 'scalar',\n  resolve: resolveYamlBoolean,\n  construct: constructYamlBoolean,\n  predicate: isBoolean,\n  represent: {\n    lowercase: function (object) { return object ? 'true' : 'false'; },\n    uppercase: function (object) { return object ? 'TRUE' : 'FALSE'; },\n    camelcase: function (object) { return object ? 'True' : 'False'; }\n  },\n  defaultStyle: 'lowercase'\n});\n\nfunction isHexCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) ||\n         ((0x41/* A */ <= c) && (c <= 0x46/* F */)) ||\n         ((0x61/* a */ <= c) && (c <= 0x66/* f */));\n}\n\nfunction isOctCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x37/* 7 */));\n}\n\nfunction isDecCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */));\n}\n\nfunction resolveYamlInteger(data) {\n  if (data === null) return false;\n\n  var max = data.length,\n      index = 0,\n      hasDigits = false,\n      ch;\n\n  if (!max) return false;\n\n  ch = data[index];\n\n  // sign\n  if (ch === '-' || ch === '+') {\n    ch = data[++index];\n  }\n\n  if (ch === '0') {\n    // 0\n    if (index + 1 === max) return true;\n    ch = data[++index];\n\n    // base 2, base 8, base 16\n\n    if (ch === 'b') {\n      // base 2\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (ch !== '0' && ch !== '1') return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n\n\n    if (ch === 'x') {\n      // base 16\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (!isHexCode(data.charCodeAt(index))) return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n\n\n    if (ch === 'o') {\n      // base 8\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (!isOctCode(data.charCodeAt(index))) return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n  }\n\n  // base 10 (except 0)\n\n  // value should not start with `_`;\n  if (ch === '_') return false;\n\n  for (; index < max; index++) {\n    ch = data[index];\n    if (ch === '_') continue;\n    if (!isDecCode(data.charCodeAt(index))) {\n      return false;\n    }\n    hasDigits = true;\n  }\n\n  // Should have digits and should not end with `_`\n  if (!hasDigits || ch === '_') return false;\n\n  return true;\n}\n\nfunction constructYamlInteger(data) {\n  var value = data, sign = 1, ch;\n\n  if (value.indexOf('_') !== -1) {\n    value = value.replace(/_/g, '');\n  }\n\n  ch = value[0];\n\n  if (ch === '-' || ch === '+') {\n    if (ch === '-') sign = -1;\n    value = value.slice(1);\n    ch = value[0];\n  }\n\n  if (value === '0') return 0;\n\n  if (ch === '0') {\n    if (value[1] === 'b') return sign * parseInt(value.slice(2), 2);\n    if (value[1] === 'x') return sign * parseInt(value.slice(2), 16);\n    if (value[1] === 'o') return sign * parseInt(value.slice(2), 8);\n  }\n\n  return sign * parseInt(value, 10);\n}\n\nfunction isInteger(object) {\n  return (Object.prototype.toString.call(object)) === '[object Number]' &&\n         (object % 1 === 0 && !common.isNegativeZero(object));\n}\n\nvar int = new type('tag:yaml.org,2002:int', {\n  kind: 'scalar',\n  resolve: resolveYamlInteger,\n  construct: constructYamlInteger,\n  predicate: isInteger,\n  represent: {\n    binary:      function (obj) { return obj >= 0 ? '0b' + obj.toString(2) : '-0b' + obj.toString(2).slice(1); },\n    octal:       function (obj) { return obj >= 0 ? '0o'  + obj.toString(8) : '-0o'  + obj.toString(8).slice(1); },\n    decimal:     function (obj) { return obj.toString(10); },\n    /* eslint-disable max-len */\n    hexadecimal: function (obj) { return obj >= 0 ? '0x' + obj.toString(16).toUpperCase() :  '-0x' + obj.toString(16).toUpperCase().slice(1); }\n  },\n  defaultStyle: 'decimal',\n  styleAliases: {\n    binary:      [ 2,  'bin' ],\n    octal:       [ 8,  'oct' ],\n    decimal:     [ 10, 'dec' ],\n    hexadecimal: [ 16, 'hex' ]\n  }\n});\n\nvar YAML_FLOAT_PATTERN = new RegExp(\n  // 2.5e4, 2.5 and integers\n  '^(?:[-+]?(?:[0-9][0-9_]*)(?:\\\\.[0-9_]*)?(?:[eE][-+]?[0-9]+)?' +\n  // .2e4, .2\n  // special case, seems not from spec\n  '|\\\\.[0-9_]+(?:[eE][-+]?[0-9]+)?' +\n  // .inf\n  '|[-+]?\\\\.(?:inf|Inf|INF)' +\n  // .nan\n  '|\\\\.(?:nan|NaN|NAN))$');\n\nfunction resolveYamlFloat(data) {\n  if (data === null) return false;\n\n  if (!YAML_FLOAT_PATTERN.test(data) ||\n      // Quick hack to not allow integers end with `_`\n      // Probably should update regexp & check speed\n      data[data.length - 1] === '_') {\n    return false;\n  }\n\n  return true;\n}\n\nfunction constructYamlFloat(data) {\n  var value, sign;\n\n  value  = data.replace(/_/g, '').toLowerCase();\n  sign   = value[0] === '-' ? -1 : 1;\n\n  if ('+-'.indexOf(value[0]) >= 0) {\n    value = value.slice(1);\n  }\n\n  if (value === '.inf') {\n    return (sign === 1) ? Number.POSITIVE_INFINITY : Number.NEGATIVE_INFINITY;\n\n  } else if (value === '.nan') {\n    return NaN;\n  }\n  return sign * parseFloat(value, 10);\n}\n\n\nvar SCIENTIFIC_WITHOUT_DOT = /^[-+]?[0-9]+e/;\n\nfunction representYamlFloat(object, style) {\n  var res;\n\n  if (isNaN(object)) {\n    switch (style) {\n      case 'lowercase': return '.nan';\n      case 'uppercase': return '.NAN';\n      case 'camelcase': return '.NaN';\n    }\n  } else if (Number.POSITIVE_INFINITY === object) {\n    switch (style) {\n      case 'lowercase': return '.inf';\n      case 'uppercase': return '.INF';\n      case 'camelcase': return '.Inf';\n    }\n  } else if (Number.NEGATIVE_INFINITY === object) {\n    switch (style) {\n      case 'lowercase': return '-.inf';\n      case 'uppercase': return '-.INF';\n      case 'camelcase': return '-.Inf';\n    }\n  } else if (common.isNegativeZero(object)) {\n    return '-0.0';\n  }\n\n  res = object.toString(10);\n\n  // JS stringifier can build scientific format without dots: 5e-100,\n  // while YAML requres dot: 5.e-100. Fix it with simple hack\n\n  return SCIENTIFIC_WITHOUT_DOT.test(res) ? res.replace('e', '.e') : res;\n}\n\nfunction isFloat(object) {\n  return (Object.prototype.toString.call(object) === '[object Number]') &&\n         (object % 1 !== 0 || common.isNegativeZero(object));\n}\n\nvar float = new type('tag:yaml.org,2002:float', {\n  kind: 'scalar',\n  resolve: resolveYamlFloat,\n  construct: constructYamlFloat,\n  predicate: isFloat,\n  represent: representYamlFloat,\n  defaultStyle: 'lowercase'\n});\n\nvar json = failsafe.extend({\n  implicit: [\n    _null,\n    bool,\n    int,\n    float\n  ]\n});\n\nvar core = json;\n\nvar YAML_DATE_REGEXP = new RegExp(\n  '^([0-9][0-9][0-9][0-9])'          + // [1] year\n  '-([0-9][0-9])'                    + // [2] month\n  '-([0-9][0-9])$');                   // [3] day\n\nvar YAML_TIMESTAMP_REGEXP = new RegExp(\n  '^([0-9][0-9][0-9][0-9])'          + // [1] year\n  '-([0-9][0-9]?)'                   + // [2] month\n  '-([0-9][0-9]?)'                   + // [3] day\n  '(?:[Tt]|[ \\\\t]+)'                 + // ...\n  '([0-9][0-9]?)'                    + // [4] hour\n  ':([0-9][0-9])'                    + // [5] minute\n  ':([0-9][0-9])'                    + // [6] second\n  '(?:\\\\.([0-9]*))?'                 + // [7] fraction\n  '(?:[ \\\\t]*(Z|([-+])([0-9][0-9]?)' + // [8] tz [9] tz_sign [10] tz_hour\n  '(?::([0-9][0-9]))?))?$');           // [11] tz_minute\n\nfunction resolveYamlTimestamp(data) {\n  if (data === null) return false;\n  if (YAML_DATE_REGEXP.exec(data) !== null) return true;\n  if (YAML_TIMESTAMP_REGEXP.exec(data) !== null) return true;\n  return false;\n}\n\nfunction constructYamlTimestamp(data) {\n  var match, year, month, day, hour, minute, second, fraction = 0,\n      delta = null, tz_hour, tz_minute, date;\n\n  match = YAML_DATE_REGEXP.exec(data);\n  if (match === null) match = YAML_TIMESTAMP_REGEXP.exec(data);\n\n  if (match === null) throw new Error('Date resolve error');\n\n  // match: [1] year [2] month [3] day\n\n  year = +(match[1]);\n  month = +(match[2]) - 1; // JS month starts with 0\n  day = +(match[3]);\n\n  if (!match[4]) { // no hour\n    return new Date(Date.UTC(year, month, day));\n  }\n\n  // match: [4] hour [5] minute [6] second [7] fraction\n\n  hour = +(match[4]);\n  minute = +(match[5]);\n  second = +(match[6]);\n\n  if (match[7]) {\n    fraction = match[7].slice(0, 3);\n    while (fraction.length < 3) { // milli-seconds\n      fraction += '0';\n    }\n    fraction = +fraction;\n  }\n\n  // match: [8] tz [9] tz_sign [10] tz_hour [11] tz_minute\n\n  if (match[9]) {\n    tz_hour = +(match[10]);\n    tz_minute = +(match[11] || 0);\n    delta = (tz_hour * 60 + tz_minute) * 60000; // delta in mili-seconds\n    if (match[9] === '-') delta = -delta;\n  }\n\n  date = new Date(Date.UTC(year, month, day, hour, minute, second, fraction));\n\n  if (delta) date.setTime(date.getTime() - delta);\n\n  return date;\n}\n\nfunction representYamlTimestamp(object /*, style*/) {\n  return object.toISOString();\n}\n\nvar timestamp = new type('tag:yaml.org,2002:timestamp', {\n  kind: 'scalar',\n  resolve: resolveYamlTimestamp,\n  construct: constructYamlTimestamp,\n  instanceOf: Date,\n  represent: representYamlTimestamp\n});\n\nfunction resolveYamlMerge(data) {\n  return data === '<<' || data === null;\n}\n\nvar merge = new type('tag:yaml.org,2002:merge', {\n  kind: 'scalar',\n  resolve: resolveYamlMerge\n});\n\n/*eslint-disable no-bitwise*/\n\n\n\n\n\n// [ 64, 65, 66 ] -> [ padding, CR, LF ]\nvar BASE64_MAP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\\n\\r';\n\n\nfunction resolveYamlBinary(data) {\n  if (data === null) return false;\n\n  var code, idx, bitlen = 0, max = data.length, map = BASE64_MAP;\n\n  // Convert one by one.\n  for (idx = 0; idx < max; idx++) {\n    code = map.indexOf(data.charAt(idx));\n\n    // Skip CR/LF\n    if (code > 64) continue;\n\n    // Fail on illegal characters\n    if (code < 0) return false;\n\n    bitlen += 6;\n  }\n\n  // If there are any bits left, source was corrupted\n  return (bitlen % 8) === 0;\n}\n\nfunction constructYamlBinary(data) {\n  var idx, tailbits,\n      input = data.replace(/[\\r\\n=]/g, ''), // remove CR/LF & padding to simplify scan\n      max = input.length,\n      map = BASE64_MAP,\n      bits = 0,\n      result = [];\n\n  // Collect by 6*4 bits (3 bytes)\n\n  for (idx = 0; idx < max; idx++) {\n    if ((idx % 4 === 0) && idx) {\n      result.push((bits >> 16) & 0xFF);\n      result.push((bits >> 8) & 0xFF);\n      result.push(bits & 0xFF);\n    }\n\n    bits = (bits << 6) | map.indexOf(input.charAt(idx));\n  }\n\n  // Dump tail\n\n  tailbits = (max % 4) * 6;\n\n  if (tailbits === 0) {\n    result.push((bits >> 16) & 0xFF);\n    result.push((bits >> 8) & 0xFF);\n    result.push(bits & 0xFF);\n  } else if (tailbits === 18) {\n    result.push((bits >> 10) & 0xFF);\n    result.push((bits >> 2) & 0xFF);\n  } else if (tailbits === 12) {\n    result.push((bits >> 4) & 0xFF);\n  }\n\n  return new Uint8Array(result);\n}\n\nfunction representYamlBinary(object /*, style*/) {\n  var result = '', bits = 0, idx, tail,\n      max = object.length,\n      map = BASE64_MAP;\n\n  // Convert every three bytes to 4 ASCII characters.\n\n  for (idx = 0; idx < max; idx++) {\n    if ((idx % 3 === 0) && idx) {\n      result += map[(bits >> 18) & 0x3F];\n      result += map[(bits >> 12) & 0x3F];\n      result += map[(bits >> 6) & 0x3F];\n      result += map[bits & 0x3F];\n    }\n\n    bits = (bits << 8) + object[idx];\n  }\n\n  // Dump tail\n\n  tail = max % 3;\n\n  if (tail === 0) {\n    result += map[(bits >> 18) & 0x3F];\n    result += map[(bits >> 12) & 0x3F];\n    result += map[(bits >> 6) & 0x3F];\n    result += map[bits & 0x3F];\n  } else if (tail === 2) {\n    result += map[(bits >> 10) & 0x3F];\n    result += map[(bits >> 4) & 0x3F];\n    result += map[(bits << 2) & 0x3F];\n    result += map[64];\n  } else if (tail === 1) {\n    result += map[(bits >> 2) & 0x3F];\n    result += map[(bits << 4) & 0x3F];\n    result += map[64];\n    result += map[64];\n  }\n\n  return result;\n}\n\nfunction isBinary(obj) {\n  return Object.prototype.toString.call(obj) ===  '[object Uint8Array]';\n}\n\nvar binary = new type('tag:yaml.org,2002:binary', {\n  kind: 'scalar',\n  resolve: resolveYamlBinary,\n  construct: constructYamlBinary,\n  predicate: isBinary,\n  represent: representYamlBinary\n});\n\nvar _hasOwnProperty$3 = Object.prototype.hasOwnProperty;\nvar _toString$2       = Object.prototype.toString;\n\nfunction resolveYamlOmap(data) {\n  if (data === null) return true;\n\n  var objectKeys = [], index, length, pair, pairKey, pairHasKey,\n      object = data;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n    pairHasKey = false;\n\n    if (_toString$2.call(pair) !== '[object Object]') return false;\n\n    for (pairKey in pair) {\n      if (_hasOwnProperty$3.call(pair, pairKey)) {\n        if (!pairHasKey) pairHasKey = true;\n        else return false;\n      }\n    }\n\n    if (!pairHasKey) return false;\n\n    if (objectKeys.indexOf(pairKey) === -1) objectKeys.push(pairKey);\n    else return false;\n  }\n\n  return true;\n}\n\nfunction constructYamlOmap(data) {\n  return data !== null ? data : [];\n}\n\nvar omap = new type('tag:yaml.org,2002:omap', {\n  kind: 'sequence',\n  resolve: resolveYamlOmap,\n  construct: constructYamlOmap\n});\n\nvar _toString$1 = Object.prototype.toString;\n\nfunction resolveYamlPairs(data) {\n  if (data === null) return true;\n\n  var index, length, pair, keys, result,\n      object = data;\n\n  result = new Array(object.length);\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n\n    if (_toString$1.call(pair) !== '[object Object]') return false;\n\n    keys = Object.keys(pair);\n\n    if (keys.length !== 1) return false;\n\n    result[index] = [ keys[0], pair[keys[0]] ];\n  }\n\n  return true;\n}\n\nfunction constructYamlPairs(data) {\n  if (data === null) return [];\n\n  var index, length, pair, keys, result,\n      object = data;\n\n  result = new Array(object.length);\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n\n    keys = Object.keys(pair);\n\n    result[index] = [ keys[0], pair[keys[0]] ];\n  }\n\n  return result;\n}\n\nvar pairs = new type('tag:yaml.org,2002:pairs', {\n  kind: 'sequence',\n  resolve: resolveYamlPairs,\n  construct: constructYamlPairs\n});\n\nvar _hasOwnProperty$2 = Object.prototype.hasOwnProperty;\n\nfunction resolveYamlSet(data) {\n  if (data === null) return true;\n\n  var key, object = data;\n\n  for (key in object) {\n    if (_hasOwnProperty$2.call(object, key)) {\n      if (object[key] !== null) return false;\n    }\n  }\n\n  return true;\n}\n\nfunction constructYamlSet(data) {\n  return data !== null ? data : {};\n}\n\nvar set = new type('tag:yaml.org,2002:set', {\n  kind: 'mapping',\n  resolve: resolveYamlSet,\n  construct: constructYamlSet\n});\n\nvar _default = core.extend({\n  implicit: [\n    timestamp,\n    merge\n  ],\n  explicit: [\n    binary,\n    omap,\n    pairs,\n    set\n  ]\n});\n\n/*eslint-disable max-len,no-use-before-define*/\n\n\n\n\n\n\n\nvar _hasOwnProperty$1 = Object.prototype.hasOwnProperty;\n\n\nvar CONTEXT_FLOW_IN   = 1;\nvar CONTEXT_FLOW_OUT  = 2;\nvar CONTEXT_BLOCK_IN  = 3;\nvar CONTEXT_BLOCK_OUT = 4;\n\n\nvar CHOMPING_CLIP  = 1;\nvar CHOMPING_STRIP = 2;\nvar CHOMPING_KEEP  = 3;\n\n\nvar PATTERN_NON_PRINTABLE         = /[\\x00-\\x08\\x0B\\x0C\\x0E-\\x1F\\x7F-\\x84\\x86-\\x9F\\uFFFE\\uFFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/;\nvar PATTERN_NON_ASCII_LINE_BREAKS = /[\\x85\\u2028\\u2029]/;\nvar PATTERN_FLOW_INDICATORS       = /[,\\[\\]\\{\\}]/;\nvar PATTERN_TAG_HANDLE            = /^(?:!|!!|![a-z\\-]+!)$/i;\nvar PATTERN_TAG_URI               = /^(?:!|[^,\\[\\]\\{\\}])(?:%[0-9a-f]{2}|[0-9a-z\\-#;\\/\\?:@&=\\+\\$,_\\.!~\\*'\\(\\)\\[\\]])*$/i;\n\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\n\nfunction is_EOL(c) {\n  return (c === 0x0A/* LF */) || (c === 0x0D/* CR */);\n}\n\nfunction is_WHITE_SPACE(c) {\n  return (c === 0x09/* Tab */) || (c === 0x20/* Space */);\n}\n\nfunction is_WS_OR_EOL(c) {\n  return (c === 0x09/* Tab */) ||\n         (c === 0x20/* Space */) ||\n         (c === 0x0A/* LF */) ||\n         (c === 0x0D/* CR */);\n}\n\nfunction is_FLOW_INDICATOR(c) {\n  return c === 0x2C/* , */ ||\n         c === 0x5B/* [ */ ||\n         c === 0x5D/* ] */ ||\n         c === 0x7B/* { */ ||\n         c === 0x7D/* } */;\n}\n\nfunction fromHexCode(c) {\n  var lc;\n\n  if ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) {\n    return c - 0x30;\n  }\n\n  /*eslint-disable no-bitwise*/\n  lc = c | 0x20;\n\n  if ((0x61/* a */ <= lc) && (lc <= 0x66/* f */)) {\n    return lc - 0x61 + 10;\n  }\n\n  return -1;\n}\n\nfunction escapedHexLen(c) {\n  if (c === 0x78/* x */) { return 2; }\n  if (c === 0x75/* u */) { return 4; }\n  if (c === 0x55/* U */) { return 8; }\n  return 0;\n}\n\nfunction fromDecimalCode(c) {\n  if ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) {\n    return c - 0x30;\n  }\n\n  return -1;\n}\n\nfunction simpleEscapeSequence(c) {\n  /* eslint-disable indent */\n  return (c === 0x30/* 0 */) ? '\\x00' :\n        (c === 0x61/* a */) ? '\\x07' :\n        (c === 0x62/* b */) ? '\\x08' :\n        (c === 0x74/* t */) ? '\\x09' :\n        (c === 0x09/* Tab */) ? '\\x09' :\n        (c === 0x6E/* n */) ? '\\x0A' :\n        (c === 0x76/* v */) ? '\\x0B' :\n        (c === 0x66/* f */) ? '\\x0C' :\n        (c === 0x72/* r */) ? '\\x0D' :\n        (c === 0x65/* e */) ? '\\x1B' :\n        (c === 0x20/* Space */) ? ' ' :\n        (c === 0x22/* \" */) ? '\\x22' :\n        (c === 0x2F/* / */) ? '/' :\n        (c === 0x5C/* \\ */) ? '\\x5C' :\n        (c === 0x4E/* N */) ? '\\x85' :\n        (c === 0x5F/* _ */) ? '\\xA0' :\n        (c === 0x4C/* L */) ? '\\u2028' :\n        (c === 0x50/* P */) ? '\\u2029' : '';\n}\n\nfunction charFromCodepoint(c) {\n  if (c <= 0xFFFF) {\n    return String.fromCharCode(c);\n  }\n  // Encode UTF-16 surrogate pair\n  // https://en.wikipedia.org/wiki/UTF-16#Code_points_U.2B010000_to_U.2B10FFFF\n  return String.fromCharCode(\n    ((c - 0x010000) >> 10) + 0xD800,\n    ((c - 0x010000) & 0x03FF) + 0xDC00\n  );\n}\n\n// set a property of a literal object, while protecting against prototype pollution,\n// see https://github.com/nodeca/js-yaml/issues/164 for more details\nfunction setProperty(object, key, value) {\n  // used for this specific key only because Object.defineProperty is slow\n  if (key === '__proto__') {\n    Object.defineProperty(object, key, {\n      configurable: true,\n      enumerable: true,\n      writable: true,\n      value: value\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nvar simpleEscapeCheck = new Array(256); // integer, for fast access\nvar simpleEscapeMap = new Array(256);\nfor (var i = 0; i < 256; i++) {\n  simpleEscapeCheck[i] = simpleEscapeSequence(i) ? 1 : 0;\n  simpleEscapeMap[i] = simpleEscapeSequence(i);\n}\n\n\nfunction State$1(input, options) {\n  this.input = input;\n\n  this.filename  = options['filename']  || null;\n  this.schema    = options['schema']    || _default;\n  this.onWarning = options['onWarning'] || null;\n  // (Hidden) Remove? makes the loader to expect YAML 1.1 documents\n  // if such documents have no explicit %YAML directive\n  this.legacy    = options['legacy']    || false;\n\n  this.json      = options['json']      || false;\n  this.listener  = options['listener']  || null;\n\n  this.implicitTypes = this.schema.compiledImplicit;\n  this.typeMap       = this.schema.compiledTypeMap;\n\n  this.length     = input.length;\n  this.position   = 0;\n  this.line       = 0;\n  this.lineStart  = 0;\n  this.lineIndent = 0;\n\n  // position of first leading tab in the current line,\n  // used to make sure there are no tabs in the indentation\n  this.firstTabInLine = -1;\n\n  this.documents = [];\n\n  /*\n  this.version;\n  this.checkLineBreaks;\n  this.tagMap;\n  this.anchorMap;\n  this.tag;\n  this.anchor;\n  this.kind;\n  this.result;*/\n\n}\n\n\nfunction generateError(state, message) {\n  var mark = {\n    name:     state.filename,\n    buffer:   state.input.slice(0, -1), // omit trailing \\0\n    position: state.position,\n    line:     state.line,\n    column:   state.position - state.lineStart\n  };\n\n  mark.snippet = snippet(mark);\n\n  return new exception(message, mark);\n}\n\nfunction throwError(state, message) {\n  throw generateError(state, message);\n}\n\nfunction throwWarning(state, message) {\n  if (state.onWarning) {\n    state.onWarning.call(null, generateError(state, message));\n  }\n}\n\n\nvar directiveHandlers = {\n\n  YAML: function handleYamlDirective(state, name, args) {\n\n    var match, major, minor;\n\n    if (state.version !== null) {\n      throwError(state, 'duplication of %YAML directive');\n    }\n\n    if (args.length !== 1) {\n      throwError(state, 'YAML directive accepts exactly one argument');\n    }\n\n    match = /^([0-9]+)\\.([0-9]+)$/.exec(args[0]);\n\n    if (match === null) {\n      throwError(state, 'ill-formed argument of the YAML directive');\n    }\n\n    major = parseInt(match[1], 10);\n    minor = parseInt(match[2], 10);\n\n    if (major !== 1) {\n      throwError(state, 'unacceptable YAML version of the document');\n    }\n\n    state.version = args[0];\n    state.checkLineBreaks = (minor < 2);\n\n    if (minor !== 1 && minor !== 2) {\n      throwWarning(state, 'unsupported YAML version of the document');\n    }\n  },\n\n  TAG: function handleTagDirective(state, name, args) {\n\n    var handle, prefix;\n\n    if (args.length !== 2) {\n      throwError(state, 'TAG directive accepts exactly two arguments');\n    }\n\n    handle = args[0];\n    prefix = args[1];\n\n    if (!PATTERN_TAG_HANDLE.test(handle)) {\n      throwError(state, 'ill-formed tag handle (first argument) of the TAG directive');\n    }\n\n    if (_hasOwnProperty$1.call(state.tagMap, handle)) {\n      throwError(state, 'there is a previously declared suffix for \"' + handle + '\" tag handle');\n    }\n\n    if (!PATTERN_TAG_URI.test(prefix)) {\n      throwError(state, 'ill-formed tag prefix (second argument) of the TAG directive');\n    }\n\n    try {\n      prefix = decodeURIComponent(prefix);\n    } catch (err) {\n      throwError(state, 'tag prefix is malformed: ' + prefix);\n    }\n\n    state.tagMap[handle] = prefix;\n  }\n};\n\n\nfunction captureSegment(state, start, end, checkJson) {\n  var _position, _length, _character, _result;\n\n  if (start < end) {\n    _result = state.input.slice(start, end);\n\n    if (checkJson) {\n      for (_position = 0, _length = _result.length; _position < _length; _position += 1) {\n        _character = _result.charCodeAt(_position);\n        if (!(_character === 0x09 ||\n              (0x20 <= _character && _character <= 0x10FFFF))) {\n          throwError(state, 'expected valid JSON character');\n        }\n      }\n    } else if (PATTERN_NON_PRINTABLE.test(_result)) {\n      throwError(state, 'the stream contains non-printable characters');\n    }\n\n    state.result += _result;\n  }\n}\n\nfunction mergeMappings(state, destination, source, overridableKeys) {\n  var sourceKeys, key, index, quantity;\n\n  if (!common.isObject(source)) {\n    throwError(state, 'cannot merge mappings; the provided source object is unacceptable');\n  }\n\n  sourceKeys = Object.keys(source);\n\n  for (index = 0, quantity = sourceKeys.length; index < quantity; index += 1) {\n    key = sourceKeys[index];\n\n    if (!_hasOwnProperty$1.call(destination, key)) {\n      setProperty(destination, key, source[key]);\n      overridableKeys[key] = true;\n    }\n  }\n}\n\nfunction storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode,\n  startLine, startLineStart, startPos) {\n\n  var index, quantity;\n\n  // The output is a plain object here, so keys can only be strings.\n  // We need to convert keyNode to a string, but doing so can hang the process\n  // (deeply nested arrays that explode exponentially using aliases).\n  if (Array.isArray(keyNode)) {\n    keyNode = Array.prototype.slice.call(keyNode);\n\n    for (index = 0, quantity = keyNode.length; index < quantity; index += 1) {\n      if (Array.isArray(keyNode[index])) {\n        throwError(state, 'nested arrays are not supported inside keys');\n      }\n\n      if (typeof keyNode === 'object' && _class(keyNode[index]) === '[object Object]') {\n        keyNode[index] = '[object Object]';\n      }\n    }\n  }\n\n  // Avoid code execution in load() via toString property\n  // (still use its own toString for arrays, timestamps,\n  // and whatever user schema extensions happen to have @@toStringTag)\n  if (typeof keyNode === 'object' && _class(keyNode) === '[object Object]') {\n    keyNode = '[object Object]';\n  }\n\n\n  keyNode = String(keyNode);\n\n  if (_result === null) {\n    _result = {};\n  }\n\n  if (keyTag === 'tag:yaml.org,2002:merge') {\n    if (Array.isArray(valueNode)) {\n      for (index = 0, quantity = valueNode.length; index < quantity; index += 1) {\n        mergeMappings(state, _result, valueNode[index], overridableKeys);\n      }\n    } else {\n      mergeMappings(state, _result, valueNode, overridableKeys);\n    }\n  } else {\n    if (!state.json &&\n        !_hasOwnProperty$1.call(overridableKeys, keyNode) &&\n        _hasOwnProperty$1.call(_result, keyNode)) {\n      state.line = startLine || state.line;\n      state.lineStart = startLineStart || state.lineStart;\n      state.position = startPos || state.position;\n      throwError(state, 'duplicated mapping key');\n    }\n\n    setProperty(_result, keyNode, valueNode);\n    delete overridableKeys[keyNode];\n  }\n\n  return _result;\n}\n\nfunction readLineBreak(state) {\n  var ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x0A/* LF */) {\n    state.position++;\n  } else if (ch === 0x0D/* CR */) {\n    state.position++;\n    if (state.input.charCodeAt(state.position) === 0x0A/* LF */) {\n      state.position++;\n    }\n  } else {\n    throwError(state, 'a line break is expected');\n  }\n\n  state.line += 1;\n  state.lineStart = state.position;\n  state.firstTabInLine = -1;\n}\n\nfunction skipSeparationSpace(state, allowComments, checkIndent) {\n  var lineBreaks = 0,\n      ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    while (is_WHITE_SPACE(ch)) {\n      if (ch === 0x09/* Tab */ && state.firstTabInLine === -1) {\n        state.firstTabInLine = state.position;\n      }\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    if (allowComments && ch === 0x23/* # */) {\n      do {\n        ch = state.input.charCodeAt(++state.position);\n      } while (ch !== 0x0A/* LF */ && ch !== 0x0D/* CR */ && ch !== 0);\n    }\n\n    if (is_EOL(ch)) {\n      readLineBreak(state);\n\n      ch = state.input.charCodeAt(state.position);\n      lineBreaks++;\n      state.lineIndent = 0;\n\n      while (ch === 0x20/* Space */) {\n        state.lineIndent++;\n        ch = state.input.charCodeAt(++state.position);\n      }\n    } else {\n      break;\n    }\n  }\n\n  if (checkIndent !== -1 && lineBreaks !== 0 && state.lineIndent < checkIndent) {\n    throwWarning(state, 'deficient indentation');\n  }\n\n  return lineBreaks;\n}\n\nfunction testDocumentSeparator(state) {\n  var _position = state.position,\n      ch;\n\n  ch = state.input.charCodeAt(_position);\n\n  // Condition state.position === state.lineStart is tested\n  // in parent on each call, for efficiency. No needs to test here again.\n  if ((ch === 0x2D/* - */ || ch === 0x2E/* . */) &&\n      ch === state.input.charCodeAt(_position + 1) &&\n      ch === state.input.charCodeAt(_position + 2)) {\n\n    _position += 3;\n\n    ch = state.input.charCodeAt(_position);\n\n    if (ch === 0 || is_WS_OR_EOL(ch)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction writeFoldedLines(state, count) {\n  if (count === 1) {\n    state.result += ' ';\n  } else if (count > 1) {\n    state.result += common.repeat('\\n', count - 1);\n  }\n}\n\n\nfunction readPlainScalar(state, nodeIndent, withinFlowCollection) {\n  var preceding,\n      following,\n      captureStart,\n      captureEnd,\n      hasPendingContent,\n      _line,\n      _lineStart,\n      _lineIndent,\n      _kind = state.kind,\n      _result = state.result,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (is_WS_OR_EOL(ch)      ||\n      is_FLOW_INDICATOR(ch) ||\n      ch === 0x23/* # */    ||\n      ch === 0x26/* & */    ||\n      ch === 0x2A/* * */    ||\n      ch === 0x21/* ! */    ||\n      ch === 0x7C/* | */    ||\n      ch === 0x3E/* > */    ||\n      ch === 0x27/* ' */    ||\n      ch === 0x22/* \" */    ||\n      ch === 0x25/* % */    ||\n      ch === 0x40/* @ */    ||\n      ch === 0x60/* ` */) {\n    return false;\n  }\n\n  if (ch === 0x3F/* ? */ || ch === 0x2D/* - */) {\n    following = state.input.charCodeAt(state.position + 1);\n\n    if (is_WS_OR_EOL(following) ||\n        withinFlowCollection && is_FLOW_INDICATOR(following)) {\n      return false;\n    }\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  captureStart = captureEnd = state.position;\n  hasPendingContent = false;\n\n  while (ch !== 0) {\n    if (ch === 0x3A/* : */) {\n      following = state.input.charCodeAt(state.position + 1);\n\n      if (is_WS_OR_EOL(following) ||\n          withinFlowCollection && is_FLOW_INDICATOR(following)) {\n        break;\n      }\n\n    } else if (ch === 0x23/* # */) {\n      preceding = state.input.charCodeAt(state.position - 1);\n\n      if (is_WS_OR_EOL(preceding)) {\n        break;\n      }\n\n    } else if ((state.position === state.lineStart && testDocumentSeparator(state)) ||\n               withinFlowCollection && is_FLOW_INDICATOR(ch)) {\n      break;\n\n    } else if (is_EOL(ch)) {\n      _line = state.line;\n      _lineStart = state.lineStart;\n      _lineIndent = state.lineIndent;\n      skipSeparationSpace(state, false, -1);\n\n      if (state.lineIndent >= nodeIndent) {\n        hasPendingContent = true;\n        ch = state.input.charCodeAt(state.position);\n        continue;\n      } else {\n        state.position = captureEnd;\n        state.line = _line;\n        state.lineStart = _lineStart;\n        state.lineIndent = _lineIndent;\n        break;\n      }\n    }\n\n    if (hasPendingContent) {\n      captureSegment(state, captureStart, captureEnd, false);\n      writeFoldedLines(state, state.line - _line);\n      captureStart = captureEnd = state.position;\n      hasPendingContent = false;\n    }\n\n    if (!is_WHITE_SPACE(ch)) {\n      captureEnd = state.position + 1;\n    }\n\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  captureSegment(state, captureStart, captureEnd, false);\n\n  if (state.result) {\n    return true;\n  }\n\n  state.kind = _kind;\n  state.result = _result;\n  return false;\n}\n\nfunction readSingleQuotedScalar(state, nodeIndent) {\n  var ch,\n      captureStart, captureEnd;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x27/* ' */) {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  state.position++;\n  captureStart = captureEnd = state.position;\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    if (ch === 0x27/* ' */) {\n      captureSegment(state, captureStart, state.position, true);\n      ch = state.input.charCodeAt(++state.position);\n\n      if (ch === 0x27/* ' */) {\n        captureStart = state.position;\n        state.position++;\n        captureEnd = state.position;\n      } else {\n        return true;\n      }\n\n    } else if (is_EOL(ch)) {\n      captureSegment(state, captureStart, captureEnd, true);\n      writeFoldedLines(state, skipSeparationSpace(state, false, nodeIndent));\n      captureStart = captureEnd = state.position;\n\n    } else if (state.position === state.lineStart && testDocumentSeparator(state)) {\n      throwError(state, 'unexpected end of the document within a single quoted scalar');\n\n    } else {\n      state.position++;\n      captureEnd = state.position;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a single quoted scalar');\n}\n\nfunction readDoubleQuotedScalar(state, nodeIndent) {\n  var captureStart,\n      captureEnd,\n      hexLength,\n      hexResult,\n      tmp,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x22/* \" */) {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  state.position++;\n  captureStart = captureEnd = state.position;\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    if (ch === 0x22/* \" */) {\n      captureSegment(state, captureStart, state.position, true);\n      state.position++;\n      return true;\n\n    } else if (ch === 0x5C/* \\ */) {\n      captureSegment(state, captureStart, state.position, true);\n      ch = state.input.charCodeAt(++state.position);\n\n      if (is_EOL(ch)) {\n        skipSeparationSpace(state, false, nodeIndent);\n\n        // TODO: rework to inline fn with no type cast?\n      } else if (ch < 256 && simpleEscapeCheck[ch]) {\n        state.result += simpleEscapeMap[ch];\n        state.position++;\n\n      } else if ((tmp = escapedHexLen(ch)) > 0) {\n        hexLength = tmp;\n        hexResult = 0;\n\n        for (; hexLength > 0; hexLength--) {\n          ch = state.input.charCodeAt(++state.position);\n\n          if ((tmp = fromHexCode(ch)) >= 0) {\n            hexResult = (hexResult << 4) + tmp;\n\n          } else {\n            throwError(state, 'expected hexadecimal character');\n          }\n        }\n\n        state.result += charFromCodepoint(hexResult);\n\n        state.position++;\n\n      } else {\n        throwError(state, 'unknown escape sequence');\n      }\n\n      captureStart = captureEnd = state.position;\n\n    } else if (is_EOL(ch)) {\n      captureSegment(state, captureStart, captureEnd, true);\n      writeFoldedLines(state, skipSeparationSpace(state, false, nodeIndent));\n      captureStart = captureEnd = state.position;\n\n    } else if (state.position === state.lineStart && testDocumentSeparator(state)) {\n      throwError(state, 'unexpected end of the document within a double quoted scalar');\n\n    } else {\n      state.position++;\n      captureEnd = state.position;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a double quoted scalar');\n}\n\nfunction readFlowCollection(state, nodeIndent) {\n  var readNext = true,\n      _line,\n      _lineStart,\n      _pos,\n      _tag     = state.tag,\n      _result,\n      _anchor  = state.anchor,\n      following,\n      terminator,\n      isPair,\n      isExplicitPair,\n      isMapping,\n      overridableKeys = Object.create(null),\n      keyNode,\n      keyTag,\n      valueNode,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x5B/* [ */) {\n    terminator = 0x5D;/* ] */\n    isMapping = false;\n    _result = [];\n  } else if (ch === 0x7B/* { */) {\n    terminator = 0x7D;/* } */\n    isMapping = true;\n    _result = {};\n  } else {\n    return false;\n  }\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n\n  while (ch !== 0) {\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (ch === terminator) {\n      state.position++;\n      state.tag = _tag;\n      state.anchor = _anchor;\n      state.kind = isMapping ? 'mapping' : 'sequence';\n      state.result = _result;\n      return true;\n    } else if (!readNext) {\n      throwError(state, 'missed comma between flow collection entries');\n    } else if (ch === 0x2C/* , */) {\n      // \"flow collection entries can never be completely empty\", as per YAML 1.2, section 7.4\n      throwError(state, \"expected the node content, but found ','\");\n    }\n\n    keyTag = keyNode = valueNode = null;\n    isPair = isExplicitPair = false;\n\n    if (ch === 0x3F/* ? */) {\n      following = state.input.charCodeAt(state.position + 1);\n\n      if (is_WS_OR_EOL(following)) {\n        isPair = isExplicitPair = true;\n        state.position++;\n        skipSeparationSpace(state, true, nodeIndent);\n      }\n    }\n\n    _line = state.line; // Save the current line.\n    _lineStart = state.lineStart;\n    _pos = state.position;\n    composeNode(state, nodeIndent, CONTEXT_FLOW_IN, false, true);\n    keyTag = state.tag;\n    keyNode = state.result;\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if ((isExplicitPair || state.line === _line) && ch === 0x3A/* : */) {\n      isPair = true;\n      ch = state.input.charCodeAt(++state.position);\n      skipSeparationSpace(state, true, nodeIndent);\n      composeNode(state, nodeIndent, CONTEXT_FLOW_IN, false, true);\n      valueNode = state.result;\n    }\n\n    if (isMapping) {\n      storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode, _line, _lineStart, _pos);\n    } else if (isPair) {\n      _result.push(storeMappingPair(state, null, overridableKeys, keyTag, keyNode, valueNode, _line, _lineStart, _pos));\n    } else {\n      _result.push(keyNode);\n    }\n\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (ch === 0x2C/* , */) {\n      readNext = true;\n      ch = state.input.charCodeAt(++state.position);\n    } else {\n      readNext = false;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a flow collection');\n}\n\nfunction readBlockScalar(state, nodeIndent) {\n  var captureStart,\n      folding,\n      chomping       = CHOMPING_CLIP,\n      didReadContent = false,\n      detectedIndent = false,\n      textIndent     = nodeIndent,\n      emptyLines     = 0,\n      atMoreIndented = false,\n      tmp,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x7C/* | */) {\n    folding = false;\n  } else if (ch === 0x3E/* > */) {\n    folding = true;\n  } else {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n\n  while (ch !== 0) {\n    ch = state.input.charCodeAt(++state.position);\n\n    if (ch === 0x2B/* + */ || ch === 0x2D/* - */) {\n      if (CHOMPING_CLIP === chomping) {\n        chomping = (ch === 0x2B/* + */) ? CHOMPING_KEEP : CHOMPING_STRIP;\n      } else {\n        throwError(state, 'repeat of a chomping mode identifier');\n      }\n\n    } else if ((tmp = fromDecimalCode(ch)) >= 0) {\n      if (tmp === 0) {\n        throwError(state, 'bad explicit indentation width of a block scalar; it cannot be less than one');\n      } else if (!detectedIndent) {\n        textIndent = nodeIndent + tmp - 1;\n        detectedIndent = true;\n      } else {\n        throwError(state, 'repeat of an indentation width identifier');\n      }\n\n    } else {\n      break;\n    }\n  }\n\n  if (is_WHITE_SPACE(ch)) {\n    do { ch = state.input.charCodeAt(++state.position); }\n    while (is_WHITE_SPACE(ch));\n\n    if (ch === 0x23/* # */) {\n      do { ch = state.input.charCodeAt(++state.position); }\n      while (!is_EOL(ch) && (ch !== 0));\n    }\n  }\n\n  while (ch !== 0) {\n    readLineBreak(state);\n    state.lineIndent = 0;\n\n    ch = state.input.charCodeAt(state.position);\n\n    while ((!detectedIndent || state.lineIndent < textIndent) &&\n           (ch === 0x20/* Space */)) {\n      state.lineIndent++;\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    if (!detectedIndent && state.lineIndent > textIndent) {\n      textIndent = state.lineIndent;\n    }\n\n    if (is_EOL(ch)) {\n      emptyLines++;\n      continue;\n    }\n\n    // End of the scalar.\n    if (state.lineIndent < textIndent) {\n\n      // Perform the chomping.\n      if (chomping === CHOMPING_KEEP) {\n        state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n      } else if (chomping === CHOMPING_CLIP) {\n        if (didReadContent) { // i.e. only if the scalar is not empty.\n          state.result += '\\n';\n        }\n      }\n\n      // Break this `while` cycle and go to the funciton's epilogue.\n      break;\n    }\n\n    // Folded style: use fancy rules to handle line breaks.\n    if (folding) {\n\n      // Lines starting with white space characters (more-indented lines) are not folded.\n      if (is_WHITE_SPACE(ch)) {\n        atMoreIndented = true;\n        // except for the first content line (cf. Example 8.1)\n        state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n\n      // End of more-indented block.\n      } else if (atMoreIndented) {\n        atMoreIndented = false;\n        state.result += common.repeat('\\n', emptyLines + 1);\n\n      // Just one line break - perceive as the same line.\n      } else if (emptyLines === 0) {\n        if (didReadContent) { // i.e. only if we have already read some scalar content.\n          state.result += ' ';\n        }\n\n      // Several line breaks - perceive as different lines.\n      } else {\n        state.result += common.repeat('\\n', emptyLines);\n      }\n\n    // Literal style: just add exact number of line breaks between content lines.\n    } else {\n      // Keep all line breaks except the header line break.\n      state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n    }\n\n    didReadContent = true;\n    detectedIndent = true;\n    emptyLines = 0;\n    captureStart = state.position;\n\n    while (!is_EOL(ch) && (ch !== 0)) {\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    captureSegment(state, captureStart, state.position, false);\n  }\n\n  return true;\n}\n\nfunction readBlockSequence(state, nodeIndent) {\n  var _line,\n      _tag      = state.tag,\n      _anchor   = state.anchor,\n      _result   = [],\n      following,\n      detected  = false,\n      ch;\n\n  // there is a leading tab before this token, so it can't be a block sequence/mapping;\n  // it can still be flow sequence/mapping or a scalar\n  if (state.firstTabInLine !== -1) return false;\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    if (state.firstTabInLine !== -1) {\n      state.position = state.firstTabInLine;\n      throwError(state, 'tab characters must not be used in indentation');\n    }\n\n    if (ch !== 0x2D/* - */) {\n      break;\n    }\n\n    following = state.input.charCodeAt(state.position + 1);\n\n    if (!is_WS_OR_EOL(following)) {\n      break;\n    }\n\n    detected = true;\n    state.position++;\n\n    if (skipSeparationSpace(state, true, -1)) {\n      if (state.lineIndent <= nodeIndent) {\n        _result.push(null);\n        ch = state.input.charCodeAt(state.position);\n        continue;\n      }\n    }\n\n    _line = state.line;\n    composeNode(state, nodeIndent, CONTEXT_BLOCK_IN, false, true);\n    _result.push(state.result);\n    skipSeparationSpace(state, true, -1);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if ((state.line === _line || state.lineIndent > nodeIndent) && (ch !== 0)) {\n      throwError(state, 'bad indentation of a sequence entry');\n    } else if (state.lineIndent < nodeIndent) {\n      break;\n    }\n  }\n\n  if (detected) {\n    state.tag = _tag;\n    state.anchor = _anchor;\n    state.kind = 'sequence';\n    state.result = _result;\n    return true;\n  }\n  return false;\n}\n\nfunction readBlockMapping(state, nodeIndent, flowIndent) {\n  var following,\n      allowCompact,\n      _line,\n      _keyLine,\n      _keyLineStart,\n      _keyPos,\n      _tag          = state.tag,\n      _anchor       = state.anchor,\n      _result       = {},\n      overridableKeys = Object.create(null),\n      keyTag        = null,\n      keyNode       = null,\n      valueNode     = null,\n      atExplicitKey = false,\n      detected      = false,\n      ch;\n\n  // there is a leading tab before this token, so it can't be a block sequence/mapping;\n  // it can still be flow sequence/mapping or a scalar\n  if (state.firstTabInLine !== -1) return false;\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    if (!atExplicitKey && state.firstTabInLine !== -1) {\n      state.position = state.firstTabInLine;\n      throwError(state, 'tab characters must not be used in indentation');\n    }\n\n    following = state.input.charCodeAt(state.position + 1);\n    _line = state.line; // Save the current line.\n\n    //\n    // Explicit notation case. There are two separate blocks:\n    // first for the key (denoted by \"?\") and second for the value (denoted by \":\")\n    //\n    if ((ch === 0x3F/* ? */ || ch === 0x3A/* : */) && is_WS_OR_EOL(following)) {\n\n      if (ch === 0x3F/* ? */) {\n        if (atExplicitKey) {\n          storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n          keyTag = keyNode = valueNode = null;\n        }\n\n        detected = true;\n        atExplicitKey = true;\n        allowCompact = true;\n\n      } else if (atExplicitKey) {\n        // i.e. 0x3A/* : */ === character after the explicit key.\n        atExplicitKey = false;\n        allowCompact = true;\n\n      } else {\n        throwError(state, 'incomplete explicit mapping pair; a key node is missed; or followed by a non-tabulated empty line');\n      }\n\n      state.position += 1;\n      ch = following;\n\n    //\n    // Implicit notation case. Flow-style node as the key first, then \":\", and the value.\n    //\n    } else {\n      _keyLine = state.line;\n      _keyLineStart = state.lineStart;\n      _keyPos = state.position;\n\n      if (!composeNode(state, flowIndent, CONTEXT_FLOW_OUT, false, true)) {\n        // Neither implicit nor explicit notation.\n        // Reading is done. Go to the epilogue.\n        break;\n      }\n\n      if (state.line === _line) {\n        ch = state.input.charCodeAt(state.position);\n\n        while (is_WHITE_SPACE(ch)) {\n          ch = state.input.charCodeAt(++state.position);\n        }\n\n        if (ch === 0x3A/* : */) {\n          ch = state.input.charCodeAt(++state.position);\n\n          if (!is_WS_OR_EOL(ch)) {\n            throwError(state, 'a whitespace character is expected after the key-value separator within a block mapping');\n          }\n\n          if (atExplicitKey) {\n            storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n            keyTag = keyNode = valueNode = null;\n          }\n\n          detected = true;\n          atExplicitKey = false;\n          allowCompact = false;\n          keyTag = state.tag;\n          keyNode = state.result;\n\n        } else if (detected) {\n          throwError(state, 'can not read an implicit mapping pair; a colon is missed');\n\n        } else {\n          state.tag = _tag;\n          state.anchor = _anchor;\n          return true; // Keep the result of `composeNode`.\n        }\n\n      } else if (detected) {\n        throwError(state, 'can not read a block mapping entry; a multiline key may not be an implicit key');\n\n      } else {\n        state.tag = _tag;\n        state.anchor = _anchor;\n        return true; // Keep the result of `composeNode`.\n      }\n    }\n\n    //\n    // Common reading code for both explicit and implicit notations.\n    //\n    if (state.line === _line || state.lineIndent > nodeIndent) {\n      if (atExplicitKey) {\n        _keyLine = state.line;\n        _keyLineStart = state.lineStart;\n        _keyPos = state.position;\n      }\n\n      if (composeNode(state, nodeIndent, CONTEXT_BLOCK_OUT, true, allowCompact)) {\n        if (atExplicitKey) {\n          keyNode = state.result;\n        } else {\n          valueNode = state.result;\n        }\n      }\n\n      if (!atExplicitKey) {\n        storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode, _keyLine, _keyLineStart, _keyPos);\n        keyTag = keyNode = valueNode = null;\n      }\n\n      skipSeparationSpace(state, true, -1);\n      ch = state.input.charCodeAt(state.position);\n    }\n\n    if ((state.line === _line || state.lineIndent > nodeIndent) && (ch !== 0)) {\n      throwError(state, 'bad indentation of a mapping entry');\n    } else if (state.lineIndent < nodeIndent) {\n      break;\n    }\n  }\n\n  //\n  // Epilogue.\n  //\n\n  // Special case: last mapping's node contains only the key in explicit notation.\n  if (atExplicitKey) {\n    storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n  }\n\n  // Expose the resulting mapping.\n  if (detected) {\n    state.tag = _tag;\n    state.anchor = _anchor;\n    state.kind = 'mapping';\n    state.result = _result;\n  }\n\n  return detected;\n}\n\nfunction readTagProperty(state) {\n  var _position,\n      isVerbatim = false,\n      isNamed    = false,\n      tagHandle,\n      tagName,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x21/* ! */) return false;\n\n  if (state.tag !== null) {\n    throwError(state, 'duplication of a tag property');\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n\n  if (ch === 0x3C/* < */) {\n    isVerbatim = true;\n    ch = state.input.charCodeAt(++state.position);\n\n  } else if (ch === 0x21/* ! */) {\n    isNamed = true;\n    tagHandle = '!!';\n    ch = state.input.charCodeAt(++state.position);\n\n  } else {\n    tagHandle = '!';\n  }\n\n  _position = state.position;\n\n  if (isVerbatim) {\n    do { ch = state.input.charCodeAt(++state.position); }\n    while (ch !== 0 && ch !== 0x3E/* > */);\n\n    if (state.position < state.length) {\n      tagName = state.input.slice(_position, state.position);\n      ch = state.input.charCodeAt(++state.position);\n    } else {\n      throwError(state, 'unexpected end of the stream within a verbatim tag');\n    }\n  } else {\n    while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n\n      if (ch === 0x21/* ! */) {\n        if (!isNamed) {\n          tagHandle = state.input.slice(_position - 1, state.position + 1);\n\n          if (!PATTERN_TAG_HANDLE.test(tagHandle)) {\n            throwError(state, 'named tag handle cannot contain such characters');\n          }\n\n          isNamed = true;\n          _position = state.position + 1;\n        } else {\n          throwError(state, 'tag suffix cannot contain exclamation marks');\n        }\n      }\n\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    tagName = state.input.slice(_position, state.position);\n\n    if (PATTERN_FLOW_INDICATORS.test(tagName)) {\n      throwError(state, 'tag suffix cannot contain flow indicator characters');\n    }\n  }\n\n  if (tagName && !PATTERN_TAG_URI.test(tagName)) {\n    throwError(state, 'tag name cannot contain such characters: ' + tagName);\n  }\n\n  try {\n    tagName = decodeURIComponent(tagName);\n  } catch (err) {\n    throwError(state, 'tag name is malformed: ' + tagName);\n  }\n\n  if (isVerbatim) {\n    state.tag = tagName;\n\n  } else if (_hasOwnProperty$1.call(state.tagMap, tagHandle)) {\n    state.tag = state.tagMap[tagHandle] + tagName;\n\n  } else if (tagHandle === '!') {\n    state.tag = '!' + tagName;\n\n  } else if (tagHandle === '!!') {\n    state.tag = 'tag:yaml.org,2002:' + tagName;\n\n  } else {\n    throwError(state, 'undeclared tag handle \"' + tagHandle + '\"');\n  }\n\n  return true;\n}\n\nfunction readAnchorProperty(state) {\n  var _position,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x26/* & */) return false;\n\n  if (state.anchor !== null) {\n    throwError(state, 'duplication of an anchor property');\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n  _position = state.position;\n\n  while (ch !== 0 && !is_WS_OR_EOL(ch) && !is_FLOW_INDICATOR(ch)) {\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  if (state.position === _position) {\n    throwError(state, 'name of an anchor node must contain at least one character');\n  }\n\n  state.anchor = state.input.slice(_position, state.position);\n  return true;\n}\n\nfunction readAlias(state) {\n  var _position, alias,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x2A/* * */) return false;\n\n  ch = state.input.charCodeAt(++state.position);\n  _position = state.position;\n\n  while (ch !== 0 && !is_WS_OR_EOL(ch) && !is_FLOW_INDICATOR(ch)) {\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  if (state.position === _position) {\n    throwError(state, 'name of an alias node must contain at least one character');\n  }\n\n  alias = state.input.slice(_position, state.position);\n\n  if (!_hasOwnProperty$1.call(state.anchorMap, alias)) {\n    throwError(state, 'unidentified alias \"' + alias + '\"');\n  }\n\n  state.result = state.anchorMap[alias];\n  skipSeparationSpace(state, true, -1);\n  return true;\n}\n\nfunction composeNode(state, parentIndent, nodeContext, allowToSeek, allowCompact) {\n  var allowBlockStyles,\n      allowBlockScalars,\n      allowBlockCollections,\n      indentStatus = 1, // 1: this>parent, 0: this=parent, -1: this<parent\n      atNewLine  = false,\n      hasContent = false,\n      typeIndex,\n      typeQuantity,\n      typeList,\n      type,\n      flowIndent,\n      blockIndent;\n\n  if (state.listener !== null) {\n    state.listener('open', state);\n  }\n\n  state.tag    = null;\n  state.anchor = null;\n  state.kind   = null;\n  state.result = null;\n\n  allowBlockStyles = allowBlockScalars = allowBlockCollections =\n    CONTEXT_BLOCK_OUT === nodeContext ||\n    CONTEXT_BLOCK_IN  === nodeContext;\n\n  if (allowToSeek) {\n    if (skipSeparationSpace(state, true, -1)) {\n      atNewLine = true;\n\n      if (state.lineIndent > parentIndent) {\n        indentStatus = 1;\n      } else if (state.lineIndent === parentIndent) {\n        indentStatus = 0;\n      } else if (state.lineIndent < parentIndent) {\n        indentStatus = -1;\n      }\n    }\n  }\n\n  if (indentStatus === 1) {\n    while (readTagProperty(state) || readAnchorProperty(state)) {\n      if (skipSeparationSpace(state, true, -1)) {\n        atNewLine = true;\n        allowBlockCollections = allowBlockStyles;\n\n        if (state.lineIndent > parentIndent) {\n          indentStatus = 1;\n        } else if (state.lineIndent === parentIndent) {\n          indentStatus = 0;\n        } else if (state.lineIndent < parentIndent) {\n          indentStatus = -1;\n        }\n      } else {\n        allowBlockCollections = false;\n      }\n    }\n  }\n\n  if (allowBlockCollections) {\n    allowBlockCollections = atNewLine || allowCompact;\n  }\n\n  if (indentStatus === 1 || CONTEXT_BLOCK_OUT === nodeContext) {\n    if (CONTEXT_FLOW_IN === nodeContext || CONTEXT_FLOW_OUT === nodeContext) {\n      flowIndent = parentIndent;\n    } else {\n      flowIndent = parentIndent + 1;\n    }\n\n    blockIndent = state.position - state.lineStart;\n\n    if (indentStatus === 1) {\n      if (allowBlockCollections &&\n          (readBlockSequence(state, blockIndent) ||\n           readBlockMapping(state, blockIndent, flowIndent)) ||\n          readFlowCollection(state, flowIndent)) {\n        hasContent = true;\n      } else {\n        if ((allowBlockScalars && readBlockScalar(state, flowIndent)) ||\n            readSingleQuotedScalar(state, flowIndent) ||\n            readDoubleQuotedScalar(state, flowIndent)) {\n          hasContent = true;\n\n        } else if (readAlias(state)) {\n          hasContent = true;\n\n          if (state.tag !== null || state.anchor !== null) {\n            throwError(state, 'alias node should not have any properties');\n          }\n\n        } else if (readPlainScalar(state, flowIndent, CONTEXT_FLOW_IN === nodeContext)) {\n          hasContent = true;\n\n          if (state.tag === null) {\n            state.tag = '?';\n          }\n        }\n\n        if (state.anchor !== null) {\n          state.anchorMap[state.anchor] = state.result;\n        }\n      }\n    } else if (indentStatus === 0) {\n      // Special case: block sequences are allowed to have same indentation level as the parent.\n      // http://www.yaml.org/spec/1.2/spec.html#id2799784\n      hasContent = allowBlockCollections && readBlockSequence(state, blockIndent);\n    }\n  }\n\n  if (state.tag === null) {\n    if (state.anchor !== null) {\n      state.anchorMap[state.anchor] = state.result;\n    }\n\n  } else if (state.tag === '?') {\n    // Implicit resolving is not allowed for non-scalar types, and '?'\n    // non-specific tag is only automatically assigned to plain scalars.\n    //\n    // We only need to check kind conformity in case user explicitly assigns '?'\n    // tag, for example like this: \"!<?> [0]\"\n    //\n    if (state.result !== null && state.kind !== 'scalar') {\n      throwError(state, 'unacceptable node kind for !<?> tag; it should be \"scalar\", not \"' + state.kind + '\"');\n    }\n\n    for (typeIndex = 0, typeQuantity = state.implicitTypes.length; typeIndex < typeQuantity; typeIndex += 1) {\n      type = state.implicitTypes[typeIndex];\n\n      if (type.resolve(state.result)) { // `state.result` updated in resolver if matched\n        state.result = type.construct(state.result);\n        state.tag = type.tag;\n        if (state.anchor !== null) {\n          state.anchorMap[state.anchor] = state.result;\n        }\n        break;\n      }\n    }\n  } else if (state.tag !== '!') {\n    if (_hasOwnProperty$1.call(state.typeMap[state.kind || 'fallback'], state.tag)) {\n      type = state.typeMap[state.kind || 'fallback'][state.tag];\n    } else {\n      // looking for multi type\n      type = null;\n      typeList = state.typeMap.multi[state.kind || 'fallback'];\n\n      for (typeIndex = 0, typeQuantity = typeList.length; typeIndex < typeQuantity; typeIndex += 1) {\n        if (state.tag.slice(0, typeList[typeIndex].tag.length) === typeList[typeIndex].tag) {\n          type = typeList[typeIndex];\n          break;\n        }\n      }\n    }\n\n    if (!type) {\n      throwError(state, 'unknown tag !<' + state.tag + '>');\n    }\n\n    if (state.result !== null && type.kind !== state.kind) {\n      throwError(state, 'unacceptable node kind for !<' + state.tag + '> tag; it should be \"' + type.kind + '\", not \"' + state.kind + '\"');\n    }\n\n    if (!type.resolve(state.result, state.tag)) { // `state.result` updated in resolver if matched\n      throwError(state, 'cannot resolve a node with !<' + state.tag + '> explicit tag');\n    } else {\n      state.result = type.construct(state.result, state.tag);\n      if (state.anchor !== null) {\n        state.anchorMap[state.anchor] = state.result;\n      }\n    }\n  }\n\n  if (state.listener !== null) {\n    state.listener('close', state);\n  }\n  return state.tag !== null ||  state.anchor !== null || hasContent;\n}\n\nfunction readDocument(state) {\n  var documentStart = state.position,\n      _position,\n      directiveName,\n      directiveArgs,\n      hasDirectives = false,\n      ch;\n\n  state.version = null;\n  state.checkLineBreaks = state.legacy;\n  state.tagMap = Object.create(null);\n  state.anchorMap = Object.create(null);\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    skipSeparationSpace(state, true, -1);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (state.lineIndent > 0 || ch !== 0x25/* % */) {\n      break;\n    }\n\n    hasDirectives = true;\n    ch = state.input.charCodeAt(++state.position);\n    _position = state.position;\n\n    while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    directiveName = state.input.slice(_position, state.position);\n    directiveArgs = [];\n\n    if (directiveName.length < 1) {\n      throwError(state, 'directive name must not be less than one character in length');\n    }\n\n    while (ch !== 0) {\n      while (is_WHITE_SPACE(ch)) {\n        ch = state.input.charCodeAt(++state.position);\n      }\n\n      if (ch === 0x23/* # */) {\n        do { ch = state.input.charCodeAt(++state.position); }\n        while (ch !== 0 && !is_EOL(ch));\n        break;\n      }\n\n      if (is_EOL(ch)) break;\n\n      _position = state.position;\n\n      while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n        ch = state.input.charCodeAt(++state.position);\n      }\n\n      directiveArgs.push(state.input.slice(_position, state.position));\n    }\n\n    if (ch !== 0) readLineBreak(state);\n\n    if (_hasOwnProperty$1.call(directiveHandlers, directiveName)) {\n      directiveHandlers[directiveName](state, directiveName, directiveArgs);\n    } else {\n      throwWarning(state, 'unknown document directive \"' + directiveName + '\"');\n    }\n  }\n\n  skipSeparationSpace(state, true, -1);\n\n  if (state.lineIndent === 0 &&\n      state.input.charCodeAt(state.position)     === 0x2D/* - */ &&\n      state.input.charCodeAt(state.position + 1) === 0x2D/* - */ &&\n      state.input.charCodeAt(state.position + 2) === 0x2D/* - */) {\n    state.position += 3;\n    skipSeparationSpace(state, true, -1);\n\n  } else if (hasDirectives) {\n    throwError(state, 'directives end mark is expected');\n  }\n\n  composeNode(state, state.lineIndent - 1, CONTEXT_BLOCK_OUT, false, true);\n  skipSeparationSpace(state, true, -1);\n\n  if (state.checkLineBreaks &&\n      PATTERN_NON_ASCII_LINE_BREAKS.test(state.input.slice(documentStart, state.position))) {\n    throwWarning(state, 'non-ASCII line breaks are interpreted as content');\n  }\n\n  state.documents.push(state.result);\n\n  if (state.position === state.lineStart && testDocumentSeparator(state)) {\n\n    if (state.input.charCodeAt(state.position) === 0x2E/* . */) {\n      state.position += 3;\n      skipSeparationSpace(state, true, -1);\n    }\n    return;\n  }\n\n  if (state.position < (state.length - 1)) {\n    throwError(state, 'end of the stream or a document separator is expected');\n  } else {\n    return;\n  }\n}\n\n\nfunction loadDocuments(input, options) {\n  input = String(input);\n  options = options || {};\n\n  if (input.length !== 0) {\n\n    // Add tailing `\\n` if not exists\n    if (input.charCodeAt(input.length - 1) !== 0x0A/* LF */ &&\n        input.charCodeAt(input.length - 1) !== 0x0D/* CR */) {\n      input += '\\n';\n    }\n\n    // Strip BOM\n    if (input.charCodeAt(0) === 0xFEFF) {\n      input = input.slice(1);\n    }\n  }\n\n  var state = new State$1(input, options);\n\n  var nullpos = input.indexOf('\\0');\n\n  if (nullpos !== -1) {\n    state.position = nullpos;\n    throwError(state, 'null byte is not allowed in input');\n  }\n\n  // Use 0 as string terminator. That significantly simplifies bounds check.\n  state.input += '\\0';\n\n  while (state.input.charCodeAt(state.position) === 0x20/* Space */) {\n    state.lineIndent += 1;\n    state.position += 1;\n  }\n\n  while (state.position < (state.length - 1)) {\n    readDocument(state);\n  }\n\n  return state.documents;\n}\n\n\nfunction loadAll$1(input, iterator, options) {\n  if (iterator !== null && typeof iterator === 'object' && typeof options === 'undefined') {\n    options = iterator;\n    iterator = null;\n  }\n\n  var documents = loadDocuments(input, options);\n\n  if (typeof iterator !== 'function') {\n    return documents;\n  }\n\n  for (var index = 0, length = documents.length; index < length; index += 1) {\n    iterator(documents[index]);\n  }\n}\n\n\nfunction load$1(input, options) {\n  var documents = loadDocuments(input, options);\n\n  if (documents.length === 0) {\n    /*eslint-disable no-undefined*/\n    return undefined;\n  } else if (documents.length === 1) {\n    return documents[0];\n  }\n  throw new exception('expected a single document in the stream, but found more');\n}\n\n\nvar loadAll_1 = loadAll$1;\nvar load_1    = load$1;\n\nvar loader = {\n\tloadAll: loadAll_1,\n\tload: load_1\n};\n\n/*eslint-disable no-use-before-define*/\n\n\n\n\n\nvar _toString       = Object.prototype.toString;\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar CHAR_BOM                  = 0xFEFF;\nvar CHAR_TAB                  = 0x09; /* Tab */\nvar CHAR_LINE_FEED            = 0x0A; /* LF */\nvar CHAR_CARRIAGE_RETURN      = 0x0D; /* CR */\nvar CHAR_SPACE                = 0x20; /* Space */\nvar CHAR_EXCLAMATION          = 0x21; /* ! */\nvar CHAR_DOUBLE_QUOTE         = 0x22; /* \" */\nvar CHAR_SHARP                = 0x23; /* # */\nvar CHAR_PERCENT              = 0x25; /* % */\nvar CHAR_AMPERSAND            = 0x26; /* & */\nvar CHAR_SINGLE_QUOTE         = 0x27; /* ' */\nvar CHAR_ASTERISK             = 0x2A; /* * */\nvar CHAR_COMMA                = 0x2C; /* , */\nvar CHAR_MINUS                = 0x2D; /* - */\nvar CHAR_COLON                = 0x3A; /* : */\nvar CHAR_EQUALS               = 0x3D; /* = */\nvar CHAR_GREATER_THAN         = 0x3E; /* > */\nvar CHAR_QUESTION             = 0x3F; /* ? */\nvar CHAR_COMMERCIAL_AT        = 0x40; /* @ */\nvar CHAR_LEFT_SQUARE_BRACKET  = 0x5B; /* [ */\nvar CHAR_RIGHT_SQUARE_BRACKET = 0x5D; /* ] */\nvar CHAR_GRAVE_ACCENT         = 0x60; /* ` */\nvar CHAR_LEFT_CURLY_BRACKET   = 0x7B; /* { */\nvar CHAR_VERTICAL_LINE        = 0x7C; /* | */\nvar CHAR_RIGHT_CURLY_BRACKET  = 0x7D; /* } */\n\nvar ESCAPE_SEQUENCES = {};\n\nESCAPE_SEQUENCES[0x00]   = '\\\\0';\nESCAPE_SEQUENCES[0x07]   = '\\\\a';\nESCAPE_SEQUENCES[0x08]   = '\\\\b';\nESCAPE_SEQUENCES[0x09]   = '\\\\t';\nESCAPE_SEQUENCES[0x0A]   = '\\\\n';\nESCAPE_SEQUENCES[0x0B]   = '\\\\v';\nESCAPE_SEQUENCES[0x0C]   = '\\\\f';\nESCAPE_SEQUENCES[0x0D]   = '\\\\r';\nESCAPE_SEQUENCES[0x1B]   = '\\\\e';\nESCAPE_SEQUENCES[0x22]   = '\\\\\"';\nESCAPE_SEQUENCES[0x5C]   = '\\\\\\\\';\nESCAPE_SEQUENCES[0x85]   = '\\\\N';\nESCAPE_SEQUENCES[0xA0]   = '\\\\_';\nESCAPE_SEQUENCES[0x2028] = '\\\\L';\nESCAPE_SEQUENCES[0x2029] = '\\\\P';\n\nvar DEPRECATED_BOOLEANS_SYNTAX = [\n  'y', 'Y', 'yes', 'Yes', 'YES', 'on', 'On', 'ON',\n  'n', 'N', 'no', 'No', 'NO', 'off', 'Off', 'OFF'\n];\n\nvar DEPRECATED_BASE60_SYNTAX = /^[-+]?[0-9_]+(?::[0-9_]+)+(?:\\.[0-9_]*)?$/;\n\nfunction compileStyleMap(schema, map) {\n  var result, keys, index, length, tag, style, type;\n\n  if (map === null) return {};\n\n  result = {};\n  keys = Object.keys(map);\n\n  for (index = 0, length = keys.length; index < length; index += 1) {\n    tag = keys[index];\n    style = String(map[tag]);\n\n    if (tag.slice(0, 2) === '!!') {\n      tag = 'tag:yaml.org,2002:' + tag.slice(2);\n    }\n    type = schema.compiledTypeMap['fallback'][tag];\n\n    if (type && _hasOwnProperty.call(type.styleAliases, style)) {\n      style = type.styleAliases[style];\n    }\n\n    result[tag] = style;\n  }\n\n  return result;\n}\n\nfunction encodeHex(character) {\n  var string, handle, length;\n\n  string = character.toString(16).toUpperCase();\n\n  if (character <= 0xFF) {\n    handle = 'x';\n    length = 2;\n  } else if (character <= 0xFFFF) {\n    handle = 'u';\n    length = 4;\n  } else if (character <= 0xFFFFFFFF) {\n    handle = 'U';\n    length = 8;\n  } else {\n    throw new exception('code point within a string may not be greater than 0xFFFFFFFF');\n  }\n\n  return '\\\\' + handle + common.repeat('0', length - string.length) + string;\n}\n\n\nvar QUOTING_TYPE_SINGLE = 1,\n    QUOTING_TYPE_DOUBLE = 2;\n\nfunction State(options) {\n  this.schema        = options['schema'] || _default;\n  this.indent        = Math.max(1, (options['indent'] || 2));\n  this.noArrayIndent = options['noArrayIndent'] || false;\n  this.skipInvalid   = options['skipInvalid'] || false;\n  this.flowLevel     = (common.isNothing(options['flowLevel']) ? -1 : options['flowLevel']);\n  this.styleMap      = compileStyleMap(this.schema, options['styles'] || null);\n  this.sortKeys      = options['sortKeys'] || false;\n  this.lineWidth     = options['lineWidth'] || 80;\n  this.noRefs        = options['noRefs'] || false;\n  this.noCompatMode  = options['noCompatMode'] || false;\n  this.condenseFlow  = options['condenseFlow'] || false;\n  this.quotingType   = options['quotingType'] === '\"' ? QUOTING_TYPE_DOUBLE : QUOTING_TYPE_SINGLE;\n  this.forceQuotes   = options['forceQuotes'] || false;\n  this.replacer      = typeof options['replacer'] === 'function' ? options['replacer'] : null;\n\n  this.implicitTypes = this.schema.compiledImplicit;\n  this.explicitTypes = this.schema.compiledExplicit;\n\n  this.tag = null;\n  this.result = '';\n\n  this.duplicates = [];\n  this.usedDuplicates = null;\n}\n\n// Indents every line in a string. Empty lines (\\n only) are not indented.\nfunction indentString(string, spaces) {\n  var ind = common.repeat(' ', spaces),\n      position = 0,\n      next = -1,\n      result = '',\n      line,\n      length = string.length;\n\n  while (position < length) {\n    next = string.indexOf('\\n', position);\n    if (next === -1) {\n      line = string.slice(position);\n      position = length;\n    } else {\n      line = string.slice(position, next + 1);\n      position = next + 1;\n    }\n\n    if (line.length && line !== '\\n') result += ind;\n\n    result += line;\n  }\n\n  return result;\n}\n\nfunction generateNextLine(state, level) {\n  return '\\n' + common.repeat(' ', state.indent * level);\n}\n\nfunction testImplicitResolving(state, str) {\n  var index, length, type;\n\n  for (index = 0, length = state.implicitTypes.length; index < length; index += 1) {\n    type = state.implicitTypes[index];\n\n    if (type.resolve(str)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n// [33] s-white ::= s-space | s-tab\nfunction isWhitespace(c) {\n  return c === CHAR_SPACE || c === CHAR_TAB;\n}\n\n// Returns true if the character can be printed without escaping.\n// From YAML 1.2: \"any allowed characters known to be non-printable\n// should also be escaped. [However,] This isn\u2019t mandatory\"\n// Derived from nb-char - \\t - #x85 - #xA0 - #x2028 - #x2029.\nfunction isPrintable(c) {\n  return  (0x00020 <= c && c <= 0x00007E)\n      || ((0x000A1 <= c && c <= 0x00D7FF) && c !== 0x2028 && c !== 0x2029)\n      || ((0x0E000 <= c && c <= 0x00FFFD) && c !== CHAR_BOM)\n      ||  (0x10000 <= c && c <= 0x10FFFF);\n}\n\n// [34] ns-char ::= nb-char - s-white\n// [27] nb-char ::= c-printable - b-char - c-byte-order-mark\n// [26] b-char  ::= b-line-feed | b-carriage-return\n// Including s-white (for some reason, examples doesn't match specs in this aspect)\n// ns-char ::= c-printable - b-line-feed - b-carriage-return - c-byte-order-mark\nfunction isNsCharOrWhitespace(c) {\n  return isPrintable(c)\n    && c !== CHAR_BOM\n    // - b-char\n    && c !== CHAR_CARRIAGE_RETURN\n    && c !== CHAR_LINE_FEED;\n}\n\n// [127]  ns-plain-safe(c) ::= c = flow-out  \u21D2 ns-plain-safe-out\n//                             c = flow-in   \u21D2 ns-plain-safe-in\n//                             c = block-key \u21D2 ns-plain-safe-out\n//                             c = flow-key  \u21D2 ns-plain-safe-in\n// [128] ns-plain-safe-out ::= ns-char\n// [129]  ns-plain-safe-in ::= ns-char - c-flow-indicator\n// [130]  ns-plain-char(c) ::=  ( ns-plain-safe(c) - \u201C:\u201D - \u201C#\u201D )\n//                            | ( /* An ns-char preceding */ \u201C#\u201D )\n//                            | ( \u201C:\u201D /* Followed by an ns-plain-safe(c) */ )\nfunction isPlainSafe(c, prev, inblock) {\n  var cIsNsCharOrWhitespace = isNsCharOrWhitespace(c);\n  var cIsNsChar = cIsNsCharOrWhitespace && !isWhitespace(c);\n  return (\n    // ns-plain-safe\n    inblock ? // c = flow-in\n      cIsNsCharOrWhitespace\n      : cIsNsCharOrWhitespace\n        // - c-flow-indicator\n        && c !== CHAR_COMMA\n        && c !== CHAR_LEFT_SQUARE_BRACKET\n        && c !== CHAR_RIGHT_SQUARE_BRACKET\n        && c !== CHAR_LEFT_CURLY_BRACKET\n        && c !== CHAR_RIGHT_CURLY_BRACKET\n  )\n    // ns-plain-char\n    && c !== CHAR_SHARP // false on '#'\n    && !(prev === CHAR_COLON && !cIsNsChar) // false on ': '\n    || (isNsCharOrWhitespace(prev) && !isWhitespace(prev) && c === CHAR_SHARP) // change to true on '[^ ]#'\n    || (prev === CHAR_COLON && cIsNsChar); // change to true on ':[^ ]'\n}\n\n// Simplified test for values allowed as the first character in plain style.\nfunction isPlainSafeFirst(c) {\n  // Uses a subset of ns-char - c-indicator\n  // where ns-char = nb-char - s-white.\n  // No support of ( ( \u201C?\u201D | \u201C:\u201D | \u201C-\u201D ) /* Followed by an ns-plain-safe(c)) */ ) part\n  return isPrintable(c) && c !== CHAR_BOM\n    && !isWhitespace(c) // - s-white\n    // - (c-indicator ::=\n    // \u201C-\u201D | \u201C?\u201D | \u201C:\u201D | \u201C,\u201D | \u201C[\u201D | \u201C]\u201D | \u201C{\u201D | \u201C}\u201D\n    && c !== CHAR_MINUS\n    && c !== CHAR_QUESTION\n    && c !== CHAR_COLON\n    && c !== CHAR_COMMA\n    && c !== CHAR_LEFT_SQUARE_BRACKET\n    && c !== CHAR_RIGHT_SQUARE_BRACKET\n    && c !== CHAR_LEFT_CURLY_BRACKET\n    && c !== CHAR_RIGHT_CURLY_BRACKET\n    // | \u201C#\u201D | \u201C&\u201D | \u201C*\u201D | \u201C!\u201D | \u201C|\u201D | \u201C=\u201D | \u201C>\u201D | \u201C'\u201D | \u201C\"\u201D\n    && c !== CHAR_SHARP\n    && c !== CHAR_AMPERSAND\n    && c !== CHAR_ASTERISK\n    && c !== CHAR_EXCLAMATION\n    && c !== CHAR_VERTICAL_LINE\n    && c !== CHAR_EQUALS\n    && c !== CHAR_GREATER_THAN\n    && c !== CHAR_SINGLE_QUOTE\n    && c !== CHAR_DOUBLE_QUOTE\n    // | \u201C%\u201D | \u201C@\u201D | \u201C`\u201D)\n    && c !== CHAR_PERCENT\n    && c !== CHAR_COMMERCIAL_AT\n    && c !== CHAR_GRAVE_ACCENT;\n}\n\n// Simplified test for values allowed as the last character in plain style.\nfunction isPlainSafeLast(c) {\n  // just not whitespace or colon, it will be checked to be plain character later\n  return !isWhitespace(c) && c !== CHAR_COLON;\n}\n\n// Same as 'string'.codePointAt(pos), but works in older browsers.\nfunction codePointAt(string, pos) {\n  var first = string.charCodeAt(pos), second;\n  if (first >= 0xD800 && first <= 0xDBFF && pos + 1 < string.length) {\n    second = string.charCodeAt(pos + 1);\n    if (second >= 0xDC00 && second <= 0xDFFF) {\n      // https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae\n      return (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;\n    }\n  }\n  return first;\n}\n\n// Determines whether block indentation indicator is required.\nfunction needIndentIndicator(string) {\n  var leadingSpaceRe = /^\\n* /;\n  return leadingSpaceRe.test(string);\n}\n\nvar STYLE_PLAIN   = 1,\n    STYLE_SINGLE  = 2,\n    STYLE_LITERAL = 3,\n    STYLE_FOLDED  = 4,\n    STYLE_DOUBLE  = 5;\n\n// Determines which scalar styles are possible and returns the preferred style.\n// lineWidth = -1 => no limit.\n// Pre-conditions: str.length > 0.\n// Post-conditions:\n//    STYLE_PLAIN or STYLE_SINGLE => no \\n are in the string.\n//    STYLE_LITERAL => no lines are suitable for folding (or lineWidth is -1).\n//    STYLE_FOLDED => a line > lineWidth and can be folded (and lineWidth != -1).\nfunction chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n  testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n  var i;\n  var char = 0;\n  var prevChar = null;\n  var hasLineBreak = false;\n  var hasFoldableLine = false; // only checked if shouldTrackWidth\n  var shouldTrackWidth = lineWidth !== -1;\n  var previousLineBreak = -1; // count the first line correctly\n  var plain = isPlainSafeFirst(codePointAt(string, 0))\n          && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n  if (singleLineOnly || forceQuotes) {\n    // Case: no block styles.\n    // Check for disallowed characters to rule out plain and single.\n    for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n      char = codePointAt(string, i);\n      if (!isPrintable(char)) {\n        return STYLE_DOUBLE;\n      }\n      plain = plain && isPlainSafe(char, prevChar, inblock);\n      prevChar = char;\n    }\n  } else {\n    // Case: block styles permitted.\n    for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n      char = codePointAt(string, i);\n      if (char === CHAR_LINE_FEED) {\n        hasLineBreak = true;\n        // Check if any line can be folded.\n        if (shouldTrackWidth) {\n          hasFoldableLine = hasFoldableLine ||\n            // Foldable line = too long, and not more-indented.\n            (i - previousLineBreak - 1 > lineWidth &&\n             string[previousLineBreak + 1] !== ' ');\n          previousLineBreak = i;\n        }\n      } else if (!isPrintable(char)) {\n        return STYLE_DOUBLE;\n      }\n      plain = plain && isPlainSafe(char, prevChar, inblock);\n      prevChar = char;\n    }\n    // in case the end is missing a \\n\n    hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n      (i - previousLineBreak - 1 > lineWidth &&\n       string[previousLineBreak + 1] !== ' '));\n  }\n  // Although every style can represent \\n without escaping, prefer block styles\n  // for multiline, since they're more readable and they don't add empty lines.\n  // Also prefer folding a super-long line.\n  if (!hasLineBreak && !hasFoldableLine) {\n    // Strings interpretable as another type have to be quoted;\n    // e.g. the string 'true' vs. the boolean true.\n    if (plain && !forceQuotes && !testAmbiguousType(string)) {\n      return STYLE_PLAIN;\n    }\n    return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n  }\n  // Edge case: block indentation indicator can only have one digit.\n  if (indentPerLevel > 9 && needIndentIndicator(string)) {\n    return STYLE_DOUBLE;\n  }\n  // At this point we know block styles are valid.\n  // Prefer literal style unless we want to fold.\n  if (!forceQuotes) {\n    return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n  }\n  return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}\n\n// Note: line breaking/folding is implemented for only the folded style.\n// NB. We drop the last trailing newline (if any) of a returned block scalar\n//  since the dumper adds its own newline. This always works:\n//    \u2022 No ending newline => unaffected; already using strip \"-\" chomping.\n//    \u2022 Ending newline    => removed then restored.\n//  Importantly, this keeps the \"+\" chomp indicator from gaining an extra line.\nfunction writeScalar(state, string, level, iskey, inblock) {\n  state.dump = (function () {\n    if (string.length === 0) {\n      return state.quotingType === QUOTING_TYPE_DOUBLE ? '\"\"' : \"''\";\n    }\n    if (!state.noCompatMode) {\n      if (DEPRECATED_BOOLEANS_SYNTAX.indexOf(string) !== -1 || DEPRECATED_BASE60_SYNTAX.test(string)) {\n        return state.quotingType === QUOTING_TYPE_DOUBLE ? ('\"' + string + '\"') : (\"'\" + string + \"'\");\n      }\n    }\n\n    var indent = state.indent * Math.max(1, level); // no 0-indent scalars\n    // As indentation gets deeper, let the width decrease monotonically\n    // to the lower bound min(state.lineWidth, 40).\n    // Note that this implies\n    //  state.lineWidth \u2264 40 + state.indent: width is fixed at the lower bound.\n    //  state.lineWidth > 40 + state.indent: width decreases until the lower bound.\n    // This behaves better than a constant minimum width which disallows narrower options,\n    // or an indent threshold which causes the width to suddenly increase.\n    var lineWidth = state.lineWidth === -1\n      ? -1 : Math.max(Math.min(state.lineWidth, 40), state.lineWidth - indent);\n\n    // Without knowing if keys are implicit/explicit, assume implicit for safety.\n    var singleLineOnly = iskey\n      // No block styles in flow mode.\n      || (state.flowLevel > -1 && level >= state.flowLevel);\n    function testAmbiguity(string) {\n      return testImplicitResolving(state, string);\n    }\n\n    switch (chooseScalarStyle(string, singleLineOnly, state.indent, lineWidth,\n      testAmbiguity, state.quotingType, state.forceQuotes && !iskey, inblock)) {\n\n      case STYLE_PLAIN:\n        return string;\n      case STYLE_SINGLE:\n        return \"'\" + string.replace(/'/g, \"''\") + \"'\";\n      case STYLE_LITERAL:\n        return '|' + blockHeader(string, state.indent)\n          + dropEndingNewline(indentString(string, indent));\n      case STYLE_FOLDED:\n        return '>' + blockHeader(string, state.indent)\n          + dropEndingNewline(indentString(foldString(string, lineWidth), indent));\n      case STYLE_DOUBLE:\n        return '\"' + escapeString(string) + '\"';\n      default:\n        throw new exception('impossible error: invalid scalar style');\n    }\n  }());\n}\n\n// Pre-conditions: string is valid for a block scalar, 1 <= indentPerLevel <= 9.\nfunction blockHeader(string, indentPerLevel) {\n  var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n  // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n  var clip =          string[string.length - 1] === '\\n';\n  var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n  var chomp = keep ? '+' : (clip ? '' : '-');\n\n  return indentIndicator + chomp + '\\n';\n}\n\n// (See the note for writeScalar.)\nfunction dropEndingNewline(string) {\n  return string[string.length - 1] === '\\n' ? string.slice(0, -1) : string;\n}\n\n// Note: a long line without a suitable break point will exceed the width limit.\n// Pre-conditions: every char in str isPrintable, str.length > 0, width > 0.\nfunction foldString(string, width) {\n  // In folded style, $k$ consecutive newlines output as $k+1$ newlines\u2014\n  // unless they're before or after a more-indented line, or at the very\n  // beginning or end, in which case $k$ maps to $k$.\n  // Therefore, parse each chunk as newline(s) followed by a content line.\n  var lineRe = /(\\n+)([^\\n]*)/g;\n\n  // first line (possibly an empty line)\n  var result = (function () {\n    var nextLF = string.indexOf('\\n');\n    nextLF = nextLF !== -1 ? nextLF : string.length;\n    lineRe.lastIndex = nextLF;\n    return foldLine(string.slice(0, nextLF), width);\n  }());\n  // If we haven't reached the first content line yet, don't add an extra \\n.\n  var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n  var moreIndented;\n\n  // rest of the lines\n  var match;\n  while ((match = lineRe.exec(string))) {\n    var prefix = match[1], line = match[2];\n    moreIndented = (line[0] === ' ');\n    result += prefix\n      + (!prevMoreIndented && !moreIndented && line !== ''\n        ? '\\n' : '')\n      + foldLine(line, width);\n    prevMoreIndented = moreIndented;\n  }\n\n  return result;\n}\n\n// Greedy line breaking.\n// Picks the longest line under the limit each time,\n// otherwise settles for the shortest line over the limit.\n// NB. More-indented lines *cannot* be folded, as that would add an extra \\n.\nfunction foldLine(line, width) {\n  if (line === '' || line[0] === ' ') return line;\n\n  // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n  var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n  var match;\n  // start is an inclusive index. end, curr, and next are exclusive.\n  var start = 0, end, curr = 0, next = 0;\n  var result = '';\n\n  // Invariants: 0 <= start <= length-1.\n  //   0 <= curr <= next <= max(0, length-2). curr - start <= width.\n  // Inside the loop:\n  //   A match implies length >= 2, so curr and next are <= length-2.\n  while ((match = breakRe.exec(line))) {\n    next = match.index;\n    // maintain invariant: curr - start <= width\n    if (next - start > width) {\n      end = (curr > start) ? curr : next; // derive end <= length-2\n      result += '\\n' + line.slice(start, end);\n      // skip the space that was output as \\n\n      start = end + 1;                    // derive start <= length-1\n    }\n    curr = next;\n  }\n\n  // By the invariants, start <= length-1, so there is something left over.\n  // It is either the whole string or a part starting from non-whitespace.\n  result += '\\n';\n  // Insert a break if the remainder is too long and there is a break available.\n  if (line.length - start > width && curr > start) {\n    result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n  } else {\n    result += line.slice(start);\n  }\n\n  return result.slice(1); // drop extra \\n joiner\n}\n\n// Escapes a double-quoted string.\nfunction escapeString(string) {\n  var result = '';\n  var char = 0;\n  var escapeSeq;\n\n  for (var i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n    char = codePointAt(string, i);\n    escapeSeq = ESCAPE_SEQUENCES[char];\n\n    if (!escapeSeq && isPrintable(char)) {\n      result += string[i];\n      if (char >= 0x10000) result += string[i + 1];\n    } else {\n      result += escapeSeq || encodeHex(char);\n    }\n  }\n\n  return result;\n}\n\nfunction writeFlowSequence(state, level, object) {\n  var _result = '',\n      _tag    = state.tag,\n      index,\n      length,\n      value;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    value = object[index];\n\n    if (state.replacer) {\n      value = state.replacer.call(object, String(index), value);\n    }\n\n    // Write only valid elements, put null instead of invalid elements.\n    if (writeNode(state, level, value, false, false) ||\n        (typeof value === 'undefined' &&\n         writeNode(state, level, null, false, false))) {\n\n      if (_result !== '') _result += ',' + (!state.condenseFlow ? ' ' : '');\n      _result += state.dump;\n    }\n  }\n\n  state.tag = _tag;\n  state.dump = '[' + _result + ']';\n}\n\nfunction writeBlockSequence(state, level, object, compact) {\n  var _result = '',\n      _tag    = state.tag,\n      index,\n      length,\n      value;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    value = object[index];\n\n    if (state.replacer) {\n      value = state.replacer.call(object, String(index), value);\n    }\n\n    // Write only valid elements, put null instead of invalid elements.\n    if (writeNode(state, level + 1, value, true, true, false, true) ||\n        (typeof value === 'undefined' &&\n         writeNode(state, level + 1, null, true, true, false, true))) {\n\n      if (!compact || _result !== '') {\n        _result += generateNextLine(state, level);\n      }\n\n      if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n        _result += '-';\n      } else {\n        _result += '- ';\n      }\n\n      _result += state.dump;\n    }\n  }\n\n  state.tag = _tag;\n  state.dump = _result || '[]'; // Empty sequence if no valid values.\n}\n\nfunction writeFlowMapping(state, level, object) {\n  var _result       = '',\n      _tag          = state.tag,\n      objectKeyList = Object.keys(object),\n      index,\n      length,\n      objectKey,\n      objectValue,\n      pairBuffer;\n\n  for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n\n    pairBuffer = '';\n    if (_result !== '') pairBuffer += ', ';\n\n    if (state.condenseFlow) pairBuffer += '\"';\n\n    objectKey = objectKeyList[index];\n    objectValue = object[objectKey];\n\n    if (state.replacer) {\n      objectValue = state.replacer.call(object, objectKey, objectValue);\n    }\n\n    if (!writeNode(state, level, objectKey, false, false)) {\n      continue; // Skip this pair because of invalid key;\n    }\n\n    if (state.dump.length > 1024) pairBuffer += '? ';\n\n    pairBuffer += state.dump + (state.condenseFlow ? '\"' : '') + ':' + (state.condenseFlow ? '' : ' ');\n\n    if (!writeNode(state, level, objectValue, false, false)) {\n      continue; // Skip this pair because of invalid value.\n    }\n\n    pairBuffer += state.dump;\n\n    // Both key and value are valid.\n    _result += pairBuffer;\n  }\n\n  state.tag = _tag;\n  state.dump = '{' + _result + '}';\n}\n\nfunction writeBlockMapping(state, level, object, compact) {\n  var _result       = '',\n      _tag          = state.tag,\n      objectKeyList = Object.keys(object),\n      index,\n      length,\n      objectKey,\n      objectValue,\n      explicitPair,\n      pairBuffer;\n\n  // Allow sorting keys so that the output file is deterministic\n  if (state.sortKeys === true) {\n    // Default sorting\n    objectKeyList.sort();\n  } else if (typeof state.sortKeys === 'function') {\n    // Custom sort function\n    objectKeyList.sort(state.sortKeys);\n  } else if (state.sortKeys) {\n    // Something is wrong\n    throw new exception('sortKeys must be a boolean or a function');\n  }\n\n  for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n    pairBuffer = '';\n\n    if (!compact || _result !== '') {\n      pairBuffer += generateNextLine(state, level);\n    }\n\n    objectKey = objectKeyList[index];\n    objectValue = object[objectKey];\n\n    if (state.replacer) {\n      objectValue = state.replacer.call(object, objectKey, objectValue);\n    }\n\n    if (!writeNode(state, level + 1, objectKey, true, true, true)) {\n      continue; // Skip this pair because of invalid key.\n    }\n\n    explicitPair = (state.tag !== null && state.tag !== '?') ||\n                   (state.dump && state.dump.length > 1024);\n\n    if (explicitPair) {\n      if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n        pairBuffer += '?';\n      } else {\n        pairBuffer += '? ';\n      }\n    }\n\n    pairBuffer += state.dump;\n\n    if (explicitPair) {\n      pairBuffer += generateNextLine(state, level);\n    }\n\n    if (!writeNode(state, level + 1, objectValue, true, explicitPair)) {\n      continue; // Skip this pair because of invalid value.\n    }\n\n    if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n      pairBuffer += ':';\n    } else {\n      pairBuffer += ': ';\n    }\n\n    pairBuffer += state.dump;\n\n    // Both key and value are valid.\n    _result += pairBuffer;\n  }\n\n  state.tag = _tag;\n  state.dump = _result || '{}'; // Empty mapping if no valid pairs.\n}\n\nfunction detectType(state, object, explicit) {\n  var _result, typeList, index, length, type, style;\n\n  typeList = explicit ? state.explicitTypes : state.implicitTypes;\n\n  for (index = 0, length = typeList.length; index < length; index += 1) {\n    type = typeList[index];\n\n    if ((type.instanceOf  || type.predicate) &&\n        (!type.instanceOf || ((typeof object === 'object') && (object instanceof type.instanceOf))) &&\n        (!type.predicate  || type.predicate(object))) {\n\n      if (explicit) {\n        if (type.multi && type.representName) {\n          state.tag = type.representName(object);\n        } else {\n          state.tag = type.tag;\n        }\n      } else {\n        state.tag = '?';\n      }\n\n      if (type.represent) {\n        style = state.styleMap[type.tag] || type.defaultStyle;\n\n        if (_toString.call(type.represent) === '[object Function]') {\n          _result = type.represent(object, style);\n        } else if (_hasOwnProperty.call(type.represent, style)) {\n          _result = type.represent[style](object, style);\n        } else {\n          throw new exception('!<' + type.tag + '> tag resolver accepts not \"' + style + '\" style');\n        }\n\n        state.dump = _result;\n      }\n\n      return true;\n    }\n  }\n\n  return false;\n}\n\n// Serializes `object` and writes it to global `result`.\n// Returns true on success, or false on invalid object.\n//\nfunction writeNode(state, level, object, block, compact, iskey, isblockseq) {\n  state.tag = null;\n  state.dump = object;\n\n  if (!detectType(state, object, false)) {\n    detectType(state, object, true);\n  }\n\n  var type = _toString.call(state.dump);\n  var inblock = block;\n  var tagStr;\n\n  if (block) {\n    block = (state.flowLevel < 0 || state.flowLevel > level);\n  }\n\n  var objectOrArray = type === '[object Object]' || type === '[object Array]',\n      duplicateIndex,\n      duplicate;\n\n  if (objectOrArray) {\n    duplicateIndex = state.duplicates.indexOf(object);\n    duplicate = duplicateIndex !== -1;\n  }\n\n  if ((state.tag !== null && state.tag !== '?') || duplicate || (state.indent !== 2 && level > 0)) {\n    compact = false;\n  }\n\n  if (duplicate && state.usedDuplicates[duplicateIndex]) {\n    state.dump = '*ref_' + duplicateIndex;\n  } else {\n    if (objectOrArray && duplicate && !state.usedDuplicates[duplicateIndex]) {\n      state.usedDuplicates[duplicateIndex] = true;\n    }\n    if (type === '[object Object]') {\n      if (block && (Object.keys(state.dump).length !== 0)) {\n        writeBlockMapping(state, level, state.dump, compact);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + state.dump;\n        }\n      } else {\n        writeFlowMapping(state, level, state.dump);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;\n        }\n      }\n    } else if (type === '[object Array]') {\n      if (block && (state.dump.length !== 0)) {\n        if (state.noArrayIndent && !isblockseq && level > 0) {\n          writeBlockSequence(state, level - 1, state.dump, compact);\n        } else {\n          writeBlockSequence(state, level, state.dump, compact);\n        }\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + state.dump;\n        }\n      } else {\n        writeFlowSequence(state, level, state.dump);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;\n        }\n      }\n    } else if (type === '[object String]') {\n      if (state.tag !== '?') {\n        writeScalar(state, state.dump, level, iskey, inblock);\n      }\n    } else if (type === '[object Undefined]') {\n      return false;\n    } else {\n      if (state.skipInvalid) return false;\n      throw new exception('unacceptable kind of an object to dump ' + type);\n    }\n\n    if (state.tag !== null && state.tag !== '?') {\n      // Need to encode all characters except those allowed by the spec:\n      //\n      // [35] ns-dec-digit    ::=  [#x30-#x39] /* 0-9 */\n      // [36] ns-hex-digit    ::=  ns-dec-digit\n      //                         | [#x41-#x46] /* A-F */ | [#x61-#x66] /* a-f */\n      // [37] ns-ascii-letter ::=  [#x41-#x5A] /* A-Z */ | [#x61-#x7A] /* a-z */\n      // [38] ns-word-char    ::=  ns-dec-digit | ns-ascii-letter | \u201C-\u201D\n      // [39] ns-uri-char     ::=  \u201C%\u201D ns-hex-digit ns-hex-digit | ns-word-char | \u201C#\u201D\n      //                         | \u201C;\u201D | \u201C/\u201D | \u201C?\u201D | \u201C:\u201D | \u201C@\u201D | \u201C&\u201D | \u201C=\u201D | \u201C+\u201D | \u201C$\u201D | \u201C,\u201D\n      //                         | \u201C_\u201D | \u201C.\u201D | \u201C!\u201D | \u201C~\u201D | \u201C*\u201D | \u201C'\u201D | \u201C(\u201D | \u201C)\u201D | \u201C[\u201D | \u201C]\u201D\n      //\n      // Also need to encode '!' because it has special meaning (end of tag prefix).\n      //\n      tagStr = encodeURI(\n        state.tag[0] === '!' ? state.tag.slice(1) : state.tag\n      ).replace(/!/g, '%21');\n\n      if (state.tag[0] === '!') {\n        tagStr = '!' + tagStr;\n      } else if (tagStr.slice(0, 18) === 'tag:yaml.org,2002:') {\n        tagStr = '!!' + tagStr.slice(18);\n      } else {\n        tagStr = '!<' + tagStr + '>';\n      }\n\n      state.dump = tagStr + ' ' + state.dump;\n    }\n  }\n\n  return true;\n}\n\nfunction getDuplicateReferences(object, state) {\n  var objects = [],\n      duplicatesIndexes = [],\n      index,\n      length;\n\n  inspectNode(object, objects, duplicatesIndexes);\n\n  for (index = 0, length = duplicatesIndexes.length; index < length; index += 1) {\n    state.duplicates.push(objects[duplicatesIndexes[index]]);\n  }\n  state.usedDuplicates = new Array(length);\n}\n\nfunction inspectNode(object, objects, duplicatesIndexes) {\n  var objectKeyList,\n      index,\n      length;\n\n  if (object !== null && typeof object === 'object') {\n    index = objects.indexOf(object);\n    if (index !== -1) {\n      if (duplicatesIndexes.indexOf(index) === -1) {\n        duplicatesIndexes.push(index);\n      }\n    } else {\n      objects.push(object);\n\n      if (Array.isArray(object)) {\n        for (index = 0, length = object.length; index < length; index += 1) {\n          inspectNode(object[index], objects, duplicatesIndexes);\n        }\n      } else {\n        objectKeyList = Object.keys(object);\n\n        for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n          inspectNode(object[objectKeyList[index]], objects, duplicatesIndexes);\n        }\n      }\n    }\n  }\n}\n\nfunction dump$1(input, options) {\n  options = options || {};\n\n  var state = new State(options);\n\n  if (!state.noRefs) getDuplicateReferences(input, state);\n\n  var value = input;\n\n  if (state.replacer) {\n    value = state.replacer.call({ '': value }, '', value);\n  }\n\n  if (writeNode(state, 0, value, true, true)) return state.dump + '\\n';\n\n  return '';\n}\n\nvar dump_1 = dump$1;\n\nvar dumper = {\n\tdump: dump_1\n};\n\nfunction renamed(from, to) {\n  return function () {\n    throw new Error('Function yaml.' + from + ' is removed in js-yaml 4. ' +\n      'Use yaml.' + to + ' instead, which is now safe by default.');\n  };\n}\n\n\nvar Type                = type;\nvar Schema              = schema;\nvar FAILSAFE_SCHEMA     = failsafe;\nvar JSON_SCHEMA         = json;\nvar CORE_SCHEMA         = core;\nvar DEFAULT_SCHEMA      = _default;\nvar load                = loader.load;\nvar loadAll             = loader.loadAll;\nvar dump                = dumper.dump;\nvar YAMLException       = exception;\n\n// Re-export all types in case user wants to create custom schema\nvar types = {\n  binary:    binary,\n  float:     float,\n  map:       map,\n  null:      _null,\n  pairs:     pairs,\n  set:       set,\n  timestamp: timestamp,\n  bool:      bool,\n  int:       int,\n  merge:     merge,\n  omap:      omap,\n  seq:       seq,\n  str:       str\n};\n\n// Removed functions from JS-YAML 3.0.x\nvar safeLoad            = renamed('safeLoad', 'load');\nvar safeLoadAll         = renamed('safeLoadAll', 'loadAll');\nvar safeDump            = renamed('safeDump', 'dump');\n\nvar jsYaml = {\n\tType: Type,\n\tSchema: Schema,\n\tFAILSAFE_SCHEMA: FAILSAFE_SCHEMA,\n\tJSON_SCHEMA: JSON_SCHEMA,\n\tCORE_SCHEMA: CORE_SCHEMA,\n\tDEFAULT_SCHEMA: DEFAULT_SCHEMA,\n\tload: load,\n\tloadAll: loadAll,\n\tdump: dump,\n\tYAMLException: YAMLException,\n\ttypes: types,\n\tsafeLoad: safeLoad,\n\tsafeLoadAll: safeLoadAll,\n\tsafeDump: safeDump\n};\n\nexport { CORE_SCHEMA, DEFAULT_SCHEMA, FAILSAFE_SCHEMA, JSON_SCHEMA, Schema, Type, YAMLException, jsYaml as default, dump, load, loadAll, safeDump, safeLoad, safeLoadAll, types };\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ?\n          Math.max(Math.abs(numeric(n[2])), 1)\n        : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: unknown) => void = (\n  pattern: unknown,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string | null): c is ExtglobType =>\n  types.has(c as ExtglobType)\nconst isExtglobAST = (c: AST): c is AST & { type: ExtglobType } =>\n  isExtglobType(c.type)\n\n// Map of which extglob types can adopt the children of a nested extglob\n//\n// anything but ! can adopt a matching type:\n// +(a|+(b|c)|d) => +(a|b|c|d)\n// *(a|*(b|c)|d) => *(a|b|c|d)\n// @(a|@(b|c)|d) => @(a|b|c|d)\n// ?(a|?(b|c)|d) => ?(a|b|c|d)\n//\n// * can adopt anything, because 0 or repetition is allowed\n// *(a|?(b|c)|d) => *(a|b|c|d)\n// *(a|+(b|c)|d) => *(a|b|c|d)\n// *(a|@(b|c)|d) => *(a|b|c|d)\n//\n// + can adopt @, because 1 or repetition is allowed\n// +(a|@(b|c)|d) => +(a|b|c|d)\n//\n// + and @ CANNOT adopt *, because 0 would be allowed\n// +(a|*(b|c)|d) => would match \"\", on *(b|c)\n// @(a|*(b|c)|d) => would match \"\", on *(b|c)\n//\n// + and @ CANNOT adopt ?, because 0 would be allowed\n// +(a|?(b|c)|d) => would match \"\", on ?(b|c)\n// @(a|?(b|c)|d) => would match \"\", on ?(b|c)\n//\n// ? can adopt @, because 0 or 1 is allowed\n// ?(a|@(b|c)|d) => ?(a|b|c|d)\n//\n// ? and @ CANNOT adopt * or +, because >1 would be allowed\n// ?(a|*(b|c)|d) => would match bbb on *(b|c)\n// @(a|*(b|c)|d) => would match bbb on *(b|c)\n// ?(a|+(b|c)|d) => would match bbb on +(b|c)\n// @(a|+(b|c)|d) => would match bbb on +(b|c)\n//\n// ! CANNOT adopt ! (nothing else can either)\n// !(a|!(b|c)|d) => !(a|b|c|d) would fail to match on b (not not b|c)\n//\n// ! can adopt @\n// !(a|@(b|c)|d) => !(a|b|c|d)\n//\n// ! CANNOT adopt *\n// !(a|*(b|c)|d) => !(a|b|c|d) would match on bbb, not allowed\n//\n// ! CANNOT adopt +\n// !(a|+(b|c)|d) => !(a|b|c|d) would match on bbb, not allowed\n//\n// ! CANNOT adopt ?\n// x!(a|?(b|c)|d) => x!(a|b|c|d) would fail to match \"x\"\nconst adoptionMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['@']],\n  ['?', ['?', '@']],\n  ['@', ['@']],\n  ['*', ['*', '+', '?', '@']],\n  ['+', ['+', '@']],\n])\n\n// nested extglobs that can be adopted in, but with the addition of\n// a blank '' element.\nconst adoptionWithSpaceMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['?']],\n  ['@', ['?']],\n  ['+', ['?', '*']],\n])\n\n// union of the previous two maps\nconst adoptionAnyMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['?', '@']],\n  ['?', ['?', '@']],\n  ['@', ['?', '@']],\n  ['*', ['*', '+', '?', '@']],\n  ['+', ['+', '@', '?', '*']],\n])\n\n// Extglobs that can take over their parent if they are the only child\n// the key is parent, value maps child to resulting extglob parent type\n// '@' is omitted because it's a special case. An `@` extglob with a single\n// member can always be usurped by that subpattern.\nconst usurpMap = new Map<ExtglobType, Map<ExtglobType | null, ExtglobType | null>>([\n  ['!', new Map([['!', '@']])],\n  [\n    '?',\n    new Map([\n      ['*', '*'],\n      ['+', '*'],\n    ]),\n  ],\n  [\n    '@',\n    new Map([\n      ['!', '!'],\n      ['?', '?'],\n      ['@', '@'],\n      ['*', '*'],\n      ['+', '+'],\n    ]),\n  ],\n  [\n    '+',\n    new Map([\n      ['?', '*'],\n      ['*', '*'],\n    ]),\n  ],\n])\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nlet ID = 0\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  #parent?: AST\n  #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n  id = ++ID\n\n  get depth(): number {\n    return (this.#parent?.depth ?? -1) + 1\n  }\n\n  [Symbol.for('nodejs.util.inspect.custom')]() {\n    return {\n      '@@type': 'AST',\n      id: this.id,\n      type: this.type,\n      root: this.#root.id,\n      parent: this.#parent?.id,\n      depth: this.depth,\n      partsLength: this.#parts.length,\n      parts: this.#parts,\n    }\n  }\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n    extDepth: number,\n  ): number {\n    const maxDepth = opt.maxExtglobRecursion ?? 2\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        // we don't have to check for adoption here, because that's\n        // done at the other recursion point.\n        const doRecurse =\n          !opt.noext &&\n          isExtglobType(c) &&\n          str.charAt(i) === '(' &&\n          extDepth <= maxDepth\n        if (doRecurse) {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt, extDepth + 1)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      const doRecurse =\n        !opt.noext &&\n        isExtglobType(c) &&\n        str.charAt(i) === '(' &&\n        /* c8 ignore start - the maxDepth is sufficient here */\n        (extDepth <= maxDepth || (ast && ast.#canAdoptType(c)))\n      /* c8 ignore stop */\n      if (doRecurse) {\n        const depthAdd = ast && ast.#canAdoptType(c) ? 0 : 1\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt, extDepth + depthAdd)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  #canAdoptWithSpace(child?: AST | string): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    return this.#canAdopt(child, adoptionWithSpaceMap)\n  }\n\n  #canAdopt(\n    child?: AST | string,\n    map: Map<ExtglobType, ExtglobType[]> = adoptionMap,\n  ): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    if (\n      !child ||\n      typeof child !== 'object' ||\n      child.type !== null ||\n      child.#parts.length !== 1 ||\n      this.type === null\n    ) {\n      return false\n    }\n    const gc = child.#parts[0]\n    if (!gc || typeof gc !== 'object' || gc.type === null) {\n      return false\n    }\n    return (this as AST & { type: ExtglobType }).#canAdoptType(\n      gc.type,\n      map,\n    )\n  }\n  #canAdoptType(\n    c: string,\n    map: Map<ExtglobType, ExtglobType[]> = adoptionAnyMap,\n  ): c is ExtglobType {\n    return !!map.get(this.type as ExtglobType)?.includes(c as ExtglobType)\n  }\n\n  #adoptWithSpace(\n    this: AST & { type: ExtglobType },\n    child: AST & {\n      type: null\n    },\n    index: number,\n  ) {\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    const blank = new AST(null, gc, this.options)\n    blank.#parts.push('')\n    gc.push(blank)\n    this.#adopt(child, index)\n  }\n\n  #adopt(\n    child: AST & {\n      type: null\n    },\n    index: number,\n  ) {\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    this.#parts.splice(index, 1, ...gc.#parts)\n    for (const p of gc.#parts) {\n      if (typeof p === 'object') p.#parent = this\n    }\n    this.#toString = undefined\n  }\n\n  #canUsurpType(c: string): boolean {\n    const m = usurpMap.get(this.type as ExtglobType)\n    return !!(m?.has(c as ExtglobType))\n  }\n\n  #canUsurp (\n    child?: AST | string,\n  ): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    if (\n      !child ||\n      typeof child !== 'object' ||\n      child.type !== null ||\n      child.#parts.length !== 1 ||\n      this.type === null ||\n      this.#parts.length !== 1\n    ) {\n      return false\n    }\n    const gc = child.#parts[0]\n    if (!gc || typeof gc !== 'object' || gc.type === null) {\n      return false\n    }\n    return (this as AST & { type: ExtglobType }).#canUsurpType(gc.type)\n  }\n\n  #usurp(this: AST & { type: ExtglobType }, child: AST & { type: null }) {\n    const m = usurpMap.get(this.type as ExtglobType)\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    const nt = m?.get(gc.type)\n    /* c8 ignore start - impossible */\n    if (!nt) return false\n    /* c8 ignore stop */\n    this.#parts = gc.#parts\n    for (const p of this.#parts) {\n      if (typeof p === 'object') {\n        p.#parent = this\n      }\n    }\n    this.type = nt\n    this.#toString = undefined\n    this.#emptyExt = false\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options, 0)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) {\n      this.#flatten()\n      this.#fillNegs()\n    }\n    if (!isExtglobAST(this)) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      const me = this as AST\n      me.#parts = [s]\n      me.type = null\n      me.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #flatten() {\n    if (!isExtglobAST(this)) {\n      for (const p of this.#parts) {\n        if (typeof p === 'object') {\n          p.#flatten()\n        }\n      }\n    } else {\n      // do up to 10 passes to flatten as much as possible\n      let iterations = 0\n      let done = false\n      do {\n        done = true\n        for (let i = 0; i < this.#parts.length; i++) {\n          const c = this.#parts[i]\n          if (typeof c === 'object') {\n            c.#flatten()\n            if (this.#canAdopt(c)) {\n              done = false\n              this.#adopt(c, i)\n            } else if (this.#canAdoptWithSpace(c)) {\n              done = false\n              this.#adoptWithSpace(c, i)\n            } else if (this.#canUsurp(c)) {\n              done = false\n              this.#usurp(c)\n            }\n          }\n        }\n      } while (!done && ++iterations < 10)\n    }\n    this.#toString = undefined\n  }\n\n  #partsToRegExp(this: AST & { type: ExtglobType }, dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n  /**\n   * Max number of non-adjacent `**` patterns to recursively walk down.\n   *\n   * The default of 200 is almost certainly high enough for most purposes,\n   * and can handle absurdly excessive patterns.\n   */\n  maxGlobstarRecursion?: number\n\n  /**\n   * Max depth to traverse for nested extglobs like `*(a|b|c)`\n   *\n   * Default is 2, which is quite low, but any higher value\n   * swiftly results in punishing performance impacts. Note\n   * that this is *not*  relevant when the globstar types can\n   * be safely coalesced into a single set.\n   *\n   * For example, `*(a|@(b|c)|d)` would be flattened into\n   * `*(a|b|c|d)`. Thus, many common extglobs will retain good\n   * performance and  never hit this limit, even if they are\n   * excessively deep and complicated.\n   *\n   * If the limit is hit, then the extglob characters are simply\n   * not parsed, and the pattern effectively switches into\n   * `noextglob: true` mode for the contents of that nested\n   * sub-pattern. This will typically _not_ result in a match,\n   * but is considered a valid trade-off for security and\n   * performance.\n   */\n  maxExtglobRecursion?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n  maxGlobstarRecursion: number\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.maxGlobstarRecursion = options.maxGlobstarRecursion ?? 200\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    let fileStartIndex = 0\n    let patternStartIndex = 0\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        // start matching at the drive letter index of each\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          patternStartIndex = pdi\n          fileStartIndex = fdi\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    if (pattern.includes(GLOBSTAR)) {\n      return this.#matchGlobstar(\n        file,\n        pattern,\n        partial,\n        fileStartIndex,\n        patternStartIndex,\n      )\n    }\n\n    return this.#matchOne(\n      file,\n      pattern,\n      partial,\n      fileStartIndex,\n      patternStartIndex,\n    )\n  }\n\n  #matchGlobstar(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean,\n    fileIndex: number,\n    patternIndex: number,\n  ) {\n    // split the pattern into head, tail, and middle of ** delimited parts\n    const firstgs = pattern.indexOf(GLOBSTAR, patternIndex)\n    const lastgs = pattern.lastIndexOf(GLOBSTAR)\n\n    // split the pattern up into globstar-delimited sections\n    // the tail has to be at the end, and the others just have\n    // to be found in order from the head.\n    const [head, body, tail] = partial ? [\n      pattern.slice(patternIndex, firstgs),\n      pattern.slice(firstgs + 1),\n      [],\n    ] : [\n      pattern.slice(patternIndex, firstgs),\n      pattern.slice(firstgs + 1, lastgs),\n      pattern.slice(lastgs + 1),\n    ]\n\n    // check the head, from the current file/pattern index.\n    if (head.length) {\n      const fileHead = file.slice(fileIndex, fileIndex + head.length)\n      if (!this.#matchOne(fileHead, head, partial, 0, 0)) {\n        return false\n      }\n      fileIndex += head.length\n      patternIndex += head.length\n    }\n    // now we know the head matches!\n\n    // if the last portion is not empty, it MUST match the end\n    // check the tail\n    let fileTailMatch: number = 0\n    if (tail.length) {\n      // if head + tail > file, then we cannot possibly match\n      if (tail.length + fileIndex > file.length) return false\n\n      // try to match the tail\n      let tailStart = file.length - tail.length\n      if (this.#matchOne(file, tail, partial, tailStart, 0)) {\n        fileTailMatch = tail.length\n      } else {\n        // affordance for stuff like a/**/* matching a/b/\n        // if the last file portion is '', and there's more to the pattern\n        // then try without the '' bit.\n        if (\n          file[file.length - 1] !== '' ||\n          fileIndex + tail.length === file.length\n        ) {\n          return false\n        }\n        tailStart--\n        if (!this.#matchOne(file, tail, partial, tailStart, 0)) {\n          return false\n        }\n        fileTailMatch = tail.length + 1\n      }\n    }\n\n    // now we know the tail matches!\n\n    // the middle is zero or more portions wrapped in **, possibly\n    // containing more ** sections.\n    // so a/**/b/**/c/**/d has become **/b/**/c/**\n    // if it's empty, it means a/**/b, just verify we have no bad dots\n    // if there's no tail, so it ends on /**, then we must have *something*\n    // after the head, or it's not a matc\n    if (!body.length) {\n      let sawSome = !!fileTailMatch\n      for (let i = fileIndex; i < file.length - fileTailMatch; i++) {\n        const f = String(file[i])\n        sawSome = true\n        if (\n          f === '.' ||\n          f === '..' ||\n          (!this.options.dot && f.startsWith('.'))\n        ) {\n          return false\n        }\n      }\n      // in partial mode, we just need to get past all file parts\n      return partial || sawSome\n    }\n\n    // now we know that there's one or more body sections, which can\n    // be matched anywhere from the 0 index (because the head was pruned)\n    // through to the length-fileTailMatch index.\n    // split the body up into sections, and note the minimum index it can\n    // be found at (start with the length of all previous segments)\n    // [section, before, after]\n    const bodySegments: [ParseReturn[], number][] = [[[], 0]]\n    let currentBody: [ParseReturn[], number] = bodySegments[0]\n    let nonGsParts = 0\n    const nonGsPartsSums: number[] = [0]\n    for (const b of body) {\n      if (b === GLOBSTAR) {\n        nonGsPartsSums.push(nonGsParts)\n        currentBody = [[], 0]\n        bodySegments.push(currentBody)\n      } else {\n        currentBody[0].push(b)\n        nonGsParts++\n      }\n    }\n    let i = bodySegments.length - 1\n    const fileLength = file.length - fileTailMatch\n    for (const b of bodySegments) {\n      b[1] = fileLength - ((nonGsPartsSums[i--] as number) + b[0].length)\n    }\n\n    return !!this.#matchGlobStarBodySections(\n      file,\n      bodySegments,\n      fileIndex,\n      0,\n      partial,\n      0,\n      !!fileTailMatch,\n    )\n  }\n\n  // return false for \"nope, not matching\"\n  // return null for \"not matching, cannot keep trying\"\n  #matchGlobStarBodySections(\n    file: string[],\n    // pattern section, last possible position for it\n    bodySegments: [ParseReturn[], number][],\n    fileIndex: number,\n    bodyIndex: number,\n    partial: boolean,\n    globStarDepth: number,\n    sawTail: boolean,\n  ): boolean | null {\n    // take the first body segment, and walk from fileIndex to its \"after\"\n    // value at the end\n    // If it doesn't match at that position, we increment, until we hit\n    // that final possible position, and give up.\n    // If it does match, then advance and try to rest.\n    // If any of them fail we keep walking forward.\n    // this is still a bit recursively painful, but it's more constrained\n    // than previous implementations, because we never test something that\n    // can't possibly be a valid matching condition.\n    const bs = bodySegments[bodyIndex]\n    if (!bs) {\n      // just make sure that there's no bad dots\n      for (let i = fileIndex; i < file.length; i++) {\n        sawTail = true\n        const f = file[i]\n        if (\n          f === '.' ||\n          f === '..' ||\n          (!this.options.dot && f.startsWith('.'))\n        ) {\n          return false\n        }\n      }\n      return sawTail\n    }\n\n    // have a non-globstar body section to test\n    const [body, after] = bs\n    while (fileIndex <= after) {\n      const m = this.#matchOne(\n        file.slice(0, fileIndex + body.length),\n        body,\n        partial,\n        fileIndex,\n        0,\n      )\n      // if limit exceeded, no match. intentional false negative,\n      // acceptable break in correctness for security.\n      if (m && globStarDepth < this.maxGlobstarRecursion) {\n        // match! see if the rest match. if so, we're done!\n        const sub = this.#matchGlobStarBodySections(\n          file,\n          bodySegments,\n          fileIndex + body.length,\n          bodyIndex + 1,\n          partial,\n          globStarDepth + 1,\n          sawTail,\n        )\n        if (sub !== false) {\n          return sub\n        }\n      }\n      const f = file[fileIndex]\n      if (\n        f === '.' ||\n        f === '..' ||\n        (!this.options.dot && f.startsWith('.'))\n      ) {\n        return false\n      }\n\n      fileIndex++\n    }\n    // walked off. no point continuing\n    return partial || null\n  }\n\n  #matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean,\n    fileIndex: number,\n    patternIndex: number,\n  ) {\n    let fi: number\n    let pi: number\n    let pl: number\n    let fl: number\n    for (\n      fi = fileIndex,\n        pi = patternIndex,\n        fl = file.length,\n        pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      let p = pattern[pi]\n      let f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false || p === GLOBSTAR) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "/** Validation utilities for CDS compilation output files. */\n\nimport { readFileSync } from 'fs';\nimport { isAbsolute, join } from 'path';\n\nimport type {\n  CompilationTask,\n  ResultDependencyStatusUpdate,\n  ResultOutputFileValidation,\n  ResultTaskValidation,\n} from './types';\nimport { fileExists } from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport type { CdsDependencyGraph } from '../parser/types';\n\n/**\n * Identifies tasks requiring retry based on output validation\n * @param dependencyGraph The dependency graph containing tasks to validate\n * @returns Map of project directory to failed tasks that need retry\n */\nexport function identifyTasksRequiringRetry(\n  dependencyGraph: CdsDependencyGraph,\n): Map<string, CompilationTask[]> {\n  const tasksRequiringRetry = new Map<string, CompilationTask[]>();\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    const failedTasks: CompilationTask[] = [];\n\n    for (const task of project.compilationTasks) {\n      // Skip tasks that have already been retried.\n      if (task.retryInfo?.hasBeenRetried) {\n        continue;\n      }\n\n      // Always validate output files exist, regardless of task status.\n      const validationResult = validateTaskOutputs(task, dependencyGraph.sourceRootDir);\n\n      if (!validationResult.isValid) {\n        failedTasks.push(task);\n        cdsExtractorLog(\n          'info',\n          `Task ${task.id} requires retry: ${validationResult.validFileCount}/${validationResult.expectedFileCount} output files valid (status: ${task.status})`,\n        );\n\n        // Update task status to reflect actual file state.\n        if (task.status === 'success') {\n          cdsExtractorLog(\n            'warn',\n            `Task ${task.id} was marked as successful but output files are missing or invalid - updating status to failed`,\n          );\n          task.status = 'failed';\n        }\n      }\n    }\n\n    if (failedTasks.length > 0) {\n      tasksRequiringRetry.set(projectDir, failedTasks);\n    }\n  }\n\n  if (tasksRequiringRetry.size > 0) {\n    const totalFailedTasks = Array.from(tasksRequiringRetry.values()).reduce(\n      (sum, tasks) => sum + tasks.length,\n      0,\n    );\n    cdsExtractorLog(\n      'info',\n      `Identified ${totalFailedTasks} task(s) requiring retry across ${tasksRequiringRetry.size} project(s)`,\n    );\n  }\n\n  return tasksRequiringRetry;\n}\n\n/**\n * Updates the dependency graph with current task status based on filesystem validation.\n * This is the single source of truth for compilation task status across all phases.\n */\nexport function updateCdsDependencyGraphStatus(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRootDir: string,\n): ResultDependencyStatusUpdate {\n  let successfulTasks = 0;\n  let failedTasks = 0;\n  let tasksSuccessfullyRetried = 0;\n\n  // Validate all tasks using filesystem checks\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      const validationResult = validateTaskOutputs(task, sourceRootDir);\n      const isValid = validationResult.isValid;\n\n      if (isValid) {\n        task.status = 'success';\n        successfulTasks++;\n\n        // If task has retry info and is now successful, count as successfully retried\n        if (task.retryInfo?.hasBeenRetried) {\n          tasksSuccessfullyRetried++;\n        }\n      } else {\n        task.status = 'failed';\n        failedTasks++;\n      }\n    }\n  }\n\n  // Update dependency graph counters\n  dependencyGraph.statusSummary.successfulCompilations = successfulTasks;\n  dependencyGraph.statusSummary.failedCompilations = failedTasks;\n\n  // Update retry status tracking\n  dependencyGraph.retryStatus.totalTasksSuccessfullyRetried = tasksSuccessfullyRetried;\n  dependencyGraph.retryStatus.totalTasksRequiringRetry = failedTasks;\n\n  return {\n    tasksValidated: successfulTasks + failedTasks,\n    successfulTasks,\n    failedTasks,\n    tasksSuccessfullyRetried,\n  };\n}\n/**\n * Validates a single expected output file.\n * @param filePath Path to the output file to validate\n * @returns Validation result with details\n */\nexport function validateOutputFile(filePath: string): ResultOutputFileValidation {\n  const result: ResultOutputFileValidation = {\n    isValid: false,\n    filePath,\n    exists: false,\n  };\n\n  // Check if file exists\n  if (!fileExists(filePath)) {\n    result.error = 'File does not exist';\n    return result;\n  }\n\n  result.exists = true;\n\n  // For .cds.json files, validate JSON content\n  if (filePath.endsWith('.cds.json') || filePath.endsWith('.json')) {\n    try {\n      const content = readFileSync(filePath, 'utf8');\n\n      // Check if content is empty\n      if (!content.trim()) {\n        result.error = 'File is empty';\n        return result;\n      }\n\n      // Try to parse as JSON\n      const parsed: unknown = JSON.parse(content);\n\n      // Basic structure validation for CDS JSON files\n      if (typeof parsed !== 'object' || parsed === null) {\n        result.error = 'File does not contain a valid JSON object';\n        return result;\n      }\n\n      result.hasValidJson = true;\n      result.isValid = true;\n    } catch (error) {\n      result.error = `Invalid JSON content: ${String(error)}`;\n      return result;\n    }\n  } else {\n    // For non-JSON files, existence is sufficient\n    result.isValid = true;\n  }\n\n  return result;\n}\n\n/**\n * Validates that all expected output files exist for a compilation task.\n * @param task The compilation task to validate\n * @param sourceRoot Source root directory for resolving relative paths\n * @returns Task-level validation result\n */\nexport function validateTaskOutputs(\n  task: CompilationTask,\n  sourceRoot: string,\n): ResultTaskValidation {\n  const fileResults: ResultOutputFileValidation[] = [];\n\n  // Resolve the output file path relative to source root\n  const expectedOutput = task.expectedOutputFile;\n  const absolutePath = isAbsolute(expectedOutput)\n    ? expectedOutput\n    : join(sourceRoot, expectedOutput);\n\n  const fileResult = validateOutputFile(absolutePath);\n  fileResults.push(fileResult);\n\n  const validFileCount = fileResults.filter(r => r.isValid).length;\n  const expectedFileCount = 1;\n  const isValid = validFileCount === expectedFileCount && expectedFileCount > 0;\n\n  return {\n    isValid,\n    task,\n    fileResults,\n    validFileCount,\n    expectedFileCount,\n  };\n}\n", "import { execFileSync } from 'child_process';\nimport { isAbsolute, relative, resolve } from 'path';\n\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Severity levels for diagnostics\n */\nexport enum DiagnosticSeverity {\n  Error = 'error',\n  Warning = 'warning',\n  Note = 'note',\n  Recommendation = 'recommendation',\n}\n\n/**\n * Converts a file path to be relative to the source root if possible\n * @param filePath The file path to convert\n * @param sourceRoot The source root directory to make the path relative to\n * @returns The relative path if the file is under source root, otherwise '.' (source root)\n */\nexport function convertToRelativePath(filePath: string, sourceRoot: string): string {\n  // Handle invalid inputs\n  if (!filePath || typeof filePath !== 'string' || !sourceRoot || typeof sourceRoot !== 'string') {\n    return '.';\n  }\n\n  try {\n    const resolvedSourceRoot = resolve(sourceRoot);\n\n    // If filePath is absolute, resolve it directly; otherwise resolve relative to sourceRoot\n    // Use path.isAbsolute() for cross-platform compatibility (Unix and Windows paths)\n    const resolvedFilePath = isAbsolute(filePath)\n      ? resolve(filePath)\n      : resolve(resolvedSourceRoot, filePath);\n\n    // If the file path is the same as source root, return '.'\n    if (resolvedFilePath === resolvedSourceRoot) {\n      return '.';\n    }\n\n    const relativePath = relative(resolvedSourceRoot, resolvedFilePath);\n\n    // If the relative path starts with '..' it means the file is outside the source root\n    // Per CodeQL requirements, we should point to the source root '.' instead\n    if (relativePath.startsWith('..')) {\n      return '.';\n    }\n\n    return relativePath;\n  } catch {\n    // If path resolution fails for any reason, fallback to source root\n    return '.';\n  }\n}\n\n/**\n * Base function to add a diagnostic to the CodeQL database\n * @param filePath Path to the file related to the diagnostic\n * @param message The diagnostic message\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceId The source ID for the diagnostic\n * @param sourceName The source name for the diagnostic\n * @param severity The severity level of the diagnostic\n * @param logPrefix Prefix for the log message\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nfunction addDiagnostic(\n  filePath: string,\n  message: string,\n  codeqlExePath: string,\n  sourceId: string,\n  sourceName: string,\n  severity: DiagnosticSeverity,\n  logPrefix: string,\n  sourceRoot?: string,\n): boolean {\n  const finalFilePath = sourceRoot\n    ? convertToRelativePath(filePath, sourceRoot)\n    : resolve(filePath);\n\n  // If the file was remapped to source root due to being outside the repository,\n  // append an explanatory note to the message\n  let finalMessage = message;\n  if (sourceRoot && finalFilePath === '.' && filePath !== sourceRoot) {\n    const resolvedSourceRoot = resolve(sourceRoot);\n    // Use path.isAbsolute() for cross-platform compatibility (Unix and Windows paths)\n    const resolvedFilePath = isAbsolute(filePath)\n      ? resolve(filePath)\n      : resolve(resolvedSourceRoot, filePath);\n\n    // Only add the note if the file was actually outside the source root\n    if (resolvedFilePath !== resolvedSourceRoot) {\n      finalMessage = `${message}\\n\\n**Note**: The file \\`${filePath}\\` is located outside the scanned source directory and cannot be linked directly in this diagnostic. This diagnostic is associated with the repository root instead.`;\n    }\n  }\n\n  try {\n    execFileSync(codeqlExePath, [\n      'database',\n      'add-diagnostic',\n      '--extractor-name=cds',\n      '--ready-for-status-page',\n      `--source-id=${sourceId}`,\n      `--source-name=${sourceName}`,\n      `--severity=${severity}`,\n      `--markdown-message=${finalMessage}`,\n      `--file-path=${finalFilePath}`,\n      '--',\n      `${process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE ?? ''}`,\n    ]);\n    cdsExtractorLog('info', `Added ${severity} diagnostic for ${logPrefix}: ${filePath}`);\n    return true;\n  } catch (err) {\n    cdsExtractorLog(\n      'error',\n      `Failed to add ${severity} diagnostic for ${logPrefix}=${filePath} : ${String(err)}`,\n    );\n    return false;\n  }\n}\n\n/**\n * Add a diagnostic warning to the CodeQL database for a CDS indexer failure\n * @param projectDir The project directory where the cds-indexer failed\n * @param errorMessage The error message from the cds-indexer execution\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addCdsIndexerDiagnostic(\n  projectDir: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    projectDir,\n    errorMessage,\n    codeqlExePath,\n    'cds/indexer-failure',\n    'Failure running @sap/cds-indexer for a SAP CAP CDS project',\n    DiagnosticSeverity.Warning,\n    'project directory',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for a failed CDS compilation\n * @param cdsFilePath Path to the CDS file that failed to compile\n * @param errorMessage The error message from the compilation\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addCompilationDiagnostic(\n  cdsFilePath: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    cdsFilePath,\n    errorMessage,\n    codeqlExePath,\n    'cds/compilation-failure',\n    'Failure to compile one or more SAP CAP CDS files',\n    DiagnosticSeverity.Error,\n    'source file',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for dependency graph build failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from dependency graph build\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addDependencyGraphDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    errorMessage,\n    codeqlExePath,\n    'cds/dependency-graph-failure',\n    'CDS project dependency graph build failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for dependency installation failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from dependency installation\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addDependencyInstallationDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    errorMessage,\n    codeqlExePath,\n    'cds/dependency-installation-failure',\n    'CDS dependency installation failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for environment setup failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from environment setup\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addEnvironmentSetupDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  // Use a representative file from source root or the directory itself\n  const contextFile = sourceRoot;\n  return addDiagnostic(\n    contextFile,\n    errorMessage,\n    codeqlExePath,\n    'cds/environment-setup-failure',\n    'CDS extractor environment setup failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for a JavaScript extractor failure\n * @param filePath Path to a relevant file for the error context\n * @param errorMessage The error message from the JavaScript extractor\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addJavaScriptExtractorDiagnostic(\n  filePath: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    filePath,\n    errorMessage,\n    codeqlExePath,\n    'cds/js-extractor-failure',\n    'Failure in JavaScript extractor for SAP CAP CDS files',\n    DiagnosticSeverity.Error,\n    'extraction file',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic warning when no CDS projects are detected\n * @param sourceRoot Source root directory to use as file context\n * @param message The warning message about no CDS projects\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addNoCdsProjectsDiagnostic(\n  sourceRoot: string,\n  message: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    message,\n    codeqlExePath,\n    'cds/no-cds-projects',\n    'No CDS projects detected in source',\n    DiagnosticSeverity.Warning,\n    'source root',\n    sourceRoot,\n  );\n}\n", "import { execFileSync } from 'child_process';\nimport { createHash } from 'crypto';\nimport { copyFileSync, existsSync, mkdirSync, writeFileSync } from 'fs';\nimport { dirname, join, resolve } from 'path';\n\nimport type { CdsDependencyCombination } from './types';\nimport { CdsDependencyGraph, CdsProject } from '../cds/parser/types';\nimport { DiagnosticSeverity } from '../diagnostics';\nimport { npmExecutable } from '../environment';\nimport { cdsExtractorLog } from '../logging';\nimport { resolveCdsVersions } from './versionResolver';\n\nconst cacheSubDirName = '.cds-extractor-cache';\n\n/**\n * Add a warning diagnostic for dependency version fallback\n * @param packageJsonPath Path to the package.json file\n * @param warningMessage The warning message\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nfunction addDependencyVersionWarning(\n  packageJsonPath: string,\n  warningMessage: string,\n  codeqlExePath: string,\n): boolean {\n  try {\n    execFileSync(codeqlExePath, [\n      'database',\n      'add-diagnostic',\n      '--extractor-name=cds',\n      '--ready-for-status-page',\n      '--source-id=cds/dependency-version-fallback',\n      '--source-name=Using fallback versions for SAP CAP CDS dependencies',\n      `--severity=${DiagnosticSeverity.Warning}`,\n      `--markdown-message=${warningMessage}`,\n      `--file-path=${resolve(packageJsonPath)}`,\n      '--',\n      `${process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE ?? ''}`,\n    ]);\n    cdsExtractorLog('info', `Added warning diagnostic for dependency fallback: ${packageJsonPath}`);\n    return true;\n  } catch (err) {\n    cdsExtractorLog(\n      'error',\n      `Failed to add warning diagnostic for ${packageJsonPath}: ${String(err)}`,\n    );\n    return false;\n  }\n}\n\n/**\n * Find the nearest `.npmrc` file by searching the given directory and its\n * ancestors up to (and including) the filesystem root. npm itself walks the\n * directory tree when looking for project-level `.npmrc` files, so we mirror\n * that behaviour here.\n *\n * @param startDir The directory from which to start the upward search.\n * @returns The absolute path to the nearest `.npmrc`, or `undefined` if none is found.\n */\nexport function findNearestNpmrc(startDir: string): string | undefined {\n  let current = resolve(startDir);\n\n  // Walk up the directory tree until we find an .npmrc or reach the root\n\n  while (true) {\n    const candidate = join(current, '.npmrc');\n    if (existsSync(candidate)) {\n      return candidate;\n    }\n    const parent = dirname(current);\n    if (parent === current) {\n      // Reached filesystem root without finding .npmrc\n      return undefined;\n    }\n    current = parent;\n  }\n}\n\n/**\n * Copy the project's `.npmrc` file (if any) into the cache directory so that\n * `npm install` inside the cache respects custom registry configuration such\n * as scoped registries (`@sap:registry=...`), authentication tokens, and\n * `strict-ssl` settings.\n *\n * @param cacheDir  The cache directory where dependencies will be installed.\n * @param projectDir Absolute path to the project directory whose `.npmrc` should be used.\n */\nexport function copyNpmrcToCache(cacheDir: string, projectDir: string): void {\n  const npmrcPath = findNearestNpmrc(projectDir);\n  if (!npmrcPath) {\n    return;\n  }\n\n  const dest = join(cacheDir, '.npmrc');\n  try {\n    copyFileSync(npmrcPath, dest);\n    cdsExtractorLog('info', `Copied .npmrc from '${npmrcPath}' to cache directory '${cacheDir}'`);\n  } catch (err) {\n    cdsExtractorLog(\n      'warn',\n      `Failed to copy .npmrc to cache directory: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n}\n\n/**\n * Install dependencies for CDS projects using a robust cache strategy with fallback logic\n * @param dependencyGraph The dependency graph of the project\n * @param sourceRoot Source root directory\n * @param codeqlExePath Path to the CodeQL executable (optional)\n * @returns Map of project directories to their corresponding cache directories\n */\nexport function cacheInstallDependencies(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRoot: string,\n  codeqlExePath?: string,\n): Map<string, string> {\n  // Sanity check that we found at least one project\n  if (dependencyGraph.projects.size === 0) {\n    cdsExtractorLog('info', 'No CDS projects found for dependency installation.');\n    cdsExtractorLog(\n      'info',\n      'This is expected if the source contains no CAP/CDS projects and should be handled by the caller.',\n    );\n    return new Map<string, string>();\n  }\n\n  // Extract unique dependency combinations from all projects with version resolution\n  const dependencyCombinations = extractUniqueDependencyCombinations(dependencyGraph.projects);\n\n  if (dependencyCombinations.length === 0) {\n    cdsExtractorLog(\n      'error',\n      'No CDS dependencies found in any project. This means projects were detected but lack proper @sap/cds dependencies.',\n    );\n    cdsExtractorLog(\n      'info',\n      'Will attempt to use system-installed CDS tools if available, but compilation may fail.',\n    );\n    return new Map<string, string>();\n  }\n\n  cdsExtractorLog(\n    'info',\n    `Found ${dependencyCombinations.length} unique CDS dependency combination(s).`,\n  );\n\n  // Log each dependency combination for transparency\n  for (const combination of dependencyCombinations) {\n    const { cdsVersion, cdsDkVersion, hash, resolvedCdsVersion, resolvedCdsDkVersion, isFallback } =\n      combination;\n    const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n    const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n    const fallbackNote = isFallback ? ' (using fallback versions)' : '';\n    const indexerNote = combination.cdsIndexerVersion\n      ? `, @sap/cds-indexer@${combination.cdsIndexerVersion}`\n      : '';\n\n    cdsExtractorLog(\n      'info',\n      `Dependency combination ${hash.substring(0, 8)}: @sap/cds@${actualCdsVersion}, @sap/cds-dk@${actualCdsDkVersion}${indexerNote}${fallbackNote}`,\n    );\n  }\n\n  // Create a cache directory under the source root directory.\n  const cacheRootDir = join(sourceRoot, cacheSubDirName);\n  cdsExtractorLog(\n    'info',\n    `Using cache directory '${cacheSubDirName}' within source root directory '${cacheRootDir}'`,\n  );\n\n  if (!existsSync(cacheRootDir)) {\n    try {\n      mkdirSync(cacheRootDir, { recursive: true });\n      cdsExtractorLog('info', `Created cache directory: ${cacheRootDir}`);\n    } catch (err) {\n      cdsExtractorLog(\n        'warn',\n        `Failed to create cache directory: ${err instanceof Error ? err.message : String(err)}`,\n      );\n      cdsExtractorLog('info', 'Skipping dependency installation due to cache directory failure.');\n      return new Map<string, string>();\n    }\n  } else {\n    cdsExtractorLog('info', `Cache directory already exists: ${cacheRootDir}`);\n  }\n\n  // Map to track which cache directory to use for each project\n  const projectCacheDirMap = new Map<string, string>();\n  let successfulInstallations = 0;\n\n  // Install each unique dependency combination in its own cache directory\n  for (const combination of dependencyCombinations) {\n    const { cdsVersion, cdsDkVersion, hash } = combination;\n    const { resolvedCdsVersion, resolvedCdsDkVersion } = combination;\n    const cacheDirName = `cds-${hash}`;\n    const cacheDir = join(cacheRootDir, cacheDirName);\n\n    cdsExtractorLog(\n      'info',\n      `Processing dependency combination ${hash.substring(0, 8)} in cache directory: ${cacheDirName}`,\n    );\n\n    // Create the cache directory if it doesn't exist\n    if (!existsSync(cacheDir)) {\n      try {\n        mkdirSync(cacheDir, { recursive: true });\n        cdsExtractorLog('info', `Created cache subdirectory: ${cacheDirName}`);\n      } catch (err) {\n        cdsExtractorLog(\n          'error',\n          `Failed to create cache directory for combination ${hash.substring(0, 8)} (${cacheDirName}): ${\n            err instanceof Error ? err.message : String(err)\n          }`,\n        );\n        continue;\n      }\n\n      // Create a package.json for this dependency combination using resolved versions\n      const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n      const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n\n      const cacheDeps: Record<string, string> = {\n        '@sap/cds': actualCdsVersion,\n        '@sap/cds-dk': actualCdsDkVersion,\n      };\n\n      // Include @sap/cds-indexer in the cache when a project depends on it.\n      // This is a best-effort optimization: on systems with access to the\n      // private npm registry that hosts @sap/cds-indexer, it will be cached\n      // alongside @sap/cds and @sap/cds-dk. On systems without access, the\n      // npm install will still succeed for the other packages (it won't fail\n      // the overall installation \u2014 npm install is run with --no-optional\n      // semantics handled below).\n      if (combination.cdsIndexerVersion) {\n        cacheDeps['@sap/cds-indexer'] = combination.cdsIndexerVersion;\n        cdsExtractorLog(\n          'info',\n          `Including @sap/cds-indexer@${combination.cdsIndexerVersion} in cache for combination ${hash.substring(0, 8)}`,\n        );\n      }\n\n      const packageJson = {\n        name: `cds-extractor-cache-${hash}`,\n        version: '1.0.0',\n        private: true,\n        dependencies: cacheDeps,\n      };\n\n      try {\n        writeFileSync(join(cacheDir, 'package.json'), JSON.stringify(packageJson, null, 2));\n        cdsExtractorLog('info', `Created package.json in cache subdirectory: ${cacheDirName}`);\n      } catch (err) {\n        cdsExtractorLog(\n          'error',\n          `Failed to create package.json in cache directory ${cacheDirName}: ${\n            err instanceof Error ? err.message : String(err)\n          }`,\n        );\n        continue;\n      }\n    }\n\n    // Ensure the cache directory has an .npmrc that reflects the projects' registry configuration\n    const npmrcProjectDir = Array.from(dependencyGraph.projects.values())\n      .map(project => project.projectDir)\n      .find(projectDir => projectDir && existsSync(join(sourceRoot, projectDir, '.npmrc')));\n    if (npmrcProjectDir) {\n      copyNpmrcToCache(cacheDir, join(sourceRoot, npmrcProjectDir));\n    }\n\n    // Try to install dependencies in the cache directory\n    // Get the first project package.json path for diagnostic purposes\n    const samplePackageJsonPath = Array.from(dependencyGraph.projects.values()).find(\n      project => project.packageJson,\n    )?.projectDir;\n    const packageJsonPath = samplePackageJsonPath\n      ? join(sourceRoot, samplePackageJsonPath, 'package.json')\n      : undefined;\n\n    const installSuccess = installDependenciesInCache(\n      cacheDir,\n      combination,\n      cacheDirName,\n      packageJsonPath,\n      codeqlExePath,\n    );\n\n    if (!installSuccess) {\n      cdsExtractorLog(\n        'warn',\n        `Skipping failed dependency combination ${hash.substring(0, 8)} (cache directory: ${cacheDirName})`,\n      );\n      continue;\n    }\n\n    successfulInstallations++;\n\n    // Associate projects with this dependency combination\n    for (const [projectDir, project] of Array.from(dependencyGraph.projects.entries())) {\n      if (!project.packageJson) {\n        continue;\n      }\n      const p_cdsVersion = project.packageJson.dependencies?.['@sap/cds'] ?? 'latest';\n      const p_cdsDkVersion = project.packageJson.devDependencies?.['@sap/cds-dk'] ?? p_cdsVersion;\n      const p_cdsIndexerVersion =\n        project.packageJson.dependencies?.['@sap/cds-indexer'] ??\n        project.packageJson.devDependencies?.['@sap/cds-indexer'] ??\n        undefined;\n\n      // Resolve the project's versions to match against the combination's resolved versions\n      const projectResolvedVersions = resolveCdsVersions(p_cdsVersion, p_cdsDkVersion);\n      const projectActualCdsVersion = projectResolvedVersions.resolvedCdsVersion ?? p_cdsVersion;\n      const projectActualCdsDkVersion =\n        projectResolvedVersions.resolvedCdsDkVersion ?? p_cdsDkVersion;\n\n      // Match based on resolved versions since that's what the hash is based on\n      const combinationActualCdsVersion = combination.resolvedCdsVersion ?? combination.cdsVersion;\n      const combinationActualCdsDkVersion =\n        combination.resolvedCdsDkVersion ?? combination.cdsDkVersion;\n\n      if (\n        projectActualCdsVersion === combinationActualCdsVersion &&\n        projectActualCdsDkVersion === combinationActualCdsDkVersion &&\n        p_cdsIndexerVersion === combination.cdsIndexerVersion\n      ) {\n        projectCacheDirMap.set(projectDir, cacheDir);\n      }\n    }\n  }\n\n  // Log final status\n  if (successfulInstallations === 0) {\n    cdsExtractorLog('error', 'Failed to install any dependency combinations.');\n    if (dependencyCombinations.length > 0) {\n      cdsExtractorLog(\n        'error',\n        `All ${dependencyCombinations.length} dependency combination(s) failed to install. This will likely cause compilation failures.`,\n      );\n    }\n  } else if (successfulInstallations < dependencyCombinations.length) {\n    cdsExtractorLog(\n      'warn',\n      `Successfully installed ${successfulInstallations} out of ${dependencyCombinations.length} dependency combinations.`,\n    );\n  } else {\n    cdsExtractorLog('info', 'All dependency combinations installed successfully.');\n  }\n\n  // Log project-to-cache-directory mappings for transparency.\n  if (projectCacheDirMap.size > 0) {\n    cdsExtractorLog('info', `Project to cache directory mappings:`);\n    for (const [projectDir, cacheDir] of Array.from(projectCacheDirMap.entries())) {\n      const cacheDirName = join(cacheDir).split('/').pop() ?? 'unknown';\n      cdsExtractorLog('info', `  ${projectDir} \u2192 ${cacheDirName}`);\n    }\n  } else {\n    cdsExtractorLog(\n      'warn',\n      'No project to cache directory mappings created. Projects may not have compatible dependencies installed.',\n    );\n  }\n\n  return projectCacheDirMap;\n}\n\n/**\n * Extracts unique dependency combinations from the dependency graph.\n * @param projects A map of projects from the dependency graph.\n * @returns An array of unique dependency combinations.\n */\nfunction extractUniqueDependencyCombinations(\n  projects: Map<string, CdsProject>,\n): CdsDependencyCombination[] {\n  const combinations = new Map<string, CdsDependencyCombination>();\n\n  for (const project of Array.from(projects.values())) {\n    if (!project.packageJson) {\n      continue;\n    }\n\n    const cdsVersion = project.packageJson.dependencies?.['@sap/cds'] ?? 'latest';\n    const cdsDkVersion = project.packageJson.devDependencies?.['@sap/cds-dk'] ?? cdsVersion;\n\n    // Detect optional @sap/cds-indexer dependency\n    const cdsIndexerVersion =\n      project.packageJson.dependencies?.['@sap/cds-indexer'] ??\n      project.packageJson.devDependencies?.['@sap/cds-indexer'] ??\n      undefined;\n\n    // Resolve versions first to ensure we cache based on actual resolved versions\n    cdsExtractorLog(\n      'info',\n      `Resolving available dependency versions for project '${project.projectDir}' with dependencies: [@sap/cds@${cdsVersion}, @sap/cds-dk@${cdsDkVersion}]`,\n    );\n    const resolvedVersions = resolveCdsVersions(cdsVersion, cdsDkVersion);\n    const { resolvedCdsVersion, resolvedCdsDkVersion, ...rest } = resolvedVersions;\n\n    // Log the resolved CDS dependency versions for the project\n    if (resolvedCdsVersion && resolvedCdsDkVersion) {\n      let statusMsg: string;\n      if (resolvedVersions.cdsExactMatch && resolvedVersions.cdsDkExactMatch) {\n        statusMsg = ' (exact match)';\n      } else if (!resolvedVersions.isFallback) {\n        statusMsg = ' (compatible versions)';\n      } else {\n        statusMsg = ' (using fallback versions)';\n      }\n      cdsExtractorLog(\n        'info',\n        `Resolved to: @sap/cds@${resolvedCdsVersion}, @sap/cds-dk@${resolvedCdsDkVersion}${statusMsg}`,\n      );\n    } else {\n      cdsExtractorLog(\n        'error',\n        `Failed to resolve CDS dependencies: @sap/cds@${cdsVersion}, @sap/cds-dk@${cdsDkVersion}`,\n      );\n    }\n\n    // Calculate hash based on resolved versions to ensure proper cache reuse\n    const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n    const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n    const hashInput = cdsIndexerVersion\n      ? `${actualCdsVersion}|${actualCdsDkVersion}|${cdsIndexerVersion}`\n      : `${actualCdsVersion}|${actualCdsDkVersion}`;\n    const hash = createHash('sha256').update(hashInput).digest('hex');\n\n    if (!combinations.has(hash)) {\n      combinations.set(hash, {\n        cdsVersion,\n        cdsDkVersion,\n        cdsIndexerVersion,\n        hash,\n        resolvedCdsVersion: resolvedCdsVersion ?? undefined,\n        resolvedCdsDkVersion: resolvedCdsDkVersion ?? undefined,\n        ...rest,\n      });\n    }\n  }\n\n  return Array.from(combinations.values());\n}\n\n/**\n * Attempt to install dependencies in a cache directory with fallback logic\n * @param cacheDir Cache directory path\n * @param combination Dependency combination to install\n * @param cacheDirName Name of the cache directory for logging\n * @param packageJsonPath Optional package.json path for diagnostics\n * @param codeqlExePath Optional CodeQL executable path for diagnostics\n * @returns True if installation succeeded, false otherwise\n */\nfunction installDependenciesInCache(\n  cacheDir: string,\n  combination: CdsDependencyCombination,\n  cacheDirName: string,\n  packageJsonPath?: string,\n  codeqlExePath?: string,\n): boolean {\n  const { resolvedCdsVersion, resolvedCdsDkVersion, isFallback, warning } = combination;\n\n  // Check if node_modules directory already exists in the cache dir\n  const nodeModulesExists =\n    existsSync(join(cacheDir, 'node_modules', '@sap', 'cds')) &&\n    existsSync(join(cacheDir, 'node_modules', '@sap', 'cds-dk'));\n\n  if (nodeModulesExists) {\n    cdsExtractorLog(\n      'info',\n      `Using cached dependencies for @sap/cds@${resolvedCdsVersion} and @sap/cds-dk@${resolvedCdsDkVersion} from ${cacheDirName}`,\n    );\n\n    // Add warning diagnostic if using fallback versions\n    if (isFallback && warning && packageJsonPath && codeqlExePath) {\n      addDependencyVersionWarning(packageJsonPath, warning, codeqlExePath);\n    }\n\n    return true;\n  }\n\n  if (!resolvedCdsVersion || !resolvedCdsDkVersion) {\n    cdsExtractorLog('error', 'Cannot install dependencies: no compatible versions found');\n    return false;\n  }\n\n  // Install dependencies in the cache directory\n  cdsExtractorLog(\n    'info',\n    `Installing @sap/cds@${resolvedCdsVersion} and @sap/cds-dk@${resolvedCdsDkVersion} in cache directory: ${cacheDirName}`,\n  );\n\n  if (isFallback && warning) {\n    cdsExtractorLog('warn', warning);\n  }\n\n  try {\n    execFileSync(npmExecutable(), ['install', '--quiet', '--no-audit', '--no-fund'], {\n      cwd: cacheDir,\n      stdio: 'inherit',\n    });\n\n    // Add warning diagnostic if using fallback versions\n    if (isFallback && warning && packageJsonPath && codeqlExePath) {\n      addDependencyVersionWarning(packageJsonPath, warning, codeqlExePath);\n    }\n\n    return true;\n  } catch (err) {\n    const errorMessage = `Failed to install resolved dependencies in cache directory ${cacheDir}: ${err instanceof Error ? err.message : String(err)}`;\n    cdsExtractorLog('error', errorMessage);\n    return false;\n  }\n}\n", "import { execSync } from 'child_process';\n\nimport type { SemanticVersion } from './types';\nimport { cdsExtractorLog } from '../logging';\n\n/**\n * Cache for storing available versions for npm packages to avoid duplicate\n * `npm view` calls.\n */\nconst availableVersionsCache = new Map<string, string[]>();\n\n// Define the set of allowed npm packages for which we cache versions.\ntype CachedPackageName = '@sap/cds' | '@sap/cds-dk';\n\n/**\n * Cache statistics for debugging purposes\n */\nconst cacheStats = {\n  hits: 0,\n  misses: 0,\n  get hitRate() {\n    const total = this.hits + this.misses;\n    return total > 0 ? ((this.hits / total) * 100).toFixed(1) : '0.0';\n  },\n};\n\n/**\n * Check if @sap/cds and @sap/cds-dk versions are likely compatible.\n * @param cdsVersion The @sap/cds version\n * @param cdsDkVersion The @sap/cds-dk version\n * @returns Object with compatibility information and warnings\n */\nexport function checkVersionCompatibility(\n  cdsVersion: string,\n  cdsDkVersion: string,\n): {\n  isCompatible: boolean;\n  warning?: string;\n} {\n  // If either version is 'latest', assume they are compatible\n  if (cdsVersion === 'latest' || cdsDkVersion === 'latest') {\n    return { isCompatible: true };\n  }\n\n  const parsedCds = parseSemanticVersion(cdsVersion);\n  const parsedCdsDk = parseSemanticVersion(cdsDkVersion);\n\n  if (!parsedCds || !parsedCdsDk) {\n    return {\n      isCompatible: false,\n      warning: 'Unable to parse version numbers for compatibility check',\n    };\n  }\n\n  // Generally, @sap/cds and @sap/cds-dk should have the same major version\n  // and ideally the same minor version for best compatibility\n  const majorVersionsMatch = parsedCds.major === parsedCdsDk.major;\n  const minorVersionsMatch = parsedCds.minor === parsedCdsDk.minor;\n\n  if (!majorVersionsMatch) {\n    return {\n      isCompatible: false,\n      warning: `Major version mismatch: @sap/cds ${cdsVersion} and @sap/cds-dk ${cdsDkVersion} may not be compatible`,\n    };\n  }\n\n  if (!minorVersionsMatch) {\n    return {\n      isCompatible: true,\n      warning: `Minor version difference: @sap/cds ${cdsVersion} and @sap/cds-dk ${cdsDkVersion} - consider aligning versions for best compatibility`,\n    };\n  }\n\n  return { isCompatible: true };\n}\n\n/**\n * Compare two semantic versions\n * @param a First version\n * @param b Second version\n * @returns Negative if a < b, 0 if equal, positive if a > b\n */\nexport function compareVersions(a: SemanticVersion, b: SemanticVersion): number {\n  if (a.major !== b.major) return a.major - b.major;\n  if (a.minor !== b.minor) return a.minor - b.minor;\n  if (a.patch !== b.patch) return a.patch - b.patch;\n\n  // Handle prerelease versions (prerelease < release)\n  if (a.prerelease && !b.prerelease) return -1;\n  if (!a.prerelease && b.prerelease) return 1;\n  if (a.prerelease && b.prerelease) {\n    return a.prerelease.localeCompare(b.prerelease);\n  }\n\n  return 0;\n}\n\n/**\n * Find the best available version from a list of versions for a given requirement\n * @param availableVersions List of available version strings\n * @param requiredVersion Required version string\n * @returns Best matching version or null if no compatible version found\n */\nexport function findBestAvailableVersion(\n  availableVersions: string[],\n  requiredVersion: string,\n): string | null {\n  const parsedVersions = availableVersions\n    .map(v => parseSemanticVersion(v))\n    .filter((v): v is SemanticVersion => v !== null);\n\n  if (parsedVersions.length === 0) {\n    return null;\n  }\n\n  // First, try to find versions that satisfy the range\n  const satisfyingVersions = parsedVersions.filter(v => satisfiesRange(v, requiredVersion));\n\n  if (satisfyingVersions.length > 0) {\n    // Sort in descending order (newest first) and return the best match\n    satisfyingVersions.sort((a, b) => compareVersions(b, a));\n    return satisfyingVersions[0].original;\n  }\n\n  // If no exact match, prefer newer versions over older ones\n  // Sort all versions in descending order and return the newest\n  parsedVersions.sort((a, b) => compareVersions(b, a));\n  return parsedVersions[0].original;\n}\n\n/**\n * Get available versions for an npm package with caching to avoid duplicate\n * calls of the `npm view` command.\n * @param packageName The {@link CachedPackageName} for which to get versions\n * @returns Array of available version strings\n */\nexport function getAvailableVersions(packageName: CachedPackageName): string[] {\n  // Check cache first\n  if (availableVersionsCache.has(packageName)) {\n    cacheStats.hits++;\n    return availableVersionsCache.get(packageName)!;\n  }\n\n  // Cache miss - fetch from npm\n  cacheStats.misses++;\n  try {\n    const output = execSync(`npm view ${packageName} versions --json`, {\n      encoding: 'utf8',\n      timeout: 30000, // 30 second timeout\n    });\n\n    const versions: unknown = JSON.parse(output);\n    let versionArray: string[] = [];\n\n    if (Array.isArray(versions)) {\n      versionArray = versions.filter((v): v is string => typeof v === 'string');\n    } else if (typeof versions === 'string') {\n      versionArray = [versions];\n    }\n\n    // Cache the result\n    availableVersionsCache.set(packageName, versionArray);\n\n    return versionArray;\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to fetch versions for ${packageName}: ${String(error)}`);\n    // Cache empty array to avoid repeated failures\n    availableVersionsCache.set(packageName, []);\n    return [];\n  }\n}\n\n/**\n * Get cache statistics for debugging purposes\n * @returns Object with cache hit/miss statistics\n */\nexport function getCacheStatistics(): {\n  hits: number;\n  misses: number;\n  hitRate: string;\n  cachedPackages: string[];\n} {\n  return {\n    hits: cacheStats.hits,\n    misses: cacheStats.misses,\n    hitRate: cacheStats.hitRate,\n    cachedPackages: Array.from(availableVersionsCache.keys()),\n  };\n}\n\n/**\n * Parse a semantic version string\n * @param version Version string to parse (e.g., \"6.1.3\", \"^6.0.0\", \"~6.1.0\", \"latest\")\n * @returns Parsed semantic version or null if invalid\n */\nexport function parseSemanticVersion(version: string): SemanticVersion | null {\n  if (version === 'latest') {\n    // Return a very high version number for 'latest' to ensure it's preferred\n    return {\n      major: 999,\n      minor: 999,\n      patch: 999,\n      original: version,\n    };\n  }\n\n  // Remove common version prefixes\n  const cleanVersion = version.replace(/^[\\^~>=<]+/, '');\n\n  // Basic semver regex\n  const semverRegex = /^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([a-zA-Z0-9.-]+))?(?:\\+([a-zA-Z0-9.-]+))?$/;\n  const match = cleanVersion.match(semverRegex);\n\n  if (!match) {\n    return null;\n  }\n\n  return {\n    major: parseInt(match[1], 10),\n    minor: parseInt(match[2], 10),\n    patch: parseInt(match[3], 10),\n    prerelease: match[4],\n    build: match[5],\n    original: version,\n  };\n}\n\n/**\n * Check if a resolved version satisfies the originally requested version.\n * @param resolvedVersion The version that was resolved\n * @param requestedVersion The originally requested version\n * @returns true if the resolved version satisfies the requested version range\n */\nfunction isSatisfyingVersion(resolvedVersion: string, requestedVersion: string): boolean {\n  // Exact string match or 'latest' case\n  if (resolvedVersion === requestedVersion || requestedVersion === 'latest') {\n    return true;\n  }\n\n  const parsedResolved = parseSemanticVersion(resolvedVersion);\n  if (!parsedResolved) {\n    return false;\n  }\n\n  return satisfiesRange(parsedResolved, requestedVersion);\n}\n\n/**\n * Resolve the best available version for CDS dependencies\n * @param cdsVersion Required @sap/cds version\n * @param cdsDkVersion Required @sap/cds-dk version\n * @returns Object with resolved versions and compatibility info\n */\nexport function resolveCdsVersions(\n  cdsVersion: string,\n  cdsDkVersion: string,\n): {\n  resolvedCdsVersion: string | null;\n  resolvedCdsDkVersion: string | null;\n  cdsExactMatch: boolean;\n  cdsDkExactMatch: boolean;\n  warning?: string;\n  isFallback?: boolean;\n} {\n  const cdsVersions = getAvailableVersions('@sap/cds');\n  const cdsDkVersions = getAvailableVersions('@sap/cds-dk');\n\n  const resolvedCdsVersion = findBestAvailableVersion(cdsVersions, cdsVersion);\n  const resolvedCdsDkVersion = findBestAvailableVersion(cdsDkVersions, cdsDkVersion);\n\n  // Check if resolved versions are exact matches (string equality or 'latest' case).\n  const cdsExactMatch =\n    resolvedCdsVersion === cdsVersion || (cdsVersion === 'latest' && resolvedCdsVersion !== null);\n  const cdsDkExactMatch =\n    resolvedCdsDkVersion === cdsDkVersion ||\n    (cdsDkVersion === 'latest' && resolvedCdsDkVersion !== null);\n\n  // Check if resolved versions satisfy the requested ranges (including exact matches).\n  const cdsSatisfiesRange = resolvedCdsVersion\n    ? isSatisfyingVersion(resolvedCdsVersion, cdsVersion)\n    : false;\n  const cdsDkSatisfiesRange = resolvedCdsDkVersion\n    ? isSatisfyingVersion(resolvedCdsDkVersion, cdsDkVersion)\n    : false;\n\n  // Only consider it a fallback if we couldn't find a satisfying version.\n  const isFallback = !cdsSatisfiesRange || !cdsDkSatisfiesRange;\n\n  let warning: string | undefined;\n\n  // Check compatibility between resolved versions (only if both were resolved).\n  // Show warnings when:\n  // 1. We're using fallback versions (couldn't find compatible versions), OR\n  // 2. At least one version isn't an exact match (version range was used), OR\n  // 3. Resolved versions have actual compatibility issues (e.g., major version mismatch).\n  if (resolvedCdsVersion && resolvedCdsDkVersion) {\n    const compatibility = checkVersionCompatibility(resolvedCdsVersion, resolvedCdsDkVersion);\n\n    const shouldShowWarning =\n      isFallback ||\n      !cdsExactMatch ||\n      !cdsDkExactMatch ||\n      (compatibility.warning && !compatibility.isCompatible);\n\n    if (compatibility.warning && shouldShowWarning) {\n      warning = compatibility.warning;\n    }\n  }\n\n  return {\n    resolvedCdsVersion,\n    resolvedCdsDkVersion,\n    cdsExactMatch,\n    cdsDkExactMatch,\n    warning,\n    isFallback,\n  };\n}\n\n/**\n * Check if version satisfies a version range.\n * @param version Version to check\n * @param range Version range (e.g., \"^6.0.0\", \"~6.1.0\", \">=6.0.0\")\n * @returns true if version satisfies the range\n */\nexport function satisfiesRange(version: SemanticVersion, range: string): boolean {\n  if (range === 'latest') {\n    return true;\n  }\n\n  const rangeVersion = parseSemanticVersion(range);\n  if (!rangeVersion) {\n    return false;\n  }\n\n  if (range.startsWith('^')) {\n    // Caret range: compatible within same major version\n    return version.major === rangeVersion.major && compareVersions(version, rangeVersion) >= 0;\n  } else if (range.startsWith('~')) {\n    // Tilde range: compatible within same minor version\n    return (\n      version.major === rangeVersion.major &&\n      version.minor === rangeVersion.minor &&\n      compareVersions(version, rangeVersion) >= 0\n    );\n  } else if (range.startsWith('>=')) {\n    // Greater than or equal\n    return compareVersions(version, rangeVersion) >= 0;\n  } else if (range.startsWith('>')) {\n    // Greater than\n    return compareVersions(version, rangeVersion) > 0;\n  } else if (range.startsWith('<=')) {\n    // Less than or equal\n    return compareVersions(version, rangeVersion) <= 0;\n  } else if (range.startsWith('<')) {\n    // Less than\n    return compareVersions(version, rangeVersion) < 0;\n  } else {\n    // Exact match\n    return compareVersions(version, rangeVersion) === 0;\n  }\n}\n\n/**\n * Test-only exports - DO NOT USE IN PRODUCTION CODE\n * These are exported only for testing purposes\n */\nexport const __testOnly__ = {\n  availableVersionsCache,\n  cacheStats,\n};\n", "/** Full dependency installation utilities for retry scenarios. */\n\nimport { execFileSync } from 'child_process';\nimport { join } from 'path';\n\nimport { npmExecutable } from '../environment';\nimport type { FullDependencyInstallationResult } from './types';\nimport type { CdsProject } from '../cds/parser';\nimport { cdsExtractorLog } from '../logging';\n\n/**\n * Determines if a {@link CdsProject} requires \"full\" dependency installation.\n *\n * @param project The {@link CdsProject} to check\n * @returns `true` if the project has at least one compilation task that is\n * currently marked as `failed` AND has not yet been retried. Otherwise, `false`.\n */\nexport function needsFullDependencyInstallation(project: CdsProject): boolean {\n  // Check if already installed\n  if (project.retryStatus?.fullDependenciesInstalled) {\n    return false;\n  }\n\n  // Check if project has failed tasks that could benefit from full dependencies.\n  //\n  // Currently, we only allow for one retry, because the only significant change we\n  // can make (to justify a retry) is to install and use the full set of declared\n  // dependencies instead of the minimal set of cached (`@sap/cds` and `@sap/cds-dk`)\n  // dependencies.\n  const hasFailedTasks = project.compilationTasks.some(\n    task => task.status === 'failed' && !task.retryInfo?.hasBeenRetried,\n  );\n\n  return hasFailedTasks && project.packageJson !== undefined;\n}\n\n/**\n * Installs full dependencies for a {@link CdsProject} in support of retry behavior\n * for compilation tasks that fail unless the `cds` CLI/compiler has access to the\n * full set of dependencies declared for the project.\n *\n * @param project The CDS project to install dependencies for\n * @param sourceRoot Source root directory\n * @returns Installation result with details\n */\nexport function projectInstallDependencies(\n  project: CdsProject,\n  sourceRoot: string,\n): FullDependencyInstallationResult {\n  const startTime = Date.now();\n  const projectPath = join(sourceRoot, project.projectDir);\n\n  const result: FullDependencyInstallationResult = {\n    success: false,\n    projectDir: projectPath,\n    warnings: [],\n    durationMs: 0,\n    timedOut: false,\n  };\n\n  try {\n    // Check if project has package.json\n    if (!project.packageJson) {\n      result.error = 'No package.json found for project';\n      return result;\n    }\n\n    // Install dependencies using npm in the project's directory\n    cdsExtractorLog(\n      'info',\n      `Installing full dependencies for project ${project.projectDir} in project's node_modules`,\n    );\n\n    try {\n      execFileSync(\n        npmExecutable(),\n        ['install', '--ignore-scripts', '--quiet', '--no-audit', '--no-fund'],\n        {\n          cwd: projectPath,\n          stdio: 'inherit',\n          timeout: 120000, // 2-minute timeout\n        },\n      );\n\n      result.success = true;\n      cdsExtractorLog(\n        'info',\n        `Successfully installed full dependencies for project ${project.projectDir}`,\n      );\n    } catch (execError) {\n      if (execError instanceof Error && 'signal' in execError && execError.signal === 'SIGTERM') {\n        result.timedOut = true;\n        result.error = 'Dependency installation timed out';\n      } else {\n        result.error = `npm install failed: ${String(execError)}`;\n      }\n\n      // Still attempt retry compilation even if dependency installation fails (optimistic approach)\n      result.warnings.push(\n        `Dependency installation failed but will still attempt retry compilation: ${result.error}`,\n      );\n      cdsExtractorLog('warn', result.warnings[0]);\n    }\n  } catch (error) {\n    result.error = `Failed to install full dependencies: ${String(error)}`;\n    cdsExtractorLog('error', result.error);\n  } finally {\n    result.durationMs = Date.now() - startTime;\n  }\n\n  return result;\n}\n", "/** Main retry orchestration logic for CDS compilation failures. */\n\nimport { compileCdsToJson } from './compile';\nimport type {\n  CompilationAttempt,\n  CompilationTask,\n  ResultRetryCompilationTask,\n  ResultRetryCompilationOrchestration,\n  ValidatedCdsCommand,\n} from './types';\nimport { identifyTasksRequiringRetry, updateCdsDependencyGraphStatus } from './validator';\nimport { addCompilationDiagnostic } from '../../diagnostics';\nimport { cdsExtractorLog } from '../../logging';\nimport { needsFullDependencyInstallation, projectInstallDependencies } from '../../packageManager';\nimport type { CdsDependencyGraph, CdsProject } from '../parser';\n\n/**\n * Add diagnostics only for tasks with `status: failed` in the {@link CdsDependencyGraph}.\n * @param dependencyGraph The dependency graph to use as the source of truth for task status\n * @param codeqlExePath Path to CodeQL executable used to add a diagnostic notification\n * @param sourceRoot Source root directory to use for making file paths relative\n */\nfunction addCompilationDiagnosticsForFailedTasks(\n  dependencyGraph: CdsDependencyGraph,\n  codeqlExePath: string,\n  sourceRoot: string,\n): void {\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      // Add diagnostics for tasks that currently have a `status` of 'failed'.\n      if (task.status === 'failed') {\n        // Add a diagnostic if the task:\n        //  - failed initially and was never retried, or...\n        //  - failed initially and was retried without success (or without updating status).\n        const shouldAddDiagnostic = task.retryInfo?.hasBeenRetried ?? !task.retryInfo;\n\n        if (shouldAddDiagnostic) {\n          for (const sourceFile of task.sourceFiles) {\n            addCompilationDiagnostic(\n              sourceFile,\n              task.errorSummary ?? 'Compilation failed',\n              codeqlExePath,\n              sourceRoot,\n            );\n          }\n        }\n      }\n    }\n  }\n}\n\n/**\n * Main orchestration function for retrying failed tasks in the {@link CdsDependencyGraph}.\n * @param dependencyGraph The dependency graph containing compilation tasks\n * @param codeqlExePath Path to `codeql` executable to use for adding diagnostic notifications\n * @returns The {@link ResultRetryCompilationOrchestration}\n */\nexport function orchestrateRetryAttempts(\n  dependencyGraph: CdsDependencyGraph,\n  codeqlExePath: string,\n): ResultRetryCompilationOrchestration {\n  const startTime = Date.now();\n  let dependencyInstallationStartTime = 0;\n  let dependencyInstallationEndTime = 0;\n  let retryCompilationStartTime = 0;\n  let retryCompilationEndTime = 0;\n\n  const result: ResultRetryCompilationOrchestration = {\n    success: true,\n    projectsWithRetries: [],\n    totalTasksRequiringRetry: 0,\n    totalSuccessfulRetries: 0,\n    totalFailedRetries: 0,\n    projectsWithSuccessfulDependencyInstallation: [],\n    projectsWithFailedDependencyInstallation: [],\n    retryDurationMs: 0,\n    dependencyInstallationDurationMs: 0,\n    retryCompilationDurationMs: 0,\n  };\n\n  try {\n    // Phase 1: Validate current outputs and identify failed tasks.\n    cdsExtractorLog('info', 'Identifying tasks requiring retry...');\n    const tasksRequiringRetry = identifyTasksRequiringRetry(dependencyGraph);\n\n    if (tasksRequiringRetry.size === 0) {\n      cdsExtractorLog('info', 'No tasks require retry - all compilations successful');\n      return result;\n    }\n\n    // Update retry status tracking.\n    result.totalTasksRequiringRetry = Array.from(tasksRequiringRetry.values()).reduce(\n      (sum, tasks) => sum + tasks.length,\n      0,\n    );\n    dependencyGraph.retryStatus.totalTasksRequiringRetry = result.totalTasksRequiringRetry;\n\n    // Phase 2: Install full dependencies for projects with failed tasks.\n    dependencyInstallationStartTime = Date.now();\n    for (const [projectDir, failedTasks] of tasksRequiringRetry) {\n      const project = dependencyGraph.projects.get(projectDir);\n      if (!project) {\n        continue;\n      }\n\n      if (needsFullDependencyInstallation(project)) {\n        try {\n          const installResult = projectInstallDependencies(project, dependencyGraph.sourceRootDir);\n\n          // Update project retry status.\n          project.retryStatus ??= {\n            fullDependenciesInstalled: false,\n            tasksRequiringRetry: failedTasks.length,\n            tasksRetried: 0,\n            installationErrors: [],\n          };\n\n          if (installResult.success) {\n            project.retryStatus.fullDependenciesInstalled = true;\n            result.projectsWithSuccessfulDependencyInstallation.push(projectDir);\n            dependencyGraph.retryStatus.projectsWithFullDependencies.add(projectDir);\n          } else {\n            project.retryStatus.installationErrors = [\n              ...(project.retryStatus.installationErrors ?? []),\n              installResult.error ?? 'Unknown installation error',\n            ];\n            result.projectsWithFailedDependencyInstallation.push(projectDir);\n          }\n\n          if (installResult.warnings.length > 0) {\n            for (const warning of installResult.warnings) {\n              dependencyGraph.errors.warnings.push({\n                phase: 'retry_dependency_installation',\n                message: warning,\n                timestamp: new Date(),\n                context: projectDir,\n              });\n            }\n          }\n        } catch (error) {\n          const errorMessage = `Failed to install full dependencies for project ${projectDir}: ${String(error)}`;\n          cdsExtractorLog('error', errorMessage);\n\n          dependencyGraph.errors.critical.push({\n            phase: 'retry_dependency_installation',\n            message: errorMessage,\n            timestamp: new Date(),\n          });\n\n          result.projectsWithFailedDependencyInstallation.push(projectDir);\n        }\n      }\n\n      dependencyGraph.retryStatus.projectsRequiringFullDependencies.add(projectDir);\n    }\n\n    dependencyInstallationEndTime = Date.now();\n    result.dependencyInstallationDurationMs =\n      dependencyInstallationEndTime - dependencyInstallationStartTime;\n\n    // Phase 3: Execute retry compilation attempts.\n    cdsExtractorLog('info', 'Executing retry compilation attempts...');\n    retryCompilationStartTime = Date.now();\n\n    for (const [projectDir, failedTasks] of tasksRequiringRetry) {\n      const project = dependencyGraph.projects.get(projectDir);\n      if (!project) {\n        continue;\n      }\n\n      const retryExecutionResult = retryCompilationTasksForProject(\n        failedTasks,\n        project,\n        dependencyGraph,\n      );\n\n      result.projectsWithRetries.push(projectDir);\n      result.totalSuccessfulRetries += retryExecutionResult.successfulRetries;\n      result.totalFailedRetries += retryExecutionResult.failedRetries;\n\n      // Update project retry status.\n      if (project.retryStatus) {\n        project.retryStatus.tasksRetried = retryExecutionResult.retriedTasks.length;\n      }\n    }\n\n    retryCompilationEndTime = Date.now();\n    result.retryCompilationDurationMs = retryCompilationEndTime - retryCompilationStartTime;\n\n    // After retry compilation attempts complete, update status.\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Phase 4: Update dependency graph with retry results.\n    updateDependencyGraphWithRetryResults(dependencyGraph, result);\n\n    // Phase 5: Add diagnostics for definitively failed tasks.\n    addCompilationDiagnosticsForFailedTasks(\n      dependencyGraph,\n      codeqlExePath,\n      dependencyGraph.sourceRootDir,\n    );\n\n    result.success = result.totalSuccessfulRetries > 0 || result.totalTasksRequiringRetry === 0;\n  } catch (error) {\n    const errorMessage = `Retry orchestration failed: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'retry_orchestration',\n      message: errorMessage,\n      timestamp: new Date(),\n    });\n\n    result.success = false;\n  } finally {\n    result.retryDurationMs = Date.now() - startTime;\n  }\n\n  return result;\n}\n\n/**\n * Retry the provided {@link CompilationTask} using the task's configured retry command.\n * @param task The {@link CompilationTask} to be retried\n * @param retryCommand Validated CDS command to use for retry\n * @param projectDir Project directory to use as working directory\n * @param dependencyGraph The {@link CdsDependencyGraph} to be processed and updated\n * if retry succeeds.\n * @returns The result of the {@link CompilationAttempt}.\n */\nfunction retryCompilationTask(\n  task: CompilationTask,\n  retryCommand: ValidatedCdsCommand,\n  projectDir: string,\n  dependencyGraph: CdsDependencyGraph,\n): CompilationAttempt {\n  const startTime = new Date();\n  const attemptId = `${task.id}_retry_${startTime.getTime()}`;\n\n  // Use the original command string for consistency with existing compilation logic.\n  const cdsCommandString = retryCommand.originalCommand;\n\n  const attempt: CompilationAttempt = {\n    id: attemptId,\n    cdsCommand: cdsCommandString,\n    cacheDir: projectDir,\n    timestamp: startTime,\n    result: {\n      success: false,\n      timestamp: startTime,\n    },\n  };\n\n  try {\n    // Use the same compilation logic as the original attempt.\n    const primarySourceFile = task.sourceFiles[0];\n\n    const compilationResult = compileCdsToJson(\n      primarySourceFile,\n      dependencyGraph.sourceRootDir,\n      cdsCommandString,\n      projectDir,\n      // Convert CDS projects to BasicCdsProject format expected by compileCdsToJson\n      new Map(\n        Array.from(dependencyGraph.projects.entries()).map(([key, value]) => [\n          key,\n          {\n            cdsFiles: value.cdsFiles,\n            compilationTargets: value.compilationTargets,\n            expectedOutputFile: value.expectedOutputFile,\n            projectDir: value.projectDir,\n            dependencies: value.dependencies,\n            imports: value.imports,\n            packageJson: value.packageJson,\n          },\n        ]),\n      ),\n      task.projectDir,\n    );\n\n    attempt.result = {\n      ...compilationResult,\n      timestamp: startTime,\n    };\n  } catch (error) {\n    attempt.error = {\n      message: String(error),\n      stack: error instanceof Error ? error.stack : undefined,\n    };\n  }\n\n  return attempt;\n}\n\n/**\n * Executes retries for the provided array of {@link CompilationTask} instances.\n * @param tasksToRetry Tasks that need to be retried\n * @param project The {@link CdsProject} associated with the compilation tasks to retry\n * @param dependencyGraph The {@link CdsDependencyGraph} to update as tasks are retried\n * @returns The {@link ResultRetryCompilationTask}\n */\nfunction retryCompilationTasksForProject(\n  tasksToRetry: CompilationTask[],\n  project: CdsProject,\n  dependencyGraph: CdsDependencyGraph,\n): ResultRetryCompilationTask {\n  const startTime = Date.now();\n\n  const result: ResultRetryCompilationTask = {\n    projectDir: project.projectDir,\n    retriedTasks: [],\n    successfulRetries: 0,\n    failedRetries: 0,\n    fullDependenciesAvailable: Boolean(project.retryStatus?.fullDependenciesInstalled),\n    executionDurationMs: 0,\n    retryErrors: [],\n  };\n\n  cdsExtractorLog(\n    'info',\n    `Retrying ${tasksToRetry.length} task(s) for project ${project.projectDir} using ${result.fullDependenciesAvailable ? 'full' : 'minimal'} dependencies`,\n  );\n\n  for (const task of tasksToRetry) {\n    try {\n      // Mark task as being retried\n      task.retryInfo = {\n        hasBeenRetried: true,\n        retryReason: 'Output validation failed',\n        fullDependenciesInstalled: result.fullDependenciesAvailable,\n        retryTimestamp: new Date(),\n      };\n\n      // Use the retry command configured for this task\n      const retryAttempt = retryCompilationTask(\n        task,\n        task.retryCommand,\n        project.projectDir,\n        dependencyGraph,\n      );\n\n      task.retryInfo.retryAttempt = retryAttempt;\n      task.attempts.push(retryAttempt);\n      result.retriedTasks.push(task);\n\n      if (retryAttempt.result.success) {\n        task.status = 'success';\n        result.successfulRetries++;\n        cdsExtractorLog('info', `Retry successful for task ${task.id}`);\n      } else {\n        task.status = 'failed';\n        task.errorSummary = retryAttempt.error?.message ?? 'Retry compilation failed';\n        result.failedRetries++;\n        result.retryErrors.push(task.errorSummary);\n        cdsExtractorLog('warn', `Retry failed for task ${task.id}: ${task.errorSummary}`);\n      }\n    } catch (error) {\n      const errorMessage = `Failed to retry task ${task.id}: ${String(error)}`;\n      result.retryErrors.push(errorMessage);\n      result.failedRetries++;\n      task.status = 'failed';\n      task.errorSummary = errorMessage;\n      cdsExtractorLog('error', errorMessage);\n    }\n  }\n\n  result.executionDurationMs = Date.now() - startTime;\n\n  cdsExtractorLog(\n    'info',\n    `Retry execution completed for project ${project.projectDir}: ${result.successfulRetries} successful, ${result.failedRetries} failed`,\n  );\n\n  return result;\n}\n\n/**\n * Updates dependency graph with retry results\n * @param dependencyGraph The dependency graph to update\n * @param retryResults The retry orchestration results\n */\nfunction updateDependencyGraphWithRetryResults(\n  dependencyGraph: CdsDependencyGraph,\n  retryResults: ResultRetryCompilationOrchestration,\n): void {\n  // Remove manual counter updates - let updateCdsDependencyGraphStatus handle this\n  // Keep only non-status updates like timing and project tracking\n  dependencyGraph.retryStatus.totalRetryAttempts =\n    retryResults.totalSuccessfulRetries + retryResults.totalFailedRetries;\n}\n", "import { determineCdsCommand, determineVersionAwareCdsCommands } from './command';\nimport { compileCdsToJson } from './compile';\nimport { orchestrateRetryAttempts } from './retry';\nimport {\n  CompilationAttempt,\n  CompilationTask,\n  CompilationConfig,\n  ValidatedCdsCommand,\n} from './types';\nimport { updateCdsDependencyGraphStatus } from './validator';\nimport { cdsExtractorLog, generateStatusReport } from '../../logging';\nimport { CdsDependencyGraph, CdsProject } from '../parser/types';\n\n/** Attempt compilation with a specific command and configuration. */\nfunction attemptCompilation(\n  task: CompilationTask,\n  cdsCommand: string,\n  cacheDir: string | undefined,\n  dependencyGraph: CdsDependencyGraph,\n): CompilationAttempt {\n  const startTime = new Date();\n  const attemptId = `${task.id}_${startTime.getTime()}`;\n\n  const attempt: CompilationAttempt = {\n    id: attemptId,\n    cdsCommand,\n    cacheDir,\n    timestamp: startTime,\n    result: {\n      success: false,\n      timestamp: startTime,\n    },\n  };\n\n  try {\n    // For now, we'll use the first source file for compilation\n    // In a more sophisticated implementation, we might handle project-level compilation differently\n    const primarySourceFile = task.sourceFiles[0];\n\n    const compilationResult = compileCdsToJson(\n      primarySourceFile,\n      dependencyGraph.sourceRootDir,\n      cdsCommand,\n      cacheDir,\n      // Convert CDS projects to BasicCdsProject format expected by compileCdsToJson\n      new Map(\n        Array.from(dependencyGraph.projects.entries()).map(([key, value]) => [\n          key,\n          {\n            cdsFiles: value.cdsFiles,\n            compilationTargets: value.compilationTargets,\n            expectedOutputFile: value.expectedOutputFile,\n            projectDir: value.projectDir,\n            dependencies: value.dependencies,\n            imports: value.imports,\n            packageJson: value.packageJson,\n            compilationConfig: value.compilationConfig,\n          },\n        ]),\n      ),\n      task.projectDir,\n    );\n\n    const endTime = new Date();\n    attempt.result = {\n      ...compilationResult,\n      timestamp: endTime,\n      durationMs: endTime.getTime() - startTime.getTime(),\n      commandUsed: cdsCommand,\n      cacheDir,\n    };\n\n    if (compilationResult.success && compilationResult.outputPath) {\n      dependencyGraph.statusSummary.jsonFilesGenerated++;\n    }\n  } catch (error) {\n    const endTime = new Date();\n    attempt.error = {\n      message: String(error),\n      stack: error instanceof Error ? error.stack : undefined,\n    };\n    attempt.result.timestamp = endTime;\n    attempt.result.durationMs = endTime.getTime() - startTime.getTime();\n  }\n\n  task.attempts.push(attempt);\n  return attempt;\n}\n\n/**\n * Create a compilation task for a project or individual file\n */\nfunction createCompilationTask(\n  type: 'file' | 'project',\n  sourceFiles: string[],\n  expectedOutputFile: string,\n  projectDir: string,\n): CompilationTask {\n  // Create default commands for tasks - these should be updated later with proper commands\n  const defaultPrimaryCommand: ValidatedCdsCommand = {\n    executable: 'cds',\n    args: [],\n    originalCommand: 'cds',\n  };\n\n  const defaultRetryCommand: ValidatedCdsCommand = {\n    executable: 'npx',\n    args: ['cds'],\n    originalCommand: 'npx cds',\n  };\n\n  return {\n    id: `${type}_${projectDir}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`,\n    type,\n    status: 'pending',\n    sourceFiles,\n    expectedOutputFile,\n    projectDir,\n    attempts: [],\n    dependencies: [],\n    primaryCommand: defaultPrimaryCommand,\n    retryCommand: defaultRetryCommand,\n  };\n}\n\nfunction createCompilationConfig(\n  cdsCommand: string,\n  cacheDir: string | undefined,\n): CompilationConfig {\n  return {\n    cdsCommand: cdsCommand,\n    cacheDir: cacheDir,\n    versionCompatibility: {\n      isCompatible: true, // Will be validated during planning\n    },\n    maxRetryAttempts: 3,\n  };\n}\n\n/**\n * Execute a single compilation task\n */\nfunction executeCompilationTask(\n  task: CompilationTask,\n  project: CdsProject,\n  dependencyGraph: CdsDependencyGraph,\n  _codeqlExePath: string,\n): void {\n  task.status = 'in_progress';\n\n  const config = project.enhancedCompilationConfig;\n  if (!config) {\n    throw new Error(`No compilation configuration found for project ${project.projectDir}`);\n  }\n\n  const compilationAttempt = attemptCompilation(\n    task,\n    config.cdsCommand,\n    config.cacheDir,\n    dependencyGraph,\n  );\n\n  if (compilationAttempt.result.success) {\n    task.status = 'success';\n    return;\n  }\n\n  // Compilation failed - mark task as failed\n  const lastError = compilationAttempt.error\n    ? new Error(compilationAttempt.error.message)\n    : new Error('Compilation failed');\n\n  task.status = 'failed';\n  task.errorSummary = lastError?.message || 'Compilation failed';\n\n  // Note: Diagnostics are deferred until after retry phase completes\n  // to implement \"Silent Success\" - only add diagnostics for definitively failed tasks\n\n  cdsExtractorLog('error', `Compilation failed for task ${task.id}: ${task.errorSummary}`);\n}\n\n/**\n * Executes all compilation tasks for the provided {@link CdsDependencyGraph}.\n * Uses the provided `codeqlExePath` to run the CodeQL CLI, as needed, for\n * generating diagnositic warnings and/or errors for problems encountered while\n * running the CodeQL CDS extractor.\n */\nfunction executeCompilationTasks(dependencyGraph: CdsDependencyGraph, codeqlExePath: string): void {\n  cdsExtractorLog('info', 'Starting compilation execution for all projects...');\n\n  dependencyGraph.currentPhase = 'compiling';\n  const compilationStartTime = new Date();\n\n  // Collect all compilation tasks from all projects.\n  const allTasks: Array<{ task: CompilationTask; project: CdsProject }> = [];\n\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      allTasks.push({ task, project });\n    }\n  }\n\n  // Execute compilation tasks sequentially. There is room for optimization in the future.\n  // For now, we keep it simple to ensure consistent debug information collection.\n  cdsExtractorLog('info', `Executing ${allTasks.length} compilation task(s)...`);\n  for (const { task, project } of allTasks) {\n    try {\n      executeCompilationTask(task, project, dependencyGraph, codeqlExePath);\n    } catch (error) {\n      const errorMessage = `Failed to execute compilation task ${task.id}: ${String(error)}`;\n      cdsExtractorLog('error', errorMessage);\n\n      dependencyGraph.errors.critical.push({\n        phase: 'compiling',\n        message: errorMessage,\n        timestamp: new Date(),\n        stack: error instanceof Error ? error.stack : undefined,\n      });\n\n      task.status = 'failed';\n      task.errorSummary = errorMessage;\n      dependencyGraph.statusSummary.failedCompilations++;\n    }\n  }\n\n  // Update project statuses\n  for (const project of dependencyGraph.projects.values()) {\n    const allTasksCompleted = project.compilationTasks.every(\n      task => task.status === 'success' || task.status === 'failed',\n    );\n\n    if (allTasksCompleted) {\n      const hasFailedTasks = project.compilationTasks.some(task => task.status === 'failed');\n      project.status = hasFailedTasks ? 'failed' : 'completed';\n      project.timestamps.compilationCompleted = new Date();\n    }\n  }\n\n  const compilationEndTime = new Date();\n  dependencyGraph.statusSummary.performance.compilationDurationMs =\n    compilationEndTime.getTime() - compilationStartTime.getTime();\n\n  cdsExtractorLog(\n    'info',\n    `Compilation execution completed. Success: ${dependencyGraph.statusSummary.successfulCompilations}, Failed: ${dependencyGraph.statusSummary.failedCompilations}`,\n  );\n}\n\n/**\n * Orchestrates the compilation process for CDS files based on a dependency graph.\n *\n * This function coordinates the planning and execution of compilation tasks,\n * tracks the compilation status, and generates a post-compilation report.\n *\n * @param dependencyGraph - The {@link CdsDependencyGraph} representing the CDS projects,\n * project dependencies, expected compilation tasks, and their statuses.\n * @param projectCacheDirMap - A map from project identifiers to their cache directory paths.\n * @param codeqlExePath - The path to the CodeQL executable. Used for generating diagnostic\n * messages as part of the broader CodeQL (JavaScript) extraction process.\n * @throws Will rethrow any errors encountered during compilation, after logging them.\n */\nexport function orchestrateCompilation(\n  dependencyGraph: CdsDependencyGraph,\n  projectCacheDirMap: Map<string, string>,\n  codeqlExePath: string,\n): void {\n  try {\n    // Phase 1: Initial compilation\n    planCompilationTasks(dependencyGraph, projectCacheDirMap);\n    executeCompilationTasks(dependencyGraph, codeqlExePath);\n\n    // CENTRALIZED STATUS UPDATE: Establish post-initial-compilation state\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Phase 2: Retry orchestration\n    cdsExtractorLog('info', 'Starting retry orchestration phase...');\n    const retryResults = orchestrateRetryAttempts(dependencyGraph, codeqlExePath);\n\n    // CENTRALIZED STATUS UPDATE: Final validation and status synchronization\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Log retry results\n    if (retryResults.totalTasksRequiringRetry > 0) {\n      cdsExtractorLog(\n        'info',\n        `Retry phase completed: ${retryResults.totalTasksRequiringRetry} tasks retried, ${retryResults.totalSuccessfulRetries} successful, ${retryResults.totalFailedRetries} failed`,\n      );\n    } else {\n      cdsExtractorLog('info', 'Retry phase completed: no tasks required retry');\n    }\n\n    // Phase 3: Final status update\n    const hasFailures =\n      dependencyGraph.statusSummary.failedCompilations > 0 ||\n      dependencyGraph.errors.critical.length > 0;\n\n    dependencyGraph.statusSummary.overallSuccess = !hasFailures;\n    dependencyGraph.currentPhase = hasFailures ? 'failed' : 'completed';\n\n    // Phase 3: Status reporting (now guaranteed to be accurate)\n    const statusReport = generateStatusReport(dependencyGraph);\n    cdsExtractorLog('info', 'CDS Extractor Status Report : Post-Compilation...\\n' + statusReport);\n  } catch (error) {\n    const errorMessage = `Compilation orchestration failed: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'compiling',\n      message: errorMessage,\n      timestamp: new Date(),\n      stack: error instanceof Error ? error.stack : undefined,\n    });\n\n    dependencyGraph.currentPhase = 'failed';\n    dependencyGraph.statusSummary.overallSuccess = false;\n\n    throw error;\n  }\n}\n\n/** Plan compilation tasks for all projects in the dependency graph. */\nfunction planCompilationTasks(\n  dependencyGraph: CdsDependencyGraph,\n  projectCacheDirMap: Map<string, string>,\n): void {\n  cdsExtractorLog('info', 'Planning compilation tasks for all projects...');\n\n  dependencyGraph.currentPhase = 'compilation_planning';\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    try {\n      const cacheDir = projectCacheDirMap.get(projectDir);\n\n      // Determine version-aware CDS commands for both primary and retry scenarios\n      const commands = determineVersionAwareCdsCommands(\n        cacheDir,\n        dependencyGraph.sourceRootDir,\n        projectDir,\n        dependencyGraph,\n      );\n\n      // Keep backward compatibility - determine command string for compilation config\n      const cdsCommand = determineCdsCommand(cacheDir, dependencyGraph.sourceRootDir);\n\n      // Create compilation configuration (always project-level now)\n      const compilationConfig = createCompilationConfig(cdsCommand, cacheDir);\n\n      project.enhancedCompilationConfig = compilationConfig;\n\n      // Create compilation task (always project-level now)\n      const task = createCompilationTask(\n        'project',\n        project.cdsFiles,\n        project.expectedOutputFile,\n        projectDir,\n      );\n\n      // Update task with version-aware commands\n      task.primaryCommand = commands.primaryCommand;\n      task.retryCommand = commands.retryCommand;\n\n      project.compilationTasks = [task];\n\n      project.status = 'compilation_planned';\n      project.timestamps.compilationStarted = new Date();\n\n      cdsExtractorLog(\n        'info',\n        `Planned ${project.compilationTasks.length} compilation task(s) for project ${projectDir}`,\n      );\n    } catch (error) {\n      const errorMessage = `Failed to plan compilation for project ${projectDir}: ${String(error)}`;\n      cdsExtractorLog('error', errorMessage);\n\n      dependencyGraph.errors.critical.push({\n        phase: 'compilation_planning',\n        message: errorMessage,\n        timestamp: new Date(),\n        stack: error instanceof Error ? error.stack : undefined,\n      });\n\n      project.status = 'failed';\n    }\n  }\n\n  const totalTasks = Array.from(dependencyGraph.projects.values()).reduce(\n    (sum, project) => sum + project.compilationTasks.length,\n    0,\n  );\n\n  dependencyGraph.statusSummary.totalCompilationTasks = totalTasks;\n\n  cdsExtractorLog('info', `Compilation planning completed. Total tasks: ${totalTasks}`);\n}\n", "import { relative } from 'path';\n\n/**\n * Helper functions for mapping CDS files to their projects and cache directories\n */\n\n/**\n * Find the project directory for a CDS file\n * @param cdsFilePath Path to the CDS file\n * @param sourceRoot Source root directory\n * @param projectMap Map of project directories to project objects\n * @returns The project directory the file belongs to, or undefined if not found\n */\nexport function findProjectForCdsFile(\n  cdsFilePath: string,\n  sourceRoot: string,\n  projectMap: Map<string, { cdsFiles: string[] }>,\n): string | undefined {\n  // Get the relative path to the project directory for this CDS file\n  const relativeCdsFilePath = relative(sourceRoot, cdsFilePath);\n\n  // If the file is outside the source root, path.relative() will start with '../'\n  // In this case, we should also check against the absolute path\n  const isOutsideSourceRoot = relativeCdsFilePath.startsWith('../');\n\n  // Find the project this file belongs to\n  for (const [projectDir, project] of projectMap.entries()) {\n    if (\n      project.cdsFiles.some(\n        cdsFile =>\n          cdsFile === relativeCdsFilePath ||\n          relativeCdsFilePath.startsWith(projectDir) ||\n          (isOutsideSourceRoot && cdsFile === cdsFilePath),\n      )\n    ) {\n      return projectDir;\n    }\n  }\n\n  return undefined;\n}\n", "/** CDS indexer support for SAP CAP projects that use @sap/cds-indexer. */\n\nimport { spawnSync } from 'child_process';\nimport { delimiter, join } from 'path';\n\nimport { addCdsIndexerDiagnostic } from '../diagnostics';\nimport { npxExecutable } from '../environment';\nimport { cdsExtractorLog } from '../logging';\nimport { projectInstallDependencies } from '../packageManager';\nimport type { CdsDependencyGraph, CdsProject } from './parser/types';\n\n/** Maximum time (ms) allowed for a single cds-indexer invocation. */\nconst CDS_INDEXER_TIMEOUT_MS = 600_000;\n\n/** The npm package name for cds-indexer. */\nconst CDS_INDEXER_PACKAGE = '@sap/cds-indexer';\n\n/**\n * Result of running @sap/cds-indexer for a single project.\n */\nexport interface CdsIndexerResult {\n  /** Whether the cds-indexer ran successfully. */\n  success: boolean;\n  /** The project directory (relative to source root). */\n  projectDir: string;\n  /** Error message if the run failed. */\n  error?: string;\n  /** Duration of the run in milliseconds. */\n  durationMs: number;\n  /** Whether the run timed out. */\n  timedOut: boolean;\n}\n\n/**\n * Summary of running cds-indexer across all applicable projects.\n */\nexport interface CdsIndexerSummary {\n  /** Total number of projects in the dependency graph. */\n  totalProjects: number;\n  /** Number of projects that required cds-indexer. */\n  projectsRequiringIndexer: number;\n  /** Number of successful cds-indexer runs. */\n  successfulRuns: number;\n  /** Number of failed cds-indexer runs. */\n  failedRuns: number;\n  /** Per-project results (only for projects that required cds-indexer). */\n  results: CdsIndexerResult[];\n}\n\n/**\n * Determines whether a {@link CdsProject} uses `@sap/cds-indexer` by checking\n * the project's `package.json` for the package in `dependencies` or `devDependencies`.\n *\n * @param project The CDS project to check.\n * @returns `true` if the project declares `@sap/cds-indexer` as a dependency.\n */\nexport function projectUsesCdsIndexer(project: CdsProject): boolean {\n  if (!project.packageJson) {\n    return false;\n  }\n\n  const inDeps = project.packageJson.dependencies?.[CDS_INDEXER_PACKAGE] !== undefined;\n  const inDevDeps = project.packageJson.devDependencies?.[CDS_INDEXER_PACKAGE] !== undefined;\n\n  return inDeps || inDevDeps;\n}\n\n/**\n * Runs `npx @sap/cds-indexer` for a given CDS project directory.\n *\n * The function spawns `npx @sap/cds-indexer` with appropriate environment\n * variables to ensure the indexer can locate dependencies from the cache\n * directory (if provided) or the project's own `node_modules`.\n *\n * @param project The CDS project to run the indexer for.\n * @param sourceRoot The source root directory.\n * @param cacheDir Optional cache directory containing installed dependencies.\n * @returns A {@link CdsIndexerResult} with the outcome of the run.\n */\nexport function runCdsIndexer(\n  project: CdsProject,\n  sourceRoot: string,\n  cacheDir?: string,\n): CdsIndexerResult {\n  const projectAbsPath = join(sourceRoot, project.projectDir);\n  const startTime = Date.now();\n\n  const result: CdsIndexerResult = {\n    success: false,\n    projectDir: project.projectDir,\n    durationMs: 0,\n    timedOut: false,\n  };\n\n  try {\n    // Build NODE_PATH to include cache and project node_modules so npx can\n    // resolve the package even when it was installed in the cache directory.\n    const nodePaths: string[] = [];\n    if (cacheDir) {\n      nodePaths.push(join(cacheDir, 'node_modules'));\n    }\n    nodePaths.push(join(projectAbsPath, 'node_modules'));\n\n    const env: Record<string, string | undefined> = {\n      ...process.env,\n      NODE_PATH: nodePaths.join(delimiter),\n    };\n\n    cdsExtractorLog(\n      'info',\n      `Running ${CDS_INDEXER_PACKAGE} for project '${project.projectDir}'...`,\n    );\n\n    const spawnResult = spawnSync(npxExecutable(), ['--yes', CDS_INDEXER_PACKAGE], {\n      cwd: projectAbsPath,\n      env,\n      stdio: 'pipe',\n      timeout: CDS_INDEXER_TIMEOUT_MS,\n    });\n\n    result.durationMs = Date.now() - startTime;\n\n    // Check for timeout (signal-based termination)\n    if (spawnResult.signal === 'SIGTERM' || spawnResult.signal === 'SIGKILL') {\n      result.timedOut = true;\n      result.error = `${CDS_INDEXER_PACKAGE} timed out after ${CDS_INDEXER_TIMEOUT_MS}ms for project '${project.projectDir}'`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Check for spawn error (e.g. npx not found)\n    if (spawnResult.error) {\n      result.error = `${CDS_INDEXER_PACKAGE} failed to start for project '${project.projectDir}': ${String(spawnResult.error)}`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Check exit code\n    if (spawnResult.status !== 0) {\n      const stderr = spawnResult.stderr?.toString().trim() ?? '';\n      const stdout = spawnResult.stdout?.toString().trim() ?? '';\n      const output = stderr || stdout || 'unknown error';\n      result.error = `${CDS_INDEXER_PACKAGE} failed for project '${project.projectDir}' (exit code ${spawnResult.status}): ${output}`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Success\n    result.success = true;\n    cdsExtractorLog(\n      'info',\n      `Successfully ran ${CDS_INDEXER_PACKAGE} for project '${project.projectDir}' (${result.durationMs}ms)`,\n    );\n  } catch (error) {\n    result.durationMs = Date.now() - startTime;\n    result.error = `${CDS_INDEXER_PACKAGE} threw an unexpected error for project '${project.projectDir}': ${String(error)}`;\n    cdsExtractorLog('error', result.error);\n  }\n\n  return result;\n}\n\n/**\n * Orchestrates running `@sap/cds-indexer` for all applicable projects in the\n * dependency graph. This should be called after dependency installation and\n * before CDS compilation.\n *\n * Projects that do not declare `@sap/cds-indexer` in their `package.json` are\n * skipped. Failures are handled gracefully: a diagnostic warning is added to\n * the CodeQL database and processing continues with the remaining projects.\n *\n * @param dependencyGraph The CDS dependency graph.\n * @param sourceRoot The source root directory.\n * @param projectCacheDirMap Map of project directories to their cache directories.\n * @param codeqlExePath Optional path to the CodeQL executable for diagnostics.\n * @returns A {@link CdsIndexerSummary} with the outcome of all runs.\n */\nexport function orchestrateCdsIndexer(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRoot: string,\n  projectCacheDirMap: Map<string, string>,\n  codeqlExePath?: string,\n): CdsIndexerSummary {\n  const summary: CdsIndexerSummary = {\n    totalProjects: dependencyGraph.projects.size,\n    projectsRequiringIndexer: 0,\n    successfulRuns: 0,\n    failedRuns: 0,\n    results: [],\n  };\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    if (!projectUsesCdsIndexer(project)) {\n      continue;\n    }\n\n    summary.projectsRequiringIndexer++;\n    const cacheDir = projectCacheDirMap.get(projectDir);\n    const result = runCdsIndexer(project, sourceRoot, cacheDir);\n    summary.results.push(result);\n\n    if (result.success) {\n      summary.successfulRuns++;\n\n      // Install the project's full dependencies so the CDS compiler can\n      // resolve all CDS model imports (e.g. `@sap/cds-shim`) during\n      // compilation.  The cache directory only contains `@sap/cds`,\n      // `@sap/cds-dk`, and `@sap/cds-indexer`, which is not enough for\n      // projects that reference additional CDS packages.\n      const installResult = projectInstallDependencies(project, sourceRoot);\n      if (!installResult.success) {\n        cdsExtractorLog(\n          'warn',\n          `Full dependency installation failed for project '${projectDir}' after successful cds-indexer run: ${installResult.error ?? 'unknown error'}`,\n        );\n      }\n    } else {\n      summary.failedRuns++;\n\n      // Add a diagnostic warning \u2014 the compilation may still succeed without\n      // the indexer, so we use a warning rather than an error.\n      if (codeqlExePath) {\n        addCdsIndexerDiagnostic(\n          projectDir,\n          result.error ?? `${CDS_INDEXER_PACKAGE} failed for project '${projectDir}'`,\n          codeqlExePath,\n          sourceRoot,\n        );\n      }\n    }\n  }\n\n  // Log summary\n  if (summary.projectsRequiringIndexer > 0) {\n    cdsExtractorLog(\n      'info',\n      `CDS indexer summary: ${summary.projectsRequiringIndexer} project(s) required indexer, ${summary.successfulRuns} succeeded, ${summary.failedRuns} failed`,\n    );\n  } else {\n    cdsExtractorLog('info', 'No projects require @sap/cds-indexer.');\n  }\n\n  return summary;\n}\n", "import { dirname, join, resolve, sep, basename } from 'path';\n\nimport {\n  determineCdsFilesForProjectDir,\n  determineCdsFilesToCompile,\n  determineCdsProjectsUnderSourceDir,\n  extractCdsImports,\n  readPackageJsonFile,\n} from './functions';\nimport { CdsDependencyGraph, CdsImport, CdsProject, BasicCdsProject } from './types';\nimport { modelCdsJsonFile } from '../../constants';\nimport { cdsExtractorLog } from '../../logging';\nimport { getPathsIgnorePatterns, shouldIgnorePath } from '../../paths-ignore';\n\n/**\n * Builds a basic dependency graph of CDS projects and performs the initial parsing stage of the CDS extractor.\n * This is the internal function that creates basic project structures.\n *\n * @param sourceRootDir - Source root directory\n * @returns Map of project directories to their BasicCdsProject objects with dependency information\n */\nfunction buildBasicCdsProjectDependencyGraph(sourceRootDir: string): Map<string, BasicCdsProject> {\n  // Find all CDS projects under the source directory\n  cdsExtractorLog('info', 'Detecting CDS projects...');\n  const projectDirs = determineCdsProjectsUnderSourceDir(sourceRootDir);\n\n  if (projectDirs.length === 0) {\n    cdsExtractorLog('info', 'No CDS projects found.');\n    return new Map<string, BasicCdsProject>();\n  }\n\n  cdsExtractorLog('info', `Found ${projectDirs.length} CDS project(s) under source directory.`);\n\n  // Load paths-ignore patterns once for the entire source root\n  const pathsIgnorePatterns = getPathsIgnorePatterns(sourceRootDir);\n\n  const projectMap = new Map<string, BasicCdsProject>();\n\n  // First pass: create CdsProject objects for each project directory\n  for (const projectDir of projectDirs) {\n    // Skip projects whose directory matches a paths-ignore pattern\n    if (pathsIgnorePatterns.length > 0 && shouldIgnorePath(projectDir, pathsIgnorePatterns)) {\n      cdsExtractorLog('info', `Skipping project '${projectDir}' \u2014 matches paths-ignore pattern`);\n      continue;\n    }\n\n    const absoluteProjectDir = join(sourceRootDir, projectDir);\n    const cdsFiles = determineCdsFilesForProjectDir(sourceRootDir, absoluteProjectDir);\n\n    // Skip projects with no CDS files remaining after paths-ignore filtering\n    if (cdsFiles.length === 0) {\n      cdsExtractorLog(\n        'info',\n        `Skipping project '${projectDir}' \u2014 no CDS files remain after paths-ignore filtering`,\n      );\n      continue;\n    }\n\n    // Try to load package.json if it exists\n    const packageJsonPath = join(absoluteProjectDir, 'package.json');\n    const packageJson = readPackageJsonFile(packageJsonPath);\n\n    projectMap.set(projectDir, {\n      projectDir,\n      cdsFiles,\n      compilationTargets: [], // Will be populated in the third pass\n      expectedOutputFile: join(projectDir, modelCdsJsonFile),\n      packageJson,\n      dependencies: [],\n      imports: new Map<string, CdsImport[]>(),\n    });\n  }\n\n  // Second pass: analyze dependencies between projects\n  cdsExtractorLog('info', 'Analyzing dependencies between CDS projects...');\n  for (const [projectDir, project] of projectMap.entries()) {\n    // Check each CDS file for imports\n    for (const relativeFilePath of project.cdsFiles) {\n      const absoluteFilePath = join(sourceRootDir, relativeFilePath);\n\n      try {\n        const imports = extractCdsImports(absoluteFilePath);\n        const enrichedImports: CdsImport[] = [];\n\n        // Process each import\n        for (const importInfo of imports) {\n          const enrichedImport: CdsImport = { ...importInfo };\n\n          if (importInfo.isRelative) {\n            // Resolve the relative import path\n            const importedFilePath = resolve(dirname(absoluteFilePath), importInfo.path);\n            const normalizedImportedPath = importedFilePath.endsWith('.cds')\n              ? importedFilePath\n              : `${importedFilePath}.cds`;\n\n            // Store the resolved path relative to source root\n            try {\n              const relativeToDirPath = dirname(relativeFilePath);\n              const resolvedPath = resolve(join(sourceRootDir, relativeToDirPath), importInfo.path);\n              const normalizedResolvedPath = resolvedPath.endsWith('.cds')\n                ? resolvedPath\n                : `${resolvedPath}.cds`;\n\n              // Convert to relative path from source root\n              if (normalizedResolvedPath.startsWith(sourceRootDir)) {\n                enrichedImport.resolvedPath = normalizedResolvedPath\n                  .substring(sourceRootDir.length)\n                  .replace(/^[/\\\\]/, '');\n              }\n            } catch (error) {\n              cdsExtractorLog(\n                'warn',\n                `Could not resolve import path for ${importInfo.path} in ${relativeFilePath}: ${String(error)}`,\n              );\n            }\n\n            // Find which project contains this imported file\n            for (const [otherProjectDir, otherProject] of projectMap.entries()) {\n              if (otherProjectDir === projectDir) continue; // Skip self\n\n              const otherProjectAbsoluteDir = join(sourceRootDir, otherProjectDir);\n\n              // Check if the imported file is in the other project\n              const isInOtherProject = otherProject.cdsFiles.some(otherFile => {\n                const otherAbsolutePath = join(sourceRootDir, otherFile);\n                return (\n                  otherAbsolutePath === normalizedImportedPath ||\n                  normalizedImportedPath.startsWith(otherProjectAbsoluteDir + sep)\n                );\n              });\n\n              if (isInOtherProject) {\n                // Add dependency if not already present\n                project.dependencies ??= [];\n\n                if (!project.dependencies.includes(otherProject)) {\n                  project.dependencies.push(otherProject);\n                }\n              }\n            }\n          }\n          // For module imports, check package.json dependencies\n          else if (importInfo.isModule && project.packageJson) {\n            const dependencies = {\n              ...(project.packageJson.dependencies ?? {}),\n              ...(project.packageJson.devDependencies ?? {}),\n            };\n\n            // Extract module name from import path (e.g., '@sap/cds/common' -> '@sap/cds')\n            const moduleName = importInfo.path.split('/')[0].startsWith('@')\n              ? importInfo.path.split('/').slice(0, 2).join('/')\n              : importInfo.path.split('/')[0];\n\n            if (dependencies[moduleName]) {\n              // This is a valid module dependency, nothing more to do here\n              // In the future, we could track module dependencies separately\n            }\n          }\n\n          enrichedImports.push(enrichedImport);\n        }\n\n        // Store the enriched imports in the project\n        project.imports?.set(relativeFilePath, enrichedImports);\n      } catch (error: unknown) {\n        cdsExtractorLog(\n          'warn',\n          `Error processing imports in ${absoluteFilePath}: ${String(error)}`,\n        );\n      }\n    }\n  }\n\n  // Third pass: determine CDS files to compile and expected output files for each project\n  cdsExtractorLog(\n    'info',\n    'Determining CDS files to compile and expected output files for each project...',\n  );\n  for (const [, project] of projectMap.entries()) {\n    try {\n      const projectPlan = determineCdsFilesToCompile(sourceRootDir, project);\n\n      // Assign the calculated values back to the project\n      project.compilationTargets = projectPlan.compilationTargets;\n      project.expectedOutputFile = projectPlan.expectedOutputFile;\n    } catch (error) {\n      cdsExtractorLog(\n        'warn',\n        `Error determining files to compile for project ${project.projectDir}: ${String(error)}`,\n      );\n      // Fall back to default project compilation on error\n      project.compilationTargets = project.cdsFiles.map(file => basename(file));\n      project.expectedOutputFile = join(project.projectDir, modelCdsJsonFile);\n    }\n  }\n\n  return projectMap;\n}\n\n/**\n * Builds a CDS dependency graph with comprehensive tracking and debug information.\n * This is the main function that returns a CdsDependencyGraph instead of a simple Map.\n * The extractor now runs in autobuild mode by default.\n *\n * @param sourceRootDir - Source root directory\n * @returns CDS dependency graph with comprehensive tracking\n */\nexport function buildCdsProjectDependencyGraph(sourceRootDir: string): CdsDependencyGraph {\n  const startTime = new Date();\n\n  // Create the initial dependency graph structure\n  const dependencyGraph: CdsDependencyGraph = {\n    id: `cds_graph_${Date.now()}`,\n    sourceRootDir,\n    projects: new Map<string, CdsProject>(),\n    debugInfo: {\n      extractor: {\n        runMode: 'autobuild',\n        sourceRootDir,\n        startTime,\n        environment: {\n          nodeVersion: process.version,\n          platform: process.platform,\n          cwd: process.cwd(),\n          argv: process.argv,\n        },\n      },\n      parser: {\n        projectsDetected: 0,\n        cdsFilesFound: 0,\n        dependencyResolutionSuccess: true,\n        parsingErrors: [],\n        parsingWarnings: [],\n      },\n      compiler: {\n        availableCommands: [],\n        selectedCommand: '',\n        cacheDirectories: [],\n        cacheInitialized: false,\n      },\n    },\n    currentPhase: 'parsing',\n    statusSummary: {\n      overallSuccess: false,\n      totalProjects: 0,\n      totalCdsFiles: 0,\n      totalCompilationTasks: 0,\n      successfulCompilations: 0,\n      failedCompilations: 0,\n      skippedCompilations: 0,\n      jsonFilesGenerated: 0,\n      criticalErrors: [],\n      warnings: [],\n      performance: {\n        totalDurationMs: 0,\n        parsingDurationMs: 0,\n        compilationDurationMs: 0,\n        extractionDurationMs: 0,\n      },\n    },\n    config: {\n      maxRetryAttempts: 3,\n      enableDetailedLogging: false, // Debug modes removed\n      generateDebugOutput: false, // Debug modes removed\n      compilationTimeoutMs: 30000, // 30 seconds\n    },\n    errors: {\n      critical: [],\n      warnings: [],\n    },\n    retryStatus: {\n      totalTasksRequiringRetry: 0,\n      totalTasksSuccessfullyRetried: 0,\n      totalRetryAttempts: 0,\n      projectsRequiringFullDependencies: new Set<string>(),\n      projectsWithFullDependencies: new Set<string>(),\n    },\n  };\n\n  try {\n    // Use the existing function to build the basic project map\n    const basicProjectMap = buildBasicCdsProjectDependencyGraph(sourceRootDir);\n\n    // Convert basic projects to CDS projects\n    for (const [projectDir, basicProject] of basicProjectMap.entries()) {\n      const cdsProject: CdsProject = {\n        ...basicProject,\n        id: `project_${projectDir.replace(/[^a-zA-Z0-9]/g, '_')}_${Date.now()}`,\n        enhancedCompilationConfig: undefined, // Will be set during compilation planning\n        compilationTasks: [],\n        parserDebugInfo: {\n          dependenciesResolved: [],\n          importErrors: [],\n          parseErrors: new Map<string, string>(),\n        },\n        status: 'discovered',\n        timestamps: {\n          discovered: new Date(),\n        },\n      };\n\n      dependencyGraph.projects.set(projectDir, cdsProject);\n    }\n\n    // Update summary statistics\n    dependencyGraph.statusSummary.totalProjects = dependencyGraph.projects.size;\n    dependencyGraph.statusSummary.totalCdsFiles = Array.from(\n      dependencyGraph.projects.values(),\n    ).reduce((sum, project) => sum + project.cdsFiles.length, 0);\n\n    dependencyGraph.debugInfo.parser.projectsDetected = dependencyGraph.projects.size;\n    dependencyGraph.debugInfo.parser.cdsFilesFound = dependencyGraph.statusSummary.totalCdsFiles;\n\n    // Mark dependency resolution phase as completed\n    dependencyGraph.currentPhase = 'dependency_resolution';\n\n    const endTime = new Date();\n    dependencyGraph.debugInfo.extractor.endTime = endTime;\n    dependencyGraph.debugInfo.extractor.durationMs = endTime.getTime() - startTime.getTime();\n    dependencyGraph.statusSummary.performance.parsingDurationMs =\n      dependencyGraph.debugInfo.extractor.durationMs;\n\n    cdsExtractorLog(\n      'info',\n      `CDS dependency graph created with ${dependencyGraph.projects.size} projects and ${dependencyGraph.statusSummary.totalCdsFiles} CDS files`,\n    );\n\n    return dependencyGraph;\n  } catch (error) {\n    const errorMessage = `Failed to build CDS dependency graph: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'parsing',\n      message: errorMessage,\n      timestamp: new Date(),\n      stack: error instanceof Error ? error.stack : undefined,\n    });\n\n    dependencyGraph.currentPhase = 'failed';\n    return dependencyGraph;\n  }\n}\n", "import { existsSync, readFileSync, statSync } from 'fs';\nimport { basename, dirname, join, relative, sep } from 'path';\n\nimport { sync } from 'glob';\n\nimport { CdsFilesToCompile, CdsImport, PackageJson } from './types';\nimport { modelCdsJsonFile } from '../../constants';\nimport { cdsExtractorLog } from '../../logging';\nimport { filterIgnoredPaths, getPathsIgnorePatterns } from '../../paths-ignore';\n\n/**\n * Determines the list of CDS files to be parsed for the specified project directory.\n *\n * @param sourceRootDir - The source root directory to search for CDS files. This is\n * used to resolve relative paths in relation to a common (source root) directory for\n * multiple projects.\n * @param projectDir - The full, local filesystem path of the directory that contains\n * the individual `.cds` definition files for some `CAP` project.\n * @returns An array of strings representing the paths, relative to the source root\n * directory, of the `.cds` files to be parsed for a given project.\n */\nexport function determineCdsFilesForProjectDir(\n  sourceRootDir: string,\n  projectDir: string,\n): string[] {\n  if (!sourceRootDir || !projectDir) {\n    throw new Error(\n      `Unable to determine CDS files for project dir '${projectDir}'; both sourceRootDir and projectDir must be provided.`,\n    );\n  }\n\n  // Normalize paths by removing trailing slashes for comparison\n  const normalizedSourceRoot = sourceRootDir.replace(/[/\\\\]+$/, '');\n  const normalizedProjectDir = projectDir.replace(/[/\\\\]+$/, '');\n\n  if (\n    !normalizedProjectDir.startsWith(normalizedSourceRoot) &&\n    normalizedProjectDir !== normalizedSourceRoot\n  ) {\n    throw new Error(\n      'projectDir must be a subdirectory of sourceRootDir or equal to sourceRootDir.',\n    );\n  }\n\n  try {\n    // Use glob to find all .cds files under the project directory, excluding node_modules\n    const cdsFiles = sync(join(projectDir, '**/*.cds'), {\n      nodir: true,\n      ignore: ['**/node_modules/**', '**/*.testproj/**'],\n      windowsPathsNoEscape: true,\n    });\n\n    // Convert absolute paths to paths relative to sourceRootDir\n    const relativePaths = cdsFiles.map(file => relative(sourceRootDir, file));\n\n    // Apply paths-ignore filtering from CodeQL config\n    const pathsIgnorePatterns = getPathsIgnorePatterns(sourceRootDir);\n    if (pathsIgnorePatterns.length > 0) {\n      const filtered = filterIgnoredPaths(relativePaths, pathsIgnorePatterns);\n      const ignoredCount = relativePaths.length - filtered.length;\n      if (ignoredCount > 0) {\n        cdsExtractorLog(\n          'info',\n          `Filtered ${ignoredCount} CDS file(s) matching paths-ignore patterns in project ${relative(sourceRootDir, projectDir) || '.'}`,\n        );\n      }\n      return filtered;\n    }\n\n    return relativePaths;\n  } catch (error: unknown) {\n    cdsExtractorLog('error', `Error finding CDS files in ${projectDir}: ${String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Determines the list of distinct CDS projects under the specified source\n * directory.\n * @param sourceRootDir - The source root directory to search for CDS projects.\n * @returns An array of strings representing the paths, relative to the source\n * root directory, of the detected CDS projects.\n */\nexport function determineCdsProjectsUnderSourceDir(sourceRootDir: string): string[] {\n  if (!sourceRootDir || !existsSync(sourceRootDir)) {\n    throw new Error(`Source root directory '${sourceRootDir}' does not exist.`);\n  }\n\n  const foundProjects = new Set<string>();\n\n  // Find all potential project directories by looking for package.json files and CDS files\n  const packageJsonFiles = sync(join(sourceRootDir, '**/package.json'), {\n    nodir: true,\n    ignore: ['**/node_modules/**', '**/*.testproj/**'],\n    windowsPathsNoEscape: true,\n  });\n\n  const cdsFiles = sync(join(sourceRootDir, '**/*.cds'), {\n    nodir: true,\n    ignore: ['**/node_modules/**', '**/*.testproj/**'],\n    windowsPathsNoEscape: true,\n  });\n\n  // Collect all potential project directories\n  const candidateDirectories = new Set<string>();\n\n  // Add directories with package.json files\n  for (const packageJsonFile of packageJsonFiles) {\n    candidateDirectories.add(dirname(packageJsonFile));\n  }\n\n  // Add directories with CDS files and try to find their project roots\n  for (const cdsFile of cdsFiles) {\n    const cdsDir = dirname(cdsFile);\n    const projectRoot = findProjectRootFromCdsFile(cdsDir, sourceRootDir);\n    if (projectRoot) {\n      candidateDirectories.add(projectRoot);\n    } else {\n      candidateDirectories.add(cdsDir);\n    }\n  }\n\n  // Filter candidates to only include likely CDS projects\n  for (const dir of candidateDirectories) {\n    if (isLikelyCdsProject(dir)) {\n      const relativePath = relative(sourceRootDir, dir);\n      const projectDir = relativePath || '.';\n\n      // Check if this project is already included as a parent or child of an existing project\n      let shouldAdd = true;\n      const existingProjects = Array.from(foundProjects);\n\n      for (const existingProject of existingProjects) {\n        const existingAbsPath = join(sourceRootDir, existingProject);\n\n        // Skip if this directory is a subdirectory of an existing project,\n        // but only if the parent is not a monorepo with its own CDS content\n        if (dir.startsWith(existingAbsPath + sep)) {\n          // Check if parent is a monorepo root with its own CDS content\n          const parentPackageJsonPath = join(existingAbsPath, 'package.json');\n          const parentPackageJson = readPackageJsonFile(parentPackageJsonPath);\n          const isParentMonorepo =\n            parentPackageJson?.workspaces &&\n            Array.isArray(parentPackageJson.workspaces) &&\n            parentPackageJson.workspaces.length > 0;\n\n          // If parent is a monorepo with CDS content, allow both parent and child\n          if (\n            isParentMonorepo &&\n            (hasStandardCdsContent(existingAbsPath) || hasDirectCdsContent(existingAbsPath))\n          ) {\n            // Both parent and child can coexist as separate CDS projects\n            shouldAdd = true;\n          } else {\n            // Traditional case: exclude subdirectory\n            shouldAdd = false;\n          }\n          break;\n        }\n\n        // Remove existing project if it's a subdirectory of the current directory,\n        // unless the current directory is a monorepo root and the existing project has its own CDS content\n        if (existingAbsPath.startsWith(dir + sep)) {\n          const currentPackageJsonPath = join(dir, 'package.json');\n          const currentPackageJson = readPackageJsonFile(currentPackageJsonPath);\n          const isCurrentMonorepo =\n            currentPackageJson?.workspaces &&\n            Array.isArray(currentPackageJson.workspaces) &&\n            currentPackageJson.workspaces.length > 0;\n\n          // If current is a monorepo and the existing project is a legitimate CDS project, keep both\n          if (!(isCurrentMonorepo && isLikelyCdsProject(existingAbsPath))) {\n            foundProjects.delete(existingProject);\n          }\n        }\n      }\n\n      if (shouldAdd) {\n        foundProjects.add(projectDir);\n      }\n    }\n  }\n\n  return Array.from(foundProjects).sort();\n}\n\n/**\n * Parses a CDS file to extract import statements\n *\n * @param filePath - Path to the CDS file\n * @returns Array of import statements found in the file\n */\nexport function extractCdsImports(filePath: string): CdsImport[] {\n  if (!existsSync(filePath)) {\n    throw new Error(`File does not exist: ${filePath}`);\n  }\n\n  const content = readFileSync(filePath, 'utf8');\n  const imports: CdsImport[] = [];\n\n  // Regular expression to match using statements\n  // This handles: using X from 'path'; and using { X, Y } from 'path';\n  // and also using X as Y from 'path';\n  const usingRegex =\n    /using\\s+(?:{[^}]+}|[\\w.]+(?:\\s+as\\s+[\\w.]+)?)\\s+from\\s+['\"`]([^'\"`]+)['\"`]\\s*;/g;\n\n  let match;\n  while ((match = usingRegex.exec(content)) !== null) {\n    const path = match[1];\n    imports.push({\n      statement: match[0],\n      path,\n      isRelative: path.startsWith('./') || path.startsWith('../'),\n      isModule: !path.startsWith('./') && !path.startsWith('../') && !path.startsWith('/'),\n    });\n  }\n\n  return imports;\n}\n\n/**\n * Attempts to find the project root directory starting from a directory containing a CDS file\n *\n * @param cdsFileDir - Directory containing a CDS file\n * @param sourceRootDir - Source root directory to limit the search\n * @returns The project root directory or null if not found\n */\nfunction findProjectRootFromCdsFile(cdsFileDir: string, sourceRootDir: string): string | null {\n  // Skip node_modules and testproj directories entirely\n  if (cdsFileDir.includes('node_modules') || cdsFileDir.includes('.testproj')) {\n    return null;\n  }\n\n  let currentDir = cdsFileDir;\n\n  // Limit the upward search to the sourceRootDir\n  while (currentDir.startsWith(sourceRootDir)) {\n    // Check if this directory looks like a project root\n    if (isLikelyCdsProject(currentDir)) {\n      // If this is a standard CAP subdirectory (srv, db, app), check if the parent\n      // directory should be the real project root\n      const currentDirName = basename(currentDir);\n      const isStandardSubdir = ['srv', 'db', 'app'].includes(currentDirName);\n\n      if (isStandardSubdir) {\n        const parentDir = dirname(currentDir);\n\n        if (\n          parentDir !== currentDir &&\n          parentDir.startsWith(sourceRootDir) &&\n          !parentDir.includes('node_modules') &&\n          !parentDir.includes('.testproj') &&\n          isLikelyCdsProject(parentDir)\n        ) {\n          // The parent is also a CDS project, so it's likely the real project root\n          return parentDir;\n        }\n      }\n\n      // For non-standard subdirectories, also check if the parent might be a better project root\n      const parentDir = dirname(currentDir);\n\n      if (\n        parentDir !== currentDir &&\n        parentDir.startsWith(sourceRootDir) &&\n        !parentDir.includes('node_modules') &&\n        !parentDir.includes('.testproj')\n      ) {\n        const hasDbDir =\n          existsSync(join(parentDir, 'db')) && statSync(join(parentDir, 'db')).isDirectory();\n        const hasSrvDir =\n          existsSync(join(parentDir, 'srv')) && statSync(join(parentDir, 'srv')).isDirectory();\n        const hasAppDir =\n          existsSync(join(parentDir, 'app')) && statSync(join(parentDir, 'app')).isDirectory();\n\n        // Use the same CAP project structure logic as below\n        if ((hasDbDir && hasSrvDir) || (hasSrvDir && hasAppDir)) {\n          return parentDir;\n        }\n      }\n\n      return currentDir;\n    }\n\n    // Check for typical CAP project structure indicators\n    const hasDbDir =\n      existsSync(join(currentDir, 'db')) && statSync(join(currentDir, 'db')).isDirectory();\n    const hasSrvDir =\n      existsSync(join(currentDir, 'srv')) && statSync(join(currentDir, 'srv')).isDirectory();\n    const hasAppDir =\n      existsSync(join(currentDir, 'app')) && statSync(join(currentDir, 'app')).isDirectory();\n\n    if ((hasDbDir && hasSrvDir) || (hasSrvDir && hasAppDir)) {\n      return currentDir;\n    }\n\n    // Move up one directory\n    const parentDir = dirname(currentDir);\n    if (parentDir === currentDir) {\n      // We've reached the root of the filesystem\n      break;\n    }\n    currentDir = parentDir;\n  }\n\n  // If we couldn't determine a proper project root, return the original directory\n  return cdsFileDir;\n}\n\n/**\n * Determines if a directory likely contains a CAP project by checking for key\n * indicators like package.json with CAP dependencies or .cds files in standard\n * locations.\n *\n * @param dir - Directory to check\n * @returns true if the directory likely contains a CAP project\n */\nexport function isLikelyCdsProject(dir: string): boolean {\n  try {\n    // Skip node_modules and testproj directories entirely\n    if (dir.includes('node_modules') || dir.includes('.testproj')) {\n      return false;\n    }\n\n    // Check for CDS files in standard locations (checking both direct and nested files)\n    const hasStandardCdsDirectories = hasStandardCdsContent(dir);\n    const hasDirectCdsFiles = hasDirectCdsContent(dir);\n    const hasCdsFiles = hasStandardCdsDirectories || hasDirectCdsFiles;\n\n    // Check if package.json exists and has CAP dependencies\n    const hasCapDependencies = hasPackageJsonWithCapDeps(dir);\n\n    if (hasCapDependencies) {\n      // If there are CAP dependencies but no CDS files, there's nothing for us to do\n      if (!hasCdsFiles) {\n        return false;\n      }\n\n      // Check if this is a monorepo root\n      const packageJsonPath = join(dir, 'package.json');\n      const packageJson = readPackageJsonFile(packageJsonPath);\n\n      if (\n        packageJson?.workspaces &&\n        Array.isArray(packageJson.workspaces) &&\n        packageJson.workspaces.length > 0\n      ) {\n        // This is likely a monorepo - only treat as CDS project if it has actual CDS content\n        if (!hasCdsFiles) {\n          // This is a monorepo root without its own CDS content\n          return false;\n        }\n      }\n\n      return true;\n    }\n\n    // If no CAP dependencies, only consider it a CDS project if it has CDS files\n    return hasCdsFiles;\n  } catch (error: unknown) {\n    cdsExtractorLog('error', `Error checking directory ${dir}: ${String(error)}`);\n    return false;\n  }\n}\n\n/**\n * Check if a directory has CDS content in standard CAP directories.\n */\nfunction hasStandardCdsContent(dir: string): boolean {\n  const standardLocations = [join(dir, 'db'), join(dir, 'srv'), join(dir, 'app')];\n\n  for (const location of standardLocations) {\n    if (existsSync(location) && statSync(location).isDirectory()) {\n      // Check for any .cds files at any level under these directories.\n      const cdsFiles = sync(join(location, '**/*.cds'), {\n        nodir: true,\n        windowsPathsNoEscape: true,\n      });\n      if (cdsFiles.length > 0) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\n/**\n * Check if a directory has direct CDS files.\n */\nfunction hasDirectCdsContent(dir: string): boolean {\n  const directCdsFiles = sync(join(dir, '*.cds'), { windowsPathsNoEscape: true });\n  return directCdsFiles.length > 0;\n}\n\n/**\n * Safely parses a package.json file, using the cache if available\n * @param filePath - Path to the package.json file\n * @returns The parsed package.json content or undefined if the file doesn't exist or can't be parsed\n */\nexport function readPackageJsonFile(filePath: string): PackageJson | undefined {\n  if (!existsSync(filePath)) {\n    return undefined;\n  }\n\n  try {\n    const content = readFileSync(filePath, 'utf8');\n    const packageJson = JSON.parse(content) as PackageJson;\n    return packageJson;\n  } catch (error) {\n    cdsExtractorLog('warn', `Error parsing package.json at ${filePath}: ${String(error)}`);\n    return undefined;\n  }\n}\n\n/**\n * Determines which CDS files should be compiled for a given project and what output files to expect.\n * This function analyzes the project structure and dependencies to decide\n * whether to use project-level compilation or individual file compilation.\n *\n * For CAP projects (identified by either having @sap/cds dependencies or\n * typical CAP directory structure), it returns a special marker indicating\n * project-level compilation should be used. For other projects, it attempts\n * to identify root files (files that are not imported by others) and returns\n * those for individual compilation.\n *\n * @param sourceRootDir - The source root directory\n * @param project - The project to analyze, containing cdsFiles, imports, and projectDir\n * @returns Object containing files to compile and expected output files\n */\nexport function determineCdsFilesToCompile(\n  sourceRootDir: string,\n  project: {\n    cdsFiles: string[];\n    imports?: Map<string, CdsImport[]>;\n    projectDir: string;\n  },\n): CdsFilesToCompile {\n  if (!project.cdsFiles || project.cdsFiles.length === 0) {\n    return {\n      compilationTargets: [],\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  const absoluteProjectDir = join(sourceRootDir, project.projectDir);\n\n  // Check for standard CAP directories\n  const capDirectories = ['db', 'srv', 'app'];\n  const existingCapDirs = capDirectories.filter(dir => existsSync(join(absoluteProjectDir, dir)));\n\n  if (existingCapDirs.length > 0) {\n    // Use standard CAP directories\n    return {\n      compilationTargets: existingCapDirs,\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  // Check for root-level CDS files\n  const rootCdsFiles = project.cdsFiles\n    .filter(file => dirname(join(sourceRootDir, file)) === absoluteProjectDir)\n    .map(file => basename(file));\n\n  if (rootCdsFiles.length > 0) {\n    // Use root-level files\n    return {\n      compilationTargets: rootCdsFiles,\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  // Use all CDS files with their relative paths\n  const compilationTargets = project.cdsFiles.map(file =>\n    relative(absoluteProjectDir, join(sourceRootDir, file)),\n  );\n\n  return {\n    compilationTargets,\n    expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n  };\n}\n\n/**\n * Checks if a directory has a package.json with CAP dependencies.\n * This function is used to determine if a directory has the necessary CAP packages installed,\n * which is one indicator that it might be a CAP project.\n *\n * @param dir - Directory to check for package.json with CAP dependencies\n * @returns true if the directory has a package.json with CAP dependencies\n */\nexport function hasPackageJsonWithCapDeps(dir: string): boolean {\n  try {\n    const packageJsonPath = join(dir, 'package.json');\n    const packageJson = readPackageJsonFile(packageJsonPath);\n\n    if (packageJson) {\n      const dependencies = {\n        ...(packageJson.dependencies ?? {}),\n        ...(packageJson.devDependencies ?? {}),\n      };\n\n      // Check for common CAP dependencies\n      return !!(dependencies['@sap/cds'] || dependencies['@sap/cds-dk']);\n    }\n\n    return false;\n  } catch {\n    return false;\n  }\n}\n", "import { spawnSync, SpawnSyncReturns } from 'child_process';\n\nimport type { CdsDependencyGraph } from './cds/parser';\nimport { addJavaScriptExtractorDiagnostic } from './diagnostics';\nimport { applyPathsIgnoreToLgtmFilters, configureLgtmIndexFilters } from './environment';\nimport { createMarkerFile, removeMarkerFile } from './filesystem';\nimport {\n  cdsExtractorLog,\n  logExtractorStop,\n  logPerformanceTrackingStart,\n  logPerformanceTrackingStop,\n} from './logging';\n\n/**\n * Run the JavaScript extractor autobuild script\n * @param sourceRoot The source root directory\n * @param autobuildScriptPath Path to the autobuild script\n * @param codeqlExePath Path to the CodeQL executable (optional)\n * @returns Success status and any error message\n */\nexport function runJavaScriptExtractor(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath?: string,\n): { success: boolean; error?: string } {\n  cdsExtractorLog(\n    'info',\n    `Extracting the .cds.json files by running the 'javascript' extractor autobuild script:\n        ${autobuildScriptPath}`,\n  );\n\n  /**\n   * Invoke the javascript autobuilder to index the .cds.json files only.\n   *\n   * Environment variables must be passed from this script's process to the\n   * process that invokes the autobuild script, otherwise the CDS autobuild.sh\n   * script will not be invoked by the autobuild script built into the\n   * 'javascript' extractor.\n   *\n   * IMPORTANT: The JavaScript extractor autobuild script must be invoked with\n   * the current working directory set to the project (source) root directory\n   * because it assumes it is running from there.\n   */\n  const result: SpawnSyncReturns<Buffer> = spawnSync(autobuildScriptPath, {\n    cwd: sourceRoot,\n    env: process.env,\n    shell: true,\n    stdio: 'inherit',\n  });\n\n  if (result.error) {\n    const errorMessage = `Error running JavaScript extractor: ${result.error.message}`;\n    if (codeqlExePath) {\n      addJavaScriptExtractorDiagnostic(sourceRoot, errorMessage, codeqlExePath, sourceRoot);\n    }\n    return {\n      success: false,\n      error: errorMessage,\n    };\n  }\n\n  if (result.status !== 0) {\n    const errorMessage = `JavaScript extractor failed with exit code ${String(result.status)}`;\n    if (codeqlExePath) {\n      addJavaScriptExtractorDiagnostic(sourceRoot, errorMessage, codeqlExePath, sourceRoot);\n    }\n    return {\n      success: false,\n      error: errorMessage,\n    };\n  }\n\n  return { success: true };\n}\n\n/**\n * Runs JavaScript extraction with marker file handling and optional dependency graph updates.\n * Encapsulates the common pattern used in multiple places throughout the extractor.\n *\n * @param sourceRoot - The root directory of the source code\n * @param autobuildScriptPath - Path to the autobuild script\n * @param codeqlExePath - Path to the CodeQL executable\n * @param dependencyGraph - Optional dependency graph to update with performance metrics\n * @returns True if extraction was successful, false otherwise\n */\nexport function runJavaScriptExtractionWithMarker(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath: string,\n  dependencyGraph?: CdsDependencyGraph,\n): boolean {\n  // Configure LGTM index filters\n  configureLgtmIndexFilters();\n\n  // Apply paths-ignore patterns from CodeQL config to LGTM_INDEX_FILTERS\n  applyPathsIgnoreToLgtmFilters(sourceRoot);\n\n  // Create marker file\n  const markerFilePath = createMarkerFile(sourceRoot);\n\n  try {\n    logPerformanceTrackingStart('JavaScript Extraction');\n    const extractionStartTime = Date.now();\n    const extractorResult = runJavaScriptExtractor(sourceRoot, autobuildScriptPath, codeqlExePath);\n    const extractionEndTime = Date.now();\n    logPerformanceTrackingStop('JavaScript Extraction');\n\n    // Update dependency graph metrics if provided\n    if (dependencyGraph) {\n      dependencyGraph.statusSummary.performance.extractionDurationMs =\n        extractionEndTime - extractionStartTime;\n      dependencyGraph.statusSummary.performance.totalDurationMs =\n        dependencyGraph.statusSummary.performance.parsingDurationMs +\n        dependencyGraph.statusSummary.performance.compilationDurationMs +\n        dependencyGraph.statusSummary.performance.extractionDurationMs;\n    }\n\n    // Handle extraction failure\n    if (!extractorResult.success && extractorResult.error) {\n      cdsExtractorLog('error', `Error running JavaScript extractor: ${extractorResult.error}`);\n\n      if (codeqlExePath) {\n        let representativeFile = sourceRoot;\n        if (dependencyGraph && dependencyGraph.projects.size > 0) {\n          const firstProject = Array.from(dependencyGraph.projects.values())[0];\n          representativeFile = firstProject.cdsFiles[0] ?? sourceRoot;\n        }\n        addJavaScriptExtractorDiagnostic(\n          representativeFile,\n          extractorResult.error,\n          codeqlExePath,\n          sourceRoot,\n        );\n      }\n      return false;\n    }\n\n    return true;\n  } finally {\n    // Always clean up marker file\n    removeMarkerFile(markerFilePath);\n  }\n}\n\n/**\n * Handles early exit scenarios by running JavaScript extraction and exiting gracefully.\n * This function never returns - it always exits the process with code 0.\n *\n * @param sourceRoot - The root directory of the source code\n * @param autobuildScriptPath - Path to the autobuild script\n * @param codeqlExePath - Path to the CodeQL executable\n * @param skipMessage - Message to log when exiting early\n */\nexport function handleEarlyExit(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath: string,\n  skipMessage: string,\n): never {\n  const success = runJavaScriptExtractionWithMarker(sourceRoot, autobuildScriptPath, codeqlExePath);\n  logExtractorStop(success, success ? skipMessage : 'JavaScript extractor failed');\n  console.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n  process.exit(0);\n}\n", "import { resolve } from 'path';\n\nconst USAGE_MESSAGE = `\\tUsage: node <script> <source-root>`;\n\n/**\n * Resolves and validates a source root directory path.\n *\n * This function takes a source root path, validates it, normalizes it,\n * and returns an absolute path to the directory.\n *\n * @param sourceRoot - The source root path to resolve\n * @returns The normalized absolute path to the source root directory\n * @throws {Error} If the source root is null, undefined, an empty string,\n *                 or does not point to a valid directory\n */\nfunction resolveSourceRoot(sourceRoot: string): string {\n  // Check for null, undefined, or empty string\n  if (!sourceRoot || typeof sourceRoot !== 'string') {\n    throw new Error('Source root must be a non-empty string');\n  }\n\n  // Normalize the path and resolve it to an absolute path.\n  const normalizedPath = resolve(sourceRoot);\n\n  // Check if the resolved path points to a valid, existing directory.\n  if (!normalizedPath || normalizedPath === '/') {\n    throw new Error('Source root must point to a valid directory');\n  }\n\n  return normalizedPath;\n}\n\n/**\n * Check if the script was invoked with the required arguments.\n * This function validates and sanitizes script arguments and returns them if valid.\n *\n * Requirements:\n * - Only requires: <source-root>\n *\n * @param args Command line arguments to check.\n * @returns Object with validation result, usage message if failed, and validated\n * arguments if successful.\n */\nexport function validateArguments(args: string[]): {\n  isValid: boolean;\n  usageMessage?: string;\n  args?: {\n    sourceRoot: string;\n  };\n} {\n  // Minimum arguments: node, script, source-root (3 total)\n  if (args.length < 3) {\n    return {\n      isValid: false,\n      usageMessage: USAGE_MESSAGE,\n    };\n  }\n\n  // Get the source root from args (now the first parameter after script name)\n  const rawSourceRoot: string = args[2];\n\n  // Validate and sanitize the source root path\n  let sourceRoot: string;\n  try {\n    sourceRoot = resolveSourceRoot(rawSourceRoot);\n  } catch (error) {\n    return {\n      isValid: false,\n      usageMessage: `Invalid source root: ${String(error)}`,\n    };\n  }\n\n  // Return the validated arguments\n  return {\n    isValid: true,\n    usageMessage: `<source-root>`,\n    args: {\n      sourceRoot,\n    },\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAAAA,gBAAqB;;;ASErB,sBAA8B;AED9B,uBAA6B;AAE7B,IAAAC,mBAA8B;AAE9B,gBAMO;AACP,SAA0B;AAM1B,sBAAmD;ACXnD,yBAA6B;AAC7B,yBAAmB;AACnB,iCAA8B;AXTvB,IAAMC,KAAW,CACtBC,IACAC,GACAC,MACE;AACF,MAAMC,IAAKH,cAAa,SAASI,GAAWJ,IAAGE,CAAG,IAAIF,IAChDK,IAAKJ,aAAa,SAASG,GAAWH,GAAGC,CAAG,IAAID,GAEhD,IAAIE,MAAO,QAAQE,KAAM,QAAQC,GAAMH,GAAIE,GAAIH,CAAG;AAExD,SACE,KAAK,EACH,OAAO,EAAE,CAAC,GACV,KAAK,EAAE,CAAC,GACR,KAAKA,EAAI,MAAM,GAAG,EAAE,CAAC,CAAC,GACtB,MAAMA,EAAI,MAAM,EAAE,CAAC,IAAIC,EAAG,QAAQ,EAAE,CAAC,CAAC,GACtC,MAAMD,EAAI,MAAM,EAAE,CAAC,IAAIG,EAAG,MAAM,EAAA;AAGtC;AAnBO,IAqBDD,KAAa,CAACG,IAAaL,MAAe;AAC9C,MAAMM,IAAIN,EAAI,MAAMK,EAAG;AACvB,SAAOC,IAAIA,EAAE,CAAC,IAAI;AACpB;AAxBO,IA0BMF,KAAQ,CACnBN,IACAC,GACAC,MACgC;AAChC,MAAIO,GACFC,GACAC,GACAC,GACAC,GACEC,IAAKZ,EAAI,QAAQF,EAAC,GAClBe,IAAKb,EAAI,QAAQD,GAAGa,IAAK,CAAC,GAC1BE,IAAIF;AAER,MAAIA,KAAM,KAAKC,IAAK,GAAG;AACrB,QAAIf,OAAMC,EACR,QAAO,CAACa,GAAIC,CAAE;AAKhB,SAHAN,IAAO,CAAA,GACPE,IAAOT,EAAI,QAEJc,KAAK,KAAK,CAACH,KAAQ;AACxB,UAAIG,MAAMF,EACRL,GAAK,KAAKO,CAAC,GACXF,IAAKZ,EAAI,QAAQF,IAAGgB,IAAI,CAAC;eAChBP,EAAK,WAAW,GAAG;AAC5B,YAAMQ,IAAIR,EAAK,IAAG;AACdQ,cAAM,WAAWJ,IAAS,CAACI,GAAGF,CAAE;MACtC,MACEL,KAAMD,EAAK,IAAG,GACVC,MAAQ,UAAaA,IAAMC,MAC7BA,IAAOD,GACPE,IAAQG,IAGVA,IAAKb,EAAI,QAAQD,GAAGe,IAAI,CAAC;AAG3BA,UAAIF,IAAKC,KAAMD,KAAM,IAAIA,IAAKC;IAChC;AAEIN,MAAK,UAAUG,MAAU,WAC3BC,IAAS,CAACF,GAAMC,CAAK;EAEzB;AAEA,SAAOC;AACT;ACvEA,IAAMK,KAAW,YAAY,KAAK,OAAM,IAAK;AAA7C,IACMC,KAAU,WAAW,KAAK,OAAM,IAAK;AAD3C,IAEMC,KAAW,YAAY,KAAK,OAAM,IAAK;AAF7C,IAGMC,KAAW,YAAY,KAAK,OAAM,IAAK;AAH7C,IAIMC,KAAY,aAAa,KAAK,OAAM,IAAK;AAJ/C,IAKMC,KAAkB,IAAI,OAAOL,IAAU,GAAG;AALhD,IAMMM,KAAiB,IAAI,OAAOL,IAAS,GAAG;AAN9C,IAOMM,KAAkB,IAAI,OAAOL,IAAU,GAAG;AAPhD,IAQMM,KAAkB,IAAI,OAAOL,IAAU,GAAG;AARhD,IASMM,KAAmB,IAAI,OAAOL,IAAW,GAAG;AATlD,IAUMM,KAAe;AAVrB,IAWMC,KAAc;AAXpB,IAYMC,KAAe;AAZrB,IAaMC,KAAe;AAbrB,IAcMC,KAAgB;AAdtB,IAgBaC,KAAgB;AAE7B,SAASC,GAAQhC,IAAW;AAC1B,SAAQ,MAAMA,EAAU,IAAwBA,GAAI,WAAW,CAAC,IAApC,SAASA,IAAK,EAAE;AAC9C;AAEA,SAASiC,GAAajC,IAAW;AAC/B,SAAOA,GACJ,QAAQ0B,IAAcV,EAAQ,EAC9B,QAAQW,IAAaV,EAAO,EAC5B,QAAQW,IAAcV,EAAQ,EAC9B,QAAQW,IAAcV,EAAQ,EAC9B,QAAQW,IAAeV,EAAS;AACrC;AAEA,SAASc,GAAelC,IAAW;AACjC,SAAOA,GACJ,QAAQqB,IAAiB,IAAI,EAC7B,QAAQC,IAAgB,GAAG,EAC3B,QAAQC,IAAiB,GAAG,EAC5B,QAAQC,IAAiB,GAAG,EAC5B,QAAQC,IAAkB,GAAG;AAClC;AAOA,SAASU,GAAgBnC,IAAW;AAClC,MAAI,CAACA,GACH,QAAO,CAAC,EAAE;AAGZ,MAAMoC,IAAkB,CAAA,GAClB9B,IAAIT,GAAS,KAAK,KAAKG,EAAG;AAEhC,MAAI,CAACM,EACH,QAAON,GAAI,MAAM,GAAG;AAGtB,MAAM,EAAE,KAAAqC,GAAK,MAAAC,GAAM,MAAAC,EAAI,IAAKjC,GACtBkC,IAAIH,EAAI,MAAM,GAAG;AAEvBG,IAAEA,EAAE,SAAS,CAAC,KAAK,MAAMF,IAAO;AAChC,MAAMG,IAAYN,GAAgBI,CAAI;AACtC,SAAIA,EAAK,WACLC,EAAEA,EAAE,SAAS,CAAC,KAAgBC,EAAU,MAAK,GAC/CD,EAAE,KAAK,MAAMA,GAAGC,CAAS,IAG3BL,EAAM,KAAK,MAAMA,GAAOI,CAAC,GAElBJ;AACT;AAMM,SAAUM,GAAO1C,IAAa2C,IAAiC,CAAA,GAAE;AACrE,MAAI,CAAC3C,GACH,QAAO,CAAA;AAGT,MAAM,EAAE,KAAA4C,IAAMb,GAAa,IAAKY;AAQhC,SAAI3C,GAAI,MAAM,GAAG,CAAC,MAAM,SACtBA,KAAM,WAAWA,GAAI,MAAM,CAAC,IAGvB6C,GAAQZ,GAAajC,EAAG,GAAG4C,GAAK,IAAI,EAAE,IAAIV,EAAc;AACjE;AAEA,SAASY,GAAQ9C,IAAW;AAC1B,SAAO,MAAMA,KAAM;AACrB;AAEA,SAAS+C,GAASC,IAAU;AAC1B,SAAO,SAAS,KAAKA,EAAE;AACzB;AAEA,SAASC,GAAInC,IAAWoC,GAAS;AAC/B,SAAOpC,MAAKoC;AACd;AAEA,SAASC,GAAIrC,IAAWoC,GAAS;AAC/B,SAAOpC,MAAKoC;AACd;AAEA,SAASL,GAAQ7C,IAAa4C,GAAaQ,GAAc;AAEvD,MAAMC,IAAuB,CAAA,GAEvB/C,IAAIT,GAAS,KAAK,KAAKG,EAAG;AAChC,MAAI,CAACM,EAAG,QAAO,CAACN,EAAG;AAGnB,MAAMqC,IAAM/B,EAAE,KACRiC,IAAiBjC,EAAE,KAAK,SAASuC,GAAQvC,EAAE,MAAMsC,GAAK,KAAK,IAAI,CAAC,EAAE;AAExE,MAAI,MAAM,KAAKtC,EAAE,GAAG,EAClB,UAASgD,IAAI,GAAGA,IAAIf,EAAK,UAAUe,IAAIV,GAAKU,KAAK;AAC/C,QAAMC,IAAYlB,IAAM,MAAM/B,EAAE,OAAO,MAAMiC,EAAKe,CAAC;AACnDD,MAAW,KAAKE,CAAS;EAC3B;OACK;AACL,QAAMC,IAAoB,iCAAiC,KAAKlD,EAAE,IAAI,GAChEmD,IAAkB,uCAAuC,KAC7DnD,EAAE,IAAI,GAEFoD,IAAaF,KAAqBC,GAClCE,IAAYrD,EAAE,KAAK,QAAQ,GAAG,KAAK;AACzC,QAAI,CAACoD,KAAc,CAACC,EAElB,QAAIrD,EAAE,KAAK,MAAM,YAAY,KAC3BN,KAAMM,EAAE,MAAM,MAAMA,EAAE,OAAOY,KAAWZ,EAAE,MACnCuC,GAAQ7C,IAAK4C,GAAK,IAAI,KAExB,CAAC5C,EAAG;AAGb,QAAI4D;AACJ,QAAIF,EACFE,KAAItD,EAAE,KAAK,MAAM,MAAM;aAEvBsD,IAAIzB,GAAgB7B,EAAE,IAAI,GACtBsD,EAAE,WAAW,KAAKA,EAAE,CAAC,MAAM,WAE7BA,IAAIf,GAAQe,EAAE,CAAC,GAAGhB,GAAK,KAAK,EAAE,IAAIE,EAAO,GAGrCc,EAAE,WAAW,GACf,QAAOrB,EAAK,IAAIC,OAAKlC,EAAE,MAAMsD,EAAE,CAAC,IAAIpB,CAAC;AAQ3C,QAAIqB;AAEJ,QAAIH,KAAcE,EAAE,CAAC,MAAM,UAAaA,EAAE,CAAC,MAAM,QAAW;AAC1D,UAAME,IAAI9B,GAAQ4B,EAAE,CAAC,CAAC,GAChBV,IAAIlB,GAAQ4B,EAAE,CAAC,CAAC,GAChBG,IAAQ,KAAK,IAAIH,EAAE,CAAC,EAAE,QAAQA,EAAE,CAAC,EAAE,MAAM,GAC3CI,IACFJ,EAAE,WAAW,KAAKA,EAAE,CAAC,MAAM,SAAY,KAAK,IAAI5B,GAAQ4B,EAAE,CAAC,CAAC,CAAC,IAAI,GAC/DK,IAAOhB;AACKC,UAAIY,MAElBE,KAAQ,IACRC,IAAOd;AAET,UAAMe,IAAMN,EAAE,KAAKb,EAAQ;AAE3Bc,UAAI,CAAA;AAEJ,eAAS/C,IAAIgD,GAAGG,EAAKnD,GAAGoC,CAAC,GAAGpC,KAAKkD,GAAM;AACrC,YAAIG;AACJ,YAAIV,EACFU,KAAI,OAAO,aAAarD,CAAC,GACrBqD,MAAM,SACRA,IAAI;iBAGNA,IAAI,OAAOrD,CAAC,GACRoD,GAAK;AACP,cAAME,IAAOL,IAAQI,EAAE;AACvB,cAAIC,IAAO,GAAG;AACZ,gBAAMC,IAAI,IAAI,MAAMD,IAAO,CAAC,EAAE,KAAK,GAAG;AAClCtD,gBAAI,IACNqD,IAAI,MAAME,IAAIF,EAAE,MAAM,CAAC,IAEvBA,IAAIE,IAAIF;UAEZ;QACF;AAEFN,UAAE,KAAKM,CAAC;MACV;IACF,OAAO;AACLN,UAAI,CAAA;AAEJ,eAASS,IAAI,GAAGA,IAAIV,EAAE,QAAQU,IAC5BT,GAAE,KAAK,MAAMA,GAAGhB,GAAQe,EAAEU,CAAC,GAAa1B,GAAK,KAAK,CAAC;IAEvD;AAEA,aAAS0B,IAAI,GAAGA,IAAIT,EAAE,QAAQS,IAC5B,UAAShB,IAAI,GAAGA,IAAIf,EAAK,UAAUc,EAAW,SAAST,GAAKU,KAAK;AAC/D,UAAMC,IAAYlB,IAAMwB,EAAES,CAAC,IAAI/B,EAAKe,CAAC;AAAA,OACjC,CAACF,KAASM,KAAcH,MAC1BF,EAAW,KAAKE,CAAS;IAE7B;EAEJ;AAEA,SAAOF;AACT;AChOO,IAAMkB,KACXC,CAAAA,OAC6B;AAC7B,MAAI,OAAOA,MAAY,SACrB,OAAM,IAAI,UAAU,iBAAiB;AAGvC,MAAIA,GAAQ,SAAS,MACnB,OAAM,IAAI,UAAU,qBAAqB;AAE7C;ACPA,IAAMC,KACJ,EACE,aAAa,CAAC,wBAAwB,IAAI,GAC1C,aAAa,CAAC,iBAAiB,IAAI,GACnC,aAAa,CAAC,eAAyB,KAAK,GAC5C,aAAa,CAAC,cAAc,IAAI,GAChC,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,gBAAgB,MAAM,IAAI,GACxC,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,UAAU,IAAI,GAC5B,aAAa,CAAC,UAAU,IAAI,GAC5B,aAAa,CAAC,yBAAyB,IAAI,GAC3C,aAAa,CAAC,WAAW,IAAI,GAC7B,YAAY,CAAC,+BAA+B,IAAI,GAChD,cAAc,CAAC,aAAa,KAAK,EAAA;AAfrC,IAoBMC,KAAeC,CAAAA,OAAcA,GAAE,QAAQ,aAAa,MAAM;AApBhE,IAsBMC,KAAgBD,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAvB9C,IA0BME,KAAkBC,CAAAA,OAA6BA,GAAO,KAAK,EAAE;AA1BnE,IAyCaC,KAAa,CACxBC,IACAC,MACoB;AACpB,MAAMC,IAAMD;AAEZ,MAAID,GAAK,OAAOE,CAAG,MAAM,IACvB,OAAM,IAAI,MAAM,2BAA2B;AAG7C,MAAMJ,IAAmB,CAAA,GACnBK,IAAiB,CAAA,GAEnBrE,IAAIoE,IAAM,GACVE,IAAW,OACXC,IAAQ,OACRC,IAAW,OACXC,IAAS,OACTC,IAASN,GACTO,IAAa;AACjBC,IAAO,QAAO5E,IAAIkE,GAAK,UAAQ;AAC7B,QAAMb,IAAIa,GAAK,OAAOlE,CAAC;AACvB,SAAKqD,MAAM,OAAOA,MAAM,QAAQrD,MAAMoE,IAAM,GAAG;AAC7CK,UAAS,MACTzE;AACA;IACF;AAEA,QAAIqD,MAAM,OAAOiB,KAAY,CAACE,GAAU;AACtCE,UAAS1E,IAAI;AACb;IACF;AAGA,QADAsE,IAAW,MACPjB,MAAM,QACJ,CAACmB,GAAU;AACbA,UAAW,MACXxE;AACA;IACF;AAGF,QAAIqD,MAAM,OAAO,CAACmB,GAAAA;AAEhB,eAAW,CAACK,GAAK,CAACC,GAAMC,GAAGC,CAAG,CAAC,KAAK,OAAO,QAAQrB,EAAY,EAC7D,KAAIO,GAAK,WAAWW,GAAK7E,CAAC,GAAG;AAE3B,YAAI2E,EACF,QAAO,CAAC,MAAM,OAAOT,GAAK,SAASE,GAAK,IAAI;AAE9CpE,aAAK6E,EAAI,QACLG,IAAKX,EAAK,KAAKS,CAAI,IAClBd,EAAO,KAAKc,CAAI,GACrBP,IAAQA,KAASQ;AACjB,iBAASH;MACX;IAAA;AAMJ,QADAJ,IAAW,OACPG,GAAY;AAGVtB,UAAIsB,IACNX,EAAO,KAAKJ,GAAYe,CAAU,IAAI,MAAMf,GAAYP,CAAC,CAAC,IACjDA,MAAMsB,KACfX,EAAO,KAAKJ,GAAYP,CAAC,CAAC,GAE5BsB,IAAa,IACb3E;AACA;IACF;AAIA,QAAIkE,GAAK,WAAW,MAAMlE,IAAI,CAAC,GAAG;AAChCgE,QAAO,KAAKJ,GAAYP,IAAI,GAAG,CAAC,GAChCrD,KAAK;AACL;IACF;AACA,QAAIkE,GAAK,WAAW,KAAKlE,IAAI,CAAC,GAAG;AAC/B2E,UAAatB,GACbrD,KAAK;AACL;IACF;AAGAgE,MAAO,KAAKJ,GAAYP,CAAC,CAAC,GAC1BrD;EACF;AAEA,MAAI0E,IAAS1E,EAGX,QAAO,CAAC,IAAI,OAAO,GAAG,KAAK;AAK7B,MAAI,CAACgE,EAAO,UAAU,CAACK,EAAK,OAC1B,QAAO,CAAC,MAAM,OAAOH,GAAK,SAASE,GAAK,IAAI;AAO9C,MACEC,EAAK,WAAW,KAChBL,EAAO,WAAW,KAClB,SAAS,KAAKA,EAAO,CAAC,CAAC,KACvB,CAACS,GACD;AACA,QAAMxE,IAAI+D,EAAO,CAAC,EAAE,WAAW,IAAIA,EAAO,CAAC,EAAE,MAAM,EAAE,IAAIA,EAAO,CAAC;AACjE,WAAO,CAACF,GAAa7D,CAAC,GAAG,OAAOyE,IAASN,GAAK,KAAK;EACrD;AAEA,MAAMa,IAAU,OAAOR,IAAS,MAAM,MAAMV,GAAeC,CAAM,IAAI,KAC/DkB,IAAQ,OAAOT,IAAS,KAAK,OAAOV,GAAeM,CAAI,IAAI;AAMjE,SAAO,CAJLL,EAAO,UAAUK,EAAK,SAAS,MAAMY,IAAU,MAAMC,IAAQ,MAC3DlB,EAAO,SAASiB,IAChBC,GAEUX,GAAOG,IAASN,GAAK,IAAI;AACzC;ACrJO,IAAMe,IAAW,CACtBtB,IACA,EACE,sBAAAuB,IAAuB,OACvB,eAAAC,IAAgB,KAAI,IACgD,CAAA,MAElEA,IACKD,IACHvB,GAAE,QAAQ,kBAAkB,IAAI,IAChCA,GACG,QAAQ,6BAA6B,MAAM,EAC3C,QAAQ,cAAc,IAAI,IAE5BuB,IACHvB,GAAE,QAAQ,oBAAoB,IAAI,IAClCA,GACG,QAAQ,+BAA+B,MAAM,EAC7C,QAAQ,gBAAgB,IAAI;ACIrC,IAAMyB,KAAQ,oBAAI,IAAiB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AAA5D,IACMC,KAAiBlC,CAAAA,OACrBiC,GAAM,IAAIjC,EAAgB;AAF5B,IAQMmC,KAAmB;AARzB,IASMC,KAAa;AATnB,IAcMC,KAAkB,oBAAI,IAAI,CAAC,KAAK,GAAG,CAAC;AAd1C,IAgBMC,KAAW,oBAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AAhBpC,IAiBMC,KAAa,IAAI,IAAI,iBAAiB;AAjB5C,IAkBMC,KAAgBhC,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAnB9C,IAsBMiC,KAAQ;AAtBd,IAyBMC,KAAOD,KAAQ;AAzBrB,IA4BME,KAAcF,KAAQ;AA5B5B,IAiCaG,IAAP,MAAOC,EAAG;EACd;EACSC;EAETC;EACAC,KAAkB;EAClBC,KAA2B,CAAA;EAClBC;EACAC;EACTC;EACAC,KAAuB;EACvBC;EACAC;EAGAC,KAAqB;EAErB,YACEC,GACAC,GACAlF,IAA4B,CAAA,GAAE;AAE9B,SAAK,OAAOiF,GAERA,MAAM,KAAKV,KAAY,OAC3B,KAAKG,KAAUQ,GACf,KAAKZ,KAAQ,KAAKI,KAAU,KAAKA,GAAQJ,KAAQ,MACjD,KAAKQ,KAAW,KAAKR,OAAU,OAAOtE,IAAU,KAAKsE,GAAMQ,IAC3D,KAAKF,KAAQ,KAAKN,OAAU,OAAO,CAAA,IAAK,KAAKA,GAAMM,IAC/CK,MAAS,OAAO,CAAC,KAAKX,GAAMO,MAAa,KAAKD,GAAM,KAAK,IAAI,GACjE,KAAKD,KAAe,KAAKD,KAAU,KAAKA,GAAQD,GAAO,SAAS;EAClE;EAEA,IAAI,WAAQ;AAEV,QAAI,KAAKF,OAAc,OAAW,QAAO,KAAKA;AAE9C,aAAW1E,KAAK,KAAK4E,GACnB,KAAI,OAAO5E,KAAM,aACbA,EAAE,QAAQA,EAAE,UAAU,QAAQ,KAAK0E,KAAY;AAGrD,WAAO,KAAKA;EACd;EAGA,WAAQ;AACN,WAAI,KAAKQ,OAAc,SAAkB,KAAKA,KACzC,KAAK,OAGA,KAAKA,KACX,KAAK,OAAO,MAAM,KAAKN,GAAO,IAAI5E,OAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,MAHxD,KAAKkF,KAAY,KAAKN,GAAO,IAAI5E,OAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,EAAE;EAKpE;EAEAsF,KAAS;AAEP,QAAI,SAAS,KAAKb,GAAO,OAAM,IAAI,MAAM,0BAA0B;AACnE,QAAI,KAAKO,GAAa,QAAO;AAI7B,SAAK,SAAQ,GACb,KAAKA,KAAc;AACnB,QAAI5D;AACJ,WAAQA,IAAI,KAAK2D,GAAM,IAAG,KAAK;AAC7B,UAAI3D,EAAE,SAAS,IAAK;AAEpB,UAAIpB,IAAqBoB,GACrBmE,IAAKvF,EAAE6E;AACX,aAAOU,KAAI;AACT,iBACM,IAAIvF,EAAE8E,KAAe,GACzB,CAACS,EAAG,QAAQ,IAAIA,EAAGX,GAAO,QAC1B,IAEA,UAAWY,KAAQpE,EAAEwD,IAAQ;AAE3B,cAAI,OAAOY,KAAS,SAClB,OAAM,IAAI,MAAM,8BAA8B;AAGhDA,YAAK,OAAOD,EAAGX,GAAO,CAAC,CAAC;QAC1B;AAEF5E,YAAIuF,GACJA,IAAKvF,EAAE6E;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAQjF,GAAuB;AAC7B,aAAWI,KAAKJ,EACd,KAAII,MAAM,IAEV;AAAA,UACE,OAAOA,KAAM,YACb,EAAEA,aAAawE,KAAOxE,EAAE6E,OAAY,MAEpC,OAAM,IAAI,MAAM,mBAAmB7E,CAAC;AAGtC,WAAK4E,GAAO,KAAK5E,CAAC;IAAA;EAEtB;EAEA,SAAM;AACJ,QAAMyF,IACJ,KAAK,SAAS,OACZ,KAAKb,GACF,MAAK,EACL,IAAI5E,OAAM,OAAOA,KAAM,WAAWA,IAAIA,EAAE,OAAM,CAAG,IACpD,CAAC,KAAK,MAAM,GAAG,KAAK4E,GAAO,IAAI5E,OAAMA,EAAU,OAAM,CAAE,CAAC;AAC5D,WAAI,KAAK,QAAO,KAAM,CAAC,KAAK,QAAMyF,EAAI,QAAQ,CAAA,CAAE,GAE9C,KAAK,MAAK,MACT,SAAS,KAAKhB,MACZ,KAAKA,GAAMO,MAAe,KAAKH,IAAS,SAAS,QAEpDY,EAAI,KAAK,CAAA,CAAE,GAENA;EACT;EAEA,UAAO;AACL,QAAI,KAAKhB,OAAU,KAAM,QAAO;AAEhC,QAAI,CAAC,KAAKI,IAAS,QAAO,EAAI,QAAO;AACrC,QAAI,KAAKC,OAAiB,EAAG,QAAO;AAEpC,QAAM9E,IAAI,KAAK6E;AACf,aAASvG,IAAI,GAAGA,IAAI,KAAKwG,IAAcxG,KAAK;AAC1C,UAAMiH,IAAKvF,EAAE4E,GAAOtG,CAAC;AACrB,UAAI,EAAEiH,aAAcf,KAAOe,EAAG,SAAS,KACrC,QAAO;IAEX;AACA,WAAO;EACT;EAEA,QAAK;AAEH,QADI,KAAKd,OAAU,QACf,KAAKI,IAAS,SAAS,IAAK,QAAO;AACvC,QAAI,CAAC,KAAKA,IAAS,MAAK,EAAI,QAAO;AACnC,QAAI,CAAC,KAAK,KAAM,QAAO,KAAKA,IAAS,MAAK;AAG1C,QAAMa,IAAK,KAAKb,KAAU,KAAKA,GAAQD,GAAO,SAAS;AAEvD,WAAO,KAAKE,OAAiBY,IAAK;EACpC;EAEA,OAAOF,GAAkB;AACnB,WAAOA,KAAS,WAAU,KAAK,KAAKA,CAAI,IACvC,KAAK,KAAKA,EAAK,MAAM,IAAI,CAAC;EACjC;EAEA,MAAMH,GAAW;AACf,QAAM1D,IAAI,IAAI6C,EAAI,KAAK,MAAMa,CAAM;AACnC,aAAWrF,KAAK,KAAK4E,GACnBjD,GAAE,OAAO3B,CAAC;AAEZ,WAAO2B;EACT;EAEA,OAAOgE,GACLnI,GACAoI,GACAlD,GACAmD,GAAqB;AAErB,QAAI/C,IAAW,OACXgD,IAAU,OACVC,IAAa,IACbC,IAAW;AACf,QAAIJ,EAAI,SAAS,MAAM;AAErB,UAAItH,IAAIoE,GACJuD,IAAM;AACV,aAAO3H,IAAId,EAAI,UAAQ;AACrB,YAAMmE,IAAInE,EAAI,OAAOc,GAAG;AAGxB,YAAIwE,KAAYnB,MAAM,MAAM;AAC1BmB,cAAW,CAACA,GACZmD,KAAOtE;AACP;QACF;AAEA,YAAImE,GAAS;AACPxH,gBAAMyH,IAAa,KACjBpE,MAAM,OAAOA,MAAM,SACrBqE,IAAW,QAEJrE,MAAM,OAAO,EAAErD,MAAMyH,IAAa,KAAKC,OAChDF,IAAU,QAEZG,KAAOtE;AACP;QACF,WAAWA,MAAM,KAAK;AACpBmE,cAAU,MACVC,IAAazH,GACb0H,IAAW,OACXC,KAAOtE;AACP;QACF;AAEA,YAAI,CAACkE,EAAI,SAAShC,GAAclC,CAAC,KAAKnE,EAAI,OAAOc,CAAC,MAAM,KAAK;AAC3DsH,YAAI,KAAKK,CAAG,GACZA,IAAM;AACN,cAAMC,IAAM,IAAI1B,EAAI7C,GAAGiE,CAAG;AAC1BtH,cAAIkG,EAAImB,GAAUnI,GAAK0I,GAAK5H,GAAGuH,CAAG,GAClCD,EAAI,KAAKM,CAAG;AACZ;QACF;AACAD,aAAOtE;MACT;AACA,aAAAiE,EAAI,KAAKK,CAAG,GACL3H;IACT;AAIA,QAAIA,IAAIoE,IAAM,GACV8C,IAAO,IAAIhB,EAAI,MAAMoB,CAAG,GACtBhG,IAAe,CAAA,GACjBqG,IAAM;AACV,WAAO3H,IAAId,EAAI,UAAQ;AACrB,UAAMmE,IAAInE,EAAI,OAAOc,GAAG;AAGxB,UAAIwE,KAAYnB,MAAM,MAAM;AAC1BmB,YAAW,CAACA,GACZmD,KAAOtE;AACP;MACF;AAEA,UAAImE,GAAS;AACPxH,cAAMyH,IAAa,KACjBpE,MAAM,OAAOA,MAAM,SACrBqE,IAAW,QAEJrE,MAAM,OAAO,EAAErD,MAAMyH,IAAa,KAAKC,OAChDF,IAAU,QAEZG,KAAOtE;AACP;MACF,WAAWA,MAAM,KAAK;AACpBmE,YAAU,MACVC,IAAazH,GACb0H,IAAW,OACXC,KAAOtE;AACP;MACF;AAEA,UAAIkC,GAAclC,CAAC,KAAKnE,EAAI,OAAOc,CAAC,MAAM,KAAK;AAC7CkH,UAAK,KAAKS,CAAG,GACbA,IAAM;AACN,YAAMC,IAAM,IAAI1B,EAAI7C,GAAG6D,CAAI;AAC3BA,UAAK,KAAKU,CAAG,GACb5H,IAAIkG,EAAImB,GAAUnI,GAAK0I,GAAK5H,GAAGuH,CAAG;AAClC;MACF;AACA,UAAIlE,MAAM,KAAK;AACb6D,UAAK,KAAKS,CAAG,GACbA,IAAM,IACNrG,EAAM,KAAK4F,CAAI,GACfA,IAAO,IAAIhB,EAAI,MAAMoB,CAAG;AACxB;MACF;AACA,UAAIjE,MAAM,IACR,QAAIsE,MAAQ,MAAML,EAAIhB,GAAO,WAAW,MACtCgB,EAAIT,KAAY,OAElBK,EAAK,KAAKS,CAAG,GACbA,IAAM,IACNL,EAAI,KAAK,GAAGhG,GAAO4F,CAAI,GAChBlH;AAET2H,WAAOtE;IACT;AAKA,WAAAiE,EAAI,OAAO,MACXA,EAAIlB,KAAY,QAChBkB,EAAIhB,KAAS,CAACpH,EAAI,UAAUkF,IAAM,CAAC,CAAC,GAC7BpE;EACT;EAEA,OAAO,SAAS0D,GAAiB7B,IAA4B,CAAA,GAAE;AAC7D,QAAMyF,IAAM,IAAIpB,EAAI,MAAM,QAAWrE,CAAO;AAC5C,WAAAqE,EAAImB,GAAU3D,GAAS4D,GAAK,GAAGzF,CAAO,GAC/ByF;EACT;EAIA,cAAW;AAGT,QAAI,SAAS,KAAKnB,GAAO,QAAO,KAAKA,GAAM,YAAW;AAEtD,QAAMjC,IAAO,KAAK,SAAQ,GACpB,CAAC2D,GAAIrG,GAAMsG,GAAUvD,CAAK,IAAI,KAAK,eAAc;AAUvD,QAAI,EALFuD,KACA,KAAK1B,MACJ,KAAKO,GAAS,UACb,CAAC,KAAKA,GAAS,mBACfzC,EAAK,YAAW,MAAOA,EAAK,YAAW,GAEzC,QAAO1C;AAGT,QAAMuG,KAAS,KAAKpB,GAAS,SAAS,MAAM,OAAOpC,IAAQ,MAAM;AACjE,WAAO,OAAO,OAAO,IAAI,OAAO,IAAIsD,CAAE,KAAKE,CAAK,GAAG,EACjD,MAAMF,GACN,OAAO3D,EAAAA,CACR;EACH;EAEA,IAAI,UAAO;AACT,WAAO,KAAKyC;EACd;EAuEA,eACEqB,GAAkB;AAElB,QAAMC,IAAMD,KAAY,CAAC,CAAC,KAAKrB,GAAS;AAExC,QADI,KAAKR,OAAU,QAAM,KAAKa,GAAS,GACnC,CAAC,KAAK,MAAM;AACd,UAAMkB,IACJ,KAAK,QAAO,KACZ,KAAK,MAAK,KACV,CAAC,KAAK5B,GAAO,KAAKzC,OAAK,OAAOA,KAAM,QAAQ,GACxCsE,IAAM,KAAK7B,GACd,IAAI5E,OAAI;AACP,YAAM,CAACmG,GAAIO,GAAGN,GAAUvD,CAAK,IAC3B,OAAO7C,KAAM,WACXwE,EAAImC,GAAW3G,GAAG,KAAK0E,IAAW8B,CAAO,IACzCxG,EAAE,eAAesG,CAAQ;AAC7B,eAAA,KAAK5B,KAAY,KAAKA,MAAa0B,GACnC,KAAKzB,KAAS,KAAKA,MAAU9B,GACtBsD;MACT,CAAC,EACA,KAAK,EAAE,GAENS,IAAQ;AACZ,UAAI,KAAK,QAAO,KACV,OAAO,KAAKhC,GAAO,CAAC,KAAM,YAQxB,EADF,KAAKA,GAAO,WAAW,KAAKX,GAAS,IAAI,KAAKW,GAAO,CAAC,CAAC,IACpC;AACnB,YAAMiC,IAAM7C,IAGN8C,IAEHP,KAAOM,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,KAE5BA,EAAI,WAAW,KAAK,KAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,KAE9CA,EAAI,WAAW,QAAQ,KAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAG9CM,IAAY,CAACR,KAAO,CAACD,KAAYO,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC;AAE5DG,YACEE,IAAahD,KACXiD,IAAYhD,KACZ;MACN;AAKJ,UAAIiD,IAAM;AACV,aACE,KAAK,MAAK,KACV,KAAKvC,GAAMO,MACX,KAAKH,IAAS,SAAS,QAEvBmC,IAAM,cAGD,CADOJ,IAAQH,IAAMO,GAG1BvD,EAASgD,CAAG,GACX,KAAK/B,KAAY,CAAC,CAAC,KAAKA,IACzB,KAAKC,EAAAA;IAET;AAMA,QAAMsC,IAAW,KAAK,SAAS,OAAO,KAAK,SAAS,KAE9CL,IAAQ,KAAK,SAAS,MAAM,cAAc,OAC5C9G,IAAO,KAAKoH,GAAeX,CAAG;AAElC,QAAI,KAAK,QAAO,KAAM,KAAK,MAAK,KAAM,CAACzG,KAAQ,KAAK,SAAS,KAAK;AAGhE,UAAMqC,IAAI,KAAK,SAAQ;AACvB,aAAA,KAAKyC,KAAS,CAACzC,CAAC,GAChB,KAAK,OAAO,MACZ,KAAKuC,KAAY,QACV,CAACvC,GAAGsB,EAAS,KAAK,SAAQ,CAAE,GAAG,OAAO,KAAK;IACpD;AAGA,QAAI0D,IACF,CAACF,KAAYX,KAAYC,KAAO,CAACxC,KAC/B,KACA,KAAKmD,GAAe,IAAI;AACxBC,UAAmBrH,MACrBqH,IAAiB,KAEfA,MACFrH,IAAO,MAAMA,CAAI,OAAOqH,CAAc;AAIxC,QAAIC,IAAQ;AACZ,QAAI,KAAK,SAAS,OAAO,KAAKjC,GAC5BiC,MAAS,KAAK,QAAO,KAAM,CAACb,IAAMxC,KAAa,MAAMO;SAChD;AACL,UAAM+C,IACJ,KAAK,SAAS,MAEZ,QACC,KAAK,QAAO,KAAM,CAACd,KAAO,CAACD,IAAWvC,KAAa,MACpDM,KACA,MACA,KAAK,SAAS,MAAM,MACpB,KAAK,SAAS,MAAM,OACpB,KAAK,SAAS,OAAO8C,IAAiB,MACtC,KAAK,SAAS,OAAOA,IAAiB,OACtC,IAAI,KAAK,IAAI;AACjBC,UAAQR,IAAQ9G,IAAOuH;IACzB;AACA,WAAO,CACLD,GACA3D,EAAS3D,CAAI,GACZ,KAAK4E,KAAY,CAAC,CAAC,KAAKA,IACzB,KAAKC,EAAAA;EAET;EAEAuC,GAAeX,GAAY;AACzB,WAAO,KAAK3B,GACT,IAAI5E,OAAI;AAGP,UAAI,OAAOA,KAAM,SACf,OAAM,IAAI,MAAM,8BAA8B;AAIhD,UAAM,CAACmG,GAAIO,GAAGY,GAAWzE,CAAK,IAAI7C,EAAE,eAAeuG,CAAG;AACtD,aAAA,KAAK5B,KAAS,KAAKA,MAAU9B,GACtBsD;IACT,CAAC,EACA,OAAOnG,OAAK,EAAE,KAAK,QAAO,KAAM,KAAK,MAAK,MAAO,CAAC,CAACA,CAAC,EACpD,KAAK,GAAG;EACb;EAEA,OAAO2G,GACLnE,GACA4D,GACAI,IAAmB,OAAK;AAExB,QAAI1D,IAAW,OACXqD,IAAK,IACLtD,IAAQ,OAER0E,IAAS;AACb,aAASjJ,IAAI,GAAGA,IAAIkE,EAAK,QAAQlE,KAAK;AACpC,UAAMqD,IAAIa,EAAK,OAAOlE,CAAC;AACvB,UAAIwE,GAAU;AACZA,YAAW,OACXqD,MAAOjC,GAAW,IAAIvC,CAAC,IAAI,OAAO,MAAMA;AACxC;MACF;AACA,UAAIA,MAAM,KAAK;AACb,YAAI4F,EAAQ;AACZA,YAAS,MACTpB,KAAMK,KAAW,SAAS,KAAKhE,CAAI,IAAI8B,KAAcD,IACrD+B,IAAW;AACX;MACF,MACEmB,KAAS;AAEX,UAAI5F,MAAM,MAAM;AACVrD,cAAMkE,EAAK,SAAS,IACtB2D,KAAM,SAENrD,IAAW;AAEb;MACF;AACA,UAAInB,MAAM,KAAK;AACb,YAAM,CAAC8E,GAAKe,GAAWC,GAAUC,CAAK,IAAInF,GAAWC,GAAMlE,CAAC;AAC5D,YAAImJ,GAAU;AACZtB,eAAMM,GACN5D,IAAQA,KAAS2E,GACjBlJ,KAAKmJ,IAAW,GAChBrB,IAAWA,KAAYsB;AACvB;QACF;MACF;AACA,UAAI/F,MAAM,KAAK;AACbwE,aAAM/B,IACNgC,IAAW;AACX;MACF;AACAD,WAAMhC,GAAaxC,CAAC;IACtB;AACA,WAAO,CAACwE,GAAI1C,EAASjB,CAAI,GAAG,CAAC,CAAC4D,GAAUvD,CAAK;EAC/C;AAAA;ACzpBK,IAAM8E,KAAS,CACpBxF,IACA,EACE,sBAAAuB,IAAuB,OACvB,eAAAC,IAAgB,MAAK,IAC+C,CAAA,MAKlEA,IACKD,IACHvB,GAAE,QAAQ,gBAAgB,MAAM,IAChCA,GAAE,QAAQ,kBAAkB,MAAM,IAEjCuB,IACHvB,GAAE,QAAQ,cAAc,MAAM,IAC9BA,GAAE,QAAQ,gBAAgB,MAAM;AC6D/B,IAAMyF,IAAY,CACvB5H,IACAgC,GACA7B,IAA4B,CAAA,OAE5B4B,GAAmBC,CAAO,GAGtB,CAAC7B,EAAQ,aAAa6B,EAAQ,OAAO,CAAC,MAAM,MACvC,QAGF,IAAI6F,EAAU7F,GAAS7B,CAAO,EAAE,MAAMH,EAAC;AAZzC,IAgBD8H,KAAe;AAhBd,IAiBDC,KAAkB7B,CAAAA,OAAiB8B,OACvC,CAACA,EAAE,WAAW,GAAG,KAAKA,EAAE,SAAS9B,EAAG;AAlB/B,IAmBD+B,KAAqB/B,CAAAA,OAAiB8B,OAAcA,EAAE,SAAS9B,EAAG;AAnBjE,IAoBDgC,KAAwBhC,CAAAA,QAC5BA,KAAMA,GAAI,YAAW,GACb8B,OAAc,CAACA,EAAE,WAAW,GAAG,KAAKA,EAAE,YAAW,EAAG,SAAS9B,EAAG;AAtBnE,IAwBDiC,KAA2BjC,CAAAA,QAC/BA,KAAMA,GAAI,YAAW,GACb8B,OAAcA,EAAE,YAAW,EAAG,SAAS9B,EAAG;AA1B7C,IA4BDkC,KAAgB;AA5Bf,IA6BDC,KAAmBL,CAAAA,OACvB,CAACA,GAAE,WAAW,GAAG,KAAKA,GAAE,SAAS,GAAG;AA9B/B,IA+BDM,KAAsBN,CAAAA,OAC1BA,OAAM,OAAOA,OAAM,QAAQA,GAAE,SAAS,GAAG;AAhCpC,IAiCDO,KAAY;AAjCX,IAkCDC,KAAeR,CAAAA,OACnBA,OAAM,OAAOA,OAAM,QAAQA,GAAE,WAAW,GAAG;AAnCtC,IAoCDS,KAAS;AApCR,IAqCDC,KAAYV,CAAAA,OAAcA,GAAE,WAAW,KAAK,CAACA,GAAE,WAAW,GAAG;AArC5D,IAsCDW,KAAeX,CAAAA,OACnBA,GAAE,WAAW,KAAKA,OAAM,OAAOA,OAAM;AAvChC,IAwCDY,KAAW;AAxCV,IAyCDC,KAAmB,CAAC,CAACC,IAAI5C,IAAM,EAAE,MAAuB;AAC5D,MAAM6C,IAAQC,GAAgB,CAACF,EAAE,CAAC;AAClC,SAAK5C,KACLA,IAAMA,EAAI,YAAW,GACb8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,KAF7C6C;AAGnB;AA9CO,IA+CDE,KAAsB,CAAC,CAACH,IAAI5C,IAAM,EAAE,MAAuB;AAC/D,MAAM6C,IAAQG,GAAmB,CAACJ,EAAE,CAAC;AACrC,SAAK5C,KACLA,IAAMA,EAAI,YAAW,GACb8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,KAF7C6C;AAGnB;AApDO,IAqDDI,KAAgB,CAAC,CAACL,IAAI5C,IAAM,EAAE,MAAuB;AACzD,MAAM6C,IAAQG,GAAmB,CAACJ,EAAE,CAAC;AACrC,SAAQ5C,IAAe8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,SAAS9B,CAAG,IAAjD6C;AAChB;AAxDO,IAyDDK,KAAa,CAAC,CAACN,IAAI5C,IAAM,EAAE,MAAuB;AACtD,MAAM6C,IAAQC,GAAgB,CAACF,EAAE,CAAC;AAClC,SAAQ5C,IAAe8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,SAAS9B,CAAG,IAAjD6C;AAChB;AA5DO,IA6DDC,KAAkB,CAAC,CAACF,EAAE,MAAuB;AACjD,MAAMO,IAAMP,GAAG;AACf,SAAQd,OAAcA,EAAE,WAAWqB,KAAO,CAACrB,EAAE,WAAW,GAAG;AAC7D;AAhEO,IAiEDkB,KAAqB,CAAC,CAACJ,EAAE,MAAuB;AACpD,MAAMO,IAAMP,GAAG;AACf,SAAQd,OAAcA,EAAE,WAAWqB,KAAOrB,MAAM,OAAOA,MAAM;AAC/D;AApEO,IAuEDsB,KACJ,OAAO,WAAY,YAAY,UAC5B,OAAO,QAAQ,OAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACd,QAAQ,WACR;AA7EG,IAiFDC,KAAsC,EAC1C,OAAO,EAAE,KAAK,KAAI,GAClB,OAAO,EAAE,KAAK,IAAG,EAAA;AAnFZ,IAuFMC,KACXF,OAAoB,UAAUC,GAAK,MAAM,MAAMA,GAAK,MAAM;AAC5D3B,EAAU,MAAM4B;AAET,IAAMC,IAAW,uBAAO,aAAa;AAC5C7B,EAAU,WAAW6B;AAIrB,IAAMrF,KAAQ;AAAd,IAGMC,KAAOD,KAAQ;AAHrB,IAQMsF,KAAa;AARnB,IAYMC,KAAe;AAZrB,IAcaC,KACX,CAAC5H,IAAiB7B,IAA4B,CAAA,MAC7CH,OACC4H,EAAU5H,GAAGgC,IAAS7B,CAAO;AACjCyH,EAAU,SAASgC;AAEnB,IAAM1D,IAAM,CAAC5I,IAAqBC,IAAsB,CAAA,MACtD,OAAO,OAAO,CAAA,GAAID,IAAGC,CAAC;AADxB,IAGasM,KAAYC,CAAAA,OAA2C;AAClE,MAAI,CAACA,MAAO,OAAOA,MAAQ,YAAY,CAAC,OAAO,KAAKA,EAAG,EAAE,OACvD,QAAOlC;AAGT,MAAMmC,IAAOnC;AAKb,SAAO,OAAO,OAHJ,CAAC5H,GAAWgC,GAAiB7B,IAA4B,CAAA,MACjE4J,EAAK/J,GAAGgC,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAEZ,EACtB,WAAW,cAAwB4J,EAAK,UAAS;IAC/C,YAAY/H,GAAiB7B,IAA4B,CAAA,GAAE;AACzD,YAAM6B,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC;IAClC;IACA,OAAO,SAASA,GAAyB;AACvC,aAAO4J,EAAK,SAAS7D,EAAI4D,IAAK3J,CAAO,CAAC,EAAE;IAC1C;EAAA,GAGF,KAAK,cAAkB4J,EAAK,IAAG;IAE7B,YACE3E,GACAC,GACAlF,IAA4B,CAAA,GAAE;AAE9B,YAAMiF,GAAMC,GAAQa,EAAI4D,IAAK3J,CAAO,CAAC;IACvC;IAGA,OAAO,SAAS6B,GAAiB7B,IAA4B,CAAA,GAAE;AAC7D,aAAO4J,EAAK,IAAI,SAAS/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC;IACrD;EAAA,GAGF,UAAU,CACR,GACAA,IAGI,CAAA,MACD4J,EAAK,SAAS,GAAG7D,EAAI4D,IAAK3J,CAAO,CAAC,GAEvC,QAAQ,CACN,GACAA,IAGI,CAAA,MACD4J,EAAK,OAAO,GAAG7D,EAAI4D,IAAK3J,CAAO,CAAC,GAErC,QAAQ,CAAC6B,GAAiB7B,IAA4B,CAAA,MACpD4J,EAAK,OAAO/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAExC,UAAWA,OACT4J,EAAK,SAAS7D,EAAI4D,IAAK3J,CAAO,CAAC,GAEjC,QAAQ,CAAC6B,GAAiB7B,IAA4B,CAAA,MACpD4J,EAAK,OAAO/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAExC,aAAa,CAAC6B,GAAiB7B,IAA4B,CAAA,MACzD4J,EAAK,YAAY/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAE7C,OAAO,CACL6J,GACAhI,GACA7B,IAA4B,CAAA,MACzB4J,EAAK,MAAMC,GAAMhI,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAEhD,KAAK4J,EAAK,KACV,UAAUN,EAAAA,CACX;AACH;AACA7B,EAAU,WAAWiC;AAYd,IAAMI,KAAc,CACzBjI,IACA7B,IAA4B,CAAA,OAE5B4B,GAAmBC,EAAO,GAItB7B,EAAQ,WAAW,CAAC,mBAAmB,KAAK6B,EAAO,IAE9C,CAACA,EAAO,IAGV9B,GAAO8B,IAAS,EAAE,KAAK7B,EAAQ,eAAc,CAAE;AAExDyH,EAAU,cAAcqC;AAcjB,IAAMC,KAAS,CAAClI,IAAiB7B,IAA4B,CAAA,MAClE,IAAI0H,EAAU7F,IAAS7B,CAAO,EAAE,OAAM;AACxCyH,EAAU,SAASsC;AAEZ,IAAMC,KAAQ,CACnBH,IACAhI,GACA7B,IAA4B,CAAA,MAC1B;AACF,MAAMiK,IAAK,IAAIvC,EAAU7F,GAAS7B,CAAO;AACzC,SAAA6J,KAAOA,GAAK,OAAOhC,OAAKoC,EAAG,MAAMpC,CAAC,CAAC,GAC/BoC,EAAG,QAAQ,UAAU,CAACJ,GAAK,UAC7BA,GAAK,KAAKhI,CAAO,GAEZgI;AACT;AACApC,EAAU,QAAQuC;AAGlB,IAAME,KAAY;AAAlB,IACMlG,KAAgBhC,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAF9C,IAYa0F,IAAP,MAAgB;EACpB;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EAEA;EACA,YAAY7F,GAAiB7B,IAA4B,CAAA,GAAE;AACzD4B,OAAmBC,CAAO,GAE1B7B,IAAUA,KAAW,CAAA,GACrB,KAAK,UAAUA,GACf,KAAK,UAAU6B,GACf,KAAK,WAAW7B,EAAQ,YAAYmJ,IACpC,KAAK,YAAY,KAAK,aAAa;AAEnC,QAAMgB,IAAO;AACb,SAAK,uBACH,CAAC,CAACnK,EAAQ,wBAAwBA,EAAQmK,CAAG,MAAM,OACjD,KAAK,yBACP,KAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG,IAEhD,KAAK,0BAA0B,CAAC,CAACnK,EAAQ,yBACzC,KAAK,SAAS,MACd,KAAK,SAAS,OACd,KAAK,WAAW,CAAC,CAACA,EAAQ,UAC1B,KAAK,UAAU,OACf,KAAK,QAAQ,OACb,KAAK,UAAU,CAAC,CAACA,EAAQ,SACzB,KAAK,SAAS,CAAC,CAAC,KAAK,QAAQ,QAC7B,KAAK,qBACHA,EAAQ,uBAAuB,SAC7BA,EAAQ,qBACR,CAAC,EAAE,KAAK,aAAa,KAAK,SAE9B,KAAK,UAAU,CAAA,GACf,KAAK,YAAY,CAAA,GACjB,KAAK,MAAM,CAAA,GAGX,KAAK,KAAI;EACX;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,EAClD,QAAO;AAET,aAAW6B,KAAW,KAAK,IACzB,UAAWwD,KAAQxD,EACjB,KAAI,OAAOwD,KAAS,SAAU,QAAO;AAGzC,WAAO;EACT;EAEA,SAASkB,GAAQ;EAAG;EAEpB,OAAI;AACF,QAAM1E,IAAU,KAAK,SACf7B,IAAU,KAAK;AAGrB,QAAI,CAACA,EAAQ,aAAa6B,EAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAK,UAAU;AACf;IACF;AAEA,QAAI,CAACA,GAAS;AACZ,WAAK,QAAQ;AACb;IACF;AAGA,SAAK,YAAW,GAGhB,KAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC,GAE1C7B,EAAQ,UACV,KAAK,QAAQ,IAAIoK,MAAgB,QAAQ,MAAM,GAAGA,CAAI,IAGxD,KAAK,MAAM,KAAK,SAAS,KAAK,OAAO;AAWrC,QAAMC,IAAe,KAAK,QAAQ,IAAIrI,OAAK,KAAK,WAAWA,CAAC,CAAC;AAC7D,SAAK,YAAY,KAAK,WAAWqI,CAAY,GAC7C,KAAK,MAAM,KAAK,SAAS,KAAK,SAAS;AAGvC,QAAIC,IAAM,KAAK,UAAU,IAAI,CAACtI,GAAGuE,GAAGgE,MAAM;AACxC,UAAI,KAAK,aAAa,KAAK,oBAAoB;AAE7C,YAAMC,IACJxI,EAAE,CAAC,MAAM,MACTA,EAAE,CAAC,MAAM,OACRA,EAAE,CAAC,MAAM,OAAO,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,MACrC,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,GAChByI,IAAU,WAAW,KAAKzI,EAAE,CAAC,CAAC;AACpC,YAAIwI,EACF,QAAO,CACL,GAAGxI,EAAE,MAAM,GAAG,CAAC,GACf,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC,CAAA;AAEnC,YAAID,EACT,QAAO,CAACzI,EAAE,CAAC,GAAG,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC,CAAC;MAEzD;AACA,aAAO1I,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC;IACnC,CAAC;AAUD,QARA,KAAK,MAAM,KAAK,SAASJ,CAAG,GAG5B,KAAK,MAAMA,EAAI,OACbtI,OAAKA,EAAE,QAAQ,KAAK,MAAM,EAAE,GAI1B,KAAK,UACP,UAAS7D,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAM0B,IAAI,KAAK,IAAI1B,CAAC;AAElB0B,QAAE,CAAC,MAAM,MACTA,EAAE,CAAC,MAAM,MACT,KAAK,UAAU1B,CAAC,EAAE,CAAC,MAAM,OACzB,OAAO0B,EAAE,CAAC,KAAM,YAChB,YAAY,KAAKA,EAAE,CAAC,CAAC,MAErBA,EAAE,CAAC,IAAI;IAEX;AAGF,SAAK,MAAM,KAAK,SAAS,KAAK,GAAG;EACnC;EAOA,WAAW8K,GAAqB;AAE9B,QAAI,KAAK,QAAQ,WACf,UAASxM,IAAI,GAAGA,IAAIwM,EAAU,QAAQxM,IACpC,UAASwD,IAAI,GAAGA,IAAIgJ,EAAUxM,CAAC,EAAE,QAAQwD,IACnCgJ,GAAUxM,CAAC,EAAEwD,CAAC,MAAM,SACtBgJ,EAAUxM,CAAC,EAAEwD,CAAC,IAAI;AAM1B,QAAM,EAAE,mBAAAiJ,IAAoB,EAAC,IAAK,KAAK;AAEvC,WAAIA,KAAqB,KAEvBD,IAAY,KAAK,qBAAqBA,CAAS,GAC/CA,IAAY,KAAK,sBAAsBA,CAAS,KACvCC,KAAqB,IAE9BD,IAAY,KAAK,iBAAiBA,CAAS,IAG3CA,IAAY,KAAK,0BAA0BA,CAAS,GAG/CA;EACT;EAGA,0BAA0BA,GAAqB;AAC7C,WAAOA,EAAU,IAAIlL,OAAQ;AAC3B,UAAIoL,IAAa;AACjB,cAAeA,IAAKpL,EAAM,QAAQ,MAAMoL,IAAK,CAAC,OAAvC,MAA2C;AAChD,YAAI,IAAIA;AACR,eAAOpL,EAAM,IAAI,CAAC,MAAM,OACtB;AAEE,cAAMoL,KACRpL,EAAM,OAAOoL,GAAI,IAAIA,CAAE;MAE3B;AACA,aAAOpL;IACT,CAAC;EACH;EAGA,iBAAiBkL,GAAqB;AACpC,WAAOA,EAAU,IAAIlL,QACnBA,IAAQA,EAAM,OAAO,CAAC6K,GAAejF,MAAQ;AAC3C,UAAMyF,IAAOR,EAAIA,EAAI,SAAS,CAAC;AAC/B,aAAIjF,MAAS,QAAQyF,MAAS,OACrBR,IAELjF,MAAS,QACPyF,KAAQA,MAAS,QAAQA,MAAS,OAAOA,MAAS,QACpDR,EAAI,IAAG,GACAA,MAGXA,EAAI,KAAKjF,CAAI,GACNiF;IACT,GAAG,CAAA,CAAE,GACE7K,EAAM,WAAW,IAAI,CAAC,EAAE,IAAIA,EACpC;EACH;EAEA,qBAAqBA,GAAwB;AACtC,UAAM,QAAQA,CAAK,MACtBA,IAAQ,KAAK,WAAWA,CAAK;AAE/B,QAAIsL,IAAwB;AAC5B,OAAG;AAGD,UAFAA,IAAe,OAEX,CAAC,KAAK,yBAAyB;AACjC,iBAAS,IAAI,GAAG,IAAItL,EAAM,SAAS,GAAG,KAAK;AACzC,cAAMI,IAAIJ,EAAM,CAAC;AAEb,gBAAM,KAAKI,MAAM,MAAMJ,EAAM,CAAC,MAAM,OACpCI,MAAM,OAAOA,MAAM,QACrBkL,IAAe,MACftL,EAAM,OAAO,GAAG,CAAC,GACjB;QAEJ;AAEEA,UAAM,CAAC,MAAM,OACbA,EAAM,WAAW,MAChBA,EAAM,CAAC,MAAM,OAAOA,EAAM,CAAC,MAAM,QAElCsL,IAAe,MACftL,EAAM,IAAG;MAEb;AAGA,UAAIuL,IAAa;AACjB,cAAeA,IAAKvL,EAAM,QAAQ,MAAMuL,IAAK,CAAC,OAAvC,MAA2C;AAChD,YAAMnL,IAAIJ,EAAMuL,IAAK,CAAC;AAClBnL,aAAKA,MAAM,OAAOA,MAAM,QAAQA,MAAM,SACxCkL,IAAe,MACftL,EAAM,OAAOuL,IAAK,GAAG,CAAC,GACtBA,KAAM;MAEV;IACF,SAASD;AACT,WAAOtL,EAAM,WAAW,IAAI,CAAC,EAAE,IAAIA;EACrC;EAoBA,qBAAqBkL,GAAqB;AACxC,QAAII,IAAe;AACnB,OAAG;AACDA,UAAe;AAEf,eAAStL,KAASkL,GAAW;AAC3B,YAAIE,IAAa;AACjB,gBAAeA,IAAKpL,EAAM,QAAQ,MAAMoL,IAAK,CAAC,OAAvC,MAA2C;AAChD,cAAII,IAAcJ;AAClB,iBAAOpL,EAAMwL,IAAM,CAAC,MAAM,OAExBA;AAIEA,cAAMJ,KACRpL,EAAM,OAAOoL,IAAK,GAAGI,IAAMJ,CAAE;AAG/B,cAAIK,IAAOzL,EAAMoL,IAAK,CAAC,GACjBhL,IAAIJ,EAAMoL,IAAK,CAAC,GAChBM,IAAK1L,EAAMoL,IAAK,CAAC;AAEvB,cADIK,MAAS,QAEX,CAACrL,KACDA,MAAM,OACNA,MAAM,QACN,CAACsL,KACDA,MAAO,OACPA,MAAO,KAEP;AAEFJ,cAAe,MAEftL,EAAM,OAAOoL,GAAI,CAAC;AAClB,cAAMO,IAAQ3L,EAAM,MAAM,CAAC;AAC3B2L,YAAMP,CAAE,IAAI,MACZF,EAAU,KAAKS,CAAK,GACpBP;QACF;AAGA,YAAI,CAAC,KAAK,yBAAyB;AACjC,mBAAS1M,IAAI,GAAGA,IAAIsB,EAAM,SAAS,GAAGtB,KAAK;AACzC,gBAAM0B,IAAIJ,EAAMtB,CAAC;AAEbA,kBAAM,KAAK0B,MAAM,MAAMJ,EAAM,CAAC,MAAM,OACpCI,MAAM,OAAOA,MAAM,QACrBkL,IAAe,MACftL,EAAM,OAAOtB,GAAG,CAAC,GACjBA;UAEJ;AAEEsB,YAAM,CAAC,MAAM,OACbA,EAAM,WAAW,MAChBA,EAAM,CAAC,MAAM,OAAOA,EAAM,CAAC,MAAM,QAElCsL,IAAe,MACftL,EAAM,IAAG;QAEb;AAGA,YAAIuL,IAAa;AACjB,gBAAeA,IAAKvL,EAAM,QAAQ,MAAMuL,IAAK,CAAC,OAAvC,MAA2C;AAChD,cAAMnL,IAAIJ,EAAMuL,IAAK,CAAC;AACtB,cAAInL,KAAKA,MAAM,OAAOA,MAAM,QAAQA,MAAM,MAAM;AAC9CkL,gBAAe;AAEf,gBAAMM,IADUL,MAAO,KAAKvL,EAAMuL,IAAK,CAAC,MAAM,OACtB,CAAC,GAAG,IAAI,CAAA;AAChCvL,cAAM,OAAOuL,IAAK,GAAG,GAAG,GAAGK,CAAK,GAC5B5L,EAAM,WAAW,KAAGA,EAAM,KAAK,EAAE,GACrCuL,KAAM;UACR;QACF;MACF;IACF,SAASD;AAET,WAAOJ;EACT;EASA,sBAAsBA,GAAqB;AACzC,aAASxM,IAAI,GAAGA,IAAIwM,EAAU,SAAS,GAAGxM,IACxC,UAASwD,IAAIxD,IAAI,GAAGwD,IAAIgJ,EAAU,QAAQhJ,KAAK;AAC7C,UAAM2J,IAAU,KAAK,WACnBX,EAAUxM,CAAC,GACXwM,EAAUhJ,CAAC,GACX,CAAC,KAAK,uBAAuB;AAE/B,UAAI2J,GAAS;AACXX,UAAUxM,CAAC,IAAI,CAAA,GACfwM,EAAUhJ,CAAC,IAAI2J;AACf;MACF;IACF;AAEF,WAAOX,EAAU,OAAOE,OAAMA,EAAG,MAAM;EACzC;EAEA,WACE1N,GACAC,GACAmO,IAAwB,OAAK;AAE7B,QAAItN,IAAK,GACLC,IAAK,GACLF,IAAmB,CAAA,GACnBwN,IAAgB;AACpB,WAAOvN,IAAKd,EAAE,UAAUe,IAAKd,EAAE,SAC7B,KAAID,EAAEc,CAAE,MAAMb,EAAEc,CAAE,EAChBF,GAAO,KAAKwN,MAAU,MAAMpO,EAAEc,CAAE,IAAIf,EAAEc,CAAE,CAAC,GACzCA,KACAC;aACSqN,KAAgBpO,EAAEc,CAAE,MAAM,QAAQb,EAAEc,CAAE,MAAMf,EAAEc,IAAK,CAAC,EAC7DD,GAAO,KAAKb,EAAEc,CAAE,CAAC,GACjBA;aACSsN,KAAgBnO,EAAEc,CAAE,MAAM,QAAQf,EAAEc,CAAE,MAAMb,EAAEc,IAAK,CAAC,EAC7DF,GAAO,KAAKZ,EAAEc,CAAE,CAAC,GACjBA;aAEAf,EAAEc,CAAE,MAAM,OACVb,EAAEc,CAAE,MACH,KAAK,QAAQ,OAAO,CAACd,EAAEc,CAAE,EAAE,WAAW,GAAG,MAC1Cd,EAAEc,CAAE,MAAM,MACV;AACA,UAAIsN,MAAU,IAAK,QAAO;AAC1BA,UAAQ,KACRxN,EAAO,KAAKb,EAAEc,CAAE,CAAC,GACjBA,KACAC;IACF,WACEd,EAAEc,CAAE,MAAM,OACVf,EAAEc,CAAE,MACH,KAAK,QAAQ,OAAO,CAACd,EAAEc,CAAE,EAAE,WAAW,GAAG,MAC1Cd,EAAEc,CAAE,MAAM,MACV;AACA,UAAIuN,MAAU,IAAK,QAAO;AAC1BA,UAAQ,KACRxN,EAAO,KAAKZ,EAAEc,CAAE,CAAC,GACjBD,KACAC;IACF,MACE,QAAO;AAKX,WAAOf,EAAE,WAAWC,EAAE,UAAUY;EAClC;EAEA,cAAW;AACT,QAAI,KAAK,SAAU;AAEnB,QAAM6D,IAAU,KAAK,SACjBe,IAAS,OACT6I,IAAe;AAEnB,aAAS,IAAI,GAAG,IAAI5J,EAAQ,UAAUA,EAAQ,OAAO,CAAC,MAAM,KAAK,IAC/De,KAAS,CAACA,GACV6I;AAGEA,UAAc,KAAK,UAAU5J,EAAQ,MAAM4J,CAAY,IAC3D,KAAK,SAAS7I;EAChB;EAOA,SACE8I,GACA7J,GACA8J,IAAmB,OAAK;AAExB,QAAM3L,IAAU,KAAK;AAKrB,QAAI,KAAK,WAAW;AAClB,UAAM4L,IACJ,OAAOF,EAAK,CAAC,KAAM,YAAY,YAAY,KAAKA,EAAK,CAAC,CAAC,GACnDG,IACJ,CAACD,KACDF,EAAK,CAAC,MAAM,MACZA,EAAK,CAAC,MAAM,MACZA,EAAK,CAAC,MAAM,OACZ,YAAY,KAAKA,EAAK,CAAC,CAAC,GAEpBI,IACJ,OAAOjK,EAAQ,CAAC,KAAM,YAAY,YAAY,KAAKA,EAAQ,CAAC,CAAC,GACzDkK,IACJ,CAACD,KACDjK,EAAQ,CAAC,MAAM,MACfA,EAAQ,CAAC,MAAM,MACfA,EAAQ,CAAC,MAAM,OACf,OAAOA,EAAQ,CAAC,KAAM,YACtB,YAAY,KAAKA,EAAQ,CAAC,CAAC,GAEvBmK,IACJH,IAAU,IACRD,IAAY,IACZ,QACEK,IACJF,IAAa,IACXD,IAAe,IACf;AACJ,UAAI,OAAOE,KAAQ,YAAY,OAAOC,KAAQ,UAAU;AACtD,YAAM,CAACC,GAAIC,CAAE,IAAsB,CACjCT,EAAKM,CAAG,GACRnK,EAAQoK,CAAG,CAAA;AAETC,UAAG,YAAW,MAAOC,EAAG,YAAW,MACrCtK,EAAQoK,CAAG,IAAIC,GACXD,IAAMD,IACRnK,IAAUA,EAAQ,MAAMoK,CAAG,IAClBD,IAAMC,MACfP,IAAOA,EAAK,MAAMM,CAAG;MAG3B;IACF;AAIA,QAAM,EAAE,mBAAApB,IAAoB,EAAC,IAAK,KAAK;AACnCA,SAAqB,MACvBc,IAAO,KAAK,qBAAqBA,CAAI,IAGvC,KAAK,MAAM,YAAY,MAAM,EAAE,MAAAA,GAAM,SAAA7J,EAAO,CAAE,GAC9C,KAAK,MAAM,YAAY6J,EAAK,QAAQ7J,EAAQ,MAAM;AAElD,aACMuK,IAAK,GAAGC,IAAK,GAAGC,IAAKZ,EAAK,QAAQnG,IAAK1D,EAAQ,QACnDuK,IAAKE,KAAMD,IAAK9G,GAChB6G,KAAMC,KACN;AACA,WAAK,MAAM,eAAe;AAC1B,UAAIxM,IAAIgC,EAAQwK,CAAE,GACdxE,IAAI6D,EAAKU,CAAE;AAOf,UALA,KAAK,MAAMvK,GAAShC,GAAGgI,CAAC,GAKpBhI,MAAM,MACR,QAAO;AAIT,UAAIA,MAAMyJ,GAAU;AAClB,aAAK,MAAM,YAAY,CAACzH,GAAShC,GAAGgI,CAAC,CAAC;AAwBtC,YAAI0E,IAAKH,GACLI,IAAKH,IAAK;AACd,YAAIG,MAAOjH,GAAI;AAQb,eAPA,KAAK,MAAM,eAAe,GAOnB6G,IAAKE,GAAIF,IACd,KACEV,EAAKU,CAAE,MAAM,OACbV,EAAKU,CAAE,MAAM,QACZ,CAACpM,EAAQ,OAAO0L,EAAKU,CAAE,EAAE,OAAO,CAAC,MAAM,IAExC,QAAO;AAEX,iBAAO;QACT;AAGA,eAAOG,IAAKD,KAAI;AACd,cAAIG,IAAYf,EAAKa,CAAE;AAKvB,cAHA,KAAK,MAAM;iBAAoBb,GAAMa,GAAI1K,GAAS2K,GAAIC,CAAS,GAG3D,KAAK,SAASf,EAAK,MAAMa,CAAE,GAAG1K,EAAQ,MAAM2K,CAAE,GAAGb,CAAO,EAC1D,QAAA,KAAK,MAAM,yBAAyBY,GAAID,GAAIG,CAAS,GAE9C;AAIP,cACEA,MAAc,OACdA,MAAc,QACb,CAACzM,EAAQ,OAAOyM,EAAU,OAAO,CAAC,MAAM,KACzC;AACA,iBAAK,MAAM,iBAAiBf,GAAMa,GAAI1K,GAAS2K,CAAE;AACjD;UACF;AAGA,eAAK,MAAM,0CAA0C,GACrDD;QAEJ;AAKA,eAAI,CAAA,EAAAZ,MAEF,KAAK,MAAM;yBAA4BD,GAAMa,GAAI1K,GAAS2K,CAAE,GACxDD,MAAOD;MAMf;AAKA,UAAII;AASJ,UARI,OAAO7M,KAAM,YACf6M,IAAM7E,MAAMhI,GACZ,KAAK,MAAM,gBAAgBA,GAAGgI,GAAG6E,CAAG,MAEpCA,IAAM7M,EAAE,KAAKgI,CAAC,GACd,KAAK,MAAM,iBAAiBhI,GAAGgI,GAAG6E,CAAG,IAGnC,CAACA,EAAK,QAAO;IACnB;AAcA,QAAIN,MAAOE,KAAMD,MAAO9G,EAGtB,QAAO;AACF,QAAI6G,MAAOE,EAIhB,QAAOX;AACF,QAAIU,MAAO9G,EAKhB,QAAO6G,MAAOE,IAAK,KAAKZ,EAAKU,CAAE,MAAM;AAKrC,UAAM,IAAI,MAAM,MAAM;EAG1B;EAEA,cAAW;AACT,WAAOtC,GAAY,KAAK,SAAS,KAAK,OAAO;EAC/C;EAEA,MAAMjI,GAAe;AACnBD,OAAmBC,CAAO;AAE1B,QAAM7B,IAAU,KAAK;AAGrB,QAAI6B,MAAY,KAAM,QAAOyH;AAC7B,QAAIzH,MAAY,GAAI,QAAO;AAI3B,QAAIlE,GACAgP,IAA4C;AAAA,KAC3ChP,IAAIkE,EAAQ,MAAMyG,EAAM,KAC3BqE,IAAW3M,EAAQ,MAAMwI,KAAcD,MAC7B5K,IAAIkE,EAAQ,MAAM8F,EAAY,KACxCgF,KACE3M,EAAQ,SACNA,EAAQ,MACNgI,KACAD,KACF/H,EAAQ,MAAM8H,KACdF,IAAgBjK,EAAE,CAAC,CAAC,KACdA,IAAIkE,EAAQ,MAAM4G,EAAQ,KACpCkE,KACE3M,EAAQ,SACNA,EAAQ,MACN8I,KACAJ,KACF1I,EAAQ,MAAMgJ,KACdC,IAAYtL,CAAC,KACPA,IAAIkE,EAAQ,MAAMoG,EAAa,KACzC0E,IAAW3M,EAAQ,MAAMmI,KAAqBD,MACpCvK,IAAIkE,EAAQ,MAAMuG,EAAS,OACrCuE,IAAWtE;AAGb,QAAMrC,IAAK5B,EAAI,SAASvC,GAAS,KAAK,OAAO,EAAE,YAAW;AAC1D,WAAI8K,KAAY,OAAO3G,KAAO,YAE5B,QAAQ,eAAeA,GAAI,QAAQ,EAAE,OAAO2G,EAAQ,CAAE,GAEjD3G;EACT;EAEA,SAAM;AACJ,QAAI,KAAK,UAAU,KAAK,WAAW,MAAO,QAAO,KAAK;AAQtD,QAAMsE,IAAM,KAAK;AAEjB,QAAI,CAACA,EAAI,OACP,QAAA,KAAK,SAAS,OACP,KAAK;AAEd,QAAMtK,IAAU,KAAK,SAEf4M,IACJ5M,EAAQ,aAAakE,KACnBlE,EAAQ,MAAMuJ,KACdC,IACEtD,IAAQ,IAAI,IAAIlG,EAAQ,SAAS,CAAC,GAAG,IAAI,CAAA,CAAE,GAQ7CgG,IAAKsE,EACN,IAAIzI,OAAU;AACb,UAAMuD,IAAmCvD,EAAQ,IAAIhC,OAAI;AACvD,YAAIA,aAAa,OACf,UAAWgI,KAAKhI,EAAE,MAAM,MAAM,EAAE,EAAGqG,GAAM,IAAI2B,CAAC;AAEhD,eACE,OAAOhI,KAAM,WAAWmE,GAAanE,CAAC,IACpCA,MAAMyJ,IAAWA,IACjBzJ,EAAE;MAER,CAAC;AACDuF,QAAG,QAAQ,CAACvF,GAAG1B,MAAK;AAClB,YAAM+M,IAAO9F,EAAGjH,IAAI,CAAC,GACf2M,IAAO1F,EAAGjH,IAAI,CAAC;AACjB0B,cAAMyJ,KAAYwB,MAASxB,MAG3BwB,MAAS,SACPI,MAAS,UAAaA,MAAS5B,IACjClE,EAAGjH,IAAI,CAAC,IAAI,YAAYyO,IAAU,UAAU1B,IAE5C9F,EAAGjH,CAAC,IAAIyO,IAED1B,MAAS,SAClB9F,EAAGjH,IAAI,CAAC,IAAI2M,IAAO,eAAe8B,IAAU,OACnC1B,MAAS5B,MAClBlE,EAAGjH,IAAI,CAAC,IAAI2M,IAAO,eAAe8B,IAAU,SAAS1B,GACrD9F,EAAGjH,IAAI,CAAC,IAAImL;MAEhB,CAAC;AACD,UAAMuD,IAAWzH,EAAG,OAAOvF,OAAKA,MAAMyJ,CAAQ;AAK9C,UAAI,KAAK,WAAWuD,EAAS,UAAU,GAAG;AACxC,YAAMC,IAAqB,CAAA;AAC3B,iBAAS3O,IAAI,GAAGA,KAAK0O,EAAS,QAAQ1O,IACpC2O,GAAS,KAAKD,EAAS,MAAM,GAAG1O,CAAC,EAAE,KAAK,GAAG,CAAC;AAE9C,eAAO,QAAQ2O,EAAS,KAAK,GAAG,IAAI;MACtC;AAEA,aAAOD,EAAS,KAAK,GAAG;IAC1B,CAAC,EACA,KAAK,GAAG,GAIL,CAACE,GAAM7F,CAAK,IAAIoD,EAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAG7DtE,QAAK,MAAM+G,IAAO/G,IAAKkB,IAAQ,KAG3B,KAAK,YACPlB,IAAK,aAAa+G,IAAO/G,EAAG,MAAM,GAAG,EAAE,IAAIkB,IAAQ,OAIjD,KAAK,WAAQlB,IAAK,SAASA,IAAK;AAEpC,QAAI;AACF,WAAK,SAAS,IAAI,OAAOA,GAAI,CAAC,GAAGE,CAAK,EAAE,KAAK,EAAE,CAAC;IAElD,QAAa;AAEX,WAAK,SAAS;IAChB;AAEA,WAAO,KAAK;EACd;EAEA,WAAWrG,GAAS;AAKlB,WAAI,KAAK,0BACAA,EAAE,MAAM,GAAG,IACT,KAAK,aAAa,cAAc,KAAKA,CAAC,IAExC,CAAC,IAAI,GAAGA,EAAE,MAAM,KAAK,CAAC,IAEtBA,EAAE,MAAM,KAAK;EAExB;EAEA,MAAMgI,GAAW8D,IAAU,KAAK,SAAO;AAIrC,QAHA,KAAK,MAAM,SAAS9D,GAAG,KAAK,OAAO,GAG/B,KAAK,QACP,QAAO;AAET,QAAI,KAAK,MACP,QAAOA,MAAM;AAGf,QAAIA,MAAM,OAAO8D,EACf,QAAO;AAGT,QAAM3L,IAAU,KAAK;AAGjB,SAAK,cACP6H,IAAIA,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG;AAI5B,QAAMmF,IAAK,KAAK,WAAWnF,CAAC;AAC5B,SAAK,MAAM,KAAK,SAAS,SAASmF,CAAE;AAOpC,QAAM1C,IAAM,KAAK;AACjB,SAAK,MAAM,KAAK,SAAS,OAAOA,CAAG;AAGnC,QAAI2C,IAAmBD,EAAGA,EAAG,SAAS,CAAC;AACvC,QAAI,CAACC,EACH,UAAS9O,IAAI6O,EAAG,SAAS,GAAG,CAACC,KAAY9O,KAAK,GAAGA,IAC/C8O,KAAWD,EAAG7O,CAAC;AAInB,aAASA,IAAI,GAAGA,IAAImM,EAAI,QAAQnM,KAAK;AACnC,UAAM0D,IAAUyI,EAAInM,CAAC,GACjBuN,IAAOsB;AAKX,UAJIhN,EAAQ,aAAa6B,EAAQ,WAAW,MAC1C6J,IAAO,CAACuB,CAAQ,IAEN,KAAK,SAASvB,GAAM7J,GAAS8J,CAAO,EAE9C,QAAI3L,EAAQ,aACH,OAEF,CAAC,KAAK;IAEjB;AAIA,WAAIA,EAAQ,aACH,QAEF,KAAK;EACd;EAEA,OAAO,SAAS2J,GAAqB;AACnC,WAAOlC,EAAU,SAASkC,CAAG,EAAE;EACjC;AAAA;AAOFlC,EAAU,MAAMrD;AAChBqD,EAAU,YAAYC;AACtBD,EAAU,SAASD;AACnBC,EAAU,WAAWnE;AEvwCrB,IAAM4J,KAEF,OAAO,eAAgB,YACvB,eACA,OAAO,YAAY,OAAQ,aAE3B,cACA;AAPJ,IASMC,KAAS,oBAAI;AATnB,IAeMC,KACJ,OAAO,WAAY,YAAc,UAC/B,UACA,CAAA;AAlBJ,IAqBMC,KAAc,CAClBC,IACArI,GACAsI,GACAC,MACE;AACF,SAAOJ,GAAQ,eAAgB,aAC7BA,GAAQ,YAAYE,IAAKrI,GAAMsI,GAAMC,CAAE,IACvC,QAAQ,MAAM,IAAID,CAAI,KAAKtI,CAAI,KAAKqI,EAAG,EAAE;AAC7C;AA9BA,IAgCIG,KAAK,WAAW;AAhCpB,IAiCIC,KAAK,WAAW;AAGpB,IAAI,OAAOD,KAAO,KAAa;AAE7BC,OAAK,MAAiB;IACpB;IACA,WAAqC,CAAA;IACrC;IACA,UAAmB;IACnB,iBAAiBnH,GAAWiH,GAAwB;AAClD,WAAK,SAAS,KAAKA,CAAE;IACvB;EAAA,GAGFC,KAAK,MAAqB;IACxB,cAAA;AACEE,QAAc;IAChB;IACA,SAAS,IAAID;IACb,MAAME,GAAW;AACf,UAAI,CAAA,KAAK,OAAO,SAEhB;AAAA,aAAK,OAAO,SAASA,GAErB,KAAK,OAAO,UAAU;AAEtB,iBAAWJ,KAAM,KAAK,OAAO,SAC3BA,GAAGI,CAAM;AAEX,aAAK,OAAO,UAAUA,CAAM;MAAA;IAC9B;EAAA;AAEF,MAAIC,KACFT,GAAQ,KAAK,gCAAgC,KACzCO,IAAiB,MAAK;AACrBE,IAAAA,OACLA,KAAyB,OACzBR,GACE,oaAOA,uBACA,WACAM,CAAc;EAElB;AACF;AAGA,IAAMG,KAAcP,CAAAA,OAAiB,CAACJ,GAAO,IAAII,EAAI;AAArD,IAMMQ,IAAY9M,CAAAA,OAChBA,MAAKA,OAAM,KAAK,MAAMA,EAAC,KAAKA,KAAI,KAAK,SAASA,EAAC;AAPjD,IAqBM+M,KAAgB/N,CAAAA,OACnB8N,EAAS9N,EAAG,IACXA,MAAO,KAAK,IAAI,GAAG,CAAC,IAAI,aACxBA,MAAO,KAAK,IAAI,GAAG,EAAE,IAAI,cACzBA,MAAO,KAAK,IAAI,GAAG,EAAE,IAAI,cACzBA,MAAO,OAAO,mBAAmBgO,KACjC,OALe;AAtBnB,IA8BMA,KAAN,cAAwB,MAAa;EACnC,YAAYC,IAAY;AACtB,UAAMA,EAAI,GACV,KAAK,KAAK,CAAC;EACb;AAAA;AAlCF,IAwCMC,KAAN,MAAMC,GAAK;EACT;EACA;EAEA,OAAOC,KAAyB;EAChC,OAAO,OAAOpO,GAAW;AACvB,QAAMqO,IAAUN,GAAa/N,CAAG;AAChC,QAAI,CAACqO,EAAS,QAAO,CAAA;AACrBF,OAAMC,KAAgB;AACtB,QAAMrM,IAAI,IAAIoM,GAAMnO,GAAKqO,CAAO;AAChC,WAAAF,GAAMC,KAAgB,OACfrM;EACT;EACA,YAAY/B,GAAaqO,GAAyC;AAEhE,QAAI,CAACF,GAAMC,GACT,OAAM,IAAI,UAAU,yCAAyC;AAG/D,SAAK,OAAO,IAAIC,EAAQrO,CAAG,GAC3B,KAAK,SAAS;EAChB;EACA,KAAKgB,GAAQ;AACX,SAAK,KAAK,KAAK,QAAQ,IAAIA;EAC7B;EACA,MAAG;AACD,WAAO,KAAK,KAAK,EAAE,KAAK,MAAM;EAChC;AAAA;AAnEF,IAoiCasN,KAAP,MAAOC,GAAQ;EAEVC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAKT,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EAKA;EAKA;EAIA;EAIA;EAIA;EAIA;EAKA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAGAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAEAC;EACAC;EACAC;EACAC;EAWA,OAAO,sBAIL3O,GAAqB;AACrB,WAAO,EAEL,QAAQA,EAAEqO,IACV,MAAMrO,EAAEsO,IACR,iBAAiBtO,EAAEuO,IACnB,OAAOvO,EAAEoO,IACT,QAAQpO,EAAE2N,IACV,SAAS3N,EAAE4N,IACX,SAAS5N,EAAE6N,IACX,MAAM7N,EAAE8N,IACR,MAAM9N,EAAE+N,IACR,IAAI,OAAI;AACN,aAAO/N,EAAEgO;IACX,GACA,IAAI,OAAI;AACN,aAAOhO,EAAEiO;IACX,GACA,MAAMjO,EAAEkO,IAER,mBAAoB7P,OAAW2B,EAAE4O,GAAmBvQ,CAAC,GACrD,iBAAiB,CACfc,GACA0P,GACArQ,GACAsQ,MAEA9O,EAAE+O,GACA5P,GACA0P,GACArQ,GACAsQ,CAAO,GAEX,YAAaD,OAAwB7O,EAAEgP,GAAYH,CAAc,GACjE,SAAUrQ,OAAsCwB,EAAEiP,GAASzQ,CAAO,GAClE,UAAWA,OACTwB,EAAEkP,GAAU1Q,CAAO,GACrB,SAAUqQ,OAA8B7O,EAAEmP,GAASN,CAAc,EAAA;EAErE;EAOA,IAAI,MAAG;AACL,WAAO,KAAK5B;EACd;EAIA,IAAI,UAAO;AACT,WAAO,KAAKC;EACd;EAIA,IAAI,iBAAc;AAChB,WAAO,KAAKQ;EACd;EAIA,IAAI,OAAI;AACN,WAAO,KAAKD;EACd;EAIA,IAAI,cAAW;AACb,WAAO,KAAKH;EACd;EACA,IAAI,aAAU;AACZ,WAAO,KAAKC;EACd;EAIA,IAAI,UAAO;AACT,WAAO,KAAKJ;EACd;EAIA,IAAI,WAAQ;AACV,WAAO,KAAKC;EACd;EAIA,IAAI,eAAY;AACd,WAAO,KAAKC;EACd;EAEA,YAAY7O,GAAwD;AAClE,QAAM,EACJ,KAAAC,IAAM,GACN,KAAA2Q,GACA,eAAAC,IAAgB,GAChB,cAAAC,GACA,gBAAAC,GACA,gBAAAC,GACA,YAAAC,GACA,SAAAC,GACA,UAAAC,GACA,cAAAC,GACA,gBAAAC,GACA,aAAAC,GACA,SAAAC,IAAU,GACV,cAAAC,IAAe,GACf,iBAAAC,GACA,aAAAC,GACA,YAAAC,GACA,0BAAAC,GACA,oBAAAC,GACA,4BAAAC,GACA,wBAAAC,GACA,kBAAAC,GACA,MAAAC,EAAI,IACFjS;AAEJ,QAAIiS,MAAS,UACP,OAAOA,GAAM,OAAQ,WACvB,OAAM,IAAI,UACR,mDAAmD;AAOzD,QAFA,KAAKjD,KAAQiD,KAAQ/E,IAEjBjN,MAAQ,KAAK,CAAC8N,EAAS9N,CAAG,EAC5B,OAAM,IAAI,UAAU,0CAA0C;AAGhE,QAAMiS,IAAYjS,IAAM+N,GAAa/N,CAAG,IAAI;AAC5C,QAAI,CAACiS,EACH,OAAM,IAAI,MAAM,wBAAwBjS,CAAG;AAO7C,QAJA,KAAKwO,KAAOxO,GACZ,KAAKyO,KAAW6C,GAChB,KAAK,eAAeC,KAAgB,KAAK9C,IACzC,KAAK,kBAAkB+C,GACnB,KAAK,iBAAiB;AACxB,UAAI,CAAC,KAAK/C,MAAY,CAAC,KAAK,aAC1B,OAAM,IAAI,UACR,oEAAoE;AAGxE,UAAI,OAAO,KAAK,mBAAoB,WAClC,OAAM,IAAI,UAAU,qCAAqC;IAE7D;AAEA,QAAIiD,MAAe,UAAa,OAAOA,KAAe,WACpD,OAAM,IAAI,UAAU,0CAA0C;AAIhE,QAFA,KAAK5C,KAAc4C,GAEfD,MAAgB,UAAa,OAAOA,KAAgB,WACtD,OAAM,IAAI,UAAU,6CAA6C;AAyCnE,QAvCA,KAAK5C,KAAe4C,GACpB,KAAKzB,KAAkB,CAAC,CAACyB,GAEzB,KAAKvC,KAAU,oBAAI,OACnB,KAAKC,KAAW,IAAI,MAAMnP,CAAG,EAAE,KAAK,MAAS,GAC7C,KAAKoP,KAAW,IAAI,MAAMpP,CAAG,EAAE,KAAK,MAAS,GAC7C,KAAKqP,KAAQ,IAAI4C,EAAUjS,CAAG,GAC9B,KAAKsP,KAAQ,IAAI2C,EAAUjS,CAAG,GAC9B,KAAKuP,KAAQ,GACb,KAAKC,KAAQ,GACb,KAAKC,KAAQvB,GAAM,OAAOlO,CAAG,GAC7B,KAAKgP,KAAQ,GACb,KAAKC,KAAkB,GAEnB,OAAOgC,KAAY,eACrB,KAAKvC,KAAWuC,IAEd,OAAOC,KAAa,eACtB,KAAKvC,KAAYuC,IAEf,OAAOC,KAAiB,cAC1B,KAAKvC,KAAgBuC,GACrB,KAAKzB,KAAY,CAAA,MAEjB,KAAKd,KAAgB,QACrB,KAAKc,KAAY,SAEnB,KAAKK,KAAc,CAAC,CAAC,KAAKrB,IAC1B,KAAKwB,KAAe,CAAC,CAAC,KAAKvB,IAC3B,KAAKsB,KAAmB,CAAC,CAAC,KAAKrB,IAE/B,KAAK,iBAAiB,CAAC,CAACwC,GACxB,KAAK,cAAc,CAAC,CAACC,GACrB,KAAK,2BAA2B,CAAC,CAACM,GAClC,KAAK,6BAA6B,CAAC,CAACE,GACpC,KAAK,yBAAyB,CAAC,CAACC,GAChC,KAAK,mBAAmB,CAAC,CAACC,GAGtB,KAAK,iBAAiB,GAAG;AAC3B,UAAI,KAAKtD,OAAa,KAChB,CAACX,EAAS,KAAKW,EAAQ,EACzB,OAAM,IAAI,UACR,iDAAiD;AAIvD,UAAI,CAACX,EAAS,KAAK,YAAY,EAC7B,OAAM,IAAI,UACR,sDAAsD;AAG1D,WAAKoE,GAAuB;IAC9B;AAUA,QARA,KAAK,aAAa,CAAC,CAAClB,GACpB,KAAK,qBAAqB,CAAC,CAACY,GAC5B,KAAK,iBAAiB,CAAC,CAACd,GACxB,KAAK,iBAAiB,CAAC,CAACC,GACxB,KAAK,gBACHjD,EAAS8C,CAAa,KAAKA,MAAkB,IAAIA,IAAgB,GACnE,KAAK,eAAe,CAAC,CAACC,GACtB,KAAK,MAAMF,KAAO,GACd,KAAK,KAAK;AACZ,UAAI,CAAC7C,EAAS,KAAK,GAAG,EACpB,OAAM,IAAI,UAAU,6CAA6C;AAEnE,WAAKqE,GAAsB;IAC7B;AAGA,QAAI,KAAK3D,OAAS,KAAK,KAAK,QAAQ,KAAK,KAAKC,OAAa,EACzD,OAAM,IAAI,UACR,kDAAkD;AAGtD,QAAI,CAAC,KAAK,gBAAgB,CAAC,KAAKD,MAAQ,CAAC,KAAKC,IAAU;AACtD,UAAMnB,KAAO;AACTO,SAAWP,EAAI,MACjBJ,GAAO,IAAII,EAAI,GAIfF,GAFE,iGAEe,yBAAyBE,IAAMiB,EAAQ;IAE5D;EACF;EAMA,gBAAgB6D,GAAM;AACpB,WAAO,KAAKlD,GAAQ,IAAIkD,CAAG,IAAI,IAAA,IAAW;EAC5C;EAEAD,KAAsB;AACpB,QAAME,IAAO,IAAIrE,GAAU,KAAKQ,EAAI,GAC9B8D,IAAS,IAAItE,GAAU,KAAKQ,EAAI;AACtC,SAAKqB,KAAQwC,GACb,KAAKzC,KAAU0C;AACf,QAAMC,IACJ,KAAK,eACH,IAAI,MAAiD,KAAK/D,EAAI,IAC9D;AACJ,SAAKsB,KAAmByC,GAExB,KAAKC,KAAc,CAACpC,GAAOO,GAAKnK,IAAQ,KAAKuI,GAAM,IAAG,MAAM;AAU1D,UATAuD,EAAOlC,CAAK,IAAIO,MAAQ,IAAInK,IAAQ,GACpC6L,EAAKjC,CAAK,IAAIO,GAIV4B,IAAcnC,CAAK,MACrB,aAAamC,EAAYnC,CAAK,CAAC,GAC/BmC,EAAYnC,CAAK,IAAI,SAEnBO,MAAQ,KAAK4B,GAAa;AAC5B,YAAME,IAAI,WAAW,MAAK;AACpB,eAAK/B,GAASN,CAAK,KACrB,KAAKsC,GAAQ,KAAKvD,GAASiB,CAAK,GAAQ,QAAQ;QAEpD,GAAGO,IAAM,CAAC;AAGN8B,UAAE,SACJA,EAAE,MAAK,GAGTF,EAAYnC,CAAK,IAAIqC;MACvB;IACF,GAEA,KAAKE,KAAiBvC,OAAQ;AAC5BkC,QAAOlC,CAAK,IAAIiC,EAAKjC,CAAK,MAAM,IAAI,KAAKrB,GAAM,IAAG,IAAK;IACzD,GAEA,KAAK6D,KAAa,CAACC,GAAQzC,MAAS;AAClC,UAAIiC,EAAKjC,CAAK,GAAG;AACf,YAAMO,IAAM0B,EAAKjC,CAAK,GAChB5J,IAAQ8L,EAAOlC,CAAK;AAE1B,YAAI,CAACO,KAAO,CAACnK,EAAO;AACpBqM,UAAO,MAAMlC,GACbkC,EAAO,QAAQrM,GACfqM,EAAO,MAAMC,KAAaC,EAAM;AAChC,YAAMC,IAAMH,EAAO,MAAMrM;AACzBqM,UAAO,eAAelC,IAAMqC;MAC9B;IACF;AAIA,QAAIF,IAAY,GACVC,IAAS,MAAK;AAClB,UAAM/R,IAAI,KAAK+N,GAAM,IAAG;AACxB,UAAI,KAAK,gBAAgB,GAAG;AAC1B+D,YAAY9R;AACZ,YAAMyR,IAAI,WAAW,MAAOK,IAAY,GAAI,KAAK,aAAa;AAG1DL,UAAE,SACJA,EAAE,MAAK;MAGX;AACA,aAAOzR;IACT;AAEA,SAAK,kBAAkBoR,OAAM;AAC3B,UAAMhC,IAAQ,KAAKlB,GAAQ,IAAIkD,CAAG;AAClC,UAAIhC,MAAU,OACZ,QAAO;AAET,UAAMO,IAAM0B,EAAKjC,CAAK,GAChB5J,IAAQ8L,EAAOlC,CAAK;AAC1B,UAAI,CAACO,KAAO,CAACnK,EACX,QAAO,IAAA;AAET,UAAMwM,KAAOF,KAAaC,EAAM,KAAMvM;AACtC,aAAOmK,IAAMqC;IACf,GAEA,KAAKtC,KAAWN,OAAQ;AACtB,UAAMrO,IAAIuQ,EAAOlC,CAAK,GAChBqC,IAAIJ,EAAKjC,CAAK;AACpB,aAAO,CAAC,CAACqC,KAAK,CAAC,CAAC1Q,MAAM+Q,KAAaC,EAAM,KAAMhR,IAAI0Q;IACrD;EACF;EAGAE,KAAyC,MAAK;EAAE;EAChDC,KAAiE,MAAK;EAAE;EACxEJ,KAMY,MAAK;EAAE;EAGnB9B,KAAsC,MAAM;EAE5CwB,KAAuB;AACrB,QAAMe,IAAQ,IAAIjF,GAAU,KAAKQ,EAAI;AACrC,SAAKS,KAAkB,GACvB,KAAKU,KAASsD,GACd,KAAKC,KAAkB9C,OAAQ;AAC7B,WAAKnB,MAAmBgE,EAAM7C,CAAK,GACnC6C,EAAM7C,CAAK,IAAI;IACjB,GACA,KAAK+C,KAAe,CAACzS,GAAG0S,GAAGnF,GAAMuD,MAAmB;AAGlD,UAAI,KAAKrB,GAAmBiD,CAAC,EAC3B,QAAO;AAET,UAAI,CAACtF,EAASG,CAAI,EAChB,KAAIuD,GAAiB;AACnB,YAAI,OAAOA,KAAoB,WAC7B,OAAM,IAAI,UAAU,oCAAoC;AAG1D,YADAvD,IAAOuD,EAAgB4B,GAAG1S,CAAC,GACvB,CAACoN,EAASG,CAAI,EAChB,OAAM,IAAI,UACR,0DAA0D;MAGhE,MACE,OAAM,IAAI,UACR,2HAEwB;AAI9B,aAAOA;IACT,GACA,KAAKoF,KAAe,CAClBjD,GACAnC,GACA4E,MACE;AAEF,UADAI,EAAM7C,CAAK,IAAInC,GACX,KAAKQ,IAAU;AACjB,YAAM6C,IAAU,KAAK7C,KAAYwE,EAAM7C,CAAK;AAC5C,eAAO,KAAKnB,KAAkBqC,IAC5B,MAAKgC,GAAO,IAAI;MAEpB;AACA,WAAKrE,MAAmBgE,EAAM7C,CAAK,GAC/ByC,MACFA,EAAO,YAAY5E,GACnB4E,EAAO,sBAAsB,KAAK5D;IAEtC;EACF;EAEAiE,KAA0CK,OAAK;EAAE;EACjDF,KAIY,CAACE,GAAIC,GAAIC,MAAO;EAAE;EAC9BN,KAKqB,CACnBO,GACAC,GACA1F,GACAuD,MACE;AACF,QAAIvD,KAAQuD,EACV,OAAM,IAAI,UACR,kEAAkE;AAGtE,WAAO;EACT;EAEA,CAAChB,GAAS,EAAE,YAAAQ,IAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC7C,QAAI,KAAKhC,GACP,UAAS9Q,IAAI,KAAKsR,IACZ,EAAA,CAAC,KAAKoE,GAAc1V,CAAC,OAGrB8S,KAAc,CAAC,KAAKN,GAASxS,CAAC,OAChC,MAAMA,IAEJA,MAAM,KAAKqR,OAGbrR,KAAI,KAAKoR,GAAMpR,CAAC;EAIxB;EAEA,CAACuS,GAAU,EAAE,YAAAO,IAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC9C,QAAI,KAAKhC,GACP,UAAS9Q,IAAI,KAAKqR,IACZ,EAAA,CAAC,KAAKqE,GAAc1V,CAAC,OAGrB8S,KAAc,CAAC,KAAKN,GAASxS,CAAC,OAChC,MAAMA,IAEJA,MAAM,KAAKsR,OAGbtR,KAAI,KAAKmR,GAAMnR,CAAC;EAIxB;EAEA0V,GAAcxD,GAAY;AACxB,WACEA,MAAU,UACV,KAAKlB,GAAQ,IAAI,KAAKC,GAASiB,CAAK,CAAM,MAAMA;EAEpD;EAMA,CAAC,UAAO;AACN,aAAWlS,KAAK,KAAKsS,GAAQ,EAEzB,MAAKpB,GAASlR,CAAC,MAAM,UACrB,KAAKiR,GAASjR,CAAC,MAAM,UACrB,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAEzC,MAAM,CAAC,KAAKiR,GAASjR,CAAC,GAAG,KAAKkR,GAASlR,CAAC,CAAC;EAG/C;EAQA,CAAC,WAAQ;AACP,aAAWA,KAAK,KAAKuS,GAAS,EAE1B,MAAKrB,GAASlR,CAAC,MAAM,UACrB,KAAKiR,GAASjR,CAAC,MAAM,UACrB,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAEzC,MAAM,CAAC,KAAKiR,GAASjR,CAAC,GAAG,KAAKkR,GAASlR,CAAC,CAAC;EAG/C;EAMA,CAAC,OAAI;AACH,aAAWA,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM9P,IAAI,KAAKyO,GAASjR,CAAC;AACrBwC,YAAM,UAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAMwC;IAEV;EACF;EAQA,CAAC,QAAK;AACJ,aAAWxC,KAAK,KAAKuS,GAAS,GAAI;AAChC,UAAM/P,IAAI,KAAKyO,GAASjR,CAAC;AACrBwC,YAAM,UAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAMwC;IAEV;EACF;EAMA,CAAC,SAAM;AACL,aAAWxC,KAAK,KAAKsS,GAAQ,EACjB,MAAKpB,GAASlR,CAAC,MACf,UAAa,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAM,KAAKkR,GAASlR,CAAC;EAG3B;EAQA,CAAC,UAAO;AACN,aAAWA,KAAK,KAAKuS,GAAS,EAClB,MAAKrB,GAASlR,CAAC,MACf,UAAa,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAM,KAAKkR,GAASlR,CAAC;EAG3B;EAMA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,QAAO;EACrB;EAOA,CAAC,OAAO,WAAW,IAAI;EAMvB,KACEqP,GACAsG,IAA4C,CAAA,GAAE;AAE9C,aAAW3V,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM4C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACpE,UAAIU,MAAU,UACVvG,EAAGuG,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI,EACvC,QAAO,KAAK,IAAI,KAAKiR,GAASjR,CAAC,GAAQ2V,CAAU;IAErD;EACF;EAaA,QACEtG,GACAwG,IAAa,MAAI;AAEjB,aAAW7V,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM4C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AAChEU,YAAU,UACdvG,EAAG,KAAKwG,GAAOD,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI;IACnD;EACF;EAMA,SACEqP,GACAwG,IAAa,MAAI;AAEjB,aAAW7V,KAAK,KAAKuS,GAAS,GAAI;AAChC,UAAM2C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AAChEU,YAAU,UACdvG,EAAG,KAAKwG,GAAOD,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI;IACnD;EACF;EAMA,aAAU;AACR,QAAI8V,IAAU;AACd,aAAW9V,KAAK,KAAKuS,GAAU,EAAE,YAAY,KAAI,CAAE,EAC7C,MAAKC,GAASxS,CAAC,MACjB,KAAKwU,GAAQ,KAAKvD,GAASjR,CAAC,GAAQ,QAAQ,GAC5C8V,IAAU;AAGd,WAAOA;EACT;EAcA,KAAK5B,GAAM;AACT,QAAMlU,IAAI,KAAKgR,GAAQ,IAAIkD,CAAG;AAC9B,QAAIlU,MAAM,OAAW;AACrB,QAAMkV,IAAI,KAAKhE,GAASlR,CAAC,GAGnB4V,IACJ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACxD,QAAIU,MAAU,OAAW;AAEzB,QAAMG,IAA2B,EAAE,OAAAH,EAAK;AACxC,QAAI,KAAKjE,MAAS,KAAKD,IAAS;AAC9B,UAAMe,IAAM,KAAKd,GAAM3R,CAAC,GAClBsI,IAAQ,KAAKoJ,GAAQ1R,CAAC;AAC5B,UAAIyS,KAAOnK,GAAO;AAChB,YAAM0N,IAASvD,KAAO,KAAK5B,GAAM,IAAG,IAAKvI;AACzCyN,UAAM,MAAMC,GACZD,EAAM,QAAQ,KAAK,IAAG;MACxB;IACF;AACA,WAAI,KAAKtE,OACPsE,EAAM,OAAO,KAAKtE,GAAOzR,CAAC,IAErB+V;EACT;EAeA,OAAI;AACF,QAAME,IAAgC,CAAA;AACtC,aAAWjW,KAAK,KAAKsS,GAAS,EAAE,YAAY,KAAI,CAAE,GAAG;AACnD,UAAM4B,IAAM,KAAKjD,GAASjR,CAAC,GACrBkV,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IACJ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACxD,UAAIU,MAAU,UAAa1B,MAAQ,OAAW;AAC9C,UAAM6B,IAA2B,EAAE,OAAAH,EAAK;AACxC,UAAI,KAAKjE,MAAS,KAAKD,IAAS;AAC9BqE,UAAM,MAAM,KAAKpE,GAAM3R,CAAC;AAGxB,YAAM8U,IAAM,KAAKjE,GAAM,IAAG,IAAM,KAAKa,GAAQ1R,CAAC;AAC9C+V,UAAM,QAAQ,KAAK,MAAM,KAAK,IAAG,IAAKjB,CAAG;MAC3C;AACI,WAAKrD,OACPsE,EAAM,OAAO,KAAKtE,GAAOzR,CAAC,IAE5BiW,EAAI,QAAQ,CAAC/B,GAAK6B,CAAK,CAAC;IAC1B;AACA,WAAOE;EACT;EAWA,KAAKA,GAA6B;AAChC,SAAK,MAAK;AACV,aAAW,CAAC/B,GAAK6B,CAAK,KAAKE,GAAK;AAC9B,UAAIF,EAAM,OAAO;AAOf,YAAMjB,IAAM,KAAK,IAAG,IAAKiB,EAAM;AAC/BA,UAAM,QAAQ,KAAKlF,GAAM,IAAG,IAAKiE;MACnC;AACA,WAAK,IAAIZ,GAAK6B,EAAM,OAAOA,CAAK;IAClC;EACF;EAgCA,IACEvT,GACA0S,GACAgB,IAA4C,CAAA,GAAE;AAE9C,QAAIhB,MAAM,OACR,QAAA,KAAK,OAAO1S,CAAC,GACN;AAET,QAAM,EACJ,KAAAiQ,IAAM,KAAK,KACX,OAAAnK,GACA,gBAAA4K,IAAiB,KAAK,gBACtB,iBAAAI,IAAkB,KAAK,iBACvB,QAAAqB,EAAM,IACJuB,GACA,EAAE,aAAA/C,IAAc,KAAK,YAAW,IAAK+C,GAEnCnG,IAAO,KAAKkF,GAChBzS,GACA0S,GACAgB,EAAW,QAAQ,GACnB5C,CAAe;AAIjB,QAAI,KAAK,gBAAgBvD,IAAO,KAAK,aACnC,QAAI4E,MACFA,EAAO,MAAM,QACbA,EAAO,uBAAuB,OAGhC,KAAKH,GAAQhS,GAAG,KAAK,GACd;AAET,QAAI0P,IAAQ,KAAKpB,OAAU,IAAI,SAAY,KAAKE,GAAQ,IAAIxO,CAAC;AAC7D,QAAI0P,MAAU,OAEZA,KACE,KAAKpB,OAAU,IAAI,KAAKQ,KACtB,KAAKC,GAAM,WAAW,IAAI,KAAKA,GAAM,IAAG,IACxC,KAAKT,OAAU,KAAKR,KAAO,KAAK8E,GAAO,KAAK,IAC5C,KAAKtE,IACT,KAAKG,GAASiB,CAAK,IAAI1P,GACvB,KAAK0O,GAASgB,CAAK,IAAIgD,GACvB,KAAKlE,GAAQ,IAAIxO,GAAG0P,CAAK,GACzB,KAAKf,GAAM,KAAKG,EAAK,IAAIY,GACzB,KAAKd,GAAMc,CAAK,IAAI,KAAKZ,IACzB,KAAKA,KAAQY,GACb,KAAKpB,MACL,KAAKqE,GAAajD,GAAOnC,GAAM4E,CAAM,GACjCA,MAAQA,EAAO,MAAM,QACzBxB,IAAc,OACV,KAAKnB,MACP,KAAKvB,KAAYyE,GAAQ1S,GAAG,KAAK;SAE9B;AAEL,WAAK6P,GAAYH,CAAK;AACtB,UAAMiE,IAAS,KAAKjF,GAASgB,CAAK;AAClC,UAAIgD,MAAMiB,GAAQ;AAChB,YAAI,KAAKrE,MAAmB,KAAKG,GAAmBkE,CAAM,GAAG;AAC3DA,YAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC;AACpD,cAAM,EAAE,sBAAsBtS,EAAC,IAAKsS;AAChCtS,gBAAM,UAAa,CAACqP,MAClB,KAAKrB,MACP,KAAKrB,KAAW3M,GAAQrB,GAAG,KAAK,GAE9B,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC3N,GAAQrB,GAAG,KAAK,CAAC;QAG7C,MAAY0Q,OACN,KAAKrB,MACP,KAAKrB,KAAW2F,GAAa3T,GAAG,KAAK,GAEnC,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC2E,GAAa3T,GAAG,KAAK,CAAC;AAMhD,YAHA,KAAKwS,GAAgB9C,CAAK,GAC1B,KAAKiD,GAAajD,GAAOnC,GAAM4E,CAAM,GACrC,KAAKzD,GAASgB,CAAK,IAAIgD,GACnBP,GAAQ;AACVA,YAAO,MAAM;AACb,cAAMyB,IACJD,KAAU,KAAKlE,GAAmBkE,CAAM,IACtCA,EAAO,uBACPA;AACAC,gBAAa,WAAWzB,EAAO,WAAWyB;QAChD;MACF,MAAWzB,OACTA,EAAO,MAAM;AAGX,WAAK3C,MACP,KAAK,WAAWkD,GAAQ1S,GAAG0S,MAAMiB,IAAS,WAAW,SAAS;IAElE;AAUA,QATI1D,MAAQ,KAAK,CAAC,KAAKd,MACrB,KAAKsC,GAAsB,GAEzB,KAAKtC,OACFwB,KACH,KAAKmB,GAAYpC,GAAOO,GAAKnK,CAAK,GAEhCqM,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,IAEvC,CAACgB,KAAkB,KAAKnB,MAAoB,KAAKP,IAAW;AAC9D,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;AACA,WAAO;EACT;EAMA,MAAG;AACD,QAAI;AACF,aAAO,KAAKxF,MAAO;AACjB,YAAMyF,IAAM,KAAKrF,GAAS,KAAKG,EAAK;AAEpC,YADA,KAAK+D,GAAO,IAAI,GACZ,KAAKnD,GAAmBsE,CAAG,GAAA;AAC7B,cAAIA,EAAI,qBACN,QAAOA,EAAI;QAAA,WAEJA,MAAQ,OACjB,QAAOA;MAEX;IACF,UAAA;AACE,UAAI,KAAKxE,MAAoB,KAAKP,IAAW;AAC3C,YAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,eAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;MAEhC;IACF;EACF;EAEAlB,GAAOoB,GAAa;AAClB,QAAMC,IAAO,KAAKpF,IACZ7O,IAAI,KAAKyO,GAASwF,CAAI,GACtBvB,IAAI,KAAKhE,GAASuF,CAAI;AAC5B,WAAI,KAAK3E,MAAmB,KAAKG,GAAmBiD,CAAC,IACnDA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KACrC,KAAKrD,MAAe,KAAKE,QAC9B,KAAKF,MACP,KAAKrB,KAAW0E,GAAG1S,GAAG,OAAO,GAE3B,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAG1S,GAAG,OAAO,CAAC,IAGxC,KAAKwS,GAAgByB,CAAI,GACrB,KAAK7E,KAAmB6E,CAAI,MAC9B,aAAa,KAAK7E,GAAiB6E,CAAI,CAAC,GACxC,KAAK7E,GAAiB6E,CAAI,IAAI,SAG5BD,MACF,KAAKvF,GAASwF,CAAI,IAAI,QACtB,KAAKvF,GAASuF,CAAI,IAAI,QACtB,KAAKlF,GAAM,KAAKkF,CAAI,IAElB,KAAK3F,OAAU,KACjB,KAAKO,KAAQ,KAAKC,KAAQ,GAC1B,KAAKC,GAAM,SAAS,KAEpB,KAAKF,KAAQ,KAAKF,GAAMsF,CAAI,GAE9B,KAAKzF,GAAQ,OAAOxO,CAAC,GACrB,KAAKsO,MACE2F;EACT;EAkBA,IAAIjU,GAAMkU,IAA4C,CAAA,GAAE;AACtD,QAAM,EAAE,gBAAA7D,IAAiB,KAAK,gBAAgB,QAAA8B,EAAM,IAAK+B,GACnDxE,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,QAAW;AACvB,UAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UACE,KAAKD,GAAmBiD,CAAC,KACzBA,EAAE,yBAAyB,OAE3B,QAAO;AAET,UAAK,KAAK1C,GAASN,CAAK,EASbyC,OACTA,EAAO,MAAM,SACb,KAAKD,GAAWC,GAAQzC,CAAK;UAV7B,QAAIW,KACF,KAAK4B,GAAevC,CAAK,GAEvByC,MACFA,EAAO,MAAM,OACb,KAAKD,GAAWC,GAAQzC,CAAK,IAExB;IAKX,MAAWyC,OACTA,EAAO,MAAM;AAEf,WAAO;EACT;EASA,KAAKnS,GAAMmU,IAA8C,CAAA,GAAE;AACzD,QAAM,EAAE,YAAA7D,IAAa,KAAK,WAAU,IAAK6D,GACnCzE,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,UAAc,CAACY,KAAc,KAAKN,GAASN,CAAK,EAC5D;AAEF,QAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAE7B,WAAO,KAAKD,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;EAC/D;EAEA9C,GACE5P,GACA0P,GACArQ,GACAsQ,GAAY;AAEZ,QAAM+C,IAAIhD,MAAU,SAAY,SAAY,KAAKhB,GAASgB,CAAK;AAC/D,QAAI,KAAKD,GAAmBiD,CAAC,EAC3B,QAAOA;AAGT,QAAM0B,IAAK,IAAItH,MACT,EAAE,QAAAuH,EAAM,IAAKhV;AAEnBgV,OAAQ,iBAAiB,SAAS,MAAMD,EAAG,MAAMC,EAAO,MAAM,GAAG,EAC/D,QAAQD,EAAG,OAAA,CACZ;AAED,QAAME,IAAY,EAChB,QAAQF,EAAG,QACX,SAAA/U,GACA,SAAAsQ,EAAAA,GAGI4E,IAAK,CAAC7B,GAAkB8B,IAAc,UAAwB;AAClE,UAAM,EAAE,SAAAC,EAAO,IAAKL,EAAG,QACjBM,IAAcrV,EAAQ,oBAAoBqT,MAAM,QAChDiC,IAAUtV,EAAQ,oBACtB,CAAC,EAAEA,EAAQ,0BAA0BqT,MAAM;AAU7C,UATIrT,EAAQ,WACNoV,KAAW,CAACD,KACdnV,EAAQ,OAAO,eAAe,MAC9BA,EAAQ,OAAO,aAAa+U,EAAG,OAAO,QAClCM,MAAarV,EAAQ,OAAO,oBAAoB,SAEpDA,EAAQ,OAAO,gBAAgB,OAG/BoV,KAAW,CAACC,KAAe,CAACF,EAC9B,QAAOI,EAAUR,EAAG,OAAO,QAAQO,CAAO;AAG5C,UAAME,IAAK3V,GAIL4V,IAAK,KAAKpG,GAASgB,CAAc;AACvC,cAAIoF,MAAO5V,KAAMwV,KAAeF,KAAeM,MAAO,YAChDpC,MAAM,SACJmC,EAAG,yBAAyB,SAC9B,KAAKnG,GAASgB,CAAc,IAAImF,EAAG,uBAEnC,KAAK7C,GAAQhS,GAAG,OAAO,KAGrBX,EAAQ,WAAQA,EAAQ,OAAO,eAAe,OAClD,KAAK,IAAIW,GAAG0S,GAAG4B,EAAU,OAAO,KAG7B5B;IACT,GAEMqC,IAAMC,QACN3V,EAAQ,WACVA,EAAQ,OAAO,gBAAgB,MAC/BA,EAAQ,OAAO,aAAa2V,IAGvBJ,EAAUI,GAAI,KAAK,IAGtBJ,IAAY,CAACI,GAASL,MAAmC;AAC7D,UAAM,EAAE,SAAAF,EAAO,IAAKL,EAAG,QACjBa,IAAoBR,KAAWpV,EAAQ,wBACvCiR,IACJ2E,KAAqB5V,EAAQ,4BACzB6V,IAAW5E,KAAcjR,EAAQ,0BACjCwV,IAAK3V;AAgBX,UAfI,KAAKwP,GAASgB,CAAc,MAAMxQ,MAGxB,CAACgW,KACX,CAACP,KAAWE,EAAG,yBAAyB,SAExC,KAAK7C,GAAQhS,GAAG,OAAO,IACbiV,MAKV,KAAKvG,GAASgB,CAAc,IAAImF,EAAG,wBAGnCvE,EACF,QAAIjR,EAAQ,UAAUwV,EAAG,yBAAyB,WAChDxV,EAAQ,OAAO,gBAAgB,OAE1BwV,EAAG;AACL,UAAIA,EAAG,eAAeA,EAC3B,OAAMG;IAEV,GAEMG,IAAQ,CACZC,GACAC,MACE;AACF,UAAMC,IAAM,KAAKnH,KAAenO,GAAG0S,GAAG4B,CAAS;AAC3CgB,WAAOA,aAAe,WACxBA,EAAI,KAAK5C,OAAK0C,EAAI1C,MAAM,SAAY,SAAYA,CAAC,GAAG2C,CAAG,GAKzDjB,EAAG,OAAO,iBAAiB,SAAS,MAAK;AAAA,SACnC,CAAC/U,EAAQ,oBAAoBA,EAAQ,4BACvC+V,EAAI,MAAS,GAET/V,EAAQ,2BACV+V,IAAM1C,OAAK6B,EAAG7B,GAAG,IAAI;MAG3B,CAAC;IACH;AAEIrT,MAAQ,WAAQA,EAAQ,OAAO,kBAAkB;AACrD,QAAMH,IAAI,IAAI,QAAQiW,CAAK,EAAE,KAAKZ,GAAIQ,CAAE,GAClCF,IAAyB,OAAO,OAAO3V,GAAG,EAC9C,mBAAmBkV,GACnB,sBAAsB1B,GACtB,YAAY,OAAA,CACb;AAED,WAAIhD,MAAU,UAEZ,KAAK,IAAI1P,GAAG6U,GAAI,EAAE,GAAGP,EAAU,SAAS,QAAQ,OAAS,CAAE,GAC3D5E,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,KAE1B,KAAK0O,GAASgB,CAAK,IAAImF,GAElBA;EACT;EAEApF,GAAmBvQ,GAAM;AACvB,QAAI,CAAC,KAAKoQ,GAAiB,QAAO;AAClC,QAAM7S,IAAIyC;AACV,WACE,CAAC,CAACzC,KACFA,aAAa,WACbA,EAAE,eAAe,sBAAsB,KACvCA,EAAE,6BAA6BqQ;EAEnC;EAyGA,MAAM,MACJ9M,GACAuV,IAAgD,CAAA,GAAE;AAElD,QAAM,EAEJ,YAAAjF,IAAa,KAAK,YAClB,gBAAAF,IAAiB,KAAK,gBACtB,oBAAAc,IAAqB,KAAK,oBAE1B,KAAAjB,IAAM,KAAK,KACX,gBAAAS,IAAiB,KAAK,gBACtB,MAAAnD,IAAO,GACP,iBAAAuD,IAAkB,KAAK,iBACvB,aAAAH,IAAc,KAAK,aAEnB,0BAAAM,IAA2B,KAAK,0BAChC,4BAAAE,IAA6B,KAAK,4BAClC,kBAAAE,IAAmB,KAAK,kBACxB,wBAAAD,IAAyB,KAAK,wBAC9B,SAAAzB,GACA,cAAA6F,IAAe,OACf,QAAArD,GACA,QAAAkC,EAAM,IACJkB;AAEJ,QAAI,CAAC,KAAKjG,GACR,QAAI6C,MAAQA,EAAO,QAAQ,QACpB,KAAK,IAAInS,GAAG,EACjB,YAAAsQ,GACA,gBAAAF,GACA,oBAAAc,GACA,QAAAiB,EAAAA,CACD;AAGH,QAAM9S,IAAU,EACd,YAAAiR,GACA,gBAAAF,GACA,oBAAAc,GACA,KAAAjB,GACA,gBAAAS,GACA,MAAAnD,GACA,iBAAAuD,GACA,aAAAH,GACA,0BAAAM,GACA,4BAAAE,GACA,wBAAAC,GACA,kBAAAC,GACA,QAAAc,GACA,QAAAkC,EAAAA,GAGE3E,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAC9B,QAAI0P,MAAU,QAAW;AACnByC,YAAQA,EAAO,QAAQ;AAC3B,UAAMjT,IAAI,KAAK0Q,GAAiB5P,GAAG0P,GAAOrQ,GAASsQ,CAAO;AAC1D,aAAQzQ,EAAE,aAAaA;IACzB,OAAO;AAEL,UAAMwT,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UAAI,KAAKD,GAAmBiD,CAAC,GAAG;AAC9B,YAAM+C,IAAQnF,KAAcoC,EAAE,yBAAyB;AACvD,eAAIP,MACFA,EAAO,QAAQ,YACXsD,MAAOtD,EAAO,gBAAgB,QAE7BsD,IAAQ/C,EAAE,uBAAwBA,EAAE,aAAaA;MAC1D;AAIA,UAAMgD,IAAU,KAAK1F,GAASN,CAAK;AACnC,UAAI,CAAC8F,KAAgB,CAACE,EACpB,QAAIvD,MAAQA,EAAO,QAAQ,QAC3B,KAAKtC,GAAYH,CAAK,GAClBU,KACF,KAAK6B,GAAevC,CAAK,GAEvByC,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,GAClCgD;AAKT,UAAMxT,IAAI,KAAK0Q,GAAiB5P,GAAG0P,GAAOrQ,GAASsQ,CAAO,GAEpDgG,IADWzW,EAAE,yBAAyB,UACfoR;AAC7B,aAAI6B,MACFA,EAAO,QAAQuD,IAAU,UAAU,WAC/BC,KAAYD,MAASvD,EAAO,gBAAgB,QAE3CwD,IAAWzW,EAAE,uBAAwBA,EAAE,aAAaA;IAC7D;EACF;EA8BA,MAAM,WACJc,GACAuV,IAAgD,CAAA,GAAE;AAElD,QAAM7C,IAAI,MAAM,KAAK,MACnB1S,GACAuV,CAE4C;AAE9C,QAAI7C,MAAM,OAAW,OAAM,IAAI,MAAM,4BAA4B;AACjE,WAAOA;EACT;EA+BA,KAAK1S,GAAM4V,IAA8C,CAAA,GAAE;AACzD,QAAM5E,IAAa,KAAK5C;AACxB,QAAI,CAAC4C,EACH,OAAM,IAAI,MAAM,uCAAuC;AAEzD,QAAM,EAAE,SAAArB,GAAS,cAAA6F,GAAc,GAAGnW,EAAO,IAAKuW,GACxClD,IAAI,KAAK,IAAI1S,GAAGX,CAAO;AAC7B,QAAI,CAACmW,KAAgB9C,MAAM,OAAW,QAAOA;AAC7C,QAAMmD,IAAK7E,EAAWhR,GAAG0S,GAAG,EAC1B,SAAArT,GACA,SAAAsQ,EAAAA,CACqC;AACvC,WAAA,KAAK,IAAI3P,GAAG6V,GAAIxW,CAAO,GAChBwW;EACT;EAQA,IAAI7V,GAAMmT,IAA4C,CAAA,GAAE;AACtD,QAAM,EACJ,YAAA7C,IAAa,KAAK,YAClB,gBAAAF,IAAiB,KAAK,gBACtB,oBAAAc,IAAqB,KAAK,oBAC1B,QAAAiB,EAAM,IACJgB,GACEzD,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,QAAW;AACvB,UAAM0D,IAAQ,KAAK1E,GAASgB,CAAK,GAC3BoG,IAAW,KAAKrG,GAAmB2D,CAAK;AAE9C,aADIjB,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,GACrC,KAAKM,GAASN,CAAK,KACjByC,MAAQA,EAAO,MAAM,UAEpB2D,KAQD3D,KACA7B,KACA8C,EAAM,yBAAyB,WAE/BjB,EAAO,gBAAgB,OAElB7B,IAAa8C,EAAM,uBAAuB,WAb5ClC,KACH,KAAKc,GAAQhS,GAAG,QAAQ,GAEtBmS,KAAU7B,MAAY6B,EAAO,gBAAgB,OAC1C7B,IAAa8C,IAAQ,YAY1BjB,MAAQA,EAAO,MAAM,QAMrB2D,IACK1C,EAAM,wBAEf,KAAKvD,GAAYH,CAAK,GAClBU,KACF,KAAK6B,GAAevC,CAAK,GAEpB0D;IAEX,MAAWjB,OACTA,EAAO,MAAM;EAEjB;EAEA4D,GAAS7W,GAAUoB,GAAQ;AACzB,SAAKsO,GAAMtO,CAAC,IAAIpB,GAChB,KAAKyP,GAAMzP,CAAC,IAAIoB;EAClB;EAEAuP,GAAYH,GAAY;AASlBA,UAAU,KAAKZ,OACbY,MAAU,KAAKb,KACjB,KAAKA,KAAQ,KAAKF,GAAMe,CAAK,IAE7B,KAAKqG,GACH,KAAKnH,GAAMc,CAAK,GAChB,KAAKf,GAAMe,CAAK,CAAU,GAG9B,KAAKqG,GAAS,KAAKjH,IAAOY,CAAK,GAC/B,KAAKZ,KAAQY;EAEjB;EAOA,OAAO1P,GAAI;AACT,WAAO,KAAKgS,GAAQhS,GAAG,QAAQ;EACjC;EAEAgS,GAAQhS,GAAMiN,GAA8B;AAC1C,QAAIqG,IAAU;AACd,QAAI,KAAKhF,OAAU,GAAG;AACpB,UAAMoB,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,UAAI0P,MAAU,OAMZ,KALI,KAAKN,KAAmBM,CAAK,MAC/B,aAAa,KAAKN,KAAmBM,CAAK,CAAC,GAC3C,KAAKN,GAAiBM,CAAK,IAAI,SAEjC4D,IAAU,MACN,KAAKhF,OAAU,EACjB,MAAK0H,GAAO/I,CAAM;WACb;AACL,aAAKuF,GAAgB9C,CAAK;AAC1B,YAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAc7B,YAbI,KAAKD,GAAmBiD,CAAC,IAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KACrC,KAAKrD,MAAe,KAAKE,QAC9B,KAAKF,MACP,KAAKrB,KAAW0E,GAAQ1S,GAAGiN,CAAM,GAE/B,KAAKsC,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAQ1S,GAAGiN,CAAM,CAAC,IAG5C,KAAKuB,GAAQ,OAAOxO,CAAC,GACrB,KAAKyO,GAASiB,CAAK,IAAI,QACvB,KAAKhB,GAASgB,CAAK,IAAI,QACnBA,MAAU,KAAKZ,GACjB,MAAKA,KAAQ,KAAKF,GAAMc,CAAK;iBACpBA,MAAU,KAAKb,GACxB,MAAKA,KAAQ,KAAKF,GAAMe,CAAK;aACxB;AACL,cAAMhE,IAAK,KAAKkD,GAAMc,CAAK;AAC3B,eAAKf,GAAMjD,CAAE,IAAI,KAAKiD,GAAMe,CAAK;AACjC,cAAMuG,IAAK,KAAKtH,GAAMe,CAAK;AAC3B,eAAKd,GAAMqH,CAAE,IAAI,KAAKrH,GAAMc,CAAK;QACnC;AACA,aAAKpB,MACL,KAAKS,GAAM,KAAKW,CAAK;MACvB;IAEJ;AACA,QAAI,KAAKH,MAAoB,KAAKP,IAAW,QAAQ;AACnD,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;AACA,WAAOR;EACT;EAKA,QAAK;AACH,WAAO,KAAK0C,GAAO,QAAQ;EAC7B;EACAA,GAAO/I,GAA8B;AACnC,aAAWyC,KAAS,KAAKK,GAAU,EAAE,YAAY,KAAI,CAAE,GAAG;AACxD,UAAM2C,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UAAI,KAAKD,GAAmBiD,CAAC,EAC3BA,GAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;WACzC;AACL,YAAM1S,IAAI,KAAKyO,GAASiB,CAAK;AACzB,aAAKL,MACP,KAAKrB,KAAW0E,GAAQ1S,GAAQiN,CAAM,GAEpC,KAAKsC,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAQ1S,GAAQiN,CAAM,CAAC;MAEjD;IACF;AAKA,QAHA,KAAKuB,GAAQ,MAAK,GAClB,KAAKE,GAAS,KAAK,MAAS,GAC5B,KAAKD,GAAS,KAAK,MAAS,GACxB,KAAKU,MAAS,KAAKD,IAAS;AAC9B,WAAKC,GAAM,KAAK,CAAC,GACjB,KAAKD,GAAQ,KAAK,CAAC;AACnB,eAAW6C,KAAK,KAAK3C,MAAoB,CAAA,EACnC2C,OAAM,UAAW,aAAaA,CAAC;AAErC,WAAK3C,IAAkB,KAAK,MAAS;IACvC;AASA,QARI,KAAKH,MACP,KAAKA,GAAO,KAAK,CAAC,GAEpB,KAAKJ,KAAQ,GACb,KAAKC,KAAQ,GACb,KAAKC,GAAM,SAAS,GACpB,KAAKR,KAAkB,GACvB,KAAKD,KAAQ,GACT,KAAKiB,MAAoB,KAAKP,IAAW;AAC3C,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;EACF;AAAA;AEz4FF,IAAMoC,KACJ,OAAO,WAAY,YAAY,UAC3B,UACA,EACE,QAAQ,MACR,QAAQ,KAAA;AALhB,IAsBaC,KACX9U,CAAAA,OAEA,CAAC,CAACA,MACF,OAAOA,MAAM,aACZA,cAAa+U,KACZ/U,cAAagV,mBAAAA,WACbC,GAAWjV,EAAC,KACZkV,GAAWlV,EAAC;AA9BhB,IAmCaiV,KAAcjV,CAAAA,OACzB,CAAC,CAACA,MACF,OAAOA,MAAM,YACbA,cAAamV,mBAAAA,gBACb,OAAQnV,GAAwB,QAAS,cAExCA,GAAwB,SAASgV,mBAAAA,QAAO,SAAS,UAAU;AAzC9D,IA8CaE,KAAclV,CAAAA,OACzB,CAAC,CAACA,MACF,OAAOA,MAAM,YACbA,cAAamV,mBAAAA,gBACb,OAAQnV,GAAwB,SAAU,cAC1C,OAAQA,GAAwB,OAAQ;AAnD1C,IAqDMoV,IAAM,uBAAO,KAAK;AArDxB,IAsDMC,IAAiB,uBAAO,cAAc;AAtD5C,IAuDMC,IAAc,uBAAO,YAAY;AAvDvC,IAwDMC,KAAe,uBAAO,aAAa;AAxDzC,IAyDMC,KAAgB,uBAAO,cAAc;AAzD3C,IA0DMC,KAAS,uBAAO,QAAQ;AA1D9B,IA2DMC,KAAO,uBAAO,MAAM;AA3D1B,IA4DMC,KAAQ,uBAAO,OAAO;AA5D5B,IA6DMC,KAAa,uBAAO,YAAY;AA7DtC,IA8DMC,IAAW,uBAAO,UAAU;AA9DlC,IA+DMC,KAAU,uBAAO,SAAS;AA/DhC,IAgEMC,IAAU,uBAAO,SAAS;AAhEhC,IAiEMC,KAAS,uBAAO,QAAQ;AAjE9B,IAkEMC,KAAS,uBAAO,QAAQ;AAlE9B,IAmEMC,IAAS,uBAAO,QAAQ;AAnE9B,IAoEMC,IAAQ,uBAAO,OAAO;AApE5B,IAqEMC,IAAe,uBAAO,cAAc;AArE1C,IAsEMC,KAAa,uBAAO,YAAY;AAtEtC,IAuEMC,KAAc,uBAAO,aAAa;AAvExC,IAwEMC,IAAa,uBAAO,YAAY;AAxEtC,IA0EMC,IAAY,uBAAO,WAAW;AA1EpC,IA4EMC,KAAQ,uBAAO,OAAO;AA5E5B,IA6EMC,KAAW,uBAAO,UAAU;AA7ElC,IA8EMC,KAAU,uBAAO,SAAS;AA9EhC,IA+EMC,KAAW,uBAAO,UAAU;AA/ElC,IAgFMC,IAAQ,uBAAO,OAAO;AAhF5B,IAiFMC,KAAQ,uBAAO,OAAO;AAjF5B,IAkFMC,KAAU,uBAAO,SAAS;AAlFhC,IAmFMC,KAAS,uBAAO,QAAQ;AAnF9B,IAoFMC,IAAgB,uBAAO,eAAe;AApF5C,IAqFMC,IAAY,uBAAO,WAAW;AArFpC,IAuFMC,KAAS3L,CAAAA,OAA6B,QAAQ,QAAO,EAAG,KAAKA,EAAE;AAvFrE,IAwFM4L,KAAW5L,CAAAA,OAA6BA,GAAE;AAxFhD,IA8FM6L,KAAYC,CAAAA,OAChBA,OAAO,SAASA,OAAO,YAAYA,OAAO;AA/F5C,IAiGMC,KAAqBnc,CAAAA,OACzBA,cAAa,eACZ,CAAC,CAACA,MACD,OAAOA,MAAM,YACbA,GAAE,eACFA,GAAE,YAAY,SAAS,iBACvBA,GAAE,cAAc;AAvGpB,IAyGMoc,KAAqBpc,CAAAA,OACzB,CAAC,OAAO,SAASA,EAAC,KAAK,YAAY,OAAOA,EAAC;AA1G7C,IA+HMqc,KAAN,MAAU;EACR;EACA;EACA;EACA;EACA,YACEnT,GACAoT,GACAC,GACA;AACA,SAAK,MAAMrT,GACX,KAAK,OAAOoT,GACZ,KAAK,OAAOC,GACZ,KAAK,UAAU,MAAMrT,EAAI2R,EAAM,EAAC,GAChC,KAAK,KAAK,GAAG,SAAS,KAAK,OAAO;EAAC;EAErC,SAAS;AACP,SAAK,KAAK,eAAe,SAAS,KAAK,OAAO;EAAC;EAIjD,YAAY2B,GAAU;EAAC;EAEvB,MAAM;AACJ,SAAK,OAAM,GACP,KAAK,KAAK,OAAK,KAAK,KAAK,IAAG;EAAE;AAAA;AAxJtC,IAkKMC,KAAN,cAAiCJ,GAAO;EACtC,SAAS;AACP,SAAK,IAAI,eAAe,SAAS,KAAK,WAAW,GACjD,MAAM,OAAM;EAAE;EAEhB,YACEnT,GACAoT,GACAC,GACA;AACA,UAAMrT,GAAKoT,GAAMC,CAAI,GACrB,KAAK,cAAehE,OAAc,KAAK,KAAK,KAAK,SAASA,CAAE,GAC5DrP,EAAI,GAAG,SAAS,KAAK,WAAW;EAAC;AAAA;AA9KrC,IA6TMwT,KACJC,CAAAA,OACoC,CAAC,CAACA,GAAE;AA/T1C,IAiUMC,KACJD,CAAAA,OAEA,CAACA,GAAE,cAAc,CAAC,CAACA,GAAE,YAAYA,GAAE,aAAa;AApUlD,IAiVahD,IAAP,cAOII,mBAAAA,aAAY;EAGpB,CAACY,CAAO,IAAa;EACrB,CAACC,EAAM,IAAa;EACpB,CAACG,CAAK,IAAmB,CAAA;EACzB,CAACD,CAAM,IAAa,CAAA;EACpB,CAACK,CAAU;EACX,CAACV,CAAQ;EACT,CAACgB,CAAK;EACN,CAACf,EAAO;EACR,CAACV,CAAG,IAAa;EACjB,CAACE,CAAW,IAAa;EACzB,CAACC,EAAY,IAAa;EAC1B,CAACE,EAAM,IAAa;EACpB,CAACD,EAAa,IAAa;EAC3B,CAACY,CAAY,IAAY;EACzB,CAACI,CAAS,IAAa;EACvB,CAACQ,EAAM;EACP,CAACD,EAAO,IAAa;EACrB,CAACE,CAAa,IAAY;EAC1B,CAACC,CAAS,IAAa;EAKvB,WAAoB;EAIpB,WAAoB;EAQpB,eACK9O,GAKH;AACA,QAAMpK,IAAoCoK,EAAK,CAAC,KAC9C,CAAA;AAEF,QADA,MAAK,GACDpK,EAAQ,cAAc,OAAOA,EAAQ,YAAa,SACpD,OAAM,IAAI,UACR,kDAAkD;AAGlD8Z,OAAoB9Z,CAAO,KAC7B,KAAKuY,CAAU,IAAI,MACnB,KAAKV,CAAQ,IAAI,QACRmC,GAAkBha,CAAO,KAClC,KAAK6X,CAAQ,IAAI7X,EAAQ,UACzB,KAAKuY,CAAU,IAAI,UAEnB,KAAKA,CAAU,IAAI,OACnB,KAAKV,CAAQ,IAAI,OAEnB,KAAKgB,CAAK,IAAI,CAAC,CAAC7Y,EAAQ,OACxB,KAAK8X,EAAO,IAAI,KAAKD,CAAQ,IACxB,IAAIoC,2BAAAA,cAAc,KAAKpC,CAAQ,CAAC,IACjC,MAGA7X,KAAWA,EAAQ,sBAAsB,QAC3C,OAAO,eAAe,MAAM,UAAU,EAAE,KAAK,MAAM,KAAKkY,CAAM,EAAC,CAAE,GAG/DlY,KAAWA,EAAQ,qBAAqB,QAC1C,OAAO,eAAe,MAAM,SAAS,EAAE,KAAK,MAAM,KAAKmY,CAAK,EAAC,CAAE;AAGjE,QAAM,EAAE,QAAAnD,EAAM,IAAKhV;AACfgV,UACF,KAAKgE,EAAM,IAAIhE,GACXA,EAAO,UACT,KAAK8D,EAAK,EAAC,IAEX9D,EAAO,iBAAiB,SAAS,MAAM,KAAK8D,EAAK,EAAC,CAAE;EAEvD;EAYH,IAAI,eAAe;AACjB,WAAO,KAAKV,CAAY;EAAC;EAM3B,IAAI,WAAW;AACb,WAAO,KAAKP,CAAQ;EAAC;EAMvB,IAAI,SAASqC,GAAM;AACjB,UAAM,IAAI,MAAM,4CAA4C;EAAC;EAM/D,YAAYA,GAAyB;AACnC,UAAM,IAAI,MAAM,4CAA4C;EAAC;EAM/D,IAAI,aAAa;AACf,WAAO,KAAK3B,CAAU;EAAC;EAMzB,IAAI,WAAW4B,GAAK;AAClB,UAAM,IAAI,MAAM,8CAA8C;EAAC;EAMjE,IAAK,QAAoB;AACvB,WAAO,KAAKtB,CAAK;EAAC;EASpB,IAAK,MAAS1b,GAAY;AACxB,SAAK0b,CAAK,IAAI,KAAKA,CAAK,KAAK,CAAC,CAAC1b;EAAC;EAIlC,CAAC2b,EAAK,IAAI;AACR,SAAKC,EAAO,IAAI,MAChB,KAAK,KAAK,SAAS,KAAKC,EAAM,GAAG,MAAM,GACvC,KAAK,QAAQ,KAAKA,EAAM,GAAG,MAAM;EAAC;EAMpC,IAAI,UAAU;AACZ,WAAO,KAAKD,EAAO;EAAC;EAMtB,IAAI,QAAQxS,GAAG;EAAC;EA0BhB,MACE6T,GACAC,GACAnF,GACS;AACT,QAAI,KAAK6D,EAAO,EAAG,QAAO;AAC1B,QAAI,KAAK3B,CAAG,EAAG,OAAM,IAAI,MAAM,iBAAiB;AAEhD,QAAI,KAAKoB,CAAS,EAChB,QAAA,KAAK,KACH,SACA,OAAO,OACL,IAAI,MAAM,gDAAgD,GAC1D,EAAE,MAAM,uBAAsB,CAAE,CACjC,GAEI;AAGL,WAAO6B,KAAa,eACtBnF,IAAKmF,GACLA,IAAW,SAGRA,MAAUA,IAAW;AAE1B,QAAM7M,IAAK,KAAKqL,CAAK,IAAIM,KAAQC;AAMjC,QAAI,CAAC,KAAKb,CAAU,KAAK,CAAC,OAAO,SAAS6B,CAAK,GAAA;AAC7C,UAAIZ,GAAkBY,CAAK,EAEzBA,KAAQ,OAAO,KACbA,EAAM,QACNA,EAAM,YACNA,EAAM,UAAU;eAETb,GAAkBa,CAAK,EAEhCA,KAAQ,OAAO,KAAKA,CAAK;eAChB,OAAOA,KAAU,SAC1B,OAAM,IAAI,MACR,sDAAsD;IAAA;AAO5D,WAAI,KAAK7B,CAAU,KAGb,KAAKR,CAAO,KAAK,KAAKK,CAAY,MAAM,KAAG,KAAKT,EAAK,EAAE,IAAI,GAG3D,KAAKI,CAAO,IAAG,KAAK,KAAK,QAAQqC,CAAyB,IACzD,KAAK/B,EAAU,EAAE+B,CAAyB,GAE3C,KAAKhC,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAE9ClD,KAAI1H,EAAG0H,CAAE,GAEN,KAAK6C,CAAO,KAKfqC,EAAkC,UAStC,OAAOA,KAAU,YAEjB,EAAEC,MAAa,KAAKxC,CAAQ,KAAK,CAAC,KAAKC,EAAO,GAAG,cAGjDsC,IAAQ,OAAO,KAAKA,GAAOC,CAAQ,IAGjC,OAAO,SAASD,CAAK,KAAK,KAAKvC,CAAQ,MAEzCuC,IAAQ,KAAKtC,EAAO,EAAE,MAAMsC,CAAK,IAI/B,KAAKrC,CAAO,KAAK,KAAKK,CAAY,MAAM,KAAG,KAAKT,EAAK,EAAE,IAAI,GAE3D,KAAKI,CAAO,IAAG,KAAK,KAAK,QAAQqC,CAAyB,IACzD,KAAK/B,EAAU,EAAE+B,CAAyB,GAE3C,KAAKhC,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAE9ClD,KAAI1H,EAAG0H,CAAE,GAEN,KAAK6C,CAAO,MA/Bb,KAAKK,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAC9ClD,KAAI1H,EAAG0H,CAAE,GACN,KAAK6C,CAAO;EA6BD;EAgBtB,KAAK9W,GAAiC;AACpC,QAAI,KAAKuX,CAAS,EAAG,QAAO;AAG5B,QAFA,KAAKU,CAAS,IAAI,OAGhB,KAAKd,CAAY,MAAM,KACvBnX,MAAM,KACLA,KAAKA,IAAI,KAAKmX,CAAY,EAE3B,QAAA,KAAKf,CAAc,EAAC,GACb;AAGL,SAAKkB,CAAU,MAAGtX,IAAI,OAEtB,KAAKiX,CAAM,EAAE,SAAS,KAAK,CAAC,KAAKK,CAAU,MAG7C,KAAKL,CAAM,IAAI,CACZ,KAAKL,CAAQ,IACV,KAAKK,CAAM,EAAE,KAAK,EAAE,IACpB,OAAO,OACL,KAAKA,CAAM,GACX,KAAKE,CAAY,CAAC,CAAA;AAK5B,QAAM9S,IAAM,KAAKoS,EAAI,EAAEzW,KAAK,MAAM,KAAKiX,CAAM,EAAE,CAAC,CAAU;AAC1D,WAAA,KAAKb,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACoS,EAAI,EAAEzW,GAAkBmZ,GAAc;AACrC,QAAI,KAAK7B,CAAU,EAAG,MAAKD,EAAW,EAAC;SAClC;AACH,UAAM9W,IAAI4Y;AACNnZ,YAAMO,EAAE,UAAUP,MAAM,OAAM,KAAKqX,EAAW,EAAC,IAC1C,OAAO9W,KAAM,YACpB,KAAK0W,CAAM,EAAE,CAAC,IAAI1W,EAAE,MAAMP,CAAC,GAC3BmZ,IAAQ5Y,EAAE,MAAM,GAAGP,CAAC,GACpB,KAAKmX,CAAY,KAAKnX,MAEtB,KAAKiX,CAAM,EAAE,CAAC,IAAI1W,EAAE,SAASP,CAAC,GAC9BmZ,IAAQ5Y,EAAE,SAAS,GAAGP,CAAC,GACvB,KAAKmX,CAAY,KAAKnX;IAE1B;AAEA,WAAA,KAAK,KAAK,QAAQmZ,CAAK,GAEnB,CAAC,KAAKlC,CAAM,EAAE,UAAU,CAAC,KAAKd,CAAG,KAAG,KAAK,KAAK,OAAO,GAElDgD;EAAK;EAWd,IACEA,GACAC,GACAnF,GACM;AACN,WAAI,OAAOkF,KAAU,eACnBlF,IAAKkF,GACLA,IAAQ,SAEN,OAAOC,KAAa,eACtBnF,IAAKmF,GACLA,IAAW,SAETD,MAAU,UAAW,KAAK,MAAMA,GAAOC,CAAQ,GAC/CnF,KAAI,KAAK,KAAK,OAAOA,CAAE,GAC3B,KAAKkC,CAAG,IAAI,MACZ,KAAK,WAAW,QAMZ,KAAKW,CAAO,KAAK,CAAC,KAAKC,EAAM,MAAG,KAAKX,CAAc,EAAC,GACjD;EAAI;EAIb,CAACY,EAAM,IAAI;AACL,SAAKO,CAAS,MAEd,CAAC,KAAKS,CAAa,KAAK,CAAC,KAAKd,CAAK,EAAE,WACvC,KAAKe,CAAS,IAAI,OAEpB,KAAKlB,EAAM,IAAI,OACf,KAAKD,CAAO,IAAI,MAChB,KAAK,KAAK,QAAQ,GACd,KAAKG,CAAM,EAAE,SAAQ,KAAKP,EAAK,EAAC,IAC3B,KAAKP,CAAG,IAAG,KAAKC,CAAc,EAAC,IACnC,KAAK,KAAK,OAAO;EAAC;EAYzB,SAAS;AACP,WAAO,KAAKY,EAAM,EAAC;EAAE;EAMvB,QAAQ;AACN,SAAKF,CAAO,IAAI,OAChB,KAAKC,EAAM,IAAI,MACf,KAAKkB,CAAS,IAAI;EAAK;EAMzB,IAAI,YAAY;AACd,WAAO,KAAKV,CAAS;EAAC;EAOxB,IAAI,UAAU;AACZ,WAAO,KAAKT,CAAO;EAAC;EAMtB,IAAI,SAAS;AACX,WAAO,KAAKC,EAAM;EAAC;EAGrB,CAACK,EAAU,EAAE+B,GAAc;AACrB,SAAK7B,CAAU,IAAG,KAAKH,CAAY,KAAK,IACvC,KAAKA,CAAY,KAAMgC,EAAkC,QAC9D,KAAKlC,CAAM,EAAE,KAAKkC,CAAK;EAAC;EAG1B,CAAC9B,EAAW,IAAW;AACrB,WAAI,KAAKC,CAAU,IAAG,KAAKH,CAAY,KAAK,IAE1C,KAAKA,CAAY,KACf,KAAKF,CAAM,EAAE,CAAC,EACd,QACG,KAAKA,CAAM,EAAE,MAAK;EAAW;EAGtC,CAACP,EAAK,EAAE2C,IAAmB,OAAO;AAChC;AAAG;WACD,KAAK1C,EAAU,EAAE,KAAKU,EAAW,EAAC,CAAE,KACpC,KAAKJ,CAAM,EAAE;AAGX,KAACoC,KAAW,CAAC,KAAKpC,CAAM,EAAE,UAAU,CAAC,KAAKd,CAAG,KAAG,KAAK,KAAK,OAAO;EAAC;EAGxE,CAACQ,EAAU,EAAEwC,GAAc;AACzB,WAAA,KAAK,KAAK,QAAQA,CAAK,GAChB,KAAKrC,CAAO;EAAC;EAQtB,KAAkC2B,GAASC,GAAuB;AAChE,QAAI,KAAKnB,CAAS,EAAG,QAAOkB;AAC5B,SAAKR,CAAS,IAAI;AAElB,QAAMqB,IAAQ,KAAKjD,CAAW;AAC9B,WAAAqC,IAAOA,KAAQ,CAAA,GACXD,MAAS7C,GAAK,UAAU6C,MAAS7C,GAAK,SAAQ8C,EAAK,MAAM,QACxDA,EAAK,MAAMA,EAAK,QAAQ,OAC7BA,EAAK,cAAc,CAAC,CAACA,EAAK,aAGtBY,IACEZ,EAAK,OAAKD,EAAK,IAAG,KAItB,KAAKvB,CAAK,EAAE,KACTwB,EAAK,cAEF,IAAIE,GAAuB,MAAyBH,GAAMC,CAAI,IAD9D,IAAIF,GAAY,MAAyBC,GAAMC,CAAI,CACY,GAEjE,KAAKd,CAAK,IAAGM,GAAM,MAAM,KAAKlB,EAAM,EAAC,CAAE,IACtC,KAAKA,EAAM,EAAC,IAGZyB;EAAI;EAWb,OAAoCA,GAAS;AAC3C,QAAM7Z,IAAI,KAAKsY,CAAK,EAAE,KAAKtY,OAAKA,EAAE,SAAS6Z,CAAI;AAC3C7Z,UACE,KAAKsY,CAAK,EAAE,WAAW,KACrB,KAAKJ,CAAO,KAAK,KAAKkB,CAAa,MAAM,MAC3C,KAAKlB,CAAO,IAAI,QAElB,KAAKI,CAAK,IAAI,CAAA,KACT,KAAKA,CAAK,EAAE,OAAO,KAAKA,CAAK,EAAE,QAAQtY,CAAC,GAAG,CAAC,GACnDA,EAAE,OAAM;EACT;EAMH,YACEyZ,GACAkB,GACM;AACN,WAAO,KAAK,GAAGlB,GAAIkB,CAAO;EAAC;EAoB7B,GACElB,GACAkB,GACM;AACN,QAAMlV,IAAM,MAAM,GAChBgU,GACAkB,CAA+B;AAEjC,QAAIlB,MAAO,OACT,MAAKJ,CAAS,IAAI,OAClB,KAAKD,CAAa,KACd,CAAC,KAAKd,CAAK,EAAE,UAAU,CAAC,KAAKJ,CAAO,KACtC,KAAKE,EAAM,EAAC;aAELqB,MAAO,cAAc,KAAKlB,CAAY,MAAM,EACrD,OAAM,KAAK,UAAU;aACZiB,GAASC,CAAE,KAAK,KAAKhC,CAAW,EACzC,OAAM,KAAKgC,CAAE,GACb,KAAK,mBAAmBA,CAAE;aACjBA,MAAO,WAAW,KAAK9B,EAAa,GAAG;AAChD,UAAMiD,IAAID;AACN,WAAK3B,CAAK,IAAGM,GAAM,MAAMsB,EAAE,KAAK,MAAM,KAAKjD,EAAa,CAAC,CAAC,IACzDiD,EAAE,KAAK,MAAM,KAAKjD,EAAa,CAAC;IACvC;AACA,WAAOlS;EAAG;EAMZ,eACEgU,GACAkB,GACA;AACA,WAAO,KAAK,IAAIlB,GAAIkB,CAAO;EAAC;EAW9B,IACElB,GACAkB,GACA;AACA,QAAMlV,IAAM,MAAM,IAChBgU,GACAkB,CAA+B;AAKjC,WAAIlB,MAAO,WACT,KAAKL,CAAa,IAAI,KAAK,UAAU,MAAM,EAAE,QAE3C,KAAKA,CAAa,MAAM,KACxB,CAAC,KAAKC,CAAS,KACf,CAAC,KAAKf,CAAK,EAAE,WAEb,KAAKJ,CAAO,IAAI,SAGbzS;EAAG;EAWZ,mBAA+CgU,GAAY;AACzD,QAAMhU,IAAM,MAAM,mBAAmBgU,CAAiC;AACtE,YAAIA,MAAO,UAAUA,MAAO,YAC1B,KAAKL,CAAa,IAAI,GAClB,CAAC,KAAKC,CAAS,KAAK,CAAC,KAAKf,CAAK,EAAE,WACnC,KAAKJ,CAAO,IAAI,SAGbzS;EAAG;EAMZ,IAAI,aAAa;AACf,WAAO,KAAKgS,CAAW;EAAC;EAG1B,CAACD,CAAc,IAAI;AAEf,KAAC,KAAKE,EAAY,KAClB,CAAC,KAAKD,CAAW,KACjB,CAAC,KAAKkB,CAAS,KACf,KAAKN,CAAM,EAAE,WAAW,KACxB,KAAKd,CAAG,MAER,KAAKG,EAAY,IAAI,MACrB,KAAK,KAAK,KAAK,GACf,KAAK,KAAK,WAAW,GACrB,KAAK,KAAK,QAAQ,GACd,KAAKE,EAAM,KAAG,KAAK,KAAK,OAAO,GACnC,KAAKF,EAAY,IAAI;EACtB;EA2BH,KACE+B,MACGlP,GACM;AACT,QAAMsQ,IAAOtQ,EAAK,CAAC;AAEnB,QACEkP,MAAO,WACPA,MAAO,WACPA,MAAOd,KACP,KAAKA,CAAS,EAEd,QAAO;AACF,QAAIc,MAAO,OAChB,QAAO,CAAC,KAAKf,CAAU,KAAK,CAACmC,IACzB,QACA,KAAK7B,CAAK,KACTM,GAAM,MAAM,KAAKT,EAAQ,EAAEgC,CAAa,CAAC,GAAG,QAC7C,KAAKhC,EAAQ,EAAEgC,CAAa;AAC3B,QAAIpB,MAAO,MAChB,QAAO,KAAKX,EAAO,EAAC;AACf,QAAIW,MAAO,SAAS;AAGzB,UAFA,KAAK7B,EAAM,IAAI,MAEX,CAAC,KAAKH,CAAW,KAAK,CAAC,KAAKkB,CAAS,EAAG,QAAO;AACnD,UAAMlT,IAAM,MAAM,KAAK,OAAO;AAC9B,aAAA,KAAK,mBAAmB,OAAO,GACxBA;IACT,WAAWgU,MAAO,SAAS;AACzB,WAAK9B,EAAa,IAAIkD,GACtB,MAAM,KAAKjC,IAAOiC,CAAI;AACtB,UAAMpV,IACJ,CAAC,KAAK0T,EAAM,KAAK,KAAK,UAAU,OAAO,EAAE,SACrC,MAAM,KAAK,SAAS0B,CAAI,IACxB;AACN,aAAA,KAAKrD,CAAc,EAAC,GACb/R;IACT,WAAWgU,MAAO,UAAU;AAC1B,UAAMhU,IAAM,MAAM,KAAK,QAAQ;AAC/B,aAAA,KAAK+R,CAAc,EAAC,GACb/R;IACT,WAAWgU,MAAO,YAAYA,MAAO,aAAa;AAChD,UAAMhU,IAAM,MAAM,KAAKgU,CAAE;AACzB,aAAA,KAAK,mBAAmBA,CAAE,GACnBhU;IACT;AAGA,QAAMA,IAAM,MAAM,KAAKgU,GAAc,GAAGlP,CAAI;AAC5C,WAAA,KAAKiN,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACoT,EAAQ,EAAEgC,GAAa;AACtB,aAAW7a,KAAK,KAAKsY,CAAK,EACpBtY,GAAE,KAAK,MAAM6a,CAAa,MAAM,SAAO,KAAK,MAAK;AAEvD,QAAMpV,IAAM,KAAK4T,CAAS,IAAI,QAAQ,MAAM,KAAK,QAAQwB,CAAI;AAC7D,WAAA,KAAKrD,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACqT,EAAO,IAAI;AACV,WAAI,KAAKrB,CAAW,IAAU,SAE9B,KAAKA,CAAW,IAAI,MACpB,KAAK,WAAW,OACT,KAAKuB,CAAK,KACZM,GAAM,MAAM,KAAKP,EAAQ,EAAC,CAAE,GAAG,QAChC,KAAKA,EAAQ,EAAC;EAAE;EAGtB,CAACA,EAAQ,IAAI;AACX,QAAI,KAAKd,EAAO,GAAG;AACjB,UAAM4C,IAAO,KAAK5C,EAAO,EAAE,IAAG;AAC9B,UAAI4C,GAAM;AACR,iBAAW7a,KAAK,KAAKsY,CAAK,EACxBtY,GAAE,KAAK,MAAM6a,CAAa;AAEvB,aAAKxB,CAAS,KAAG,MAAM,KAAK,QAAQwB,CAAI;MAC/C;IACF;AAEA,aAAW7a,KAAK,KAAKsY,CAAK,EACxBtY,GAAE,IAAG;AAEP,QAAMyF,IAAM,MAAM,KAAK,KAAK;AAC5B,WAAA,KAAK,mBAAmB,KAAK,GACtBA;EAAG;EAOZ,MAAM,UAAqD;AACzD,QAAMqV,IAAwC,OAAO,OAAO,CAAA,GAAI,EAC9D,YAAY,EAAA,CACb;AACI,SAAKpC,CAAU,MAAGoC,EAAI,aAAa;AAGxC,QAAM9a,IAAI,KAAK,QAAO;AACtB,WAAA,KAAK,GAAG,QAAQ2B,OAAK;AACnBmZ,QAAI,KAAKnZ,CAAC,GACL,KAAK+W,CAAU,MAClBoC,EAAI,cAAenZ,EAA8B;IAAM,CAC1D,GACD,MAAM3B,GACC8a;EAAG;EASZ,MAAM,SAAyB;AAC7B,QAAI,KAAKpC,CAAU,EACjB,OAAM,IAAI,MAAM,6BAA6B;AAE/C,QAAMoC,IAAM,MAAM,KAAK,QAAO;AAC9B,WACE,KAAK9C,CAAQ,IACT8C,EAAI,KAAK,EAAE,IACX,OAAO,OAAOA,GAAiBA,EAAI,UAAU;EACzC;EAMZ,MAAM,UAAyB;AAC7B,WAAO,IAAI,QAAc,CAACC,GAASC,MAAW;AAC5C,WAAK,GAAGrC,GAAW,MAAMqC,EAAO,IAAI,MAAM,kBAAkB,CAAC,CAAC,GAC9D,KAAK,GAAG,SAASlF,OAAMkF,EAAOlF,CAAE,CAAC,GACjC,KAAK,GAAG,OAAO,MAAMiF,EAAO,CAAE;IAAC,CAChC;EAAC;EAQJ,CAAC,OAAO,aAAa,IAAuC;AAG1D,SAAK1B,CAAS,IAAI;AAClB,QAAI4B,IAAU,OACRC,IAAO,aACX,KAAK,MAAK,GACVD,IAAU,MACH,EAAE,OAAO,QAAW,MAAM,KAAI;AA2CvC,WAAO,EACL,MA1CW,MAA4C;AACvD,UAAIA,EAAS,QAAOC,EAAI;AACxB,UAAMhF,IAAM,KAAK,KAAI;AACrB,UAAIA,MAAQ,KAAM,QAAO,QAAQ,QAAQ,EAAE,MAAM,OAAO,OAAOA,EAAG,CAAE;AAEpE,UAAI,KAAKqB,CAAG,EAAG,QAAO2D,EAAI;AAE1B,UAAIH,GACAC,GACEG,IAASrF,OAAgB;AAC7B,aAAK,IAAI,QAAQsF,CAAM,GACvB,KAAK,IAAI,OAAOC,CAAK,GACrB,KAAK,IAAI1C,GAAW2C,CAAS,GAC7BJ,EAAI,GACJF,EAAOlF,CAAE;MAAC,GAENsF,IAAUlH,OAAiB;AAC/B,aAAK,IAAI,SAASiH,CAAK,GACvB,KAAK,IAAI,OAAOE,CAAK,GACrB,KAAK,IAAI1C,GAAW2C,CAAS,GAC7B,KAAK,MAAK,GACVP,EAAQ,EAAE,OAAA7G,GAAO,MAAM,CAAC,CAAC,KAAKqD,CAAG,EAAC,CAAE;MAAC,GAEjC8D,IAAQ,MAAM;AAClB,aAAK,IAAI,SAASF,CAAK,GACvB,KAAK,IAAI,QAAQC,CAAM,GACvB,KAAK,IAAIzC,GAAW2C,CAAS,GAC7BJ,EAAI,GACJH,EAAQ,EAAE,MAAM,MAAM,OAAO,OAAS,CAAE;MAAC,GAErCO,IAAY,MAAMH,EAAM,IAAI,MAAM,kBAAkB,CAAC;AAC3D,aAAO,IAAI,QAA+B,CAACjF,GAAKC,MAAQ;AACtD6E,YAAS7E,GACT4E,IAAU7E,GACV,KAAK,KAAKyC,GAAW2C,CAAS,GAC9B,KAAK,KAAK,SAASH,CAAK,GACxB,KAAK,KAAK,OAAOE,CAAK,GACtB,KAAK,KAAK,QAAQD,CAAM;MAAC,CAC1B;IAAC,GAKF,OAAOF,GACP,QAAQA,GACR,CAAC,OAAO,aAAa,IAAI;AACvB,aAAO;IAAI,GAEb,CAAC,OAAO,YAAY,GAAG,YAAY;IAAC,EAAA;EACrC;EASH,CAAC,OAAO,QAAQ,IAAkC;AAGhD,SAAK7B,CAAS,IAAI;AAClB,QAAI4B,IAAU,OACRC,IAAO,OACX,KAAK,MAAK,GACV,KAAK,IAAItC,IAAOsC,CAAI,GACpB,KAAK,IAAIvC,GAAWuC,CAAI,GACxB,KAAK,IAAI,OAAOA,CAAI,GACpBD,IAAU,MACH,EAAE,MAAM,MAAM,OAAO,OAAS,IAGjC5P,IAAO,MAAmC;AAC9C,UAAI4P,EAAS,QAAOC,EAAI;AACxB,UAAMhH,IAAQ,KAAK,KAAI;AACvB,aAAOA,MAAU,OAAOgH,EAAI,IAAK,EAAE,MAAM,OAAO,OAAAhH,EAAK;IAAE;AAGzD,WAAA,KAAK,KAAK,OAAOgH,CAAI,GACrB,KAAK,KAAKtC,IAAOsC,CAAI,GACrB,KAAK,KAAKvC,GAAWuC,CAAI,GAElB,EACL,MAAA7P,GACA,OAAO6P,GACP,QAAQA,GACR,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;IAAI,GAEb,CAAC,OAAO,OAAO,GAAG,MAAM;IAAC,EAAA;EAC1B;EAeH,QAAQpF,GAAc;AACpB,QAAI,KAAK6C,CAAS,EAChB,QAAI7C,IAAI,KAAK,KAAK,SAASA,CAAE,IACxB,KAAK,KAAK6C,CAAS,GACjB;AAGT,SAAKA,CAAS,IAAI,MAClB,KAAKU,CAAS,IAAI,MAGlB,KAAKhB,CAAM,EAAE,SAAS,GACtB,KAAKE,CAAY,IAAI;AAErB,QAAMgD,IAAK;AAGX,WAAI,OAAOA,EAAG,SAAU,cAAc,CAAC,KAAK3D,EAAM,KAAG2D,EAAG,MAAK,GAEzDzF,IAAI,KAAK,KAAK,SAASA,CAAE,IAExB,KAAK,KAAK6C,CAAS,GAEjB;EAAI;EAUb,WAAW,WAAW;AACpB,WAAO1B;EAAQ;AAAA;ADtzCnB,IAAMuE,KAAeC,UAAAA,aAAI;AAAzB,IA2EMC,KAAqB,EACzB,WAAAC,UAAAA,WACA,SAASC,UAAAA,SACT,aAAAC,UAAAA,aACA,cAAAC,UAAAA,cACA,cAAAN,IACA,UAAU,EACR,OAAAO,gBAAAA,OACA,SAAAC,gBAAAA,SACA,UAAAC,gBAAAA,UACA,UAAAC,gBAAAA,SAAAA,EAAAA;AArFJ,IA0FMC,KAAgBC,CAAAA,OACpB,CAACA,MAAYA,OAAaV,MAAaU,OAAaC,KAClDX,KACA,EACE,GAAGA,IACH,GAAGU,IACH,UAAU,EACR,GAAGV,GAAU,UACb,GAAIU,GAAS,YAAY,CAAA,EAAA,EAAA;AAlGjC,IAuGME,KAAiB;AAvGvB,IAwGMC,KAAcC,CAAAA,OAClBA,GAAS,QAAQ,OAAO,IAAI,EAAE,QAAQF,IAAgB,MAAM;AAzG9D,IA4GMG,KAAY;AA5GlB,IA8GMC,IAAU;AA9GhB,IA+GMC,KAAQ;AA/Gd,IAgHMC,KAAQ;AAhHd,IAiHMC,IAAQ;AAjHd,IAkHMC,KAAQ;AAlHd,IAmHMC,KAAQ;AAnHd,IAoHMC,IAAQ;AApHd,IAqHMC,KAAS;AArHf,IAsHMC,IAAO;AAtHb,IAmIMC,KAAe,CAACD;AAnItB,IAsIME,KAAiB;AAtIvB,IAwIMC,KAAe;AAxIrB,IA0IMC,KAAU;AA1IhB,IA6IMC,IAAS;AA7If,IAgJMC,KAAc;AAhJpB,IAkJMC,KAAc;AAlJpB,IAoJMC,KAAWJ,KAAUC,IAASE;AApJpC,IAqJME,KAAW;AArJjB,IAuJMC,KAAazb,CAAAA,OACjBA,GAAE,OAAM,IAAK4a,KACX5a,GAAE,YAAW,IAAK0a,IAClB1a,GAAE,eAAc,IAAK6a,IACrB7a,GAAE,kBAAiB,IAAKya,KACxBza,GAAE,cAAa,IAAK2a,KACpB3a,GAAE,SAAQ,IAAK8a,KACf9a,GAAE,OAAM,IAAKwa,KACbD;AA/JJ,IAkKMmB,KAAiB,IAAIC,GAAyB,EAAE,KAAK,KAAK,GAAE,CAAE;AAlKpE,IAmKMC,KAAa5b,CAAAA,OAAa;AAC9B,MAAMR,IAAIkc,GAAe,IAAI1b,EAAC;AAC9B,MAAIR,EAAG,QAAOA;AACd,MAAMP,IAAIe,GAAE,UAAU,MAAM;AAC5B,SAAA0b,GAAe,IAAI1b,IAAGf,CAAC,GAChBA;AACT;AAzKA,IA2KM4c,KAAuB,IAAIF,GAAyB,EAAE,KAAK,KAAK,GAAE,CAAE;AA3K1E,IA4KMG,KAAmB9b,CAAAA,OAAa;AACpC,MAAMR,IAAIqc,GAAqB,IAAI7b,EAAC;AACpC,MAAIR,EAAG,QAAOA;AACd,MAAMP,IAAI2c,GAAU5b,GAAE,YAAW,CAAE;AACnC,SAAA6b,GAAqB,IAAI7b,IAAGf,CAAC,GACtBA;AACT;AAlLA,IAsMa8c,KAAP,cAA4BJ,GAAwB;EACxD,cAAA;AACE,UAAM,EAAE,KAAK,IAAG,CAAE;EACpB;AAAA;AAzMF,IA4NaK,KAAP,cAA6BL,GAA4B;EAC7D,YAAYpM,IAAkB,KAAK,MAAI;AACrC,UAAM,EACJ,SAAAA,GAEA,iBAAiBpU,OAAKA,EAAE,SAAS,EAAA,CAClC;EACH;AAAA;AAnOF,IA6OM8gB,KAAW,uBAAO,qBAAqB;AA7O7C,IA4PsBC,IAAhB,MAAwB;EAU5B;EAMA;EAMA;EAMA;EAKA;EAMA,QAAiB;EAajBC;EAGAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACA1P;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACA2P;EACA,IAAI,SAAM;AACR,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,cAAW;AACb,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,YAAS;AACX,WAAO,KAAKA;EACd;EAEAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAQA,IAAI,aAAU;AACZ,YAAQ,KAAK,UAAU,MAAM,SAAQ;EACvC;EASA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;EASA,YACEC,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,SAAK,OAAOoG,GACZ,KAAKV,KAAaa,IAASpC,GAAgBiC,CAAI,IAAInC,GAAUmC,CAAI,GACjE,KAAKJ,KAAQ1a,IAAOuY,IACpB,KAAK,SAAS0C,GACd,KAAK,QAAQD,GACb,KAAK,OAAOD,KAAQ,MACpB,KAAKJ,KAAYO,GACjB,KAAKZ,KAAY5F,EAAK,UACtB,KAAK8F,KAAY9F,EAAK,UACtB,KAAK+F,KAAiB/F,EAAK,eAC3B,KAAK,SAASA,EAAK,QACf,KAAK,SACP,KAAKwE,KAAM,KAAK,OAAOA,KAEvB,KAAKA,KAAMnC,GAAarC,EAAK,EAAE;EAEnC;EAOA,QAAK;AACH,WAAI,KAAK2F,OAAW,SAAkB,KAAKA,KACtC,KAAK,SACF,KAAKA,KAAS,KAAK,OAAO,MAAK,IAAK,IADlB,KAAKA,KAAS;EAE1C;EAkBA,gBAAa;AACX,WAAO,KAAKM;EACd;EAKA,QAAQxW,GAAa;AACnB,QAAI,CAACA,EACH,QAAO;AAET,QAAMiT,IAAW,KAAK,cAAcjT,CAAI,GAElCgX,IADMhX,EAAK,UAAUiT,EAAS,MAAM,EACrB,MAAM,KAAK,QAAQ;AAKxC,WAHEA,IACE,KAAK,QAAQA,CAAQ,EAAEgE,GAAcD,CAAQ,IAC7C,KAAKC,GAAcD,CAAQ;EAEjC;EAEAC,GAAcD,GAAkB;AAC9B,QAAIvgB,IAAc;AAClB,aAAWwF,KAAQ+a,EACjBvgB,KAAIA,EAAE,MAAMwF,CAAI;AAElB,WAAOxF;EACT;EAUA,WAAQ;AACN,QAAMygB,IAAS,KAAKV,GAAU,IAAI,IAAI;AACtC,QAAIU,EACF,QAAOA;AAET,QAAMH,IAAqB,OAAO,OAAO,CAAA,GAAI,EAAE,aAAa,EAAC,CAAE;AAC/D,WAAA,KAAKP,GAAU,IAAI,MAAMO,CAAQ,GACjC,KAAKR,MAAS,CAAC1C,IACRkD;EACT;EAeA,MAAMI,GAAkB5G,GAAe;AACrC,QAAI4G,MAAa,MAAMA,MAAa,IAClC,QAAO;AAET,QAAIA,MAAa,KACf,QAAO,KAAK,UAAU;AAIxB,QAAMJ,IAAW,KAAK,SAAQ,GACxBJ,IACJ,KAAK,SAASjC,GAAgByC,CAAQ,IAAI3C,GAAU2C,CAAQ;AAC9D,aAAW1gB,KAAKsgB,EACd,KAAItgB,EAAEwf,OAAeU,EACnB,QAAOlgB;AAOX,QAAMmC,IAAI,KAAK,SAAS,KAAK,MAAM,IAC7Bwe,IACJ,KAAKjB,KAAY,KAAKA,KAAYvd,IAAIue,IAAW,QAC7CE,IAAS,KAAK,SAASF,GAAUhE,GAAS,EAC9C,GAAG5C,GACH,QAAQ,MACR,UAAA6G,EAAAA,CACD;AAED,WAAK,KAAK,WAAU,MAClBC,EAAOd,MAASvC,IAKlB+C,EAAS,KAAKM,CAAM,GACbA;EACT;EAMA,WAAQ;AACN,QAAI,KAAK,MAAO,QAAO;AACvB,QAAI,KAAKhB,OAAc,OACrB,QAAO,KAAKA;AAEd,QAAMM,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK4f,KAAY,KAAK;AAEhC,QAAMiB,IAAK7gB,EAAE,SAAQ;AACrB,WAAO6gB,KAAM,CAACA,KAAM,CAAC7gB,EAAE,SAAS,KAAK,KAAK,OAAOkgB;EACnD;EAQA,gBAAa;AACX,QAAI,KAAK,QAAQ,IAAK,QAAO,KAAK,SAAQ;AAC1C,QAAI,KAAK,MAAO,QAAO;AACvB,QAAI,KAAKL,OAAmB,OAAW,QAAO,KAAKA;AACnD,QAAMK,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK6f,KAAiB,KAAK,cAAa;AAElD,QAAMgB,IAAK7gB,EAAE,cAAa;AAC1B,WAAO6gB,KAAM,CAACA,KAAM,CAAC7gB,EAAE,SAAS,KAAK,OAAOkgB;EAC9C;EAKA,WAAQ;AACN,QAAI,KAAKR,OAAc,OACrB,QAAO,KAAKA;AAEd,QAAMQ,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK0f,KAAY,KAAK;AAGhC,QAAMoB,IADK9gB,EAAE,SAAQ,KACHA,EAAE,SAAc,KAAK,MAAV,MAAiBkgB;AAC9C,WAAQ,KAAKR,KAAYoB;EAC3B;EAQA,gBAAa;AACX,QAAI,KAAKnB,OAAmB,OAAW,QAAO,KAAKA;AACnD,QAAI,KAAK,QAAQ,IAAK,QAAQ,KAAKA,KAAiB,KAAK,SAAQ;AACjE,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAM3f,IAAI,KAAK,SAAQ,EAAG,QAAQ,OAAO,GAAG;AAC5C,aAAI,aAAa,KAAKA,CAAC,IACb,KAAK2f,KAAiB,OAAO3f,CAAC,KAE9B,KAAK2f,KAAiB3f;IAElC;AACA,QAAMA,IAAI,KAAK,QACT+gB,IAAO/gB,EAAE,cAAa,GACtBghB,IAAMD,KAAQ,CAACA,KAAQ,CAAC/gB,EAAE,SAAS,KAAK,OAAO,KAAK;AAC1D,WAAQ,KAAK2f,KAAiBqB;EAChC;EASA,YAAS;AACP,YAAQ,KAAKlB,KAAQ5C,OAAUR;EACjC;EAEA,OAAOtX,GAAU;AACf,WAAO,KAAK,KAAKA,CAAI,EAAE,EAAC;EAC1B;EAEA,UAAO;AACL,WACE,KAAK,UAAS,IAAK,YACjB,KAAK,YAAW,IAAK,cACrB,KAAK,OAAM,IAAK,SAChB,KAAK,eAAc,IAAK,iBACxB,KAAK,OAAM,IAAK,SAChB,KAAK,kBAAiB,IAAK,oBAC3B,KAAK,cAAa,IAAK,gBACD,KAAK,SAAQ,IAAK,WACxC;EAGN;EAKA,SAAM;AACJ,YAAQ,KAAK0a,KAAQ5C,OAAUH;EACjC;EAKA,cAAW;AACT,YAAQ,KAAK+C,KAAQ5C,OAAUL;EACjC;EAKA,oBAAiB;AACf,YAAQ,KAAKiD,KAAQ5C,OAAUN;EACjC;EAKA,gBAAa;AACX,YAAQ,KAAKkD,KAAQ5C,OAAUJ;EACjC;EAKA,SAAM;AACJ,YAAQ,KAAKgD,KAAQ5C,OAAUP;EACjC;EAKA,WAAQ;AACN,YAAQ,KAAKmD,KAAQ5C,OAAUD;EACjC;EAKA,iBAAc;AACZ,YAAQ,KAAK6C,KAAQ9C,OAAWA;EAClC;EASA,cAAW;AACT,WAAO,KAAK8C,KAAQzC,KAAe,OAAO;EAC5C;EAUA,iBAAc;AACZ,WAAO,KAAK2C;EACd;EAUA,iBAAc;AACZ,WAAO,KAAKC;EACd;EAUA,gBAAa;AACX,QAAMK,IAAW,KAAK,SAAQ;AAC9B,WAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EASA,cAAW;AACT,QAAI,KAAKN,GAAa,QAAO;AAC7B,QAAI,CAAC,KAAK,OAAQ,QAAO;AAEzB,QAAMiB,IAAO,KAAKnB,KAAQ5C;AAC1B,WAAO,EACJ+D,MAASvE,KAAWuE,MAASjE,KAC9B,KAAK8C,KAAQtC,MACb,KAAKsC,KAAQvC;EAEjB;EAMA,gBAAa;AACX,WAAO,CAAC,EAAE,KAAKuC,KAAQ1C;EACzB;EAOA,WAAQ;AACN,WAAO,CAAC,EAAE,KAAK0C,KAAQvC;EACzB;EAaA,QAAQnc,GAAS;AACf,WAAQ,KAAK,SAET,KAAKoe,OAAevB,GAAgB7c,CAAC,IADrC,KAAKoe,OAAezB,GAAU3c,CAAC;EAErC;EAUA,MAAM,WAAQ;AACZ,QAAM8f,IAAS,KAAKlB;AACpB,QAAIkB,EACF,QAAOA;AAET,QAAK,KAAK,YAAW,KAKhB,KAAK,OAIV,KAAI;AACF,UAAMC,IAAO,MAAM,KAAK7C,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,GACvD8C,KAAc,MAAM,KAAK,OAAO,SAAQ,IAAK,QAAQD,CAAI;AAC/D,UAAIC,EACF,QAAQ,KAAKpB,KAAcoB;IAE/B,SAAStL,GAAI;AACX,WAAKuL,GAAevL,EAA6B,IAAI;AACrD;IACF;EACF;EAKA,eAAY;AACV,QAAMoL,IAAS,KAAKlB;AACpB,QAAIkB,EACF,QAAOA;AAET,QAAK,KAAK,YAAW,KAKhB,KAAK,OAIV,KAAI;AACF,UAAMC,IAAO,KAAK7C,GAAI,aAAa,KAAK,SAAQ,CAAE,GAC5C8C,IAAa,KAAK,OAAO,aAAY,GAAI,QAAQD,CAAI;AAC3D,UAAIC,EACF,QAAQ,KAAKpB,KAAcoB;IAE/B,SAAStL,GAAI;AACX,WAAKuL,GAAevL,EAA6B,IAAI;AACrD;IACF;EACF;EAEAwL,GAAgBhB,GAAkB;AAEhC,SAAKR,MAAS1C;AAEd,aAASpd,IAAIsgB,EAAS,aAAatgB,IAAIsgB,EAAS,QAAQtgB,KAAK;AAC3D,UAAM2B,IAAI2e,EAAStgB,CAAC;AAChB2B,WAAGA,EAAE4f,GAAW;IACtB;EACF;EAEAA,KAAW;AAEL,SAAKzB,KAAQvC,MACjB,KAAKuC,MAAS,KAAKA,KAAQvC,KAAUJ,IACrC,KAAKqE,GAAmB;EAC1B;EAEAA,KAAmB;AAEjB,QAAMlB,IAAW,KAAK,SAAQ;AAC9BA,MAAS,cAAc;AACvB,aAAWtgB,KAAKsgB,EACdtgB,GAAEuhB,GAAW;EAEjB;EAEAE,KAAgB;AACd,SAAK3B,MAASrC,IACd,KAAKiE,GAAY;EACnB;EAGAA,KAAY;AAMV,QAAI,KAAK5B,KAAQxC,GAAS;AAE1B,QAAI,IAAI,KAAKwC;AAAAA,KAGR,IAAI5C,OAAUL,MAAO,KAAKM,KAC/B,KAAK2C,KAAQ,IAAIxC,IACjB,KAAKkE,GAAmB;EAC1B;EAEAG,GAAajU,IAAe,IAAE;AAExBA,UAAS,aAAaA,MAAS,UACjC,KAAKgU,GAAY,IACRhU,MAAS,WAClB,KAAK6T,GAAW,IAEhB,KAAK,SAAQ,EAAG,cAAc;EAElC;EAEAK,GAAWlU,IAAe,IAAE;AAGtBA,UAAS,YAED,KAAK,OACbgU,GAAY,IACLhU,MAAS,YAElB,KAAK6T,GAAW;EAEpB;EAEAF,GAAc3T,IAAe,IAAE;AAC7B,QAAImU,IAAM,KAAK/B;AACf+B,SAAOrE,IACH9P,MAAS,aAAUmU,KAAOtE,KAE1B7P,MAAS,YAAYA,MAAS,eAGhCmU,KAAO1E,KAET,KAAK2C,KAAQ+B,GAITnU,MAAS,aAAa,KAAK,UAC7B,KAAK,OAAOgU,GAAY;EAG5B;EAEAI,GAAiBC,GAAWpgB,GAAW;AACrC,WACE,KAAKqgB,GAA0BD,GAAGpgB,CAAC,KACnC,KAAKsgB,GAAoBF,GAAGpgB,CAAC;EAEjC;EAEAsgB,GAAoBF,GAAWpgB,GAAW;AAExC,QAAMyD,IAAOwY,GAAUmE,CAAC,GAClBG,IAAQ,KAAK,SAASH,EAAE,MAAM3c,GAAM,EAAE,QAAQ,KAAI,CAAE,GACpD6b,IAAOiB,EAAMpC,KAAQ5C;AAC3B,WAAI+D,MAASpE,KAASoE,MAASjE,KAASiE,MAASvE,MAC/CwF,EAAMpC,MAASxC,KAEjB3b,EAAE,QAAQugB,CAAK,GACfvgB,EAAE,eACKugB;EACT;EAEAF,GAA0BD,GAAWpgB,GAAW;AAC9C,aAAS3B,IAAI2B,EAAE,aAAa3B,IAAI2B,EAAE,QAAQ3B,KAAK;AAC7C,UAAM4gB,IAASjf,EAAE3B,CAAC;AAGlB,WADE,KAAK,SAASie,GAAgB8D,EAAE,IAAI,IAAIhE,GAAUgE,EAAE,IAAI,OAC7CnB,EAAQpB,GAIrB,QAAO,KAAK2C,GAAqBJ,GAAGnB,GAAS5gB,GAAG2B,CAAC;IACnD;EACF;EAEAwgB,GACEJ,GACA/hB,GACAwQ,GACA7O,GAAW;AAEX,QAAM6R,IAAIxT,EAAE;AAEZ,WAAAA,EAAE8f,KAAS9f,EAAE8f,KAAQ3C,KAAgBS,GAAUmE,CAAC,GAE5CvO,MAAMuO,EAAE,SAAM/hB,EAAE,OAAO+hB,EAAE,OAIzBvR,MAAU7O,EAAE,gBACV6O,MAAU7O,EAAE,SAAS,IAAGA,EAAE,IAAG,IAC5BA,EAAE,OAAO6O,GAAO,CAAC,GACtB7O,EAAE,QAAQ3B,CAAC,IAEb2B,EAAE,eACK3B;EACT;EAiBA,MAAM,QAAK;AACT,SAAK,KAAK8f,KAAQvC,OAAY,EAC5B,KAAI;AACF,aAAA,KAAK6E,GAAW,MAAM,KAAK9D,GAAI,SAAS,MAAM,KAAK,SAAQ,CAAE,CAAC,GACvD;IACT,SAASxI,GAAI;AACX,WAAK8L,GAAY9L,EAA6B,IAAI;IACpD;EAEJ;EAKA,YAAS;AACP,SAAK,KAAKgK,KAAQvC,OAAY,EAC5B,KAAI;AACF,aAAA,KAAK6E,GAAW,KAAK9D,GAAI,UAAU,KAAK,SAAQ,CAAE,CAAC,GAC5C;IACT,SAASxI,GAAI;AACX,WAAK8L,GAAY9L,EAA6B,IAAI;IACpD;EAEJ;EAEAsM,GAAWC,GAAS;AAClB,QAAM,EACJ,OAAAC,GACA,SAAAC,GACA,WAAAC,GACA,aAAAC,GACA,SAAAC,GACA,QAAAC,GACA,OAAAC,GACA,SAAAC,GACA,KAAAC,GACA,KAAAC,GACA,KAAAC,GACA,MAAAC,GACA,OAAAC,GACA,SAAAC,GACA,OAAAC,GACA,MAAAC,GACA,MAAAhV,GACA,KAAAiV,EAAG,IACDjB;AACJ,SAAKjD,KAASkD,GACd,KAAKtD,KAAWuD,GAChB,KAAKhD,KAAaiD,GAClB,KAAKrD,KAAesD,GACpB,KAAK5D,KAAW6D,GAChB,KAAK3D,KAAU4D,GACf,KAAKrD,KAASsD,GACd,KAAK1D,KAAW2D,GAChB,KAAKtE,KAAOuE,GACZ,KAAKnE,KAAOoE,GACZ,KAAKjE,KAAOkE,GACZ,KAAKxE,KAAQyE,GACb,KAAK5D,KAAS6D,GACd,KAAKjE,KAAWkE,GAChB,KAAK1E,KAAS2E,GACd,KAAKxE,KAAQyE,GACb,KAAKjU,KAAQf,GACb,KAAKqQ,KAAO4E;AACZ,QAAMrC,IAAOrD,GAAUyE,CAAE;AAEzB,SAAKvC,KAAS,KAAKA,KAAQ3C,KAAgB8D,IAAO5D,IAC9C4D,MAASvE,KAAWuE,MAASpE,KAASoE,MAASjE,MACjD,KAAK8C,MAASxC;EAElB;EAEAiG,KAGc,CAAA;EACdC,KAA8B;EAC9BC,GAAiBnD,GAAgB;AAC/B,SAAKkD,KAAqB;AAC1B,QAAME,IAAM,KAAKH,GAAa,MAAK;AACnC,SAAKA,GAAa,SAAS,GAC3BG,EAAI,QAAQrO,OAAMA,EAAG,MAAMiL,CAAQ,CAAC;EACtC;EAkBA,UACEjL,GACAsO,IAAsB,OAAK;AAE3B,QAAI,CAAC,KAAK,WAAU,GAAI;AAClBA,UAAYtO,EAAG,MAAM,CAAA,CAAE,IACtB,eAAe,MAAMA,EAAG,MAAM,CAAA,CAAE,CAAC;AACtC;IACF;AAEA,QAAMiL,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,GAAI;AACxB,UAAM3e,IAAI2e,EAAS,MAAM,GAAGA,EAAS,WAAW;AAC5CqD,UAAYtO,EAAG,MAAM1T,CAAC,IACrB,eAAe,MAAM0T,EAAG,MAAM1T,CAAC,CAAC;AACrC;IACF;AAIA,QADA,KAAK4hB,GAAa,KAAKlO,CAAE,GACrB,KAAKmO,GACP;AAEF,SAAKA,KAAqB;AAI1B,QAAM7C,IAAW,KAAK,SAAQ;AAC9B,SAAKrC,GAAI,QAAQqC,GAAU,EAAE,eAAe,KAAI,GAAI,CAAC7K,GAAI8N,MAAW;AAClE,UAAI9N,EACF,MAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;WAClB;AAGL,iBAAWyB,KAAK6B,EACd,MAAK9B,GAAiBC,GAAGzB,CAAQ;AAEnC,aAAKgB,GAAgBhB,CAAQ;MAC/B;AACA,WAAKmD,GAAiBnD,EAAS,MAAM,GAAGA,EAAS,WAAW,CAAC;IAE/D,CAAC;EACH;EAEAuD;EAWA,MAAM,UAAO;AACX,QAAI,CAAC,KAAK,WAAU,EAClB,QAAO,CAAA;AAGT,QAAMvD,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,EACpB,QAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;AAK/C,QAAMK,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAKkD,GACP,OAAM,KAAKA;SACN;AAEL,UAAI9I,IAAsB,MAAK;MAAE;AAEjC,WAAK8I,KAAwB,IAAI,QAC/B3N,OAAQ6E,IAAU7E,CAAI;AAExB,UAAI;AACF,iBAAW6L,KAAK,MAAM,KAAKzD,GAAI,SAAS,QAAQqC,GAAU,EACxD,eAAe,KAAA,CAChB,EACC,MAAKmB,GAAiBC,GAAGzB,CAAQ;AAEnC,aAAKgB,GAAgBhB,CAAQ;MAC/B,SAASxK,GAAI;AACX,aAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;MACzB;AACA,WAAKuD,KAAwB,QAC7B9I,EAAO;IACT;AACA,WAAOuF,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EAKA,cAAW;AACT,QAAI,CAAC,KAAK,WAAU,EAClB,QAAO,CAAA;AAGT,QAAMA,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,EACpB,QAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;AAK/C,QAAMK,IAAW,KAAK,SAAQ;AAC9B,QAAI;AACF,eAAWoB,KAAK,KAAKzD,GAAI,YAAYqC,GAAU,EAC7C,eAAe,KAAA,CAChB,EACC,MAAKmB,GAAiBC,GAAGzB,CAAQ;AAEnC,WAAKgB,GAAgBhB,CAAQ;IAC/B,SAASxK,GAAI;AACX,WAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;IACzB;AACA,WAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EAEA,aAAU;AACR,QAAI,KAAKR,KAAQpC,GAAU,QAAO;AAClC,QAAMuD,IAAO/D,IAAO,KAAK4C;AAGzB,WAAMmB,MAASvE,KAAWuE,MAASpE,KAASoE,MAASjE;EAKvD;EAEA,WACE8G,GACAC,GAAqC;AAErC,YACG,KAAKjE,KAAQjD,OAAWA,KACzB,EAAE,KAAKiD,KAAQpC,OACf,CAACoG,EAAK,IAAI,IAAI,MACb,CAACC,KAAcA,EAAW,IAAI;EAEnC;EAWA,MAAM,WAAQ;AACZ,QAAI,KAAK9D,GAAW,QAAO,KAAKA;AAChC,QAAK,GAAAxC,KAAcD,KAAcD,KAAU,KAAKuC,IAChD,KAAI;AACF,UAAMkE,IAAK,MAAM,KAAK1F,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE;AAC3D,aAAQ,KAAK2B,KAAY,KAAK,QAAQ+D,CAAE;IAC1C,QAAY;AACV,WAAKvC,GAAgB;IACvB;EACF;EAKA,eAAY;AACV,QAAI,KAAKxB,GAAW,QAAO,KAAKA;AAChC,QAAK,GAAAxC,KAAcD,KAAcD,KAAU,KAAKuC,IAChD,KAAI;AACF,UAAMkE,IAAK,KAAK1F,GAAI,aAAa,KAAK,SAAQ,CAAE;AAChD,aAAQ,KAAK2B,KAAY,KAAK,QAAQ+D,CAAE;IAC1C,QAAY;AACV,WAAKvC,GAAgB;IACvB;EACF;EAQA,CAACrD,EAAQ,EAAE6F,GAAgB;AACzB,QAAIA,MAAW,KAAM;AACrBA,MAAO,QAAQ,OACf,KAAK,QAAQ;AAEb,QAAMC,IAAU,oBAAI,IAAc,CAAA,CAAE,GAChCF,IAAK,CAAA,GACLhkB,IAAc;AAClB,WAAOA,KAAKA,EAAE,SACZkkB,GAAQ,IAAIlkB,CAAC,GACbA,EAAE4f,KAAYoE,EAAG,KAAK,KAAK,GAAG,GAC9BhkB,EAAE6f,KAAiBmE,EAAG,KAAK,GAAG,GAC9BhkB,IAAIA,EAAE,QACNgkB,EAAG,KAAK,IAAI;AAId,SADAhkB,IAAIikB,GACGjkB,KAAKA,EAAE,UAAU,CAACkkB,EAAQ,IAAIlkB,CAAC,IACpCA,GAAE4f,KAAY,QACd5f,EAAE6f,KAAiB,QACnB7f,IAAIA,EAAE;EAEV;AAAA;AAx1CF,IAi2CamkB,KAAP,MAAOC,WAAkB/F,EAAQ;EAIrC,MAAY;EAIZ,WAAmB5B;EAQnB,YACEyD,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,UAAMoG,GAAM9a,GAAM+a,GAAMC,GAAOC,GAAQC,GAAUxG,CAAI;EACvD;EAKA,SAASoG,GAAc9a,IAAesX,GAAS5C,IAAiB,CAAA,GAAE;AAChE,WAAO,IAAIsK,GACTlE,GACA9a,GACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB0U,CAAI;EAER;EAKA,cAAcvQ,GAAY;AACxB,WAAO8a,iBAAAA,MAAM,MAAM9a,CAAI,EAAE;EAC3B;EAKA,QAAQiT,GAAgB;AAEtB,QADAA,IAAWD,GAAWC,EAAS,YAAW,CAAE,GACxCA,MAAa,KAAK,KAAK,KACzB,QAAO,KAAK;AAGd,aAAW,CAAC8H,GAASnE,CAAI,KAAK,OAAO,QAAQ,KAAK,KAAK,EACrD,KAAI,KAAK,SAAS3D,GAAU8H,CAAO,EACjC,QAAQ,KAAK,MAAM9H,CAAQ,IAAI2D;AAInC,WAAQ,KAAK,MAAM3D,CAAQ,IAAI,IAAI+H,GACjC/H,GACA,IAAI,EACJ;EACJ;EAKA,SAASA,GAAkB8H,IAAkB,KAAK,KAAK,MAAI;AAIzD,WAAA9H,IAAWA,EACR,YAAW,EACX,QAAQ,OAAO,IAAI,EACnB,QAAQF,IAAgB,MAAM,GAC1BE,MAAa8H;EACtB;AAAA;AAp7CF,IA47CaE,KAAP,MAAOC,WAAkBpG,EAAQ;EAIrC,WAAgB;EAIhB,MAAW;EAQX,YACE6B,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,UAAMoG,GAAM9a,GAAM+a,GAAMC,GAAOC,GAAQC,GAAUxG,CAAI;EACvD;EAKA,cAAcvQ,GAAY;AACxB,WAAOA,EAAK,WAAW,GAAG,IAAI,MAAM;EACtC;EAKA,QAAQmb,GAAiB;AACvB,WAAO,KAAK;EACd;EAKA,SAASxE,GAAc9a,IAAesX,GAAS5C,IAAiB,CAAA,GAAE;AAChE,WAAO,IAAI2K,GACTvE,GACA9a,GACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB0U,CAAI;EAER;AAAA;AAn/CF,IA6hDsB6K,KAAhB,MAA8B;EAIlC;EAIA;EAIA;EAIA;EACAC;EACAC;EACA9E;EAMA;EASAzB;EASA,YACEwG,IAAoB,QAAQ,IAAG,GAC/BC,GACAvb,GACA,EACE,QAAA6W,GACA,mBAAA2E,IAAoB,KAAK,MACzB,IAAAC,IAAKvJ,GAAS,IACI,CAAA,GAAE;AAEtB,SAAK4C,KAAMnC,GAAa8I,CAAE,IACtBH,aAAe,OAAOA,EAAI,WAAW,SAAS,OAChDA,QAAMI,iBAAAA,eAAcJ,CAAG;AAIzB,QAAMK,IAAUJ,EAAS,QAAQD,CAAG;AACpC,SAAK,QAAQ,uBAAO,OAAO,IAAI,GAC/B,KAAK,WAAW,KAAK,cAAcK,CAAO,GAC1C,KAAKP,KAAgB,IAAI1G,MACzB,KAAK2G,KAAqB,IAAI3G,MAC9B,KAAK6B,KAAY,IAAI5B,GAAc6G,CAAiB;AAEpD,QAAMI,IAAQD,EAAQ,UAAU,KAAK,SAAS,MAAM,EAAE,MAAM3b,CAAG;AAM/D,QAJI4b,EAAM,WAAW,KAAK,CAACA,EAAM,CAAC,KAChCA,EAAM,IAAG,GAGP/E,MAAW,OACb,OAAM,IAAI,UACR,oDAAoD;AAIxD,SAAK,SAASA,GACd,KAAK,OAAO,KAAK,QAAQ,KAAK/B,EAAG,GACjC,KAAK,MAAM,KAAK,QAAQ,IAAI,KAAK;AACjC,QAAIrT,IAAiB,KAAK,MACtB5B,IAAM+b,EAAM,SAAS,GACnBC,IAAUN,EAAS,KACrBO,IAAM,KAAK,UACXC,IAAW;AACf,aAAW/f,KAAQ4f,GAAO;AACxB,UAAMI,IAAInc;AACV4B,UAAOA,EAAK,MAAMzF,GAAM,EACtB,UAAU,IAAI,MAAMggB,CAAC,EAAE,KAAK,IAAI,EAAE,KAAKH,CAAO,GAC9C,eAAe,IAAI,MAAMG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,GAC/C,UAAWF,MAAQC,IAAW,KAAKF,KAAW7f,EAAAA,CAC/C,GACD+f,IAAW;IACb;AACA,SAAK,MAAMta;EACb;EAKA,MAAM1B,IAAsB,KAAK,KAAG;AAClC,WAAI,OAAOA,KAAS,aAClBA,IAAO,KAAK,IAAI,QAAQA,CAAI,IAEvBA,EAAK,MAAK;EACnB;EAyBA,gBAAa;AACX,WAAO,KAAKwW;EACd;EAWA,WAAW0F,GAAe;AAGxB,QAAIlnB,IAAI;AACR,aAASD,IAAImnB,EAAM,SAAS,GAAGnnB,KAAK,GAAGA,KAAK;AAC1C,UAAM0B,IAAIylB,EAAMnnB,CAAC;AACjB,UAAI,EAAA,CAAC0B,KAAKA,MAAM,SAChBzB,IAAIA,IAAI,GAAGyB,CAAC,IAAIzB,CAAC,KAAKyB,GAClB,KAAK,WAAWA,CAAC,GACnB;IAEJ;AACA,QAAMygB,IAAS,KAAKmE,GAAc,IAAIrmB,CAAC;AACvC,QAAIkiB,MAAW,OACb,QAAOA;AAET,QAAMtiB,IAAS,KAAK,IAAI,QAAQI,CAAC,EAAE,SAAQ;AAC3C,WAAA,KAAKqmB,GAAc,IAAIrmB,GAAGJ,CAAM,GACzBA;EACT;EAaA,gBAAgBsnB,GAAe;AAG7B,QAAIlnB,IAAI;AACR,aAASD,IAAImnB,EAAM,SAAS,GAAGnnB,KAAK,GAAGA,KAAK;AAC1C,UAAM0B,IAAIylB,EAAMnnB,CAAC;AACjB,UAAI,EAAA,CAAC0B,KAAKA,MAAM,SAChBzB,IAAIA,IAAI,GAAGyB,CAAC,IAAIzB,CAAC,KAAKyB,GAClB,KAAK,WAAWA,CAAC,GACnB;IAEJ;AACA,QAAMygB,IAAS,KAAKoE,GAAmB,IAAItmB,CAAC;AAC5C,QAAIkiB,MAAW,OACb,QAAOA;AAET,QAAMtiB,IAAS,KAAK,IAAI,QAAQI,CAAC,EAAE,cAAa;AAChD,WAAA,KAAKsmB,GAAmB,IAAItmB,GAAGJ,CAAM,GAC9BA;EACT;EAKA,SAASkW,IAA2B,KAAK,KAAG;AAC1C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,SAAQ;EACvB;EAMA,cAAcA,IAA2B,KAAK,KAAG;AAC/C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,cAAa;EAC5B;EAKA,SAASA,IAA2B,KAAK,KAAG;AAC1C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM;EACf;EAKA,QAAQA,IAA2B,KAAK,KAAG;AACzC,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,KAExBA,EAAM,UAAUA,GAAO,SAAQ;EACzC;EAkCA,MAAM,QACJA,IAAwD,KAAK,KAC7DyF,IAAmC,EACjC,eAAe,KAAA,GAChB;AAEG,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EAAE,eAAAqR,EAAa,IAAK5L;AAC1B,QAAKzF,EAAM,WAAU,GAEd;AACL,UAAMrU,IAAI,MAAMqU,EAAM,QAAO;AAC7B,aAAOqR,IAAgB1lB,IAAIA,EAAE,IAAI+hB,OAAKA,EAAE,IAAI;IAC9C,MAJE,QAAO,CAAA;EAKX;EAsBA,YACE1N,IAAwD,KAAK,KAC7DyF,IAAmC,EACjC,eAAe,KAAA,GAChB;AAEG,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EAAE,eAAAqR,IAAgB,KAAI,IAAK5L;AACjC,WAAKzF,EAAM,WAAU,IAEVqR,IACFrR,EAAM,YAAW,IAEjBA,EAAM,YAAW,EAAG,IAAI0N,OAAKA,EAAE,IAAI,IAJnC,CAAA;EAMX;EAiBA,MAAM,MACJ1N,IAA2B,KAAK,KAAG;AAEnC,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,MAAK;EACpB;EAKA,UAAUA,IAA2B,KAAK,KAAG;AAC3C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,UAAS;EACxB;EAkCA,MAAM,SACJA,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI,MAAM1N,EAAM,SAAQ;AAC9B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAuBA,aACE1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI1N,EAAM,aAAY;AAC5B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAiCA,MAAM,SACJ1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI,MAAM1N,EAAM,SAAQ;AAC9B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAoBA,aACE1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI1N,EAAM,aAAY;AAC5B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EA6BA,MAAM,KACJ1N,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAiC,CAAA;AAAA,KACnC,CAAChc,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,KAAKF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAEvD,QAAMyP,IAAO,oBAAI,OACX+B,IAAO,CACXC,GACAzQ,MACE;AACFyO,QAAK,IAAIgC,CAAG,GACZA,EAAI,UAAU,CAAChQ,GAAI8N,MAAW;AAE5B,YAAI9N,EACF,QAAOT,EAAGS,CAAE;AAGd,YAAIzM,IAAMua,EAAQ;AAClB,YAAI,CAACva,EAAK,QAAOgM,EAAE;AACnB,YAAMhK,IAAO,MAAK;AACZ,YAAEhC,MAAQ,KACZgM,EAAE;QAEN;AACA,iBAAW0M,KAAK6B,EAAAA,EACV,CAACha,KAAUA,EAAOmY,CAAC,MACrB6D,EAAQ,KAAKF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,GAE3C4D,KAAU5D,EAAE,eAAc,IAC5BA,EAAE,SAAQ,EACP,KAAKxjB,OAAMA,GAAG,UAAS,IAAKA,EAAE,MAAK,IAAKA,CAAE,EAC1C,KAAKA,OACJA,GAAG,WAAWulB,GAAMC,CAAU,IAAI8B,EAAKtnB,GAAG8M,CAAI,IAAIA,EAAI,CAAE,IAGxD0W,EAAE,WAAW+B,GAAMC,CAAU,IAC/B8B,EAAK9D,GAAG1W,CAAI,IAEZA,EAAI;MAIZ,GAAG,IAAI;IACT,GAEMzE,IAAQyN;AACd,WAAO,IAAI,QAA+B,CAAC6B,GAAKC,MAAO;AACrD0P,QAAKjf,GAAOkP,OAAK;AAEf,YAAIA,EAAI,QAAOK,EAAIL,CAAE;AAErBI,UAAI0P,CAAgC;MACtC,CAAC;IACH,CAAC;EACH;EA6BA,SACEvR,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAiC,CAAA;AAAA,KACnC,CAAChc,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,KAAKF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAEvD,QAAMyP,IAAO,oBAAI,IAAc,CAACzP,CAAK,CAAC;AACtC,aAAWyR,KAAOhC,GAAM;AACtB,UAAMF,IAAUkC,EAAI,YAAW;AAC/B,eAAW/D,KAAK6B,GAAS;AAAA,SACnB,CAACha,KAAUA,EAAOmY,CAAC,MACrB6D,EAAQ,KAAKF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE;AAE/C,YAAIxjB,IAA0BwjB;AAC9B,YAAIA,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,YAAE,UAAS,KAAIA,EAAE,UAAS;QAChC;AACIA,UAAE,WAAWulB,GAAMC,CAAU,KAC/BD,EAAK,IAAIvlB,CAAC;MAEd;IACF;AACA,WAAOqnB;EACT;EAWA,CAAC,OAAO,aAAa,IAAC;AACpB,WAAO,KAAK,QAAO;EACrB;EA+BA,QACEvR,IAAyC,KAAK,KAC9ClU,IAAuB,CAAA,GAAE;AAKzB,WAAI,OAAOkU,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5Ble,IAAUkU,GACVA,IAAQ,KAAK,MAER,KAAK,OAAOA,GAAOlU,CAAO,EAAE,OAAO,aAAa,EAAC;EAC1D;EAOA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,YAAW;EACzB;EAuBA,CAAC,YACCkU,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK;AAAAA,KACA,CAAClQ,KAAUA,EAAOyK,CAAK,OACzB,MAAMqR,IAAgBrR,IAAQA,EAAM,SAAQ;AAE9C,QAAMyP,IAAO,oBAAI,IAAc,CAACzP,CAAK,CAAC;AACtC,aAAWyR,KAAOhC,GAAM;AACtB,UAAMF,IAAUkC,EAAI,YAAW;AAC/B,eAAW/D,KAAK6B,GAAS;AAAA,SACnB,CAACha,KAAUA,EAAOmY,CAAC,OACrB,MAAM2D,IAAgB3D,IAAIA,EAAE,SAAQ;AAEtC,YAAIxjB,IAA0BwjB;AAC9B,YAAIA,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,YAAE,UAAS,KAAIA,EAAE,UAAS;QAChC;AACIA,UAAE,WAAWulB,GAAMC,CAAU,KAC/BD,EAAK,IAAIvlB,CAAC;MAEd;IACF;EACF;EA2BA,OACE8V,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAU,IAAI1O,EAA4B,EAAE,YAAY,KAAI,CAAE;AAAA,KAChE,CAACtN,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,MAAMF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAExD,QAAMyP,IAAO,oBAAI,OACXiC,IAAoB,CAAC1R,CAAK,GAC5B2R,IAAa,GACXC,IAAU,MAAK;AACnB,UAAIC,IAAS;AACb,aAAO,CAACA,KAAQ;AACd,YAAMJ,IAAMC,EAAM,MAAK;AACvB,YAAI,CAACD,GAAK;AACJE,gBAAe,KAAGJ,EAAQ,IAAG;AACjC;QACF;AAEAI,aACAlC,EAAK,IAAIgC,CAAG;AAEZ,YAAMK,IAAY,CAChBrQ,GACA8N,GACAwC,IAAwB,UACtB;AAEF,cAAItQ,EAAI,QAAO8P,EAAQ,KAAK,SAAS9P,CAAE;AAEvC,cAAI6P,KAAU,CAACS,GAAc;AAC3B,gBAAMC,IAA4C,CAAA;AAClD,qBAAWtE,KAAK6B,EACV7B,GAAE,eAAc,KAClBsE,EAAS,KACPtE,EACG,SAAQ,EACR,KAAMxjB,OACLA,GAAG,UAAS,IAAKA,EAAE,MAAK,IAAKA,CAAC,CAC/B;AAIT,gBAAI8nB,EAAS,QAAQ;AACnB,sBAAQ,IAAIA,CAAQ,EAAE,KAAK,MACzBF,EAAU,MAAMvC,GAAS,IAAI,CAAC;AAEhC;YACF;UACF;AAEA,mBAAW7B,KAAK6B,EACV7B,OAAM,CAACnY,KAAUA,EAAOmY,CAAC,OACtB6D,EAAQ,MAAMF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,MACjDmE,IAAS;AAKfF;AACA,mBAAWjE,KAAK6B,GAAS;AACvB,gBAAMrlB,IAAIwjB,EAAE,eAAc,KAAMA;AAC5BxjB,cAAE,WAAWulB,GAAMC,CAAU,KAC/BgC,EAAM,KAAKxnB,CAAC;UAEhB;AACI2nB,eAAU,CAACN,EAAQ,UACrBA,EAAQ,KAAK,SAASK,CAAO,IACnBK,KACVL,EAAO;QAEX,GAGIK,IAAO;AACXR,UAAI,UAAUK,GAAW,IAAI,GAC7BG,IAAO;MACT;IACF;AACA,WAAAL,EAAO,GACAL;EACT;EA8BA,WACEvR,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAU,IAAI1O,EAA4B,EAAE,YAAY,KAAI,CAAE,GAC9D4M,IAAO,oBAAI;AAAA,KACb,CAACla,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,MAAMF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAExD,QAAM0R,IAAoB,CAAC1R,CAAK,GAC5B2R,IAAa,GACXC,IAAU,MAAK;AACnB,UAAIC,IAAS;AACb,aAAO,CAACA,KAAQ;AACd,YAAMJ,IAAMC,EAAM,MAAK;AACvB,YAAI,CAACD,GAAK;AACJE,gBAAe,KAAGJ,EAAQ,IAAG;AACjC;QACF;AACAI,aACAlC,EAAK,IAAIgC,CAAG;AAEZ,YAAMlC,IAAUkC,EAAI,YAAW;AAC/B,iBAAW/D,KAAK6B,EAAAA,EACV,CAACha,KAAUA,EAAOmY,CAAC,OAChB6D,EAAQ,MAAMF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,MACjDmE,IAAS;AAIfF;AACA,iBAAWjE,KAAK6B,GAAS;AACvB,cAAIrlB,IAA0BwjB;AAC9B,cAAIA,EAAE,eAAc,GAAI;AACtB,gBAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,cAAE,UAAS,KAAIA,EAAE,UAAS;UAChC;AACIA,YAAE,WAAWulB,GAAMC,CAAU,KAC/BgC,EAAM,KAAKxnB,CAAC;QAEhB;MACF;AACI2nB,WAAU,CAACN,EAAQ,WAASA,EAAQ,KAAK,SAASK,CAAO;IAC/D;AACA,WAAAA,EAAO,GACAL;EACT;EAEA,MAAMrc,IAAsB,KAAK,KAAG;AAClC,QAAM0a,IAAS,KAAK;AACpB,SAAK,MAAM,OAAO1a,KAAS,WAAW,KAAK,IAAI,QAAQA,CAAI,IAAIA,GAC/D,KAAK,IAAI6U,EAAQ,EAAE6F,CAAM;EAC3B;AAAA;AA1iFF,IAknFaM,KAAP,cAA+BI,GAAc;EAIjD,MAAY;EAEZ,YACEG,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,KAAI,IAAKvG;AAC1B,UAAMgL,GAAKT,iBAAAA,OAAO,MAAM,EAAE,GAAGvK,GAAM,QAAAuG,EAAM,CAAE,GAC3C,KAAK,SAASA;AACd,aAASrgB,IAA0B,KAAK,KAAKA,GAAGA,IAAIA,EAAE,OACpDA,GAAE,SAAS,KAAK;EAEpB;EAKA,cAAc8lB,GAAW;AAIvB,WAAOzB,iBAAAA,MAAM,MAAMyB,CAAG,EAAE,KAAK,YAAW;EAC1C;EAKA,QAAQb,GAAW;AACjB,WAAO,IAAId,GACT,KAAK,UACLtH,GACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAoI,EAAE,CAAE;EAEV;EAKA,WAAWjlB,GAAS;AAClB,WACEA,EAAE,WAAW,GAAG,KAAKA,EAAE,WAAW,IAAI,KAAK,kBAAkB,KAAKA,CAAC;EAEvE;AAAA;AApqFF,IA8qFaumB,KAAP,cAA+B5B,GAAc;EAIjD,MAAW;EACX,YACEG,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,MAAK,IAAKvG;AAC3B,UAAMgL,GAAK0B,iBAAAA,OAAO,KAAK,EAAE,GAAG1M,GAAM,QAAAuG,EAAM,CAAE,GAC1C,KAAK,SAASA;EAChB;EAKA,cAAcoG,GAAY;AACxB,WAAO;EACT;EAKA,QAAQxB,GAAW;AACjB,WAAO,IAAIT,GACT,KAAK,UACL3H,GACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAoI,EAAE,CAAE;EAEV;EAKA,WAAWjlB,GAAS;AAClB,WAAOA,EAAE,WAAW,GAAG;EACzB;AAAA;AAvtFF,IAkuFa0mB,KAAP,cAAgCH,GAAe;EACnD,YACEzB,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,KAAI,IAAKvG;AAC1B,UAAMgL,GAAK,EAAE,GAAGhL,GAAM,QAAAuG,EAAM,CAAE;EAChC;AAAA;AAzuFF,IAivFasG,KAAO,QAAQ,aAAa,UAAUxC,KAAYK;AAjvF/D,IA0vFaoC,KAIX,QAAQ,aAAa,UAAUrC,KAC7B,QAAQ,aAAa,WAAWmC,KAChCH;AE5vFJ,IAAMM,KAAiBnhB,CAAAA,OACrBA,GAAG,UAAU;AADf,IAEMohB,KAAcC,CAAAA,OAAiCA,GAAG,UAAU;AAFlE,IAIMC,KAAgB,uBAAO,IAAI,4BAA4B;AAJ7D,IAUaC,KAAP,MAAOC,GAAO;EACTC;EACAC;EACAC;EACA;EACAC;EACTC;EACAC;EACAC;EACAC;EACAC;EACAC,KAA2B;EAE3B,YACEC,GACAC,GACAtX,GACAuX,GAAyB;AAEzB,QAAI,CAAClB,GAAcgB,CAAW,EAC5B,OAAM,IAAI,UAAU,oBAAoB;AAE1C,QAAI,CAACf,GAAWgB,CAAQ,EACtB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,QAAIA,EAAS,WAAWD,EAAY,OAClC,OAAM,IAAI,UAAU,+CAA+C;AAGrE,QADA,KAAK,SAASA,EAAY,QACtBrX,IAAQ,KAAKA,KAAS,KAAK,OAC7B,OAAM,IAAI,UAAU,oBAAoB;AAQ1C,QANA,KAAK2W,KAAeU,GACpB,KAAKT,KAAYU,GACjB,KAAKT,KAAS7W,GACd,KAAK8W,KAAYS,GAGb,KAAKV,OAAW,GAAA;AASlB,UAAI,KAAK,MAAK,GAAI;AAEhB,YAAM,CAACW,GAAIC,GAAI3c,GAAI4c,GAAI,GAAGC,CAAK,IAAI,KAAKhB,IAClC,CAACiB,GAAIC,GAAIC,GAAIC,GAAI,GAAGC,CAAK,IAAI,KAAKpB;AACpCe,UAAM,CAAC,MAAM,OAEfA,EAAM,MAAK,GACXK,EAAM,MAAK;AAEb,YAAM,IAAI,CAACR,GAAIC,GAAI3c,GAAI4c,GAAI,EAAE,EAAE,KAAK,GAAG,GACjCO,IAAI,CAACL,GAAIC,GAAIC,GAAIC,GAAI,EAAE,EAAE,KAAK,GAAG;AACvC,aAAKpB,KAAe,CAAC,GAAG,GAAGgB,CAAK,GAChC,KAAKf,KAAY,CAACqB,GAAG,GAAGD,CAAK,GAC7B,KAAK,SAAS,KAAKrB,GAAa;MAClC,WAAW,KAAK,QAAO,KAAM,KAAK,WAAU,GAAI;AAC9C,YAAM,CAACc,GAAI,GAAGE,CAAK,IAAI,KAAKhB,IACtB,CAACkB,GAAI,GAAGG,CAAK,IAAI,KAAKpB;AACxBe,UAAM,CAAC,MAAM,OAEfA,EAAM,MAAK,GACXK,EAAM,MAAK;AAEb,YAAMxoB,IAAKioB,IAAgB,KACrBQ,IAAIJ,IAAK;AACf,aAAKlB,KAAe,CAACnnB,GAAG,GAAGmoB,CAAK,GAChC,KAAKf,KAAY,CAACqB,GAAG,GAAGD,CAAK,GAC7B,KAAK,SAAS,KAAKrB,GAAa;MAClC;IAAA;EAEJ;EAEA,CAACH,EAAa,IAAC;AACb,WAAO,cAAc,KAAKI,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG,IAAI;EACrE;EAKA,UAAO;AACL,WAAO,KAAKF,GAAa,KAAKE,EAAM;EACtC;EAKA,WAAQ;AACN,WAAO,OAAO,KAAKF,GAAa,KAAKE,EAAM,KAAM;EACnD;EAIA,aAAU;AACR,WAAO,KAAKF,GAAa,KAAKE,EAAM,MAAM5d;EAC5C;EAIA,WAAQ;AACN,WAAO,KAAK0d,GAAa,KAAKE,EAAM,aAAa;EACnD;EAKA,aAAU;AACR,WAAQ,KAAKG,KACX,KAAKA,OACJ,KAAKH,OAAW,IACf,KAAK,WAAU,IACb,KAAKD,GAAU,CAAC,IAAI,KAAKA,GAAU,MAAM,CAAC,EAAE,KAAK,GAAG,IACpD,KAAKA,GAAU,KAAK,GAAG,IACzB,KAAKA,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG;EAChD;EAKA,UAAO;AACL,WAAO,KAAK,SAAS,KAAKA,KAAS;EACrC;EAKA,OAAI;AACF,WAAI,KAAKE,OAAU,SAAkB,KAAKA,KACrC,KAAK,QAAO,KACjB,KAAKA,KAAQ,IAAIL,GACf,KAAKC,IACL,KAAKC,IACL,KAAKC,KAAS,GACd,KAAKC,EAAS,GAEhB,KAAKC,GAAMI,KAAc,KAAKA,IAC9B,KAAKJ,GAAMG,KAAS,KAAKA,IACzB,KAAKH,GAAME,KAAW,KAAKA,IACpB,KAAKF,MAViB,KAAKA,KAAQ;EAW5C;EAKA,QAAK;AACH,QAAM7hB,IAAK,KAAKyhB;AAChB,WAAO,KAAKO,OAAW,SACnB,KAAKA,KACJ,KAAKA,KACJ,KAAKJ,OAAc,WACnB,KAAKD,OAAW,KAChB3hB,EAAG,CAAC,MAAM,MACVA,EAAG,CAAC,MAAM,MACV,OAAOA,EAAG,CAAC,KAAM,YACjB,CAAC,CAACA,EAAG,CAAC,KACN,OAAOA,EAAG,CAAC,KAAM,YACjB,CAAC,CAACA,EAAG,CAAC;EACd;EAUA,UAAO;AACL,QAAMA,IAAK,KAAKyhB;AAChB,WAAO,KAAKM,OAAa,SACrB,KAAKA,KACJ,KAAKA,KACJ,KAAKH,OAAc,WACnB,KAAKD,OAAW,KAChB,KAAK,SAAS,KACd,OAAO3hB,EAAG,CAAC,KAAM,YACjB,YAAY,KAAKA,EAAG,CAAC,CAAC;EAC9B;EAQA,aAAU;AACR,QAAMA,IAAK,KAAKyhB;AAChB,WAAO,KAAKQ,OAAgB,SACxB,KAAKA,KACJ,KAAKA,KACHjiB,EAAG,CAAC,MAAM,MAAMA,EAAG,SAAS,KAC7B,KAAK,QAAO,KACZ,KAAK,MAAK;EAClB;EAKA,OAAI;AACF,QAAM1F,IAAI,KAAKmnB,GAAa,CAAC;AAC7B,WACI,OAAOnnB,KAAM,YAAY,KAAK,WAAU,KAAM,KAAKqnB,OAAW,IAE9DrnB,IACA;EACN;EAMA,sBAAmB;AACjB,WAAO,EACL,KAAKqnB,OAAW,KAChB,CAAC,KAAK,WAAU,KAChB,CAAC,KAAKO;EAEV;EAKA,qBAAkB;AAChB,WAAI,KAAKP,OAAW,KAAK,CAAC,KAAK,WAAU,KAAM,CAAC,KAAKO,KAC5C,SACT,KAAKA,KAAkB,OAChB;EACT;AAAA;ACpPF,IAAMte,KAEF,OAAO,WAAY,YACnB,WACA,OAAO,QAAQ,YAAa,WAE5B,QAAQ,WACR;AAPJ,IAYaof,KAAP,MAAa;EACjB;EACA;EACA;EACA;EACA;EACA;EAEA,YACEC,GACA,EACE,SAAAC,GACA,QAAAvI,GACA,OAAAtX,GACA,YAAA8f,GACA,UAAAd,IAAWze,GAAe,GACX;AAEjB,SAAK,WAAW,CAAA,GAChB,KAAK,WAAW,CAAA,GAChB,KAAK,mBAAmB,CAAA,GACxB,KAAK,mBAAmB,CAAA,GACxB,KAAK,WAAWye,GAChB,KAAK,SAAS,EACZ,KAAK,MACL,SAAAa,GACA,QAAAvI,GACA,OAAAtX,GACA,YAAA8f,GACA,mBAAmB,GACnB,UAAAd,GACA,WAAW,MACX,UAAU,KAAA;AAEZ,aAAWe,KAAOH,EAAS,MAAK,IAAIG,CAAG;EACzC;EAEA,IAAIA,GAAW;AAab,QAAM1e,IAAK,IAAIvC,EAAUihB,GAAK,KAAK,MAAM;AACzC,aAASxqB,IAAI,GAAGA,IAAI8L,EAAG,IAAI,QAAQ9L,KAAK;AACtC,UAAMyqB,IAAS3e,EAAG,IAAI9L,CAAC,GACjBwM,IAAYV,EAAG,UAAU9L,CAAC;AAEhC,UAAI,CAACyqB,KAAU,CAACje,EACd,OAAM,IAAI,MAAM,wBAAwB;AAI1C,aAAOie,EAAO,CAAC,MAAM,OAAOje,EAAU,CAAC,MAAM,MAC3Cie,GAAO,MAAK,GACZje,EAAU,MAAK;AAGjB,UAAM9K,IAAI,IAAIinB,GAAQ8B,GAAQje,GAAW,GAAG,KAAK,QAAQ,GACnDhN,IAAI,IAAI+J,EAAU7H,EAAE,WAAU,GAAI,KAAK,MAAM,GAC7CsgB,IAAWxV,EAAUA,EAAU,SAAS,CAAC,MAAM,MAC/Cke,IAAWhpB,EAAE,WAAU;AACzBgpB,UAAU,KAAK,SAAS,KAAKlrB,CAAC,IAC7B,KAAK,SAAS,KAAKA,CAAC,GACrBwiB,MACE0I,IAAU,KAAK,iBAAiB,KAAKlrB,CAAC,IACrC,KAAK,iBAAiB,KAAKA,CAAC;IAErC;EACF;EAEA,QAAQkC,GAAO;AACb,QAAM2gB,IAAW3gB,EAAE,SAAQ,GACrBipB,IAAY,GAAGtI,CAAQ,KACvBuI,IAAWlpB,EAAE,SAAQ,KAAM,KAC3BmpB,IAAY,GAAGD,CAAQ;AAC7B,aAAWprB,KAAK,KAAK,SACnB,KAAIA,EAAE,MAAMorB,CAAQ,KAAKprB,EAAE,MAAMqrB,CAAS,EAAG,QAAO;AAEtD,aAAWrrB,KAAK,KAAK,SACnB,KAAIA,EAAE,MAAM6iB,CAAQ,KAAK7iB,EAAE,MAAMmrB,CAAS,EAAG,QAAO;AAEtD,WAAO;EACT;EAEA,gBAAgBjpB,GAAO;AACrB,QAAM2gB,IAAW3gB,EAAE,SAAQ,IAAK,KAC1BkpB,KAAYlpB,EAAE,SAAQ,KAAM,OAAO;AACzC,aAAWlC,KAAK,KAAK,iBACnB,KAAIA,EAAE,MAAMorB,CAAQ,EAAG,QAAO;AAEhC,aAAWprB,KAAK,KAAK,iBACnB,KAAIA,EAAE,MAAM6iB,CAAQ,EAAG,QAAO;AAEhC,WAAO;EACT;AAAA;ACxHI,IAAOyI,KAAP,MAAOC,GAAc;EACzB;EACA,YAAYC,IAAkC,oBAAI,OAAK;AACrD,SAAK,QAAQA;EACf;EACA,OAAI;AACF,WAAO,IAAID,GAAe,IAAI,IAAI,KAAK,KAAK,CAAC;EAC/C;EACA,UAAUnI,GAAclf,GAAgB;AACtC,WAAO,KAAK,MAAM,IAAIkf,EAAO,SAAQ,CAAE,GAAG,IAAIlf,EAAQ,WAAU,CAAE;EACpE;EACA,YAAYkf,GAAclf,GAAgB;AACxC,QAAM2e,IAAWO,EAAO,SAAQ,GAC1BT,IAAS,KAAK,MAAM,IAAIE,CAAQ;AAClCF,QAAQA,EAAO,IAAIze,EAAQ,WAAU,CAAE,IACtC,KAAK,MAAM,IAAI2e,GAAU,oBAAI,IAAI,CAAC3e,EAAQ,WAAU,CAAE,CAAC,CAAC;EAC/D;AAAA;AAhBI,IAwBOunB,KAAP,MAAkB;EACtB,QAA2B,oBAAI;EAC/B,IAAIrI,GAAc8H,GAAmBQ,GAAc;AACjD,QAAMpoB,KAAK4nB,IAAW,IAAI,MAAMQ,IAAQ,IAAI,IACtCC,IAAU,KAAK,MAAM,IAAIvI,CAAM;AACrC,SAAK,MAAM,IAAIA,GAAQuI,MAAY,SAAYroB,IAAIA,IAAIqoB,CAAO;EAChE;EAEA,UAAO;AACL,WAAO,CAAC,GAAG,KAAK,MAAM,QAAO,CAAE,EAAE,IAAI,CAAC,CAAClgB,GAAMnI,CAAC,MAAM,CAClDmI,GACA,CAAC,EAAEnI,IAAI,IACP,CAAC,EAAEA,IAAI,EAAA,CACR;EACH;AAAA;AAtCI,IA6COsoB,KAAP,MAAe;EACnB,QAA8B,oBAAI;EAClC,IAAIxI,GAAclf,GAAgB;AAChC,QAAI,CAACkf,EAAO,WAAU,EACpB;AAEF,QAAMyI,IAAO,KAAK,MAAM,IAAIzI,CAAM;AAC9ByI,QACGA,EAAK,KAAK3pB,OAAKA,EAAE,WAAU,MAAOgC,EAAQ,WAAU,CAAE,KACzD2nB,EAAK,KAAK3nB,CAAO,IAEd,KAAK,MAAM,IAAIkf,GAAQ,CAAClf,CAAO,CAAC;EACzC;EACA,IAAIkf,GAAY;AACd,QAAMyI,IAAO,KAAK,MAAM,IAAIzI,CAAM;AAElC,QAAI,CAACyI,EACH,OAAM,IAAI,MAAM,iCAAiC;AAGnD,WAAOA;EACT;EACA,UAAO;AACL,WAAO,KAAK,KAAI,EAAG,IAAI7oB,OAAK,CAACA,GAAG,KAAK,MAAM,IAAIA,CAAC,CAAc,CAAC;EACjE;EACA,OAAI;AACF,WAAO,CAAC,GAAG,KAAK,MAAM,KAAI,CAAE,EAAE,OAAO,OAAK,EAAE,WAAU,CAAE;EAC1D;AAAA;AAxEI,IAiFO8oB,KAAP,MAAOC,GAAS;EACpB;EACA,UAAU,IAAIN;EACd,WAAW,IAAIG;EACf;EACA;EACA;EACA;EAEA,YAAY5P,GAAsBgQ,GAA+B;AAC/D,SAAK,OAAOhQ,GACZ,KAAK,SAAS,CAAC,CAACA,EAAK,QACrB,KAAK,MAAM,CAAC,CAACA,EAAK,KAClB,KAAK,iBACHgQ,IAAiBA,EAAe,KAAI,IAAK,IAAIV;EACjD;EAEA,gBAAgBlI,GAAc6I,GAAmB;AAC/C,SAAK,WAAWA;AAChB,QAAMC,IAAmCD,EAAS,IAAI/pB,OAAK,CAACkhB,GAAQlhB,CAAC,CAAC;AAKtE,aAAS,CAAC6S,GAAG7Q,CAAO,KAAKgoB,GAAe;AACtC,WAAK,eAAe,YAAYnX,GAAG7Q,CAAO;AAE1C,UAAMme,IAAOne,EAAQ,KAAI,GACnBgnB,IAAWhnB,EAAQ,WAAU,KAAM,KAAK,KAAK,aAAa;AAGhE,UAAIme,GAAM;AACRtN,YAAIA,EAAE,QACJsN,MAAS,OAAO,KAAK,KAAK,SAAS,SACjC,KAAK,KAAK,OACVA,CAAI;AAER,YAAM8J,IAAOjoB,EAAQ,KAAI;AACzB,YAAKioB,EAIHjoB,KAAUioB;aAJD;AACT,eAAK,QAAQ,IAAIpX,GAAG,MAAM,KAAK;AAC/B;QACF;MAGF;AAEA,UAAIA,EAAE,SAAQ,EAAI;AAElB,UAAI7S,GACAiqB,GACA/F,IAAU;AACd,aACE,QAAQlkB,IAAIgC,EAAQ,QAAO,MAAQ,aAClCioB,IAAOjoB,EAAQ,KAAI,KAGpB6Q,KADUA,EAAE,QAAQ7S,CAAC,GAErBgC,IAAUioB,GACV/F,IAAU;AAIZ,UAFAlkB,IAAIgC,EAAQ,QAAO,GACnBioB,IAAOjoB,EAAQ,KAAI,GACfkiB,GAAS;AACX,YAAI,KAAK,eAAe,UAAUrR,GAAG7Q,CAAO,EAAG;AAC/C,aAAK,eAAe,YAAY6Q,GAAG7Q,CAAO;MAC5C;AAKA,UAAI,OAAOhC,KAAM,UAAU;AAGzB,YAAMwpB,IAAQxpB,MAAM,QAAQA,MAAM,MAAMA,MAAM;AAC9C,aAAK,QAAQ,IAAI6S,EAAE,QAAQ7S,CAAC,GAAGgpB,GAAUQ,CAAK;AAC9C;MACF,WAAWxpB,MAAMyJ,GAAU;AAAA,SAOvB,CAACoJ,EAAE,eAAc,KACjB,KAAK,UACL7Q,EAAQ,oBAAmB,MAE3B,KAAK,SAAS,IAAI6Q,GAAG7Q,CAAO;AAE9B,YAAMgiB,IAAKiG,GAAM,QAAO,GAClBC,IAAQD,GAAM,KAAI;AACxB,YAAI,CAACA,MAAUjG,MAAO,MAAMA,MAAO,QAAQ,CAACkG,EAG1C,MAAK,QAAQ,IAAIrX,GAAGmW,GAAUhF,MAAO,MAAMA,MAAO,GAAG;iBAEjDA,MAAO,MAAM;AAIf,cAAMmG,IAAKtX,EAAE,UAAUA;AAElBqX,cACK,KAAK,eAAe,UAAUC,GAAID,CAAK,KAC/C,KAAK,SAAS,IAAIC,GAAID,CAAK,IAFjB,KAAK,QAAQ,IAAIC,GAAInB,GAAU,IAAI;QAIjD;MAEJ,MAAWhpB,cAAa,UACtB,KAAK,SAAS,IAAI6S,GAAG7Q,CAAO;IAEhC;AAEA,WAAO;EACT;EAEA,iBAAc;AACZ,WAAO,KAAK,SAAS,KAAI;EAC3B;EAEA,QAAK;AACH,WAAO,IAAI6nB,GAAU,KAAK,MAAM,KAAK,cAAc;EACrD;EAMA,cAAcxkB,GAAcue,GAAe;AACzC,QAAMmG,IAAW,KAAK,SAAS,IAAI1kB,CAAM,GAEnCugB,IAAU,KAAK,MAAK;AAC1B,aAAW7D,KAAK6B,EACd,UAAW5hB,KAAW+nB,GAAU;AAC9B,UAAMf,IAAWhnB,EAAQ,WAAU,GAC7BhC,IAAIgC,EAAQ,QAAO,GACnBioB,IAAOjoB,EAAQ,KAAI;AACrBhC,YAAMyJ,IACRmc,EAAQ,aAAa7D,GAAG/f,GAASioB,GAAMjB,CAAQ,IACtChpB,aAAa,SACtB4lB,EAAQ,WAAW7D,GAAG/hB,GAAGiqB,GAAMjB,CAAQ,IAEvCpD,EAAQ,WAAW7D,GAAG/hB,GAAGiqB,GAAMjB,CAAQ;IAE3C;AAEF,WAAOpD;EACT;EAEA,aACE7D,GACA/f,GACAioB,GACAjB,GAAiB;AAyBjB,SAvBI,KAAK,OAAO,CAACjH,EAAE,KAAK,WAAW,GAAG,OAC/B/f,EAAQ,QAAO,KAClB,KAAK,QAAQ,IAAI+f,GAAGiH,GAAU,KAAK,GAEjCjH,EAAE,WAAU,MAMV,KAAK,UAAU,CAACA,EAAE,eAAc,IAClC,KAAK,SAAS,IAAIA,GAAG/f,CAAO,IACnB+f,EAAE,eAAc,MACrBkI,KAAQjoB,EAAQ,oBAAmB,IACrC,KAAK,SAAS,IAAI+f,GAAGkI,CAAI,IAChBjoB,EAAQ,mBAAkB,KACnC,KAAK,SAAS,IAAI+f,GAAG/f,CAAO,MAOhCioB,GAAM;AACR,UAAMjG,IAAKiG,EAAK,QAAO;AACvB,UACE,OAAOjG,KAAO,YAEdA,MAAO,QACPA,MAAO,MACPA,MAAO,IAEP,MAAK,WAAWjC,GAAGiC,GAAIiG,EAAK,KAAI,GAAIjB,CAAQ;eACnChF,MAAO,MAAM;AAEtB,YAAMoG,IAAKrI,EAAE,UAAUA;AAEvB,aAAK,SAAS,IAAIqI,GAAIH,CAAI;MAC5B,MAAWjG,cAAc,UACvB,KAAK,WAAWjC,GAAGiC,GAAIiG,EAAK,KAAI,GAAIjB,CAAQ;IAEhD;EACF;EAEA,WACEjH,GACA/hB,GACAiqB,GACAjB,GAAiB;AAEZhpB,MAAE,KAAK+hB,EAAE,IAAI,MACbkI,IAGH,KAAK,SAAS,IAAIlI,GAAGkI,CAAI,IAFzB,KAAK,QAAQ,IAAIlI,GAAGiH,GAAU,KAAK;EAIvC;EAEA,WAAWjH,GAAS/hB,GAAWiqB,GAAsBjB,GAAiB;AAE/DjH,MAAE,QAAQ/hB,CAAC,MACXiqB,IAGH,KAAK,SAAS,IAAIlI,GAAGkI,CAAI,IAFzB,KAAK,QAAQ,IAAIlI,GAAGiH,GAAU,KAAK;EAIvC;AAAA;AC9OF,IAAMqB,KAAa,CACjBC,IACAxQ,MAEA,OAAOwQ,MAAW,WAAW,IAAI5B,GAAO,CAAC4B,EAAM,GAAGxQ,CAAI,IACpD,MAAM,QAAQwQ,EAAM,IAAI,IAAI5B,GAAO4B,IAAQxQ,CAAI,IAC/CwQ;AANJ,IAWsBC,KAAhB,MAAwB;EAC5B;EACA;EACA;EACA,OAAkB,oBAAI;EACtB,SAAkB;EAClB,UAAmB;EACnBC,KAA2B,CAAA;EAC3BC;EACAC;EACA;EACA;EACA;EAGA,YAAYX,GAAqBxgB,GAAYuQ,GAAO;AAMlD,QALA,KAAK,WAAWiQ,GAChB,KAAK,OAAOxgB,GACZ,KAAK,OAAOuQ,GACZ,KAAK4Q,KAAO,CAAC5Q,EAAK,SAASA,EAAK,aAAa,UAAU,OAAO,KAC9D,KAAK,sBAAsBA,EAAK,wBAAwB,QACpDA,EAAK,UAAU,CAAC,KAAK,yBACvB,KAAK2Q,KAAUJ,GAAWvQ,EAAK,UAAU,CAAA,GAAIA,CAAI,GAE/C,CAAC,KAAK,uBACN,OAAO,KAAK2Q,GAAQ,OAAQ,aAC5B;AACA,UAAM3sB,IAAI;AACV,YAAM,IAAI,MAAMA,CAAC;IACnB;AAKF,SAAK,WAAWgc,EAAK,YAAY,IAAA,GAE7BA,EAAK,WACP,KAAK,SAASA,EAAK,QACnB,KAAK,OAAO,iBAAiB,SAAS,MAAK;AACzC,WAAK0Q,GAAU,SAAS;IAC1B,CAAC;EAEL;EAEAG,GAASphB,GAAU;AACjB,WAAO,KAAK,KAAK,IAAIA,CAAI,KAAK,CAAC,CAAC,KAAKkhB,IAAS,UAAUlhB,CAAI;EAC9D;EACAqhB,GAAiBrhB,GAAU;AACzB,WAAO,CAAC,CAAC,KAAKkhB,IAAS,kBAAkBlhB,CAAI;EAC/C;EAGA,QAAK;AACH,SAAK,SAAS;EAChB;EACA,SAAM;AAEJ,QAAI,KAAK,QAAQ,QAAS;AAE1B,SAAK,SAAS;AACd,QAAIoE;AACJ,WAAO,CAAC,KAAK,WAAWA,IAAK,KAAK6c,GAAU,MAAK,KAC/C7c,GAAE;EAEN;EACA,SAASA,GAAa;AAChB,SAAK,QAAQ,YAEZ,KAAK,SAIR,KAAK6c,GAAU,KAAK7c,CAAE,IAHtBA,EAAE;EAKN;EAIA,MAAM,WAAWoU,GAASyH,GAAc;AACtC,QAAIA,KAAS,KAAK,KAAK,MAAO;AAC9B,QAAIqB;AACJ,QAAI,KAAK,KAAK,UAAU;AAEtB,UADAA,IAAM9I,EAAE,eAAc,KAAO,MAAMA,EAAE,SAAQ,GACzC,CAAC8I,EAAK;AACV9I,UAAI8I;IACN;AAEA,QAAM1oB,IADW4f,EAAE,UAAS,KAAM,KAAK,KAAK,OACvB,MAAMA,EAAE,MAAK,IAAKA;AACvC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS5f,GAAG,eAAc,GAAI;AAC9D,UAAM+e,IAAS,MAAM/e,EAAE,SAAQ;AAE3B+e,YAAWA,EAAO,UAAS,KAAM,KAAK,KAAK,SAC7C,MAAMA,EAAO,MAAK;IAGtB;AACA,WAAO,KAAK,eAAe/e,GAAGqnB,CAAK;EACrC;EAEA,eAAezH,GAAqByH,GAAc;AAChD,WACIzH,MACG,KAAK,aAAa,IAAA,KAAYA,EAAE,MAAK,KAAM,KAAK,cAChD,CAACyH,KAASzH,EAAE,WAAU,OACtB,CAAC,KAAK,KAAK,SAAS,CAACA,EAAE,YAAW,OAClC,CAAC,KAAK,KAAK,SACV,CAAC,KAAK,KAAK,UACX,CAACA,EAAE,eAAc,KACjB,CAACA,EAAE,eAAc,GAAI,YAAW,MAClC,CAAC,KAAK4I,GAAS5I,CAAC,IAElBA,IACA;EACN;EAEA,eAAeA,GAASyH,GAAc;AACpC,QAAIA,KAAS,KAAK,KAAK,MAAO;AAC9B,QAAIqB;AACJ,QAAI,KAAK,KAAK,UAAU;AAEtB,UADAA,IAAM9I,EAAE,eAAc,KAAMA,EAAE,aAAY,GACtC,CAAC8I,EAAK;AACV9I,UAAI8I;IACN;AAEA,QAAM1oB,IADW4f,EAAE,UAAS,KAAM,KAAK,KAAK,OACvBA,EAAE,UAAS,IAAKA;AACrC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS5f,GAAG,eAAc,GAAI;AAC9D,UAAM+e,IAAS/e,EAAE,aAAY;AACzB+e,YAAWA,GAAQ,UAAS,KAAM,KAAK,KAAK,SAC9CA,EAAO,UAAS;IAEpB;AACA,WAAO,KAAK,eAAe/e,GAAGqnB,CAAK;EACrC;EAKA,YAAYzH,GAASiH,GAAiB;AACpC,QAAI,KAAK2B,GAAS5I,CAAC,EAAG;AAEtB,QAAI,CAAC,KAAK,uBAAuB,KAAK0I,IAAS,KAAK;AAClD,UAAM3B,IAAM,GAAG/G,EAAE,cAAa,CAAE;AAChC,WAAK0I,GAAQ,IAAI3B,CAAG;IACtB;AACA,QAAMxD,IACJ,KAAK,KAAK,aAAa,SAAY0D,IAAW,KAAK,KAAK;AAC1D,SAAK,KAAK,IAAIjH,CAAC;AACf,QAAM+I,IAAO,KAAK,KAAK,QAAQ/I,EAAE,YAAW,IAAK,KAAK2I,KAAO;AAE7D,QAAI,KAAK,KAAK,cACZ,MAAK,UAAU3I,CAAC;aACPuD,GAAK;AACd,UAAMA,IAAM,KAAK,KAAK,QAAQvD,EAAE,cAAa,IAAKA,EAAE,SAAQ;AAC5D,WAAK,UAAUuD,IAAMwF,CAAI;IAC3B,OAAO;AACL,UAAMC,IAAM,KAAK,KAAK,QAAQhJ,EAAE,cAAa,IAAKA,EAAE,SAAQ,GACtDliB,IACJ,KAAK,KAAK,eAAe,CAACkrB,EAAI,WAAW,OAAO,KAAKL,EAAI,IACvD,MAAM,KAAKA,KACX;AACJ,WAAK,UAAWK,IAAmBlrB,IAAMkrB,IAAMD,IAAzB,MAAMA,CAAuB;IACrD;EACF;EAEA,MAAM,MAAM/I,GAASiH,GAAmBQ,GAAc;AACpD,QAAMxpB,IAAI,MAAM,KAAK,WAAW+hB,GAAGyH,CAAK;AACpCxpB,SAAG,KAAK,YAAYA,GAAGgpB,CAAQ;EACrC;EAEA,UAAUjH,GAASiH,GAAmBQ,GAAc;AAClD,QAAMxpB,IAAI,KAAK,eAAe+hB,GAAGyH,CAAK;AAClCxpB,SAAG,KAAK,YAAYA,GAAGgpB,CAAQ;EACrC;EAEA,OAAO9H,GAAc6I,GAAqB1U,GAAa;AAEjD,SAAK,QAAQ,WAASA,EAAE,GAE5B,KAAK,QAAQ6L,GAAQ6I,GAAU,IAAIH,GAAU,KAAK,IAAI,GAAGvU,CAAE;EAC7D;EAEA,QACE6L,GACA6I,GACAiB,GACA3V,GAAa;AAEb,QAAI,KAAKuV,GAAiB1J,CAAM,EAAG,QAAO7L,EAAE;AAE5C,QADI,KAAK,QAAQ,WAASA,EAAE,GACxB,KAAK,QAAQ;AACf,WAAK,SAAS,MAAM,KAAK,QAAQ6L,GAAQ6I,GAAUiB,GAAW3V,CAAE,CAAC;AACjE;IACF;AACA2V,MAAU,gBAAgB9J,GAAQ6I,CAAQ;AAK1C,QAAIkB,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,MACnBmtB,KACA,KAAK,MAAMntB,GAAGkrB,GAAUQ,CAAK,EAAE,KAAK,MAAMne,EAAI,CAAE;AAGlD,aAAWwH,KAAKmY,EAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,IAAA,KAAYnY,EAAE,MAAK,KAAM,KAAK,SAClD;AAEFoY;AACA,UAAMC,IAAiBrY,EAAE,cAAa;AAClCA,QAAE,cAAa,IACjB,KAAK,QAAQA,GAAGqY,GAAgBF,GAAW3f,CAAI,IAE/CwH,EAAE,UACA,CAACnM,GAAGkd,MAAY,KAAK,QAAQ/Q,GAAG+Q,GAASoH,GAAW3f,CAAI,GACxD,IAAI;IAGV;AAEAA,MAAI;EACN;EAEA,QACE6V,GACA0C,GACAoH,GACA3V,GAAa;AAEb2V,QAAYA,EAAU,cAAc9J,GAAQ0C,CAAO;AAEnD,QAAIqH,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,MACnBmtB,KACA,KAAK,MAAMntB,GAAGkrB,GAAUQ,CAAK,EAAE,KAAK,MAAMne,EAAI,CAAE;AAElD,aAAW,CAAC6V,GAAQ6I,CAAQ,KAAKiB,EAAU,SAAS,QAAO,EACzDC,MACA,KAAK,QAAQ/J,GAAQ6I,GAAUiB,EAAU,MAAK,GAAI3f,CAAI;AAGxDA,MAAI;EACN;EAEA,WAAW6V,GAAc6I,GAAqB1U,GAAa;AAErD,SAAK,QAAQ,WAASA,EAAE,GAE5B,KAAK,YAAY6L,GAAQ6I,GAAU,IAAIH,GAAU,KAAK,IAAI,GAAGvU,CAAE;EACjE;EAEA,YACE6L,GACA6I,GACAiB,GACA3V,GAAa;AAEb,QAAI,KAAKuV,GAAiB1J,CAAM,EAAG,QAAO7L,EAAE;AAE5C,QADI,KAAK,QAAQ,WAASA,EAAE,GACxB,KAAK,QAAQ;AACf,WAAK,SAAS,MACZ,KAAK,YAAY6L,GAAQ6I,GAAUiB,GAAW3V,CAAE,CAAC;AAEnD;IACF;AACA2V,MAAU,gBAAgB9J,GAAQ6I,CAAQ;AAK1C,QAAIkB,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,KACnB,KAAK,UAAUA,GAAGkrB,GAAUQ,CAAK;AAGnC,aAAW3W,KAAKmY,EAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,IAAA,KAAYnY,EAAE,MAAK,KAAM,KAAK,SAClD;AAEFoY;AACA,UAAM3K,IAAWzN,EAAE,YAAW;AAC9B,WAAK,YAAYA,GAAGyN,GAAU0K,GAAW3f,CAAI;IAC/C;AAEAA,MAAI;EACN;EAEA,YACE6V,GACA0C,GACAoH,GACA3V,GAAa;AAEb2V,QAAYA,EAAU,cAAc9J,GAAQ0C,CAAO;AAEnD,QAAIqH,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,KACnB,KAAK,UAAUA,GAAGkrB,GAAUQ,CAAK;AAEnC,aAAW,CAACtI,GAAQ6I,CAAQ,KAAKiB,EAAU,SAAS,QAAO,EACzDC,MACA,KAAK,YAAY/J,GAAQ6I,GAAUiB,EAAU,MAAK,GAAI3f,CAAI;AAG5DA,MAAI;EACN;AAAA;AAhVF,IAmVa8f,KAAP,cAEIZ,GAAW;EACnB,UAAU,oBAAI;EAEd,YAAYR,GAAqBxgB,GAAYuQ,GAAO;AAClD,UAAMiQ,GAAUxgB,GAAMuQ,CAAI;EAC5B;EAEA,UAAUiI,GAAY;AACpB,SAAK,QAAQ,IAAIA,CAAC;EACpB;EAEA,MAAM,OAAI;AACR,QAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;AAC5C,WAAI,KAAK,KAAK,UAAS,KACrB,MAAM,KAAK,KAAK,MAAK,GAEvB,MAAM,IAAI,QAAQ,CAAC7L,GAAKC,MAAO;AAC7B,WAAK,OAAO,KAAK,MAAM,KAAK,UAAU,MAAK;AACrC,aAAK,QAAQ,UACfA,EAAI,KAAK,OAAO,MAAM,IAEtBD,EAAI,KAAK,OAAO;MAEpB,CAAC;IACH,CAAC,GACM,KAAK;EACd;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;AAC5C,WAAI,KAAK,KAAK,UAAS,KACrB,KAAK,KAAK,UAAS,GAGrB,KAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAK;AAC7C,UAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;IAC9C,CAAC,GACM,KAAK;EACd;AAAA;AA3XF,IA8XakV,KAAP,cAEIb,GAAW;EACnB;EAEA,YAAYR,GAAqBxgB,GAAYuQ,GAAO;AAClD,UAAMiQ,GAAUxgB,GAAMuQ,CAAI,GAC1B,KAAK,UAAU,IAAI5C,EAA+B,EAChD,QAAQ,KAAK,QACb,YAAY,KAAA,CACb,GACD,KAAK,QAAQ,GAAG,SAAS,MAAM,KAAK,OAAM,CAAE,GAC5C,KAAK,QAAQ,GAAG,UAAU,MAAM,KAAK,OAAM,CAAE;EAC/C;EAEA,UAAU6K,GAAY;AACpB,SAAK,QAAQ,MAAMA,CAAC,GACf,KAAK,QAAQ,WAAS,KAAK,MAAK;EACvC;EAEA,SAAM;AACJ,QAAMb,IAAS,KAAK;AACpB,WAAIA,EAAO,UAAS,IAClBA,EAAO,MAAK,EAAG,KAAK,MAAK;AACvB,WAAK,OAAOA,GAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE;IAC7D,CAAC,IAED,KAAK,OAAOA,GAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE,GAEtD,KAAK;EACd;EAEA,aAAU;AACR,WAAI,KAAK,KAAK,UAAS,KACrB,KAAK,KAAK,UAAS,GAErB,KAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE,GAC3D,KAAK;EACd;AAAA;AP1dF,IAAM5X,KAEF,OAAO,WAAY,YACnB,WACA,OAAO,QAAQ,YAAa,WAE5B,QAAQ,WACR;AAPJ,IA4Wa+hB,IAAP,MAAW;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAKA;EAKA;EAcA,YAAYrpB,GAA4B8X,GAAU;AAEhD,QAAI,CAACA,EAAM,OAAM,IAAI,UAAU,uBAAuB;AA8BtD,QA5BA,KAAK,gBAAgB,CAAC,CAACA,EAAK,eAC5B,KAAK,SAASA,EAAK,QACnB,KAAK,SAAS,CAAC,CAACA,EAAK,QACrB,KAAK,MAAM,CAAC,CAACA,EAAK,KAClB,KAAK,cAAc,CAAC,CAACA,EAAK,aAC1B,KAAK,QAAQ,CAAC,CAACA,EAAK,OACpB,KAAK,OAAO,CAAC,CAACA,EAAK,MACdA,EAAK,OAECA,EAAK,eAAe,OAAOA,EAAK,IAAI,WAAW,SAAS,OACjEA,EAAK,UAAMoL,gBAAAA,eAAcpL,EAAK,GAAG,KAFjC,KAAK,MAAM,IAIb,KAAK,MAAMA,EAAK,OAAO,IACvB,KAAK,OAAOA,EAAK,MACjB,KAAK,gBAAgB,CAAC,CAACA,EAAK,eAC5B,KAAK,UAAU,CAAC,CAACA,EAAK,SACtB,KAAK,QAAQ,CAAC,CAACA,EAAK,OACpB,KAAK,WAAW,CAAC,CAACA,EAAK,UACvB,KAAK,WAAWA,EAAK,UACrB,KAAK,sBAAsBA,EAAK,wBAAwB,OAExD,KAAK,aAAa,CAAC,CAACA,EAAK,YACzB,KAAK,YAAY,CAAC,CAACA,EAAK,WACxB,KAAK,WACH,OAAOA,EAAK,YAAa,WAAWA,EAAK,WAAW,IAAA,GACtD,KAAK,OAAO,CAAC,CAACA,EAAK,MACnB,KAAK,SAASA,EAAK,QAEf,KAAK,iBAAiB,KAAK,aAAa,OAC1C,OAAM,IAAI,MAAM,4CAA4C;AAgB9D,QAbI,OAAO9X,KAAY,aACrBA,IAAU,CAACA,CAAO,IAGpB,KAAK,uBACH,CAAC,CAAC8X,EAAK,wBACNA,EAA0C,uBACzC,OAEA,KAAK,yBACP9X,IAAUA,EAAQ,IAAIhC,OAAKA,EAAE,QAAQ,OAAO,GAAG,CAAC,IAG9C,KAAK,WAAW;AAClB,UAAI8Z,EAAK,WACP,OAAM,IAAI,UAAU,iCAAiC;AAEvD9X,UAAUA,EAAQ,IAAIhC,OAAMA,EAAE,SAAS,GAAG,IAAIA,IAAI,QAAQA,CAAC,EAAG;IAChE;AAMA,QAJA,KAAK,UAAUgC,GAEf,KAAK,WAAW8X,EAAK,YAAYxQ,IACjC,KAAK,OAAO,EAAE,GAAGwQ,GAAM,UAAU,KAAK,SAAQ,GAC1CA,EAAK,QAAA;AAEP,UADA,KAAK,SAASA,EAAK,QAEjBA,EAAK,WAAW,UAChBA,EAAK,WAAWA,EAAK,OAAO,OAE5B,OAAM,IAAI,MAAM,kDAAkD;IAAA,OAE/D;AACL,UAAMwR,IACJxR,EAAK,aAAa,UAAUyK,KAC1BzK,EAAK,aAAa,WAAW4M,KAC7B5M,EAAK,WAAWyM,KAChBK;AACJ,WAAK,SAAS,IAAI0E,EAAO,KAAK,KAAK,EACjC,QAAQxR,EAAK,QACb,IAAIA,EAAK,GAAA,CACV;IACH;AACA,SAAK,SAAS,KAAK,OAAO;AAM1B,QAAMyR,IACJ,KAAK,aAAa,YAAY,KAAK,aAAa,SAE5CC,IAAwB,EAC5B,gBAAgB,KAChB,GAAG1R,GACH,KAAK,KAAK,KACV,WAAW,KAAK,WAChB,SAAS,KAAK,SAEd,QAAQ,KAAK,QACb,iBAAAyR,GACA,WAAW,MACX,OAAO,KAAK,OACZ,UAAU,MACV,mBAAmB,GACnB,UAAU,KAAK,UACf,sBAAsB,KAAK,sBAC3B,OAAO,CAAC,CAAC,KAAK,KAAK,MAAA,GAGfE,IAAM,KAAK,QAAQ,IAAIzrB,OAAK,IAAI6H,EAAU7H,GAAGwrB,CAAG,CAAC,GACjD,CAACE,GAAU5gB,CAAS,IAAI2gB,EAAI,OAChC,CAAChhB,GAA4B3M,OAC3B2M,EAAI,CAAC,EAAE,KAAK,GAAG3M,EAAE,GAAG,GACpB2M,EAAI,CAAC,EAAE,KAAK,GAAG3M,EAAE,SAAS,GACnB2M,IAET,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC;AAEV,SAAK,WAAWihB,EAAS,IAAI,CAACjhB,GAAKnM,MAAK;AACtC,UAAMmqB,IAAI3d,EAAUxM,CAAC;AAErB,UAAI,CAACmqB,EAAG,OAAM,IAAI,MAAM,wBAAwB;AAEhD,aAAO,IAAIxB,GAAQxc,GAAKge,GAAG,GAAG,KAAK,QAAQ;IAC7C,CAAC;EACH;EAMA,MAAM,OAAI;AAKR,WAAO,CACL,GAAI,MAAM,IAAI0C,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACvD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,KAAI,CAAA;EAEX;EAMA,WAAQ;AACN,WAAO,CACL,GAAG,IAAIA,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EAChD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,SAAQ,CAAA;EAEf;EAMA,SAAM;AACJ,WAAO,IAAIC,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACpD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,OAAM;EACX;EAMA,aAAU;AACR,WAAO,IAAIA,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACpD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,WAAU;EACf;EAMA,cAAW;AACT,WAAO,KAAK,WAAU,EAAG,OAAO,QAAQ,EAAC;EAC3C;EACA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,YAAW;EACzB;EAMA,UAAO;AACL,WAAO,KAAK,OAAM,EAAG,OAAO,aAAa,EAAC;EAC5C;EACA,CAAC,OAAO,aAAa,IAAC;AACpB,WAAO,KAAK,QAAO;EACrB;AAAA;AQ/nBK,IAAMhlB,KAAW,CACtBpE,IACA7B,IAAuB,CAAA,MACZ;AACN,QAAM,QAAQ6B,EAAO,MACxBA,KAAU,CAACA,EAAO;AAEpB,WAAWhC,KAAKgC,GACd,KAAI,IAAI6F,EAAU7H,GAAGG,CAAO,EAAE,SAAQ,EAAI,QAAO;AAEnD,SAAO;AACT;AC4BM,SAAUwrB,GACd3pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,WAAU;AAC9C;AAsBM,SAAUyrB,GACd5pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,OAAM;AAC1C;AAqBM,SAAU0rB,GACd7pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,SAAQ;AAC5C;AAwBA,eAAe2rB,GACb9pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,KAAI;AACxC;AAqBM,SAAU4rB,GACd/pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,YAAW;AAC/C;AAqBM,SAAU6rB,GACdhqB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,QAAO;AAC3C;AAGO,IAAM8rB,KAAaN;AAAnB,IACMO,KAAS,OAAO,OAAON,IAAY,EAAE,MAAMD,GAAc,CAAE;AADjE,IAEMQ,KAAcJ;AAFpB,IAGMK,KAAU,OAAO,OAAOJ,IAAa,EAChD,MAAMD,GAAAA,CACP;AALM,IAMMzF,KAAO,OAAO,OAAOuF,IAAU,EAC1C,QAAQF,IACR,SAASI,GAAAA,CACV;AATM,IAWMvpB,KAAO,OAAO,OAAOspB,IAAO,EACvC,MAAMA,IACN,UAAAD,IACA,MAAAvF,IACA,YAAAsF,IACA,QAAAM,IACA,gBAAAP,IACA,YAAAM,IACA,aAAAD,IACA,SAAAI,IACA,iBAAAL,IACA,aAAAI,IACA,MAAAd,GACA,UAAAjlB,IACA,QAAAuB,IACA,UAAAlE,EAAAA,CACD;AACDjB,GAAK,OAAOA;;;AC/NZ,2BAA6B;AAC7B,IAAA6pB,aAAwC;AACxC,IAAAC,eAA8B;;;ACF9B,IAAAC,aAQO;AACP,kBAAoC;;;ACH7B,IAAM,mBAAmB;AASzB,IAAM,6BAA6B;AAKnC,IAAM,gCACX;;;AChBF,IAAI;AAOJ,IAAM,YAAY,KAAK,IAAI,EAAE,SAAS;AAKtC,IAAM,qBAAqB,KAAK,IAAI;AAKpC,IAAM,sBAAsB,oBAAI,IAAoB;AAU7C,SAAS,gBACd,OACA,YACG,gBACG;AACN,MAAI,CAAC,qBAAqB;AACxB,UAAM,IAAI,MAAM,wEAAwE;AAAA,EAC1F;AAEA,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,YAAY,cAAc;AAChC,QAAM,cAAc,QAAQ,SAAS,IAAI,SAAS,KAAK,MAAM,YAAY,CAAC;AAG1E,UAAQ,OAAO;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,IAAI,cAAc,SAAS,GAAG,cAAc;AAAA,MACtD,OAAO;AACL,gBAAQ,IAAI,aAAa,SAAS,GAAG,cAAc;AAAA,MACrD;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,KAAK,cAAc,SAAS,GAAG,cAAc;AAAA,MACvD,OAAO;AACL,gBAAQ,KAAK,aAAa,SAAS,GAAG,cAAc;AAAA,MACtD;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,MAAM,cAAc,SAAS,GAAG,cAAc;AAAA,MACxD,OAAO;AACL,gBAAQ,MAAM,aAAa,SAAS,GAAG,cAAc;AAAA,MACvD;AACA;AAAA,IACF;AAEE,YAAM,IAAI,MAAM,sBAAsB,OAAO,KAAK,CAAC,EAAE;AAAA,EACzD;AACF;AAQA,SAAS,eAAe,WAAmB,UAAkB,KAAK,IAAI,GAAW;AAC/E,QAAM,aAAa,UAAU;AAE7B,MAAI,aAAa,KAAM;AACrB,WAAO,GAAG,UAAU;AAAA,EACtB,WAAW,aAAa,KAAO;AAC7B,WAAO,IAAI,aAAa,KAAM,QAAQ,CAAC,CAAC;AAAA,EAC1C,OAAO;AACL,UAAM,UAAU,KAAK,MAAM,aAAa,GAAK;AAC7C,UAAM,WAAY,aAAa,MAAS,KAAM,QAAQ,CAAC;AACvD,WAAO,GAAG,OAAO,KAAK,OAAO;AAAA,EAC/B;AACF;AAOO,SAAS,kBAAkBC,aAA0B;AAC1D,kBAAgB,QAAQ,4BAA4B,SAAS,OAAO;AACpE,kBAAgB,QAAQ,gBAAgBA,WAAU,EAAE;AACtD;AAQO,SAAS,iBAAiB,UAAmB,MAAM,mBAAkC;AAC1F,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,gBAAgB,eAAe,oBAAoB,OAAO;AAChE,QAAM,SAAS,UAAU,YAAY;AAErC,MAAI,mBAAmB;AACrB,oBAAgB,QAAQ,iBAAiB;AAAA,EAC3C;AAEA,kBAAgB,QAAQ,0BAA0B,SAAS,OAAO,MAAM,MAAM;AAC9E,kBAAgB,QAAQ,mBAAmB,aAAa,EAAE;AAC5D;AAQO,SAAS,wBAAwB,WAAmB,gBAA+B;AACxF,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,kBAAkB,eAAe,oBAAoB,WAAW;AACtE,QAAM,OAAO,iBAAiB,MAAM,cAAc,KAAK;AACvD,kBAAgB,QAAQ,cAAc,SAAS,WAAW,eAAe,IAAI,IAAI,EAAE;AACrF;AAOO,SAAS,4BAA4B,eAA6B;AACvE,sBAAoB,IAAI,eAAe,KAAK,IAAI,CAAC;AACjD,kBAAgB,SAAS,YAAY,aAAa,EAAE;AACtD;AAOO,SAAS,2BAA2B,eAA6B;AACtE,QAAM,YAAY,oBAAoB,IAAI,aAAa;AACvD,MAAI,WAAW;AACb,UAAM,WAAW,eAAe,SAAS;AACzC,wBAAoB,OAAO,aAAa;AACxC,oBAAgB,QAAQ,cAAc,aAAa,UAAU,QAAQ,GAAG;AAAA,EAC1E,OAAO;AACL,oBAAgB,QAAQ,sCAAsC,aAAa,EAAE;AAAA,EAC/E;AACF;AAQO,SAAS,uBAAuBA,aAA0B;AAC/D,wBAAsBA;AACxB;;;ACrKO,SAAS,qBAAqBC,kBAA6C;AAChF,QAAM,UAAUA,iBAAgB;AAChC,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AACzB,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AACzB,QAAM,KAAK,EAAE;AAGb,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,aAAa,QAAQ,iBAAiB,YAAY,QAAQ,EAAE;AACvE,QAAM,KAAK,oBAAoBA,iBAAgB,aAAa,YAAY,CAAC,EAAE;AAC3E,QAAM,KAAK,eAAe,QAAQ,aAAa,EAAE;AACjD,QAAM,KAAK,gBAAgB,QAAQ,aAAa,EAAE;AAClD,QAAM,KAAK,2BAA2B,QAAQ,kBAAkB,EAAE;AAClE,QAAM,KAAK,EAAE;AAGb,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,kBAAkB,QAAQ,qBAAqB,EAAE;AAC5D,QAAM,KAAK,iBAAiB,QAAQ,sBAAsB,EAAE;AAC5D,QAAM,KAAK,cAAcA,iBAAgB,YAAY,kBAAkB,EAAE;AACzE,QAAM,KAAK,aAAa,QAAQ,kBAAkB,EAAE;AACpD,QAAM,KAAK,cAAc,QAAQ,mBAAmB,EAAE;AACtD,QAAM,KAAK,EAAE;AAGb,MAAIA,iBAAgB,YAAY,qBAAqB,GAAG;AACtD,UAAM,KAAK,gBAAgB;AAC3B,UAAM,KAAK,4BAA4BA,iBAAgB,YAAY,wBAAwB,EAAE;AAC7F,UAAM;AAAA,MACJ,iCAAiCA,iBAAgB,YAAY,6BAA6B;AAAA,IAC5F;AACA,UAAM,KAAK,2BAA2BA,iBAAgB,YAAY,kBAAkB,EAAE;AACtF,UAAM;AAAA,MACJ,2CAA2CA,iBAAgB,YAAY,kCAAkC,IAAI;AAAA,IAC/G;AACA,UAAM;AAAA,MACJ,sCAAsCA,iBAAgB,YAAY,6BAA6B,IAAI;AAAA,IACrG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,cAAc;AACzB,QAAM,KAAK,qBAAqB,QAAQ,YAAY,eAAe,IAAI;AACvE,QAAM,KAAK,cAAc,QAAQ,YAAY,iBAAiB,IAAI;AAClE,QAAM,KAAK,kBAAkB,QAAQ,YAAY,qBAAqB,IAAI;AAC1E,QAAM,KAAK,iBAAiB,QAAQ,YAAY,oBAAoB,IAAI;AAGxE,MAAI,QAAQ,YAAY,kBAAkB,GAAG;AAC3C,UAAM,aAAa,KAAK;AAAA,MACrB,QAAQ,YAAY,oBAAoB,QAAQ,YAAY,kBAAmB;AAAA,IAClF;AACA,UAAM,iBAAiB,KAAK;AAAA,MACzB,QAAQ,YAAY,wBAAwB,QAAQ,YAAY,kBAAmB;AAAA,IACtF;AACA,UAAM,gBAAgB,KAAK;AAAA,MACxB,QAAQ,YAAY,uBAAuB,QAAQ,YAAY,kBAAmB;AAAA,IACrF;AAEA,UAAM,KAAK,cAAc;AACzB,UAAM,KAAK,gBAAgB,UAAU,GAAG;AACxC,UAAM,KAAK,oBAAoB,cAAc,GAAG;AAChD,UAAM,KAAK,mBAAmB,aAAa,GAAG;AAAA,EAChD;AACA,QAAM,KAAK,EAAE;AAGb,MAAI,QAAQ,eAAe,SAAS,GAAG;AACrC,UAAM,KAAK,kBAAkB;AAC7B,eAAW,SAAS,QAAQ,gBAAgB;AAC1C,YAAM,KAAK,OAAO,KAAK,EAAE;AAAA,IAC3B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,UAAM,KAAK,WAAW;AACtB,eAAW,WAAW,QAAQ,UAAU;AACtC,YAAM,KAAK,OAAO,OAAO,EAAE;AAAA,IAC7B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AAEzB,SAAO,MAAM,KAAK,IAAI;AACxB;;;AH7EO,SAAS,UAAU,SAA0B;AAClD,aAAO,uBAAW,OAAO,SAAK,qBAAS,OAAO,EAAE,YAAY;AAC9D;AAOO,SAAS,WAAW,UAA2B;AACpD,aAAO,uBAAW,QAAQ,SAAK,qBAAS,QAAQ,EAAE,OAAO;AAC3D;AAQO,SAAS,2BAA2B,SAAuB;AAEhE,MAAI,CAAC,UAAU,OAAO,GAAG;AACvB,oBAAgB,QAAQ,wBAAwB,OAAO,EAAE;AACzD;AAAA,EACF;AACA,kBAAgB,QAAQ,uCAAuC,OAAO,EAAE;AAGxE,QAAM,cAAU,wBAAY,SAAS,EAAE,eAAe,KAAK,CAAC;AAE5D,aAAW,SAAS,SAAS;AAC3B,UAAM,eAAW,kBAAK,SAAS,MAAM,IAAI;AAEzC,QAAI,MAAM,YAAY,GAAG;AAEvB,iCAA2B,QAAQ;AAAA,IACrC,WACE,MAAM,OAAO,KACb,MAAM,KAAK,SAAS,OAAO,KAC3B,CAAC,MAAM,KAAK,SAAS,WAAW,GAChC;AAEA,YAAM,cAAU,oBAAO,EAAE,OAAG,mBAAM,QAAQ,GAAG,MAAM,IAAI,KAAK,YAAY,CAAC;AACzE,iCAAW,UAAU,OAAO;AAC5B,sBAAgB,QAAQ,gCAAgC,QAAQ,OAAO,OAAO,EAAE;AAAA,IAClF;AAAA,EACF;AACF;AAQO,SAAS,iBAAiBC,aAA4B;AAC3D,QAAM,qBAAiB,kBAAKA,aAAY,0BAA0B;AAClE,MAAI;AACF,kCAAc,gBAAgB,+BAA+B,MAAM;AACnE,oBAAgB,QAAQ,wBAAwB,cAAc,EAAE;AAAA,EAClE,SAAS,OAAO;AACd,oBAAgB,QAAQ,iCAAiC,OAAO,KAAK,CAAC,EAAE;AAAA,EAC1E;AACA,SAAO;AACT;AAOO,SAAS,iBAAiB,gBAA8B;AAC7D,UAAI,uBAAW,cAAc,GAAG;AAC9B,QAAI;AACF,iCAAW,cAAc;AACzB,sBAAgB,QAAQ,wBAAwB,cAAc,EAAE;AAAA,IAClE,SAAS,OAAO;AACd,sBAAgB,QAAQ,iCAAiC,OAAO,KAAK,CAAC,EAAE;AAAA,IAC1E;AAAA,EACF;AACF;AAUO,SAAS,0BAA0B,MAAwD;AAChG,MAAI,OAAO,SAAS,YAAY,SAAS,KAAM,QAAO;AAGtD,QAAM,SAAS,KAAK,WAAW;AAC/B,MAAI,QAAQ,QAAQ,OAAO,OAAO,SAAS,UAAU;AACnD,WAAO,OAAO,OAAO,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG;AAAA,EAChD;AAGA,QAAM,cAAc,KAAK,aAAa;AACtC,MAAI,aAAa;AACf,eAAW,QAAQ,OAAO,OAAO,WAAW,GAAG;AAC7C,kCAA4B,IAAI;AAAA,IAClC;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,4BAA4B,KAAoB;AACvD,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM;AAE7C,QAAM,SAAS;AACf,QAAM,MAAM,OAAO,WAAW;AAC9B,MAAI,KAAK,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,QAAI,OAAO,IAAI,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG;AAAA,EAC1C;AAGA,aAAW,OAAO,CAAC,YAAY,UAAU,WAAW,aAAa,SAAS,SAAS,GAAG;AACpF,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC3E,iBAAW,SAAS,OAAO,OAAO,MAAiC,GAAG;AACpE,oCAA4B,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,6BAA6B,UAAwB;AACnE,MAAI,CAAC,WAAW,QAAQ,EAAG;AAE3B,QAAM,UAAM,yBAAa,UAAU,MAAM;AACzC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,4BAA0B,IAAI;AAC9B,QAAM,aAAa,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;AAEnD,MAAI,eAAe,KAAK;AACtB,kCAAc,UAAU,YAAY,MAAM;AAC1C,oBAAgB,QAAQ,kCAAkC,QAAQ,EAAE;AAAA,EACtE;AACF;;;ADhKO,IAAM,6BAA6B;AAiB1C,IAAM,kBAAmC;AAAA,EACvC,gBAAgB,oBAAI,IAAI;AAAA,EACxB,oBAAoB,CAAC;AAAA,EACrB,aAAa;AACf;AAiBA,IAAM,oBAAoB;AAAA;AAAA,EAExB,KAAK,OAA4B;AAAA,IAC/B,YAAY;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,QAAQ,OAA4B;AAAA,IAClC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,YAAY,KAAK;AAAA,IAC9C,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,UAAU,OAA4B;AAAA,IACpC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,eAAe,KAAK;AAAA,IACjD,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,aAAa,OAA4B;AAAA,IACvC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,eAAe,KAAK;AAAA,IACpC,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,qBAAqB,CAAC,aAA0C;AAAA,IAC9D,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,eAAe,OAAO,IAAI,KAAK;AAAA,IAC5D,iBAAiB,mCAAmC,OAAO;AAAA,EAC7D;AAAA;AAAA,EAEA,mBAAmB,CAAC,aAA0C;AAAA,IAC5D,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,YAAY,OAAO,IAAI,KAAK;AAAA,IACzD,iBAAiB,gCAAgC,OAAO;AAAA,EAC1D;AACF;AAOA,SAAS,mBAAmB,eAA4C;AACtE,QAAM,QAAQ,cAAc,KAAK,EAAE,MAAM,KAAK;AAC9C,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AAEA,QAAM,aAAa,MAAM,CAAC;AAC1B,QAAM,OAAO,MAAM,MAAM,CAAC;AAE1B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,iBAAiB;AAAA,EACnB;AACF;AAUO,SAAS,iCACd,UACAC,aACA,aACAC,kBAC4E;AAC5E,MAAI;AAEF,UAAM,gBAAgB,kBAAkB,UAAUD,aAAY,aAAaC,gBAAe;AAG1F,UAAM,iBAAiB,mBAAmB,aAAa;AAGvD,QAAI;AAEJ,QAAI,eAAeA,kBAAiB;AAClC,UAAI;AACF,cAAM,cAAc,mBAAmB,aAAaA,gBAAe;AACnE,YAAI,aAAa,oBAAoB;AAEnC,yBAAe,kBAAkB,oBAAoB,YAAY,kBAAkB;AAAA,QACrF,WAAW,aAAa,cAAc;AAEpC,yBAAe,kBAAkB,oBAAoB,YAAY,YAAY;AAAA,QAC/E,OAAO;AAEL,yBAAe,kBAAkB,SAAS;AAAA,QAC5C;AAAA,MACF,SAAS,OAAO;AAEd;AAAA,UACE;AAAA,UACA,sCAAsC,WAAW,KAAK,OAAO,KAAK,CAAC;AAAA,QACrE;AACA,uBAAe,kBAAkB,SAAS;AAAA,MAC5C;AAAA,IACF,OAAO;AAEL,qBAAe,kBAAkB,SAAS;AAAA,IAC5C;AAEA,WAAO,EAAE,gBAAgB,aAAa;AAAA,EACxC,SAAS,OAAO;AAEd,oBAAgB,SAAS,+CAA+C,OAAO,KAAK,CAAC,EAAE;AACvF,UAAM,kBAAkB,mBAAmB,KAAK;AAChD,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,cAAc,kBAAkB,SAAS;AAAA,IAC3C;AAAA,EACF;AACF;AAKA,SAAS,wBAAwB,cAAkD;AACjF,MAAI;AACF,UAAM,mBAAe,sBAAQ,YAAY;AACzC,QAAI,gBAAgB,WAAW,YAAY,GAAG;AAC5C,aAAO;AAAA,QACL,YAAY;AAAA,QACZ,MAAM,CAAC;AAAA,QACP,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAQA,SAAS,mBACP,aACAA,kBAC4B;AAC5B,QAAM,UAAUA,iBAAgB,SAAS,IAAI,WAAW;AACxD,MAAI,CAAC,SAAS,aAAa;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,eAAe,CAAC,GAAG,kBAAkB,CAAC,EAAE,IAAI,QAAQ;AAC5D,QAAM,kBAAkB,EAAE,GAAG,cAAc,GAAG,gBAAgB;AAE9D,QAAM,aAAa,gBAAgB,UAAU;AAC7C,QAAM,eAAe,gBAAgB,aAAa;AAElD,MAAI,CAAC,cAAc,CAAC,cAAc;AAChC,WAAO;AAAA,EACT;AAEA,MAAI;AACJ,MAAI,cAAc;AAEhB,yBAAqB,2BAA2B,YAAY;AAAA,EAC9D,WAAW,YAAY;AAErB,yBAAqB,6BAA6B,UAAU;AAAA,EAC9D;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOA,SAAS,2BAA2B,SAAyB;AAC3D,QAAM,iBAAiB;AACvB,QAAM,oBAAoB,QAAQ,MAAM,UAAU;AAElD,MAAI,mBAAmB;AACrB,UAAM,eAAe,SAAS,kBAAkB,CAAC,GAAG,EAAE;AACtD,QAAI,eAAe,gBAAgB;AAEjC,aAAO,IAAI,cAAc;AAAA,IAC3B;AAAA,EACF;AAGA,SAAO;AACT;AAOA,SAAS,6BAA6B,YAA4B;AAGhE,QAAM,oBAAoB,WAAW,MAAM,UAAU;AACrD,MAAI;AAEJ,MAAI,mBAAmB;AACrB,UAAM,eAAe,kBAAkB,CAAC;AACxC,qBAAiB,IAAI,YAAY;AAAA,EACnC,OAAO;AAEL,qBAAiB;AAAA,EACnB;AAGA,SAAO,2BAA2B,cAAc;AAClD;AAQA,SAAS,6BACP,aACAA,kBAC4B;AAC5B,QAAM,cAAc,mBAAmB,aAAaA,gBAAe;AAEnE,MAAI,CAAC,aAAa,oBAAoB;AACpC,WAAO;AAAA,EACT;AAEA,SAAO,kBAAkB,oBAAoB,YAAY,kBAAkB;AAC7E;AAYO,SAAS,oBACd,UACAD,aACA,aACAC,kBACQ;AACR,MAAI;AAEF,WAAO,kBAAkB,UAAUD,aAAY,aAAaC,gBAAe;AAAA,EAC7E,SAAS,OAAO;AACd,UAAM,eAAe,oCAAoC,OAAO,KAAK,CAAC;AACtE,oBAAgB,SAAS,YAAY;AACrC,UAAM,IAAI,MAAM,YAAY;AAAA,EAC9B;AACF;AAOA,SAAS,2BAA2BD,aAA8B;AAChE,MAAI,gBAAgB,mBAAmB,SAAS,GAAG;AACjD,WAAO,gBAAgB;AAAA,EACzB;AAEA,QAAM,mBAAe,mBAAKA,aAAY,sBAAsB;AAC5D,QAAM,gBAA0B,CAAC;AAEjC,MAAI;AACF,YAAI,uBAAW,YAAY,GAAG;AAC5B,YAAM,cAAU,wBAAY,cAAc,EAAE,eAAe,KAAK,CAAC;AACjE,iBAAW,SAAS,SAAS;AAC3B,YAAI,MAAM,YAAY,KAAK,MAAM,KAAK,WAAW,MAAM,GAAG;AACxD,gBAAM,eAAW,mBAAK,cAAc,MAAM,IAAI;AAC9C,gBAAM,aAAS,mBAAK,UAAU,gBAAgB,QAAQ,KAAK;AAC3D,cAAI,WAAW,MAAM,GAAG;AACtB,0BAAc,KAAK,QAAQ;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,oBAAgB,SAAS,yCAAyC,OAAO,KAAK,CAAC,EAAE;AAAA,EACnF;AAEA,kBAAgB,qBAAqB;AACrC,SAAO;AACT;AAUA,SAAS,kBACP,UACAA,aACA,aACAC,kBACQ;AAER,4BAA0BD,WAAU;AAGpC,MAAI,UAAU;AACZ,UAAM,kBAAc,mBAAK,UAAU,gBAAgB,QAAQ,KAAK;AAChE,UAAM,UAAU,wBAAwB,WAAW;AACnD,QAAI,SAAS;AACX,YAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,aAAW,qBAAqB,gBAAgB,oBAAoB;AAClE,UAAM,kBAAc,mBAAK,mBAAmB,gBAAgB,QAAQ,KAAK;AACzE,UAAM,UAAU,wBAAwB,WAAW;AACnD,QAAI,SAAS;AACX,YAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAeC,kBAAiB;AAClC,UAAM,sBAAsB,6BAA6B,aAAaA,gBAAe;AACrF,QAAI,qBAAqB;AACvB,YAAM,SAAS,eAAe,qBAAqBD,aAAY,IAAI;AACnE,UAAI,OAAO,OAAO;AAChB,eAAO,oBAAoB;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAGA,MAAI,gBAAgB,eAAe;AACjC,WAAO,gBAAgB;AAAA,EACzB;AAGA,QAAM,mBAAmB,CAAC,kBAAkB,OAAO,GAAG,kBAAkB,SAAS,CAAC;AAElF,aAAW,WAAW,kBAAkB;AACtC,UAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,QAAI,OAAO,OAAO;AAChB,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AAGA,SAAO,kBAAkB,SAAS,EAAE;AACtC;AAMA,SAAS,0BAA0BA,aAA0B;AAC3D,MAAI,gBAAgB,aAAa;AAC/B;AAAA,EACF;AAEA,kBAAgB,QAAQ,mCAAmC;AAG3D,QAAM,iBAAiB,CAAC,kBAAkB,IAAI,GAAG,kBAAkB,SAAS,CAAC;AAE7E,aAAW,WAAW,gBAAgB;AACpC,UAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,QAAI,OAAO,OAAO;AAChB,sBAAgB,gBAAgB,QAAQ;AACxC;AAAA,QACE;AAAA,QACA,qCAAqC,QAAQ,eAAe,MAAM,OAAO,WAAW,SAAS;AAAA,MAC/F;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,2BAA2BA,WAAU;AACvD,MAAI,UAAU,SAAS,GAAG;AACxB;AAAA,MACE;AAAA,MACA,cAAc,UAAU,MAAM,sBAAsB,UAAU,WAAW,IAAI,MAAM,KAAK;AAAA,IAC1F;AAAA,EACF;AAEA,kBAAgB,cAAc;AAChC;AAmBA,SAAS,eACP,kBACAE,aACA,SAAkB,OACoC;AACtD,QAAM,WAAW,iBAAiB;AAGlC,QAAM,eAAe,gBAAgB,eAAe,IAAI,QAAQ;AAChE,MAAI,cAAc;AAChB,WAAO;AAAA,EACT;AAEA,MAAI;AAEF,UAAM,WAAW;AAAA,MACf,GAAG,QAAQ;AAAA;AAAA,MAEX,mCAAmC;AAAA,MACnC,eAAe;AAAA,IACjB;AAEA,UAAM,aAAS;AAAA,MACb,iBAAiB;AAAA,MACjB,CAAC,GAAG,iBAAiB,MAAM,WAAW;AAAA,MACtC;AAAA,QACE,UAAU;AAAA,QACV,OAAO;AAAA,QACP,SAAS;AAAA;AAAA,QACT,KAAKA;AAAA,QACL,KAAK;AAAA,MACP;AAAA,IACF,EAAE,SAAS;AAGX,UAAM,eAAe,OAAO,MAAM,iBAAiB;AACnD,UAAM,UAAU,eAAe,aAAa,CAAC,IAAI;AAEjD,UAAM,aAAa,EAAE,OAAO,MAAM,QAAQ;AAC1C,oBAAgB,eAAe,IAAI,UAAU,UAAU;AACvD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,eAAe,OAAO,KAAK;AACjC,QAAI,CAAC,QAAQ;AACX,sBAAgB,SAAS,gCAAgC,QAAQ,MAAM,YAAY,EAAE;AAAA,IACvF;AAEA,UAAM,aAAa,EAAE,OAAO,OAAO,OAAO,aAAa;AACvD,oBAAgB,eAAe,IAAI,UAAU,UAAU;AACvD,WAAO;AAAA,EACT;AACF;;;AKlhBA,IAAAC,wBAA4C;AAC5C,IAAAC,eAA2E;;;ACD3E,IAAAC,wBAA4C;AAC5C,IAAAC,eAAgC;AAQzB,SAAS,cAAc,YAAoB,UAAuC;AACvF,MAAI;AAEF,UAAM,eAAiC;AAAA,MACrC,OAAO;AAAA,MACP,OAAO;AAAA,MACP,KAAK,EAAE,GAAG,QAAQ,IAAI;AAAA,IACxB;AAGA,QAAI,UAAU;AACZ,YAAM,eAAW,mBAAK,UAAU,cAAc;AAG9C,mBAAa,MAAM;AAAA,QACjB,GAAG,QAAQ;AAAA,QACX,WAAW,GAAG,QAAQ,GAAG,sBAAS,GAAG,QAAQ,IAAI,aAAa,EAAE;AAAA,QAChE,MAAM,OAAG,mBAAK,UAAU,MAAM,CAAC,GAAG,sBAAS,GAAG,QAAQ,IAAI,IAAI;AAAA,QAC9D,mBAAmB;AAAA,MACrB;AAAA,IACF;AAIA,UAAM,aAAS,iCAAU,GAAG,UAAU,cAAc,YAAY;AAChE,QAAI,OAAO,WAAW,KAAK,OAAO,QAAQ;AACxC,YAAM,gBAAgB,OAAO,OAAO,SAAS,EAAE,KAAK;AAEpD,YAAMC,SAAQ,cAAc,MAAM,0CAA0C;AAC5E,UAAIA,SAAQ,CAAC,GAAG;AACd,eAAOA,OAAM,CAAC;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;AC/CA,IAAAC,wBAA6B;AAC7B,IAAAC,aAA2B;AAC3B,gBAA+B;AAC/B,IAAAC,eAA8B;;;ACH9B,IAAAC,aAAyC;AACzC,IAAAC,eAAwC;;;ACCxC,SAAS,UAAU,SAAS;AAC1B,SAAQ,OAAO,YAAY,eAAiB,YAAY;AAC1D;AAGA,SAAS,SAAS,SAAS;AACzB,SAAQ,OAAO,YAAY,YAAc,YAAY;AACvD;AAGA,SAAS,QAAQ,UAAU;AACzB,MAAI,MAAM,QAAQ,QAAQ,EAAG,QAAO;AAAA,WAC3B,UAAU,QAAQ,EAAG,QAAO,CAAC;AAEtC,SAAO,CAAE,QAAS;AACpB;AAGA,SAAS,OAAO,QAAQ,QAAQ;AAC9B,MAAI,OAAO,QAAQ,KAAK;AAExB,MAAI,QAAQ;AACV,iBAAa,OAAO,KAAK,MAAM;AAE/B,SAAK,QAAQ,GAAG,SAAS,WAAW,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtE,YAAM,WAAW,KAAK;AACtB,aAAO,GAAG,IAAI,OAAO,GAAG;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,OAAO,QAAQ,OAAO;AAC7B,MAAI,SAAS,IAAI;AAEjB,OAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AACzC,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAGA,SAAS,eAAe,QAAQ;AAC9B,SAAQ,WAAW,KAAO,OAAO,sBAAsB,IAAI;AAC7D;AAGA,IAAI,cAAmB;AACvB,IAAI,aAAmB;AACvB,IAAI,YAAmB;AACvB,IAAI,WAAmB;AACvB,IAAI,mBAAmB;AACvB,IAAI,WAAmB;AAEvB,IAAI,SAAS;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AAAA,EACV,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,gBAAgB;AAAA,EAChB,QAAQ;AACT;AAKA,SAAS,YAAYC,YAAW,SAAS;AACvC,MAAI,QAAQ,IAAI,UAAUA,WAAU,UAAU;AAE9C,MAAI,CAACA,WAAU,KAAM,QAAO;AAE5B,MAAIA,WAAU,KAAK,MAAM;AACvB,aAAS,SAASA,WAAU,KAAK,OAAO;AAAA,EAC1C;AAEA,WAAS,OAAOA,WAAU,KAAK,OAAO,KAAK,OAAOA,WAAU,KAAK,SAAS,KAAK;AAE/E,MAAI,CAAC,WAAWA,WAAU,KAAK,SAAS;AACtC,aAAS,SAASA,WAAU,KAAK;AAAA,EACnC;AAEA,SAAO,UAAU,MAAM;AACzB;AAGA,SAAS,gBAAgB,QAAQ,MAAM;AAErC,QAAM,KAAK,IAAI;AAEf,OAAK,OAAO;AACZ,OAAK,SAAS;AACd,OAAK,OAAO;AACZ,OAAK,UAAU,YAAY,MAAM,KAAK;AAGtC,MAAI,MAAM,mBAAmB;AAE3B,UAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,EAChD,OAAO;AAEL,SAAK,QAAS,IAAI,MAAM,EAAG,SAAS;AAAA,EACtC;AACF;AAIA,gBAAgB,YAAY,OAAO,OAAO,MAAM,SAAS;AACzD,gBAAgB,UAAU,cAAc;AAGxC,gBAAgB,UAAU,WAAW,SAAS,SAAS,SAAS;AAC9D,SAAO,KAAK,OAAO,OAAO,YAAY,MAAM,OAAO;AACrD;AAGA,IAAI,YAAY;AAGhB,SAAS,QAAQ,QAAQ,WAAW,SAAS,UAAU,eAAe;AACpE,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,gBAAgB,KAAK,MAAM,gBAAgB,CAAC,IAAI;AAEpD,MAAI,WAAW,YAAY,eAAe;AACxC,WAAO;AACP,gBAAY,WAAW,gBAAgB,KAAK;AAAA,EAC9C;AAEA,MAAI,UAAU,WAAW,eAAe;AACtC,WAAO;AACP,cAAU,WAAW,gBAAgB,KAAK;AAAA,EAC5C;AAEA,SAAO;AAAA,IACL,KAAK,OAAO,OAAO,MAAM,WAAW,OAAO,EAAE,QAAQ,OAAO,QAAG,IAAI;AAAA,IACnE,KAAK,WAAW,YAAY,KAAK;AAAA;AAAA,EACnC;AACF;AAGA,SAAS,SAAS,QAAQ,KAAK;AAC7B,SAAO,OAAO,OAAO,KAAK,MAAM,OAAO,MAAM,IAAI;AACnD;AAGA,SAAS,YAAY,MAAM,SAAS;AAClC,YAAU,OAAO,OAAO,WAAW,IAAI;AAEvC,MAAI,CAAC,KAAK,OAAQ,QAAO;AAEzB,MAAI,CAAC,QAAQ,UAAW,SAAQ,YAAY;AAC5C,MAAI,OAAO,QAAQ,WAAgB,SAAU,SAAQ,SAAc;AACnE,MAAI,OAAO,QAAQ,gBAAgB,SAAU,SAAQ,cAAc;AACnE,MAAI,OAAO,QAAQ,eAAgB,SAAU,SAAQ,aAAc;AAEnE,MAAIC,MAAK;AACT,MAAI,aAAa,CAAE,CAAE;AACrB,MAAI,WAAW,CAAC;AAChB,MAAIC;AACJ,MAAI,cAAc;AAElB,SAAQA,SAAQD,IAAG,KAAK,KAAK,MAAM,GAAI;AACrC,aAAS,KAAKC,OAAM,KAAK;AACzB,eAAW,KAAKA,OAAM,QAAQA,OAAM,CAAC,EAAE,MAAM;AAE7C,QAAI,KAAK,YAAYA,OAAM,SAAS,cAAc,GAAG;AACnD,oBAAc,WAAW,SAAS;AAAA,IACpC;AAAA,EACF;AAEA,MAAI,cAAc,EAAG,eAAc,WAAW,SAAS;AAEvD,MAAI,SAAS,IAAI,GAAG;AACpB,MAAI,eAAe,KAAK,IAAI,KAAK,OAAO,QAAQ,YAAY,SAAS,MAAM,EAAE,SAAS,EAAE;AACxF,MAAI,gBAAgB,QAAQ,aAAa,QAAQ,SAAS,eAAe;AAEzE,OAAK,IAAI,GAAG,KAAK,QAAQ,aAAa,KAAK;AACzC,QAAI,cAAc,IAAI,EAAG;AACzB,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,cAAc,CAAC;AAAA,MAC1B,SAAS,cAAc,CAAC;AAAA,MACxB,KAAK,YAAY,WAAW,WAAW,IAAI,WAAW,cAAc,CAAC;AAAA,MACrE;AAAA,IACF;AACA,aAAS,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,IAAI,GAAG,SAAS,GAAG,YAAY,IACjG,QAAQ,KAAK,MAAM,OAAO;AAAA,EAC9B;AAEA,SAAO,QAAQ,KAAK,QAAQ,WAAW,WAAW,GAAG,SAAS,WAAW,GAAG,KAAK,UAAU,aAAa;AACxG,YAAU,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,GAAG,SAAS,GAAG,YAAY,IAC9F,QAAQ,KAAK,MAAM;AACrB,YAAU,OAAO,OAAO,KAAK,QAAQ,SAAS,eAAe,IAAI,KAAK,GAAG,IAAI;AAE7E,OAAK,IAAI,GAAG,KAAK,QAAQ,YAAY,KAAK;AACxC,QAAI,cAAc,KAAK,SAAS,OAAQ;AACxC,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,cAAc,CAAC;AAAA,MAC1B,SAAS,cAAc,CAAC;AAAA,MACxB,KAAK,YAAY,WAAW,WAAW,IAAI,WAAW,cAAc,CAAC;AAAA,MACrE;AAAA,IACF;AACA,cAAU,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,IAAI,GAAG,SAAS,GAAG,YAAY,IAClG,QAAQ,KAAK,MAAM;AAAA,EACvB;AAEA,SAAO,OAAO,QAAQ,OAAO,EAAE;AACjC;AAGA,IAAI,UAAU;AAEd,IAAI,2BAA2B;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAI,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,oBAAoBC,MAAK;AAChC,MAAI,SAAS,CAAC;AAEd,MAAIA,SAAQ,MAAM;AAChB,WAAO,KAAKA,IAAG,EAAE,QAAQ,SAAU,OAAO;AACxC,MAAAA,KAAI,KAAK,EAAE,QAAQ,SAAU,OAAO;AAClC,eAAO,OAAO,KAAK,CAAC,IAAI;AAAA,MAC1B,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,OAAO,KAAK,SAAS;AAC5B,YAAU,WAAW,CAAC;AAEtB,SAAO,KAAK,OAAO,EAAE,QAAQ,SAAU,MAAM;AAC3C,QAAI,yBAAyB,QAAQ,IAAI,MAAM,IAAI;AACjD,YAAM,IAAI,UAAU,qBAAqB,OAAO,gCAAgC,MAAM,cAAc;AAAA,IACtG;AAAA,EACF,CAAC;AAGD,OAAK,UAAgB;AACrB,OAAK,MAAgB;AACrB,OAAK,OAAgB,QAAQ,MAAM,KAAc;AACjD,OAAK,UAAgB,QAAQ,SAAS,KAAW,WAAY;AAAE,WAAO;AAAA,EAAM;AAC5E,OAAK,YAAgB,QAAQ,WAAW,KAAS,SAAU,MAAM;AAAE,WAAO;AAAA,EAAM;AAChF,OAAK,aAAgB,QAAQ,YAAY,KAAQ;AACjD,OAAK,YAAgB,QAAQ,WAAW,KAAS;AACjD,OAAK,YAAgB,QAAQ,WAAW,KAAS;AACjD,OAAK,gBAAgB,QAAQ,eAAe,KAAK;AACjD,OAAK,eAAgB,QAAQ,cAAc,KAAM;AACjD,OAAK,QAAgB,QAAQ,OAAO,KAAa;AACjD,OAAK,eAAgB,oBAAoB,QAAQ,cAAc,KAAK,IAAI;AAExE,MAAI,gBAAgB,QAAQ,KAAK,IAAI,MAAM,IAAI;AAC7C,UAAM,IAAI,UAAU,mBAAmB,KAAK,OAAO,yBAAyB,MAAM,cAAc;AAAA,EAClG;AACF;AAEA,IAAI,OAAO;AAQX,SAAS,YAAYC,SAAQ,MAAM;AACjC,MAAI,SAAS,CAAC;AAEd,EAAAA,QAAO,IAAI,EAAE,QAAQ,SAAU,aAAa;AAC1C,QAAI,WAAW,OAAO;AAEtB,WAAO,QAAQ,SAAU,cAAc,eAAe;AACpD,UAAI,aAAa,QAAQ,YAAY,OACjC,aAAa,SAAS,YAAY,QAClC,aAAa,UAAU,YAAY,OAAO;AAE5C,mBAAW;AAAA,MACb;AAAA,IACF,CAAC;AAED,WAAO,QAAQ,IAAI;AAAA,EACrB,CAAC;AAED,SAAO;AACT;AAGA,SAAS,aAA2B;AAClC,MAAI,SAAS;AAAA,IACP,QAAQ,CAAC;AAAA,IACT,UAAU,CAAC;AAAA,IACX,SAAS,CAAC;AAAA,IACV,UAAU,CAAC;AAAA,IACX,OAAO;AAAA,MACL,QAAQ,CAAC;AAAA,MACT,UAAU,CAAC;AAAA,MACX,SAAS,CAAC;AAAA,MACV,UAAU,CAAC;AAAA,IACb;AAAA,EACF,GAAG,OAAO;AAEd,WAAS,YAAYC,OAAM;AACzB,QAAIA,MAAK,OAAO;AACd,aAAO,MAAMA,MAAK,IAAI,EAAE,KAAKA,KAAI;AACjC,aAAO,MAAM,UAAU,EAAE,KAAKA,KAAI;AAAA,IACpC,OAAO;AACL,aAAOA,MAAK,IAAI,EAAEA,MAAK,GAAG,IAAI,OAAO,UAAU,EAAEA,MAAK,GAAG,IAAIA;AAAA,IAC/D;AAAA,EACF;AAEA,OAAK,QAAQ,GAAG,SAAS,UAAU,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACrE,cAAU,KAAK,EAAE,QAAQ,WAAW;AAAA,EACtC;AACA,SAAO;AACT;AAGA,SAAS,SAAS,YAAY;AAC5B,SAAO,KAAK,OAAO,UAAU;AAC/B;AAGA,SAAS,UAAU,SAAS,SAASC,QAAO,YAAY;AACtD,MAAI,WAAW,CAAC;AAChB,MAAI,WAAW,CAAC;AAEhB,MAAI,sBAAsB,MAAM;AAE9B,aAAS,KAAK,UAAU;AAAA,EAE1B,WAAW,MAAM,QAAQ,UAAU,GAAG;AAEpC,eAAW,SAAS,OAAO,UAAU;AAAA,EAEvC,WAAW,eAAe,MAAM,QAAQ,WAAW,QAAQ,KAAK,MAAM,QAAQ,WAAW,QAAQ,IAAI;AAEnG,QAAI,WAAW,SAAU,YAAW,SAAS,OAAO,WAAW,QAAQ;AACvE,QAAI,WAAW,SAAU,YAAW,SAAS,OAAO,WAAW,QAAQ;AAAA,EAEzE,OAAO;AACL,UAAM,IAAI,UAAU,kHAC6C;AAAA,EACnE;AAEA,WAAS,QAAQ,SAAU,QAAQ;AACjC,QAAI,EAAE,kBAAkB,OAAO;AAC7B,YAAM,IAAI,UAAU,oFAAoF;AAAA,IAC1G;AAEA,QAAI,OAAO,YAAY,OAAO,aAAa,UAAU;AACnD,YAAM,IAAI,UAAU,iHAAiH;AAAA,IACvI;AAEA,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,oGAAoG;AAAA,IAC1H;AAAA,EACF,CAAC;AAED,WAAS,QAAQ,SAAU,QAAQ;AACjC,QAAI,EAAE,kBAAkB,OAAO;AAC7B,YAAM,IAAI,UAAU,oFAAoF;AAAA,IAC1G;AAAA,EACF,CAAC;AAED,MAAI,SAAS,OAAO,OAAO,SAAS,SAAS;AAE7C,SAAO,YAAY,KAAK,YAAY,CAAC,GAAG,OAAO,QAAQ;AACvD,SAAO,YAAY,KAAK,YAAY,CAAC,GAAG,OAAO,QAAQ;AAEvD,SAAO,mBAAmB,YAAY,QAAQ,UAAU;AACxD,SAAO,mBAAmB,YAAY,QAAQ,UAAU;AACxD,SAAO,kBAAmB,WAAW,OAAO,kBAAkB,OAAO,gBAAgB;AAErF,SAAO;AACT;AAGA,IAAI,SAAS;AAEb,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO;AAAA,EAAI;AACjE,CAAC;AAED,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO,CAAC;AAAA,EAAG;AACjE,CAAC;AAED,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO,CAAC;AAAA,EAAG;AACjE,CAAC;AAED,IAAI,WAAW,IAAI,OAAO;AAAA,EACxB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAED,SAAS,gBAAgB,MAAM;AAC7B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK;AAEf,SAAQ,QAAQ,KAAK,SAAS,OACtB,QAAQ,MAAM,SAAS,UAAU,SAAS,UAAU,SAAS;AACvE;AAEA,SAAS,oBAAoB;AAC3B,SAAO;AACT;AAEA,SAAS,OAAO,QAAQ;AACtB,SAAO,WAAW;AACpB;AAEA,IAAI,QAAQ,IAAI,KAAK,0BAA0B;AAAA,EAC7C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,OAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,EAC1C;AAAA,EACA,cAAc;AAChB,CAAC;AAED,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK;AAEf,SAAQ,QAAQ,MAAM,SAAS,UAAU,SAAS,UAAU,SAAS,WAC7D,QAAQ,MAAM,SAAS,WAAW,SAAS,WAAW,SAAS;AACzE;AAEA,SAAS,qBAAqB,MAAM;AAClC,SAAO,SAAS,UACT,SAAS,UACT,SAAS;AAClB;AAEA,SAAS,UAAU,QAAQ;AACzB,SAAO,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM;AACpD;AAEA,IAAI,OAAO,IAAI,KAAK,0BAA0B;AAAA,EAC5C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,IACjE,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,IACjE,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,EACnE;AAAA,EACA,cAAc;AAChB,CAAC;AAED,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK,MAC3B,MAAe,KAAO,KAAK,MAC3B,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK,QACX,QAAQ,GACR,YAAY,OACZ;AAEJ,MAAI,CAAC,IAAK,QAAO;AAEjB,OAAK,KAAK,KAAK;AAGf,MAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,SAAK,KAAK,EAAE,KAAK;AAAA,EACnB;AAEA,MAAI,OAAO,KAAK;AAEd,QAAI,QAAQ,MAAM,IAAK,QAAO;AAC9B,SAAK,KAAK,EAAE,KAAK;AAIjB,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,OAAO,OAAO,OAAO,IAAK,QAAO;AACrC,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAGA,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,EAAG,QAAO;AAC/C,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAGA,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,EAAG,QAAO;AAC/C,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAAA,EACF;AAKA,MAAI,OAAO,IAAK,QAAO;AAEvB,SAAO,QAAQ,KAAK,SAAS;AAC3B,SAAK,KAAK,KAAK;AACf,QAAI,OAAO,IAAK;AAChB,QAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,GAAG;AACtC,aAAO;AAAA,IACT;AACA,gBAAY;AAAA,EACd;AAGA,MAAI,CAAC,aAAa,OAAO,IAAK,QAAO;AAErC,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAM;AAClC,MAAI,QAAQ,MAAM,OAAO,GAAG;AAE5B,MAAI,MAAM,QAAQ,GAAG,MAAM,IAAI;AAC7B,YAAQ,MAAM,QAAQ,MAAM,EAAE;AAAA,EAChC;AAEA,OAAK,MAAM,CAAC;AAEZ,MAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,QAAI,OAAO,IAAK,QAAO;AACvB,YAAQ,MAAM,MAAM,CAAC;AACrB,SAAK,MAAM,CAAC;AAAA,EACd;AAEA,MAAI,UAAU,IAAK,QAAO;AAE1B,MAAI,OAAO,KAAK;AACd,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,CAAC;AAC9D,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,EAAE;AAC/D,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,CAAC;AAAA,EAChE;AAEA,SAAO,OAAO,SAAS,OAAO,EAAE;AAClC;AAEA,SAAS,UAAU,QAAQ;AACzB,SAAQ,OAAO,UAAU,SAAS,KAAK,MAAM,MAAO,sBAC5C,SAAS,MAAM,KAAK,CAAC,OAAO,eAAe,MAAM;AAC3D;AAEA,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,QAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAO,IAAI,SAAS,CAAC,IAAI,QAAQ,IAAI,SAAS,CAAC,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,IAC3G,OAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAQ,IAAI,SAAS,CAAC,IAAI,QAAS,IAAI,SAAS,CAAC,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,IAC7G,SAAa,SAAU,KAAK;AAAE,aAAO,IAAI,SAAS,EAAE;AAAA,IAAG;AAAA;AAAA,IAEvD,aAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAO,IAAI,SAAS,EAAE,EAAE,YAAY,IAAK,QAAQ,IAAI,SAAS,EAAE,EAAE,YAAY,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,EAC5I;AAAA,EACA,cAAc;AAAA,EACd,cAAc;AAAA,IACZ,QAAa,CAAE,GAAI,KAAM;AAAA,IACzB,OAAa,CAAE,GAAI,KAAM;AAAA,IACzB,SAAa,CAAE,IAAI,KAAM;AAAA,IACzB,aAAa,CAAE,IAAI,KAAM;AAAA,EAC3B;AACF,CAAC;AAED,IAAI,qBAAqB,IAAI;AAAA;AAAA,EAE3B;AAOuB;AAEzB,SAAS,iBAAiB,MAAM;AAC9B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,CAAC,mBAAmB,KAAK,IAAI;AAAA;AAAA,EAG7B,KAAK,KAAK,SAAS,CAAC,MAAM,KAAK;AACjC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,OAAO;AAEX,UAAS,KAAK,QAAQ,MAAM,EAAE,EAAE,YAAY;AAC5C,SAAS,MAAM,CAAC,MAAM,MAAM,KAAK;AAEjC,MAAI,KAAK,QAAQ,MAAM,CAAC,CAAC,KAAK,GAAG;AAC/B,YAAQ,MAAM,MAAM,CAAC;AAAA,EACvB;AAEA,MAAI,UAAU,QAAQ;AACpB,WAAQ,SAAS,IAAK,OAAO,oBAAoB,OAAO;AAAA,EAE1D,WAAW,UAAU,QAAQ;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,OAAO,WAAW,OAAO,EAAE;AACpC;AAGA,IAAI,yBAAyB;AAE7B,SAAS,mBAAmB,QAAQ,OAAO;AACzC,MAAI;AAEJ,MAAI,MAAM,MAAM,GAAG;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,sBAAsB,QAAQ;AAC9C,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,sBAAsB,QAAQ;AAC9C,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,eAAe,MAAM,GAAG;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,SAAS,EAAE;AAKxB,SAAO,uBAAuB,KAAK,GAAG,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI;AACrE;AAEA,SAAS,QAAQ,QAAQ;AACvB,SAAQ,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM,sBAC3C,SAAS,MAAM,KAAK,OAAO,eAAe,MAAM;AAC1D;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAChB,CAAC;AAED,IAAI,OAAO,SAAS,OAAO;AAAA,EACzB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAED,IAAI,OAAO;AAEX,IAAI,mBAAmB,IAAI;AAAA,EACzB;AAEgB;AAElB,IAAI,wBAAwB,IAAI;AAAA,EAC9B;AASwB;AAE1B,SAAS,qBAAqB,MAAM;AAClC,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,iBAAiB,KAAK,IAAI,MAAM,KAAM,QAAO;AACjD,MAAI,sBAAsB,KAAK,IAAI,MAAM,KAAM,QAAO;AACtD,SAAO;AACT;AAEA,SAAS,uBAAuB,MAAM;AACpC,MAAIJ,QAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,QAAQ,WAAW,GAC1D,QAAQ,MAAM,SAAS,WAAW;AAEtC,EAAAA,SAAQ,iBAAiB,KAAK,IAAI;AAClC,MAAIA,WAAU,KAAM,CAAAA,SAAQ,sBAAsB,KAAK,IAAI;AAE3D,MAAIA,WAAU,KAAM,OAAM,IAAI,MAAM,oBAAoB;AAIxD,SAAO,CAAEA,OAAM,CAAC;AAChB,UAAQ,CAAEA,OAAM,CAAC,IAAK;AACtB,QAAM,CAAEA,OAAM,CAAC;AAEf,MAAI,CAACA,OAAM,CAAC,GAAG;AACb,WAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,EAC5C;AAIA,SAAO,CAAEA,OAAM,CAAC;AAChB,WAAS,CAAEA,OAAM,CAAC;AAClB,WAAS,CAAEA,OAAM,CAAC;AAElB,MAAIA,OAAM,CAAC,GAAG;AACZ,eAAWA,OAAM,CAAC,EAAE,MAAM,GAAG,CAAC;AAC9B,WAAO,SAAS,SAAS,GAAG;AAC1B,kBAAY;AAAA,IACd;AACA,eAAW,CAAC;AAAA,EACd;AAIA,MAAIA,OAAM,CAAC,GAAG;AACZ,cAAU,CAAEA,OAAM,EAAE;AACpB,gBAAY,EAAEA,OAAM,EAAE,KAAK;AAC3B,aAAS,UAAU,KAAK,aAAa;AACrC,QAAIA,OAAM,CAAC,MAAM,IAAK,SAAQ,CAAC;AAAA,EACjC;AAEA,SAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,KAAK,MAAM,QAAQ,QAAQ,QAAQ,CAAC;AAE1E,MAAI,MAAO,MAAK,QAAQ,KAAK,QAAQ,IAAI,KAAK;AAE9C,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAoB;AAClD,SAAO,OAAO,YAAY;AAC5B;AAEA,IAAI,YAAY,IAAI,KAAK,+BAA+B;AAAA,EACtD,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,WAAW;AACb,CAAC;AAED,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,QAAQ,SAAS;AACnC;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AASD,IAAI,aAAa;AAGjB,SAAS,kBAAkB,MAAM;AAC/B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK,SAAS,GAAG,MAAM,KAAK,QAAQC,OAAM;AAGpD,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,WAAOA,KAAI,QAAQ,KAAK,OAAO,GAAG,CAAC;AAGnC,QAAI,OAAO,GAAI;AAGf,QAAI,OAAO,EAAG,QAAO;AAErB,cAAU;AAAA,EACZ;AAGA,SAAQ,SAAS,MAAO;AAC1B;AAEA,SAAS,oBAAoB,MAAM;AACjC,MAAI,KAAK,UACL,QAAQ,KAAK,QAAQ,YAAY,EAAE,GACnC,MAAM,MAAM,QACZA,OAAM,YACN,OAAO,GACP,SAAS,CAAC;AAId,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,QAAK,MAAM,MAAM,KAAM,KAAK;AAC1B,aAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,aAAO,KAAM,QAAQ,IAAK,GAAI;AAC9B,aAAO,KAAK,OAAO,GAAI;AAAA,IACzB;AAEA,WAAQ,QAAQ,IAAKA,KAAI,QAAQ,MAAM,OAAO,GAAG,CAAC;AAAA,EACpD;AAIA,aAAY,MAAM,IAAK;AAEvB,MAAI,aAAa,GAAG;AAClB,WAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAC9B,WAAO,KAAK,OAAO,GAAI;AAAA,EACzB,WAAW,aAAa,IAAI;AAC1B,WAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAAA,EAChC,WAAW,aAAa,IAAI;AAC1B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAAA,EAChC;AAEA,SAAO,IAAI,WAAW,MAAM;AAC9B;AAEA,SAAS,oBAAoB,QAAoB;AAC/C,MAAI,SAAS,IAAI,OAAO,GAAG,KAAK,MAC5B,MAAM,OAAO,QACbA,OAAM;AAIV,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,QAAK,MAAM,MAAM,KAAM,KAAK;AAC1B,gBAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,gBAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,gBAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,gBAAUA,KAAI,OAAO,EAAI;AAAA,IAC3B;AAEA,YAAQ,QAAQ,KAAK,OAAO,GAAG;AAAA,EACjC;AAIA,SAAO,MAAM;AAEb,MAAI,SAAS,GAAG;AACd,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,OAAO,EAAI;AAAA,EAC3B,WAAW,SAAS,GAAG;AACrB,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,EAAE;AAAA,EAClB,WAAW,SAAS,GAAG;AACrB,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,EAAE;AAChB,cAAUA,KAAI,EAAE;AAAA,EAClB;AAEA,SAAO;AACT;AAEA,SAAS,SAAS,KAAK;AACrB,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG,MAAO;AAClD;AAEA,IAAI,SAAS,IAAI,KAAK,4BAA4B;AAAA,EAChD,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AACb,CAAC;AAED,IAAI,oBAAoB,OAAO,UAAU;AACzC,IAAI,cAAoB,OAAO,UAAU;AAEzC,SAAS,gBAAgB,MAAM;AAC7B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,aAAa,CAAC,GAAG,OAAO,QAAQ,MAAM,SAAS,YAC/C,SAAS;AAEb,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AACnB,iBAAa;AAEb,QAAI,YAAY,KAAK,IAAI,MAAM,kBAAmB,QAAO;AAEzD,SAAK,WAAW,MAAM;AACpB,UAAI,kBAAkB,KAAK,MAAM,OAAO,GAAG;AACzC,YAAI,CAAC,WAAY,cAAa;AAAA,YACzB,QAAO;AAAA,MACd;AAAA,IACF;AAEA,QAAI,CAAC,WAAY,QAAO;AAExB,QAAI,WAAW,QAAQ,OAAO,MAAM,GAAI,YAAW,KAAK,OAAO;AAAA,QAC1D,QAAO;AAAA,EACd;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,MAAM;AAC/B,SAAO,SAAS,OAAO,OAAO,CAAC;AACjC;AAEA,IAAI,OAAO,IAAI,KAAK,0BAA0B;AAAA,EAC5C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,cAAc,OAAO,UAAU;AAEnC,SAAS,iBAAiB,MAAM;AAC9B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,OAAO,QAAQ,MAAM,MAAM,QAC3B,SAAS;AAEb,WAAS,IAAI,MAAM,OAAO,MAAM;AAEhC,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AAEnB,QAAI,YAAY,KAAK,IAAI,MAAM,kBAAmB,QAAO;AAEzD,WAAO,OAAO,KAAK,IAAI;AAEvB,QAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,WAAO,KAAK,IAAI,CAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAE;AAAA,EAC3C;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO,CAAC;AAE3B,MAAI,OAAO,QAAQ,MAAM,MAAM,QAC3B,SAAS;AAEb,WAAS,IAAI,MAAM,OAAO,MAAM;AAEhC,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AAEnB,WAAO,OAAO,KAAK,IAAI;AAEvB,WAAO,KAAK,IAAI,CAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAE;AAAA,EAC3C;AAEA,SAAO;AACT;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,oBAAoB,OAAO,UAAU;AAEzC,SAAS,eAAe,MAAM;AAC5B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,KAAK,SAAS;AAElB,OAAK,OAAO,QAAQ;AAClB,QAAI,kBAAkB,KAAK,QAAQ,GAAG,GAAG;AACvC,UAAI,OAAO,GAAG,MAAM,KAAM,QAAO;AAAA,IACnC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,OAAO,OAAO,CAAC;AACjC;AAEA,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,WAAW,KAAK,OAAO;AAAA,EACzB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAUD,IAAI,oBAAoB,OAAO,UAAU;AAGzC,IAAI,kBAAoB;AACxB,IAAI,mBAAoB;AACxB,IAAI,mBAAoB;AACxB,IAAI,oBAAoB;AAGxB,IAAI,gBAAiB;AACrB,IAAI,iBAAiB;AACrB,IAAI,gBAAiB;AAGrB,IAAI,wBAAgC;AACpC,IAAI,gCAAgC;AACpC,IAAI,0BAAgC;AACpC,IAAI,qBAAgC;AACpC,IAAI,kBAAgC;AAGpC,SAAS,OAAO,KAAK;AAAE,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG;AAAG;AAEnE,SAAS,OAAO,GAAG;AACjB,SAAQ,MAAM,MAAkB,MAAM;AACxC;AAEA,SAAS,eAAe,GAAG;AACzB,SAAQ,MAAM,KAAmB,MAAM;AACzC;AAEA,SAAS,aAAa,GAAG;AACvB,SAAQ,MAAM,KACN,MAAM,MACN,MAAM,MACN,MAAM;AAChB;AAEA,SAAS,kBAAkB,GAAG;AAC5B,SAAO,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM;AACf;AAEA,SAAS,YAAY,GAAG;AACtB,MAAI;AAEJ,MAAK,MAAe,KAAO,KAAK,IAAc;AAC5C,WAAO,IAAI;AAAA,EACb;AAGA,OAAK,IAAI;AAET,MAAK,MAAe,MAAQ,MAAM,KAAc;AAC9C,WAAO,KAAK,KAAO;AAAA,EACrB;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,GAAG;AACxB,MAAI,MAAM,KAAa;AAAE,WAAO;AAAA,EAAG;AACnC,MAAI,MAAM,KAAa;AAAE,WAAO;AAAA,EAAG;AACnC,MAAI,MAAM,IAAa;AAAE,WAAO;AAAA,EAAG;AACnC,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAG;AAC1B,MAAK,MAAe,KAAO,KAAK,IAAc;AAC5C,WAAO,IAAI;AAAA,EACb;AAEA,SAAO;AACT;AAEA,SAAS,qBAAqB,GAAG;AAE/B,SAAQ,MAAM,KAAe,OACtB,MAAM,KAAe,SACrB,MAAM,KAAe,OACrB,MAAM,MAAe,MACrB,MAAM,IAAiB,MACvB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,SACrB,MAAM,KAAmB,MACzB,MAAM,KAAe,MACrB,MAAM,KAAe,MACrB,MAAM,KAAe,OACrB,MAAM,KAAe,SACrB,MAAM,KAAe,SACrB,MAAM,KAAe,WACrB,MAAM,KAAe,WAAW;AACzC;AAEA,SAAS,kBAAkB,GAAG;AAC5B,MAAI,KAAK,OAAQ;AACf,WAAO,OAAO,aAAa,CAAC;AAAA,EAC9B;AAGA,SAAO,OAAO;AAAA,KACV,IAAI,SAAa,MAAM;AAAA,KACvB,IAAI,QAAY,QAAU;AAAA,EAC9B;AACF;AAIA,SAAS,YAAY,QAAQ,KAAK,OAAO;AAEvC,MAAI,QAAQ,aAAa;AACvB,WAAO,eAAe,QAAQ,KAAK;AAAA,MACjC,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAEA,IAAI,oBAAoB,IAAI,MAAM,GAAG;AACrC,IAAI,kBAAkB,IAAI,MAAM,GAAG;AACnC,KAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,oBAAkB,CAAC,IAAI,qBAAqB,CAAC,IAAI,IAAI;AACrD,kBAAgB,CAAC,IAAI,qBAAqB,CAAC;AAC7C;AAHS;AAMT,SAAS,QAAQ,OAAO,SAAS;AAC/B,OAAK,QAAQ;AAEb,OAAK,WAAY,QAAQ,UAAU,KAAM;AACzC,OAAK,SAAY,QAAQ,QAAQ,KAAQ;AACzC,OAAK,YAAY,QAAQ,WAAW,KAAK;AAGzC,OAAK,SAAY,QAAQ,QAAQ,KAAQ;AAEzC,OAAK,OAAY,QAAQ,MAAM,KAAU;AACzC,OAAK,WAAY,QAAQ,UAAU,KAAM;AAEzC,OAAK,gBAAgB,KAAK,OAAO;AACjC,OAAK,UAAgB,KAAK,OAAO;AAEjC,OAAK,SAAa,MAAM;AACxB,OAAK,WAAa;AAClB,OAAK,OAAa;AAClB,OAAK,YAAa;AAClB,OAAK,aAAa;AAIlB,OAAK,iBAAiB;AAEtB,OAAK,YAAY,CAAC;AAYpB;AAGA,SAAS,cAAc,OAAO,SAAS;AACrC,MAAI,OAAO;AAAA,IACT,MAAU,MAAM;AAAA,IAChB,QAAU,MAAM,MAAM,MAAM,GAAG,EAAE;AAAA;AAAA,IACjC,UAAU,MAAM;AAAA,IAChB,MAAU,MAAM;AAAA,IAChB,QAAU,MAAM,WAAW,MAAM;AAAA,EACnC;AAEA,OAAK,UAAU,QAAQ,IAAI;AAE3B,SAAO,IAAI,UAAU,SAAS,IAAI;AACpC;AAEA,SAAS,WAAW,OAAO,SAAS;AAClC,QAAM,cAAc,OAAO,OAAO;AACpC;AAEA,SAAS,aAAa,OAAO,SAAS;AACpC,MAAI,MAAM,WAAW;AACnB,UAAM,UAAU,KAAK,MAAM,cAAc,OAAO,OAAO,CAAC;AAAA,EAC1D;AACF;AAGA,IAAI,oBAAoB;AAAA,EAEtB,MAAM,SAAS,oBAAoB,OAAO,MAAM,MAAM;AAEpD,QAAID,QAAO,OAAO;AAElB,QAAI,MAAM,YAAY,MAAM;AAC1B,iBAAW,OAAO,gCAAgC;AAAA,IACpD;AAEA,QAAI,KAAK,WAAW,GAAG;AACrB,iBAAW,OAAO,6CAA6C;AAAA,IACjE;AAEA,IAAAA,SAAQ,uBAAuB,KAAK,KAAK,CAAC,CAAC;AAE3C,QAAIA,WAAU,MAAM;AAClB,iBAAW,OAAO,2CAA2C;AAAA,IAC/D;AAEA,YAAQ,SAASA,OAAM,CAAC,GAAG,EAAE;AAC7B,YAAQ,SAASA,OAAM,CAAC,GAAG,EAAE;AAE7B,QAAI,UAAU,GAAG;AACf,iBAAW,OAAO,2CAA2C;AAAA,IAC/D;AAEA,UAAM,UAAU,KAAK,CAAC;AACtB,UAAM,kBAAmB,QAAQ;AAEjC,QAAI,UAAU,KAAK,UAAU,GAAG;AAC9B,mBAAa,OAAO,0CAA0C;AAAA,IAChE;AAAA,EACF;AAAA,EAEA,KAAK,SAAS,mBAAmB,OAAO,MAAM,MAAM;AAElD,QAAI,QAAQ;AAEZ,QAAI,KAAK,WAAW,GAAG;AACrB,iBAAW,OAAO,6CAA6C;AAAA,IACjE;AAEA,aAAS,KAAK,CAAC;AACf,aAAS,KAAK,CAAC;AAEf,QAAI,CAAC,mBAAmB,KAAK,MAAM,GAAG;AACpC,iBAAW,OAAO,6DAA6D;AAAA,IACjF;AAEA,QAAI,kBAAkB,KAAK,MAAM,QAAQ,MAAM,GAAG;AAChD,iBAAW,OAAO,gDAAgD,SAAS,cAAc;AAAA,IAC3F;AAEA,QAAI,CAAC,gBAAgB,KAAK,MAAM,GAAG;AACjC,iBAAW,OAAO,8DAA8D;AAAA,IAClF;AAEA,QAAI;AACF,eAAS,mBAAmB,MAAM;AAAA,IACpC,SAAS,KAAK;AACZ,iBAAW,OAAO,8BAA8B,MAAM;AAAA,IACxD;AAEA,UAAM,OAAO,MAAM,IAAI;AAAA,EACzB;AACF;AAGA,SAAS,eAAe,OAAO,OAAO,KAAK,WAAW;AACpD,MAAI,WAAW,SAAS,YAAY;AAEpC,MAAI,QAAQ,KAAK;AACf,cAAU,MAAM,MAAM,MAAM,OAAO,GAAG;AAEtC,QAAI,WAAW;AACb,WAAK,YAAY,GAAG,UAAU,QAAQ,QAAQ,YAAY,SAAS,aAAa,GAAG;AACjF,qBAAa,QAAQ,WAAW,SAAS;AACzC,YAAI,EAAE,eAAe,KACd,MAAQ,cAAc,cAAc,UAAY;AACrD,qBAAW,OAAO,+BAA+B;AAAA,QACnD;AAAA,MACF;AAAA,IACF,WAAW,sBAAsB,KAAK,OAAO,GAAG;AAC9C,iBAAW,OAAO,8CAA8C;AAAA,IAClE;AAEA,UAAM,UAAU;AAAA,EAClB;AACF;AAEA,SAAS,cAAc,OAAO,aAAa,QAAQ,iBAAiB;AAClE,MAAI,YAAY,KAAK,OAAO;AAE5B,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,eAAW,OAAO,mEAAmE;AAAA,EACvF;AAEA,eAAa,OAAO,KAAK,MAAM;AAE/B,OAAK,QAAQ,GAAG,WAAW,WAAW,QAAQ,QAAQ,UAAU,SAAS,GAAG;AAC1E,UAAM,WAAW,KAAK;AAEtB,QAAI,CAAC,kBAAkB,KAAK,aAAa,GAAG,GAAG;AAC7C,kBAAY,aAAa,KAAK,OAAO,GAAG,CAAC;AACzC,sBAAgB,GAAG,IAAI;AAAA,IACzB;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAC1E,WAAW,gBAAgB,UAAU;AAErC,MAAI,OAAO;AAKX,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAU,MAAM,UAAU,MAAM,KAAK,OAAO;AAE5C,SAAK,QAAQ,GAAG,WAAW,QAAQ,QAAQ,QAAQ,UAAU,SAAS,GAAG;AACvE,UAAI,MAAM,QAAQ,QAAQ,KAAK,CAAC,GAAG;AACjC,mBAAW,OAAO,6CAA6C;AAAA,MACjE;AAEA,UAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,KAAK,CAAC,MAAM,mBAAmB;AAC/E,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAKA,MAAI,OAAO,YAAY,YAAY,OAAO,OAAO,MAAM,mBAAmB;AACxE,cAAU;AAAA,EACZ;AAGA,YAAU,OAAO,OAAO;AAExB,MAAI,YAAY,MAAM;AACpB,cAAU,CAAC;AAAA,EACb;AAEA,MAAI,WAAW,2BAA2B;AACxC,QAAI,MAAM,QAAQ,SAAS,GAAG;AAC5B,WAAK,QAAQ,GAAG,WAAW,UAAU,QAAQ,QAAQ,UAAU,SAAS,GAAG;AACzE,sBAAc,OAAO,SAAS,UAAU,KAAK,GAAG,eAAe;AAAA,MACjE;AAAA,IACF,OAAO;AACL,oBAAc,OAAO,SAAS,WAAW,eAAe;AAAA,IAC1D;AAAA,EACF,OAAO;AACL,QAAI,CAAC,MAAM,QACP,CAAC,kBAAkB,KAAK,iBAAiB,OAAO,KAChD,kBAAkB,KAAK,SAAS,OAAO,GAAG;AAC5C,YAAM,OAAO,aAAa,MAAM;AAChC,YAAM,YAAY,kBAAkB,MAAM;AAC1C,YAAM,WAAW,YAAY,MAAM;AACnC,iBAAW,OAAO,wBAAwB;AAAA,IAC5C;AAEA,gBAAY,SAAS,SAAS,SAAS;AACvC,WAAO,gBAAgB,OAAO;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,OAAO;AAC5B,MAAI;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAc;AACvB,UAAM;AAAA,EACR,WAAW,OAAO,IAAc;AAC9B,UAAM;AACN,QAAI,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAc;AAC3D,YAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,eAAW,OAAO,0BAA0B;AAAA,EAC9C;AAEA,QAAM,QAAQ;AACd,QAAM,YAAY,MAAM;AACxB,QAAM,iBAAiB;AACzB;AAEA,SAAS,oBAAoB,OAAO,eAAe,aAAa;AAC9D,MAAI,aAAa,GACb,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE9C,SAAO,OAAO,GAAG;AACf,WAAO,eAAe,EAAE,GAAG;AACzB,UAAI,OAAO,KAAiB,MAAM,mBAAmB,IAAI;AACvD,cAAM,iBAAiB,MAAM;AAAA,MAC/B;AACA,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,QAAI,iBAAiB,OAAO,IAAa;AACvC,SAAG;AACD,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C,SAAS,OAAO,MAAgB,OAAO,MAAgB,OAAO;AAAA,IAChE;AAEA,QAAI,OAAO,EAAE,GAAG;AACd,oBAAc,KAAK;AAEnB,WAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AACA,YAAM,aAAa;AAEnB,aAAO,OAAO,IAAiB;AAC7B,cAAM;AACN,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,MAAI,gBAAgB,MAAM,eAAe,KAAK,MAAM,aAAa,aAAa;AAC5E,iBAAa,OAAO,uBAAuB;AAAA,EAC7C;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,OAAO;AACpC,MAAI,YAAY,MAAM,UAClB;AAEJ,OAAK,MAAM,MAAM,WAAW,SAAS;AAIrC,OAAK,OAAO,MAAe,OAAO,OAC9B,OAAO,MAAM,MAAM,WAAW,YAAY,CAAC,KAC3C,OAAO,MAAM,MAAM,WAAW,YAAY,CAAC,GAAG;AAEhD,iBAAa;AAEb,SAAK,MAAM,MAAM,WAAW,SAAS;AAErC,QAAI,OAAO,KAAK,aAAa,EAAE,GAAG;AAChC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,OAAO;AACtC,MAAI,UAAU,GAAG;AACf,UAAM,UAAU;AAAA,EAClB,WAAW,QAAQ,GAAG;AACpB,UAAM,UAAU,OAAO,OAAO,MAAM,QAAQ,CAAC;AAAA,EAC/C;AACF;AAGA,SAAS,gBAAgB,OAAO,YAAY,sBAAsB;AAChE,MAAI,WACA,WACA,cACA,YACA,mBACA,OACA,YACA,aACA,QAAQ,MAAM,MACd,UAAU,MAAM,QAChB;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,aAAa,EAAE,KACf,kBAAkB,EAAE,KACpB,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,OACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,MAAe,OAAO,IAAa;AAC5C,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,QAAI,aAAa,SAAS,KACtB,wBAAwB,kBAAkB,SAAS,GAAG;AACxD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,iBAAe,aAAa,MAAM;AAClC,sBAAoB;AAEpB,SAAO,OAAO,GAAG;AACf,QAAI,OAAO,IAAa;AACtB,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,KACtB,wBAAwB,kBAAkB,SAAS,GAAG;AACxD;AAAA,MACF;AAAA,IAEF,WAAW,OAAO,IAAa;AAC7B,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,GAAG;AAC3B;AAAA,MACF;AAAA,IAEF,WAAY,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,KAClE,wBAAwB,kBAAkB,EAAE,GAAG;AACxD;AAAA,IAEF,WAAW,OAAO,EAAE,GAAG;AACrB,cAAQ,MAAM;AACd,mBAAa,MAAM;AACnB,oBAAc,MAAM;AACpB,0BAAoB,OAAO,OAAO,EAAE;AAEpC,UAAI,MAAM,cAAc,YAAY;AAClC,4BAAoB;AACpB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AAAA,MACF,OAAO;AACL,cAAM,WAAW;AACjB,cAAM,OAAO;AACb,cAAM,YAAY;AAClB,cAAM,aAAa;AACnB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,mBAAmB;AACrB,qBAAe,OAAO,cAAc,YAAY,KAAK;AACrD,uBAAiB,OAAO,MAAM,OAAO,KAAK;AAC1C,qBAAe,aAAa,MAAM;AAClC,0BAAoB;AAAA,IACtB;AAEA,QAAI,CAAC,eAAe,EAAE,GAAG;AACvB,mBAAa,MAAM,WAAW;AAAA,IAChC;AAEA,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,iBAAe,OAAO,cAAc,YAAY,KAAK;AAErD,MAAI,MAAM,QAAQ;AAChB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,SAAO;AACT;AAEA,SAAS,uBAAuB,OAAO,YAAY;AACjD,MAAI,IACA,cAAc;AAElB,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM;AACN,iBAAe,aAAa,MAAM;AAElC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,QAAI,OAAO,IAAa;AACtB,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,UAAI,OAAO,IAAa;AACtB,uBAAe,MAAM;AACrB,cAAM;AACN,qBAAa,MAAM;AAAA,MACrB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IAEF,WAAW,OAAO,EAAE,GAAG;AACrB,qBAAe,OAAO,cAAc,YAAY,IAAI;AACpD,uBAAiB,OAAO,oBAAoB,OAAO,OAAO,UAAU,CAAC;AACrE,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAC7E,iBAAW,OAAO,8DAA8D;AAAA,IAElF,OAAO;AACL,YAAM;AACN,mBAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAEA,aAAW,OAAO,4DAA4D;AAChF;AAEA,SAAS,uBAAuB,OAAO,YAAY;AACjD,MAAI,cACA,YACA,WACA,WACA,KACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM;AACN,iBAAe,aAAa,MAAM;AAElC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,QAAI,OAAO,IAAa;AACtB,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,YAAM;AACN,aAAO;AAAA,IAET,WAAW,OAAO,IAAa;AAC7B,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,UAAI,OAAO,EAAE,GAAG;AACd,4BAAoB,OAAO,OAAO,UAAU;AAAA,MAG9C,WAAW,KAAK,OAAO,kBAAkB,EAAE,GAAG;AAC5C,cAAM,UAAU,gBAAgB,EAAE;AAClC,cAAM;AAAA,MAER,YAAY,MAAM,cAAc,EAAE,KAAK,GAAG;AACxC,oBAAY;AACZ,oBAAY;AAEZ,eAAO,YAAY,GAAG,aAAa;AACjC,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,eAAK,MAAM,YAAY,EAAE,MAAM,GAAG;AAChC,yBAAa,aAAa,KAAK;AAAA,UAEjC,OAAO;AACL,uBAAW,OAAO,gCAAgC;AAAA,UACpD;AAAA,QACF;AAEA,cAAM,UAAU,kBAAkB,SAAS;AAE3C,cAAM;AAAA,MAER,OAAO;AACL,mBAAW,OAAO,yBAAyB;AAAA,MAC7C;AAEA,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,OAAO,EAAE,GAAG;AACrB,qBAAe,OAAO,cAAc,YAAY,IAAI;AACpD,uBAAiB,OAAO,oBAAoB,OAAO,OAAO,UAAU,CAAC;AACrE,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAC7E,iBAAW,OAAO,8DAA8D;AAAA,IAElF,OAAO;AACL,YAAM;AACN,mBAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAEA,aAAW,OAAO,4DAA4D;AAChF;AAEA,SAAS,mBAAmB,OAAO,YAAY;AAC7C,MAAI,WAAW,MACX,OACA,YACA,MACA,OAAW,MAAM,KACjB,SACA,UAAW,MAAM,QACjB,WACA,YACA,QACA,gBACA,WACA,kBAAkB,uBAAO,OAAO,IAAI,GACpC,SACA,QACA,WACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,iBAAa;AACb,gBAAY;AACZ,cAAU,CAAC;AAAA,EACb,WAAW,OAAO,KAAa;AAC7B,iBAAa;AACb,gBAAY;AACZ,cAAU,CAAC;AAAA,EACb,OAAO;AACL,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,SAAO,OAAO,GAAG;AACf,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,OAAO,YAAY;AACrB,YAAM;AACN,YAAM,MAAM;AACZ,YAAM,SAAS;AACf,YAAM,OAAO,YAAY,YAAY;AACrC,YAAM,SAAS;AACf,aAAO;AAAA,IACT,WAAW,CAAC,UAAU;AACpB,iBAAW,OAAO,8CAA8C;AAAA,IAClE,WAAW,OAAO,IAAa;AAE7B,iBAAW,OAAO,0CAA0C;AAAA,IAC9D;AAEA,aAAS,UAAU,YAAY;AAC/B,aAAS,iBAAiB;AAE1B,QAAI,OAAO,IAAa;AACtB,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,GAAG;AAC3B,iBAAS,iBAAiB;AAC1B,cAAM;AACN,4BAAoB,OAAO,MAAM,UAAU;AAAA,MAC7C;AAAA,IACF;AAEA,YAAQ,MAAM;AACd,iBAAa,MAAM;AACnB,WAAO,MAAM;AACb,gBAAY,OAAO,YAAY,iBAAiB,OAAO,IAAI;AAC3D,aAAS,MAAM;AACf,cAAU,MAAM;AAChB,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAK,kBAAkB,MAAM,SAAS,UAAU,OAAO,IAAa;AAClE,eAAS;AACT,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,0BAAoB,OAAO,MAAM,UAAU;AAC3C,kBAAY,OAAO,YAAY,iBAAiB,OAAO,IAAI;AAC3D,kBAAY,MAAM;AAAA,IACpB;AAEA,QAAI,WAAW;AACb,uBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAAW,OAAO,YAAY,IAAI;AAAA,IACvG,WAAW,QAAQ;AACjB,cAAQ,KAAK,iBAAiB,OAAO,MAAM,iBAAiB,QAAQ,SAAS,WAAW,OAAO,YAAY,IAAI,CAAC;AAAA,IAClH,OAAO;AACL,cAAQ,KAAK,OAAO;AAAA,IACtB;AAEA,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,OAAO,IAAa;AACtB,iBAAW;AACX,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,aAAW,OAAO,uDAAuD;AAC3E;AAEA,SAAS,gBAAgB,OAAO,YAAY;AAC1C,MAAI,cACA,SACA,WAAiB,eACjB,iBAAiB,OACjB,iBAAiB,OACjB,aAAiB,YACjB,aAAiB,GACjB,iBAAiB,OACjB,KACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,KAAa;AACtB,cAAU;AAAA,EACZ,WAAW,OAAO,IAAa;AAC7B,cAAU;AAAA,EACZ,OAAO;AACL,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AAEf,SAAO,OAAO,GAAG;AACf,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,QAAI,OAAO,MAAe,OAAO,IAAa;AAC5C,UAAI,kBAAkB,UAAU;AAC9B,mBAAY,OAAO,KAAe,gBAAgB;AAAA,MACpD,OAAO;AACL,mBAAW,OAAO,sCAAsC;AAAA,MAC1D;AAAA,IAEF,YAAY,MAAM,gBAAgB,EAAE,MAAM,GAAG;AAC3C,UAAI,QAAQ,GAAG;AACb,mBAAW,OAAO,8EAA8E;AAAA,MAClG,WAAW,CAAC,gBAAgB;AAC1B,qBAAa,aAAa,MAAM;AAChC,yBAAiB;AAAA,MACnB,OAAO;AACL,mBAAW,OAAO,2CAA2C;AAAA,MAC/D;AAAA,IAEF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,MAAI,eAAe,EAAE,GAAG;AACtB,OAAG;AAAE,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAAG,SAC7C,eAAe,EAAE;AAExB,QAAI,OAAO,IAAa;AACtB,SAAG;AAAE,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAAG,SAC7C,CAAC,OAAO,EAAE,KAAM,OAAO;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,OAAO,GAAG;AACf,kBAAc,KAAK;AACnB,UAAM,aAAa;AAEnB,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,YAAQ,CAAC,kBAAkB,MAAM,aAAa,eACtC,OAAO,IAAkB;AAC/B,YAAM;AACN,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,QAAI,CAAC,kBAAkB,MAAM,aAAa,YAAY;AACpD,mBAAa,MAAM;AAAA,IACrB;AAEA,QAAI,OAAO,EAAE,GAAG;AACd;AACA;AAAA,IACF;AAGA,QAAI,MAAM,aAAa,YAAY;AAGjC,UAAI,aAAa,eAAe;AAC9B,cAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,MAClF,WAAW,aAAa,eAAe;AACrC,YAAI,gBAAgB;AAClB,gBAAM,UAAU;AAAA,QAClB;AAAA,MACF;AAGA;AAAA,IACF;AAGA,QAAI,SAAS;AAGX,UAAI,eAAe,EAAE,GAAG;AACtB,yBAAiB;AAEjB,cAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,MAGlF,WAAW,gBAAgB;AACzB,yBAAiB;AACjB,cAAM,UAAU,OAAO,OAAO,MAAM,aAAa,CAAC;AAAA,MAGpD,WAAW,eAAe,GAAG;AAC3B,YAAI,gBAAgB;AAClB,gBAAM,UAAU;AAAA,QAClB;AAAA,MAGF,OAAO;AACL,cAAM,UAAU,OAAO,OAAO,MAAM,UAAU;AAAA,MAChD;AAAA,IAGF,OAAO;AAEL,YAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,IAClF;AAEA,qBAAiB;AACjB,qBAAiB;AACjB,iBAAa;AACb,mBAAe,MAAM;AAErB,WAAO,CAAC,OAAO,EAAE,KAAM,OAAO,GAAI;AAChC,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,mBAAe,OAAO,cAAc,MAAM,UAAU,KAAK;AAAA,EAC3D;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAO,YAAY;AAC5C,MAAI,OACA,OAAY,MAAM,KAClB,UAAY,MAAM,QAClB,UAAY,CAAC,GACb,WACA,WAAY,OACZ;AAIJ,MAAI,MAAM,mBAAmB,GAAI,QAAO;AAExC,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAO,OAAO,GAAG;AACf,QAAI,MAAM,mBAAmB,IAAI;AAC/B,YAAM,WAAW,MAAM;AACvB,iBAAW,OAAO,gDAAgD;AAAA,IACpE;AAEA,QAAI,OAAO,IAAa;AACtB;AAAA,IACF;AAEA,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,QAAI,CAAC,aAAa,SAAS,GAAG;AAC5B;AAAA,IACF;AAEA,eAAW;AACX,UAAM;AAEN,QAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,UAAI,MAAM,cAAc,YAAY;AAClC,gBAAQ,KAAK,IAAI;AACjB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,MAAM;AACd,gBAAY,OAAO,YAAY,kBAAkB,OAAO,IAAI;AAC5D,YAAQ,KAAK,MAAM,MAAM;AACzB,wBAAoB,OAAO,MAAM,EAAE;AAEnC,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAK,MAAM,SAAS,SAAS,MAAM,aAAa,eAAgB,OAAO,GAAI;AACzE,iBAAW,OAAO,qCAAqC;AAAA,IACzD,WAAW,MAAM,aAAa,YAAY;AACxC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,UAAU;AACZ,UAAM,MAAM;AACZ,UAAM,SAAS;AACf,UAAM,OAAO;AACb,UAAM,SAAS;AACf,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,YAAY,YAAY;AACvD,MAAI,WACA,cACA,OACA,UACA,eACA,SACA,OAAgB,MAAM,KACtB,UAAgB,MAAM,QACtB,UAAgB,CAAC,GACjB,kBAAkB,uBAAO,OAAO,IAAI,GACpC,SAAgB,MAChB,UAAgB,MAChB,YAAgB,MAChB,gBAAgB,OAChB,WAAgB,OAChB;AAIJ,MAAI,MAAM,mBAAmB,GAAI,QAAO;AAExC,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAO,OAAO,GAAG;AACf,QAAI,CAAC,iBAAiB,MAAM,mBAAmB,IAAI;AACjD,YAAM,WAAW,MAAM;AACvB,iBAAW,OAAO,gDAAgD;AAAA,IACpE;AAEA,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AACrD,YAAQ,MAAM;AAMd,SAAK,OAAO,MAAe,OAAO,OAAgB,aAAa,SAAS,GAAG;AAEzE,UAAI,OAAO,IAAa;AACtB,YAAI,eAAe;AACjB,2BAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AACzG,mBAAS,UAAU,YAAY;AAAA,QACjC;AAEA,mBAAW;AACX,wBAAgB;AAChB,uBAAe;AAAA,MAEjB,WAAW,eAAe;AAExB,wBAAgB;AAChB,uBAAe;AAAA,MAEjB,OAAO;AACL,mBAAW,OAAO,mGAAmG;AAAA,MACvH;AAEA,YAAM,YAAY;AAClB,WAAK;AAAA,IAKP,OAAO;AACL,iBAAW,MAAM;AACjB,sBAAgB,MAAM;AACtB,gBAAU,MAAM;AAEhB,UAAI,CAAC,YAAY,OAAO,YAAY,kBAAkB,OAAO,IAAI,GAAG;AAGlE;AAAA,MACF;AAEA,UAAI,MAAM,SAAS,OAAO;AACxB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,eAAO,eAAe,EAAE,GAAG;AACzB,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,QAC9C;AAEA,YAAI,OAAO,IAAa;AACtB,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,cAAI,CAAC,aAAa,EAAE,GAAG;AACrB,uBAAW,OAAO,yFAAyF;AAAA,UAC7G;AAEA,cAAI,eAAe;AACjB,6BAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AACzG,qBAAS,UAAU,YAAY;AAAA,UACjC;AAEA,qBAAW;AACX,0BAAgB;AAChB,yBAAe;AACf,mBAAS,MAAM;AACf,oBAAU,MAAM;AAAA,QAElB,WAAW,UAAU;AACnB,qBAAW,OAAO,0DAA0D;AAAA,QAE9E,OAAO;AACL,gBAAM,MAAM;AACZ,gBAAM,SAAS;AACf,iBAAO;AAAA,QACT;AAAA,MAEF,WAAW,UAAU;AACnB,mBAAW,OAAO,gFAAgF;AAAA,MAEpG,OAAO;AACL,cAAM,MAAM;AACZ,cAAM,SAAS;AACf,eAAO;AAAA,MACT;AAAA,IACF;AAKA,QAAI,MAAM,SAAS,SAAS,MAAM,aAAa,YAAY;AACzD,UAAI,eAAe;AACjB,mBAAW,MAAM;AACjB,wBAAgB,MAAM;AACtB,kBAAU,MAAM;AAAA,MAClB;AAEA,UAAI,YAAY,OAAO,YAAY,mBAAmB,MAAM,YAAY,GAAG;AACzE,YAAI,eAAe;AACjB,oBAAU,MAAM;AAAA,QAClB,OAAO;AACL,sBAAY,MAAM;AAAA,QACpB;AAAA,MACF;AAEA,UAAI,CAAC,eAAe;AAClB,yBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAAW,UAAU,eAAe,OAAO;AAC9G,iBAAS,UAAU,YAAY;AAAA,MACjC;AAEA,0BAAoB,OAAO,MAAM,EAAE;AACnC,WAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAAA,IAC5C;AAEA,SAAK,MAAM,SAAS,SAAS,MAAM,aAAa,eAAgB,OAAO,GAAI;AACzE,iBAAW,OAAO,oCAAoC;AAAA,IACxD,WAAW,MAAM,aAAa,YAAY;AACxC;AAAA,IACF;AAAA,EACF;AAOA,MAAI,eAAe;AACjB,qBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AAAA,EAC3G;AAGA,MAAI,UAAU;AACZ,UAAM,MAAM;AACZ,UAAM,SAAS;AACf,UAAM,OAAO;AACb,UAAM,SAAS;AAAA,EACjB;AAEA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAO;AAC9B,MAAI,WACA,aAAa,OACb,UAAa,OACb,WACA,SACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,MAAI,MAAM,QAAQ,MAAM;AACtB,eAAW,OAAO,+BAA+B;AAAA,EACnD;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,MAAI,OAAO,IAAa;AACtB,iBAAa;AACb,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAE9C,WAAW,OAAO,IAAa;AAC7B,cAAU;AACV,gBAAY;AACZ,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAE9C,OAAO;AACL,gBAAY;AAAA,EACd;AAEA,cAAY,MAAM;AAElB,MAAI,YAAY;AACd,OAAG;AAAE,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAAG,SAC7C,OAAO,KAAK,OAAO;AAE1B,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,gBAAU,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AACrD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C,OAAO;AACL,iBAAW,OAAO,oDAAoD;AAAA,IACxE;AAAA,EACF,OAAO;AACL,WAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AAEpC,UAAI,OAAO,IAAa;AACtB,YAAI,CAAC,SAAS;AACZ,sBAAY,MAAM,MAAM,MAAM,YAAY,GAAG,MAAM,WAAW,CAAC;AAE/D,cAAI,CAAC,mBAAmB,KAAK,SAAS,GAAG;AACvC,uBAAW,OAAO,iDAAiD;AAAA,UACrE;AAEA,oBAAU;AACV,sBAAY,MAAM,WAAW;AAAA,QAC/B,OAAO;AACL,qBAAW,OAAO,6CAA6C;AAAA,QACjE;AAAA,MACF;AAEA,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,cAAU,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAErD,QAAI,wBAAwB,KAAK,OAAO,GAAG;AACzC,iBAAW,OAAO,qDAAqD;AAAA,IACzE;AAAA,EACF;AAEA,MAAI,WAAW,CAAC,gBAAgB,KAAK,OAAO,GAAG;AAC7C,eAAW,OAAO,8CAA8C,OAAO;AAAA,EACzE;AAEA,MAAI;AACF,cAAU,mBAAmB,OAAO;AAAA,EACtC,SAAS,KAAK;AACZ,eAAW,OAAO,4BAA4B,OAAO;AAAA,EACvD;AAEA,MAAI,YAAY;AACd,UAAM,MAAM;AAAA,EAEd,WAAW,kBAAkB,KAAK,MAAM,QAAQ,SAAS,GAAG;AAC1D,UAAM,MAAM,MAAM,OAAO,SAAS,IAAI;AAAA,EAExC,WAAW,cAAc,KAAK;AAC5B,UAAM,MAAM,MAAM;AAAA,EAEpB,WAAW,cAAc,MAAM;AAC7B,UAAM,MAAM,uBAAuB;AAAA,EAErC,OAAO;AACL,eAAW,OAAO,4BAA4B,YAAY,GAAG;AAAA,EAC/D;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,OAAO;AACjC,MAAI,WACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,MAAI,MAAM,WAAW,MAAM;AACzB,eAAW,OAAO,mCAAmC;AAAA,EACvD;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,cAAY,MAAM;AAElB,SAAO,OAAO,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG;AAC9D,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,MAAI,MAAM,aAAa,WAAW;AAChC,eAAW,OAAO,4DAA4D;AAAA,EAChF;AAEA,QAAM,SAAS,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1D,SAAO;AACT;AAEA,SAAS,UAAU,OAAO;AACxB,MAAI,WAAW,OACX;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,cAAY,MAAM;AAElB,SAAO,OAAO,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG;AAC9D,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,MAAI,MAAM,aAAa,WAAW;AAChC,eAAW,OAAO,2DAA2D;AAAA,EAC/E;AAEA,UAAQ,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAEnD,MAAI,CAAC,kBAAkB,KAAK,MAAM,WAAW,KAAK,GAAG;AACnD,eAAW,OAAO,yBAAyB,QAAQ,GAAG;AAAA,EACxD;AAEA,QAAM,SAAS,MAAM,UAAU,KAAK;AACpC,sBAAoB,OAAO,MAAM,EAAE;AACnC,SAAO;AACT;AAEA,SAAS,YAAY,OAAO,cAAc,aAAa,aAAa,cAAc;AAChF,MAAI,kBACA,mBACA,uBACA,eAAe,GACf,YAAa,OACb,aAAa,OACb,WACA,cACA,UACAG,OACA,YACA;AAEJ,MAAI,MAAM,aAAa,MAAM;AAC3B,UAAM,SAAS,QAAQ,KAAK;AAAA,EAC9B;AAEA,QAAM,MAAS;AACf,QAAM,SAAS;AACf,QAAM,OAAS;AACf,QAAM,SAAS;AAEf,qBAAmB,oBAAoB,wBACrC,sBAAsB,eACtB,qBAAsB;AAExB,MAAI,aAAa;AACf,QAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,kBAAY;AAEZ,UAAI,MAAM,aAAa,cAAc;AACnC,uBAAe;AAAA,MACjB,WAAW,MAAM,eAAe,cAAc;AAC5C,uBAAe;AAAA,MACjB,WAAW,MAAM,aAAa,cAAc;AAC1C,uBAAe;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,iBAAiB,GAAG;AACtB,WAAO,gBAAgB,KAAK,KAAK,mBAAmB,KAAK,GAAG;AAC1D,UAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,oBAAY;AACZ,gCAAwB;AAExB,YAAI,MAAM,aAAa,cAAc;AACnC,yBAAe;AAAA,QACjB,WAAW,MAAM,eAAe,cAAc;AAC5C,yBAAe;AAAA,QACjB,WAAW,MAAM,aAAa,cAAc;AAC1C,yBAAe;AAAA,QACjB;AAAA,MACF,OAAO;AACL,gCAAwB;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,MAAI,uBAAuB;AACzB,4BAAwB,aAAa;AAAA,EACvC;AAEA,MAAI,iBAAiB,KAAK,sBAAsB,aAAa;AAC3D,QAAI,oBAAoB,eAAe,qBAAqB,aAAa;AACvE,mBAAa;AAAA,IACf,OAAO;AACL,mBAAa,eAAe;AAAA,IAC9B;AAEA,kBAAc,MAAM,WAAW,MAAM;AAErC,QAAI,iBAAiB,GAAG;AACtB,UAAI,0BACC,kBAAkB,OAAO,WAAW,KACpC,iBAAiB,OAAO,aAAa,UAAU,MAChD,mBAAmB,OAAO,UAAU,GAAG;AACzC,qBAAa;AAAA,MACf,OAAO;AACL,YAAK,qBAAqB,gBAAgB,OAAO,UAAU,KACvD,uBAAuB,OAAO,UAAU,KACxC,uBAAuB,OAAO,UAAU,GAAG;AAC7C,uBAAa;AAAA,QAEf,WAAW,UAAU,KAAK,GAAG;AAC3B,uBAAa;AAEb,cAAI,MAAM,QAAQ,QAAQ,MAAM,WAAW,MAAM;AAC/C,uBAAW,OAAO,2CAA2C;AAAA,UAC/D;AAAA,QAEF,WAAW,gBAAgB,OAAO,YAAY,oBAAoB,WAAW,GAAG;AAC9E,uBAAa;AAEb,cAAI,MAAM,QAAQ,MAAM;AACtB,kBAAM,MAAM;AAAA,UACd;AAAA,QACF;AAEA,YAAI,MAAM,WAAW,MAAM;AACzB,gBAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,QACxC;AAAA,MACF;AAAA,IACF,WAAW,iBAAiB,GAAG;AAG7B,mBAAa,yBAAyB,kBAAkB,OAAO,WAAW;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,MAAM,QAAQ,MAAM;AACtB,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,IACxC;AAAA,EAEF,WAAW,MAAM,QAAQ,KAAK;AAO5B,QAAI,MAAM,WAAW,QAAQ,MAAM,SAAS,UAAU;AACpD,iBAAW,OAAO,sEAAsE,MAAM,OAAO,GAAG;AAAA,IAC1G;AAEA,SAAK,YAAY,GAAG,eAAe,MAAM,cAAc,QAAQ,YAAY,cAAc,aAAa,GAAG;AACvG,MAAAA,QAAO,MAAM,cAAc,SAAS;AAEpC,UAAIA,MAAK,QAAQ,MAAM,MAAM,GAAG;AAC9B,cAAM,SAASA,MAAK,UAAU,MAAM,MAAM;AAC1C,cAAM,MAAMA,MAAK;AACjB,YAAI,MAAM,WAAW,MAAM;AACzB,gBAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,QACxC;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,WAAW,MAAM,QAAQ,KAAK;AAC5B,QAAI,kBAAkB,KAAK,MAAM,QAAQ,MAAM,QAAQ,UAAU,GAAG,MAAM,GAAG,GAAG;AAC9E,MAAAA,QAAO,MAAM,QAAQ,MAAM,QAAQ,UAAU,EAAE,MAAM,GAAG;AAAA,IAC1D,OAAO;AAEL,MAAAA,QAAO;AACP,iBAAW,MAAM,QAAQ,MAAM,MAAM,QAAQ,UAAU;AAEvD,WAAK,YAAY,GAAG,eAAe,SAAS,QAAQ,YAAY,cAAc,aAAa,GAAG;AAC5F,YAAI,MAAM,IAAI,MAAM,GAAG,SAAS,SAAS,EAAE,IAAI,MAAM,MAAM,SAAS,SAAS,EAAE,KAAK;AAClF,UAAAA,QAAO,SAAS,SAAS;AACzB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAACA,OAAM;AACT,iBAAW,OAAO,mBAAmB,MAAM,MAAM,GAAG;AAAA,IACtD;AAEA,QAAI,MAAM,WAAW,QAAQA,MAAK,SAAS,MAAM,MAAM;AACrD,iBAAW,OAAO,kCAAkC,MAAM,MAAM,0BAA0BA,MAAK,OAAO,aAAa,MAAM,OAAO,GAAG;AAAA,IACrI;AAEA,QAAI,CAACA,MAAK,QAAQ,MAAM,QAAQ,MAAM,GAAG,GAAG;AAC1C,iBAAW,OAAO,kCAAkC,MAAM,MAAM,gBAAgB;AAAA,IAClF,OAAO;AACL,YAAM,SAASA,MAAK,UAAU,MAAM,QAAQ,MAAM,GAAG;AACrD,UAAI,MAAM,WAAW,MAAM;AACzB,cAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,aAAa,MAAM;AAC3B,UAAM,SAAS,SAAS,KAAK;AAAA,EAC/B;AACA,SAAO,MAAM,QAAQ,QAAS,MAAM,WAAW,QAAQ;AACzD;AAEA,SAAS,aAAa,OAAO;AAC3B,MAAI,gBAAgB,MAAM,UACtB,WACA,eACA,eACA,gBAAgB,OAChB;AAEJ,QAAM,UAAU;AAChB,QAAM,kBAAkB,MAAM;AAC9B,QAAM,SAAS,uBAAO,OAAO,IAAI;AACjC,QAAM,YAAY,uBAAO,OAAO,IAAI;AAEpC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,wBAAoB,OAAO,MAAM,EAAE;AAEnC,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,MAAM,aAAa,KAAK,OAAO,IAAa;AAC9C;AAAA,IACF;AAEA,oBAAgB;AAChB,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,gBAAY,MAAM;AAElB,WAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AACpC,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,oBAAgB,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC3D,oBAAgB,CAAC;AAEjB,QAAI,cAAc,SAAS,GAAG;AAC5B,iBAAW,OAAO,8DAA8D;AAAA,IAClF;AAEA,WAAO,OAAO,GAAG;AACf,aAAO,eAAe,EAAE,GAAG;AACzB,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAEA,UAAI,OAAO,IAAa;AACtB,WAAG;AAAE,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,QAAG,SAC7C,OAAO,KAAK,CAAC,OAAO,EAAE;AAC7B;AAAA,MACF;AAEA,UAAI,OAAO,EAAE,EAAG;AAEhB,kBAAY,MAAM;AAElB,aAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AACpC,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAEA,oBAAc,KAAK,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ,CAAC;AAAA,IACjE;AAEA,QAAI,OAAO,EAAG,eAAc,KAAK;AAEjC,QAAI,kBAAkB,KAAK,mBAAmB,aAAa,GAAG;AAC5D,wBAAkB,aAAa,EAAE,OAAO,eAAe,aAAa;AAAA,IACtE,OAAO;AACL,mBAAa,OAAO,iCAAiC,gBAAgB,GAAG;AAAA,IAC1E;AAAA,EACF;AAEA,sBAAoB,OAAO,MAAM,EAAE;AAEnC,MAAI,MAAM,eAAe,KACrB,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAU,MAC/C,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC,MAAM,MAC/C,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC,MAAM,IAAa;AAC9D,UAAM,YAAY;AAClB,wBAAoB,OAAO,MAAM,EAAE;AAAA,EAErC,WAAW,eAAe;AACxB,eAAW,OAAO,iCAAiC;AAAA,EACrD;AAEA,cAAY,OAAO,MAAM,aAAa,GAAG,mBAAmB,OAAO,IAAI;AACvE,sBAAoB,OAAO,MAAM,EAAE;AAEnC,MAAI,MAAM,mBACN,8BAA8B,KAAK,MAAM,MAAM,MAAM,eAAe,MAAM,QAAQ,CAAC,GAAG;AACxF,iBAAa,OAAO,kDAAkD;AAAA,EACxE;AAEA,QAAM,UAAU,KAAK,MAAM,MAAM;AAEjC,MAAI,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAEtE,QAAI,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAa;AAC1D,YAAM,YAAY;AAClB,0BAAoB,OAAO,MAAM,EAAE;AAAA,IACrC;AACA;AAAA,EACF;AAEA,MAAI,MAAM,WAAY,MAAM,SAAS,GAAI;AACvC,eAAW,OAAO,uDAAuD;AAAA,EAC3E,OAAO;AACL;AAAA,EACF;AACF;AAGA,SAAS,cAAc,OAAO,SAAS;AACrC,UAAQ,OAAO,KAAK;AACpB,YAAU,WAAW,CAAC;AAEtB,MAAI,MAAM,WAAW,GAAG;AAGtB,QAAI,MAAM,WAAW,MAAM,SAAS,CAAC,MAAM,MACvC,MAAM,WAAW,MAAM,SAAS,CAAC,MAAM,IAAc;AACvD,eAAS;AAAA,IACX;AAGA,QAAI,MAAM,WAAW,CAAC,MAAM,OAAQ;AAClC,cAAQ,MAAM,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,QAAQ,IAAI,QAAQ,OAAO,OAAO;AAEtC,MAAI,UAAU,MAAM,QAAQ,IAAI;AAEhC,MAAI,YAAY,IAAI;AAClB,UAAM,WAAW;AACjB,eAAW,OAAO,mCAAmC;AAAA,EACvD;AAGA,QAAM,SAAS;AAEf,SAAO,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAiB;AACjE,UAAM,cAAc;AACpB,UAAM,YAAY;AAAA,EACpB;AAEA,SAAO,MAAM,WAAY,MAAM,SAAS,GAAI;AAC1C,iBAAa,KAAK;AAAA,EACpB;AAEA,SAAO,MAAM;AACf;AAGA,SAAS,UAAU,OAAO,UAAU,SAAS;AAC3C,MAAI,aAAa,QAAQ,OAAO,aAAa,YAAY,OAAO,YAAY,aAAa;AACvF,cAAU;AACV,eAAW;AAAA,EACb;AAEA,MAAI,YAAY,cAAc,OAAO,OAAO;AAE5C,MAAI,OAAO,aAAa,YAAY;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,GAAG,SAAS,UAAU,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,aAAS,UAAU,KAAK,CAAC;AAAA,EAC3B;AACF;AAGA,SAAS,OAAO,OAAO,SAAS;AAC9B,MAAI,YAAY,cAAc,OAAO,OAAO;AAE5C,MAAI,UAAU,WAAW,GAAG;AAE1B,WAAO;AAAA,EACT,WAAW,UAAU,WAAW,GAAG;AACjC,WAAO,UAAU,CAAC;AAAA,EACpB;AACA,QAAM,IAAI,UAAU,0DAA0D;AAChF;AAGA,IAAI,YAAY;AAChB,IAAI,SAAY;AAEhB,IAAI,SAAS;AAAA,EACZ,SAAS;AAAA,EACT,MAAM;AACP;AAQA,IAAI,YAAkB,OAAO,UAAU;AACvC,IAAI,kBAAkB,OAAO,UAAU;AAEvC,IAAI,WAA4B;AAChC,IAAI,WAA4B;AAChC,IAAI,iBAA4B;AAChC,IAAI,uBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,mBAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,eAA4B;AAChC,IAAI,iBAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,gBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,cAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,gBAA4B;AAChC,IAAI,qBAA4B;AAChC,IAAI,2BAA4B;AAChC,IAAI,4BAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,0BAA4B;AAChC,IAAI,qBAA4B;AAChC,IAAI,2BAA4B;AAEhC,IAAI,mBAAmB,CAAC;AAExB,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,GAAI,IAAM;AAC3B,iBAAiB,GAAI,IAAM;AAC3B,iBAAiB,IAAM,IAAI;AAC3B,iBAAiB,IAAM,IAAI;AAE3B,IAAI,6BAA6B;AAAA,EAC/B;AAAA,EAAK;AAAA,EAAK;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAC3C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAC5C;AAEA,IAAI,2BAA2B;AAE/B,SAAS,gBAAgBD,SAAQD,MAAK;AACpC,MAAI,QAAQ,MAAM,OAAO,QAAQ,KAAK,OAAOE;AAE7C,MAAIF,SAAQ,KAAM,QAAO,CAAC;AAE1B,WAAS,CAAC;AACV,SAAO,OAAO,KAAKA,IAAG;AAEtB,OAAK,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAChE,UAAM,KAAK,KAAK;AAChB,YAAQ,OAAOA,KAAI,GAAG,CAAC;AAEvB,QAAI,IAAI,MAAM,GAAG,CAAC,MAAM,MAAM;AAC5B,YAAM,uBAAuB,IAAI,MAAM,CAAC;AAAA,IAC1C;AACA,IAAAE,QAAOD,QAAO,gBAAgB,UAAU,EAAE,GAAG;AAE7C,QAAIC,SAAQ,gBAAgB,KAAKA,MAAK,cAAc,KAAK,GAAG;AAC1D,cAAQA,MAAK,aAAa,KAAK;AAAA,IACjC;AAEA,WAAO,GAAG,IAAI;AAAA,EAChB;AAEA,SAAO;AACT;AAEA,SAAS,UAAU,WAAW;AAC5B,MAAI,QAAQ,QAAQ;AAEpB,WAAS,UAAU,SAAS,EAAE,EAAE,YAAY;AAE5C,MAAI,aAAa,KAAM;AACrB,aAAS;AACT,aAAS;AAAA,EACX,WAAW,aAAa,OAAQ;AAC9B,aAAS;AACT,aAAS;AAAA,EACX,WAAW,aAAa,YAAY;AAClC,aAAS;AACT,aAAS;AAAA,EACX,OAAO;AACL,UAAM,IAAI,UAAU,+DAA+D;AAAA,EACrF;AAEA,SAAO,OAAO,SAAS,OAAO,OAAO,KAAK,SAAS,OAAO,MAAM,IAAI;AACtE;AAGA,IAAI,sBAAsB;AAA1B,IACI,sBAAsB;AAE1B,SAAS,MAAM,SAAS;AACtB,OAAK,SAAgB,QAAQ,QAAQ,KAAK;AAC1C,OAAK,SAAgB,KAAK,IAAI,GAAI,QAAQ,QAAQ,KAAK,CAAE;AACzD,OAAK,gBAAgB,QAAQ,eAAe,KAAK;AACjD,OAAK,cAAgB,QAAQ,aAAa,KAAK;AAC/C,OAAK,YAAiB,OAAO,UAAU,QAAQ,WAAW,CAAC,IAAI,KAAK,QAAQ,WAAW;AACvF,OAAK,WAAgB,gBAAgB,KAAK,QAAQ,QAAQ,QAAQ,KAAK,IAAI;AAC3E,OAAK,WAAgB,QAAQ,UAAU,KAAK;AAC5C,OAAK,YAAgB,QAAQ,WAAW,KAAK;AAC7C,OAAK,SAAgB,QAAQ,QAAQ,KAAK;AAC1C,OAAK,eAAgB,QAAQ,cAAc,KAAK;AAChD,OAAK,eAAgB,QAAQ,cAAc,KAAK;AAChD,OAAK,cAAgB,QAAQ,aAAa,MAAM,MAAM,sBAAsB;AAC5E,OAAK,cAAgB,QAAQ,aAAa,KAAK;AAC/C,OAAK,WAAgB,OAAO,QAAQ,UAAU,MAAM,aAAa,QAAQ,UAAU,IAAI;AAEvF,OAAK,gBAAgB,KAAK,OAAO;AACjC,OAAK,gBAAgB,KAAK,OAAO;AAEjC,OAAK,MAAM;AACX,OAAK,SAAS;AAEd,OAAK,aAAa,CAAC;AACnB,OAAK,iBAAiB;AACxB;AAGA,SAAS,aAAa,QAAQ,QAAQ;AACpC,MAAI,MAAM,OAAO,OAAO,KAAK,MAAM,GAC/B,WAAW,GACX,OAAO,IACP,SAAS,IACT,MACA,SAAS,OAAO;AAEpB,SAAO,WAAW,QAAQ;AACxB,WAAO,OAAO,QAAQ,MAAM,QAAQ;AACpC,QAAI,SAAS,IAAI;AACf,aAAO,OAAO,MAAM,QAAQ;AAC5B,iBAAW;AAAA,IACb,OAAO;AACL,aAAO,OAAO,MAAM,UAAU,OAAO,CAAC;AACtC,iBAAW,OAAO;AAAA,IACpB;AAEA,QAAI,KAAK,UAAU,SAAS,KAAM,WAAU;AAE5C,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,OAAO;AACtC,SAAO,OAAO,OAAO,OAAO,KAAK,MAAM,SAAS,KAAK;AACvD;AAEA,SAAS,sBAAsB,OAAOE,MAAK;AACzC,MAAI,OAAO,QAAQF;AAEnB,OAAK,QAAQ,GAAG,SAAS,MAAM,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAC/E,IAAAA,QAAO,MAAM,cAAc,KAAK;AAEhC,QAAIA,MAAK,QAAQE,IAAG,GAAG;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,aAAa,GAAG;AACvB,SAAO,MAAM,cAAc,MAAM;AACnC;AAMA,SAAS,YAAY,GAAG;AACtB,SAAS,MAAW,KAAK,KAAK,OACrB,OAAW,KAAK,KAAK,SAAa,MAAM,QAAU,MAAM,QACxD,SAAW,KAAK,KAAK,SAAa,MAAM,YACxC,SAAW,KAAK,KAAK;AAChC;AAOA,SAAS,qBAAqB,GAAG;AAC/B,SAAO,YAAY,CAAC,KACf,MAAM,YAEN,MAAM,wBACN,MAAM;AACb;AAWA,SAAS,YAAY,GAAG,MAAM,SAAS;AACrC,MAAI,wBAAwB,qBAAqB,CAAC;AAClD,MAAI,YAAY,yBAAyB,CAAC,aAAa,CAAC;AACxD;AAAA;AAAA,KAEE;AAAA;AAAA,MACE;AAAA,QACE,yBAEG,MAAM,cACN,MAAM,4BACN,MAAM,6BACN,MAAM,2BACN,MAAM,6BAGV,MAAM,cACN,EAAE,SAAS,cAAc,CAAC,cACzB,qBAAqB,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,MAAM,cAC3D,SAAS,cAAc;AAAA;AAC/B;AAGA,SAAS,iBAAiB,GAAG;AAI3B,SAAO,YAAY,CAAC,KAAK,MAAM,YAC1B,CAAC,aAAa,CAAC,KAGf,MAAM,cACN,MAAM,iBACN,MAAM,cACN,MAAM,cACN,MAAM,4BACN,MAAM,6BACN,MAAM,2BACN,MAAM,4BAEN,MAAM,cACN,MAAM,kBACN,MAAM,iBACN,MAAM,oBACN,MAAM,sBACN,MAAM,eACN,MAAM,qBACN,MAAM,qBACN,MAAM,qBAEN,MAAM,gBACN,MAAM,sBACN,MAAM;AACb;AAGA,SAAS,gBAAgB,GAAG;AAE1B,SAAO,CAAC,aAAa,CAAC,KAAK,MAAM;AACnC;AAGA,SAAS,YAAY,QAAQ,KAAK;AAChC,MAAI,QAAQ,OAAO,WAAW,GAAG,GAAG;AACpC,MAAI,SAAS,SAAU,SAAS,SAAU,MAAM,IAAI,OAAO,QAAQ;AACjE,aAAS,OAAO,WAAW,MAAM,CAAC;AAClC,QAAI,UAAU,SAAU,UAAU,OAAQ;AAExC,cAAQ,QAAQ,SAAU,OAAQ,SAAS,QAAS;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,oBAAoB,QAAQ;AACnC,MAAI,iBAAiB;AACrB,SAAO,eAAe,KAAK,MAAM;AACnC;AAEA,IAAI,cAAgB;AAApB,IACI,eAAgB;AADpB,IAEI,gBAAgB;AAFpB,IAGI,eAAgB;AAHpB,IAII,eAAgB;AASpB,SAAS,kBAAkB,QAAQ,gBAAgB,gBAAgB,WACjE,mBAAmB,aAAa,aAAa,SAAS;AAEtD,MAAI;AACJ,MAAI,OAAO;AACX,MAAI,WAAW;AACf,MAAI,eAAe;AACnB,MAAI,kBAAkB;AACtB,MAAI,mBAAmB,cAAc;AACrC,MAAI,oBAAoB;AACxB,MAAI,QAAQ,iBAAiB,YAAY,QAAQ,CAAC,CAAC,KACxC,gBAAgB,YAAY,QAAQ,OAAO,SAAS,CAAC,CAAC;AAEjE,MAAI,kBAAkB,aAAa;AAGjC,SAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AAC7D,aAAO,YAAY,QAAQ,CAAC;AAC5B,UAAI,CAAC,YAAY,IAAI,GAAG;AACtB,eAAO;AAAA,MACT;AACA,cAAQ,SAAS,YAAY,MAAM,UAAU,OAAO;AACpD,iBAAW;AAAA,IACb;AAAA,EACF,OAAO;AAEL,SAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AAC7D,aAAO,YAAY,QAAQ,CAAC;AAC5B,UAAI,SAAS,gBAAgB;AAC3B,uBAAe;AAEf,YAAI,kBAAkB;AACpB,4BAAkB;AAAA,UAEf,IAAI,oBAAoB,IAAI,aAC5B,OAAO,oBAAoB,CAAC,MAAM;AACrC,8BAAoB;AAAA,QACtB;AAAA,MACF,WAAW,CAAC,YAAY,IAAI,GAAG;AAC7B,eAAO;AAAA,MACT;AACA,cAAQ,SAAS,YAAY,MAAM,UAAU,OAAO;AACpD,iBAAW;AAAA,IACb;AAEA,sBAAkB,mBAAoB,qBACnC,IAAI,oBAAoB,IAAI,aAC5B,OAAO,oBAAoB,CAAC,MAAM;AAAA,EACvC;AAIA,MAAI,CAAC,gBAAgB,CAAC,iBAAiB;AAGrC,QAAI,SAAS,CAAC,eAAe,CAAC,kBAAkB,MAAM,GAAG;AACvD,aAAO;AAAA,IACT;AACA,WAAO,gBAAgB,sBAAsB,eAAe;AAAA,EAC9D;AAEA,MAAI,iBAAiB,KAAK,oBAAoB,MAAM,GAAG;AACrD,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,aAAa;AAChB,WAAO,kBAAkB,eAAe;AAAA,EAC1C;AACA,SAAO,gBAAgB,sBAAsB,eAAe;AAC9D;AAQA,SAAS,YAAY,OAAO,QAAQ,OAAO,OAAO,SAAS;AACzD,QAAM,QAAQ,WAAY;AACxB,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,MAAM,gBAAgB,sBAAsB,OAAO;AAAA,IAC5D;AACA,QAAI,CAAC,MAAM,cAAc;AACvB,UAAI,2BAA2B,QAAQ,MAAM,MAAM,MAAM,yBAAyB,KAAK,MAAM,GAAG;AAC9F,eAAO,MAAM,gBAAgB,sBAAuB,MAAM,SAAS,MAAQ,MAAM,SAAS;AAAA,MAC5F;AAAA,IACF;AAEA,QAAI,SAAS,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK;AAQ7C,QAAI,YAAY,MAAM,cAAc,KAChC,KAAK,KAAK,IAAI,KAAK,IAAI,MAAM,WAAW,EAAE,GAAG,MAAM,YAAY,MAAM;AAGzE,QAAI,iBAAiB,SAEf,MAAM,YAAY,MAAM,SAAS,MAAM;AAC7C,aAAS,cAAcC,SAAQ;AAC7B,aAAO,sBAAsB,OAAOA,OAAM;AAAA,IAC5C;AAEA,YAAQ;AAAA,MAAkB;AAAA,MAAQ;AAAA,MAAgB,MAAM;AAAA,MAAQ;AAAA,MAC9D;AAAA,MAAe,MAAM;AAAA,MAAa,MAAM,eAAe,CAAC;AAAA,MAAO;AAAA,IAAO,GAAG;AAAA,MAEzE,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO,MAAM,OAAO,QAAQ,MAAM,IAAI,IAAI;AAAA,MAC5C,KAAK;AACH,eAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,IACzC,kBAAkB,aAAa,QAAQ,MAAM,CAAC;AAAA,MACpD,KAAK;AACH,eAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,IACzC,kBAAkB,aAAa,WAAW,QAAQ,SAAS,GAAG,MAAM,CAAC;AAAA,MAC3E,KAAK;AACH,eAAO,MAAM,aAAa,MAAM,IAAI;AAAA,MACtC;AACE,cAAM,IAAI,UAAU,wCAAwC;AAAA,IAChE;AAAA,EACF,GAAE;AACJ;AAGA,SAAS,YAAY,QAAQ,gBAAgB;AAC3C,MAAI,kBAAkB,oBAAoB,MAAM,IAAI,OAAO,cAAc,IAAI;AAG7E,MAAI,OAAgB,OAAO,OAAO,SAAS,CAAC,MAAM;AAClD,MAAI,OAAO,SAAS,OAAO,OAAO,SAAS,CAAC,MAAM,QAAQ,WAAW;AACrE,MAAI,QAAQ,OAAO,MAAO,OAAO,KAAK;AAEtC,SAAO,kBAAkB,QAAQ;AACnC;AAGA,SAAS,kBAAkB,QAAQ;AACjC,SAAO,OAAO,OAAO,SAAS,CAAC,MAAM,OAAO,OAAO,MAAM,GAAG,EAAE,IAAI;AACpE;AAIA,SAAS,WAAW,QAAQ,OAAO;AAKjC,MAAI,SAAS;AAGb,MAAI,UAAU,WAAY;AACxB,QAAI,SAAS,OAAO,QAAQ,IAAI;AAChC,aAAS,WAAW,KAAK,SAAS,OAAO;AACzC,WAAO,YAAY;AACnB,WAAO,SAAS,OAAO,MAAM,GAAG,MAAM,GAAG,KAAK;AAAA,EAChD,GAAE;AAEF,MAAI,mBAAmB,OAAO,CAAC,MAAM,QAAQ,OAAO,CAAC,MAAM;AAC3D,MAAI;AAGJ,MAAIN;AACJ,SAAQA,SAAQ,OAAO,KAAK,MAAM,GAAI;AACpC,QAAI,SAASA,OAAM,CAAC,GAAG,OAAOA,OAAM,CAAC;AACrC,mBAAgB,KAAK,CAAC,MAAM;AAC5B,cAAU,UACL,CAAC,oBAAoB,CAAC,gBAAgB,SAAS,KAC9C,OAAO,MACT,SAAS,MAAM,KAAK;AACxB,uBAAmB;AAAA,EACrB;AAEA,SAAO;AACT;AAMA,SAAS,SAAS,MAAM,OAAO;AAC7B,MAAI,SAAS,MAAM,KAAK,CAAC,MAAM,IAAK,QAAO;AAG3C,MAAI,UAAU;AACd,MAAIA;AAEJ,MAAI,QAAQ,GAAG,KAAK,OAAO,GAAG,OAAO;AACrC,MAAI,SAAS;AAMb,SAAQA,SAAQ,QAAQ,KAAK,IAAI,GAAI;AACnC,WAAOA,OAAM;AAEb,QAAI,OAAO,QAAQ,OAAO;AACxB,YAAO,OAAO,QAAS,OAAO;AAC9B,gBAAU,OAAO,KAAK,MAAM,OAAO,GAAG;AAEtC,cAAQ,MAAM;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAIA,YAAU;AAEV,MAAI,KAAK,SAAS,QAAQ,SAAS,OAAO,OAAO;AAC/C,cAAU,KAAK,MAAM,OAAO,IAAI,IAAI,OAAO,KAAK,MAAM,OAAO,CAAC;AAAA,EAChE,OAAO;AACL,cAAU,KAAK,MAAM,KAAK;AAAA,EAC5B;AAEA,SAAO,OAAO,MAAM,CAAC;AACvB;AAGA,SAAS,aAAa,QAAQ;AAC5B,MAAI,SAAS;AACb,MAAI,OAAO;AACX,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AACjE,WAAO,YAAY,QAAQ,CAAC;AAC5B,gBAAY,iBAAiB,IAAI;AAEjC,QAAI,CAAC,aAAa,YAAY,IAAI,GAAG;AACnC,gBAAU,OAAO,CAAC;AAClB,UAAI,QAAQ,MAAS,WAAU,OAAO,IAAI,CAAC;AAAA,IAC7C,OAAO;AACL,gBAAU,aAAa,UAAU,IAAI;AAAA,IACvC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAO,OAAO,QAAQ;AAC/C,MAAI,UAAU,IACV,OAAU,MAAM,KAChB,OACA,QACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,YAAQ,OAAO,KAAK;AAEpB,QAAI,MAAM,UAAU;AAClB,cAAQ,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,GAAG,KAAK;AAAA,IAC1D;AAGA,QAAI,UAAU,OAAO,OAAO,OAAO,OAAO,KAAK,KAC1C,OAAO,UAAU,eACjB,UAAU,OAAO,OAAO,MAAM,OAAO,KAAK,GAAI;AAEjD,UAAI,YAAY,GAAI,YAAW,OAAO,CAAC,MAAM,eAAe,MAAM;AAClE,iBAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,MAAM,UAAU;AAC/B;AAEA,SAAS,mBAAmB,OAAO,OAAO,QAAQ,SAAS;AACzD,MAAI,UAAU,IACV,OAAU,MAAM,KAChB,OACA,QACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,YAAQ,OAAO,KAAK;AAEpB,QAAI,MAAM,UAAU;AAClB,cAAQ,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,GAAG,KAAK;AAAA,IAC1D;AAGA,QAAI,UAAU,OAAO,QAAQ,GAAG,OAAO,MAAM,MAAM,OAAO,IAAI,KACzD,OAAO,UAAU,eACjB,UAAU,OAAO,QAAQ,GAAG,MAAM,MAAM,MAAM,OAAO,IAAI,GAAI;AAEhE,UAAI,CAAC,WAAW,YAAY,IAAI;AAC9B,mBAAW,iBAAiB,OAAO,KAAK;AAAA,MAC1C;AAEA,UAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,mBAAW;AAAA,MACb,OAAO;AACL,mBAAW;AAAA,MACb;AAEA,iBAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,WAAW;AAC1B;AAEA,SAAS,iBAAiB,OAAO,OAAO,QAAQ;AAC9C,MAAI,UAAgB,IAChB,OAAgB,MAAM,KACtB,gBAAgB,OAAO,KAAK,MAAM,GAClC,OACA,QACA,WACA,aACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAEzE,iBAAa;AACb,QAAI,YAAY,GAAI,eAAc;AAElC,QAAI,MAAM,aAAc,eAAc;AAEtC,gBAAY,cAAc,KAAK;AAC/B,kBAAc,OAAO,SAAS;AAE9B,QAAI,MAAM,UAAU;AAClB,oBAAc,MAAM,SAAS,KAAK,QAAQ,WAAW,WAAW;AAAA,IAClE;AAEA,QAAI,CAAC,UAAU,OAAO,OAAO,WAAW,OAAO,KAAK,GAAG;AACrD;AAAA,IACF;AAEA,QAAI,MAAM,KAAK,SAAS,KAAM,eAAc;AAE5C,kBAAc,MAAM,QAAQ,MAAM,eAAe,MAAM,MAAM,OAAO,MAAM,eAAe,KAAK;AAE9F,QAAI,CAAC,UAAU,OAAO,OAAO,aAAa,OAAO,KAAK,GAAG;AACvD;AAAA,IACF;AAEA,kBAAc,MAAM;AAGpB,eAAW;AAAA,EACb;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,MAAM,UAAU;AAC/B;AAEA,SAAS,kBAAkB,OAAO,OAAO,QAAQ,SAAS;AACxD,MAAI,UAAgB,IAChB,OAAgB,MAAM,KACtB,gBAAgB,OAAO,KAAK,MAAM,GAClC,OACA,QACA,WACA,aACA,cACA;AAGJ,MAAI,MAAM,aAAa,MAAM;AAE3B,kBAAc,KAAK;AAAA,EACrB,WAAW,OAAO,MAAM,aAAa,YAAY;AAE/C,kBAAc,KAAK,MAAM,QAAQ;AAAA,EACnC,WAAW,MAAM,UAAU;AAEzB,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAChE;AAEA,OAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,iBAAa;AAEb,QAAI,CAAC,WAAW,YAAY,IAAI;AAC9B,oBAAc,iBAAiB,OAAO,KAAK;AAAA,IAC7C;AAEA,gBAAY,cAAc,KAAK;AAC/B,kBAAc,OAAO,SAAS;AAE9B,QAAI,MAAM,UAAU;AAClB,oBAAc,MAAM,SAAS,KAAK,QAAQ,WAAW,WAAW;AAAA,IAClE;AAEA,QAAI,CAAC,UAAU,OAAO,QAAQ,GAAG,WAAW,MAAM,MAAM,IAAI,GAAG;AAC7D;AAAA,IACF;AAEA,mBAAgB,MAAM,QAAQ,QAAQ,MAAM,QAAQ,OACpC,MAAM,QAAQ,MAAM,KAAK,SAAS;AAElD,QAAI,cAAc;AAChB,UAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,sBAAc;AAAA,MAChB,OAAO;AACL,sBAAc;AAAA,MAChB;AAAA,IACF;AAEA,kBAAc,MAAM;AAEpB,QAAI,cAAc;AAChB,oBAAc,iBAAiB,OAAO,KAAK;AAAA,IAC7C;AAEA,QAAI,CAAC,UAAU,OAAO,QAAQ,GAAG,aAAa,MAAM,YAAY,GAAG;AACjE;AAAA,IACF;AAEA,QAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,oBAAc;AAAA,IAChB,OAAO;AACL,oBAAc;AAAA,IAChB;AAEA,kBAAc,MAAM;AAGpB,eAAW;AAAA,EACb;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,WAAW;AAC1B;AAEA,SAAS,WAAW,OAAO,QAAQ,UAAU;AAC3C,MAAI,SAAS,UAAU,OAAO,QAAQG,OAAM;AAE5C,aAAW,WAAW,MAAM,gBAAgB,MAAM;AAElD,OAAK,QAAQ,GAAG,SAAS,SAAS,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACpE,IAAAA,QAAO,SAAS,KAAK;AAErB,SAAKA,MAAK,cAAeA,MAAK,eACzB,CAACA,MAAK,cAAgB,OAAO,WAAW,YAAc,kBAAkBA,MAAK,gBAC7E,CAACA,MAAK,aAAcA,MAAK,UAAU,MAAM,IAAI;AAEhD,UAAI,UAAU;AACZ,YAAIA,MAAK,SAASA,MAAK,eAAe;AACpC,gBAAM,MAAMA,MAAK,cAAc,MAAM;AAAA,QACvC,OAAO;AACL,gBAAM,MAAMA,MAAK;AAAA,QACnB;AAAA,MACF,OAAO;AACL,cAAM,MAAM;AAAA,MACd;AAEA,UAAIA,MAAK,WAAW;AAClB,gBAAQ,MAAM,SAASA,MAAK,GAAG,KAAKA,MAAK;AAEzC,YAAI,UAAU,KAAKA,MAAK,SAAS,MAAM,qBAAqB;AAC1D,oBAAUA,MAAK,UAAU,QAAQ,KAAK;AAAA,QACxC,WAAW,gBAAgB,KAAKA,MAAK,WAAW,KAAK,GAAG;AACtD,oBAAUA,MAAK,UAAU,KAAK,EAAE,QAAQ,KAAK;AAAA,QAC/C,OAAO;AACL,gBAAM,IAAI,UAAU,OAAOA,MAAK,MAAM,iCAAiC,QAAQ,SAAS;AAAA,QAC1F;AAEA,cAAM,OAAO;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,UAAU,OAAO,OAAO,QAAQ,OAAO,SAAS,OAAO,YAAY;AAC1E,QAAM,MAAM;AACZ,QAAM,OAAO;AAEb,MAAI,CAAC,WAAW,OAAO,QAAQ,KAAK,GAAG;AACrC,eAAW,OAAO,QAAQ,IAAI;AAAA,EAChC;AAEA,MAAIA,QAAO,UAAU,KAAK,MAAM,IAAI;AACpC,MAAI,UAAU;AACd,MAAI;AAEJ,MAAI,OAAO;AACT,YAAS,MAAM,YAAY,KAAK,MAAM,YAAY;AAAA,EACpD;AAEA,MAAI,gBAAgBA,UAAS,qBAAqBA,UAAS,kBACvD,gBACA;AAEJ,MAAI,eAAe;AACjB,qBAAiB,MAAM,WAAW,QAAQ,MAAM;AAChD,gBAAY,mBAAmB;AAAA,EACjC;AAEA,MAAK,MAAM,QAAQ,QAAQ,MAAM,QAAQ,OAAQ,aAAc,MAAM,WAAW,KAAK,QAAQ,GAAI;AAC/F,cAAU;AAAA,EACZ;AAEA,MAAI,aAAa,MAAM,eAAe,cAAc,GAAG;AACrD,UAAM,OAAO,UAAU;AAAA,EACzB,OAAO;AACL,QAAI,iBAAiB,aAAa,CAAC,MAAM,eAAe,cAAc,GAAG;AACvE,YAAM,eAAe,cAAc,IAAI;AAAA,IACzC;AACA,QAAIA,UAAS,mBAAmB;AAC9B,UAAI,SAAU,OAAO,KAAK,MAAM,IAAI,EAAE,WAAW,GAAI;AACnD,0BAAkB,OAAO,OAAO,MAAM,MAAM,OAAO;AACnD,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM;AAAA,QAChD;AAAA,MACF,OAAO;AACL,yBAAiB,OAAO,OAAO,MAAM,IAAI;AACzC,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM,MAAM;AAAA,QACtD;AAAA,MACF;AAAA,IACF,WAAWA,UAAS,kBAAkB;AACpC,UAAI,SAAU,MAAM,KAAK,WAAW,GAAI;AACtC,YAAI,MAAM,iBAAiB,CAAC,cAAc,QAAQ,GAAG;AACnD,6BAAmB,OAAO,QAAQ,GAAG,MAAM,MAAM,OAAO;AAAA,QAC1D,OAAO;AACL,6BAAmB,OAAO,OAAO,MAAM,MAAM,OAAO;AAAA,QACtD;AACA,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM;AAAA,QAChD;AAAA,MACF,OAAO;AACL,0BAAkB,OAAO,OAAO,MAAM,IAAI;AAC1C,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM,MAAM;AAAA,QACtD;AAAA,MACF;AAAA,IACF,WAAWA,UAAS,mBAAmB;AACrC,UAAI,MAAM,QAAQ,KAAK;AACrB,oBAAY,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;AAAA,MACtD;AAAA,IACF,WAAWA,UAAS,sBAAsB;AACxC,aAAO;AAAA,IACT,OAAO;AACL,UAAI,MAAM,YAAa,QAAO;AAC9B,YAAM,IAAI,UAAU,4CAA4CA,KAAI;AAAA,IACtE;AAEA,QAAI,MAAM,QAAQ,QAAQ,MAAM,QAAQ,KAAK;AAc3C,eAAS;AAAA,QACP,MAAM,IAAI,CAAC,MAAM,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,MAAM;AAAA,MACpD,EAAE,QAAQ,MAAM,KAAK;AAErB,UAAI,MAAM,IAAI,CAAC,MAAM,KAAK;AACxB,iBAAS,MAAM;AAAA,MACjB,WAAW,OAAO,MAAM,GAAG,EAAE,MAAM,sBAAsB;AACvD,iBAAS,OAAO,OAAO,MAAM,EAAE;AAAA,MACjC,OAAO;AACL,iBAAS,OAAO,SAAS;AAAA,MAC3B;AAEA,YAAM,OAAO,SAAS,MAAM,MAAM;AAAA,IACpC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAQ,OAAO;AAC7C,MAAI,UAAU,CAAC,GACX,oBAAoB,CAAC,GACrB,OACA;AAEJ,cAAY,QAAQ,SAAS,iBAAiB;AAE9C,OAAK,QAAQ,GAAG,SAAS,kBAAkB,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAC7E,UAAM,WAAW,KAAK,QAAQ,kBAAkB,KAAK,CAAC,CAAC;AAAA,EACzD;AACA,QAAM,iBAAiB,IAAI,MAAM,MAAM;AACzC;AAEA,SAAS,YAAY,QAAQ,SAAS,mBAAmB;AACvD,MAAI,eACA,OACA;AAEJ,MAAI,WAAW,QAAQ,OAAO,WAAW,UAAU;AACjD,YAAQ,QAAQ,QAAQ,MAAM;AAC9B,QAAI,UAAU,IAAI;AAChB,UAAI,kBAAkB,QAAQ,KAAK,MAAM,IAAI;AAC3C,0BAAkB,KAAK,KAAK;AAAA,MAC9B;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,MAAM;AAEnB,UAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,aAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,sBAAY,OAAO,KAAK,GAAG,SAAS,iBAAiB;AAAA,QACvD;AAAA,MACF,OAAO;AACL,wBAAgB,OAAO,KAAK,MAAM;AAElC,aAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,sBAAY,OAAO,cAAc,KAAK,CAAC,GAAG,SAAS,iBAAiB;AAAA,QACtE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,OAAO,OAAO,SAAS;AAC9B,YAAU,WAAW,CAAC;AAEtB,MAAI,QAAQ,IAAI,MAAM,OAAO;AAE7B,MAAI,CAAC,MAAM,OAAQ,wBAAuB,OAAO,KAAK;AAEtD,MAAI,QAAQ;AAEZ,MAAI,MAAM,UAAU;AAClB,YAAQ,MAAM,SAAS,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,KAAK;AAAA,EACtD;AAEA,MAAI,UAAU,OAAO,GAAG,OAAO,MAAM,IAAI,EAAG,QAAO,MAAM,OAAO;AAEhE,SAAO;AACT;AAEA,IAAI,SAAS;AAEb,IAAI,SAAS;AAAA,EACZ,MAAM;AACP;AAEA,SAAS,QAAQ,MAAM,IAAI;AACzB,SAAO,WAAY;AACjB,UAAM,IAAI,MAAM,mBAAmB,OAAO,wCAC1B,KAAK,yCAAyC;AAAA,EAChE;AACF;AASA,IAAI,OAAsB,OAAO;AACjC,IAAI,UAAsB,OAAO;AACjC,IAAI,OAAsB,OAAO;AAqBjC,IAAI,WAAsB,QAAQ,YAAY,MAAM;AACpD,IAAI,cAAsB,QAAQ,eAAe,SAAS;AAC1D,IAAI,WAAsB,QAAQ,YAAY,MAAM;;;AC5vH7C,IAAM,WAAW,CACtB,GACA,GACAI,SACE;AACF,QAAM,KAAK,aAAa,SAAS,WAAW,GAAGA,IAAG,IAAI;AACtD,QAAM,KAAK,aAAa,SAAS,WAAW,GAAGA,IAAG,IAAI;AAEtD,QAAM,IAAI,OAAO,QAAQ,MAAM,QAAQ,MAAM,IAAI,IAAIA,IAAG;AAExD,SACE,KAAK;IACH,OAAO,EAAE,CAAC;IACV,KAAK,EAAE,CAAC;IACR,KAAKA,KAAI,MAAM,GAAG,EAAE,CAAC,CAAC;IACtB,MAAMA,KAAI,MAAM,EAAE,CAAC,IAAI,GAAG,QAAQ,EAAE,CAAC,CAAC;IACtC,MAAMA,KAAI,MAAM,EAAE,CAAC,IAAI,GAAG,MAAM;;AAGtC;AAEA,IAAM,aAAa,CAAC,KAAaA,SAAe;AAC9C,QAAM,IAAIA,KAAI,MAAM,GAAG;AACvB,SAAO,IAAI,EAAE,CAAC,IAAI;AACpB;AAEO,IAAM,QAAQ,CACnB,GACA,GACAA,SACgC;AAChC,MAAI,MACF,KACA,MACA,QAA4B,QAC5B;AACF,MAAIC,MAAKD,KAAI,QAAQ,CAAC;AACtB,MAAIE,MAAKF,KAAI,QAAQ,GAAGC,MAAK,CAAC;AAC9B,MAAI,IAAIA;AAER,MAAIA,OAAM,KAAKC,MAAK,GAAG;AACrB,QAAI,MAAM,GAAG;AACX,aAAO,CAACD,KAAIC,GAAE;IAChB;AACA,WAAO,CAAA;AACP,WAAOF,KAAI;AAEX,WAAO,KAAK,KAAK,CAAC,QAAQ;AACxB,UAAI,MAAMC,KAAI;AACZ,aAAK,KAAK,CAAC;AACX,QAAAA,MAAKD,KAAI,QAAQ,GAAG,IAAI,CAAC;MAC3B,WAAW,KAAK,WAAW,GAAG;AAC5B,cAAM,IAAI,KAAK,IAAG;AAClB,YAAI,MAAM;AAAW,mBAAS,CAAC,GAAGE,GAAE;MACtC,OAAO;AACL,cAAM,KAAK,IAAG;AACd,YAAI,QAAQ,UAAa,MAAM,MAAM;AACnC,iBAAO;AACP,kBAAQA;QACV;AAEA,QAAAA,MAAKF,KAAI,QAAQ,GAAG,IAAI,CAAC;MAC3B;AAEA,UAAIC,MAAKC,OAAMD,OAAM,IAAIA,MAAKC;IAChC;AAEA,QAAI,KAAK,UAAU,UAAU,QAAW;AACtC,eAAS,CAAC,MAAM,KAAK;IACvB;EACF;AAEA,SAAO;AACT;;;ACvEA,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,UAAU,WAAW,KAAK,OAAM,IAAK;AAC3C,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,YAAY,aAAa,KAAK,OAAM,IAAK;AAC/C,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,iBAAiB,IAAI,OAAO,SAAS,GAAG;AAC9C,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,mBAAmB,IAAI,OAAO,WAAW,GAAG;AAClD,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,eAAe;AACrB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AAEf,IAAM,gBAAgB;AAE7B,SAAS,QAAQC,MAAW;AAC1B,SAAO,CAAC,MAAMA,IAAU,IAAI,SAASA,MAAK,EAAE,IAAIA,KAAI,WAAW,CAAC;AAClE;AAEA,SAAS,aAAaA,MAAW;AAC/B,SAAOA,KACJ,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,aAAa,OAAO,EAC5B,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,eAAe,SAAS;AACrC;AAEA,SAAS,eAAeA,MAAW;AACjC,SAAOA,KACJ,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,iBAAiB,GAAG,EAC5B,QAAQ,iBAAiB,GAAG,EAC5B,QAAQ,kBAAkB,GAAG;AAClC;AAOA,SAAS,gBAAgBA,MAAW;AAClC,MAAI,CAACA,MAAK;AACR,WAAO,CAAC,EAAE;EACZ;AAEA,QAAM,QAAkB,CAAA;AACxB,QAAM,IAAI,SAAS,KAAK,KAAKA,IAAG;AAEhC,MAAI,CAAC,GAAG;AACN,WAAOA,KAAI,MAAM,GAAG;EACtB;AAEA,QAAM,EAAE,KAAK,MAAM,KAAI,IAAK;AAC5B,QAAM,IAAI,IAAI,MAAM,GAAG;AAEvB,IAAE,EAAE,SAAS,CAAC,KAAK,MAAM,OAAO;AAChC,QAAM,YAAY,gBAAgB,IAAI;AACtC,MAAI,KAAK,QAAQ;AACf;AAAE,MAAE,EAAE,SAAS,CAAC,KAAgB,UAAU,MAAK;AAC/C,MAAE,KAAK,MAAM,GAAG,SAAS;EAC3B;AAEA,QAAM,KAAK,MAAM,OAAO,CAAC;AAEzB,SAAO;AACT;AAMM,SAAU,OAAOA,MAAa,UAAiC,CAAA,GAAE;AACrE,MAAI,CAACA,MAAK;AACR,WAAO,CAAA;EACT;AAEA,QAAM,EAAE,MAAM,cAAa,IAAK;AAQhC,MAAIA,KAAI,MAAM,GAAG,CAAC,MAAM,MAAM;AAC5B,IAAAA,OAAM,WAAWA,KAAI,MAAM,CAAC;EAC9B;AAEA,SAAO,QAAQ,aAAaA,IAAG,GAAG,KAAK,IAAI,EAAE,IAAI,cAAc;AACjE;AAEA,SAAS,QAAQA,MAAW;AAC1B,SAAO,MAAMA,OAAM;AACrB;AAEA,SAAS,SAAS,IAAU;AAC1B,SAAO,SAAS,KAAK,EAAE;AACzB;AAEA,SAAS,IAAI,GAAW,GAAS;AAC/B,SAAO,KAAK;AACd;AAEA,SAAS,IAAI,GAAW,GAAS;AAC/B,SAAO,KAAK;AACd;AAEA,SAAS,QAAQA,MAAa,KAAa,OAAc;AAEvD,QAAM,aAAuB,CAAA;AAE7B,QAAM,IAAI,SAAS,KAAK,KAAKA,IAAG;AAChC,MAAI,CAAC;AAAG,WAAO,CAACA,IAAG;AAGnB,QAAM,MAAM,EAAE;AACd,QAAM,OAAiB,EAAE,KAAK,SAAS,QAAQ,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC,EAAE;AAExE,MAAI,MAAM,KAAK,EAAE,GAAG,GAAG;AACrB,aAASC,KAAI,GAAGA,KAAI,KAAK,UAAUA,KAAI,KAAKA,MAAK;AAC/C,YAAM,YAAY,MAAM,MAAM,EAAE,OAAO,MAAM,KAAKA,EAAC;AACnD,iBAAW,KAAK,SAAS;IAC3B;EACF,OAAO;AACL,UAAM,oBAAoB,iCAAiC,KAAK,EAAE,IAAI;AACtE,UAAM,kBAAkB,uCAAuC,KAC7D,EAAE,IAAI;AAER,UAAM,aAAa,qBAAqB;AACxC,UAAM,YAAY,EAAE,KAAK,QAAQ,GAAG,KAAK;AACzC,QAAI,CAAC,cAAc,CAAC,WAAW;AAE7B,UAAI,EAAE,KAAK,MAAM,YAAY,GAAG;AAC9B,QAAAD,OAAM,EAAE,MAAM,MAAM,EAAE,OAAO,WAAW,EAAE;AAC1C,eAAO,QAAQA,MAAK,KAAK,IAAI;MAC/B;AACA,aAAO,CAACA,IAAG;IACb;AAEA,QAAIE;AACJ,QAAI,YAAY;AACd,MAAAA,KAAI,EAAE,KAAK,MAAM,MAAM;IACzB,OAAO;AACL,MAAAA,KAAI,gBAAgB,EAAE,IAAI;AAC1B,UAAIA,GAAE,WAAW,KAAKA,GAAE,CAAC,MAAM,QAAW;AAExC,QAAAA,KAAI,QAAQA,GAAE,CAAC,GAAG,KAAK,KAAK,EAAE,IAAI,OAAO;AAGzC,YAAIA,GAAE,WAAW,GAAG;AAClB,iBAAO,KAAK,IAAI,OAAK,EAAE,MAAMA,GAAE,CAAC,IAAI,CAAC;QACvC;MAEF;IACF;AAIA,QAAIC;AAEJ,QAAI,cAAcD,GAAE,CAAC,MAAM,UAAaA,GAAE,CAAC,MAAM,QAAW;AAC1D,YAAME,KAAI,QAAQF,GAAE,CAAC,CAAC;AACtB,YAAM,IAAI,QAAQA,GAAE,CAAC,CAAC;AACtB,YAAM,QAAQ,KAAK,IAAIA,GAAE,CAAC,EAAE,QAAQA,GAAE,CAAC,EAAE,MAAM;AAC/C,UAAI,OACFA,GAAE,WAAW,KAAKA,GAAE,CAAC,MAAM,SACzB,KAAK,IAAI,KAAK,IAAI,QAAQA,GAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IACnC;AACJ,UAAI,OAAO;AACX,YAAM,UAAU,IAAIE;AACpB,UAAI,SAAS;AACX,gBAAQ;AACR,eAAO;MACT;AACA,YAAM,MAAMF,GAAE,KAAK,QAAQ;AAE3B,MAAAC,KAAI,CAAA;AAEJ,eAAS,IAAIC,IAAG,KAAK,GAAG,CAAC,GAAG,KAAK,MAAM;AACrC,YAAI;AACJ,YAAI,iBAAiB;AACnB,cAAI,OAAO,aAAa,CAAC;AACzB,cAAI,MAAM,MAAM;AACd,gBAAI;UACN;QACF,OAAO;AACL,cAAI,OAAO,CAAC;AACZ,cAAI,KAAK;AACP,kBAAM,OAAO,QAAQ,EAAE;AACvB,gBAAI,OAAO,GAAG;AACZ,oBAAM,IAAI,IAAI,MAAM,OAAO,CAAC,EAAE,KAAK,GAAG;AACtC,kBAAI,IAAI,GAAG;AACT,oBAAI,MAAM,IAAI,EAAE,MAAM,CAAC;cACzB,OAAO;AACL,oBAAI,IAAI;cACV;YACF;UACF;QACF;AACA,QAAAD,GAAE,KAAK,CAAC;MACV;IACF,OAAO;AACL,MAAAA,KAAI,CAAA;AAEJ,eAASE,KAAI,GAAGA,KAAIH,GAAE,QAAQG,MAAK;AACjC,QAAAF,GAAE,KAAK,MAAMA,IAAG,QAAQD,GAAEG,EAAC,GAAa,KAAK,KAAK,CAAC;MACrD;IACF;AAEA,aAASA,KAAI,GAAGA,KAAIF,GAAE,QAAQE,MAAK;AACjC,eAASJ,KAAI,GAAGA,KAAI,KAAK,UAAU,WAAW,SAAS,KAAKA,MAAK;AAC/D,cAAM,YAAY,MAAME,GAAEE,EAAC,IAAI,KAAKJ,EAAC;AACrC,YAAI,CAAC,SAAS,cAAc,WAAW;AACrC,qBAAW,KAAK,SAAS;QAC3B;MACF;IACF;EACF;AAEA,SAAO;AACT;;;ACnOA,IAAM,qBAAqB,OAAO;AAC3B,IAAM,qBAAiD,CAC5D,YAC6B;AAC7B,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,IAAI,UAAU,iBAAiB;EACvC;AAEA,MAAI,QAAQ,SAAS,oBAAoB;AACvC,UAAM,IAAI,UAAU,qBAAqB;EAC3C;AACF;;;ACPA,IAAM,eACJ;EACE,aAAa,CAAC,wBAAwB,IAAI;EAC1C,aAAa,CAAC,iBAAiB,IAAI;EACnC,aAAa,CAAC,eAAyB,KAAK;EAC5C,aAAa,CAAC,cAAc,IAAI;EAChC,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,gBAAgB,MAAM,IAAI;EACxC,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,UAAU,IAAI;EAC5B,aAAa,CAAC,UAAU,IAAI;EAC5B,aAAa,CAAC,yBAAyB,IAAI;EAC3C,aAAa,CAAC,WAAW,IAAI;EAC7B,YAAY,CAAC,+BAA+B,IAAI;EAChD,cAAc,CAAC,aAAa,KAAK;;AAKrC,IAAM,cAAc,CAAC,MAAc,EAAE,QAAQ,aAAa,MAAM;AAEhE,IAAM,eAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAG9C,IAAM,iBAAiB,CAAC,WAA6B,OAAO,KAAK,EAAE;AAe5D,IAAM,aAAa,CACxB,MACA,aACoB;AACpB,QAAM,MAAM;AAEZ,MAAI,KAAK,OAAO,GAAG,MAAM,KAAK;AAC5B,UAAM,IAAI,MAAM,2BAA2B;EAC7C;AAEA,QAAM,SAAmB,CAAA;AACzB,QAAM,OAAiB,CAAA;AAEvB,MAAI,IAAI,MAAM;AACd,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,aAAa;AACjB,QAAO,QAAO,IAAI,KAAK,QAAQ;AAC7B,UAAM,IAAI,KAAK,OAAO,CAAC;AACvB,SAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM,GAAG;AAC7C,eAAS;AACT;AACA;IACF;AAEA,QAAI,MAAM,OAAO,YAAY,CAAC,UAAU;AACtC,eAAS,IAAI;AACb;IACF;AAEA,eAAW;AACX,QAAI,MAAM,MAAM;AACd,UAAI,CAAC,UAAU;AACb,mBAAW;AACX;AACA;MACF;IAEF;AACA,QAAI,MAAM,OAAO,CAAC,UAAU;AAE1B,iBAAW,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,OAAO,QAAQ,YAAY,GAAG;AAChE,YAAI,KAAK,WAAW,KAAK,CAAC,GAAG;AAE3B,cAAI,YAAY;AACd,mBAAO,CAAC,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI;UAC9C;AACA,eAAK,IAAI;AACT,cAAI;AAAK,iBAAK,KAAK,IAAI;;AAClB,mBAAO,KAAK,IAAI;AACrB,kBAAQ,SAAS;AACjB,mBAAS;QACX;MACF;IACF;AAGA,eAAW;AACX,QAAI,YAAY;AAGd,UAAI,IAAI,YAAY;AAClB,eAAO,KAAK,YAAY,UAAU,IAAI,MAAM,YAAY,CAAC,CAAC;MAC5D,WAAW,MAAM,YAAY;AAC3B,eAAO,KAAK,YAAY,CAAC,CAAC;MAC5B;AACA,mBAAa;AACb;AACA;IACF;AAIA,QAAI,KAAK,WAAW,MAAM,IAAI,CAAC,GAAG;AAChC,aAAO,KAAK,YAAY,IAAI,GAAG,CAAC;AAChC,WAAK;AACL;IACF;AACA,QAAI,KAAK,WAAW,KAAK,IAAI,CAAC,GAAG;AAC/B,mBAAa;AACb,WAAK;AACL;IACF;AAGA,WAAO,KAAK,YAAY,CAAC,CAAC;AAC1B;EACF;AAEA,MAAI,SAAS,GAAG;AAGd,WAAO,CAAC,IAAI,OAAO,GAAG,KAAK;EAC7B;AAIA,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,QAAQ;AAClC,WAAO,CAAC,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI;EAC9C;AAMA,MACE,KAAK,WAAW,KAChB,OAAO,WAAW,KAClB,SAAS,KAAK,OAAO,CAAC,CAAC,KACvB,CAAC,QACD;AACA,UAAM,IAAI,OAAO,CAAC,EAAE,WAAW,IAAI,OAAO,CAAC,EAAE,MAAM,EAAE,IAAI,OAAO,CAAC;AACjE,WAAO,CAAC,aAAa,CAAC,GAAG,OAAO,SAAS,KAAK,KAAK;EACrD;AAEA,QAAM,UAAU,OAAO,SAAS,MAAM,MAAM,eAAe,MAAM,IAAI;AACrE,QAAM,QAAQ,OAAO,SAAS,KAAK,OAAO,eAAe,IAAI,IAAI;AACjE,QAAM,OACJ,OAAO,UAAU,KAAK,SAAS,MAAM,UAAU,MAAM,QAAQ,MAC3D,OAAO,SAAS,UAChB;AAEJ,SAAO,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI;AACzC;;;ACrJO,IAAM,WAAW,CACtB,GACA,EACE,uBAAuB,OACvB,gBAAgB,KAAI,IACgD,CAAA,MACpE;AACF,MAAI,eAAe;AACjB,WAAO,uBACH,EAAE,QAAQ,kBAAkB,IAAI,IAChC,EACG,QAAQ,6BAA6B,MAAM,EAC3C,QAAQ,cAAc,IAAI;EACnC;AACA,SAAO,uBACH,EAAE,QAAQ,oBAAoB,IAAI,IAClC,EACG,QAAQ,+BAA+B,MAAM,EAC7C,QAAQ,gBAAgB,IAAI;AACrC;;;;ACGA,IAAM,QAAQ,oBAAI,IAAiB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AAC5D,IAAM,gBAAgB,CAAC,MACrB,MAAM,IAAI,CAAgB;AAC5B,IAAM,eAAe,CAAC,MACpB,cAAc,EAAE,IAAI;AAiDtB,IAAM,cAAc,oBAAI,IAAgC;EACtD,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;EAC1B,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;CACjB;AAID,IAAM,uBAAuB,oBAAI,IAAgC;EAC/D,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;CACjB;AAGD,IAAM,iBAAiB,oBAAI,IAAgC;EACzD,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;EAC1B,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;CAC3B;AAMD,IAAM,WAAW,oBAAI,IAA8D;EACjF,CAAC,KAAK,oBAAI,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;EAC3B;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;EAEH;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;EAEH;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;CAEJ;AAMD,IAAM,mBAAmB;AACzB,IAAM,aAAa;AAKnB,IAAM,kBAAkB,oBAAI,IAAI,CAAC,KAAK,GAAG,CAAC;AAE1C,IAAM,WAAW,oBAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AACpC,IAAM,aAAa,IAAI,IAAI,iBAAiB;AAC5C,IAAM,eAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAG9C,IAAM,QAAQ;AAGd,IAAM,OAAO,QAAQ;AAGrB,IAAM,cAAc,QAAQ;AAK5B,IAAI,KAAK;AACH,IAAO,MAAP,MAAU;EACd;EACS;EAET;EACA,SAAkB;EAClB,SAA2B,CAAA;EAC3B;EACA;EACA;EACA,cAAuB;EACvB;EACA;;;EAGA,YAAqB;EACrB,KAAK,EAAE;EAEP,IAAI,QAAK;AACP,YAAQ,KAAK,SAAS,SAAS,MAAM;EACvC;EAEA,CAAC,uBAAO,IAAI,4BAA4B,CAAC,IAAC;AACxC,WAAO;MACL,UAAU;MACV,IAAI,KAAK;MACT,MAAM,KAAK;MACX,MAAM,KAAK,MAAM;MACjB,QAAQ,KAAK,SAAS;MACtB,OAAO,KAAK;MACZ,aAAa,KAAK,OAAO;MACzB,OAAO,KAAK;;EAEhB;EAEA,YACEK,OACA,QACA,UAA4B,CAAA,GAAE;AAE9B,SAAK,OAAOA;AAEZ,QAAIA;AAAM,WAAK,YAAY;AAC3B,SAAK,UAAU;AACf,SAAK,QAAQ,KAAK,UAAU,KAAK,QAAQ,QAAQ;AACjD,SAAK,WAAW,KAAK,UAAU,OAAO,UAAU,KAAK,MAAM;AAC3D,SAAK,QAAQ,KAAK,UAAU,OAAO,CAAA,IAAK,KAAK,MAAM;AACnD,QAAIA,UAAS,OAAO,CAAC,KAAK,MAAM;AAAa,WAAK,MAAM,KAAK,IAAI;AACjE,SAAK,eAAe,KAAK,UAAU,KAAK,QAAQ,OAAO,SAAS;EAClE;EAEA,IAAI,WAAQ;AAEV,QAAI,KAAK,cAAc;AAAW,aAAO,KAAK;AAE9C,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,OAAO,MAAM;AAAU;AAC3B,UAAI,EAAE,QAAQ,EAAE;AAAU,eAAQ,KAAK,YAAY;IACrD;AAEA,WAAO,KAAK;EACd;;EAGA,WAAQ;AACN,QAAI,KAAK,cAAc;AAAW,aAAO,KAAK;AAC9C,QAAI,CAAC,KAAK,MAAM;AACd,aAAQ,KAAK,YAAY,KAAK,OAAO,IAAI,OAAK,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;IAClE,OAAO;AACL,aAAQ,KAAK,YACX,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,OAAK,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAClE;EACF;EAEA,YAAS;AAEP,QAAI,SAAS,KAAK;AAAO,YAAM,IAAI,MAAM,0BAA0B;AACnE,QAAI,KAAK;AAAa,aAAO;AAI7B,SAAK,SAAQ;AACb,SAAK,cAAc;AACnB,QAAIC;AACJ,WAAQA,KAAI,KAAK,MAAM,IAAG,GAAK;AAC7B,UAAIA,GAAE,SAAS;AAAK;AAEpB,UAAI,IAAqBA;AACzB,UAAI,KAAK,EAAE;AACX,aAAO,IAAI;AACT,iBACM,IAAI,EAAE,eAAe,GACzB,CAAC,GAAG,QAAQ,IAAI,GAAG,OAAO,QAC1B,KACA;AACA,qBAAW,QAAQA,GAAE,QAAQ;AAE3B,gBAAI,OAAO,SAAS,UAAU;AAC5B,oBAAM,IAAI,MAAM,8BAA8B;YAChD;AAEA,iBAAK,OAAO,GAAG,OAAO,CAAC,CAAC;UAC1B;QACF;AACA,YAAI;AACJ,aAAK,EAAE;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAQ,OAAuB;AAC7B,eAAW,KAAK,OAAO;AACrB,UAAI,MAAM;AAAI;AAEd,UACE,OAAO,MAAM,YACb,EAAE,aAAa,MAAO,EAAE,YAAY,OACpC;AACA,cAAM,IAAI,MAAM,mBAAmB,CAAC;MACtC;AAEA,WAAK,OAAO,KAAK,CAAC;IACpB;EACF;EAEA,SAAM;AACJ,UAAM,MACJ,KAAK,SAAS,OACZ,KAAK,OACF,MAAK,EACL,IAAI,OAAM,OAAO,MAAM,WAAW,IAAI,EAAE,OAAM,CAAG,IACpD,CAAC,KAAK,MAAM,GAAG,KAAK,OAAO,IAAI,OAAM,EAAU,OAAM,CAAE,CAAC;AAC5D,QAAI,KAAK,QAAO,KAAM,CAAC,KAAK;AAAM,UAAI,QAAQ,CAAA,CAAE;AAChD,QACE,KAAK,MAAK,MACT,SAAS,KAAK,SACZ,KAAK,MAAM,eAAe,KAAK,SAAS,SAAS,MACpD;AACA,UAAI,KAAK,CAAA,CAAE;IACb;AACA,WAAO;EACT;EAEA,UAAO;AACL,QAAI,KAAK,UAAU;AAAM,aAAO;AAEhC,QAAI,CAAC,KAAK,SAAS,QAAO;AAAI,aAAO;AACrC,QAAI,KAAK,iBAAiB;AAAG,aAAO;AAEpC,UAAM,IAAI,KAAK;AACf,aAAS,IAAI,GAAG,IAAI,KAAK,cAAc,KAAK;AAC1C,YAAM,KAAK,EAAE,OAAO,CAAC;AACrB,UAAI,EAAE,cAAc,MAAO,GAAG,SAAS,MAAM;AAC3C,eAAO;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAK;AACH,QAAI,KAAK,UAAU;AAAM,aAAO;AAChC,QAAI,KAAK,SAAS,SAAS;AAAK,aAAO;AACvC,QAAI,CAAC,KAAK,SAAS,MAAK;AAAI,aAAO;AACnC,QAAI,CAAC,KAAK;AAAM,aAAO,KAAK,SAAS,MAAK;AAG1C,UAAM,KAAK,KAAK,UAAU,KAAK,QAAQ,OAAO,SAAS;AAEvD,WAAO,KAAK,iBAAiB,KAAK;EACpC;EAEA,OAAO,MAAkB;AACvB,QAAI,OAAO,SAAS;AAAU,WAAK,KAAK,IAAI;;AACvC,WAAK,KAAK,KAAK,MAAM,IAAI,CAAC;EACjC;EAEA,MAAM,QAAW;AACf,UAAM,IAAI,IAAI,GAAI,KAAK,MAAM,MAAM;AACnC,eAAW,KAAK,KAAK,QAAQ;AAC3B,QAAE,OAAO,CAAC;IACZ;AACA,WAAO;EACT;EAEA,OAAO,UACLC,MACA,KACA,KACA,KACA,UAAgB;AAEhB,UAAM,WAAW,IAAI,uBAAuB;AAC5C,QAAI,WAAW;AACf,QAAI,UAAU;AACd,QAAI,aAAa;AACjB,QAAI,WAAW;AACf,QAAI,IAAI,SAAS,MAAM;AAErB,UAAIC,KAAI;AACR,UAAIC,OAAM;AACV,aAAOD,KAAID,KAAI,QAAQ;AACrB,cAAM,IAAIA,KAAI,OAAOC,IAAG;AAGxB,YAAI,YAAY,MAAM,MAAM;AAC1B,qBAAW,CAAC;AACZ,UAAAC,QAAO;AACP;QACF;AAEA,YAAI,SAAS;AACX,cAAID,OAAM,aAAa,GAAG;AACxB,gBAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,yBAAW;YACb;UACF,WAAW,MAAM,OAAO,EAAEA,OAAM,aAAa,KAAK,WAAW;AAC3D,sBAAU;UACZ;AACA,UAAAC,QAAO;AACP;QACF,WAAW,MAAM,KAAK;AACpB,oBAAU;AACV,uBAAaD;AACb,qBAAW;AACX,UAAAC,QAAO;AACP;QACF;AAIA,cAAM,YACJ,CAAC,IAAI,SACL,cAAc,CAAC,KACfF,KAAI,OAAOC,EAAC,MAAM,OAClB,YAAY;AACd,YAAI,WAAW;AACb,cAAI,KAAKC,IAAG;AACZ,UAAAA,OAAM;AACN,gBAAMC,OAAM,IAAI,GAAI,GAAG,GAAG;AAC1B,UAAAF,KAAI,GAAI,UAAUD,MAAKG,MAAKF,IAAG,KAAK,WAAW,CAAC;AAChD,cAAI,KAAKE,IAAG;AACZ;QACF;AACA,QAAAD,QAAO;MACT;AACA,UAAI,KAAKA,IAAG;AACZ,aAAOD;IACT;AAIA,QAAI,IAAI,MAAM;AACd,QAAI,OAAO,IAAI,GAAI,MAAM,GAAG;AAC5B,UAAM,QAAe,CAAA;AACrB,QAAI,MAAM;AACV,WAAO,IAAID,KAAI,QAAQ;AACrB,YAAM,IAAIA,KAAI,OAAO,GAAG;AAGxB,UAAI,YAAY,MAAM,MAAM;AAC1B,mBAAW,CAAC;AACZ,eAAO;AACP;MACF;AAEA,UAAI,SAAS;AACX,YAAI,MAAM,aAAa,GAAG;AACxB,cAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,uBAAW;UACb;QACF,WAAW,MAAM,OAAO,EAAE,MAAM,aAAa,KAAK,WAAW;AAC3D,oBAAU;QACZ;AACA,eAAO;AACP;MACF,WAAW,MAAM,KAAK;AACpB,kBAAU;AACV,qBAAa;AACb,mBAAW;AACX,eAAO;AACP;MACF;AAEA,YAAM,YACJ,CAAC,IAAI,SACL,cAAc,CAAC,KACfA,KAAI,OAAO,CAAC,MAAM;OAEjB,YAAY,YAAa,OAAO,IAAI,cAAc,CAAC;AAEtD,UAAI,WAAW;AACb,cAAM,WAAW,OAAO,IAAI,cAAc,CAAC,IAAI,IAAI;AACnD,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAMG,OAAM,IAAI,GAAI,GAAG,IAAI;AAC3B,aAAK,KAAKA,IAAG;AACb,YAAI,GAAI,UAAUH,MAAKG,MAAK,GAAG,KAAK,WAAW,QAAQ;AACvD;MACF;AACA,UAAI,MAAM,KAAK;AACb,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAM,KAAK,IAAI;AACf,eAAO,IAAI,GAAI,MAAM,GAAG;AACxB;MACF;AACA,UAAI,MAAM,KAAK;AACb,YAAI,QAAQ,MAAM,IAAI,OAAO,WAAW,GAAG;AACzC,cAAI,YAAY;QAClB;AACA,aAAK,KAAK,GAAG;AACb,cAAM;AACN,YAAI,KAAK,GAAG,OAAO,IAAI;AACvB,eAAO;MACT;AACA,aAAO;IACT;AAKA,QAAI,OAAO;AACX,QAAI,YAAY;AAChB,QAAI,SAAS,CAACH,KAAI,UAAU,MAAM,CAAC,CAAC;AACpC,WAAO;EACT;EAEA,mBAAmB,OAAoB;AAIrC,WAAO,KAAK,UAAU,OAAO,oBAAoB;EACnD;EAEA,UACE,OACAI,OAAuC,aAAW;AAKlD,QACE,CAAC,SACD,OAAO,UAAU,YACjB,MAAM,SAAS,QACf,MAAM,OAAO,WAAW,KACxB,KAAK,SAAS,MACd;AACA,aAAO;IACT;AACA,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,QAAI,CAAC,MAAM,OAAO,OAAO,YAAY,GAAG,SAAS,MAAM;AACrD,aAAO;IACT;AACA,WAAQ,KAAqC,cAC3C,GAAG,MACHA,IAAG;EAEP;EACA,cACE,GACAA,OAAuC,gBAAc;AAErD,WAAO,CAAC,CAACA,KAAI,IAAI,KAAK,IAAmB,GAAG,SAAS,CAAgB;EACvE;EAEA,gBAEE,OAGA,OAAa;AAEb,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,UAAM,QAAQ,IAAI,GAAI,MAAM,IAAI,KAAK,OAAO;AAC5C,UAAM,OAAO,KAAK,EAAE;AACpB,OAAG,KAAK,KAAK;AACb,SAAK,OAAO,OAAO,KAAK;EAC1B;EAEA,OACE,OAGA,OAAa;AAEb,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,SAAK,OAAO,OAAO,OAAO,GAAG,GAAG,GAAG,MAAM;AACzC,eAAW,KAAK,GAAG,QAAQ;AACzB,UAAI,OAAO,MAAM;AAAU,UAAE,UAAU;IACzC;AACA,SAAK,YAAY;EACnB;EAEA,cAAc,GAAS;AACrB,UAAM,IAAI,SAAS,IAAI,KAAK,IAAmB;AAC/C,WAAO,CAAC,CAAE,GAAG,IAAI,CAAgB;EACnC;EAEA,UACE,OAAoB;AAKpB,QACE,CAAC,SACD,OAAO,UAAU,YACjB,MAAM,SAAS,QACf,MAAM,OAAO,WAAW,KACxB,KAAK,SAAS,QACd,KAAK,OAAO,WAAW,GACvB;AACA,aAAO;IACT;AACA,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,QAAI,CAAC,MAAM,OAAO,OAAO,YAAY,GAAG,SAAS,MAAM;AACrD,aAAO;IACT;AACA,WAAQ,KAAqC,cAAc,GAAG,IAAI;EACpE;EAEA,OAA0C,OAA2B;AACnE,UAAM,IAAI,SAAS,IAAI,KAAK,IAAmB;AAC/C,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,UAAMC,MAAK,GAAG,IAAI,GAAG,IAAI;AAEzB,QAAI,CAACA;AAAI,aAAO;AAEhB,SAAK,SAAS,GAAG;AACjB,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,OAAO,MAAM,UAAU;AACzB,UAAE,UAAU;MACd;IACF;AACA,SAAK,OAAOA;AACZ,SAAK,YAAY;AACjB,SAAK,YAAY;EACnB;EAEA,OAAO,SAAS,SAAiB,UAA4B,CAAA,GAAE;AAC7D,UAAM,MAAM,IAAI,GAAI,MAAM,QAAW,OAAO;AAC5C,OAAI,UAAU,SAAS,KAAK,GAAG,SAAS,CAAC;AACzC,WAAO;EACT;;;EAIA,cAAW;AAGT,QAAI,SAAS,KAAK;AAAO,aAAO,KAAK,MAAM,YAAW;AAEtD,UAAM,OAAO,KAAK,SAAQ;AAC1B,UAAM,CAACC,KAAI,MAAM,UAAU,KAAK,IAAI,KAAK,eAAc;AAIvD,UAAM,WACJ,YACA,KAAK,aACJ,KAAK,SAAS,UACb,CAAC,KAAK,SAAS,mBACf,KAAK,YAAW,MAAO,KAAK,YAAW;AAC3C,QAAI,CAAC,UAAU;AACb,aAAO;IACT;AAEA,UAAM,SAAS,KAAK,SAAS,SAAS,MAAM,OAAO,QAAQ,MAAM;AACjE,WAAO,OAAO,OAAO,IAAI,OAAO,IAAIA,GAAE,KAAK,KAAK,GAAG;MACjD,MAAMA;MACN,OAAO;KACR;EACH;EAEA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAuEA,eACE,UAAkB;AAElB,UAAM,MAAM,YAAY,CAAC,CAAC,KAAK,SAAS;AACxC,QAAI,KAAK,UAAU,MAAM;AACvB,WAAK,SAAQ;AACb,WAAK,UAAS;IAChB;AACA,QAAI,CAAC,aAAa,IAAI,GAAG;AACvB,YAAM,UACJ,KAAK,QAAO,KACZ,KAAK,MAAK,KACV,CAAC,KAAK,OAAO,KAAK,OAAK,OAAO,MAAM,QAAQ;AAC9C,YAAM,MAAM,KAAK,OACd,IAAI,OAAI;AACP,cAAM,CAACA,KAAIC,IAAG,UAAU,KAAK,IAC3B,OAAO,MAAM,WACX,GAAI,WAAW,GAAG,KAAK,WAAW,OAAO,IACzC,EAAE,eAAe,QAAQ;AAC7B,aAAK,YAAY,KAAK,aAAa;AACnC,aAAK,SAAS,KAAK,UAAU;AAC7B,eAAOD;MACT,CAAC,EACA,KAAK,EAAE;AAEV,UAAIE,SAAQ;AACZ,UAAI,KAAK,QAAO,GAAI;AAClB,YAAI,OAAO,KAAK,OAAO,CAAC,MAAM,UAAU;AAMtC,gBAAM,iBACJ,KAAK,OAAO,WAAW,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,CAAC;AACzD,cAAI,CAAC,gBAAgB;AACnB,kBAAM,MAAM;AAGZ,kBAAM;;cAEH,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;cAE5B,IAAI,WAAW,KAAK,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;cAE9C,IAAI,WAAW,QAAQ,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;;AAGpD,kBAAM,YAAY,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;AAE5D,YAAAA,SACE,aAAa,mBACX,YAAY,aACZ;UACN;QACF;MACF;AAGA,UAAI,MAAM;AACV,UACE,KAAK,MAAK,KACV,KAAK,MAAM,eACX,KAAK,SAAS,SAAS,KACvB;AACA,cAAM;MACR;AACA,YAAMC,SAAQD,SAAQ,MAAM;AAC5B,aAAO;QACLC;QACA,SAAS,GAAG;QACX,KAAK,YAAY,CAAC,CAAC,KAAK;QACzB,KAAK;;IAET;AAMA,UAAM,WAAW,KAAK,SAAS,OAAO,KAAK,SAAS;AAEpD,UAAM,QAAQ,KAAK,SAAS,MAAM,cAAc;AAChD,QAAI,OAAO,KAAK,eAAe,GAAG;AAElC,QAAI,KAAK,QAAO,KAAM,KAAK,MAAK,KAAM,CAAC,QAAQ,KAAK,SAAS,KAAK;AAGhE,YAAM,IAAI,KAAK,SAAQ;AACvB,YAAMC,MAAK;AACX,MAAAA,IAAG,SAAS,CAAC,CAAC;AACd,MAAAA,IAAG,OAAO;AACV,MAAAA,IAAG,YAAY;AACf,aAAO,CAAC,GAAG,SAAS,KAAK,SAAQ,CAAE,GAAG,OAAO,KAAK;IACpD;AAEA,QAAI,iBACF,CAAC,YAAY,YAAY,OAAO,CAAC,aAC/B,KACA,KAAK,eAAe,IAAI;AAC5B,QAAI,mBAAmB,MAAM;AAC3B,uBAAiB;IACnB;AACA,QAAI,gBAAgB;AAClB,aAAO,MAAM,IAAI,OAAO,cAAc;IACxC;AAGA,QAAI,QAAQ;AACZ,QAAI,KAAK,SAAS,OAAO,KAAK,WAAW;AACvC,eAAS,KAAK,QAAO,KAAM,CAAC,MAAM,aAAa,MAAM;IACvD,OAAO;AACL,YAAM,QACJ,KAAK,SAAS;;QAEZ,QACC,KAAK,QAAO,KAAM,CAAC,OAAO,CAAC,WAAW,aAAa,MACpD,OACA;UACA,KAAK,SAAS,MAAM,MACpB,KAAK,SAAS,MAAM,OACpB,KAAK,SAAS,OAAO,iBAAiB,MACtC,KAAK,SAAS,OAAO,iBAAiB,OACtC,IAAI,KAAK,IAAI;AACjB,cAAQ,QAAQ,OAAO;IACzB;AACA,WAAO;MACL;MACA,SAAS,IAAI;MACZ,KAAK,YAAY,CAAC,CAAC,KAAK;MACzB,KAAK;;EAET;EAEA,WAAQ;AACN,QAAI,CAAC,aAAa,IAAI,GAAG;AACvB,iBAAW,KAAK,KAAK,QAAQ;AAC3B,YAAI,OAAO,MAAM,UAAU;AACzB,YAAE,SAAQ;QACZ;MACF;IACF,OAAO;AAEL,UAAI,aAAa;AACjB,UAAI,OAAO;AACX,SAAG;AACD,eAAO;AACP,iBAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AAC3C,gBAAM,IAAI,KAAK,OAAO,CAAC;AACvB,cAAI,OAAO,MAAM,UAAU;AACzB,cAAE,SAAQ;AACV,gBAAI,KAAK,UAAU,CAAC,GAAG;AACrB,qBAAO;AACP,mBAAK,OAAO,GAAG,CAAC;YAClB,WAAW,KAAK,mBAAmB,CAAC,GAAG;AACrC,qBAAO;AACP,mBAAK,gBAAgB,GAAG,CAAC;YAC3B,WAAW,KAAK,UAAU,CAAC,GAAG;AAC5B,qBAAO;AACP,mBAAK,OAAO,CAAC;YACf;UACF;QACF;MACF,SAAS,CAAC,QAAQ,EAAE,aAAa;IACnC;AACA,SAAK,YAAY;EACnB;EAEA,eAAkD,KAAY;AAC5D,WAAO,KAAK,OACT,IAAI,OAAI;AAGP,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,IAAI,MAAM,8BAA8B;MAChD;AAGA,YAAM,CAACJ,KAAIC,IAAG,WAAW,KAAK,IAAI,EAAE,eAAe,GAAG;AACtD,WAAK,SAAS,KAAK,UAAU;AAC7B,aAAOD;IACT,CAAC,EACA,OAAO,OAAK,EAAE,KAAK,QAAO,KAAM,KAAK,MAAK,MAAO,CAAC,CAAC,CAAC,EACpD,KAAK,GAAG;EACb;EAEA,OAAO,WACL,MACA,UACA,UAAmB,OAAK;AAExB,QAAI,WAAW;AACf,QAAIA,MAAK;AACT,QAAI,QAAQ;AAEZ,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,IAAI,KAAK,OAAO,CAAC;AACvB,UAAI,UAAU;AACZ,mBAAW;AACX,QAAAA,QAAO,WAAW,IAAI,CAAC,IAAI,OAAO,MAAM;AACxC;MACF;AACA,UAAI,MAAM,KAAK;AACb,YAAI;AAAQ;AACZ,iBAAS;AACT,QAAAA,OAAM,WAAW,SAAS,KAAK,IAAI,IAAI,cAAc;AACrD,mBAAW;AACX;MACF,OAAO;AACL,iBAAS;MACX;AACA,UAAI,MAAM,MAAM;AACd,YAAI,MAAM,KAAK,SAAS,GAAG;AACzB,UAAAA,OAAM;QACR,OAAO;AACL,qBAAW;QACb;AACA;MACF;AACA,UAAI,MAAM,KAAK;AACb,cAAM,CAAC,KAAK,WAAW,UAAU,KAAK,IAAI,WAAW,MAAM,CAAC;AAC5D,YAAI,UAAU;AACZ,UAAAA,OAAM;AACN,kBAAQ,SAAS;AACjB,eAAK,WAAW;AAChB,qBAAW,YAAY;AACvB;QACF;MACF;AACA,UAAI,MAAM,KAAK;AACb,QAAAA,OAAM;AACN,mBAAW;AACX;MACF;AACA,MAAAA,OAAM,aAAa,CAAC;IACtB;AACA,WAAO,CAACA,KAAI,SAAS,IAAI,GAAG,CAAC,CAAC,UAAU,KAAK;EAC/C;;;;;AC77BK,IAAM,SAAS,CACpB,GACA,EACE,uBAAuB,OACvB,gBAAgB,MAAK,IAC+C,CAAA,MACpE;AAIF,MAAI,eAAe;AACjB,WAAO,uBACH,EAAE,QAAQ,gBAAgB,MAAM,IAChC,EAAE,QAAQ,kBAAkB,MAAM;EACxC;AACA,SAAO,uBACH,EAAE,QAAQ,cAAc,MAAM,IAC9B,EAAE,QAAQ,gBAAgB,MAAM;AACtC;;;ACyFO,IAAM,YAAY,CACvB,GACA,SACA,UAA4B,CAAA,MAC1B;AACF,qBAAmB,OAAO;AAG1B,MAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAO;EACT;AAEA,SAAO,IAAI,UAAU,SAAS,OAAO,EAAE,MAAM,CAAC;AAChD;AAGA,IAAM,eAAe;AACrB,IAAM,iBAAiB,CAACK,SAAgB,CAAC,MACvC,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAASA,IAAG;AACtC,IAAM,oBAAoB,CAACA,SAAgB,CAAC,MAAc,EAAE,SAASA,IAAG;AACxE,IAAM,uBAAuB,CAACA,SAAe;AAC3C,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAC1E;AACA,IAAM,0BAA0B,CAACA,SAAe;AAC9C,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,EAAE,YAAW,EAAG,SAASA,IAAG;AACpD;AACA,IAAM,gBAAgB;AACtB,IAAM,kBAAkB,CAAC,MACvB,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AACtC,IAAM,qBAAqB,CAAC,MAC1B,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC3C,IAAM,YAAY;AAClB,IAAM,cAAc,CAAC,MACnB,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,GAAG;AAC7C,IAAM,SAAS;AACf,IAAM,WAAW,CAAC,MAAc,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,GAAG;AACnE,IAAM,cAAc,CAAC,MACnB,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AACvC,IAAM,WAAW;AACjB,IAAM,mBAAmB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AAC5D,QAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;AAClC,MAAI,CAACA;AAAK,WAAO;AACjB,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAChE;AACA,IAAM,sBAAsB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AAC/D,QAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;AACrC,MAAI,CAACA;AAAK,WAAO;AACjB,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAChE;AACA,IAAM,gBAAgB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AACzD,QAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;AACrC,SAAO,CAACA,OAAM,QAAQ,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,SAASA,IAAG;AACjE;AACA,IAAM,aAAa,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AACtD,QAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;AAClC,SAAO,CAACA,OAAM,QAAQ,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,SAASA,IAAG;AACjE;AACA,IAAM,kBAAkB,CAAC,CAAC,EAAE,MAAuB;AACjD,QAAM,MAAM,GAAG;AACf,SAAO,CAAC,MAAc,EAAE,WAAW,OAAO,CAAC,EAAE,WAAW,GAAG;AAC7D;AACA,IAAM,qBAAqB,CAAC,CAAC,EAAE,MAAuB;AACpD,QAAM,MAAM,GAAG;AACf,SAAO,CAAC,MAAc,EAAE,WAAW,OAAO,MAAM,OAAO,MAAM;AAC/D;AAGA,IAAM,kBACJ,OAAO,YAAY,YAAY,UAC5B,OAAO,QAAQ,QAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACd,QAAQ,WACR;AAIJ,IAAM,OAAsC;EAC1C,OAAO,EAAE,KAAK,KAAI;EAClB,OAAO,EAAE,KAAK,IAAG;;AAIZ,IAAM,MACX,oBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC5D,UAAU,MAAM;AAET,IAAM,WAAW,uBAAO,aAAa;AAC5C,UAAU,WAAW;AAIrB,IAAMC,SAAQ;AAGd,IAAMC,QAAOD,SAAQ;AAKrB,IAAM,aAAa;AAInB,IAAM,eAAe;AAEd,IAAM,SACX,CAAC,SAAiB,UAA4B,CAAA,MAC9C,CAAC,MACC,UAAU,GAAG,SAAS,OAAO;AACjC,UAAU,SAAS;AAEnB,IAAM,MAAM,CAAC,GAAqB,IAAsB,CAAA,MACtD,OAAO,OAAO,CAAA,GAAI,GAAG,CAAC;AAEjB,IAAM,WAAW,CAAC,QAA2C;AAClE,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,CAAC,OAAO,KAAK,GAAG,EAAE,QAAQ;AAC/D,WAAO;EACT;AAEA,QAAM,OAAO;AAEb,QAAM,IAAI,CAAC,GAAW,SAAiB,UAA4B,CAAA,MACjE,KAAK,GAAG,SAAS,IAAI,KAAK,OAAO,CAAC;AAEpC,SAAO,OAAO,OAAO,GAAG;IACtB,WAAW,MAAM,kBAAkB,KAAK,UAAS;MAC/C,YAAY,SAAiB,UAA4B,CAAA,GAAE;AACzD,cAAM,SAAS,IAAI,KAAK,OAAO,CAAC;MAClC;MACA,OAAO,SAAS,SAAyB;AACvC,eAAO,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,EAAE;MAC1C;;IAGF,KAAK,MAAM,YAAY,KAAK,IAAG;;MAE7B,YACEE,OACA,QACA,UAA4B,CAAA,GAAE;AAE9B,cAAMA,OAAM,QAAQ,IAAI,KAAK,OAAO,CAAC;MACvC;;MAGA,OAAO,SAAS,SAAiB,UAA4B,CAAA,GAAE;AAC7D,eAAO,KAAK,IAAI,SAAS,SAAS,IAAI,KAAK,OAAO,CAAC;MACrD;;IAGF,UAAU,CACR,GACA,UAGI,CAAA,MACD,KAAK,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC;IAEvC,QAAQ,CACN,GACA,UAGI,CAAA,MACD,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,CAAC;IAErC,QAAQ,CAAC,SAAiB,UAA4B,CAAA,MACpD,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;IAExC,UAAU,CAAC,YACT,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC;IAEjC,QAAQ,CAAC,SAAiB,UAA4B,CAAA,MACpD,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;IAExC,aAAa,CAAC,SAAiB,UAA4B,CAAA,MACzD,KAAK,YAAY,SAAS,IAAI,KAAK,OAAO,CAAC;IAE7C,OAAO,CACL,MACA,SACA,UAA4B,CAAA,MACzB,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;IAEhD,KAAK,KAAK;IACV;GACD;AACH;AACA,UAAU,WAAW;AAYd,IAAM,cAAc,CACzB,SACA,UAA4B,CAAA,MAC1B;AACF,qBAAmB,OAAO;AAI1B,MAAI,QAAQ,WAAW,CAAC,mBAAmB,KAAK,OAAO,GAAG;AAExD,WAAO,CAAC,OAAO;EACjB;AAEA,SAAO,OAAO,SAAS,EAAE,KAAK,QAAQ,eAAc,CAAE;AACxD;AACA,UAAU,cAAc;AAcjB,IAAM,SAAS,CAAC,SAAiB,UAA4B,CAAA,MAClE,IAAI,UAAU,SAAS,OAAO,EAAE,OAAM;AACxC,UAAU,SAAS;AAEZ,IAAM,QAAQ,CACnB,MACA,SACA,UAA4B,CAAA,MAC1B;AACF,QAAM,KAAK,IAAI,UAAU,SAAS,OAAO;AACzC,SAAO,KAAK,OAAO,OAAK,GAAG,MAAM,CAAC,CAAC;AACnC,MAAI,GAAG,QAAQ,UAAU,CAAC,KAAK,QAAQ;AACrC,SAAK,KAAK,OAAO;EACnB;AACA,SAAO;AACT;AACA,UAAU,QAAQ;AAGlB,IAAM,YAAY;AAClB,IAAMC,gBAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAUxC,IAAO,YAAP,MAAgB;EACpB;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EAEA;EACA,YAAY,SAAiB,UAA4B,CAAA,GAAE;AACzD,uBAAmB,OAAO;AAE1B,cAAU,WAAW,CAAA;AACrB,SAAK,UAAU;AACf,SAAK,uBAAuB,QAAQ,wBAAwB;AAC5D,SAAK,UAAU;AACf,SAAK,WAAW,QAAQ,YAAY;AACpC,SAAK,YAAY,KAAK,aAAa;AAEnC,UAAM,MAAO;AACb,SAAK,uBACH,CAAC,CAAC,QAAQ,wBAAwB,QAAQ,GAAG,MAAM;AACrD,QAAI,KAAK,sBAAsB;AAC7B,WAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG;IAChD;AACA,SAAK,0BAA0B,CAAC,CAAC,QAAQ;AACzC,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,WAAW,CAAC,CAAC,QAAQ;AAC1B,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,UAAU,CAAC,CAAC,QAAQ;AACzB,SAAK,SAAS,CAAC,CAAC,KAAK,QAAQ;AAC7B,SAAK,qBACH,QAAQ,uBAAuB,SAC7B,QAAQ,qBACR,CAAC,EAAE,KAAK,aAAa,KAAK;AAE9B,SAAK,UAAU,CAAA;AACf,SAAK,YAAY,CAAA;AACjB,SAAK,MAAM,CAAA;AAGX,SAAK,KAAI;EACX;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,GAAG;AACrD,aAAO;IACT;AACA,eAAW,WAAW,KAAK,KAAK;AAC9B,iBAAW,QAAQ,SAAS;AAC1B,YAAI,OAAO,SAAS;AAAU,iBAAO;MACvC;IACF;AACA,WAAO;EACT;EAEA,SAASC,IAAQ;EAAG;EAEpB,OAAI;AACF,UAAM,UAAU,KAAK;AACrB,UAAM,UAAU,KAAK;AAGrB,QAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAK,UAAU;AACf;IACF;AAEA,QAAI,CAAC,SAAS;AACZ,WAAK,QAAQ;AACb;IACF;AAGA,SAAK,YAAW;AAGhB,SAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC;AAE9C,QAAI,QAAQ,OAAO;AACjB,WAAK,QAAQ,IAAI,SAAgB,QAAQ,MAAM,GAAG,IAAI;IACxD;AAEA,SAAK,MAAM,KAAK,SAAS,KAAK,OAAO;AAWrC,UAAM,eAAe,KAAK,QAAQ,IAAI,OAAK,KAAK,WAAW,CAAC,CAAC;AAC7D,SAAK,YAAY,KAAK,WAAW,YAAY;AAC7C,SAAK,MAAM,KAAK,SAAS,KAAK,SAAS;AAGvC,QAAIC,OAAM,KAAK,UAAU,IAAI,CAAC,GAAGD,IAAG,OAAM;AACxC,UAAI,KAAK,aAAa,KAAK,oBAAoB;AAE7C,cAAM,QACJ,EAAE,CAAC,MAAM,MACT,EAAE,CAAC,MAAM,OACR,EAAE,CAAC,MAAM,OAAO,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC,MACrC,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC;AACtB,cAAM,UAAU,WAAW,KAAK,EAAE,CAAC,CAAC;AACpC,YAAI,OAAO;AACT,iBAAO;YACL,GAAG,EAAE,MAAM,GAAG,CAAC;YACf,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,CAAAE,QAAM,KAAK,MAAMA,GAAE,CAAC;;QAE1C,WAAW,SAAS;AAClB,iBAAO,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,CAAAA,QAAM,KAAK,MAAMA,GAAE,CAAC,CAAC;QACvD;MACF;AACA,aAAO,EAAE,IAAI,CAAAA,QAAM,KAAK,MAAMA,GAAE,CAAC;IACnC,CAAC;AAED,SAAK,MAAM,KAAK,SAASD,IAAG;AAG5B,SAAK,MAAMA,KAAI,OACb,OAAK,EAAE,QAAQ,KAAK,MAAM,EAAE;AAI9B,QAAI,KAAK,WAAW;AAClB,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,cAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YACE,EAAE,CAAC,MAAM,MACT,EAAE,CAAC,MAAM,MACT,KAAK,UAAU,CAAC,EAAE,CAAC,MAAM,OACzB,OAAO,EAAE,CAAC,MAAM,YAChB,YAAY,KAAK,EAAE,CAAC,CAAC,GACrB;AACA,YAAE,CAAC,IAAI;QACT;MACF;IACF;AAEA,SAAK,MAAM,KAAK,SAAS,KAAK,GAAG;EACnC;;;;;;EAOA,WAAW,WAAqB;AAE9B,QAAI,KAAK,QAAQ,YAAY;AAC3B,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,iBAASE,KAAI,GAAGA,KAAI,UAAU,CAAC,EAAE,QAAQA,MAAK;AAC5C,cAAI,UAAU,CAAC,EAAEA,EAAC,MAAM,MAAM;AAC5B,sBAAU,CAAC,EAAEA,EAAC,IAAI;UACpB;QACF;MACF;IACF;AAEA,UAAM,EAAE,oBAAoB,EAAC,IAAK,KAAK;AAEvC,QAAI,qBAAqB,GAAG;AAE1B,kBAAY,KAAK,qBAAqB,SAAS;AAC/C,kBAAY,KAAK,sBAAsB,SAAS;IAClD,WAAW,qBAAqB,GAAG;AAEjC,kBAAY,KAAK,iBAAiB,SAAS;IAC7C,OAAO;AAEL,kBAAY,KAAK,0BAA0B,SAAS;IACtD;AAEA,WAAO;EACT;;EAGA,0BAA0B,WAAqB;AAC7C,WAAO,UAAU,IAAI,WAAQ;AAC3B,UAAIC,MAAa;AACjB,aAAO,QAAQA,MAAK,MAAM,QAAQ,MAAMA,MAAK,CAAC,IAAI;AAChD,YAAI,IAAIA;AACR,eAAO,MAAM,IAAI,CAAC,MAAM,MAAM;AAC5B;QACF;AACA,YAAI,MAAMA,KAAI;AACZ,gBAAM,OAAOA,KAAI,IAAIA,GAAE;QACzB;MACF;AACA,aAAO;IACT,CAAC;EACH;;EAGA,iBAAiB,WAAqB;AACpC,WAAO,UAAU,IAAI,WAAQ;AAC3B,cAAQ,MAAM,OAAO,CAACH,MAAe,SAAQ;AAC3C,cAAM,OAAOA,KAAIA,KAAI,SAAS,CAAC;AAC/B,YAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,iBAAOA;QACT;AACA,YAAI,SAAS,MAAM;AACjB,cAAI,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;AAC1D,YAAAA,KAAI,IAAG;AACP,mBAAOA;UACT;QACF;AACA,QAAAA,KAAI,KAAK,IAAI;AACb,eAAOA;MACT,GAAG,CAAA,CAAE;AACL,aAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;IACrC,CAAC;EACH;EAEA,qBAAqB,OAAwB;AAC3C,QAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,cAAQ,KAAK,WAAW,KAAK;IAC/B;AACA,QAAI,eAAwB;AAC5B,OAAG;AACD,qBAAe;AAEf,UAAI,CAAC,KAAK,yBAAyB;AACjC,iBAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,gBAAM,IAAI,MAAM,CAAC;AAEjB,cAAI,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,MAAM;AAAI;AAC5C,cAAI,MAAM,OAAO,MAAM,IAAI;AACzB,2BAAe;AACf,kBAAM,OAAO,GAAG,CAAC;AACjB;UACF;QACF;AACA,YACE,MAAM,CAAC,MAAM,OACb,MAAM,WAAW,MAChB,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,KAClC;AACA,yBAAe;AACf,gBAAM,IAAG;QACX;MACF;AAGA,UAAI,KAAa;AACjB,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,cAAM,IAAI,MAAM,KAAK,CAAC;AACtB,YAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC9C,yBAAe;AACf,gBAAM,OAAO,KAAK,GAAG,CAAC;AACtB,gBAAM;QACR;MACF;IACF,SAAS;AACT,WAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;EACrC;;;;;;;;;;;;;;;;;;;EAoBA,qBAAqB,WAAqB;AACxC,QAAI,eAAe;AACnB,OAAG;AACD,qBAAe;AAEf,eAAS,SAAS,WAAW;AAC3B,YAAIG,MAAa;AACjB,eAAO,QAAQA,MAAK,MAAM,QAAQ,MAAMA,MAAK,CAAC,IAAI;AAChD,cAAI,MAAcA;AAClB,iBAAO,MAAM,MAAM,CAAC,MAAM,MAAM;AAE9B;UACF;AAGA,cAAI,MAAMA,KAAI;AACZ,kBAAM,OAAOA,MAAK,GAAG,MAAMA,GAAE;UAC/B;AAEA,cAAI,OAAO,MAAMA,MAAK,CAAC;AACvB,gBAAM,IAAI,MAAMA,MAAK,CAAC;AACtB,gBAAM,KAAK,MAAMA,MAAK,CAAC;AACvB,cAAI,SAAS;AAAM;AACnB,cACE,CAAC,KACD,MAAM,OACN,MAAM,QACN,CAAC,MACD,OAAO,OACP,OAAO,MACP;AACA;UACF;AACA,yBAAe;AAEf,gBAAM,OAAOA,KAAI,CAAC;AAClB,gBAAM,QAAQ,MAAM,MAAM,CAAC;AAC3B,gBAAMA,GAAE,IAAI;AACZ,oBAAU,KAAK,KAAK;AACpB,UAAAA;QACF;AAGA,YAAI,CAAC,KAAK,yBAAyB;AACjC,mBAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,kBAAM,IAAI,MAAM,CAAC;AAEjB,gBAAI,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,MAAM;AAAI;AAC5C,gBAAI,MAAM,OAAO,MAAM,IAAI;AACzB,6BAAe;AACf,oBAAM,OAAO,GAAG,CAAC;AACjB;YACF;UACF;AACA,cACE,MAAM,CAAC,MAAM,OACb,MAAM,WAAW,MAChB,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,KAClC;AACA,2BAAe;AACf,kBAAM,IAAG;UACX;QACF;AAGA,YAAI,KAAa;AACjB,eAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,gBAAM,IAAI,MAAM,KAAK,CAAC;AACtB,cAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC9C,2BAAe;AACf,kBAAM,UAAU,OAAO,KAAK,MAAM,KAAK,CAAC,MAAM;AAC9C,kBAAM,QAAQ,UAAU,CAAC,GAAG,IAAI,CAAA;AAChC,kBAAM,OAAO,KAAK,GAAG,GAAG,GAAG,KAAK;AAChC,gBAAI,MAAM,WAAW;AAAG,oBAAM,KAAK,EAAE;AACrC,kBAAM;UACR;QACF;MACF;IACF,SAAS;AAET,WAAO;EACT;;;;;;;;EASA,sBAAsB,WAAqB;AACzC,aAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAC7C,eAASD,KAAI,IAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AAC7C,cAAM,UAAU,KAAK,WACnB,UAAU,CAAC,GACX,UAAUA,EAAC,GACX,CAAC,KAAK,uBAAuB;AAE/B,YAAI,SAAS;AACX,oBAAU,CAAC,IAAI,CAAA;AACf,oBAAUA,EAAC,IAAI;AACf;QACF;MACF;IACF;AACA,WAAO,UAAU,OAAO,CAAAC,QAAMA,IAAG,MAAM;EACzC;EAEA,WACE,GACA,GACA,eAAwB,OAAK;AAE7B,QAAIC,MAAK;AACT,QAAIC,MAAK;AACT,QAAI,SAAmB,CAAA;AACvB,QAAI,QAAgB;AACpB,WAAOD,MAAK,EAAE,UAAUC,MAAK,EAAE,QAAQ;AACrC,UAAI,EAAED,GAAE,MAAM,EAAEC,GAAE,GAAG;AACnB,eAAO,KAAK,UAAU,MAAM,EAAEA,GAAE,IAAI,EAAED,GAAE,CAAC;AACzC,QAAAA;AACA,QAAAC;MACF,WAAW,gBAAgB,EAAED,GAAE,MAAM,QAAQ,EAAEC,GAAE,MAAM,EAAED,MAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAEA,GAAE,CAAC;AACjB,QAAAA;MACF,WAAW,gBAAgB,EAAEC,GAAE,MAAM,QAAQ,EAAED,GAAE,MAAM,EAAEC,MAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAEA,GAAE,CAAC;AACjB,QAAAA;MACF,WACE,EAAED,GAAE,MAAM,OACV,EAAEC,GAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAEA,GAAE,EAAE,WAAW,GAAG,MAC1C,EAAEA,GAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAED,GAAE,CAAC;AACjB,QAAAA;AACA,QAAAC;MACF,WACE,EAAEA,GAAE,MAAM,OACV,EAAED,GAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAEA,GAAE,EAAE,WAAW,GAAG,MAC1C,EAAEA,GAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAEC,GAAE,CAAC;AACjB,QAAAD;AACA,QAAAC;MACF,OAAO;AACL,eAAO;MACT;IACF;AAGA,WAAO,EAAE,WAAW,EAAE,UAAU;EAClC;EAEA,cAAW;AACT,QAAI,KAAK;AAAU;AAEnB,UAAM,UAAU,KAAK;AACrB,QAAI,SAAS;AACb,QAAI,eAAe;AAEnB,aAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,QAAQ,OAAO,CAAC,MAAM,KAAK,KAAK;AACpE,eAAS,CAAC;AACV;IACF;AAEA,QAAI;AAAc,WAAK,UAAU,QAAQ,MAAM,YAAY;AAC3D,SAAK,SAAS;EAChB;;;;;;EAOA,SACE,MACA,SACA,UAAmB,OAAK;AAExB,QAAI,iBAAiB;AACrB,QAAI,oBAAoB;AAKxB,QAAI,KAAK,WAAW;AAClB,YAAM,YACJ,OAAO,KAAK,CAAC,MAAM,YAAY,YAAY,KAAK,KAAK,CAAC,CAAC;AACzD,YAAM,UACJ,CAAC,aACD,KAAK,CAAC,MAAM,MACZ,KAAK,CAAC,MAAM,MACZ,KAAK,CAAC,MAAM,OACZ,YAAY,KAAK,KAAK,CAAC,CAAC;AAE1B,YAAM,eACJ,OAAO,QAAQ,CAAC,MAAM,YAAY,YAAY,KAAK,QAAQ,CAAC,CAAC;AAC/D,YAAM,aACJ,CAAC,gBACD,QAAQ,CAAC,MAAM,MACf,QAAQ,CAAC,MAAM,MACf,QAAQ,CAAC,MAAM,OACf,OAAO,QAAQ,CAAC,MAAM,YACtB,YAAY,KAAK,QAAQ,CAAC,CAAC;AAE7B,YAAM,MACJ,UAAU,IACR,YAAY,IACZ;AACJ,YAAM,MACJ,aAAa,IACX,eAAe,IACf;AACJ,UAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;AACtD,cAAM,CAAC,IAAI,EAAE,IAAsB;UACjC,KAAK,GAAG;UACR,QAAQ,GAAG;;AAGb,YAAI,GAAG,YAAW,MAAO,GAAG,YAAW,GAAI;AACzC,kBAAQ,GAAG,IAAI;AACf,8BAAoB;AACpB,2BAAiB;QACnB;MACF;IACF;AAIA,UAAM,EAAE,oBAAoB,EAAC,IAAK,KAAK;AACvC,QAAI,qBAAqB,GAAG;AAC1B,aAAO,KAAK,qBAAqB,IAAI;IACvC;AAEA,QAAI,QAAQ,SAAS,QAAQ,GAAG;AAC9B,aAAO,KAAK,eACV,MACA,SACA,SACA,gBACA,iBAAiB;IAErB;AAEA,WAAO,KAAK,UACV,MACA,SACA,SACA,gBACA,iBAAiB;EAErB;EAEA,eACE,MACA,SACA,SACA,WACA,cAAoB;AAGpB,UAAM,UAAU,QAAQ,QAAQ,UAAU,YAAY;AACtD,UAAM,SAAS,QAAQ,YAAY,QAAQ;AAK3C,UAAM,CAAC,MAAM,MAAM,IAAI,IAAI,UAAU;MACnC,QAAQ,MAAM,cAAc,OAAO;MACnC,QAAQ,MAAM,UAAU,CAAC;MACzB,CAAA;QACE;MACF,QAAQ,MAAM,cAAc,OAAO;MACnC,QAAQ,MAAM,UAAU,GAAG,MAAM;MACjC,QAAQ,MAAM,SAAS,CAAC;;AAI1B,QAAI,KAAK,QAAQ;AACf,YAAM,WAAW,KAAK,MAAM,WAAW,YAAY,KAAK,MAAM;AAC9D,UAAI,CAAC,KAAK,UAAU,UAAU,MAAM,SAAS,GAAG,CAAC,GAAG;AAClD,eAAO;MACT;AACA,mBAAa,KAAK;AAClB,sBAAgB,KAAK;IACvB;AAKA,QAAI,gBAAwB;AAC5B,QAAI,KAAK,QAAQ;AAEf,UAAI,KAAK,SAAS,YAAY,KAAK;AAAQ,eAAO;AAGlD,UAAI,YAAY,KAAK,SAAS,KAAK;AACnC,UAAI,KAAK,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAAG;AACrD,wBAAgB,KAAK;MACvB,OAAO;AAIL,YACE,KAAK,KAAK,SAAS,CAAC,MAAM,MAC1B,YAAY,KAAK,WAAW,KAAK,QACjC;AACA,iBAAO;QACT;AACA;AACA,YAAI,CAAC,KAAK,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAAG;AACtD,iBAAO;QACT;AACA,wBAAgB,KAAK,SAAS;MAChC;IACF;AAUA,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAI,UAAU,CAAC,CAAC;AAChB,eAASC,KAAI,WAAWA,KAAI,KAAK,SAAS,eAAeA,MAAK;AAC5D,cAAM,IAAI,OAAO,KAAKA,EAAC,CAAC;AACxB,kBAAU;AACV,YACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,iBAAO;QACT;MACF;AAEA,aAAO,WAAW;IACpB;AAQA,UAAM,eAA0C,CAAC,CAAC,CAAA,GAAI,CAAC,CAAC;AACxD,QAAI,cAAuC,aAAa,CAAC;AACzD,QAAI,aAAa;AACjB,UAAM,iBAA2B,CAAC,CAAC;AACnC,eAAW,KAAK,MAAM;AACpB,UAAI,MAAM,UAAU;AAClB,uBAAe,KAAK,UAAU;AAC9B,sBAAc,CAAC,CAAA,GAAI,CAAC;AACpB,qBAAa,KAAK,WAAW;MAC/B,OAAO;AACL,oBAAY,CAAC,EAAE,KAAK,CAAC;AACrB;MACF;IACF;AACA,QAAI,IAAI,aAAa,SAAS;AAC9B,UAAM,aAAa,KAAK,SAAS;AACjC,eAAW,KAAK,cAAc;AAC5B,QAAE,CAAC,IAAI,cAAe,eAAe,GAAG,IAAe,EAAE,CAAC,EAAE;IAC9D;AAEA,WAAO,CAAC,CAAC,KAAK,2BACZ,MACA,cACA,WACA,GACA,SACA,GACA,CAAC,CAAC,aAAa;EAEnB;;;EAIA,2BACE,MAEA,cACA,WACA,WACA,SACA,eACA,SAAgB;AAWhB,UAAMC,MAAK,aAAa,SAAS;AACjC,QAAI,CAACA,KAAI;AAEP,eAAS,IAAI,WAAW,IAAI,KAAK,QAAQ,KAAK;AAC5C,kBAAU;AACV,cAAM,IAAI,KAAK,CAAC;AAChB,YACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,iBAAO;QACT;MACF;AACA,aAAO;IACT;AAGA,UAAM,CAAC,MAAM,KAAK,IAAIA;AACtB,WAAO,aAAa,OAAO;AACzB,YAAM,IAAI,KAAK,UACb,KAAK,MAAM,GAAG,YAAY,KAAK,MAAM,GACrC,MACA,SACA,WACA,CAAC;AAIH,UAAI,KAAK,gBAAgB,KAAK,sBAAsB;AAElD,cAAM,MAAM,KAAK,2BACf,MACA,cACA,YAAY,KAAK,QACjB,YAAY,GACZ,SACA,gBAAgB,GAChB,OAAO;AAET,YAAI,QAAQ,OAAO;AACjB,iBAAO;QACT;MACF;AACA,YAAM,IAAI,KAAK,SAAS;AACxB,UACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,eAAO;MACT;AAEA;IACF;AAEA,WAAO,WAAW;EACpB;EAEA,UACE,MACA,SACA,SACA,WACA,cAAoB;AAEpB,QAAIC;AACJ,QAAIC;AACJ,QAAI;AACJ,QAAI;AACJ,SACED,MAAK,WACHC,MAAK,cACL,KAAK,KAAK,QACV,KAAK,QAAQ,QACfD,MAAK,MAAMC,MAAK,IAChBD,OAAMC,OACN;AACA,WAAK,MAAM,eAAe;AAC1B,UAAI,IAAI,QAAQA,GAAE;AAClB,UAAI,IAAI,KAAKD,GAAE;AAEf,WAAK,MAAM,SAAS,GAAG,CAAC;AAKxB,UAAI,MAAM,SAAS,MAAM,UAAU;AACjC,eAAO;MACT;AAMA,UAAI;AACJ,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,MAAM;AACZ,aAAK,MAAM,gBAAgB,GAAG,GAAG,GAAG;MACtC,OAAO;AACL,cAAM,EAAE,KAAK,CAAC;AACd,aAAK,MAAM,iBAAiB,GAAG,GAAG,GAAG;MACvC;AAEA,UAAI,CAAC;AAAK,eAAO;IACnB;AAcA,QAAIA,QAAO,MAAMC,QAAO,IAAI;AAG1B,aAAO;IACT,WAAWD,QAAO,IAAI;AAIpB,aAAO;IACT,WAAWC,QAAO,IAAI;AAKpB,aAAOD,QAAO,KAAK,KAAK,KAAKA,GAAE,MAAM;IAGvC,OAAO;AAEL,YAAM,IAAI,MAAM,MAAM;IACxB;EAEF;EAEA,cAAW;AACT,WAAO,YAAY,KAAK,SAAS,KAAK,OAAO;EAC/C;EAEA,MAAM,SAAe;AACnB,uBAAmB,OAAO;AAE1B,UAAM,UAAU,KAAK;AAGrB,QAAI,YAAY;AAAM,aAAO;AAC7B,QAAI,YAAY;AAAI,aAAO;AAI3B,QAAI;AACJ,QAAI,WAA4C;AAChD,QAAK,IAAI,QAAQ,MAAM,MAAM,GAAI;AAC/B,iBAAW,QAAQ,MAAM,cAAc;IACzC,WAAY,IAAI,QAAQ,MAAM,YAAY,GAAI;AAC5C,kBACE,QAAQ,SACN,QAAQ,MACN,0BACA,uBACF,QAAQ,MAAM,oBACd,gBAAgB,EAAE,CAAC,CAAC;IAC1B,WAAY,IAAI,QAAQ,MAAM,QAAQ,GAAI;AACxC,kBACE,QAAQ,SACN,QAAQ,MACN,sBACA,mBACF,QAAQ,MAAM,gBACd,YAAY,CAAC;IACnB,WAAY,IAAI,QAAQ,MAAM,aAAa,GAAI;AAC7C,iBAAW,QAAQ,MAAM,qBAAqB;IAChD,WAAY,IAAI,QAAQ,MAAM,SAAS,GAAI;AACzC,iBAAW;IACb;AAEA,UAAME,MAAK,IAAI,SAAS,SAAS,KAAK,OAAO,EAAE,YAAW;AAC1D,QAAI,YAAY,OAAOA,QAAO,UAAU;AAEtC,cAAQ,eAAeA,KAAI,QAAQ,EAAE,OAAO,SAAQ,CAAE;IACxD;AACA,WAAOA;EACT;EAEA,SAAM;AACJ,QAAI,KAAK,UAAU,KAAK,WAAW;AAAO,aAAO,KAAK;AAQtD,UAAMV,OAAM,KAAK;AAEjB,QAAI,CAACA,KAAI,QAAQ;AACf,WAAK,SAAS;AACd,aAAO,KAAK;IACd;AACA,UAAM,UAAU,KAAK;AAErB,UAAM,UACJ,QAAQ,aAAaJ,QACnB,QAAQ,MAAM,aACd;AACJ,UAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAA,CAAE;AAQjD,QAAIc,MAAKV,KACN,IAAI,aAAU;AACb,YAAM,KAAmC,QAAQ,IAAI,OAAI;AACvD,YAAI,aAAa,QAAQ;AACvB,qBAAW,KAAK,EAAE,MAAM,MAAM,EAAE;AAAG,kBAAM,IAAI,CAAC;QAChD;AACA,eACE,OAAO,MAAM,WAAWF,cAAa,CAAC,IACpC,MAAM,WAAW,WACjB,EAAE;MAER,CAAC;AACD,SAAG,QAAQ,CAAC,GAAG,MAAK;AAClB,cAAM,OAAO,GAAG,IAAI,CAAC;AACrB,cAAM,OAAO,GAAG,IAAI,CAAC;AACrB,YAAI,MAAM,YAAY,SAAS,UAAU;AACvC;QACF;AACA,YAAI,SAAS,QAAW;AACtB,cAAI,SAAS,UAAa,SAAS,UAAU;AAC3C,eAAG,IAAI,CAAC,IAAI,YAAY,UAAU,UAAU;UAC9C,OAAO;AACL,eAAG,CAAC,IAAI;UACV;QACF,WAAW,SAAS,QAAW;AAC7B,aAAG,IAAI,CAAC,IAAI,OAAO,eAAe,UAAU;QAC9C,WAAW,SAAS,UAAU;AAC5B,aAAG,IAAI,CAAC,IAAI,OAAO,eAAe,UAAU,SAAS;AACrD,aAAG,IAAI,CAAC,IAAI;QACd;MACF,CAAC;AACD,YAAM,WAAW,GAAG,OAAO,OAAK,MAAM,QAAQ;AAK9C,UAAI,KAAK,WAAW,SAAS,UAAU,GAAG;AACxC,cAAM,WAAqB,CAAA;AAC3B,iBAAS,IAAI,GAAG,KAAK,SAAS,QAAQ,KAAK;AACzC,mBAAS,KAAK,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;QAC9C;AACA,eAAO,QAAQ,SAAS,KAAK,GAAG,IAAI;MACtC;AAEA,aAAO,SAAS,KAAK,GAAG;IAC1B,CAAC,EACA,KAAK,GAAG;AAIX,UAAM,CAAC,MAAM,KAAK,IAAIE,KAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAG7D,IAAAU,MAAK,MAAM,OAAOA,MAAK,QAAQ;AAG/B,QAAI,KAAK,SAAS;AAChB,MAAAA,MAAK,aAAa,OAAOA,IAAG,MAAM,GAAG,EAAE,IAAI,QAAQ;IACrD;AAGA,QAAI,KAAK;AAAQ,MAAAA,MAAK,SAASA,MAAK;AAEpC,QAAI;AACF,WAAK,SAAS,IAAI,OAAOA,KAAI,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC;IAElD,SAAS,IAAI;AAEX,WAAK,SAAS;IAChB;AAEA,WAAO,KAAK;EACd;EAEA,WAAW,GAAS;AAKlB,QAAI,KAAK,yBAAyB;AAChC,aAAO,EAAE,MAAM,GAAG;IACpB,WAAW,KAAK,aAAa,cAAc,KAAK,CAAC,GAAG;AAElD,aAAO,CAAC,IAAI,GAAG,EAAE,MAAM,KAAK,CAAC;IAC/B,OAAO;AACL,aAAO,EAAE,MAAM,KAAK;IACtB;EACF;EAEA,MAAM,GAAW,UAAU,KAAK,SAAO;AACrC,SAAK,MAAM,SAAS,GAAG,KAAK,OAAO;AAGnC,QAAI,KAAK,SAAS;AAChB,aAAO;IACT;AACA,QAAI,KAAK,OAAO;AACd,aAAO,MAAM;IACf;AAEA,QAAI,MAAM,OAAO,SAAS;AACxB,aAAO;IACT;AAEA,UAAM,UAAU,KAAK;AAGrB,QAAI,KAAK,WAAW;AAClB,UAAI,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG;IAC5B;AAGA,UAAM,KAAK,KAAK,WAAW,CAAC;AAC5B,SAAK,MAAM,KAAK,SAAS,SAAS,EAAE;AAOpC,UAAMV,OAAM,KAAK;AACjB,SAAK,MAAM,KAAK,SAAS,OAAOA,IAAG;AAGnC,QAAI,WAAmB,GAAG,GAAG,SAAS,CAAC;AACvC,QAAI,CAAC,UAAU;AACb,eAAS,IAAI,GAAG,SAAS,GAAG,CAAC,YAAY,KAAK,GAAG,KAAK;AACpD,mBAAW,GAAG,CAAC;MACjB;IACF;AAEA,aAAS,IAAI,GAAG,IAAIA,KAAI,QAAQ,KAAK;AACnC,YAAM,UAAUA,KAAI,CAAC;AACrB,UAAI,OAAO;AACX,UAAI,QAAQ,aAAa,QAAQ,WAAW,GAAG;AAC7C,eAAO,CAAC,QAAQ;MAClB;AACA,YAAM,MAAM,KAAK,SAAS,MAAM,SAAS,OAAO;AAChD,UAAI,KAAK;AACP,YAAI,QAAQ,YAAY;AACtB,iBAAO;QACT;AACA,eAAO,CAAC,KAAK;MACf;IACF;AAIA,QAAI,QAAQ,YAAY;AACtB,aAAO;IACT;AACA,WAAO,KAAK;EACd;EAEA,OAAO,SAAS,KAAqB;AACnC,WAAO,UAAU,SAAS,GAAG,EAAE;EACjC;;AAOF,UAAU,MAAM;AAChB,UAAU,YAAY;AACtB,UAAU,SAAS;AACnB,UAAU,WAAW;;;ATr7CrB,IAAM,gCAAgC;AAAA,EACpC;AAAA,EACA;AACF;AAMA,IAAM,gBAAgB,oBAAI,IAAsB;AAuBzC,SAAS,qBAAqBW,aAAwC;AAC3E,QAAM,gBAAgB,QAAQ,IAAI;AAClC,MAAI,eAAe;AACjB,UAAM,mBAAe,sBAAQA,WAAU;AACvC,UAAM,eAAW,sBAAQ,cAAc,aAAa;AACpD,UAAM,UAAM,uBAAS,cAAc,QAAQ;AAC3C,QAAI,IAAI,WAAW,IAAI,SAAK,sBAAQ,cAAc,GAAG,MAAM,UAAU;AACnE;AAAA,QACE;AAAA,QACA,uBAAuB,aAAa;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AACA,YAAI,uBAAW,QAAQ,GAAG;AACxB,sBAAgB,QAAQ,qDAAqD,QAAQ,EAAE;AACvF,aAAO;AAAA,IACT;AACA;AAAA,MACE;AAAA,MACA,iCAAiC,aAAa,6BAA6B,QAAQ;AAAA,IACrF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,cAAc,+BAA+B;AACtD,UAAM,eAAW,mBAAKA,aAAY,UAAU;AAC5C,YAAI,uBAAW,QAAQ,GAAG;AACxB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,uBAAuBA,aAA8B;AACnE,QAAM,SAAS,cAAc,IAAIA,WAAU;AAC3C,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,qBAAqBA,WAAU;AAClD,MAAI,CAAC,YAAY;AACf,kBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,WAAO,CAAC;AAAA,EACV;AAEA,MAAI;AACF,UAAM,cAAU,yBAAa,YAAY,MAAM;AAC/C,UAAM,SAAS,KAAS,OAAO;AAE/B,QAAI,CAAC,UAAU,CAAC,MAAM,QAAQ,OAAO,cAAc,CAAC,GAAG;AACrD,oBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,WAAW,OAAO,cAAc,EAAE;AAAA,MACtC,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS;AAAA,IAC1D;AAEA,QAAI,SAAS,SAAS,GAAG;AACvB;AAAA,QACE;AAAA,QACA,SAAS,SAAS,MAAM,+BAA+B,UAAU,KAAK,SAAS,KAAK,IAAI,CAAC;AAAA,MAC3F;AAAA,IACF;AAEA,kBAAc,IAAIA,aAAY,QAAQ;AACtC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,wCAAwC,UAAU,KAAK,OAAO,KAAK,CAAC,EAAE;AAC9F,kBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,WAAO,CAAC;AAAA,EACV;AACF;AAeO,SAAS,iBAAiB,cAAsB,UAA6B;AAClF,QAAM,eAAe,EAAE,KAAK,MAAM,sBAAsB,KAAK;AAE7D,aAAW,OAAO,UAAU;AAE1B,UAAM,UAAU,IAAI,QAAQ,QAAQ,EAAE;AAGtC,QAAI,UAAU,cAAc,SAAS,YAAY,GAAG;AAClD,aAAO;AAAA,IACT;AAIA,QAAI,UAAU,cAAc,GAAG,OAAO,OAAO,YAAY,GAAG;AAC1D,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAUO,SAAS,mBAAmB,eAAyB,UAA8B;AACxF,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,EACT;AACA,SAAO,cAAc,OAAO,OAAK,CAAC,iBAAiB,GAAG,QAAQ,CAAC;AACjE;;;ADxIO,SAAS,kBAAgC;AAC9C,QAAM,iBAAqB,oBAAS;AACpC,QAAM,qBAAyB,gBAAK;AACpC,QAAM,YAAY,eAAe;AACjC,QAAM,eAAe,YAAY,SAAS;AAE1C,SAAO;AAAA,IACL,UAAU;AAAA,IACV,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,gBAAwB;AACtC,SAAO,gBAAgB,EAAE,YAAY,YAAY;AACnD;AASO,SAAS,gBAAwB;AACtC,SAAO,gBAAgB,EAAE,YAAY,YAAY;AACnD;AAOO,SAAS,mBAA2B;AACzC,QAAMC,gBAAe,gBAAgB;AACrC,QAAM,gBAAwBA,cAAa,YAAY,eAAe;AAGtE,QAAM,aAAa,QAAQ,IAAI;AAC/B,MAAI,YAAY;AACd,UAAM,yBAAqB,0BAAQ,mBAAK,YAAY,aAAa,CAAC;AAClE,YAAI,uBAAW,kBAAkB,GAAG;AAClC,sBAAgB,QAAQ,6CAA6C,kBAAkB,EAAE;AACzF,aAAO;AAAA,IACT,OAAO;AACL;AAAA,QACE;AAAA,QACA,0BAA0B,UAAU,8CAA8C,kBAAkB;AAAA,MACtG;AAAA,IAEF;AAAA,EACF;AAGA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,MAAI;AACF,UAAM,oBAAgB,oCAAa,eAAe,CAAC,WAAW,eAAe,GAAG;AAAA,MAC9E,UAAU;AAAA,MACV,SAAS;AAAA;AAAA,MACT,OAAO;AAAA;AAAA,IACT,CAAC;AAOD,QAAI;AACF,YAAM,cAAc,KAAK,MAAM,aAAa;AAE5C,UACE,eACA,OAAO,YAAY,qBAAqB,YACxC,YAAY,kBACZ;AACA,cAAM,8BAA0B,0BAAQ,mBAAK,YAAY,kBAAkB,aAAa,CAAC;AACzF,gBAAI,uBAAW,uBAAuB,GAAG;AACvC;AAAA,YACE;AAAA,YACA,kEAAkE,uBAAuB;AAAA,UAC3F;AACA,iBAAO;AAAA,QACT;AACA;AAAA,UACE;AAAA,UACA,6DAA6D,YAAY,gBAAgB,mCAAmC,uBAAuB;AAAA,QACrJ;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,YAAY;AACnB;AAAA,QACE;AAAA,QACA,0DAA0D,OAAO,UAAU,CAAC,iBAAiB,aAAa;AAAA,MAC5G;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,eAAe,qFAAqF,OAAO,KAAK,CAAC;AACrH,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,SAAS,MAAM,SAAS,UAAU;AACpF,sBAAgB;AAAA,qBAAwB,aAAa;AAAA,IACvD;AACA,oBAAgB,QAAQ,YAAY;AAAA,EACtC;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,2BAA2BC,gBAA+B;AACxE,MAAI,kBAAkB,QAAQ,IAAI,oCAAoC;AAEtE,MAAI,iBAAiB;AACnB;AAAA,MACE;AAAA,MACA,+FAA+F,eAAe;AAAA,IAChH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,CAACA,gBAAe;AAClB;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,MAAI;AACF,0BAAkB;AAAA,MAChBA;AAAA,MACA,CAAC,WAAW,aAAa,uBAAuB;AAAA,MAChD,EAAE,OAAO,OAAO;AAAA;AAAA,IAClB,EACG,SAAS,EACT,KAAK;AACR,QAAI,iBAAiB;AACnB,sBAAgB,QAAQ,0CAA0C,eAAe,EAAE;AAAA,IACrF,OAAO;AACL;AAAA,QACE;AAAA,QACA,2DAA2DA,cAAa;AAAA,MAC1E;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd;AAAA,MACE;AAAA,MACA,oDAAoDA,cAAa,MAAM,OAAO,KAAK,CAAC;AAAA,IACtF;AACA,sBAAkB;AAAA,EACpB;AACA,SAAO;AACT;AAKO,SAAS,8BAAoC;AAClD,UAAQ,IAAI,2CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,6CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,sCAAsC,QAAQ,IAAI;AAC9D,UAAQ,IAAI,0CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,uCAAuC,QAAQ,IAAI;AAC/D,UAAQ,IAAI,iDACV,QAAQ,IAAI;AAChB;AAOO,SAAS,uBAAuB,iBAAiC;AACtE,MAAI,CAAC,gBAAiB,QAAO;AAC7B,QAAMD,gBAAe,gBAAgB;AACrC,QAAM,sBAA8BA,cAAa,YAAY,kBAAkB;AAC/E,aAAO,0BAAQ,mBAAK,iBAAiB,SAAS,mBAAmB,CAAC;AACpE;AAKO,SAAS,4BAAkC;AAChD,MAAI,iBAAiB;AAErB,MAAI,QAAQ,IAAI,oBAAoB;AAClC;AAAA,MACE;AAAA,MACA;AAAA,EACJ,QAAQ,IAAI,kBAAkB;AAAA,IAC5B;AAGA,UAAM,yBAAyB,CAAC,gBAAgB,gBAAgB;AAEhE,qBACE,OACA,QAAQ,IAAI,mBAAmB,MAAM,IAAI,EACtC;AAAA,MACC,UACE,KAAK,WAAW,SAAS,KACzB,CAAC,uBAAuB,KAAK,aAAW,KAAK,SAAS,OAAO,CAAC;AAAA,IAClE,EACC,KAAK,IAAI;AAAA,EAChB;AASA,QAAM,2BAA2B;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,0BAA0B;AAAA,IACxC;AAAA,EACF,EAAE,KAAK,IAAI;AAEX,UAAQ,IAAI,qBAAqB,2BAA2B;AAC5D,UAAQ,IAAI,wBAAwB;AAEpC,UAAQ,IAAI,uBAAuB;AACrC;AAUO,SAAS,8BAA8BE,aAA0B;AACtE,QAAM,WAAW,uBAAuBA,WAAU;AAClD,MAAI,SAAS,WAAW,GAAG;AACzB;AAAA,EACF;AAEA,QAAM,eAAe,SAAS,IAAI,OAAK,WAAW,CAAC,EAAE,EAAE,KAAK,IAAI;AAChE,QAAM,UAAU,QAAQ,IAAI,sBAAsB;AAClD,UAAQ,IAAI,qBAAqB,UAAU,OAAO;AAElD;AAAA,IACE;AAAA,IACA,WAAW,SAAS,MAAM;AAAA,EAC5B;AACF;AAeO,SAAS,4BAA4BA,aAA4C;AACtF,QAAMC,iBAA0B,CAAC;AACjC,QAAMH,gBAAe,gBAAgB;AAGrC,QAAMC,iBAAgB,iBAAiB;AACvC,MAAI,CAACA,gBAAe;AAClB,IAAAE,eAAc;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAGA,MAAI,CAAC,UAAUD,WAAU,GAAG;AAC1B,IAAAC,eAAc,KAAK,2BAA2BD,WAAU,mBAAmB;AAAA,EAC7E;AAGA,QAAM,kBAAkB,2BAA2BD,cAAa;AAChE,MAAI,CAAC,iBAAiB;AACpB,QAAIA,gBAAe;AAEjB,MAAAE,eAAc;AAAA,QACZ;AAAA,MACF;AAAA,IACF,OAAO;AAGL,MAAAA,eAAc;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,iBAAiB;AACnB,YAAQ,IAAI,mCAAmC;AAC/C,gCAA4B;AAAA,EAC9B;AAGA,QAAMC,uBAAsB,kBAAkB,uBAAuB,eAAe,IAAI;AAIxF,SAAO;AAAA,IACL,SAASD,eAAc,WAAW;AAAA,IAClC,eAAAA;AAAA,IACA,eAAAF;AAAA;AAAA,IACA;AAAA;AAAA,IACA,qBAAAG;AAAA,IACA,cAAAJ;AAAA,EACF;AACF;;;AFpWA,SAAS,qBAAqB,eAAmE;AAC/F,QAAM,QAAQ,cAAc,KAAK,EAAE,MAAM,KAAK;AAC9C,QAAM,aAAa,MAAM,CAAC;AAC1B,QAAM,WAAW,MAAM,MAAM,CAAC;AAC9B,SAAO,EAAE,YAAY,SAAS;AAChC;AAQA,SAAS,4BAA4B,SAA0BK,aAA8B;AAC3F,QAAM,0BAAsB,mBAAKA,aAAY,QAAQ,UAAU;AAG/D,QAAM,eAAe,QAAQ,SAC1B,OAAO,cAAQ,0BAAQ,mBAAKA,aAAY,IAAI,CAAC,MAAM,mBAAmB,EACtE,IAAI,cAAQ,uBAAS,IAAI,CAAC;AAE7B,MAAI,aAAa,SAAS,WAAW,GAAG;AAEtC,WAAO,CAAC,WAAW;AAAA,EACrB;AAGA,QAAM,iBAAiB,CAAC,MAAM,OAAO,KAAK;AAC1C,QAAM,kBAAkB,eAAe,OAAO,SAAO,cAAU,mBAAK,qBAAqB,GAAG,CAAC,CAAC;AAE9F,MAAI,gBAAgB,SAAS,GAAG;AAE9B,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,SAAS,GAAG;AAE3B,WAAO;AAAA,EACT;AAGA,SAAO,QAAQ,SAAS,IAAI,cAAQ,uBAAS,yBAAqB,mBAAKA,aAAY,IAAI,CAAC,CAAC;AAC3F;AAqBO,SAAS,iBACd,aACAA,aACA,YACA,UACA,YACA,YACsB;AACtB,MAAI;AACF,UAAM,0BAAsB,sBAAQ,WAAW;AAC/C,QAAI,CAAC,WAAW,mBAAmB,GAAG;AACpC,YAAM,IAAI,MAAM,sBAAsB,mBAAmB,mBAAmB;AAAA,IAC9E;AAGA,UAAM,aAAa,cAAc,YAAY,QAAQ;AACrD,UAAM,cAAc,aAAa,aAAa,UAAU,KAAK;AAG7D,UAAM,qBAAiB,mBAAKA,aAAY,UAAU;AAGlD,UAAM,eAAe,mBAAmB,gBAAgB,YAAY,QAAQ;AAG5E,QAAI,CAAC,cAAc,CAAC,cAAc,CAAC,WAAW,IAAI,UAAU,GAAG;AAC7D,YAAM,IAAI;AAAA,QACR,sBAAsB,UAAU;AAAA,MAClC;AAAA,IACF;AAEA,UAAM,UAAU,WAAW,IAAI,UAAU;AAGzC,WAAO,eAAeA,aAAY,YAAY,YAAY,cAAc,aAAa,OAAQ;AAAA,EAC/F,SAAS,OAAO;AACd,WAAO,EAAE,SAAS,OAAO,SAAS,OAAO,KAAK,EAAE;AAAA,EAClD;AACF;AAcA,SAAS,eACPA,aACA,YACA,YACA,cACA,aACA,SACsB;AACtB,kBAAgB,QAAQ,0BAA0B,UAAU,WAAW,WAAW,KAAK;AAGvF,QAAM,qBAAqB,4BAA4B,SAASA,WAAU;AAE1E,MAAI,mBAAmB,WAAW,GAAG;AACnC,UAAM,IAAI;AAAA,MACR,sBAAsB,UAAU;AAAA,IAClC;AAAA,EACF;AAEA,QAAM,yBAAqB,mBAAKA,aAAY,YAAY,gBAAgB;AAExE,QAAM,cAAc;AAAA,IAClB;AAAA,IACA,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,kBAAgB,QAAQ,kCAAkC,mBAAmB,KAAK,IAAI,CAAC,EAAE;AACzF;AAAA,IACE;AAAA,IACA,6CAA6C,UAAU,eAAe,UAAU,WAAW,KAAK,UAAU,WAAW,CAAC;AAAA,EACxH;AAGA,QAAM,EAAE,YAAY,SAAS,IAAI,qBAAqB,UAAU;AAChE,QAAM,UAAU,CAAC,GAAG,UAAU,GAAG,WAAW;AAE5C,QAAM,aAAS,iCAAU,YAAY,SAAS,YAAY;AAE1D,MAAI,OAAO,OAAO;AAChB,oBAAgB,SAAS,oBAAoB,OAAO,MAAM,OAAO,EAAE;AACnE,UAAM,IAAI,MAAM,iCAAiC,OAAO,MAAM,OAAO,EAAE;AAAA,EACzE;AAGA,MAAI,OAAO,UAAU,OAAO,OAAO,SAAS,GAAG;AAC7C,oBAAgB,QAAQ,sBAAsB,OAAO,OAAO,SAAS,CAAC,EAAE;AAAA,EAC1E;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,oBAAgB,SAAS,kCAAkC,OAAO,MAAM,EAAE;AAC1E;AAAA,MACE;AAAA,MACA,YAAY,UAAU,IAAI,YAAY,IAAI,SAAQ,IAAI,SAAS,GAAG,IAAI,IAAI,GAAG,MAAM,GAAI,EAAE,KAAK,GAAG,CAAC;AAAA,IACpG;AACA,oBAAgB,SAAS,WAAW,OAAO,QAAQ,SAAS,KAAK,WAAW,EAAE;AAC9E,oBAAgB,SAAS,WAAW,OAAO,QAAQ,SAAS,KAAK,WAAW,EAAE;AAC9E,UAAM,IAAI;AAAA,MACR,qCAAqC,UAAU;AAAA;AAAA;AAAA,EAC7C,OAAO,QAAQ,SAAS,KAAK,eAC/B;AAAA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,WAAW,kBAAkB,KAAK,CAAC,UAAU,kBAAkB,GAAG;AACrE,UAAM,IAAI;AAAA,MACR,gBAAgB,UAAU;AAAA,IAC5B;AAAA,EACF;AAGA,MAAI,UAAU,kBAAkB,GAAG;AACjC;AAAA,MACE;AAAA,MACA,oDAAoD,kBAAkB;AAAA,IACxE;AAEA,+BAA2B,kBAAkB;AAAA,EAC/C,OAAO;AACL,oBAAgB,QAAQ,wCAAwC,kBAAkB,EAAE;AAAA,EACtF;AAKA,+BAA6B,kBAAkB;AAE/C,SAAO;AAAA,IACL,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,mBAAmB;AAAA,IACnB,SAAS;AAAA,EACX;AACF;AAWA,SAAS,mBACP,gBACA,YACA,UACkB;AAGlB,QAAM,gBAAgB,eAAe,gBAAG,OAAO,gBAAG;AAClD,QAAM,eAAe;AACrB,QAAM,iBAAiB,WAAW,SAAS,aAAa,KAAK,WAAW,SAAS,YAAY;AAI7F,QAAM,WAAW,gBAAgB,EAAE,aAAa,CAAC;AAEjD,QAAM,eAAiC;AAAA,IACrC,KAAK;AAAA;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK,EAAE,GAAG,QAAQ,IAAI;AAAA,EACxB;AAGA,MAAI,YAAY,CAAC,gBAAgB;AAC/B,UAAM,eAAW,mBAAK,UAAU,cAAc;AAG9C,iBAAa,MAAM;AAAA,MACjB,GAAG,QAAQ;AAAA,MACX,WAAW,GAAG,QAAQ,GAAG,sBAAS,GAAG,QAAQ,IAAI,aAAa,EAAE;AAAA,MAChE,MAAM,OAAG,mBAAK,UAAU,MAAM,CAAC,GAAG,sBAAS,GAAG,QAAQ,IAAI,IAAI;AAAA;AAAA,MAE9D,mBAAmB;AAAA;AAAA,MAEnB,mBAAmB;AAAA;AAAA,MAEnB,UAAU;AAAA,IACZ;AAAA,EACF,WAAW,gBAAgB;AAGzB,UAAM,WAAW,EAAE,GAAG,QAAQ,IAAI;AAClC,WAAO,SAAS;AAChB,WAAO,SAAS;AAChB,WAAO,SAAS;AAChB,WAAO,SAAS;AAEhB,iBAAa,MAAM;AAAA,EACrB;AAEA,SAAO;AACT;;;AavSA,IAAAC,aAA6B;AAC7B,IAAAC,eAAiC;AAiB1B,SAAS,4BACdC,kBACgC;AAChC,QAAM,sBAAsB,oBAAI,IAA+B;AAE/D,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,UAAM,cAAiC,CAAC;AAExC,eAAW,QAAQ,QAAQ,kBAAkB;AAE3C,UAAI,KAAK,WAAW,gBAAgB;AAClC;AAAA,MACF;AAGA,YAAMC,oBAAmB,oBAAoB,MAAMD,iBAAgB,aAAa;AAEhF,UAAI,CAACC,kBAAiB,SAAS;AAC7B,oBAAY,KAAK,IAAI;AACrB;AAAA,UACE;AAAA,UACA,QAAQ,KAAK,EAAE,oBAAoBA,kBAAiB,cAAc,IAAIA,kBAAiB,iBAAiB,gCAAgC,KAAK,MAAM;AAAA,QACrJ;AAGA,YAAI,KAAK,WAAW,WAAW;AAC7B;AAAA,YACE;AAAA,YACA,QAAQ,KAAK,EAAE;AAAA,UACjB;AACA,eAAK,SAAS;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,0BAAoB,IAAI,YAAY,WAAW;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,oBAAoB,OAAO,GAAG;AAChC,UAAM,mBAAmB,MAAM,KAAK,oBAAoB,OAAO,CAAC,EAAE;AAAA,MAChE,CAAC,KAAK,UAAU,MAAM,MAAM;AAAA,MAC5B;AAAA,IACF;AACA;AAAA,MACE;AAAA,MACA,cAAc,gBAAgB,mCAAmC,oBAAoB,IAAI;AAAA,IAC3F;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,+BACdD,kBACA,eAC8B;AAC9B,MAAI,kBAAkB;AACtB,MAAI,cAAc;AAClB,MAAI,2BAA2B;AAG/B,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAC3C,YAAMC,oBAAmB,oBAAoB,MAAM,aAAa;AAChE,YAAM,UAAUA,kBAAiB;AAEjC,UAAI,SAAS;AACX,aAAK,SAAS;AACd;AAGA,YAAI,KAAK,WAAW,gBAAgB;AAClC;AAAA,QACF;AAAA,MACF,OAAO;AACL,aAAK,SAAS;AACd;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,EAAAD,iBAAgB,cAAc,yBAAyB;AACvD,EAAAA,iBAAgB,cAAc,qBAAqB;AAGnD,EAAAA,iBAAgB,YAAY,gCAAgC;AAC5D,EAAAA,iBAAgB,YAAY,2BAA2B;AAEvD,SAAO;AAAA,IACL,gBAAgB,kBAAkB;AAAA,IAClC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMO,SAAS,mBAAmB,UAA8C;AAC/E,QAAM,SAAqC;AAAA,IACzC,SAAS;AAAA,IACT;AAAA,IACA,QAAQ;AAAA,EACV;AAGA,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO,QAAQ;AACf,WAAO;AAAA,EACT;AAEA,SAAO,SAAS;AAGhB,MAAI,SAAS,SAAS,WAAW,KAAK,SAAS,SAAS,OAAO,GAAG;AAChE,QAAI;AACF,YAAM,cAAU,yBAAa,UAAU,MAAM;AAG7C,UAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,eAAO,QAAQ;AACf,eAAO;AAAA,MACT;AAGA,YAAM,SAAkB,KAAK,MAAM,OAAO;AAG1C,UAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,eAAO,QAAQ;AACf,eAAO;AAAA,MACT;AAEA,aAAO,eAAe;AACtB,aAAO,UAAU;AAAA,IACnB,SAAS,OAAO;AACd,aAAO,QAAQ,yBAAyB,OAAO,KAAK,CAAC;AACrD,aAAO;AAAA,IACT;AAAA,EACF,OAAO;AAEL,WAAO,UAAU;AAAA,EACnB;AAEA,SAAO;AACT;AAQO,SAAS,oBACd,MACAE,aACsB;AACtB,QAAM,cAA4C,CAAC;AAGnD,QAAM,iBAAiB,KAAK;AAC5B,QAAM,mBAAe,yBAAW,cAAc,IAC1C,qBACA,mBAAKA,aAAY,cAAc;AAEnC,QAAM,aAAa,mBAAmB,YAAY;AAClD,cAAY,KAAK,UAAU;AAE3B,QAAM,iBAAiB,YAAY,OAAO,OAAK,EAAE,OAAO,EAAE;AAC1D,QAAM,oBAAoB;AAC1B,QAAM,UAAU,mBAAmB,qBAAqB,oBAAoB;AAE5E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AChNA,IAAAC,wBAA6B;AAC7B,IAAAC,eAA8C;AAoBvC,SAAS,sBAAsB,UAAkBC,aAA4B;AAElF,MAAI,CAAC,YAAY,OAAO,aAAa,YAAY,CAACA,eAAc,OAAOA,gBAAe,UAAU;AAC9F,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,yBAAqB,sBAAQA,WAAU;AAI7C,UAAM,uBAAmB,yBAAW,QAAQ,QACxC,sBAAQ,QAAQ,QAChB,sBAAQ,oBAAoB,QAAQ;AAGxC,QAAI,qBAAqB,oBAAoB;AAC3C,aAAO;AAAA,IACT;AAEA,UAAM,mBAAe,uBAAS,oBAAoB,gBAAgB;AAIlE,QAAI,aAAa,WAAW,IAAI,GAAG;AACjC,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,QAAQ;AAEN,WAAO;AAAA,EACT;AACF;AAcA,SAAS,cACP,UACA,SACAC,gBACA,UACA,YACA,UACA,WACAD,aACS;AACT,QAAM,gBAAgBA,cAClB,sBAAsB,UAAUA,WAAU,QAC1C,sBAAQ,QAAQ;AAIpB,MAAI,eAAe;AACnB,MAAIA,eAAc,kBAAkB,OAAO,aAAaA,aAAY;AAClE,UAAM,yBAAqB,sBAAQA,WAAU;AAE7C,UAAM,uBAAmB,yBAAW,QAAQ,QACxC,sBAAQ,QAAQ,QAChB,sBAAQ,oBAAoB,QAAQ;AAGxC,QAAI,qBAAqB,oBAAoB;AAC3C,qBAAe,GAAG,OAAO;AAAA;AAAA,uBAA4B,QAAQ;AAAA,IAC/D;AAAA,EACF;AAEA,MAAI;AACF,4CAAaC,gBAAe;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe,QAAQ;AAAA,MACvB,iBAAiB,UAAU;AAAA,MAC3B,cAAc,QAAQ;AAAA,MACtB,sBAAsB,YAAY;AAAA,MAClC,eAAe,aAAa;AAAA,MAC5B;AAAA,MACA,GAAG,QAAQ,IAAI,qCAAqC,EAAE;AAAA,IACxD,CAAC;AACD,oBAAgB,QAAQ,SAAS,QAAQ,mBAAmB,SAAS,KAAK,QAAQ,EAAE;AACpF,WAAO;AAAA,EACT,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,iBAAiB,QAAQ,mBAAmB,SAAS,IAAI,QAAQ,MAAM,OAAO,GAAG,CAAC;AAAA,IACpF;AACA,WAAO;AAAA,EACT;AACF;AAUO,SAAS,wBACd,YACA,cACAA,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AAUO,SAAS,yBACd,aACA,cACAC,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,6BACdA,aACA,cACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,oCACdA,aACA,cACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,8BACdA,aACA,cACAC,gBACS;AAET,QAAM,cAAcD;AACpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AAUO,SAAS,iCACd,UACA,cACAC,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,2BACdA,aACA,SACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;;;ACzSA,IAAAE,wBAA6B;AAC7B,oBAA2B;AAC3B,IAAAC,aAAmE;AACnE,IAAAC,eAAuC;;;ACHvC,IAAAC,wBAAyB;AASzB,IAAM,yBAAyB,oBAAI,IAAsB;AAQzD,IAAM,aAAa;AAAA,EACjB,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,IAAI,UAAU;AACZ,UAAM,QAAQ,KAAK,OAAO,KAAK;AAC/B,WAAO,QAAQ,KAAM,KAAK,OAAO,QAAS,KAAK,QAAQ,CAAC,IAAI;AAAA,EAC9D;AACF;AAQO,SAAS,0BACd,YACA,cAIA;AAEA,MAAI,eAAe,YAAY,iBAAiB,UAAU;AACxD,WAAO,EAAE,cAAc,KAAK;AAAA,EAC9B;AAEA,QAAM,YAAY,qBAAqB,UAAU;AACjD,QAAM,cAAc,qBAAqB,YAAY;AAErD,MAAI,CAAC,aAAa,CAAC,aAAa;AAC9B,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS;AAAA,IACX;AAAA,EACF;AAIA,QAAM,qBAAqB,UAAU,UAAU,YAAY;AAC3D,QAAM,qBAAqB,UAAU,UAAU,YAAY;AAE3D,MAAI,CAAC,oBAAoB;AACvB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS,oCAAoC,UAAU,oBAAoB,YAAY;AAAA,IACzF;AAAA,EACF;AAEA,MAAI,CAAC,oBAAoB;AACvB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS,sCAAsC,UAAU,oBAAoB,YAAY;AAAA,IAC3F;AAAA,EACF;AAEA,SAAO,EAAE,cAAc,KAAK;AAC9B;AAQO,SAAS,gBAAgB,GAAoB,GAA4B;AAC9E,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAG5C,MAAI,EAAE,cAAc,CAAC,EAAE,WAAY,QAAO;AAC1C,MAAI,CAAC,EAAE,cAAc,EAAE,WAAY,QAAO;AAC1C,MAAI,EAAE,cAAc,EAAE,YAAY;AAChC,WAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,EAChD;AAEA,SAAO;AACT;AAQO,SAAS,yBACd,mBACA,iBACe;AACf,QAAM,iBAAiB,kBACpB,IAAI,CAAAC,OAAK,qBAAqBA,EAAC,CAAC,EAChC,OAAO,CAACA,OAA4BA,OAAM,IAAI;AAEjD,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,EACT;AAGA,QAAM,qBAAqB,eAAe,OAAO,CAAAA,OAAK,eAAeA,IAAG,eAAe,CAAC;AAExF,MAAI,mBAAmB,SAAS,GAAG;AAEjC,uBAAmB,KAAK,CAAC,GAAG,MAAM,gBAAgB,GAAG,CAAC,CAAC;AACvD,WAAO,mBAAmB,CAAC,EAAE;AAAA,EAC/B;AAIA,iBAAe,KAAK,CAAC,GAAG,MAAM,gBAAgB,GAAG,CAAC,CAAC;AACnD,SAAO,eAAe,CAAC,EAAE;AAC3B;AAQO,SAAS,qBAAqB,aAA0C;AAE7E,MAAI,uBAAuB,IAAI,WAAW,GAAG;AAC3C,eAAW;AACX,WAAO,uBAAuB,IAAI,WAAW;AAAA,EAC/C;AAGA,aAAW;AACX,MAAI;AACF,UAAM,aAAS,gCAAS,YAAY,WAAW,oBAAoB;AAAA,MACjE,UAAU;AAAA,MACV,SAAS;AAAA;AAAA,IACX,CAAC;AAED,UAAM,WAAoB,KAAK,MAAM,MAAM;AAC3C,QAAI,eAAyB,CAAC;AAE9B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,qBAAe,SAAS,OAAO,CAACA,OAAmB,OAAOA,OAAM,QAAQ;AAAA,IAC1E,WAAW,OAAO,aAAa,UAAU;AACvC,qBAAe,CAAC,QAAQ;AAAA,IAC1B;AAGA,2BAAuB,IAAI,aAAa,YAAY;AAEpD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,gCAAgC,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE;AAEvF,2BAAuB,IAAI,aAAa,CAAC,CAAC;AAC1C,WAAO,CAAC;AAAA,EACV;AACF;AAyBO,SAAS,qBAAqB,SAAyC;AAC5E,MAAI,YAAY,UAAU;AAExB,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,UAAU;AAAA,IACZ;AAAA,EACF;AAGA,QAAM,eAAe,QAAQ,QAAQ,cAAc,EAAE;AAGrD,QAAM,cAAc;AACpB,QAAMC,SAAQ,aAAa,MAAM,WAAW;AAE5C,MAAI,CAACA,QAAO;AACV,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,YAAYA,OAAM,CAAC;AAAA,IACnB,OAAOA,OAAM,CAAC;AAAA,IACd,UAAU;AAAA,EACZ;AACF;AAQA,SAAS,oBAAoB,iBAAyB,kBAAmC;AAEvF,MAAI,oBAAoB,oBAAoB,qBAAqB,UAAU;AACzE,WAAO;AAAA,EACT;AAEA,QAAM,iBAAiB,qBAAqB,eAAe;AAC3D,MAAI,CAAC,gBAAgB;AACnB,WAAO;AAAA,EACT;AAEA,SAAO,eAAe,gBAAgB,gBAAgB;AACxD;AAQO,SAASC,oBACd,YACA,cAQA;AACA,QAAM,cAAc,qBAAqB,UAAU;AACnD,QAAM,gBAAgB,qBAAqB,aAAa;AAExD,QAAM,qBAAqB,yBAAyB,aAAa,UAAU;AAC3E,QAAM,uBAAuB,yBAAyB,eAAe,YAAY;AAGjF,QAAM,gBACJ,uBAAuB,cAAe,eAAe,YAAY,uBAAuB;AAC1F,QAAM,kBACJ,yBAAyB,gBACxB,iBAAiB,YAAY,yBAAyB;AAGzD,QAAM,oBAAoB,qBACtB,oBAAoB,oBAAoB,UAAU,IAClD;AACJ,QAAM,sBAAsB,uBACxB,oBAAoB,sBAAsB,YAAY,IACtD;AAGJ,QAAM,aAAa,CAAC,qBAAqB,CAAC;AAE1C,MAAI;AAOJ,MAAI,sBAAsB,sBAAsB;AAC9C,UAAM,gBAAgB,0BAA0B,oBAAoB,oBAAoB;AAExF,UAAM,oBACJ,cACA,CAAC,iBACD,CAAC,mBACA,cAAc,WAAW,CAAC,cAAc;AAE3C,QAAI,cAAc,WAAW,mBAAmB;AAC9C,gBAAU,cAAc;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,eAAe,SAA0BC,QAAwB;AAC/E,MAAIA,WAAU,UAAU;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,qBAAqBA,MAAK;AAC/C,MAAI,CAAC,cAAc;AACjB,WAAO;AAAA,EACT;AAEA,MAAIA,OAAM,WAAW,GAAG,GAAG;AAEzB,WAAO,QAAQ,UAAU,aAAa,SAAS,gBAAgB,SAAS,YAAY,KAAK;AAAA,EAC3F,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WACE,QAAQ,UAAU,aAAa,SAC/B,QAAQ,UAAU,aAAa,SAC/B,gBAAgB,SAAS,YAAY,KAAK;AAAA,EAE9C,WAAWA,OAAM,WAAW,IAAI,GAAG;AAEjC,WAAO,gBAAgB,SAAS,YAAY,KAAK;AAAA,EACnD,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,EAClD,WAAWA,OAAM,WAAW,IAAI,GAAG;AAEjC,WAAO,gBAAgB,SAAS,YAAY,KAAK;AAAA,EACnD,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,EAClD,OAAO;AAEL,WAAO,gBAAgB,SAAS,YAAY,MAAM;AAAA,EACpD;AACF;;;AD7VA,IAAM,kBAAkB;AASxB,SAAS,4BACP,iBACA,gBACAC,gBACS;AACT,MAAI;AACF,4CAAaA,gBAAe;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,qCAAwC;AAAA,MACxC,sBAAsB,cAAc;AAAA,MACpC,mBAAe,sBAAQ,eAAe,CAAC;AAAA,MACvC;AAAA,MACA,GAAG,QAAQ,IAAI,qCAAqC,EAAE;AAAA,IACxD,CAAC;AACD,oBAAgB,QAAQ,qDAAqD,eAAe,EAAE;AAC9F,WAAO;AAAA,EACT,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,wCAAwC,eAAe,KAAK,OAAO,GAAG,CAAC;AAAA,IACzE;AACA,WAAO;AAAA,EACT;AACF;AAWO,SAAS,iBAAiB,UAAsC;AACrE,MAAI,cAAU,sBAAQ,QAAQ;AAI9B,SAAO,MAAM;AACX,UAAM,gBAAY,mBAAK,SAAS,QAAQ;AACxC,YAAI,uBAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AACA,UAAM,aAAS,sBAAQ,OAAO;AAC9B,QAAI,WAAW,SAAS;AAEtB,aAAO;AAAA,IACT;AACA,cAAU;AAAA,EACZ;AACF;AAWO,SAAS,iBAAiB,UAAkB,YAA0B;AAC3E,QAAM,YAAY,iBAAiB,UAAU;AAC7C,MAAI,CAAC,WAAW;AACd;AAAA,EACF;AAEA,QAAM,WAAO,mBAAK,UAAU,QAAQ;AACpC,MAAI;AACF,iCAAa,WAAW,IAAI;AAC5B,oBAAgB,QAAQ,uBAAuB,SAAS,yBAAyB,QAAQ,GAAG;AAAA,EAC9F,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,6CAA6C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IAC/F;AAAA,EACF;AACF;AASO,SAAS,yBACdC,kBACAC,aACAF,gBACqB;AAErB,MAAIC,iBAAgB,SAAS,SAAS,GAAG;AACvC,oBAAgB,QAAQ,oDAAoD;AAC5E;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO,oBAAI,IAAoB;AAAA,EACjC;AAGA,QAAM,yBAAyB,oCAAoCA,iBAAgB,QAAQ;AAE3F,MAAI,uBAAuB,WAAW,GAAG;AACvC;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO,oBAAI,IAAoB;AAAA,EACjC;AAEA;AAAA,IACE;AAAA,IACA,SAAS,uBAAuB,MAAM;AAAA,EACxC;AAGA,aAAW,eAAe,wBAAwB;AAChD,UAAM,EAAE,YAAY,cAAc,MAAM,oBAAoB,sBAAsB,WAAW,IAC3F;AACF,UAAM,mBAAmB,sBAAsB;AAC/C,UAAM,qBAAqB,wBAAwB;AACnD,UAAM,eAAe,aAAa,+BAA+B;AACjE,UAAM,cAAc,YAAY,oBAC5B,sBAAsB,YAAY,iBAAiB,KACnD;AAEJ;AAAA,MACE;AAAA,MACA,0BAA0B,KAAK,UAAU,GAAG,CAAC,CAAC,cAAc,gBAAgB,iBAAiB,kBAAkB,GAAG,WAAW,GAAG,YAAY;AAAA,IAC9I;AAAA,EACF;AAGA,QAAM,mBAAe,mBAAKC,aAAY,eAAe;AACrD;AAAA,IACE;AAAA,IACA,0BAA0B,eAAe,mCAAmC,YAAY;AAAA,EAC1F;AAEA,MAAI,KAAC,uBAAW,YAAY,GAAG;AAC7B,QAAI;AACF,gCAAU,cAAc,EAAE,WAAW,KAAK,CAAC;AAC3C,sBAAgB,QAAQ,4BAA4B,YAAY,EAAE;AAAA,IACpE,SAAS,KAAK;AACZ;AAAA,QACE;AAAA,QACA,qCAAqC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACvF;AACA,sBAAgB,QAAQ,kEAAkE;AAC1F,aAAO,oBAAI,IAAoB;AAAA,IACjC;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,mCAAmC,YAAY,EAAE;AAAA,EAC3E;AAGA,QAAMC,sBAAqB,oBAAI,IAAoB;AACnD,MAAI,0BAA0B;AAG9B,aAAW,eAAe,wBAAwB;AAChD,UAAM,EAAE,YAAY,cAAc,KAAK,IAAI;AAC3C,UAAM,EAAE,oBAAoB,qBAAqB,IAAI;AACrD,UAAM,eAAe,OAAO,IAAI;AAChC,UAAM,eAAW,mBAAK,cAAc,YAAY;AAEhD;AAAA,MACE;AAAA,MACA,qCAAqC,KAAK,UAAU,GAAG,CAAC,CAAC,wBAAwB,YAAY;AAAA,IAC/F;AAGA,QAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,UAAI;AACF,kCAAU,UAAU,EAAE,WAAW,KAAK,CAAC;AACvC,wBAAgB,QAAQ,+BAA+B,YAAY,EAAE;AAAA,MACvE,SAAS,KAAK;AACZ;AAAA,UACE;AAAA,UACA,oDAAoD,KAAK,UAAU,GAAG,CAAC,CAAC,KAAK,YAAY,MACvF,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,QACF;AACA;AAAA,MACF;AAGA,YAAM,mBAAmB,sBAAsB;AAC/C,YAAM,qBAAqB,wBAAwB;AAEnD,YAAM,YAAoC;AAAA,QACxC,YAAY;AAAA,QACZ,eAAe;AAAA,MACjB;AASA,UAAI,YAAY,mBAAmB;AACjC,kBAAU,kBAAkB,IAAI,YAAY;AAC5C;AAAA,UACE;AAAA,UACA,8BAA8B,YAAY,iBAAiB,6BAA6B,KAAK,UAAU,GAAG,CAAC,CAAC;AAAA,QAC9G;AAAA,MACF;AAEA,YAAM,cAAc;AAAA,QAClB,MAAM,uBAAuB,IAAI;AAAA,QACjC,SAAS;AAAA,QACT,SAAS;AAAA,QACT,cAAc;AAAA,MAChB;AAEA,UAAI;AACF,0CAAc,mBAAK,UAAU,cAAc,GAAG,KAAK,UAAU,aAAa,MAAM,CAAC,CAAC;AAClF,wBAAgB,QAAQ,+CAA+C,YAAY,EAAE;AAAA,MACvF,SAAS,KAAK;AACZ;AAAA,UACE;AAAA,UACA,oDAAoD,YAAY,KAC9D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AAGA,UAAM,kBAAkB,MAAM,KAAKF,iBAAgB,SAAS,OAAO,CAAC,EACjE,IAAI,aAAW,QAAQ,UAAU,EACjC,KAAK,gBAAc,kBAAc,2BAAW,mBAAKC,aAAY,YAAY,QAAQ,CAAC,CAAC;AACtF,QAAI,iBAAiB;AACnB,uBAAiB,cAAU,mBAAKA,aAAY,eAAe,CAAC;AAAA,IAC9D;AAIA,UAAM,wBAAwB,MAAM,KAAKD,iBAAgB,SAAS,OAAO,CAAC,EAAE;AAAA,MAC1E,aAAW,QAAQ;AAAA,IACrB,GAAG;AACH,UAAM,kBAAkB,4BACpB,mBAAKC,aAAY,uBAAuB,cAAc,IACtD;AAEJ,UAAM,iBAAiB;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACAF;AAAA,IACF;AAEA,QAAI,CAAC,gBAAgB;AACnB;AAAA,QACE;AAAA,QACA,0CAA0C,KAAK,UAAU,GAAG,CAAC,CAAC,sBAAsB,YAAY;AAAA,MAClG;AACA;AAAA,IACF;AAEA;AAGA,eAAW,CAAC,YAAY,OAAO,KAAK,MAAM,KAAKC,iBAAgB,SAAS,QAAQ,CAAC,GAAG;AAClF,UAAI,CAAC,QAAQ,aAAa;AACxB;AAAA,MACF;AACA,YAAM,eAAe,QAAQ,YAAY,eAAe,UAAU,KAAK;AACvE,YAAM,iBAAiB,QAAQ,YAAY,kBAAkB,aAAa,KAAK;AAC/E,YAAM,sBACJ,QAAQ,YAAY,eAAe,kBAAkB,KACrD,QAAQ,YAAY,kBAAkB,kBAAkB,KACxD;AAGF,YAAM,0BAA0BG,oBAAmB,cAAc,cAAc;AAC/E,YAAM,0BAA0B,wBAAwB,sBAAsB;AAC9E,YAAM,4BACJ,wBAAwB,wBAAwB;AAGlD,YAAM,8BAA8B,YAAY,sBAAsB,YAAY;AAClF,YAAM,gCACJ,YAAY,wBAAwB,YAAY;AAElD,UACE,4BAA4B,+BAC5B,8BAA8B,iCAC9B,wBAAwB,YAAY,mBACpC;AACA,QAAAD,oBAAmB,IAAI,YAAY,QAAQ;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAGA,MAAI,4BAA4B,GAAG;AACjC,oBAAgB,SAAS,gDAAgD;AACzE,QAAI,uBAAuB,SAAS,GAAG;AACrC;AAAA,QACE;AAAA,QACA,OAAO,uBAAuB,MAAM;AAAA,MACtC;AAAA,IACF;AAAA,EACF,WAAW,0BAA0B,uBAAuB,QAAQ;AAClE;AAAA,MACE;AAAA,MACA,0BAA0B,uBAAuB,WAAW,uBAAuB,MAAM;AAAA,IAC3F;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,qDAAqD;AAAA,EAC/E;AAGA,MAAIA,oBAAmB,OAAO,GAAG;AAC/B,oBAAgB,QAAQ,sCAAsC;AAC9D,eAAW,CAAC,YAAY,QAAQ,KAAK,MAAM,KAAKA,oBAAmB,QAAQ,CAAC,GAAG;AAC7E,YAAM,mBAAe,mBAAK,QAAQ,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AACxD,sBAAgB,QAAQ,KAAK,UAAU,WAAM,YAAY,EAAE;AAAA,IAC7D;AAAA,EACF,OAAO;AACL;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,SAAOA;AACT;AAOA,SAAS,oCACP,UAC4B;AAC5B,QAAM,eAAe,oBAAI,IAAsC;AAE/D,aAAW,WAAW,MAAM,KAAK,SAAS,OAAO,CAAC,GAAG;AACnD,QAAI,CAAC,QAAQ,aAAa;AACxB;AAAA,IACF;AAEA,UAAM,aAAa,QAAQ,YAAY,eAAe,UAAU,KAAK;AACrE,UAAM,eAAe,QAAQ,YAAY,kBAAkB,aAAa,KAAK;AAG7E,UAAM,oBACJ,QAAQ,YAAY,eAAe,kBAAkB,KACrD,QAAQ,YAAY,kBAAkB,kBAAkB,KACxD;AAGF;AAAA,MACE;AAAA,MACA,wDAAwD,QAAQ,UAAU,kCAAkC,UAAU,iBAAiB,YAAY;AAAA,IACrJ;AACA,UAAM,mBAAmBC,oBAAmB,YAAY,YAAY;AACpE,UAAM,EAAE,oBAAoB,sBAAsB,GAAG,KAAK,IAAI;AAG9D,QAAI,sBAAsB,sBAAsB;AAC9C,UAAI;AACJ,UAAI,iBAAiB,iBAAiB,iBAAiB,iBAAiB;AACtE,oBAAY;AAAA,MACd,WAAW,CAAC,iBAAiB,YAAY;AACvC,oBAAY;AAAA,MACd,OAAO;AACL,oBAAY;AAAA,MACd;AACA;AAAA,QACE;AAAA,QACA,yBAAyB,kBAAkB,iBAAiB,oBAAoB,GAAG,SAAS;AAAA,MAC9F;AAAA,IACF,OAAO;AACL;AAAA,QACE;AAAA,QACA,gDAAgD,UAAU,iBAAiB,YAAY;AAAA,MACzF;AAAA,IACF;AAGA,UAAM,mBAAmB,sBAAsB;AAC/C,UAAM,qBAAqB,wBAAwB;AACnD,UAAM,YAAY,oBACd,GAAG,gBAAgB,IAAI,kBAAkB,IAAI,iBAAiB,KAC9D,GAAG,gBAAgB,IAAI,kBAAkB;AAC7C,UAAM,WAAO,0BAAW,QAAQ,EAAE,OAAO,SAAS,EAAE,OAAO,KAAK;AAEhE,QAAI,CAAC,aAAa,IAAI,IAAI,GAAG;AAC3B,mBAAa,IAAI,MAAM;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,oBAAoB,sBAAsB;AAAA,QAC1C,sBAAsB,wBAAwB;AAAA,QAC9C,GAAG;AAAA,MACL,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,aAAa,OAAO,CAAC;AACzC;AAWA,SAAS,2BACP,UACA,aACA,cACA,iBACAJ,gBACS;AACT,QAAM,EAAE,oBAAoB,sBAAsB,YAAY,QAAQ,IAAI;AAG1E,QAAM,wBACJ,2BAAW,mBAAK,UAAU,gBAAgB,QAAQ,KAAK,CAAC,SACxD,2BAAW,mBAAK,UAAU,gBAAgB,QAAQ,QAAQ,CAAC;AAE7D,MAAI,mBAAmB;AACrB;AAAA,MACE;AAAA,MACA,0CAA0C,kBAAkB,oBAAoB,oBAAoB,SAAS,YAAY;AAAA,IAC3H;AAGA,QAAI,cAAc,WAAW,mBAAmBA,gBAAe;AAC7D,kCAA4B,iBAAiB,SAASA,cAAa;AAAA,IACrE;AAEA,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,sBAAsB,CAAC,sBAAsB;AAChD,oBAAgB,SAAS,2DAA2D;AACpF,WAAO;AAAA,EACT;AAGA;AAAA,IACE;AAAA,IACA,uBAAuB,kBAAkB,oBAAoB,oBAAoB,wBAAwB,YAAY;AAAA,EACvH;AAEA,MAAI,cAAc,SAAS;AACzB,oBAAgB,QAAQ,OAAO;AAAA,EACjC;AAEA,MAAI;AACF,4CAAa,cAAc,GAAG,CAAC,WAAW,WAAW,cAAc,WAAW,GAAG;AAAA,MAC/E,KAAK;AAAA,MACL,OAAO;AAAA,IACT,CAAC;AAGD,QAAI,cAAc,WAAW,mBAAmBA,gBAAe;AAC7D,kCAA4B,iBAAiB,SAASA,cAAa;AAAA,IACrE;AAEA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,UAAM,eAAe,8DAA8D,QAAQ,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAChJ,oBAAgB,SAAS,YAAY;AACrC,WAAO;AAAA,EACT;AACF;;;AE/fA,IAAAK,wBAA6B;AAC7B,IAAAC,gBAAqB;AAcd,SAAS,gCAAgC,SAA8B;AAE5E,MAAI,QAAQ,aAAa,2BAA2B;AAClD,WAAO;AAAA,EACT;AAQA,QAAM,iBAAiB,QAAQ,iBAAiB;AAAA,IAC9C,UAAQ,KAAK,WAAW,YAAY,CAAC,KAAK,WAAW;AAAA,EACvD;AAEA,SAAO,kBAAkB,QAAQ,gBAAgB;AACnD;AAWO,SAAS,2BACd,SACAC,aACkC;AAClC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,kBAAc,oBAAKA,aAAY,QAAQ,UAAU;AAEvD,QAAM,SAA2C;AAAA,IAC/C,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,UAAU,CAAC;AAAA,IACX,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AAEA,MAAI;AAEF,QAAI,CAAC,QAAQ,aAAa;AACxB,aAAO,QAAQ;AACf,aAAO;AAAA,IACT;AAGA;AAAA,MACE;AAAA,MACA,4CAA4C,QAAQ,UAAU;AAAA,IAChE;AAEA,QAAI;AACF;AAAA,QACE,cAAc;AAAA,QACd,CAAC,WAAW,oBAAoB,WAAW,cAAc,WAAW;AAAA,QACpE;AAAA,UACE,KAAK;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA;AAAA,QACX;AAAA,MACF;AAEA,aAAO,UAAU;AACjB;AAAA,QACE;AAAA,QACA,wDAAwD,QAAQ,UAAU;AAAA,MAC5E;AAAA,IACF,SAAS,WAAW;AAClB,UAAI,qBAAqB,SAAS,YAAY,aAAa,UAAU,WAAW,WAAW;AACzF,eAAO,WAAW;AAClB,eAAO,QAAQ;AAAA,MACjB,OAAO;AACL,eAAO,QAAQ,uBAAuB,OAAO,SAAS,CAAC;AAAA,MACzD;AAGA,aAAO,SAAS;AAAA,QACd,4EAA4E,OAAO,KAAK;AAAA,MAC1F;AACA,sBAAgB,QAAQ,OAAO,SAAS,CAAC,CAAC;AAAA,IAC5C;AAAA,EACF,SAAS,OAAO;AACd,WAAO,QAAQ,wCAAwC,OAAO,KAAK,CAAC;AACpE,oBAAgB,SAAS,OAAO,KAAK;AAAA,EACvC,UAAE;AACA,WAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EACnC;AAEA,SAAO;AACT;;;ACzFA,SAAS,wCACPC,kBACAC,gBACAC,aACM;AACN,aAAW,WAAWF,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAE3C,UAAI,KAAK,WAAW,UAAU;AAI5B,cAAM,sBAAsB,KAAK,WAAW,kBAAkB,CAAC,KAAK;AAEpE,YAAI,qBAAqB;AACvB,qBAAW,cAAc,KAAK,aAAa;AACzC;AAAA,cACE;AAAA,cACA,KAAK,gBAAgB;AAAA,cACrBC;AAAA,cACAC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,yBACdF,kBACAC,gBACqC;AACrC,QAAM,YAAY,KAAK,IAAI;AAC3B,MAAI,kCAAkC;AACtC,MAAI,gCAAgC;AACpC,MAAI,4BAA4B;AAChC,MAAI,0BAA0B;AAE9B,QAAM,SAA8C;AAAA,IAClD,SAAS;AAAA,IACT,qBAAqB,CAAC;AAAA,IACtB,0BAA0B;AAAA,IAC1B,wBAAwB;AAAA,IACxB,oBAAoB;AAAA,IACpB,8CAA8C,CAAC;AAAA,IAC/C,0CAA0C,CAAC;AAAA,IAC3C,iBAAiB;AAAA,IACjB,kCAAkC;AAAA,IAClC,4BAA4B;AAAA,EAC9B;AAEA,MAAI;AAEF,oBAAgB,QAAQ,sCAAsC;AAC9D,UAAM,sBAAsB,4BAA4BD,gBAAe;AAEvE,QAAI,oBAAoB,SAAS,GAAG;AAClC,sBAAgB,QAAQ,sDAAsD;AAC9E,aAAO;AAAA,IACT;AAGA,WAAO,2BAA2B,MAAM,KAAK,oBAAoB,OAAO,CAAC,EAAE;AAAA,MACzE,CAAC,KAAK,UAAU,MAAM,MAAM;AAAA,MAC5B;AAAA,IACF;AACA,IAAAA,iBAAgB,YAAY,2BAA2B,OAAO;AAG9D,sCAAkC,KAAK,IAAI;AAC3C,eAAW,CAAC,YAAY,WAAW,KAAK,qBAAqB;AAC3D,YAAM,UAAUA,iBAAgB,SAAS,IAAI,UAAU;AACvD,UAAI,CAAC,SAAS;AACZ;AAAA,MACF;AAEA,UAAI,gCAAgC,OAAO,GAAG;AAC5C,YAAI;AACF,gBAAM,gBAAgB,2BAA2B,SAASA,iBAAgB,aAAa;AAGvF,kBAAQ,gBAAgB;AAAA,YACtB,2BAA2B;AAAA,YAC3B,qBAAqB,YAAY;AAAA,YACjC,cAAc;AAAA,YACd,oBAAoB,CAAC;AAAA,UACvB;AAEA,cAAI,cAAc,SAAS;AACzB,oBAAQ,YAAY,4BAA4B;AAChD,mBAAO,6CAA6C,KAAK,UAAU;AACnE,YAAAA,iBAAgB,YAAY,6BAA6B,IAAI,UAAU;AAAA,UACzE,OAAO;AACL,oBAAQ,YAAY,qBAAqB;AAAA,cACvC,GAAI,QAAQ,YAAY,sBAAsB,CAAC;AAAA,cAC/C,cAAc,SAAS;AAAA,YACzB;AACA,mBAAO,yCAAyC,KAAK,UAAU;AAAA,UACjE;AAEA,cAAI,cAAc,SAAS,SAAS,GAAG;AACrC,uBAAW,WAAW,cAAc,UAAU;AAC5C,cAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,gBACnC,OAAO;AAAA,gBACP,SAAS;AAAA,gBACT,WAAW,oBAAI,KAAK;AAAA,gBACpB,SAAS;AAAA,cACX,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF,SAAS,OAAO;AACd,gBAAM,eAAe,mDAAmD,UAAU,KAAK,OAAO,KAAK,CAAC;AACpG,0BAAgB,SAAS,YAAY;AAErC,UAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,YACnC,OAAO;AAAA,YACP,SAAS;AAAA,YACT,WAAW,oBAAI,KAAK;AAAA,UACtB,CAAC;AAED,iBAAO,yCAAyC,KAAK,UAAU;AAAA,QACjE;AAAA,MACF;AAEA,MAAAA,iBAAgB,YAAY,kCAAkC,IAAI,UAAU;AAAA,IAC9E;AAEA,oCAAgC,KAAK,IAAI;AACzC,WAAO,mCACL,gCAAgC;AAGlC,oBAAgB,QAAQ,yCAAyC;AACjE,gCAA4B,KAAK,IAAI;AAErC,eAAW,CAAC,YAAY,WAAW,KAAK,qBAAqB;AAC3D,YAAM,UAAUA,iBAAgB,SAAS,IAAI,UAAU;AACvD,UAAI,CAAC,SAAS;AACZ;AAAA,MACF;AAEA,YAAM,uBAAuB;AAAA,QAC3B;AAAA,QACA;AAAA,QACAA;AAAA,MACF;AAEA,aAAO,oBAAoB,KAAK,UAAU;AAC1C,aAAO,0BAA0B,qBAAqB;AACtD,aAAO,sBAAsB,qBAAqB;AAGlD,UAAI,QAAQ,aAAa;AACvB,gBAAQ,YAAY,eAAe,qBAAqB,aAAa;AAAA,MACvE;AAAA,IACF;AAEA,8BAA0B,KAAK,IAAI;AACnC,WAAO,6BAA6B,0BAA0B;AAG9D,mCAA+BA,kBAAiBA,iBAAgB,aAAa;AAG7E,0CAAsCA,kBAAiB,MAAM;AAG7D;AAAA,MACEA;AAAA,MACAC;AAAA,MACAD,iBAAgB;AAAA,IAClB;AAEA,WAAO,UAAU,OAAO,yBAAyB,KAAK,OAAO,6BAA6B;AAAA,EAC5F,SAAS,OAAO;AACd,UAAM,eAAe,+BAA+B,OAAO,KAAK,CAAC;AACjE,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,IACtB,CAAC;AAED,WAAO,UAAU;AAAA,EACnB,UAAE;AACA,WAAO,kBAAkB,KAAK,IAAI,IAAI;AAAA,EACxC;AAEA,SAAO;AACT;AAWA,SAAS,qBACP,MACA,cACA,YACAA,kBACoB;AACpB,QAAM,YAAY,oBAAI,KAAK;AAC3B,QAAM,YAAY,GAAG,KAAK,EAAE,UAAU,UAAU,QAAQ,CAAC;AAGzD,QAAM,mBAAmB,aAAa;AAEtC,QAAM,UAA8B;AAAA,IAClC,IAAI;AAAA,IACJ,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,QAAQ;AAAA,MACN,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,oBAAoB,KAAK,YAAY,CAAC;AAE5C,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACAA,iBAAgB;AAAA,MAChB;AAAA,MACA;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM,KAAKA,iBAAgB,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,UACnE;AAAA,UACA;AAAA,YACE,UAAU,MAAM;AAAA,YAChB,oBAAoB,MAAM;AAAA,YAC1B,oBAAoB,MAAM;AAAA,YAC1B,YAAY,MAAM;AAAA,YAClB,cAAc,MAAM;AAAA,YACpB,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,UACrB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,KAAK;AAAA,IACP;AAEA,YAAQ,SAAS;AAAA,MACf,GAAG;AAAA,MACH,WAAW;AAAA,IACb;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,QAAQ;AAAA,MACd,SAAS,OAAO,KAAK;AAAA,MACrB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,gCACP,cACA,SACAA,kBAC4B;AAC5B,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAAqC;AAAA,IACzC,YAAY,QAAQ;AAAA,IACpB,cAAc,CAAC;AAAA,IACf,mBAAmB;AAAA,IACnB,eAAe;AAAA,IACf,2BAA2B,QAAQ,QAAQ,aAAa,yBAAyB;AAAA,IACjF,qBAAqB;AAAA,IACrB,aAAa,CAAC;AAAA,EAChB;AAEA;AAAA,IACE;AAAA,IACA,YAAY,aAAa,MAAM,wBAAwB,QAAQ,UAAU,UAAU,OAAO,4BAA4B,SAAS,SAAS;AAAA,EAC1I;AAEA,aAAW,QAAQ,cAAc;AAC/B,QAAI;AAEF,WAAK,YAAY;AAAA,QACf,gBAAgB;AAAA,QAChB,aAAa;AAAA,QACb,2BAA2B,OAAO;AAAA,QAClC,gBAAgB,oBAAI,KAAK;AAAA,MAC3B;AAGA,YAAM,eAAe;AAAA,QACnB;AAAA,QACA,KAAK;AAAA,QACL,QAAQ;AAAA,QACRA;AAAA,MACF;AAEA,WAAK,UAAU,eAAe;AAC9B,WAAK,SAAS,KAAK,YAAY;AAC/B,aAAO,aAAa,KAAK,IAAI;AAE7B,UAAI,aAAa,OAAO,SAAS;AAC/B,aAAK,SAAS;AACd,eAAO;AACP,wBAAgB,QAAQ,6BAA6B,KAAK,EAAE,EAAE;AAAA,MAChE,OAAO;AACL,aAAK,SAAS;AACd,aAAK,eAAe,aAAa,OAAO,WAAW;AACnD,eAAO;AACP,eAAO,YAAY,KAAK,KAAK,YAAY;AACzC,wBAAgB,QAAQ,yBAAyB,KAAK,EAAE,KAAK,KAAK,YAAY,EAAE;AAAA,MAClF;AAAA,IACF,SAAS,OAAO;AACd,YAAM,eAAe,wBAAwB,KAAK,EAAE,KAAK,OAAO,KAAK,CAAC;AACtE,aAAO,YAAY,KAAK,YAAY;AACpC,aAAO;AACP,WAAK,SAAS;AACd,WAAK,eAAe;AACpB,sBAAgB,SAAS,YAAY;AAAA,IACvC;AAAA,EACF;AAEA,SAAO,sBAAsB,KAAK,IAAI,IAAI;AAE1C;AAAA,IACE;AAAA,IACA,yCAAyC,QAAQ,UAAU,KAAK,OAAO,iBAAiB,gBAAgB,OAAO,aAAa;AAAA,EAC9H;AAEA,SAAO;AACT;AAOA,SAAS,sCACPA,kBACA,cACM;AAGN,EAAAA,iBAAgB,YAAY,qBAC1B,aAAa,yBAAyB,aAAa;AACvD;;;ACvXA,SAAS,mBACP,MACA,YACA,UACAG,kBACoB;AACpB,QAAM,YAAY,oBAAI,KAAK;AAC3B,QAAM,YAAY,GAAG,KAAK,EAAE,IAAI,UAAU,QAAQ,CAAC;AAEnD,QAAM,UAA8B;AAAA,IAClC,IAAI;AAAA,IACJ;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,QAAQ;AAAA,MACN,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAI;AAGF,UAAM,oBAAoB,KAAK,YAAY,CAAC;AAE5C,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACAA,iBAAgB;AAAA,MAChB;AAAA,MACA;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM,KAAKA,iBAAgB,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,UACnE;AAAA,UACA;AAAA,YACE,UAAU,MAAM;AAAA,YAChB,oBAAoB,MAAM;AAAA,YAC1B,oBAAoB,MAAM;AAAA,YAC1B,YAAY,MAAM;AAAA,YAClB,cAAc,MAAM;AAAA,YACpB,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,YACnB,mBAAmB,MAAM;AAAA,UAC3B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,KAAK;AAAA,IACP;AAEA,UAAM,UAAU,oBAAI,KAAK;AACzB,YAAQ,SAAS;AAAA,MACf,GAAG;AAAA,MACH,WAAW;AAAA,MACX,YAAY,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,MAClD,aAAa;AAAA,MACb;AAAA,IACF;AAEA,QAAI,kBAAkB,WAAW,kBAAkB,YAAY;AAC7D,MAAAA,iBAAgB,cAAc;AAAA,IAChC;AAAA,EACF,SAAS,OAAO;AACd,UAAM,UAAU,oBAAI,KAAK;AACzB,YAAQ,QAAQ;AAAA,MACd,SAAS,OAAO,KAAK;AAAA,MACrB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD;AACA,YAAQ,OAAO,YAAY;AAC3B,YAAQ,OAAO,aAAa,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,EACpE;AAEA,OAAK,SAAS,KAAK,OAAO;AAC1B,SAAO;AACT;AAKA,SAAS,sBACPC,OACA,aACA,oBACA,YACiB;AAEjB,QAAM,wBAA6C;AAAA,IACjD,YAAY;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,iBAAiB;AAAA,EACnB;AAEA,QAAM,sBAA2C;AAAA,IAC/C,YAAY;AAAA,IACZ,MAAM,CAAC,KAAK;AAAA,IACZ,iBAAiB;AAAA,EACnB;AAEA,SAAO;AAAA,IACL,IAAI,GAAGA,KAAI,IAAI,UAAU,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAAA,IAClF,MAAAA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,CAAC;AAAA,IACX,cAAc,CAAC;AAAA,IACf,gBAAgB;AAAA,IAChB,cAAc;AAAA,EAChB;AACF;AAEA,SAAS,wBACP,YACA,UACmB;AACnB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,sBAAsB;AAAA,MACpB,cAAc;AAAA;AAAA,IAChB;AAAA,IACA,kBAAkB;AAAA,EACpB;AACF;AAKA,SAAS,uBACP,MACA,SACAD,kBACA,gBACM;AACN,OAAK,SAAS;AAEd,QAAM,SAAS,QAAQ;AACvB,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,MAAM,kDAAkD,QAAQ,UAAU,EAAE;AAAA,EACxF;AAEA,QAAM,qBAAqB;AAAA,IACzB;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,IACPA;AAAA,EACF;AAEA,MAAI,mBAAmB,OAAO,SAAS;AACrC,SAAK,SAAS;AACd;AAAA,EACF;AAGA,QAAM,YAAY,mBAAmB,QACjC,IAAI,MAAM,mBAAmB,MAAM,OAAO,IAC1C,IAAI,MAAM,oBAAoB;AAElC,OAAK,SAAS;AACd,OAAK,eAAe,WAAW,WAAW;AAK1C,kBAAgB,SAAS,+BAA+B,KAAK,EAAE,KAAK,KAAK,YAAY,EAAE;AACzF;AAQA,SAAS,wBAAwBA,kBAAqCE,gBAA6B;AACjG,kBAAgB,QAAQ,oDAAoD;AAE5E,EAAAF,iBAAgB,eAAe;AAC/B,QAAM,uBAAuB,oBAAI,KAAK;AAGtC,QAAM,WAAkE,CAAC;AAEzE,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAC3C,eAAS,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,IACjC;AAAA,EACF;AAIA,kBAAgB,QAAQ,aAAa,SAAS,MAAM,yBAAyB;AAC7E,aAAW,EAAE,MAAM,QAAQ,KAAK,UAAU;AACxC,QAAI;AACF,6BAAuB,MAAM,SAASA,kBAAiBE,cAAa;AAAA,IACtE,SAAS,OAAO;AACd,YAAM,eAAe,sCAAsC,KAAK,EAAE,KAAK,OAAO,KAAK,CAAC;AACpF,sBAAgB,SAAS,YAAY;AAErC,MAAAF,iBAAgB,OAAO,SAAS,KAAK;AAAA,QACnC,OAAO;AAAA,QACP,SAAS;AAAA,QACT,WAAW,oBAAI,KAAK;AAAA,QACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,MAChD,CAAC;AAED,WAAK,SAAS;AACd,WAAK,eAAe;AACpB,MAAAA,iBAAgB,cAAc;AAAA,IAChC;AAAA,EACF;AAGA,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,UAAM,oBAAoB,QAAQ,iBAAiB;AAAA,MACjD,UAAQ,KAAK,WAAW,aAAa,KAAK,WAAW;AAAA,IACvD;AAEA,QAAI,mBAAmB;AACrB,YAAM,iBAAiB,QAAQ,iBAAiB,KAAK,UAAQ,KAAK,WAAW,QAAQ;AACrF,cAAQ,SAAS,iBAAiB,WAAW;AAC7C,cAAQ,WAAW,uBAAuB,oBAAI,KAAK;AAAA,IACrD;AAAA,EACF;AAEA,QAAM,qBAAqB,oBAAI,KAAK;AACpC,EAAAA,iBAAgB,cAAc,YAAY,wBACxC,mBAAmB,QAAQ,IAAI,qBAAqB,QAAQ;AAE9D;AAAA,IACE;AAAA,IACA,6CAA6CA,iBAAgB,cAAc,sBAAsB,aAAaA,iBAAgB,cAAc,kBAAkB;AAAA,EAChK;AACF;AAeO,SAAS,uBACdA,kBACAG,qBACAD,gBACM;AACN,MAAI;AAEF,yBAAqBF,kBAAiBG,mBAAkB;AACxD,4BAAwBH,kBAAiBE,cAAa;AAGtD,mCAA+BF,kBAAiBA,iBAAgB,aAAa;AAG7E,oBAAgB,QAAQ,uCAAuC;AAC/D,UAAM,eAAe,yBAAyBA,kBAAiBE,cAAa;AAG5E,mCAA+BF,kBAAiBA,iBAAgB,aAAa;AAG7E,QAAI,aAAa,2BAA2B,GAAG;AAC7C;AAAA,QACE;AAAA,QACA,0BAA0B,aAAa,wBAAwB,mBAAmB,aAAa,sBAAsB,gBAAgB,aAAa,kBAAkB;AAAA,MACtK;AAAA,IACF,OAAO;AACL,sBAAgB,QAAQ,gDAAgD;AAAA,IAC1E;AAGA,UAAM,cACJA,iBAAgB,cAAc,qBAAqB,KACnDA,iBAAgB,OAAO,SAAS,SAAS;AAE3C,IAAAA,iBAAgB,cAAc,iBAAiB,CAAC;AAChD,IAAAA,iBAAgB,eAAe,cAAc,WAAW;AAGxD,UAAM,eAAe,qBAAqBA,gBAAe;AACzD,oBAAgB,QAAQ,wDAAwD,YAAY;AAAA,EAC9F,SAAS,OAAO;AACd,UAAM,eAAe,qCAAqC,OAAO,KAAK,CAAC;AACvE,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,MACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD,CAAC;AAED,IAAAA,iBAAgB,eAAe;AAC/B,IAAAA,iBAAgB,cAAc,iBAAiB;AAE/C,UAAM;AAAA,EACR;AACF;AAGA,SAAS,qBACPA,kBACAG,qBACM;AACN,kBAAgB,QAAQ,gDAAgD;AAExE,EAAAH,iBAAgB,eAAe;AAE/B,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,QAAI;AACF,YAAM,WAAWG,oBAAmB,IAAI,UAAU;AAGlD,YAAM,WAAW;AAAA,QACf;AAAA,QACAH,iBAAgB;AAAA,QAChB;AAAA,QACAA;AAAA,MACF;AAGA,YAAM,aAAa,oBAAoB,UAAUA,iBAAgB,aAAa;AAG9E,YAAM,oBAAoB,wBAAwB,YAAY,QAAQ;AAEtE,cAAQ,4BAA4B;AAGpC,YAAM,OAAO;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR;AAAA,MACF;AAGA,WAAK,iBAAiB,SAAS;AAC/B,WAAK,eAAe,SAAS;AAE7B,cAAQ,mBAAmB,CAAC,IAAI;AAEhC,cAAQ,SAAS;AACjB,cAAQ,WAAW,qBAAqB,oBAAI,KAAK;AAEjD;AAAA,QACE;AAAA,QACA,WAAW,QAAQ,iBAAiB,MAAM,oCAAoC,UAAU;AAAA,MAC1F;AAAA,IACF,SAAS,OAAO;AACd,YAAM,eAAe,0CAA0C,UAAU,KAAK,OAAO,KAAK,CAAC;AAC3F,sBAAgB,SAAS,YAAY;AAErC,MAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,QACnC,OAAO;AAAA,QACP,SAAS;AAAA,QACT,WAAW,oBAAI,KAAK;AAAA,QACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,MAChD,CAAC;AAED,cAAQ,SAAS;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,aAAa,MAAM,KAAKA,iBAAgB,SAAS,OAAO,CAAC,EAAE;AAAA,IAC/D,CAAC,KAAK,YAAY,MAAM,QAAQ,iBAAiB;AAAA,IACjD;AAAA,EACF;AAEA,EAAAA,iBAAgB,cAAc,wBAAwB;AAEtD,kBAAgB,QAAQ,gDAAgD,UAAU,EAAE;AACtF;;;ACzYA,IAAAI,gBAAyB;;;ACEzB,IAAAC,wBAA0B;AAC1B,IAAAC,gBAAgC;AAShC,IAAM,yBAAyB;AAG/B,IAAM,sBAAsB;AAyCrB,SAAS,sBAAsB,SAA8B;AAClE,MAAI,CAAC,QAAQ,aAAa;AACxB,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,QAAQ,YAAY,eAAe,mBAAmB,MAAM;AAC3E,QAAM,YAAY,QAAQ,YAAY,kBAAkB,mBAAmB,MAAM;AAEjF,SAAO,UAAU;AACnB;AAcO,SAAS,cACd,SACAC,aACA,UACkB;AAClB,QAAM,qBAAiB,oBAAKA,aAAY,QAAQ,UAAU;AAC1D,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAA2B;AAAA,IAC/B,SAAS;AAAA,IACT,YAAY,QAAQ;AAAA,IACpB,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AAEA,MAAI;AAGF,UAAM,YAAsB,CAAC;AAC7B,QAAI,UAAU;AACZ,gBAAU,SAAK,oBAAK,UAAU,cAAc,CAAC;AAAA,IAC/C;AACA,cAAU,SAAK,oBAAK,gBAAgB,cAAc,CAAC;AAEnD,UAAM,MAA0C;AAAA,MAC9C,GAAG,QAAQ;AAAA,MACX,WAAW,UAAU,KAAK,uBAAS;AAAA,IACrC;AAEA;AAAA,MACE;AAAA,MACA,WAAW,mBAAmB,iBAAiB,QAAQ,UAAU;AAAA,IACnE;AAEA,UAAM,kBAAc,iCAAU,cAAc,GAAG,CAAC,SAAS,mBAAmB,GAAG;AAAA,MAC7E,KAAK;AAAA,MACL;AAAA,MACA,OAAO;AAAA,MACP,SAAS;AAAA,IACX,CAAC;AAED,WAAO,aAAa,KAAK,IAAI,IAAI;AAGjC,QAAI,YAAY,WAAW,aAAa,YAAY,WAAW,WAAW;AACxE,aAAO,WAAW;AAClB,aAAO,QAAQ,GAAG,mBAAmB,oBAAoB,sBAAsB,mBAAmB,QAAQ,UAAU;AACpH,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,QAAI,YAAY,OAAO;AACrB,aAAO,QAAQ,GAAG,mBAAmB,iCAAiC,QAAQ,UAAU,MAAM,OAAO,YAAY,KAAK,CAAC;AACvH,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,QAAI,YAAY,WAAW,GAAG;AAC5B,YAAM,SAAS,YAAY,QAAQ,SAAS,EAAE,KAAK,KAAK;AACxD,YAAM,SAAS,YAAY,QAAQ,SAAS,EAAE,KAAK,KAAK;AACxD,YAAM,SAAS,UAAU,UAAU;AACnC,aAAO,QAAQ,GAAG,mBAAmB,wBAAwB,QAAQ,UAAU,gBAAgB,YAAY,MAAM,MAAM,MAAM;AAC7H,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,WAAO,UAAU;AACjB;AAAA,MACE;AAAA,MACA,oBAAoB,mBAAmB,iBAAiB,QAAQ,UAAU,MAAM,OAAO,UAAU;AAAA,IACnG;AAAA,EACF,SAAS,OAAO;AACd,WAAO,aAAa,KAAK,IAAI,IAAI;AACjC,WAAO,QAAQ,GAAG,mBAAmB,2CAA2C,QAAQ,UAAU,MAAM,OAAO,KAAK,CAAC;AACrH,oBAAgB,SAAS,OAAO,KAAK;AAAA,EACvC;AAEA,SAAO;AACT;AAiBO,SAAS,sBACdC,kBACAD,aACAE,qBACAC,gBACmB;AACnB,QAAM,UAA6B;AAAA,IACjC,eAAeF,iBAAgB,SAAS;AAAA,IACxC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,SAAS,CAAC;AAAA,EACZ;AAEA,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,QAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC;AAAA,IACF;AAEA,YAAQ;AACR,UAAM,WAAWC,oBAAmB,IAAI,UAAU;AAClD,UAAM,SAAS,cAAc,SAASF,aAAY,QAAQ;AAC1D,YAAQ,QAAQ,KAAK,MAAM;AAE3B,QAAI,OAAO,SAAS;AAClB,cAAQ;AAOR,YAAM,gBAAgB,2BAA2B,SAASA,WAAU;AACpE,UAAI,CAAC,cAAc,SAAS;AAC1B;AAAA,UACE;AAAA,UACA,oDAAoD,UAAU,uCAAuC,cAAc,SAAS,eAAe;AAAA,QAC7I;AAAA,MACF;AAAA,IACF,OAAO;AACL,cAAQ;AAIR,UAAIG,gBAAe;AACjB;AAAA,UACE;AAAA,UACA,OAAO,SAAS,GAAG,mBAAmB,wBAAwB,UAAU;AAAA,UACxEA;AAAA,UACAH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,QAAQ,2BAA2B,GAAG;AACxC;AAAA,MACE;AAAA,MACA,wBAAwB,QAAQ,wBAAwB,iCAAiC,QAAQ,cAAc,eAAe,QAAQ,UAAU;AAAA,IAClJ;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,uCAAuC;AAAA,EACjE;AAEA,SAAO;AACT;;;ACnPA,IAAAI,gBAAsD;;;ACAtD,IAAAC,aAAmD;AACnD,IAAAC,gBAAuD;AAoBhD,SAAS,+BACd,eACA,YACU;AACV,MAAI,CAAC,iBAAiB,CAAC,YAAY;AACjC,UAAM,IAAI;AAAA,MACR,kDAAkD,UAAU;AAAA,IAC9D;AAAA,EACF;AAGA,QAAM,uBAAuB,cAAc,QAAQ,WAAW,EAAE;AAChE,QAAM,uBAAuB,WAAW,QAAQ,WAAW,EAAE;AAE7D,MACE,CAAC,qBAAqB,WAAW,oBAAoB,KACrD,yBAAyB,sBACzB;AACA,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,WAAW,OAAK,oBAAK,YAAY,UAAU,GAAG;AAAA,MAClD,OAAO;AAAA,MACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,MACjD,sBAAsB;AAAA,IACxB,CAAC;AAGD,UAAM,gBAAgB,SAAS,IAAI,cAAQ,wBAAS,eAAe,IAAI,CAAC;AAGxE,UAAM,sBAAsB,uBAAuB,aAAa;AAChE,QAAI,oBAAoB,SAAS,GAAG;AAClC,YAAM,WAAW,mBAAmB,eAAe,mBAAmB;AACtE,YAAM,eAAe,cAAc,SAAS,SAAS;AACrD,UAAI,eAAe,GAAG;AACpB;AAAA,UACE;AAAA,UACA,YAAY,YAAY,8DAA0D,wBAAS,eAAe,UAAU,KAAK,GAAG;AAAA,QAC9H;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,oBAAgB,SAAS,8BAA8B,UAAU,KAAK,OAAO,KAAK,CAAC,EAAE;AACrF,WAAO,CAAC;AAAA,EACV;AACF;AASO,SAAS,mCAAmC,eAAiC;AAClF,MAAI,CAAC,iBAAiB,KAAC,uBAAW,aAAa,GAAG;AAChD,UAAM,IAAI,MAAM,0BAA0B,aAAa,mBAAmB;AAAA,EAC5E;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAGtC,QAAM,mBAAmB,OAAK,oBAAK,eAAe,iBAAiB,GAAG;AAAA,IACpE,OAAO;AAAA,IACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,IACjD,sBAAsB;AAAA,EACxB,CAAC;AAED,QAAM,WAAW,OAAK,oBAAK,eAAe,UAAU,GAAG;AAAA,IACrD,OAAO;AAAA,IACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,IACjD,sBAAsB;AAAA,EACxB,CAAC;AAGD,QAAM,uBAAuB,oBAAI,IAAY;AAG7C,aAAW,mBAAmB,kBAAkB;AAC9C,yBAAqB,QAAI,uBAAQ,eAAe,CAAC;AAAA,EACnD;AAGA,aAAW,WAAW,UAAU;AAC9B,UAAM,aAAS,uBAAQ,OAAO;AAC9B,UAAM,cAAc,2BAA2B,QAAQ,aAAa;AACpE,QAAI,aAAa;AACf,2BAAqB,IAAI,WAAW;AAAA,IACtC,OAAO;AACL,2BAAqB,IAAI,MAAM;AAAA,IACjC;AAAA,EACF;AAGA,aAAW,OAAO,sBAAsB;AACtC,QAAI,mBAAmB,GAAG,GAAG;AAC3B,YAAM,mBAAe,wBAAS,eAAe,GAAG;AAChD,YAAM,aAAa,gBAAgB;AAGnC,UAAI,YAAY;AAChB,YAAM,mBAAmB,MAAM,KAAK,aAAa;AAEjD,iBAAW,mBAAmB,kBAAkB;AAC9C,cAAM,sBAAkB,oBAAK,eAAe,eAAe;AAI3D,YAAI,IAAI,WAAW,kBAAkB,iBAAG,GAAG;AAEzC,gBAAM,4BAAwB,oBAAK,iBAAiB,cAAc;AAClE,gBAAM,oBAAoB,oBAAoB,qBAAqB;AACnE,gBAAM,mBACJ,mBAAmB,cACnB,MAAM,QAAQ,kBAAkB,UAAU,KAC1C,kBAAkB,WAAW,SAAS;AAGxC,cACE,qBACC,sBAAsB,eAAe,KAAK,oBAAoB,eAAe,IAC9E;AAEA,wBAAY;AAAA,UACd,OAAO;AAEL,wBAAY;AAAA,UACd;AACA;AAAA,QACF;AAIA,YAAI,gBAAgB,WAAW,MAAM,iBAAG,GAAG;AACzC,gBAAM,6BAAyB,oBAAK,KAAK,cAAc;AACvD,gBAAM,qBAAqB,oBAAoB,sBAAsB;AACrE,gBAAM,oBACJ,oBAAoB,cACpB,MAAM,QAAQ,mBAAmB,UAAU,KAC3C,mBAAmB,WAAW,SAAS;AAGzC,cAAI,EAAE,qBAAqB,mBAAmB,eAAe,IAAI;AAC/D,0BAAc,OAAO,eAAe;AAAA,UACtC;AAAA,QACF;AAAA,MACF;AAEA,UAAI,WAAW;AACb,sBAAc,IAAI,UAAU;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,aAAa,EAAE,KAAK;AACxC;AAQO,SAAS,kBAAkB,UAA+B;AAC/D,MAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,UAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE;AAAA,EACpD;AAEA,QAAM,cAAU,yBAAa,UAAU,MAAM;AAC7C,QAAM,UAAuB,CAAC;AAK9B,QAAM,aACJ;AAEF,MAAIC;AACJ,UAAQA,SAAQ,WAAW,KAAK,OAAO,OAAO,MAAM;AAClD,UAAMC,QAAOD,OAAM,CAAC;AACpB,YAAQ,KAAK;AAAA,MACX,WAAWA,OAAM,CAAC;AAAA,MAClB,MAAAC;AAAA,MACA,YAAYA,MAAK,WAAW,IAAI,KAAKA,MAAK,WAAW,KAAK;AAAA,MAC1D,UAAU,CAACA,MAAK,WAAW,IAAI,KAAK,CAACA,MAAK,WAAW,KAAK,KAAK,CAACA,MAAK,WAAW,GAAG;AAAA,IACrF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AASA,SAAS,2BAA2B,YAAoB,eAAsC;AAE5F,MAAI,WAAW,SAAS,cAAc,KAAK,WAAW,SAAS,WAAW,GAAG;AAC3E,WAAO;AAAA,EACT;AAEA,MAAI,aAAa;AAGjB,SAAO,WAAW,WAAW,aAAa,GAAG;AAE3C,QAAI,mBAAmB,UAAU,GAAG;AAGlC,YAAM,qBAAiB,wBAAS,UAAU;AAC1C,YAAM,mBAAmB,CAAC,OAAO,MAAM,KAAK,EAAE,SAAS,cAAc;AAErE,UAAI,kBAAkB;AACpB,cAAMC,iBAAY,uBAAQ,UAAU;AAEpC,YACEA,eAAc,cACdA,WAAU,WAAW,aAAa,KAClC,CAACA,WAAU,SAAS,cAAc,KAClC,CAACA,WAAU,SAAS,WAAW,KAC/B,mBAAmBA,UAAS,GAC5B;AAEA,iBAAOA;AAAA,QACT;AAAA,MACF;AAGA,YAAMA,iBAAY,uBAAQ,UAAU;AAEpC,UACEA,eAAc,cACdA,WAAU,WAAW,aAAa,KAClC,CAACA,WAAU,SAAS,cAAc,KAClC,CAACA,WAAU,SAAS,WAAW,GAC/B;AACA,cAAMC,gBACJ,2BAAW,oBAAKD,YAAW,IAAI,CAAC,SAAK,yBAAS,oBAAKA,YAAW,IAAI,CAAC,EAAE,YAAY;AACnF,cAAME,iBACJ,2BAAW,oBAAKF,YAAW,KAAK,CAAC,SAAK,yBAAS,oBAAKA,YAAW,KAAK,CAAC,EAAE,YAAY;AACrF,cAAMG,iBACJ,2BAAW,oBAAKH,YAAW,KAAK,CAAC,SAAK,yBAAS,oBAAKA,YAAW,KAAK,CAAC,EAAE,YAAY;AAGrF,YAAKC,aAAYC,cAAeA,cAAaC,YAAY;AACvD,iBAAOH;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,UAAM,eACJ,2BAAW,oBAAK,YAAY,IAAI,CAAC,SAAK,yBAAS,oBAAK,YAAY,IAAI,CAAC,EAAE,YAAY;AACrF,UAAM,gBACJ,2BAAW,oBAAK,YAAY,KAAK,CAAC,SAAK,yBAAS,oBAAK,YAAY,KAAK,CAAC,EAAE,YAAY;AACvF,UAAM,gBACJ,2BAAW,oBAAK,YAAY,KAAK,CAAC,SAAK,yBAAS,oBAAK,YAAY,KAAK,CAAC,EAAE,YAAY;AAEvF,QAAK,YAAY,aAAe,aAAa,WAAY;AACvD,aAAO;AAAA,IACT;AAGA,UAAM,gBAAY,uBAAQ,UAAU;AACpC,QAAI,cAAc,YAAY;AAE5B;AAAA,IACF;AACA,iBAAa;AAAA,EACf;AAGA,SAAO;AACT;AAUO,SAAS,mBAAmB,KAAsB;AACvD,MAAI;AAEF,QAAI,IAAI,SAAS,cAAc,KAAK,IAAI,SAAS,WAAW,GAAG;AAC7D,aAAO;AAAA,IACT;AAGA,UAAM,4BAA4B,sBAAsB,GAAG;AAC3D,UAAM,oBAAoB,oBAAoB,GAAG;AACjD,UAAM,cAAc,6BAA6B;AAGjD,UAAM,qBAAqB,0BAA0B,GAAG;AAExD,QAAI,oBAAoB;AAEtB,UAAI,CAAC,aAAa;AAChB,eAAO;AAAA,MACT;AAGA,YAAM,sBAAkB,oBAAK,KAAK,cAAc;AAChD,YAAM,cAAc,oBAAoB,eAAe;AAEvD,UACE,aAAa,cACb,MAAM,QAAQ,YAAY,UAAU,KACpC,YAAY,WAAW,SAAS,GAChC;AAEA,YAAI,CAAC,aAAa;AAEhB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,oBAAgB,SAAS,4BAA4B,GAAG,KAAK,OAAO,KAAK,CAAC,EAAE;AAC5E,WAAO;AAAA,EACT;AACF;AAKA,SAAS,sBAAsB,KAAsB;AACnD,QAAM,oBAAoB,KAAC,oBAAK,KAAK,IAAI,OAAG,oBAAK,KAAK,KAAK,OAAG,oBAAK,KAAK,KAAK,CAAC;AAE9E,aAAW,YAAY,mBAAmB;AACxC,YAAI,uBAAW,QAAQ,SAAK,qBAAS,QAAQ,EAAE,YAAY,GAAG;AAE5D,YAAM,WAAW,OAAK,oBAAK,UAAU,UAAU,GAAG;AAAA,QAChD,OAAO;AAAA,QACP,sBAAsB;AAAA,MACxB,CAAC;AACD,UAAI,SAAS,SAAS,GAAG;AACvB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,KAAsB;AACjD,QAAM,iBAAiB,OAAK,oBAAK,KAAK,OAAO,GAAG,EAAE,sBAAsB,KAAK,CAAC;AAC9E,SAAO,eAAe,SAAS;AACjC;AAOO,SAAS,oBAAoB,UAA2C;AAC7E,MAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,cAAU,yBAAa,UAAU,MAAM;AAC7C,UAAM,cAAc,KAAK,MAAM,OAAO;AACtC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,iCAAiC,QAAQ,KAAK,OAAO,KAAK,CAAC,EAAE;AACrF,WAAO;AAAA,EACT;AACF;AAiBO,SAAS,2BACd,eACA,SAKmB;AACnB,MAAI,CAAC,QAAQ,YAAY,QAAQ,SAAS,WAAW,GAAG;AACtD,WAAO;AAAA,MACL,oBAAoB,CAAC;AAAA,MACrB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAEA,QAAM,yBAAqB,oBAAK,eAAe,QAAQ,UAAU;AAGjE,QAAM,iBAAiB,CAAC,MAAM,OAAO,KAAK;AAC1C,QAAM,kBAAkB,eAAe,OAAO,aAAO,2BAAW,oBAAK,oBAAoB,GAAG,CAAC,CAAC;AAE9F,MAAI,gBAAgB,SAAS,GAAG;AAE9B,WAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAGA,QAAM,eAAe,QAAQ,SAC1B,OAAO,cAAQ,2BAAQ,oBAAK,eAAe,IAAI,CAAC,MAAM,kBAAkB,EACxE,IAAI,cAAQ,wBAAS,IAAI,CAAC;AAE7B,MAAI,aAAa,SAAS,GAAG;AAE3B,WAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAGA,QAAM,qBAAqB,QAAQ,SAAS;AAAA,IAAI,cAC9C,wBAAS,wBAAoB,oBAAK,eAAe,IAAI,CAAC;AAAA,EACxD;AAEA,SAAO;AAAA,IACL;AAAA,IACA,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,EAC/D;AACF;AAUO,SAAS,0BAA0B,KAAsB;AAC9D,MAAI;AACF,UAAM,sBAAkB,oBAAK,KAAK,cAAc;AAChD,UAAM,cAAc,oBAAoB,eAAe;AAEvD,QAAI,aAAa;AACf,YAAM,eAAe;AAAA,QACnB,GAAI,YAAY,gBAAgB,CAAC;AAAA,QACjC,GAAI,YAAY,mBAAmB,CAAC;AAAA,MACtC;AAGA,aAAO,CAAC,EAAE,aAAa,UAAU,KAAK,aAAa,aAAa;AAAA,IAClE;AAEA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ADzeA,SAAS,oCAAoC,eAAqD;AAEhG,kBAAgB,QAAQ,2BAA2B;AACnD,QAAM,cAAc,mCAAmC,aAAa;AAEpE,MAAI,YAAY,WAAW,GAAG;AAC5B,oBAAgB,QAAQ,wBAAwB;AAChD,WAAO,oBAAI,IAA6B;AAAA,EAC1C;AAEA,kBAAgB,QAAQ,SAAS,YAAY,MAAM,yCAAyC;AAG5F,QAAM,sBAAsB,uBAAuB,aAAa;AAEhE,QAAM,aAAa,oBAAI,IAA6B;AAGpD,aAAW,cAAc,aAAa;AAEpC,QAAI,oBAAoB,SAAS,KAAK,iBAAiB,YAAY,mBAAmB,GAAG;AACvF,sBAAgB,QAAQ,qBAAqB,UAAU,uCAAkC;AACzF;AAAA,IACF;AAEA,UAAM,yBAAqB,oBAAK,eAAe,UAAU;AACzD,UAAM,WAAW,+BAA+B,eAAe,kBAAkB;AAGjF,QAAI,SAAS,WAAW,GAAG;AACzB;AAAA,QACE;AAAA,QACA,qBAAqB,UAAU;AAAA,MACjC;AACA;AAAA,IACF;AAGA,UAAM,sBAAkB,oBAAK,oBAAoB,cAAc;AAC/D,UAAM,cAAc,oBAAoB,eAAe;AAEvD,eAAW,IAAI,YAAY;AAAA,MACzB;AAAA,MACA;AAAA,MACA,oBAAoB,CAAC;AAAA;AAAA,MACrB,wBAAoB,oBAAK,YAAY,gBAAgB;AAAA,MACrD;AAAA,MACA,cAAc,CAAC;AAAA,MACf,SAAS,oBAAI,IAAyB;AAAA,IACxC,CAAC;AAAA,EACH;AAGA,kBAAgB,QAAQ,gDAAgD;AACxE,aAAW,CAAC,YAAY,OAAO,KAAK,WAAW,QAAQ,GAAG;AAExD,eAAW,oBAAoB,QAAQ,UAAU;AAC/C,YAAM,uBAAmB,oBAAK,eAAe,gBAAgB;AAE7D,UAAI;AACF,cAAM,UAAU,kBAAkB,gBAAgB;AAClD,cAAM,kBAA+B,CAAC;AAGtC,mBAAW,cAAc,SAAS;AAChC,gBAAM,iBAA4B,EAAE,GAAG,WAAW;AAElD,cAAI,WAAW,YAAY;AAEzB,kBAAM,uBAAmB,2BAAQ,uBAAQ,gBAAgB,GAAG,WAAW,IAAI;AAC3E,kBAAM,yBAAyB,iBAAiB,SAAS,MAAM,IAC3D,mBACA,GAAG,gBAAgB;AAGvB,gBAAI;AACF,oBAAM,wBAAoB,uBAAQ,gBAAgB;AAClD,oBAAM,mBAAe,2BAAQ,oBAAK,eAAe,iBAAiB,GAAG,WAAW,IAAI;AACpF,oBAAM,yBAAyB,aAAa,SAAS,MAAM,IACvD,eACA,GAAG,YAAY;AAGnB,kBAAI,uBAAuB,WAAW,aAAa,GAAG;AACpD,+BAAe,eAAe,uBAC3B,UAAU,cAAc,MAAM,EAC9B,QAAQ,UAAU,EAAE;AAAA,cACzB;AAAA,YACF,SAAS,OAAO;AACd;AAAA,gBACE;AAAA,gBACA,qCAAqC,WAAW,IAAI,OAAO,gBAAgB,KAAK,OAAO,KAAK,CAAC;AAAA,cAC/F;AAAA,YACF;AAGA,uBAAW,CAAC,iBAAiB,YAAY,KAAK,WAAW,QAAQ,GAAG;AAClE,kBAAI,oBAAoB,WAAY;AAEpC,oBAAM,8BAA0B,oBAAK,eAAe,eAAe;AAGnE,oBAAM,mBAAmB,aAAa,SAAS,KAAK,eAAa;AAC/D,sBAAM,wBAAoB,oBAAK,eAAe,SAAS;AACvD,uBACE,sBAAsB,0BACtB,uBAAuB,WAAW,0BAA0B,iBAAG;AAAA,cAEnE,CAAC;AAED,kBAAI,kBAAkB;AAEpB,wBAAQ,iBAAiB,CAAC;AAE1B,oBAAI,CAAC,QAAQ,aAAa,SAAS,YAAY,GAAG;AAChD,0BAAQ,aAAa,KAAK,YAAY;AAAA,gBACxC;AAAA,cACF;AAAA,YACF;AAAA,UACF,WAES,WAAW,YAAY,QAAQ,aAAa;AACnD,kBAAM,eAAe;AAAA,cACnB,GAAI,QAAQ,YAAY,gBAAgB,CAAC;AAAA,cACzC,GAAI,QAAQ,YAAY,mBAAmB,CAAC;AAAA,YAC9C;AAGA,kBAAM,aAAa,WAAW,KAAK,MAAM,GAAG,EAAE,CAAC,EAAE,WAAW,GAAG,IAC3D,WAAW,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,IAC/C,WAAW,KAAK,MAAM,GAAG,EAAE,CAAC;AAEhC,gBAAI,aAAa,UAAU,GAAG;AAAA,YAG9B;AAAA,UACF;AAEA,0BAAgB,KAAK,cAAc;AAAA,QACrC;AAGA,gBAAQ,SAAS,IAAI,kBAAkB,eAAe;AAAA,MACxD,SAAS,OAAgB;AACvB;AAAA,UACE;AAAA,UACA,+BAA+B,gBAAgB,KAAK,OAAO,KAAK,CAAC;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,aAAW,CAAC,EAAE,OAAO,KAAK,WAAW,QAAQ,GAAG;AAC9C,QAAI;AACF,YAAM,cAAc,2BAA2B,eAAe,OAAO;AAGrE,cAAQ,qBAAqB,YAAY;AACzC,cAAQ,qBAAqB,YAAY;AAAA,IAC3C,SAAS,OAAO;AACd;AAAA,QACE;AAAA,QACA,kDAAkD,QAAQ,UAAU,KAAK,OAAO,KAAK,CAAC;AAAA,MACxF;AAEA,cAAQ,qBAAqB,QAAQ,SAAS,IAAI,cAAQ,wBAAS,IAAI,CAAC;AACxE,cAAQ,yBAAqB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IACxE;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,+BAA+B,eAA2C;AACxF,QAAM,YAAY,oBAAI,KAAK;AAG3B,QAAMI,mBAAsC;AAAA,IAC1C,IAAI,aAAa,KAAK,IAAI,CAAC;AAAA,IAC3B;AAAA,IACA,UAAU,oBAAI,IAAwB;AAAA,IACtC,WAAW;AAAA,MACT,WAAW;AAAA,QACT,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA,aAAa;AAAA,UACX,aAAa,QAAQ;AAAA,UACrB,UAAU,QAAQ;AAAA,UAClB,KAAK,QAAQ,IAAI;AAAA,UACjB,MAAM,QAAQ;AAAA,QAChB;AAAA,MACF;AAAA,MACA,QAAQ;AAAA,QACN,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,6BAA6B;AAAA,QAC7B,eAAe,CAAC;AAAA,QAChB,iBAAiB,CAAC;AAAA,MACpB;AAAA,MACA,UAAU;AAAA,QACR,mBAAmB,CAAC;AAAA,QACpB,iBAAiB;AAAA,QACjB,kBAAkB,CAAC;AAAA,QACnB,kBAAkB;AAAA,MACpB;AAAA,IACF;AAAA,IACA,cAAc;AAAA,IACd,eAAe;AAAA,MACb,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,eAAe;AAAA,MACf,uBAAuB;AAAA,MACvB,wBAAwB;AAAA,MACxB,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,MACpB,gBAAgB,CAAC;AAAA,MACjB,UAAU,CAAC;AAAA,MACX,aAAa;AAAA,QACX,iBAAiB;AAAA,QACjB,mBAAmB;AAAA,QACnB,uBAAuB;AAAA,QACvB,sBAAsB;AAAA,MACxB;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,MACN,kBAAkB;AAAA,MAClB,uBAAuB;AAAA;AAAA,MACvB,qBAAqB;AAAA;AAAA,MACrB,sBAAsB;AAAA;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,MACN,UAAU,CAAC;AAAA,MACX,UAAU,CAAC;AAAA,IACb;AAAA,IACA,aAAa;AAAA,MACX,0BAA0B;AAAA,MAC1B,+BAA+B;AAAA,MAC/B,oBAAoB;AAAA,MACpB,mCAAmC,oBAAI,IAAY;AAAA,MACnD,8BAA8B,oBAAI,IAAY;AAAA,IAChD;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,kBAAkB,oCAAoC,aAAa;AAGzE,eAAW,CAAC,YAAY,YAAY,KAAK,gBAAgB,QAAQ,GAAG;AAClE,YAAM,aAAyB;AAAA,QAC7B,GAAG;AAAA,QACH,IAAI,WAAW,WAAW,QAAQ,iBAAiB,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,QACrE,2BAA2B;AAAA;AAAA,QAC3B,kBAAkB,CAAC;AAAA,QACnB,iBAAiB;AAAA,UACf,sBAAsB,CAAC;AAAA,UACvB,cAAc,CAAC;AAAA,UACf,aAAa,oBAAI,IAAoB;AAAA,QACvC;AAAA,QACA,QAAQ;AAAA,QACR,YAAY;AAAA,UACV,YAAY,oBAAI,KAAK;AAAA,QACvB;AAAA,MACF;AAEA,MAAAA,iBAAgB,SAAS,IAAI,YAAY,UAAU;AAAA,IACrD;AAGA,IAAAA,iBAAgB,cAAc,gBAAgBA,iBAAgB,SAAS;AACvE,IAAAA,iBAAgB,cAAc,gBAAgB,MAAM;AAAA,MAClDA,iBAAgB,SAAS,OAAO;AAAA,IAClC,EAAE,OAAO,CAAC,KAAK,YAAY,MAAM,QAAQ,SAAS,QAAQ,CAAC;AAE3D,IAAAA,iBAAgB,UAAU,OAAO,mBAAmBA,iBAAgB,SAAS;AAC7E,IAAAA,iBAAgB,UAAU,OAAO,gBAAgBA,iBAAgB,cAAc;AAG/E,IAAAA,iBAAgB,eAAe;AAE/B,UAAM,UAAU,oBAAI,KAAK;AACzB,IAAAA,iBAAgB,UAAU,UAAU,UAAU;AAC9C,IAAAA,iBAAgB,UAAU,UAAU,aAAa,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AACvF,IAAAA,iBAAgB,cAAc,YAAY,oBACxCA,iBAAgB,UAAU,UAAU;AAEtC;AAAA,MACE;AAAA,MACA,qCAAqCA,iBAAgB,SAAS,IAAI,iBAAiBA,iBAAgB,cAAc,aAAa;AAAA,IAChI;AAEA,WAAOA;AAAA,EACT,SAAS,OAAO;AACd,UAAM,eAAe,yCAAyC,OAAO,KAAK,CAAC;AAC3E,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,MACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD,CAAC;AAED,IAAAA,iBAAgB,eAAe;AAC/B,WAAOA;AAAA,EACT;AACF;;;AEtVA,IAAAC,yBAA4C;AAoBrC,SAAS,uBACdC,aACAC,sBACAC,gBACsC;AACtC;AAAA,IACE;AAAA,IACA;AAAA,UACMD,oBAAmB;AAAA,EAC3B;AAcA,QAAM,aAAmC,kCAAUA,sBAAqB;AAAA,IACtE,KAAKD;AAAA,IACL,KAAK,QAAQ;AAAA,IACb,OAAO;AAAA,IACP,OAAO;AAAA,EACT,CAAC;AAED,MAAI,OAAO,OAAO;AAChB,UAAM,eAAe,uCAAuC,OAAO,MAAM,OAAO;AAChF,QAAIE,gBAAe;AACjB,uCAAiCF,aAAY,cAAcE,gBAAeF,WAAU;AAAA,IACtF;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,eAAe,8CAA8C,OAAO,OAAO,MAAM,CAAC;AACxF,QAAIE,gBAAe;AACjB,uCAAiCF,aAAY,cAAcE,gBAAeF,WAAU;AAAA,IACtF;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,KAAK;AACzB;AAYO,SAAS,kCACdA,aACAC,sBACAC,gBACAC,kBACS;AAET,4BAA0B;AAG1B,gCAA8BH,WAAU;AAGxC,QAAM,iBAAiB,iBAAiBA,WAAU;AAElD,MAAI;AACF,gCAA4B,uBAAuB;AACnD,UAAM,sBAAsB,KAAK,IAAI;AACrC,UAAM,kBAAkB,uBAAuBA,aAAYC,sBAAqBC,cAAa;AAC7F,UAAM,oBAAoB,KAAK,IAAI;AACnC,+BAA2B,uBAAuB;AAGlD,QAAIC,kBAAiB;AACnB,MAAAA,iBAAgB,cAAc,YAAY,uBACxC,oBAAoB;AACtB,MAAAA,iBAAgB,cAAc,YAAY,kBACxCA,iBAAgB,cAAc,YAAY,oBAC1CA,iBAAgB,cAAc,YAAY,wBAC1CA,iBAAgB,cAAc,YAAY;AAAA,IAC9C;AAGA,QAAI,CAAC,gBAAgB,WAAW,gBAAgB,OAAO;AACrD,sBAAgB,SAAS,uCAAuC,gBAAgB,KAAK,EAAE;AAEvF,UAAID,gBAAe;AACjB,YAAI,qBAAqBF;AACzB,YAAIG,oBAAmBA,iBAAgB,SAAS,OAAO,GAAG;AACxD,gBAAM,eAAe,MAAM,KAAKA,iBAAgB,SAAS,OAAO,CAAC,EAAE,CAAC;AACpE,+BAAqB,aAAa,SAAS,CAAC,KAAKH;AAAA,QACnD;AACA;AAAA,UACE;AAAA,UACA,gBAAgB;AAAA,UAChBE;AAAA,UACAF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,UAAE;AAEA,qBAAiB,cAAc;AAAA,EACjC;AACF;AAWO,SAAS,gBACdA,aACAC,sBACAC,gBACA,aACO;AACP,QAAM,UAAU,kCAAkCF,aAAYC,sBAAqBC,cAAa;AAChG,mBAAiB,SAAS,UAAU,cAAc,6BAA6B;AAC/E,UAAQ,IAAI,qEAAqE;AACjF,UAAQ,KAAK,CAAC;AAChB;;;ACnKA,IAAAE,gBAAwB;AAExB,IAAM,gBAAgB;AAatB,SAAS,kBAAkBC,aAA4B;AAErD,MAAI,CAACA,eAAc,OAAOA,gBAAe,UAAU;AACjD,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AAGA,QAAM,qBAAiB,uBAAQA,WAAU;AAGzC,MAAI,CAAC,kBAAkB,mBAAmB,KAAK;AAC7C,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAEA,SAAO;AACT;AAaO,SAAS,kBAAkB,MAMhC;AAEA,MAAI,KAAK,SAAS,GAAG;AACnB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,cAAc;AAAA,IAChB;AAAA,EACF;AAGA,QAAM,gBAAwB,KAAK,CAAC;AAGpC,MAAIA;AACJ,MAAI;AACF,IAAAA,cAAa,kBAAkB,aAAa;AAAA,EAC9C,SAAS,OAAO;AACd,WAAO;AAAA,MACL,SAAS;AAAA,MACT,cAAc,wBAAwB,OAAO,KAAK,CAAC;AAAA,IACrD;AAAA,EACF;AAGA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,cAAc;AAAA,IACd,MAAM;AAAA,MACJ,YAAAA;AAAA,IACF;AAAA,EACF;AACF;;;AjD9CA,IAAM,mBAAmB,kBAAkB,QAAQ,IAAI;AACvD,IAAI,CAAC,iBAAiB,SAAS;AAC7B,UAAQ,KAAK,iBAAiB,YAAY;AAC1C,UAAQ;AAAA,IACN,sDAAsD,iBAAiB,YAAY;AAAA,EACrF;AACA,UAAQ,IAAI,qEAAqE;AACjF,UAAQ,KAAK,CAAC;AAChB;AAEA,IAAM,EAAE,WAAW,IAAI,iBAAiB;AAGxC,uBAAuB,UAAU;AACjC,kBAAkB,UAAU;AAG5B,4BAA4B,mBAAmB;AAC/C,IAAM;AAAA,EACJ,SAAS;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,IAAI,4BAA4B,UAAU;AAC1C,2BAA2B,mBAAmB;AAE9C,IAAI,CAAC,iBAAiB;AACpB,QAAM,YAAY,aAAa,YAAY,eAAe;AAC1D,QAAM,eAAe,IAAI,SAAS,kEAAkE,cAAc,KAAK,IAAI,CAAC;AAC5H,kBAAgB,QAAQ,YAAY;AAEpC,MAAI,eAAe;AACjB,kCAA8B,YAAY,cAAc,aAAa;AAAA,EACvE;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACF,OAAO;AACL,UAAQ,MAAM,UAAU;AAC1B;AAEA;AAAA,EACE;AAAA,EACA,wFAAwF,UAAU;AACpG;AAGA,gBAAgB,QAAQ,0CAA0C;AAClE,IAAI;AAEJ,IAAI;AACF,8BAA4B,wBAAwB;AACpD,oBAAkB,+BAA+B,UAAU;AAC3D,6BAA2B,wBAAwB;AAEnD;AAAA,IACE;AAAA,IACA,GAAG,gBAAgB,SAAS,IAAI,cAAc,gBAAgB,cAAc,aAAa;AAAA,EAC3F;AAGA,MAAI,gBAAgB,SAAS,OAAO,GAAG;AACrC,eAAW,CAAC,YAAY,OAAO,KAAK,gBAAgB,SAAS,QAAQ,GAAG;AACtE;AAAA,QACE;AAAA,QACA,YAAY,UAAU,aAAa,QAAQ,MAAM,gBAAgB,QAAQ,SAAS,MAAM,0BAA0B,QAAQ,mBAAmB,MAAM;AAAA,MACrJ;AAAA,IACF;AAAA,EACF,OAAO;AAEL;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAEA,QAAI;AACF,YAAM,cAAc,MAAM;AAAA,QACxB,oBAAI,IAAI;AAAA,UACN,GAAG,OAAS,oBAAK,YAAY,UAAU,GAAG;AAAA,YACxC,QAAQ,CAAC,sBAAsB,YAAY;AAAA,YAC3C,sBAAsB;AAAA,UACxB,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AACA;AAAA,QACE;AAAA,QACA,uBAAuB,YAAY,MAAM;AAAA,MAC3C;AAEA,UAAI,YAAY,SAAS,GAAG;AAC1B;AAAA,UACE;AAAA,UACA,qBAAqB,YAAY,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,YAAY,SAAS,IAAI,UAAU,EAAE;AAAA,QACjG;AACA;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,WAAW;AAClB,sBAAgB,QAAQ,6CAA6C,OAAO,SAAS,CAAC,EAAE;AAAA,IAC1F;AAEA,UAAM,iBACJ;AACF,QAAI,eAAe;AACjB,iCAA2B,YAAY,gBAAgB,aAAa;AAAA,IACtE;AAEA,qBAAiB,OAAO,qEAAqE;AAC7F;AAAA,MACE;AAAA,MACA,uBAAuB;AAAA,MACvB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF,SAAS,OAAO;AACd,QAAM,eAAe,yCAAyC,OAAO,KAAK,CAAC;AAC3E,kBAAgB,SAAS,YAAY;AAErC,MAAI,eAAe;AACjB,iCAA6B,YAAY,cAAc,aAAa;AAAA,EACtE;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA,uBAAuB;AAAA,IACvB;AAAA,IACA;AAAA,EACF;AACF;AAGA,4BAA4B,yBAAyB;AACrD,IAAM,qBAAqB,yBAAyB,iBAAiB,YAAY,aAAa;AAC9F,2BAA2B,yBAAyB;AAEpD,IAAI,mBAAmB,SAAS,GAAG;AACjC;AAAA,IACE;AAAA,IACA;AAAA,EACF;AAEA,MAAI,gBAAgB,SAAS,OAAO,GAAG;AACrC,UAAM,eAAe,SAAS,gBAAgB,SAAS,IAAI;AAC3D,oBAAgB,SAAS,YAAY;AAErC,QAAI,eAAe;AACjB,0CAAoC,YAAY,cAAc,aAAa;AAAA,IAC7E;AAEA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACF;AAGA,4BAA4B,aAAa;AACzC,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,2BAA2B,aAAa;AAExC,IAAI,kBAAkB,2BAA2B,GAAG;AAClD;AAAA,IACE;AAAA,IACA,GAAG,kBAAkB,cAAc,eAAe,kBAAkB,UAAU;AAAA,EAChF;AACF;AAGA,IAAM,wBAAkC,CAAC;AACzC,WAAW,WAAW,gBAAgB,SAAS,OAAO,GAAG;AACvD,wBAAsB,KAAK,GAAG,QAAQ,QAAQ;AAChD;AAEA;AAAA,EACE;AAAA,EACA,SAAS,sBAAsB,MAAM,qBAAqB,gBAAgB,cAAc,aAAa;AACvG;AAGA,4BAA4B,iBAAiB;AAC7C,IAAI;AACF,yBAAuB,iBAAiB,oBAAoB,aAAa;AAEzE,MAAI,CAAC,gBAAgB,cAAc,gBAAgB;AACjD;AAAA,MACE;AAAA,MACA,wCAAwC,gBAAgB,cAAc,kBAAkB,kBAAkB,gBAAgB,cAAc,qBAAqB;AAAA,IAC/J;AAEA,eAAW,SAAS,gBAAgB,OAAO,UAAU;AACnD,sBAAgB,SAAS,qBAAqB,MAAM,KAAK,KAAK,MAAM,OAAO,EAAE;AAAA,IAC/E;AAAA,EACF;AAEA,6BAA2B,iBAAiB;AAC5C,0BAAwB,2BAA2B;AACrD,SAAS,OAAO;AACd,6BAA2B,iBAAiB;AAC5C,kBAAgB,SAAS,qCAAqC,OAAO,KAAK,CAAC,EAAE;AAE7E,MAAI,sBAAsB,SAAS,GAAG;AACpC;AAAA,MACE,sBAAsB,CAAC;AAAA,MACvB,qCAAqC,OAAO,KAAK,CAAC;AAAA,MAClD;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AAGA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA;AAAA,EACE;AAAA,EACA,oBAAoB,0CAA0C;AAChE;AAEA;AAAA,EACE;AAAA,EACA,6CAA6C,qBAAqB,eAAe;AACnF;AAEA,QAAQ,IAAI,qEAAqE;",
-  "names": ["import_path", "import_node_url", "balanced", "a", "b", "str", "ma", "maybeMatch", "mb", "range", "reg", "m", "begs", "beg", "left", "right", "result", "ai", "bi", "i", "r", "escSlash", "escOpen", "escClose", "escComma", "escPeriod", "escSlashPattern", "escOpenPattern", "escClosePattern", "escCommaPattern", "escPeriodPattern", "slashPattern", "openPattern", "closePattern", "commaPattern", "periodPattern", "EXPANSION_MAX", "numeric", "escapeBraces", "unescapeBraces", "parseCommaParts", "parts", "pre", "body", "post", "p", "postParts", "expand", "options", "max", "expand_", "embrace", "isPadded", "el", "lte", "y", "gte", "isTop", "expansions", "k", "expansion", "isNumericSequence", "isAlphaSequence", "isSequence", "isOptions", "n", "N", "x", "width", "incr", "test", "pad", "c", "need", "z", "j", "assertValidPattern", "pattern", "posixClasses", "braceEscape", "s", "regexpEscape", "rangesToString", "ranges", "parseClass", "glob", "position", "pos", "negs", "sawStart", "uflag", "escaping", "negate", "endPos", "rangeStart", "WHILE", "cls", "unip", "u", "neg", "sranges", "snegs", "unescape", "windowsPathsNoEscape", "magicalBraces", "types", "isExtglobType", "startNoTraversal", "startNoDot", "addPatternStart", "justDots", "reSpecials", "regExpEscape", "qmark", "star", "starNoEmpty", "AST", "_AST", "#root", "#hasMagic", "#uflag", "#parts", "#parent", "#parentIndex", "#negs", "#filledNegs", "#options", "#toString", "#emptyExt", "type", "parent", "#fillNegs", "pp", "part", "ret", "pl", "#parseAST", "ast", "opt", "inBrace", "braceStart", "braceNeg", "acc", "ext", "re", "hasMagic", "flags", "allowDot", "dot", "noEmpty", "src", "_", "#parseGlob", "start", "aps", "needNoTrav", "needNoDot", "end", "repeated", "#partsToRegExp", "bodyDotAllowed", "final", "close", "_hasMagic", "inStar", "needUflag", "consumed", "magic", "escape", "minimatch", "Minimatch", "starDotExtRE", "starDotExtTest", "f", "starDotExtTestDot", "starDotExtTestNocase", "starDotExtTestNocaseDot", "starDotStarRE", "starDotStarTest", "starDotStarTestDot", "dotStarRE", "dotStarTest", "starRE", "starTest", "starTestDot", "qmarksRE", "qmarksTestNocase", "$0", "noext", "qmarksTestNoExt", "qmarksTestNocaseDot", "qmarksTestNoExtDot", "qmarksTestDot", "qmarksTest", "len", "defaultPlatform", "path", "sep", "GLOBSTAR", "twoStarDot", "twoStarNoDot", "filter", "defaults", "def", "orig", "list", "braceExpand", "makeRe", "match", "mm", "globMagic", "awe", "args", "rawGlobParts", "set", "__", "isUNC", "isDrive", "ss", "globParts", "optimizationLevel", "gs", "prev", "didSomething", "dd", "gss", "next", "p2", "other", "splin", "matched", "emptyGSMatch", "which", "negateOffset", "file", "partial", "fileDrive", "fileUNC", "patternDrive", "patternUNC", "fdi", "pdi", "fd", "pd", "fi", "pi", "fl", "fr", "pr", "swallowee", "hit", "fastTest", "twoStar", "filtered", "prefixes", "open", "ff", "filename", "defaultPerf", "warned", "PROCESS", "emitWarning", "msg", "code", "fn", "AC", "AS", "warnACPolyfill", "reason", "printACPolyfillWarning", "shouldWarn", "isPosInt", "getUintArray", "ZeroArray", "size", "Stack", "_Stack", "#constructing", "HeapCls", "LRUCache", "_LRUCache", "#max", "#maxSize", "#dispose", "#onInsert", "#disposeAfter", "#fetchMethod", "#memoMethod", "#perf", "#size", "#calculatedSize", "#keyMap", "#keyList", "#valList", "#next", "#prev", "#head", "#tail", "#free", "#disposed", "#sizes", "#starts", "#ttls", "#autopurgeTimers", "#hasDispose", "#hasFetchMethod", "#hasDisposeAfter", "#hasOnInsert", "#isBackgroundFetch", "index", "context", "#backgroundFetch", "#moveToTail", "#indexes", "#rindexes", "#isStale", "ttl", "ttlResolution", "ttlAutopurge", "updateAgeOnGet", "updateAgeOnHas", "allowStale", "dispose", "onInsert", "disposeAfter", "noDisposeOnSet", "noUpdateTTL", "maxSize", "maxEntrySize", "sizeCalculation", "fetchMethod", "memoMethod", "noDeleteOnFetchRejection", "noDeleteOnStaleGet", "allowStaleOnFetchRejection", "allowStaleOnFetchAbort", "ignoreFetchAbort", "perf", "UintArray", "#initializeSizeTracking", "#initializeTTLTracking", "key", "ttls", "starts", "purgeTimers", "#setItemTTL", "t", "#delete", "#updateItemAge", "#statusTTL", "status", "cachedNow", "getNow", "age", "sizes", "#removeItemSize", "#requireSize", "v", "#addItemSize", "#evict", "_i", "_s", "_st", "_k", "_v", "#isValidIndex", "getOptions", "value", "thisp", "deleted", "entry", "remain", "arr", "setOptions", "oldVal", "oldValue", "dt", "task", "val", "free", "head", "hasOptions", "peekOptions", "ac", "signal", "fetchOpts", "cb", "updateCache", "aborted", "ignoreAbort", "proceed", "fetchFail", "bf", "vl", "eb", "er", "allowStaleAborted", "noDelete", "pcall", "res", "rej", "fmp", "fetchOptions", "forceRefresh", "stale", "isStale", "staleVal", "memoOptions", "vv", "fetching", "#connect", "#clear", "ni", "proc", "isStream", "Minipass", "Stream", "isReadable", "isWritable", "EventEmitter", "EOF", "MAYBE_EMIT_END", "EMITTED_END", "EMITTING_END", "EMITTED_ERROR", "CLOSED", "READ", "FLUSH", "FLUSHCHUNK", "ENCODING", "DECODER", "FLOWING", "PAUSED", "RESUME", "BUFFER", "PIPES", "BUFFERLENGTH", "BUFFERPUSH", "BUFFERSHIFT", "OBJECTMODE", "DESTROYED", "ERROR", "EMITDATA", "EMITEND", "EMITEND2", "ASYNC", "ABORT", "ABORTED", "SIGNAL", "DATALISTENERS", "DISCARDED", "defer", "nodefer", "isEndish", "ev", "isArrayBufferLike", "isArrayBufferView", "Pipe", "dest", "opts", "_er", "PipeProxyErrors", "isObjectModeOptions", "o", "isEncodingOptions", "StringDecoder", "_enc", "_om", "chunk", "encoding", "noDrain", "ended", "handler", "h", "data", "buf", "resolve", "reject", "stopped", "stop", "onerr", "ondata", "onend", "ondestroy", "wc", "realpathSync", "rps", "defaultFS", "lstatSync", "readdirCB", "readdirSync", "readlinkSync", "lstat", "readdir", "readlink", "realpath", "fsFromOption", "fsOption", "actualFS", "uncDriveRegexp", "uncToDrive", "rootPath", "eitherSep", "UNKNOWN", "IFIFO", "IFCHR", "IFDIR", "IFBLK", "IFREG", "IFLNK", "IFSOCK", "IFMT", "IFMT_UNKNOWN", "READDIR_CALLED", "LSTAT_CALLED", "ENOTDIR", "ENOENT", "ENOREADLINK", "ENOREALPATH", "ENOCHILD", "TYPEMASK", "entToType", "normalizeCache", "L", "normalize", "normalizeNocaseCache", "normalizeNocase", "ResolveCache", "ChildrenCache", "setAsCwd", "PathBase", "#fs", "#dev", "#mode", "#nlink", "#uid", "#gid", "#rdev", "#blksize", "#ino", "#blocks", "#atimeMs", "#mtimeMs", "#ctimeMs", "#birthtimeMs", "#atime", "#mtime", "#ctime", "#birthtime", "#matchName", "#depth", "#fullpath", "#fullpathPosix", "#relative", "#relativePosix", "#type", "#children", "#linkTarget", "#realpath", "name", "root", "roots", "nocase", "children", "dirParts", "#resolveParts", "cached", "pathPart", "fullpath", "pchild", "pv", "fp", "pfpp", "fpp", "ifmt", "target", "read", "linkTarget", "#readlinkFail", "#readdirSuccess", "#markENOENT", "#markChildrenENOENT", "#markENOREALPATH", "#markENOTDIR", "#readdirFail", "#lstatFail", "ter", "#readdirAddChild", "e", "#readdirMaybePromoteChild", "#readdirAddNewChild", "child", "#readdirPromoteChild", "#applyStat", "st", "atime", "atimeMs", "birthtime", "birthtimeMs", "blksize", "blocks", "ctime", "ctimeMs", "dev", "gid", "ino", "mode", "mtime", "mtimeMs", "nlink", "rdev", "uid", "#onReaddirCB", "#readdirCBInFlight", "#callOnReaddirCB", "cbs", "allowZalgo", "entries", "#asyncReaddirInFlight", "dirs", "walkFilter", "rp", "oldCwd", "changed", "PathWin32", "_PathWin32", "win32", "compare", "PathScurryWin32", "PathPosix", "_PathPosix", "_rootPath", "PathScurryBase", "#resolveCache", "#resolvePosixCache", "cwd", "pathImpl", "childrenCacheSize", "fs", "fileURLToPath", "cwdPath", "split", "joinSep", "abs", "sawFirst", "l", "paths", "withFileTypes", "follow", "results", "walk", "dir", "queue", "processing", "process", "paused", "onReaddir", "didRealpaths", "promises", "sync", "PathScurryPosix", "posix", "_dir", "PathScurryDarwin", "Path", "PathScurry", "isPatternList", "isGlobList", "gl", "customInspect", "Pattern", "_Pattern", "#patternList", "#globList", "#index", "#platform", "#rest", "#globString", "#isDrive", "#isUNC", "#isAbsolute", "#followGlobstar", "patternList", "globList", "platform", "p0", "p1", "p3", "prest", "g0", "g1", "g2", "g3", "grest", "g", "Ignore", "ignored", "nobrace", "noglobstar", "ign", "parsed", "absolute", "fullpaths", "relative", "relatives", "HasWalkedCache", "_HasWalkedCache", "store", "MatchRecord", "ifDir", "current", "SubWalks", "subs", "Processor", "_Processor", "hasWalkedCache", "patterns", "processingSet", "rest", "rrest", "tp", "ep", "makeIgnore", "ignore", "GlobUtil", "#onResume", "#ignore", "#sep", "#ignored", "#childrenIgnored", "rpc", "mark", "rel", "processor", "tasks", "childrenCached", "GlobWalker", "GlobStream", "Glob", "Scurry", "nocaseMagicOnly", "mmo", "mms", "matchSet", "globStreamSync", "globStream", "globSync", "glob_", "globIterateSync", "globIterate", "streamSync", "stream", "iterateSync", "iterate", "import_fs", "import_path", "import_fs", "sourceRoot", "dependencyGraph", "sourceRoot", "sourceRoot", "dependencyGraph", "sourceRoot", "import_child_process", "import_path", "import_child_process", "import_path", "match", "import_child_process", "import_fs", "import_path", "import_fs", "import_path", "exception", "re", "match", "map", "schema", "type", "extend", "str", "string", "str", "ai", "bi", "str", "k", "n", "N", "x", "j", "type", "n", "str", "i", "acc", "ext", "map", "nt", "re", "_", "start", "final", "me", "ext", "qmark", "star", "type", "regExpEscape", "_", "set", "ss", "j", "gs", "ai", "bi", "i", "bs", "fi", "pi", "re", "sourceRoot", "platformInfo", "codeqlExePath", "sourceRoot", "errorMessages", "autobuildScriptPath", "sourceRoot", "import_fs", "import_path", "dependencyGraph", "validationResult", "sourceRoot", "import_child_process", "import_path", "sourceRoot", "codeqlExePath", "import_child_process", "import_fs", "import_path", "import_child_process", "v", "match", "resolveCdsVersions", "range", "codeqlExePath", "dependencyGraph", "sourceRoot", "projectCacheDirMap", "resolveCdsVersions", "import_child_process", "import_path", "sourceRoot", "dependencyGraph", "codeqlExePath", "sourceRoot", "dependencyGraph", "type", "codeqlExePath", "projectCacheDirMap", "import_path", "import_child_process", "import_path", "sourceRoot", "dependencyGraph", "projectCacheDirMap", "codeqlExePath", "import_path", "import_fs", "import_path", "match", "path", "parentDir", "hasDbDir", "hasSrvDir", "hasAppDir", "dependencyGraph", "import_child_process", "sourceRoot", "autobuildScriptPath", "codeqlExePath", "dependencyGraph", "import_path", "sourceRoot"]
+  "sources": ["../cds-extractor.ts", "../node_modules/glob/node_modules/balanced-match/src/index.ts", "../node_modules/glob/node_modules/brace-expansion/src/index.ts", "../node_modules/glob/node_modules/minimatch/src/assert-valid-pattern.ts", "../node_modules/glob/node_modules/minimatch/src/brace-expressions.ts", "../node_modules/glob/node_modules/minimatch/src/unescape.ts", "../node_modules/glob/node_modules/minimatch/src/ast.ts", "../node_modules/glob/node_modules/minimatch/src/escape.ts", "../node_modules/glob/node_modules/minimatch/src/index.ts", "../node_modules/glob/src/glob.ts", "../node_modules/glob/node_modules/lru-cache/src/index.ts", "../node_modules/glob/node_modules/path-scurry/src/index.ts", "../node_modules/glob/node_modules/minipass/src/index.ts", "../node_modules/glob/src/pattern.ts", "../node_modules/glob/src/ignore.ts", "../node_modules/glob/src/processor.ts", "../node_modules/glob/src/walker.ts", "../node_modules/glob/src/has-magic.ts", "../node_modules/glob/src/index.ts", "../src/cds/compiler/command.ts", "../src/filesystem.ts", "../src/constants.ts", "../src/logging/cdsExtractorLog.ts", "../src/logging/statusReport.ts", "../src/cds/compiler/compile.ts", "../src/cds/compiler/version.ts", "../src/environment.ts", "../src/paths-ignore.ts", "../node_modules/js-yaml/dist/js-yaml.mjs", "../node_modules/brace-expansion/node_modules/balanced-match/src/index.ts", "../node_modules/brace-expansion/src/index.ts", "../node_modules/minimatch/src/assert-valid-pattern.ts", "../node_modules/minimatch/src/brace-expressions.ts", "../node_modules/minimatch/src/unescape.ts", "../node_modules/minimatch/src/ast.ts", "../node_modules/minimatch/src/escape.ts", "../node_modules/minimatch/src/index.ts", "../src/cds/compiler/retry.ts", "../src/cds/compiler/validator.ts", "../src/diagnostics.ts", "../src/packageManager/cacheInstaller.ts", "../src/packageManager/versionResolver.ts", "../src/packageManager/projectInstaller.ts", "../src/cds/compiler/graph.ts", "../src/cds/compiler/project.ts", "../src/cds/indexer.ts", "../src/cds/parser/graph.ts", "../src/cds/parser/functions.ts", "../src/codeql.ts", "../src/utils.ts"],
+  "sourcesContent": ["import { join } from 'path';\n\nimport { sync as globSync } from 'glob';\n\nimport { orchestrateCompilation } from './src/cds/compiler';\nimport { orchestrateCdsIndexer } from './src/cds/indexer';\nimport { buildCdsProjectDependencyGraph, type CdsDependencyGraph } from './src/cds/parser';\nimport { handleEarlyExit, runJavaScriptExtractionWithMarker } from './src/codeql';\nimport {\n  addCompilationDiagnostic,\n  addDependencyGraphDiagnostic,\n  addDependencyInstallationDiagnostic,\n  addEnvironmentSetupDiagnostic,\n  addNoCdsProjectsDiagnostic,\n} from './src/diagnostics';\nimport { setupAndValidateEnvironment } from './src/environment';\nimport {\n  cdsExtractorLog,\n  generateStatusReport,\n  logExtractorStart,\n  logExtractorStop,\n  logPerformanceMilestone,\n  logPerformanceTrackingStart,\n  logPerformanceTrackingStop,\n  setSourceRootDirectory,\n} from './src/logging';\nimport { cacheInstallDependencies } from './src/packageManager';\nimport { validateArguments } from './src/utils';\n\n// ============================================================================\n// Main Extraction Flow\n// ============================================================================\n\n// Validate arguments\nconst validationResult = validateArguments(process.argv);\nif (!validationResult.isValid) {\n  console.warn(validationResult.usageMessage);\n  console.log(\n    `CDS extractor terminated due to invalid arguments: ${validationResult.usageMessage}`,\n  );\n  console.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n  process.exit(0);\n}\n\nconst { sourceRoot } = validationResult.args!;\n\n// Initialize logging\nsetSourceRootDirectory(sourceRoot);\nlogExtractorStart(sourceRoot);\n\n// Setup and validate environment\nlogPerformanceTrackingStart('Environment Setup');\nconst {\n  success: envSetupSuccess,\n  errorMessages,\n  codeqlExePath,\n  autobuildScriptPath,\n  platformInfo,\n} = setupAndValidateEnvironment(sourceRoot);\nlogPerformanceTrackingStop('Environment Setup');\n\nif (!envSetupSuccess) {\n  const codeqlExe = platformInfo.isWindows ? 'codeql.exe' : 'codeql';\n  const errorMessage = `'${codeqlExe} database index-files --language cds' terminated early due to: ${errorMessages.join(', ')}.`;\n  cdsExtractorLog('warn', errorMessage);\n\n  if (codeqlExePath) {\n    addEnvironmentSetupDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n  }\n\n  logExtractorStop(\n    false,\n    'Warning: Environment setup failed, continuing with limited functionality',\n  );\n} else {\n  process.chdir(sourceRoot);\n}\n\ncdsExtractorLog(\n  'info',\n  `CodeQL CDS extractor using autobuild mode for scan of project source root directory '${sourceRoot}'.`,\n);\n\n// Build CDS project dependency graph\ncdsExtractorLog('info', 'Building CDS project dependency graph...');\nlet dependencyGraph: CdsDependencyGraph;\n\ntry {\n  logPerformanceTrackingStart('Dependency Graph Build');\n  dependencyGraph = buildCdsProjectDependencyGraph(sourceRoot);\n  logPerformanceTrackingStop('Dependency Graph Build');\n\n  logPerformanceMilestone(\n    'Dependency graph created',\n    `${dependencyGraph.projects.size} projects, ${dependencyGraph.statusSummary.totalCdsFiles} CDS files`,\n  );\n\n  // Log project details\n  if (dependencyGraph.projects.size > 0) {\n    for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n      cdsExtractorLog(\n        'info',\n        `Project: ${projectDir}, Status: ${project.status}, CDS files: ${project.cdsFiles.length}, Compilation targets: ${project.compilationTargets.length}`,\n      );\n    }\n  } else {\n    // No CDS projects detected - try direct file search as diagnostic\n    cdsExtractorLog(\n      'error',\n      'No CDS projects were detected. This is an unrecoverable error as there is nothing to scan.',\n    );\n\n    try {\n      const allCdsFiles = Array.from(\n        new Set([\n          ...globSync(join(sourceRoot, '**/*.cds'), {\n            ignore: ['**/node_modules/**', '**/.git/**'],\n            windowsPathsNoEscape: true,\n          }),\n        ]),\n      );\n      cdsExtractorLog(\n        'info',\n        `Direct search found ${allCdsFiles.length} CDS files in the source tree.`,\n      );\n\n      if (allCdsFiles.length > 0) {\n        cdsExtractorLog(\n          'info',\n          `Sample CDS files: ${allCdsFiles.slice(0, 5).join(', ')}${allCdsFiles.length > 5 ? ', ...' : ''}`,\n        );\n        cdsExtractorLog(\n          'error',\n          'CDS files were found but no projects were detected. This indicates a problem with project detection logic.',\n        );\n      } else {\n        cdsExtractorLog(\n          'info',\n          'No CDS files found in the source tree. This may be expected if the source does not contain CAP/CDS projects.',\n        );\n      }\n    } catch (globError) {\n      cdsExtractorLog('warn', `Could not perform direct CDS file search: ${String(globError)}`);\n    }\n\n    const warningMessage =\n      'No CDS projects were detected. This may be expected if the source does not contain CAP/CDS projects.';\n    if (codeqlExePath) {\n      addNoCdsProjectsDiagnostic(sourceRoot, warningMessage, codeqlExePath);\n    }\n\n    logExtractorStop(false, 'Warning: No CDS projects detected, skipping CDS-specific processing');\n    handleEarlyExit(\n      sourceRoot,\n      autobuildScriptPath || '',\n      codeqlExePath,\n      'JavaScript extraction completed (CDS processing was skipped)',\n    );\n  }\n} catch (error) {\n  const errorMessage = `Failed to build CDS dependency graph: ${String(error)}`;\n  cdsExtractorLog('error', errorMessage);\n\n  if (codeqlExePath) {\n    addDependencyGraphDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n  }\n\n  logExtractorStop(\n    false,\n    'Warning: Dependency graph build failed, skipping CDS-specific processing',\n  );\n  handleEarlyExit(\n    sourceRoot,\n    autobuildScriptPath || '',\n    codeqlExePath,\n    'JavaScript extraction completed (CDS processing was skipped)',\n  );\n}\n\n// Install dependencies\nlogPerformanceTrackingStart('Dependency Installation');\nconst projectCacheDirMap = cacheInstallDependencies(dependencyGraph, sourceRoot, codeqlExePath);\nlogPerformanceTrackingStop('Dependency Installation');\n\nif (projectCacheDirMap.size === 0) {\n  cdsExtractorLog(\n    'error',\n    'No project cache directory mappings were created. This indicates that dependency installation failed for all discovered projects.',\n  );\n\n  if (dependencyGraph.projects.size > 0) {\n    const errorMessage = `Found ${dependencyGraph.projects.size} CDS projects but failed to install dependencies for any of them. Cannot proceed with compilation.`;\n    cdsExtractorLog('error', errorMessage);\n\n    if (codeqlExePath) {\n      addDependencyInstallationDiagnostic(sourceRoot, errorMessage, codeqlExePath);\n    }\n\n    logExtractorStop(\n      false,\n      'Warning: Dependency installation failed for all projects, continuing with limited functionality',\n    );\n  }\n\n  cdsExtractorLog(\n    'warn',\n    'No projects and no cache mappings - this should have been detected earlier.',\n  );\n}\n\n// Run cds-indexer for projects that use it (before compilation)\nlogPerformanceTrackingStart('CDS Indexer');\nconst cdsIndexerSummary = orchestrateCdsIndexer(\n  dependencyGraph,\n  sourceRoot,\n  projectCacheDirMap,\n  codeqlExePath,\n);\nlogPerformanceTrackingStop('CDS Indexer');\n\nif (cdsIndexerSummary.projectsRequiringIndexer > 0) {\n  logPerformanceMilestone(\n    'CDS indexer completed',\n    `${cdsIndexerSummary.successfulRuns} succeeded, ${cdsIndexerSummary.failedRuns} failed`,\n  );\n}\n\n// Collect all CDS files to process\nconst cdsFilePathsToProcess: string[] = [];\nfor (const project of dependencyGraph.projects.values()) {\n  cdsFilePathsToProcess.push(...project.cdsFiles);\n}\n\ncdsExtractorLog(\n  'info',\n  `Found ${cdsFilePathsToProcess.length} total CDS files, ${dependencyGraph.statusSummary.totalCdsFiles} CDS files in dependency graph`,\n);\n\n// Compile CDS files\nlogPerformanceTrackingStart('CDS Compilation');\ntry {\n  orchestrateCompilation(dependencyGraph, projectCacheDirMap, codeqlExePath);\n\n  if (!dependencyGraph.statusSummary.overallSuccess) {\n    cdsExtractorLog(\n      'error',\n      `Compilation completed with failures: ${dependencyGraph.statusSummary.failedCompilations} failed out of ${dependencyGraph.statusSummary.totalCompilationTasks} total tasks`,\n    );\n\n    for (const error of dependencyGraph.errors.critical) {\n      cdsExtractorLog('error', `Critical error in ${error.phase}: ${error.message}`);\n    }\n  }\n\n  logPerformanceTrackingStop('CDS Compilation');\n  logPerformanceMilestone('CDS compilation completed');\n} catch (error) {\n  logPerformanceTrackingStop('CDS Compilation');\n  cdsExtractorLog('error', `Compilation orchestration failed: ${String(error)}`);\n\n  if (cdsFilePathsToProcess.length > 0) {\n    addCompilationDiagnostic(\n      cdsFilePathsToProcess[0],\n      `Compilation orchestration failed: ${String(error)}`,\n      codeqlExePath,\n      sourceRoot,\n    );\n  }\n}\n\n// Run JavaScript extraction with marker file handling\nconst extractionSuccess = runJavaScriptExtractionWithMarker(\n  sourceRoot,\n  autobuildScriptPath,\n  codeqlExePath,\n  dependencyGraph,\n);\n\nlogExtractorStop(\n  extractionSuccess,\n  extractionSuccess ? 'CDS extraction completed successfully' : 'JavaScript extractor failed',\n);\n\ncdsExtractorLog(\n  'info',\n  'CDS Extractor Status Report : Final...\\n' + generateStatusReport(dependencyGraph),\n);\n\nconsole.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ? Math.abs(numeric(n[2])) : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: any) => void = (\n  pattern: any,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string): c is ExtglobType =>\n  types.has(c as ExtglobType)\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  readonly #parent?: AST\n  readonly #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n  ): number {\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        if (!opt.noext && isExtglobType(c) && str.charAt(i) === '(') {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      if (isExtglobType(c) && str.charAt(i) === '(') {\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) this.#fillNegs()\n    if (!this.type) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      this.#parts = [s]\n      this.type = null\n      this.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    // XXX abstract out this map method\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #partsToRegExp(dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    const options = this.options\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          if (pdi > fdi) {\n            pattern = pattern.slice(pdi)\n          } else if (fdi > pdi) {\n            file = file.slice(fdi)\n          }\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    this.debug('matchOne', this, { file, pattern })\n    this.debug('matchOne', file.length, pattern.length)\n\n    for (\n      var fi = 0, pi = 0, fl = file.length, pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      var p = pattern[pi]\n      var f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      if (p === GLOBSTAR) {\n        this.debug('GLOBSTAR', [pattern, p, f])\n\n        // \"**\"\n        // a/**/b/**/c would match the following:\n        // a/b/x/y/z/c\n        // a/x/y/z/b/c\n        // a/b/x/b/x/c\n        // a/b/c\n        // To do this, take the rest of the pattern after\n        // the **, and see if it would match the file remainder.\n        // If so, return success.\n        // If not, the ** \"swallows\" a segment, and try again.\n        // This is recursively awful.\n        //\n        // a/**/b/**/c matching a/b/x/y/z/c\n        // - a matches a\n        // - doublestar\n        //   - matchOne(b/x/y/z/c, b/**/c)\n        //     - b matches b\n        //     - doublestar\n        //       - matchOne(x/y/z/c, c) -> no\n        //       - matchOne(y/z/c, c) -> no\n        //       - matchOne(z/c, c) -> no\n        //       - matchOne(c, c) yes, hit\n        var fr = fi\n        var pr = pi + 1\n        if (pr === pl) {\n          this.debug('** at the end')\n          // a ** at the end will just swallow the rest.\n          // We have found a match.\n          // however, it will not swallow /.x, unless\n          // options.dot is set.\n          // . and .. are *never* matched by **, for explosively\n          // exponential reasons.\n          for (; fi < fl; fi++) {\n            if (\n              file[fi] === '.' ||\n              file[fi] === '..' ||\n              (!options.dot && file[fi].charAt(0) === '.')\n            )\n              return false\n          }\n          return true\n        }\n\n        // ok, let's see if we can swallow whatever we can.\n        while (fr < fl) {\n          var swallowee = file[fr]\n\n          this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n          // XXX remove this slice.  Just pass the start index.\n          if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n            this.debug('globstar found match!', fr, fl, swallowee)\n            // found a match.\n            return true\n          } else {\n            // can't swallow \".\" or \"..\" ever.\n            // can only swallow \".foo\" when explicitly asked.\n            if (\n              swallowee === '.' ||\n              swallowee === '..' ||\n              (!options.dot && swallowee.charAt(0) === '.')\n            ) {\n              this.debug('dot detected!', file, fr, pattern, pr)\n              break\n            }\n\n            // ** swallows a segment, and continue.\n            this.debug('globstar swallow a segment, and continue')\n            fr++\n          }\n        }\n\n        // no match was found.\n        // However, in partial mode, we can't say this is necessarily over.\n        /* c8 ignore start */\n        if (partial) {\n          // ran out of file\n          this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n          if (fr === fl) {\n            return true\n          }\n        }\n        /* c8 ignore stop */\n        return false\n      }\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { fileURLToPath } from 'node:url'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignored` and `childrenIgnored`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n\n  /**\n   * Do not match any children of any matches. For example, the pattern\n   * `**\\/foo` would match `a/foo`, but not `a/foo/b/foo` in this mode.\n   *\n   * This is especially useful for cases like \"find all `node_modules`\n   * folders, but not the ones in `node_modules`\".\n   *\n   * In order to support this, the `Ignore` implementation must support an\n   * `add(pattern: string)` method. If using the default `Ignore` class, then\n   * this is fine, but if this is set to `false`, and a custom `Ignore` is\n   * provided that does not have an `add()` method, then it will throw an\n   * error.\n   *\n   * **Caveat** It *only* ignores matches that would be a descendant of a\n   * previous match, and only if that descendant is matched *after* the\n   * ancestor is encountered. Since the file system walk happens in\n   * indeterminate order, it's possible that a match will already be added\n   * before its ancestor, if multiple or braced patterns are used.\n   *\n   * For example:\n   *\n   * ```ts\n   * const results = await glob([\n   *   // likely to match first, since it's just a stat\n   *   'a/b/c/d/e/f',\n   *\n   *   // this pattern is more complicated! It must to various readdir()\n   *   // calls and test the results against a regular expression, and that\n   *   // is certainly going to take a little bit longer.\n   *   //\n   *   // So, later on, it encounters a match at 'a/b/c/d/e', but it's too\n   *   // late to ignore a/b/c/d/e/f, because it's already been emitted.\n   *   'a/[bdf]/?/[a-z]/*',\n   * ], { includeChildMatches: false })\n   * ```\n   *\n   * It's best to only set this to `false` if you can be reasonably sure that\n   * no components of the pattern will potentially match one another's file\n   * system descendants, or if the occasional included child entry will not\n   * cause problems.\n   *\n   * @default true\n   */\n  includeChildMatches?: boolean\n\n  /**\n   * max number of `{...}` patterns to expand. Default `1_000`.\n   *\n   * Note: this is much less than minimatch's default of `100_000`,\n   * because Glob has higher memory requirements due to walking\n   * the file system tree.\n   */\n  braceExpandMax?: number\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse ? string\n  : Opts extends GlobOptionsWithFileTypesUnset ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? true\n  : Opts extends GlobOptionsWithFileTypesFalse ? false\n  : Opts extends GlobOptionsWithFileTypesUnset ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n  includeChildMatches: boolean\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n    this.includeChildMatches = opts.includeChildMatches !== false\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as { allowWindowsEscape?: boolean }).allowWindowsEscape ===\n        false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32' ? PathScurryWin32\n        : opts.platform === 'darwin' ? PathScurryDarwin\n        : opts.platform ? PathScurryPosix\n        : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      braceExpandMax: 10_000,\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      // default nocase based on platform\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []],\n    )\n    this.patterns = matchSet.map((set, i) => {\n      const g = globParts[i]\n      /* c8 ignore start */\n      if (!g) throw new Error('invalid pattern object')\n      /* c8 ignore stop */\n      return new Pattern(set, g, 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n", "/**\n * @module LRUCache\n */\n\n// module-private names and types\n// this provides the default Perf object source.\n// it can be passed in via configuration to override it\n// for a single LRU object.\nexport type Perf = { now: () => number }\nconst defaultPerf: Perf =\n  (\n    typeof performance === 'object' &&\n    performance &&\n    typeof performance.now === 'function'\n  ) ?\n    performance\n  : Date\n\nconst warned = new Set<string>()\n\n// either a function or a class\ntype ForC = ((...a: any[]) => any) | { new (...a: any[]): any }\n\n/* c8 ignore start */\nconst PROCESS = (\n  typeof process === 'object' && !!process ?\n    process\n  : {}) as { [k: string]: any }\n/* c8 ignore start */\n\nconst emitWarning = (\n  msg: string,\n  type: string,\n  code: string,\n  fn: ForC,\n) => {\n  typeof PROCESS.emitWarning === 'function' ?\n    PROCESS.emitWarning(msg, type, code, fn)\n  : console.error(`[${code}] ${type}: ${msg}`)\n}\n\nlet AC = globalThis.AbortController\nlet AS = globalThis.AbortSignal\n\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n  //@ts-ignore\n  AS = class AbortSignal {\n    onabort?: (...a: any[]) => any\n    _onabort: ((...a: any[]) => any)[] = []\n    reason?: any\n    aborted: boolean = false\n    addEventListener(_: string, fn: (...a: any[]) => any) {\n      this._onabort.push(fn)\n    }\n  }\n  //@ts-ignore\n  AC = class AbortController {\n    constructor() {\n      warnACPolyfill()\n    }\n    signal = new AS()\n    abort(reason: any) {\n      if (this.signal.aborted) return\n      //@ts-ignore\n      this.signal.reason = reason\n      //@ts-ignore\n      this.signal.aborted = true\n      //@ts-ignore\n      for (const fn of this.signal._onabort) {\n        fn(reason)\n      }\n      this.signal.onabort?.(reason)\n    }\n  }\n  let printACPolyfillWarning =\n    PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1'\n  const warnACPolyfill = () => {\n    if (!printACPolyfillWarning) return\n    printACPolyfillWarning = false\n    emitWarning(\n      'AbortController is not defined. If using lru-cache in ' +\n        'node 14, load an AbortController polyfill from the ' +\n        '`node-abort-controller` package. A minimal polyfill is ' +\n        'provided for use by LRUCache.fetch(), but it should not be ' +\n        'relied upon in other contexts (eg, passing it to other APIs that ' +\n        'use AbortController/AbortSignal might have undesirable effects). ' +\n        'You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.',\n      'NO_ABORT_CONTROLLER',\n      'ENOTSUP',\n      warnACPolyfill,\n    )\n  }\n}\n/* c8 ignore stop */\n\nconst shouldWarn = (code: string) => !warned.has(code)\n\nconst TYPE = Symbol('type')\nexport type PosInt = number & { [TYPE]: 'Positive Integer' }\nexport type Index = number & { [TYPE]: 'LRUCache Index' }\n\nconst isPosInt = (n: any): n is PosInt =>\n  n && n === Math.floor(n) && n > 0 && isFinite(n)\n\nexport type UintArray = Uint8Array | Uint16Array | Uint32Array\nexport type NumberArray = UintArray | number[]\n\n/* c8 ignore start */\n// This is a little bit ridiculous, tbh.\n// The maximum array length is 2^32-1 or thereabouts on most JS impls.\n// And well before that point, you're caching the entire world, I mean,\n// that's ~32GB of just integers for the next/prev links, plus whatever\n// else to hold that many keys and values.  Just filling the memory with\n// zeroes at init time is brutal when you get that big.\n// But why not be complete?\n// Maybe in the future, these limits will have expanded.\nconst getUintArray = (max: number) =>\n  !isPosInt(max) ? null\n  : max <= Math.pow(2, 8) ? Uint8Array\n  : max <= Math.pow(2, 16) ? Uint16Array\n  : max <= Math.pow(2, 32) ? Uint32Array\n  : max <= Number.MAX_SAFE_INTEGER ? ZeroArray\n  : null\n/* c8 ignore stop */\n\nclass ZeroArray extends Array<number> {\n  constructor(size: number) {\n    super(size)\n    this.fill(0)\n  }\n}\nexport type { ZeroArray }\nexport type { Stack }\n\nexport type StackLike = Stack | Index[]\nclass Stack {\n  heap: NumberArray\n  length: number\n  // private constructor\n  static #constructing: boolean = false\n  static create(max: number): StackLike {\n    const HeapCls = getUintArray(max)\n    if (!HeapCls) return []\n    Stack.#constructing = true\n    const s = new Stack(max, HeapCls)\n    Stack.#constructing = false\n    return s\n  }\n  constructor(max: number, HeapCls: { new (n: number): NumberArray }) {\n    /* c8 ignore start */\n    if (!Stack.#constructing) {\n      throw new TypeError('instantiate Stack using Stack.create(n)')\n    }\n    /* c8 ignore stop */\n    this.heap = new HeapCls(max)\n    this.length = 0\n  }\n  push(n: Index) {\n    this.heap[this.length++] = n\n  }\n  pop(): Index {\n    return this.heap[--this.length] as Index\n  }\n}\n\n/**\n * Promise representing an in-progress {@link LRUCache#fetch} call\n */\nexport type BackgroundFetch<V> = Promise<V | undefined> & {\n  __returned: BackgroundFetch<V> | undefined\n  __abortController: AbortController\n  __staleWhileFetching: V | undefined\n}\n\nexport type DisposeTask<K, V> = [\n  value: V,\n  key: K,\n  reason: LRUCache.DisposeReason,\n]\n\nexport namespace LRUCache {\n  /**\n   * An integer greater than 0, reflecting the calculated size of items\n   */\n  export type Size = number\n\n  /**\n   * Integer greater than 0, representing some number of milliseconds, or the\n   * time at which a TTL started counting from.\n   */\n  export type Milliseconds = number\n\n  /**\n   * An integer greater than 0, reflecting a number of items\n   */\n  export type Count = number\n\n  /**\n   * The reason why an item was removed from the cache, passed\n   * to the {@link Disposer} methods.\n   *\n   * - `evict`: The item was evicted because it is the least recently used,\n   *   and the cache is full.\n   * - `set`: A new value was set, overwriting the old value being disposed.\n   * - `delete`: The item was explicitly deleted, either by calling\n   *   {@link LRUCache#delete}, {@link LRUCache#clear}, or\n   *   {@link LRUCache#set} with an undefined value.\n   * - `expire`: The item was removed due to exceeding its TTL.\n   * - `fetch`: A {@link OptionsBase#fetchMethod} operation returned\n   *   `undefined` or was aborted, causing the item to be deleted.\n   */\n  export type DisposeReason =\n    | 'evict'\n    | 'set'\n    | 'delete'\n    | 'expire'\n    | 'fetch'\n  /**\n   * A method called upon item removal, passed as the\n   * {@link OptionsBase.dispose} and/or\n   * {@link OptionsBase.disposeAfter} options.\n   */\n  export type Disposer<K, V> = (\n    value: V,\n    key: K,\n    reason: DisposeReason,\n  ) => void\n\n  /**\n   * The reason why an item was added to the cache, passed\n   * to the {@link Inserter} methods.\n   *\n   * - `add`: the item was not found in the cache, and was added\n   * - `update`: the item was in the cache, with the same value provided\n   * - `replace`: the item was in the cache, and replaced\n   */\n  export type InsertReason = 'add' | 'update' | 'replace'\n\n  /**\n   * A method called upon item insertion, passed as the\n   * {@link OptionsBase.insert}\n   */\n  export type Inserter<K, V> = (\n    value: V,\n    key: K,\n    reason: InsertReason,\n  ) => void\n\n  /**\n   * A function that returns the effective calculated size\n   * of an entry in the cache.\n   */\n  export type SizeCalculator<K, V> = (value: V, key: K) => Size\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.fetchMethod} function.\n   */\n  export interface FetcherOptions<K, V, FC = unknown> {\n    signal: AbortSignal\n    options: FetcherFetchOptions<K, V, FC>\n    /**\n     * Object provided in the {@link FetchOptions.context} option to\n     * {@link LRUCache#fetch}\n     */\n    context: FC\n  }\n\n  /**\n   * Occasionally, it may be useful to track the internal behavior of the\n   * cache, particularly for logging, debugging, or for behavior within the\n   * `fetchMethod`. To do this, you can pass a `status` object to the\n   * {@link LRUCache#fetch}, {@link LRUCache#get}, {@link LRUCache#set},\n   * {@link LRUCache#memo}, and {@link LRUCache#has} methods.\n   *\n   * The `status` option should be a plain JavaScript object. The following\n   * fields will be set on it appropriately, depending on the situation.\n   */\n  export interface Status<V> {\n    /**\n     * The status of a set() operation.\n     *\n     * - add: the item was not found in the cache, and was added\n     * - update: the item was in the cache, with the same value provided\n     * - replace: the item was in the cache, and replaced\n     * - miss: the item was not added to the cache for some reason\n     */\n    set?: 'add' | 'update' | 'replace' | 'miss'\n\n    /**\n     * the ttl stored for the item, or undefined if ttls are not used.\n     */\n    ttl?: Milliseconds\n\n    /**\n     * the start time for the item, or undefined if ttls are not used.\n     */\n    start?: Milliseconds\n\n    /**\n     * The timestamp used for TTL calculation\n     */\n    now?: Milliseconds\n\n    /**\n     * the remaining ttl for the item, or undefined if ttls are not used.\n     */\n    remainingTTL?: Milliseconds\n\n    /**\n     * The calculated size for the item, if sizes are used.\n     */\n    entrySize?: Size\n\n    /**\n     * The total calculated size of the cache, if sizes are used.\n     */\n    totalCalculatedSize?: Size\n\n    /**\n     * A flag indicating that the item was not stored, due to exceeding the\n     * {@link OptionsBase.maxEntrySize}\n     */\n    maxEntrySizeExceeded?: true\n\n    /**\n     * The old value, specified in the case of `set:'update'` or\n     * `set:'replace'`\n     */\n    oldValue?: V\n\n    /**\n     * The results of a {@link LRUCache#has} operation\n     *\n     * - hit: the item was found in the cache\n     * - stale: the item was found in the cache, but is stale\n     * - miss: the item was not found in the cache\n     */\n    has?: 'hit' | 'stale' | 'miss'\n\n    /**\n     * The status of a {@link LRUCache#fetch} operation.\n     * Note that this can change as the underlying fetch() moves through\n     * various states.\n     *\n     * - inflight: there is another fetch() for this key which is in process\n     * - get: there is no {@link OptionsBase.fetchMethod}, so\n     *   {@link LRUCache#get} was called.\n     * - miss: the item is not in cache, and will be fetched.\n     * - hit: the item is in the cache, and was resolved immediately.\n     * - stale: the item is in the cache, but stale.\n     * - refresh: the item is in the cache, and not stale, but\n     *   {@link FetchOptions.forceRefresh} was specified.\n     */\n    fetch?: 'get' | 'inflight' | 'miss' | 'hit' | 'stale' | 'refresh'\n\n    /**\n     * The {@link OptionsBase.fetchMethod} was called\n     */\n    fetchDispatched?: true\n\n    /**\n     * The cached value was updated after a successful call to\n     * {@link OptionsBase.fetchMethod}\n     */\n    fetchUpdated?: true\n\n    /**\n     * The reason for a fetch() rejection.  Either the error raised by the\n     * {@link OptionsBase.fetchMethod}, or the reason for an\n     * AbortSignal.\n     */\n    fetchError?: Error\n\n    /**\n     * The fetch received an abort signal\n     */\n    fetchAborted?: true\n\n    /**\n     * The abort signal received was ignored, and the fetch was allowed to\n     * continue.\n     */\n    fetchAbortIgnored?: true\n\n    /**\n     * The fetchMethod promise resolved successfully\n     */\n    fetchResolved?: true\n\n    /**\n     * The fetchMethod promise was rejected\n     */\n    fetchRejected?: true\n\n    /**\n     * The status of a {@link LRUCache#get} operation.\n     *\n     * - fetching: The item is currently being fetched.  If a previous value\n     *   is present and allowed, that will be returned.\n     * - stale: The item is in the cache, and is stale.\n     * - hit: the item is in the cache\n     * - miss: the item is not in the cache\n     */\n    get?: 'stale' | 'hit' | 'miss'\n\n    /**\n     * A fetch or get operation returned a stale value.\n     */\n    returnedStale?: true\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#fetch}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link OptionsBase.noDeleteOnFetchRejection},\n   * {@link OptionsBase.allowStaleOnFetchRejection},\n   * {@link FetchOptions.forceRefresh}, and\n   * {@link FetcherOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.fetchMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the fetchMethod is called.\n   */\n  export interface FetcherFetchOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    status?: Status<V>\n    size?: Size\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#fetch} method.\n   */\n  export interface FetchOptions<K, V, FC>\n    extends FetcherFetchOptions<K, V, FC> {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.fetchMethod} as\n     * the {@link FetcherOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    signal?: AbortSignal\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface FetchOptionsWithContext<K, V, FC>\n    extends FetchOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface FetchOptionsNoContext<K, V>\n    extends FetchOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  export interface MemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.memoMethod} as\n     * the {@link MemoizerOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface MemoOptionsWithContext<K, V, FC>\n    extends MemoOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface MemoOptionsNoContext<K, V>\n    extends MemoOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.memoMethod} function.\n   */\n  export interface MemoizerOptions<K, V, FC = unknown> {\n    options: MemoizerMemoOptions<K, V, FC>\n    /**\n     * Object provided in the {@link MemoOptions.context} option to\n     * {@link LRUCache#memo}\n     */\n    context: FC\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#memo}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link MemoOptions.forceRefresh}, and\n   * {@link MemoOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.memoMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the memoMethod is called.\n   */\n  export interface MemoizerMemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n    > {\n    status?: Status<V>\n    size?: Size\n    start?: Milliseconds\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#has} method.\n   */\n  export interface HasOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'updateAgeOnHas'> {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#get} method.\n   */\n  export interface GetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'allowStale' | 'updateAgeOnGet' | 'noDeleteOnStaleGet'\n    > {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#peek} method.\n   */\n  export interface PeekOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'allowStale'> {}\n\n  /**\n   * Options that may be passed to the {@link LRUCache#set} method.\n   */\n  export interface SetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'sizeCalculation' | 'ttl' | 'noDisposeOnSet' | 'noUpdateTTL'\n    > {\n    /**\n     * If size tracking is enabled, then setting an explicit size\n     * in the {@link LRUCache#set} call will prevent calling the\n     * {@link OptionsBase.sizeCalculation} function.\n     */\n    size?: Size\n    /**\n     * If TTL tracking is enabled, then setting an explicit start\n     * time in the {@link LRUCache#set} call will override the\n     * default time from `performance.now()` or `Date.now()`.\n     *\n     * Note that it must be a valid value for whichever time-tracking\n     * method is in use.\n     */\n    start?: Milliseconds\n    status?: Status<V>\n  }\n\n  /**\n   * The type signature for the {@link OptionsBase.fetchMethod} option.\n   */\n  export type Fetcher<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: FetcherOptions<K, V, FC>,\n  ) => Promise<V | undefined | void> | V | undefined | void\n\n  /**\n   * the type signature for the {@link OptionsBase.memoMethod} option.\n   */\n  export type Memoizer<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: MemoizerOptions<K, V, FC>,\n  ) => V\n\n  /**\n   * Options which may be passed to the {@link LRUCache} constructor.\n   *\n   * Most of these may be overridden in the various options that use\n   * them.\n   *\n   * Despite all being technically optional, the constructor requires that\n   * a cache is at minimum limited by one or more of {@link OptionsBase.max},\n   * {@link OptionsBase.ttl}, or {@link OptionsBase.maxSize}.\n   *\n   * If {@link OptionsBase.ttl} is used alone, then it is strongly advised\n   * (and in fact required by the type definitions here) that the cache\n   * also set {@link OptionsBase.ttlAutopurge}, to prevent potentially\n   * unbounded storage.\n   *\n   * All options are also available on the {@link LRUCache} instance, making\n   * it safe to pass an LRUCache instance as the options argumemnt to\n   * make another empty cache of the same type.\n   *\n   * Some options are marked as read-only, because changing them after\n   * instantiation is not safe. Changing any of the other options will of\n   * course only have an effect on subsequent method calls.\n   */\n  export interface OptionsBase<K, V, FC> {\n    /**\n     * The maximum number of items to store in the cache before evicting\n     * old entries. This is read-only on the {@link LRUCache} instance,\n     * and may not be overridden.\n     *\n     * If set, then storage space will be pre-allocated at construction\n     * time, and the cache will perform significantly faster.\n     *\n     * Note that significantly fewer items may be stored, if\n     * {@link OptionsBase.maxSize} and/or {@link OptionsBase.ttl} are also\n     * set.\n     *\n     * **It is strongly recommended to set a `max` to prevent unbounded growth\n     * of the cache.**\n     */\n    max?: Count\n\n    /**\n     * Max time in milliseconds for items to live in cache before they are\n     * considered stale.  Note that stale items are NOT preemptively removed by\n     * default, and MAY live in the cache, contributing to its LRU max, long\n     * after they have expired, unless {@link OptionsBase.ttlAutopurge} is\n     * set.\n     *\n     * If set to `0` (the default value), then that means \"do not track\n     * TTL\", not \"expire immediately\".\n     *\n     * Also, as this cache is optimized for LRU/MRU operations, some of\n     * the staleness/TTL checks will reduce performance, as they will incur\n     * overhead by deleting items.\n     *\n     * This is not primarily a TTL cache, and does not make strong TTL\n     * guarantees. There is no pre-emptive pruning of expired items, but you\n     * _may_ set a TTL on the cache, and it will treat expired items as missing\n     * when they are fetched, and delete them.\n     *\n     * Optional, but must be a non-negative integer in ms if specified.\n     *\n     * This may be overridden by passing an options object to `cache.set()`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if ttl tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * If ttl tracking is enabled, and `max` and `maxSize` are not set,\n     * and `ttlAutopurge` is not set, then a warning will be emitted\n     * cautioning about the potential for unbounded memory consumption.\n     * (The TypeScript definitions will also discourage this.)\n     */\n    ttl?: Milliseconds\n\n    /**\n     * Minimum amount of time in ms in which to check for staleness.\n     * Defaults to 1, which means that the current time is checked\n     * at most once per millisecond.\n     *\n     * Set to 0 to check the current time every time staleness is tested.\n     * (This reduces performance, and is theoretically unnecessary.)\n     *\n     * Setting this to a higher value will improve performance somewhat\n     * while using ttl tracking, albeit at the expense of keeping stale\n     * items around a bit longer than their TTLs would indicate.\n     *\n     * @default 1\n     */\n    ttlResolution?: Milliseconds\n\n    /**\n     * Preemptively remove stale items from the cache.\n     *\n     * Note that this may *significantly* degrade performance, especially if\n     * the cache is storing a large number of items. It is almost always best\n     * to just leave the stale items in the cache, and let them fall out as new\n     * items are added.\n     *\n     * Note that this means that {@link OptionsBase.allowStale} is a bit\n     * pointless, as stale items will be deleted almost as soon as they\n     * expire.\n     *\n     * Use with caution!\n     */\n    ttlAutopurge?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever it is retrieved from cache with\n     * {@link LRUCache#get}, causing it to not expire. (It can still fall out\n     * of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     */\n    updateAgeOnGet?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever its presence in the cache is\n     * checked with {@link LRUCache#has}, causing it to not expire. (It can\n     * still fall out of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     */\n    updateAgeOnHas?: boolean\n\n    /**\n     * Allow {@link LRUCache#get} and {@link LRUCache#fetch} calls to return\n     * stale data, if available.\n     *\n     * By default, if you set `ttl`, stale items will only be deleted from the\n     * cache when you `get(key)`. That is, it's not preemptively pruning items,\n     * unless {@link OptionsBase.ttlAutopurge} is set.\n     *\n     * If you set `allowStale:true`, it'll return the stale value *as well as*\n     * deleting it. If you don't set this, then it'll return `undefined` when\n     * you try to get a stale entry.\n     *\n     * Note that when a stale entry is fetched, _even if it is returned due to\n     * `allowStale` being set_, it is removed from the cache immediately. You\n     * can suppress this behavior by setting\n     * {@link OptionsBase.noDeleteOnStaleGet}, either in the constructor, or in\n     * the options provided to {@link LRUCache#get}.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     * The `cache.has()` method will always return `false` for stale items.\n     *\n     * Only relevant if a ttl is set.\n     */\n    allowStale?: boolean\n\n    /**\n     * Function that is called on items when they are dropped from the\n     * cache, as `dispose(value, key, reason)`.\n     *\n     * This can be handy if you want to close file descriptors or do\n     * other cleanup tasks when items are no longer stored in the cache.\n     *\n     * **NOTE**: It is called _before_ the item has been fully removed\n     * from the cache, so if you want to put it right back in, you need\n     * to wait until the next tick. If you try to add it back in during\n     * the `dispose()` function call, it will break things in subtle and\n     * weird ways.\n     *\n     * Unlike several other options, this may _not_ be overridden by\n     * passing an option to `set()`, for performance reasons.\n     *\n     * The `reason` will be one of the following strings, corresponding\n     * to the reason for the item's deletion:\n     *\n     * - `evict` Item was evicted to make space for a new addition\n     * - `set` Item was overwritten by a new value\n     * - `expire` Item expired its TTL\n     * - `fetch` Item was deleted due to a failed or aborted fetch, or a\n     *   fetchMethod returning `undefined.\n     * - `delete` Item was removed by explicit `cache.delete(key)`,\n     *   `cache.clear()`, or `cache.set(key, undefined)`.\n     */\n    dispose?: Disposer<K, V>\n\n    /**\n     * Function that is called when new items are inserted into the cache,\n     * as `onInsert(value, key, reason)`.\n     *\n     * This can be useful if you need to perform actions when an item is\n     * added, such as logging or tracking insertions.\n     *\n     * Unlike some other options, this may _not_ be overridden by passing\n     * an option to `set()`, for performance and consistency reasons.\n     */\n    onInsert?: Inserter<K, V>\n\n    /**\n     * The same as {@link OptionsBase.dispose}, but called *after* the entry\n     * is completely removed and the cache is once again in a clean state.\n     *\n     * It is safe to add an item right back into the cache at this point.\n     * However, note that it is *very* easy to inadvertently create infinite\n     * recursion this way.\n     */\n    disposeAfter?: Disposer<K, V>\n\n    /**\n     * Set to true to suppress calling the\n     * {@link OptionsBase.dispose} function if the entry key is\n     * still accessible within the cache.\n     *\n     * This may be overridden by passing an options object to\n     * {@link LRUCache#set}.\n     *\n     * Only relevant if `dispose` or `disposeAfter` are set.\n     */\n    noDisposeOnSet?: boolean\n\n    /**\n     * Boolean flag to tell the cache to not update the TTL when setting a new\n     * value for an existing key (ie, when updating a value rather than\n     * inserting a new value).  Note that the TTL value is _always_ set (if\n     * provided) when adding a new entry into the cache.\n     *\n     * Has no effect if a {@link OptionsBase.ttl} is not set.\n     *\n     * May be passed as an option to {@link LRUCache#set}.\n     */\n    noUpdateTTL?: boolean\n\n    /**\n     * Set to a positive integer to track the sizes of items added to the\n     * cache, and automatically evict items in order to stay below this size.\n     * Note that this may result in fewer than `max` items being stored.\n     *\n     * Attempting to add an item to the cache whose calculated size is greater\n     * that this amount will be a no-op. The item will not be cached, and no\n     * other items will be evicted.\n     *\n     * Optional, must be a positive integer if provided.\n     *\n     * Sets `maxEntrySize` to the same value, unless a different value is\n     * provided for `maxEntrySize`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if size tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * Note also that size tracking can negatively impact performance,\n     * though for most cases, only minimally.\n     */\n    maxSize?: Size\n\n    /**\n     * The maximum allowed size for any single item in the cache.\n     *\n     * If a larger item is passed to {@link LRUCache#set} or returned by a\n     * {@link OptionsBase.fetchMethod} or {@link OptionsBase.memoMethod}, then\n     * it will not be stored in the cache.\n     *\n     * Attempting to add an item whose calculated size is greater than\n     * this amount will not cache the item or evict any old items, but\n     * WILL delete an existing value if one is already present.\n     *\n     * Optional, must be a positive integer if provided. Defaults to\n     * the value of `maxSize` if provided.\n     */\n    maxEntrySize?: Size\n\n    /**\n     * A function that returns a number indicating the item's size.\n     *\n     * Requires {@link OptionsBase.maxSize} to be set.\n     *\n     * If not provided, and {@link OptionsBase.maxSize} or\n     * {@link OptionsBase.maxEntrySize} are set, then all\n     * {@link LRUCache#set} calls **must** provide an explicit\n     * {@link SetOptions.size} or sizeCalculation param.\n     */\n    sizeCalculation?: SizeCalculator<K, V>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#fetch}\n     *\n     * ```ts\n     * fetchMethod(key, staleValue, { signal, options, context })\n     * ```\n     *\n     * If `fetchMethod` is not provided, then `cache.fetch(key)` is equivalent\n     * to `Promise.resolve(cache.get(key))`.\n     *\n     * If at any time, `signal.aborted` is set to `true`, or if the\n     * `signal.onabort` method is called, or if it emits an `'abort'` event\n     * which you can listen to with `addEventListener`, then that means that\n     * the fetch should be abandoned. This may be passed along to async\n     * functions aware of AbortController/AbortSignal behavior.\n     *\n     * The `fetchMethod` should **only** return `undefined` or a Promise\n     * resolving to `undefined` if the AbortController signaled an `abort`\n     * event. In all other cases, it should return or resolve to a value\n     * suitable for adding to the cache.\n     *\n     * The `options` object is a union of the options that may be provided to\n     * `set()` and `get()`. If they are modified, then that will result in\n     * modifying the settings to `cache.set()` when the value is resolved, and\n     * in the case of\n     * {@link OptionsBase.noDeleteOnFetchRejection} and\n     * {@link OptionsBase.allowStaleOnFetchRejection}, the handling of\n     * `fetchMethod` failures.\n     *\n     * For example, a DNS cache may update the TTL based on the value returned\n     * from a remote DNS server by changing `options.ttl` in the `fetchMethod`.\n     */\n    fetchMethod?: Fetcher<K, V, FC>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#memo}\n     */\n    memoMethod?: Memoizer<K, V, FC>\n\n    /**\n     * Set to true to suppress the deletion of stale data when a\n     * {@link OptionsBase.fetchMethod} returns a rejected promise.\n     */\n    noDeleteOnFetchRejection?: boolean\n\n    /**\n     * Do not delete stale items when they are retrieved with\n     * {@link LRUCache#get}.\n     *\n     * Note that the `get` return value will still be `undefined`\n     * unless {@link OptionsBase.allowStale} is true.\n     *\n     * When using time-expiring entries with `ttl`, by default stale\n     * items will be removed from the cache when the key is accessed\n     * with `cache.get()`.\n     *\n     * Setting this option will cause stale items to remain in the cache, until\n     * they are explicitly deleted with `cache.delete(key)`, or retrieved with\n     * `noDeleteOnStaleGet` set to `false`.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     *\n     * Only relevant if a ttl is used.\n     */\n    noDeleteOnStaleGet?: boolean\n\n    /**\n     * Set to true to allow returning stale data when a\n     * {@link OptionsBase.fetchMethod} throws an error or returns a rejected\n     * promise.\n     *\n     * This differs from using {@link OptionsBase.allowStale} in that stale\n     * data will ONLY be returned in the case that the {@link LRUCache#fetch}\n     * fails, not any other times.\n     *\n     * If a `fetchMethod` fails, and there is no stale value available, the\n     * `fetch()` will resolve to `undefined`. Ie, all `fetchMethod` errors are\n     * suppressed.\n     *\n     * Implies `noDeleteOnFetchRejection`.\n     *\n     * This may be set in calls to `fetch()`, or defaulted on the constructor,\n     * or overridden by modifying the options object in the `fetchMethod`.\n     */\n    allowStaleOnFetchRejection?: boolean\n\n    /**\n     * Set to true to return a stale value from the cache when the\n     * `AbortSignal` passed to the {@link OptionsBase.fetchMethod} dispatches\n     * an `'abort'` event, whether user-triggered, or due to internal cache\n     * behavior.\n     *\n     * Unless {@link OptionsBase.ignoreFetchAbort} is also set, the underlying\n     * {@link OptionsBase.fetchMethod} will still be considered canceled, and\n     * any value it returns will be ignored and not cached.\n     *\n     * Caveat: since fetches are aborted when a new value is explicitly\n     * set in the cache, this can lead to fetch returning a stale value,\n     * since that was the fallback value _at the moment the `fetch()` was\n     * initiated_, even though the new updated value is now present in\n     * the cache.\n     *\n     * For example:\n     *\n     * ```ts\n     * const cache = new LRUCache<string, any>({\n     *   ttl: 100,\n     *   fetchMethod: async (url, oldValue, { signal }) =>  {\n     *     const res = await fetch(url, { signal })\n     *     return await res.json()\n     *   }\n     * })\n     * cache.set('https://example.com/', { some: 'data' })\n     * // 100ms go by...\n     * const result = cache.fetch('https://example.com/')\n     * cache.set('https://example.com/', { other: 'thing' })\n     * console.log(await result) // { some: 'data' }\n     * console.log(cache.get('https://example.com/')) // { other: 'thing' }\n     * ```\n     */\n    allowStaleOnFetchAbort?: boolean\n\n    /**\n     * Set to true to ignore the `abort` event emitted by the `AbortSignal`\n     * object passed to {@link OptionsBase.fetchMethod}, and still cache the\n     * resulting resolution value, as long as it is not `undefined`.\n     *\n     * When used on its own, this means aborted {@link LRUCache#fetch} calls\n     * are not immediately resolved or rejected when they are aborted, and\n     * instead take the full time to await.\n     *\n     * When used with {@link OptionsBase.allowStaleOnFetchAbort}, aborted\n     * {@link LRUCache#fetch} calls will resolve immediately to their stale\n     * cached value or `undefined`, and will continue to process and eventually\n     * update the cache when they resolve, as long as the resulting value is\n     * not `undefined`, thus supporting a \"return stale on timeout while\n     * refreshing\" mechanism by passing `AbortSignal.timeout(n)` as the signal.\n     *\n     * For example:\n     *\n     * ```ts\n     * const c = new LRUCache({\n     *   ttl: 100,\n     *   ignoreFetchAbort: true,\n     *   allowStaleOnFetchAbort: true,\n     *   fetchMethod: async (key, oldValue, { signal }) => {\n     *     // note: do NOT pass the signal to fetch()!\n     *     // let's say this fetch can take a long time.\n     *     const res = await fetch(`https://slow-backend-server/${key}`)\n     *     return await res.json()\n     *   },\n     * })\n     *\n     * // this will return the stale value after 100ms, while still\n     * // updating in the background for next time.\n     * const val = await c.fetch('key', { signal: AbortSignal.timeout(100) })\n     * ```\n     *\n     * **Note**: regardless of this setting, an `abort` event _is still\n     * emitted on the `AbortSignal` object_, so may result in invalid results\n     * when passed to other underlying APIs that use AbortSignals.\n     *\n     * This may be overridden in the {@link OptionsBase.fetchMethod} or the\n     * call to {@link LRUCache#fetch}.\n     */\n    ignoreFetchAbort?: boolean\n\n    /**\n     * In some cases, you may want to swap out the performance/Date object\n     * used for TTL tracking. This should almost certainly NOT be done in\n     * production environments!\n     *\n     * This value defaults to `global.performance` if it has a `now()` method,\n     * or the `global.Date` object otherwise.\n     */\n    perf?: Perf\n  }\n\n  export interface OptionsMaxLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    max: Count\n  }\n  export interface OptionsTTLLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    ttl: Milliseconds\n    ttlAutopurge: boolean\n  }\n  export interface OptionsSizeLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    maxSize: Size\n  }\n\n  /**\n   * The valid safe options for the {@link LRUCache} constructor\n   */\n  export type Options<K, V, FC> =\n    | OptionsMaxLimit<K, V, FC>\n    | OptionsSizeLimit<K, V, FC>\n    | OptionsTTLLimit<K, V, FC>\n\n  /**\n   * Entry objects used by {@link LRUCache#load} and {@link LRUCache#dump},\n   * and returned by {@link LRUCache#info}.\n   */\n  export interface Entry<V> {\n    value: V\n    ttl?: Milliseconds\n    size?: Size\n    start?: Milliseconds\n  }\n}\n\n/**\n * Default export, the thing you're using this module to get.\n *\n * The `K` and `V` types define the key and value types, respectively. The\n * optional `FC` type defines the type of the `context` object passed to\n * `cache.fetch()` and `cache.memo()`.\n *\n * Keys and values **must not** be `null` or `undefined`.\n *\n * All properties from the options object (with the exception of `max`,\n * `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are\n * added as normal public members. (The listed options are read-only getters.)\n *\n * Changing any of these will alter the defaults for subsequent method calls.\n */\nexport class LRUCache<K extends {}, V extends {}, FC = unknown> {\n  // options that cannot be changed without disaster\n  readonly #max: LRUCache.Count\n  readonly #maxSize: LRUCache.Size\n  readonly #dispose?: LRUCache.Disposer<K, V>\n  readonly #onInsert?: LRUCache.Inserter<K, V>\n  readonly #disposeAfter?: LRUCache.Disposer<K, V>\n  readonly #fetchMethod?: LRUCache.Fetcher<K, V, FC>\n  readonly #memoMethod?: LRUCache.Memoizer<K, V, FC>\n  readonly #perf: Perf\n\n  /**\n   * {@link LRUCache.OptionsBase.perf}\n   */\n  get perf() {\n    return this.#perf\n  }\n\n  /**\n   * {@link LRUCache.OptionsBase.ttl}\n   */\n  ttl: LRUCache.Milliseconds\n\n  /**\n   * {@link LRUCache.OptionsBase.ttlResolution}\n   */\n  ttlResolution: LRUCache.Milliseconds\n  /**\n   * {@link LRUCache.OptionsBase.ttlAutopurge}\n   */\n  ttlAutopurge: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnGet}\n   */\n  updateAgeOnGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnHas}\n   */\n  updateAgeOnHas: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStale}\n   */\n  allowStale: boolean\n\n  /**\n   * {@link LRUCache.OptionsBase.noDisposeOnSet}\n   */\n  noDisposeOnSet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noUpdateTTL}\n   */\n  noUpdateTTL: boolean\n  /**\n   * {@link LRUCache.OptionsBase.maxEntrySize}\n   */\n  maxEntrySize: LRUCache.Size\n  /**\n   * {@link LRUCache.OptionsBase.sizeCalculation}\n   */\n  sizeCalculation?: LRUCache.SizeCalculator<K, V>\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n   */\n  noDeleteOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n   */\n  noDeleteOnStaleGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n   */\n  allowStaleOnFetchAbort: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n   */\n  allowStaleOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n   */\n  ignoreFetchAbort: boolean\n\n  // computed properties\n  #size: LRUCache.Count\n  #calculatedSize: LRUCache.Size\n  #keyMap: Map<K, Index>\n  #keyList: (K | undefined)[]\n  #valList: (V | BackgroundFetch<V> | undefined)[]\n  #next: NumberArray\n  #prev: NumberArray\n  #head: Index\n  #tail: Index\n  #free: StackLike\n  #disposed?: DisposeTask<K, V>[]\n  #sizes?: ZeroArray\n  #starts?: ZeroArray\n  #ttls?: ZeroArray\n  #autopurgeTimers?: (undefined | ReturnType<typeof setTimeout>)[]\n\n  #hasDispose: boolean\n  #hasFetchMethod: boolean\n  #hasDisposeAfter: boolean\n  #hasOnInsert: boolean\n\n  /**\n   * Do not call this method unless you need to inspect the\n   * inner workings of the cache.  If anything returned by this\n   * object is modified in any way, strange breakage may occur.\n   *\n   * These fields are private for a reason!\n   *\n   * @internal\n   */\n  static unsafeExposeInternals<\n    K extends {},\n    V extends {},\n    FC extends unknown = unknown,\n  >(c: LRUCache<K, V, FC>) {\n    return {\n      // properties\n      starts: c.#starts,\n      ttls: c.#ttls,\n      autopurgeTimers: c.#autopurgeTimers,\n      sizes: c.#sizes,\n      keyMap: c.#keyMap as Map<K, number>,\n      keyList: c.#keyList,\n      valList: c.#valList,\n      next: c.#next,\n      prev: c.#prev,\n      get head() {\n        return c.#head\n      },\n      get tail() {\n        return c.#tail\n      },\n      free: c.#free,\n      // methods\n      isBackgroundFetch: (p: any) => c.#isBackgroundFetch(p),\n      backgroundFetch: (\n        k: K,\n        index: number | undefined,\n        options: LRUCache.FetchOptions<K, V, FC>,\n        context: any,\n      ): BackgroundFetch<V> =>\n        c.#backgroundFetch(\n          k,\n          index as Index | undefined,\n          options,\n          context,\n        ),\n      moveToTail: (index: number): void => c.#moveToTail(index as Index),\n      indexes: (options?: { allowStale: boolean }) => c.#indexes(options),\n      rindexes: (options?: { allowStale: boolean }) =>\n        c.#rindexes(options),\n      isStale: (index: number | undefined) => c.#isStale(index as Index),\n    }\n  }\n\n  // Protected read-only members\n\n  /**\n   * {@link LRUCache.OptionsBase.max} (read-only)\n   */\n  get max(): LRUCache.Count {\n    return this.#max\n  }\n  /**\n   * {@link LRUCache.OptionsBase.maxSize} (read-only)\n   */\n  get maxSize(): LRUCache.Count {\n    return this.#maxSize\n  }\n  /**\n   * The total computed size of items in the cache (read-only)\n   */\n  get calculatedSize(): LRUCache.Size {\n    return this.#calculatedSize\n  }\n  /**\n   * The number of items stored in the cache (read-only)\n   */\n  get size(): LRUCache.Count {\n    return this.#size\n  }\n  /**\n   * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n   */\n  get fetchMethod(): LRUCache.Fetcher<K, V, FC> | undefined {\n    return this.#fetchMethod\n  }\n  get memoMethod(): LRUCache.Memoizer<K, V, FC> | undefined {\n    return this.#memoMethod\n  }\n  /**\n   * {@link LRUCache.OptionsBase.dispose} (read-only)\n   */\n  get dispose() {\n    return this.#dispose\n  }\n  /**\n   * {@link LRUCache.OptionsBase.onInsert} (read-only)\n   */\n  get onInsert() {\n    return this.#onInsert\n  }\n  /**\n   * {@link LRUCache.OptionsBase.disposeAfter} (read-only)\n   */\n  get disposeAfter() {\n    return this.#disposeAfter\n  }\n\n  constructor(options: LRUCache.Options<K, V, FC> | LRUCache<K, V, FC>) {\n    const {\n      max = 0,\n      ttl,\n      ttlResolution = 1,\n      ttlAutopurge,\n      updateAgeOnGet,\n      updateAgeOnHas,\n      allowStale,\n      dispose,\n      onInsert,\n      disposeAfter,\n      noDisposeOnSet,\n      noUpdateTTL,\n      maxSize = 0,\n      maxEntrySize = 0,\n      sizeCalculation,\n      fetchMethod,\n      memoMethod,\n      noDeleteOnFetchRejection,\n      noDeleteOnStaleGet,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      perf,\n    } = options\n\n    if (perf !== undefined) {\n      if (typeof perf?.now !== 'function') {\n        throw new TypeError(\n          'perf option must have a now() method if specified',\n        )\n      }\n    }\n\n    this.#perf = perf ?? defaultPerf\n\n    if (max !== 0 && !isPosInt(max)) {\n      throw new TypeError('max option must be a nonnegative integer')\n    }\n\n    const UintArray = max ? getUintArray(max) : Array\n    if (!UintArray) {\n      throw new Error('invalid max value: ' + max)\n    }\n\n    this.#max = max\n    this.#maxSize = maxSize\n    this.maxEntrySize = maxEntrySize || this.#maxSize\n    this.sizeCalculation = sizeCalculation\n    if (this.sizeCalculation) {\n      if (!this.#maxSize && !this.maxEntrySize) {\n        throw new TypeError(\n          'cannot set sizeCalculation without setting maxSize or maxEntrySize',\n        )\n      }\n      if (typeof this.sizeCalculation !== 'function') {\n        throw new TypeError('sizeCalculation set to non-function')\n      }\n    }\n\n    if (memoMethod !== undefined && typeof memoMethod !== 'function') {\n      throw new TypeError('memoMethod must be a function if defined')\n    }\n    this.#memoMethod = memoMethod\n\n    if (fetchMethod !== undefined && typeof fetchMethod !== 'function') {\n      throw new TypeError('fetchMethod must be a function if specified')\n    }\n    this.#fetchMethod = fetchMethod\n    this.#hasFetchMethod = !!fetchMethod\n\n    this.#keyMap = new Map()\n    this.#keyList = new Array(max).fill(undefined)\n    this.#valList = new Array(max).fill(undefined)\n    this.#next = new UintArray(max)\n    this.#prev = new UintArray(max)\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free = Stack.create(max)\n    this.#size = 0\n    this.#calculatedSize = 0\n\n    if (typeof dispose === 'function') {\n      this.#dispose = dispose\n    }\n    if (typeof onInsert === 'function') {\n      this.#onInsert = onInsert\n    }\n    if (typeof disposeAfter === 'function') {\n      this.#disposeAfter = disposeAfter\n      this.#disposed = []\n    } else {\n      this.#disposeAfter = undefined\n      this.#disposed = undefined\n    }\n    this.#hasDispose = !!this.#dispose\n    this.#hasOnInsert = !!this.#onInsert\n    this.#hasDisposeAfter = !!this.#disposeAfter\n\n    this.noDisposeOnSet = !!noDisposeOnSet\n    this.noUpdateTTL = !!noUpdateTTL\n    this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection\n    this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection\n    this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort\n    this.ignoreFetchAbort = !!ignoreFetchAbort\n\n    // NB: maxEntrySize is set to maxSize if it's set\n    if (this.maxEntrySize !== 0) {\n      if (this.#maxSize !== 0) {\n        if (!isPosInt(this.#maxSize)) {\n          throw new TypeError(\n            'maxSize must be a positive integer if specified',\n          )\n        }\n      }\n      if (!isPosInt(this.maxEntrySize)) {\n        throw new TypeError(\n          'maxEntrySize must be a positive integer if specified',\n        )\n      }\n      this.#initializeSizeTracking()\n    }\n\n    this.allowStale = !!allowStale\n    this.noDeleteOnStaleGet = !!noDeleteOnStaleGet\n    this.updateAgeOnGet = !!updateAgeOnGet\n    this.updateAgeOnHas = !!updateAgeOnHas\n    this.ttlResolution =\n      isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1\n    this.ttlAutopurge = !!ttlAutopurge\n    this.ttl = ttl || 0\n    if (this.ttl) {\n      if (!isPosInt(this.ttl)) {\n        throw new TypeError('ttl must be a positive integer if specified')\n      }\n      this.#initializeTTLTracking()\n    }\n\n    // do not allow completely unbounded caches\n    if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n      throw new TypeError(\n        'At least one of max, maxSize, or ttl is required',\n      )\n    }\n    if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {\n      const code = 'LRU_CACHE_UNBOUNDED'\n      if (shouldWarn(code)) {\n        warned.add(code)\n        const msg =\n          'TTL caching without ttlAutopurge, max, or maxSize can ' +\n          'result in unbounded memory consumption.'\n        emitWarning(msg, 'UnboundedCacheWarning', code, LRUCache)\n      }\n    }\n  }\n\n  /**\n   * Return the number of ms left in the item's TTL. If item is not in cache,\n   * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.\n   */\n  getRemainingTTL(key: K) {\n    return this.#keyMap.has(key) ? Infinity : 0\n  }\n\n  #initializeTTLTracking() {\n    const ttls = new ZeroArray(this.#max)\n    const starts = new ZeroArray(this.#max)\n    this.#ttls = ttls\n    this.#starts = starts\n    const purgeTimers =\n      this.ttlAutopurge ?\n        new Array<undefined | ReturnType<typeof setTimeout>>(this.#max)\n      : undefined\n    this.#autopurgeTimers = purgeTimers\n\n    this.#setItemTTL = (index, ttl, start = this.#perf.now()) => {\n      starts[index] = ttl !== 0 ? start : 0\n      ttls[index] = ttl\n      // clear out the purge timer if we're setting TTL to 0, and\n      // previously had a ttl purge timer running, so it doesn't\n      // fire unnecessarily.\n      if (purgeTimers?.[index]) {\n        clearTimeout(purgeTimers[index])\n        purgeTimers[index] = undefined\n      }\n      if (ttl !== 0 && purgeTimers) {\n        const t = setTimeout(() => {\n          if (this.#isStale(index)) {\n            this.#delete(this.#keyList[index] as K, 'expire')\n          }\n        }, ttl + 1)\n        // unref() not supported on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n        purgeTimers[index] = t\n      }\n    }\n\n    this.#updateItemAge = index => {\n      starts[index] = ttls[index] !== 0 ? this.#perf.now() : 0\n    }\n\n    this.#statusTTL = (status, index) => {\n      if (ttls[index]) {\n        const ttl = ttls[index]\n        const start = starts[index]\n        /* c8 ignore next */\n        if (!ttl || !start) return\n        status.ttl = ttl\n        status.start = start\n        status.now = cachedNow || getNow()\n        const age = status.now - start\n        status.remainingTTL = ttl - age\n      }\n    }\n\n    // debounce calls to perf.now() to 1s so we're not hitting\n    // that costly call repeatedly.\n    let cachedNow = 0\n    const getNow = () => {\n      const n = this.#perf.now()\n      if (this.ttlResolution > 0) {\n        cachedNow = n\n        const t = setTimeout(() => (cachedNow = 0), this.ttlResolution)\n        // not available on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n      }\n      return n\n    }\n\n    this.getRemainingTTL = key => {\n      const index = this.#keyMap.get(key)\n      if (index === undefined) {\n        return 0\n      }\n      const ttl = ttls[index]\n      const start = starts[index]\n      if (!ttl || !start) {\n        return Infinity\n      }\n      const age = (cachedNow || getNow()) - start\n      return ttl - age\n    }\n\n    this.#isStale = index => {\n      const s = starts[index]\n      const t = ttls[index]\n      return !!t && !!s && (cachedNow || getNow()) - s > t\n    }\n  }\n\n  // conditionally set private methods related to TTL\n  #updateItemAge: (index: Index) => void = () => {}\n  #statusTTL: (status: LRUCache.Status<V>, index: Index) => void = () => {}\n  #setItemTTL: (\n    index: Index,\n    ttl: LRUCache.Milliseconds,\n    start?: LRUCache.Milliseconds,\n    // ignore because we never call this if we're not already in TTL mode\n    /* c8 ignore start */\n  ) => void = () => {}\n  /* c8 ignore stop */\n\n  #isStale: (index: Index) => boolean = () => false\n\n  #initializeSizeTracking() {\n    const sizes = new ZeroArray(this.#max)\n    this.#calculatedSize = 0\n    this.#sizes = sizes\n    this.#removeItemSize = index => {\n      this.#calculatedSize -= sizes[index] as number\n      sizes[index] = 0\n    }\n    this.#requireSize = (k, v, size, sizeCalculation) => {\n      // provisionally accept background fetches.\n      // actual value size will be checked when they return.\n      if (this.#isBackgroundFetch(v)) {\n        return 0\n      }\n      if (!isPosInt(size)) {\n        if (sizeCalculation) {\n          if (typeof sizeCalculation !== 'function') {\n            throw new TypeError('sizeCalculation must be a function')\n          }\n          size = sizeCalculation(v, k)\n          if (!isPosInt(size)) {\n            throw new TypeError(\n              'sizeCalculation return invalid (expect positive integer)',\n            )\n          }\n        } else {\n          throw new TypeError(\n            'invalid size value (must be positive integer). ' +\n              'When maxSize or maxEntrySize is used, sizeCalculation ' +\n              'or size must be set.',\n          )\n        }\n      }\n      return size\n    }\n    this.#addItemSize = (\n      index: Index,\n      size: LRUCache.Size,\n      status?: LRUCache.Status<V>,\n    ) => {\n      sizes[index] = size\n      if (this.#maxSize) {\n        const maxSize = this.#maxSize - (sizes[index] as number)\n        while (this.#calculatedSize > maxSize) {\n          this.#evict(true)\n        }\n      }\n      this.#calculatedSize += sizes[index] as number\n      if (status) {\n        status.entrySize = size\n        status.totalCalculatedSize = this.#calculatedSize\n      }\n    }\n  }\n\n  #removeItemSize: (index: Index) => void = _i => {}\n  #addItemSize: (\n    index: Index,\n    size: LRUCache.Size,\n    status?: LRUCache.Status<V>,\n  ) => void = (_i, _s, _st) => {}\n  #requireSize: (\n    k: K,\n    v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => LRUCache.Size = (\n    _k: K,\n    _v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => {\n    if (size || sizeCalculation) {\n      throw new TypeError(\n        'cannot set size without setting maxSize or maxEntrySize on cache',\n      )\n    }\n    return 0\n  };\n\n  *#indexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#tail; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#head) {\n          break\n        } else {\n          i = this.#prev[i] as Index\n        }\n      }\n    }\n  }\n\n  *#rindexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#head; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#tail) {\n          break\n        } else {\n          i = this.#next[i] as Index\n        }\n      }\n    }\n  }\n\n  #isValidIndex(index: Index) {\n    return (\n      index !== undefined &&\n      this.#keyMap.get(this.#keyList[index] as K) === index\n    )\n  }\n\n  /**\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from most recently used to least recently used.\n   */\n  *entries() {\n    for (const i of this.#indexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]] as [K, V]\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.entries}\n   *\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from least recently used to most recently used.\n   */\n  *rentries() {\n    for (const i of this.#rindexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]]\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the keys in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *keys() {\n    for (const i of this.#indexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.keys}\n   *\n   * Return a generator yielding the keys in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rkeys() {\n    for (const i of this.#rindexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the values in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *values() {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i] as V\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.values}\n   *\n   * Return a generator yielding the values in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rvalues() {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i]\n      }\n    }\n  }\n\n  /**\n   * Iterating over the cache itself yields the same results as\n   * {@link LRUCache.entries}\n   */\n  [Symbol.iterator]() {\n    return this.entries()\n  }\n\n  /**\n   * A String value that is used in the creation of the default string\n   * description of an object. Called by the built-in method\n   * `Object.prototype.toString`.\n   */\n  [Symbol.toStringTag] = 'LRUCache'\n\n  /**\n   * Find a value for which the supplied fn method returns a truthy value,\n   * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.\n   */\n  find(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => boolean,\n    getOptions: LRUCache.GetOptions<K, V, FC> = {},\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      if (fn(value, this.#keyList[i] as K, this)) {\n        return this.get(this.#keyList[i] as K, getOptions)\n      }\n    }\n  }\n\n  /**\n   * Call the supplied function on each item in the cache, in order from most\n   * recently used to least recently used.\n   *\n   * `fn` is called as `fn(value, key, cache)`.\n   *\n   * If `thisp` is provided, function will be called in the `this`-context of\n   * the provided object, or the cache if no `thisp` object is provided.\n   *\n   * Does not update age or recenty of use, or iterate over stale values.\n   */\n  forEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * The same as {@link LRUCache.forEach} but items are iterated over in\n   * reverse order.  (ie, less recently used items are iterated over first.)\n   */\n  rforEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * Delete any stale entries. Returns true if anything was removed,\n   * false otherwise.\n   */\n  purgeStale() {\n    let deleted = false\n    for (const i of this.#rindexes({ allowStale: true })) {\n      if (this.#isStale(i)) {\n        this.#delete(this.#keyList[i] as K, 'expire')\n        deleted = true\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Get the extended info about a given entry, to get its value, size, and\n   * TTL info simultaneously. Returns `undefined` if the key is not present.\n   *\n   * Unlike {@link LRUCache#dump}, which is designed to be portable and survive\n   * serialization, the `start` value is always the current timestamp, and the\n   * `ttl` is a calculated remaining time to live (negative if expired).\n   *\n   * Always returns stale values, if their info is found in the cache, so be\n   * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})\n   * if relevant.\n   */\n  info(key: K): LRUCache.Entry<V> | undefined {\n    const i = this.#keyMap.get(key)\n    if (i === undefined) return undefined\n    const v = this.#valList[i]\n    /* c8 ignore start - this isn't tested for the info function,\n     * but it's the same logic as found in other places. */\n    const value: V | undefined =\n      this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n    if (value === undefined) return undefined\n    /* c8 ignore end */\n    const entry: LRUCache.Entry<V> = { value }\n    if (this.#ttls && this.#starts) {\n      const ttl = this.#ttls[i]\n      const start = this.#starts[i]\n      if (ttl && start) {\n        const remain = ttl - (this.#perf.now() - start)\n        entry.ttl = remain\n        entry.start = Date.now()\n      }\n    }\n    if (this.#sizes) {\n      entry.size = this.#sizes[i]\n    }\n    return entry\n  }\n\n  /**\n   * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n   * passed to {@link LRUCache#load}.\n   *\n   * The `start` fields are calculated relative to a portable `Date.now()`\n   * timestamp, even if `performance.now()` is available.\n   *\n   * Stale entries are always included in the `dump`, even if\n   * {@link LRUCache.OptionsBase.allowStale} is false.\n   *\n   * Note: this returns an actual array, not a generator, so it can be more\n   * easily passed around.\n   */\n  dump() {\n    const arr: [K, LRUCache.Entry<V>][] = []\n    for (const i of this.#indexes({ allowStale: true })) {\n      const key = this.#keyList[i]\n      const v = this.#valList[i]\n      const value: V | undefined =\n        this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined || key === undefined) continue\n      const entry: LRUCache.Entry<V> = { value }\n      if (this.#ttls && this.#starts) {\n        entry.ttl = this.#ttls[i]\n        // always dump the start relative to a portable timestamp\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = this.#perf.now() - (this.#starts[i] as number)\n        entry.start = Math.floor(Date.now() - age)\n      }\n      if (this.#sizes) {\n        entry.size = this.#sizes[i]\n      }\n      arr.unshift([key, entry])\n    }\n    return arr\n  }\n\n  /**\n   * Reset the cache and load in the items in entries in the order listed.\n   *\n   * The shape of the resulting cache may be different if the same options are\n   * not used in both caches.\n   *\n   * The `start` fields are assumed to be calculated relative to a portable\n   * `Date.now()` timestamp, even if `performance.now()` is available.\n   */\n  load(arr: [K, LRUCache.Entry<V>][]) {\n    this.clear()\n    for (const [key, entry] of arr) {\n      if (entry.start) {\n        // entry.start is a portable timestamp, but we may be using\n        // node's performance.now(), so calculate the offset, so that\n        // we get the intended remaining TTL, no matter how long it's\n        // been on ice.\n        //\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = Date.now() - entry.start\n        entry.start = this.#perf.now() - age\n      }\n      this.set(key, entry.value, entry)\n    }\n  }\n\n  /**\n   * Add a value to the cache.\n   *\n   * Note: if `undefined` is specified as a value, this is an alias for\n   * {@link LRUCache#delete}\n   *\n   * Fields on the {@link LRUCache.SetOptions} options param will override\n   * their corresponding values in the constructor options for the scope\n   * of this single `set()` operation.\n   *\n   * If `start` is provided, then that will set the effective start\n   * time for the TTL calculation. Note that this must be a previous\n   * value of `performance.now()` if supported, or a previous value of\n   * `Date.now()` if not.\n   *\n   * Options object may also include `size`, which will prevent\n   * calling the `sizeCalculation` function and just use the specified\n   * number if it is a positive integer, and `noDisposeOnSet` which\n   * will prevent calling a `dispose` function in the case of\n   * overwrites.\n   *\n   * If the `size` (or return value of `sizeCalculation`) for a given\n   * entry is greater than `maxEntrySize`, then the item will not be\n   * added to the cache.\n   *\n   * Will update the recency of the entry.\n   *\n   * If the value is `undefined`, then this is an alias for\n   * `cache.delete(key)`. `undefined` is never stored in the cache.\n   */\n  set(\n    k: K,\n    v: V | BackgroundFetch<V> | undefined,\n    setOptions: LRUCache.SetOptions<K, V, FC> = {},\n  ) {\n    if (v === undefined) {\n      this.delete(k)\n      return this\n    }\n    const {\n      ttl = this.ttl,\n      start,\n      noDisposeOnSet = this.noDisposeOnSet,\n      sizeCalculation = this.sizeCalculation,\n      status,\n    } = setOptions\n    let { noUpdateTTL = this.noUpdateTTL } = setOptions\n\n    const size = this.#requireSize(\n      k,\n      v,\n      setOptions.size || 0,\n      sizeCalculation,\n    )\n    // if the item doesn't fit, don't do anything\n    // NB: maxEntrySize set to maxSize by default\n    if (this.maxEntrySize && size > this.maxEntrySize) {\n      if (status) {\n        status.set = 'miss'\n        status.maxEntrySizeExceeded = true\n      }\n      // have to delete, in case something is there already.\n      this.#delete(k, 'set')\n      return this\n    }\n    let index = this.#size === 0 ? undefined : this.#keyMap.get(k)\n    if (index === undefined) {\n      // addition\n      index = (\n        this.#size === 0 ? this.#tail\n        : this.#free.length !== 0 ? this.#free.pop()\n        : this.#size === this.#max ? this.#evict(false)\n        : this.#size) as Index\n      this.#keyList[index] = k\n      this.#valList[index] = v\n      this.#keyMap.set(k, index)\n      this.#next[this.#tail] = index\n      this.#prev[index] = this.#tail\n      this.#tail = index\n      this.#size++\n      this.#addItemSize(index, size, status)\n      if (status) status.set = 'add'\n      noUpdateTTL = false\n      if (this.#hasOnInsert) {\n        this.#onInsert?.(v as V, k, 'add')\n      }\n    } else {\n      // update\n      this.#moveToTail(index)\n      const oldVal = this.#valList[index] as V | BackgroundFetch<V>\n      if (v !== oldVal) {\n        if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {\n          oldVal.__abortController.abort(new Error('replaced'))\n          const { __staleWhileFetching: s } = oldVal\n          if (s !== undefined && !noDisposeOnSet) {\n            if (this.#hasDispose) {\n              this.#dispose?.(s as V, k, 'set')\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([s as V, k, 'set'])\n            }\n          }\n        } else if (!noDisposeOnSet) {\n          if (this.#hasDispose) {\n            this.#dispose?.(oldVal as V, k, 'set')\n          }\n          if (this.#hasDisposeAfter) {\n            this.#disposed?.push([oldVal as V, k, 'set'])\n          }\n        }\n        this.#removeItemSize(index)\n        this.#addItemSize(index, size, status)\n        this.#valList[index] = v\n        if (status) {\n          status.set = 'replace'\n          const oldValue =\n            oldVal && this.#isBackgroundFetch(oldVal) ?\n              oldVal.__staleWhileFetching\n            : oldVal\n          if (oldValue !== undefined) status.oldValue = oldValue\n        }\n      } else if (status) {\n        status.set = 'update'\n      }\n\n      if (this.#hasOnInsert) {\n        this.onInsert?.(v as V, k, v === oldVal ? 'update' : 'replace')\n      }\n    }\n    if (ttl !== 0 && !this.#ttls) {\n      this.#initializeTTLTracking()\n    }\n    if (this.#ttls) {\n      if (!noUpdateTTL) {\n        this.#setItemTTL(index, ttl, start)\n      }\n      if (status) this.#statusTTL(status, index)\n    }\n    if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return this\n  }\n\n  /**\n   * Evict the least recently used item, returning its value or\n   * `undefined` if cache is empty.\n   */\n  pop(): V | undefined {\n    try {\n      while (this.#size) {\n        const val = this.#valList[this.#head]\n        this.#evict(true)\n        if (this.#isBackgroundFetch(val)) {\n          if (val.__staleWhileFetching) {\n            return val.__staleWhileFetching\n          }\n        } else if (val !== undefined) {\n          return val\n        }\n      }\n    } finally {\n      if (this.#hasDisposeAfter && this.#disposed) {\n        const dt = this.#disposed\n        let task: DisposeTask<K, V> | undefined\n        while ((task = dt?.shift())) {\n          this.#disposeAfter?.(...task)\n        }\n      }\n    }\n  }\n\n  #evict(free: boolean) {\n    const head = this.#head\n    const k = this.#keyList[head] as K\n    const v = this.#valList[head] as V\n    if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n      v.__abortController.abort(new Error('evicted'))\n    } else if (this.#hasDispose || this.#hasDisposeAfter) {\n      if (this.#hasDispose) {\n        this.#dispose?.(v, k, 'evict')\n      }\n      if (this.#hasDisposeAfter) {\n        this.#disposed?.push([v, k, 'evict'])\n      }\n    }\n    this.#removeItemSize(head)\n    if (this.#autopurgeTimers?.[head]) {\n      clearTimeout(this.#autopurgeTimers[head])\n      this.#autopurgeTimers[head] = undefined\n    }\n    // if we aren't about to use the index, then null these out\n    if (free) {\n      this.#keyList[head] = undefined\n      this.#valList[head] = undefined\n      this.#free.push(head)\n    }\n    if (this.#size === 1) {\n      this.#head = this.#tail = 0 as Index\n      this.#free.length = 0\n    } else {\n      this.#head = this.#next[head] as Index\n    }\n    this.#keyMap.delete(k)\n    this.#size--\n    return head\n  }\n\n  /**\n   * Check if a key is in the cache, without updating the recency of use.\n   * Will return false if the item is stale, even though it is technically\n   * in the cache.\n   *\n   * Check if a key is in the cache, without updating the recency of\n   * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set\n   * to `true` in either the options or the constructor.\n   *\n   * Will return `false` if the item is stale, even though it is technically in\n   * the cache. The difference can be determined (if it matters) by using a\n   * `status` argument, and inspecting the `has` field.\n   *\n   * Will not update item age unless\n   * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.\n   */\n  has(k: K, hasOptions: LRUCache.HasOptions<K, V, FC> = {}) {\n    const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const v = this.#valList[index]\n      if (\n        this.#isBackgroundFetch(v) &&\n        v.__staleWhileFetching === undefined\n      ) {\n        return false\n      }\n      if (!this.#isStale(index)) {\n        if (updateAgeOnHas) {\n          this.#updateItemAge(index)\n        }\n        if (status) {\n          status.has = 'hit'\n          this.#statusTTL(status, index)\n        }\n        return true\n      } else if (status) {\n        status.has = 'stale'\n        this.#statusTTL(status, index)\n      }\n    } else if (status) {\n      status.has = 'miss'\n    }\n    return false\n  }\n\n  /**\n   * Like {@link LRUCache#get} but doesn't update recency or delete stale\n   * items.\n   *\n   * Returns `undefined` if the item is stale, unless\n   * {@link LRUCache.OptionsBase.allowStale} is set.\n   */\n  peek(k: K, peekOptions: LRUCache.PeekOptions<K, V, FC> = {}) {\n    const { allowStale = this.allowStale } = peekOptions\n    const index = this.#keyMap.get(k)\n    if (index === undefined || (!allowStale && this.#isStale(index))) {\n      return\n    }\n    const v = this.#valList[index]\n    // either stale and allowed, or forcing a refresh of non-stale value\n    return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n  }\n\n  #backgroundFetch(\n    k: K,\n    index: Index | undefined,\n    options: LRUCache.FetchOptions<K, V, FC>,\n    context: any,\n  ): BackgroundFetch<V> {\n    const v = index === undefined ? undefined : this.#valList[index]\n    if (this.#isBackgroundFetch(v)) {\n      return v\n    }\n\n    const ac = new AC()\n    const { signal } = options\n    // when/if our AC signals, then stop listening to theirs.\n    signal?.addEventListener('abort', () => ac.abort(signal.reason), {\n      signal: ac.signal,\n    })\n\n    const fetchOpts = {\n      signal: ac.signal,\n      options,\n      context,\n    }\n\n    const cb = (v: V | undefined, updateCache = false): V | undefined => {\n      const { aborted } = ac.signal\n      const ignoreAbort = options.ignoreFetchAbort && v !== undefined\n      const proceed = options.ignoreFetchAbort ||\n        !!(options.allowStaleOnFetchAbort && v !== undefined)\n      if (options.status) {\n        if (aborted && !updateCache) {\n          options.status.fetchAborted = true\n          options.status.fetchError = ac.signal.reason\n          if (ignoreAbort) options.status.fetchAbortIgnored = true\n        } else {\n          options.status.fetchResolved = true\n        }\n      }\n      if (aborted && !ignoreAbort && !updateCache) {\n        return fetchFail(ac.signal.reason, proceed)\n      }\n      // either we didn't abort, and are still here, or we did, and ignored\n      const bf = p as BackgroundFetch<V>\n      // if nothing else has been written there but we're set to update the\n      // cache and ignore the abort, or if it's still pending on this specific\n      // background request, then write it to the cache.\n      const vl = this.#valList[index as Index]\n      if (vl === p || (ignoreAbort && updateCache && vl === undefined)) {\n        if (v === undefined) {\n          if (bf.__staleWhileFetching !== undefined) {\n            this.#valList[index as Index] = bf.__staleWhileFetching\n          } else {\n            this.#delete(k, 'fetch')\n          }\n        } else {\n          if (options.status) options.status.fetchUpdated = true\n          this.set(k, v, fetchOpts.options)\n        }\n      }\n      return v\n    }\n\n    const eb = (er: any) => {\n      if (options.status) {\n        options.status.fetchRejected = true\n        options.status.fetchError = er\n      }\n      // do not pass go, do not collect $200\n      return fetchFail(er, false)\n    }\n\n    const fetchFail = (er: any, proceed: boolean): V | undefined => {\n      const { aborted } = ac.signal\n      const allowStaleAborted = aborted && options.allowStaleOnFetchAbort\n      const allowStale =\n        allowStaleAborted || options.allowStaleOnFetchRejection\n      const noDelete = allowStale || options.noDeleteOnFetchRejection\n      const bf = p as BackgroundFetch<V>\n      if (this.#valList[index as Index] === p) {\n        // if we allow stale on fetch rejections, then we need to ensure that\n        // the stale value is not removed from the cache when the fetch fails.\n        const del = !noDelete ||\n          !proceed && bf.__staleWhileFetching === undefined\n        if (del) {\n          this.#delete(k, 'fetch')\n        } else if (!allowStaleAborted) {\n          // still replace the *promise* with the stale value,\n          // since we are done with the promise at this point.\n          // leave it untouched if we're still waiting for an\n          // aborted background fetch that hasn't yet returned.\n          this.#valList[index as Index] = bf.__staleWhileFetching\n        }\n      }\n      if (allowStale) {\n        if (options.status && bf.__staleWhileFetching !== undefined) {\n          options.status.returnedStale = true\n        }\n        return bf.__staleWhileFetching\n      } else if (bf.__returned === bf) {\n        throw er\n      }\n    }\n\n    const pcall = (\n      res: (v: V | undefined) => void,\n      rej: (e: any) => void,\n    ) => {\n      const fmp = this.#fetchMethod?.(k, v, fetchOpts)\n      if (fmp && fmp instanceof Promise) {\n        fmp.then(v => res(v === undefined ? undefined : v), rej)\n      }\n      // ignored, we go until we finish, regardless.\n      // defer check until we are actually aborting,\n      // so fetchMethod can override.\n      ac.signal.addEventListener('abort', () => {\n        if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {\n          res(undefined)\n          // when it eventually resolves, update the cache.\n          if (options.allowStaleOnFetchAbort) {\n            res = v => cb(v, true)\n          }\n        }\n      })\n    }\n\n    if (options.status) options.status.fetchDispatched = true\n    const p = new Promise(pcall).then(cb, eb)\n    const bf: BackgroundFetch<V> = Object.assign(p, {\n      __abortController: ac,\n      __staleWhileFetching: v,\n      __returned: undefined,\n    })\n\n    if (index === undefined) {\n      // internal, don't expose status.\n      this.set(k, bf, { ...fetchOpts.options, status: undefined })\n      index = this.#keyMap.get(k)\n    } else {\n      this.#valList[index] = bf\n    }\n    return bf\n  }\n\n  #isBackgroundFetch(p: any): p is BackgroundFetch<V> {\n    if (!this.#hasFetchMethod) return false\n    const b = p as BackgroundFetch<V>\n    return (\n      !!b &&\n      b instanceof Promise &&\n      b.hasOwnProperty('__staleWhileFetching') &&\n      b.__abortController instanceof AC\n    )\n  }\n\n  /**\n   * Make an asynchronous cached fetch using the\n   * {@link LRUCache.OptionsBase.fetchMethod} function.\n   *\n   * If the value is in the cache and not stale, then the returned\n   * Promise resolves to the value.\n   *\n   * If not in the cache, or beyond its TTL staleness, then\n   * `fetchMethod(key, staleValue, { options, signal, context })` is\n   * called, and the value returned will be added to the cache once\n   * resolved.\n   *\n   * If called with `allowStale`, and an asynchronous fetch is\n   * currently in progress to reload a stale value, then the former\n   * stale value will be returned.\n   *\n   * If called with `forceRefresh`, then the cached item will be\n   * re-fetched, even if it is not stale. However, if `allowStale` is also\n   * set, then the old value will still be returned. This is useful\n   * in cases where you want to force a reload of a cached value. If\n   * a background fetch is already in progress, then `forceRefresh`\n   * has no effect.\n   *\n   * If multiple fetches for the same key are issued, then they will all be\n   * coalesced into a single call to fetchMethod.\n   *\n   * Note that this means that handling options such as\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort},\n   * {@link LRUCache.FetchOptions.signal},\n   * and {@link LRUCache.OptionsBase.allowStaleOnFetchRejection} will be\n   * determined by the FIRST fetch() call for a given key.\n   *\n   * This is a known (fixable) shortcoming which will be addresed on when\n   * someone complains about it, as the fix would involve added complexity and\n   * may not be worth the costs for this edge case.\n   *\n   * If {@link LRUCache.OptionsBase.fetchMethod} is not specified, then this is\n   * effectively an alias for `Promise.resolve(cache.get(key))`.\n   *\n   * When the fetch method resolves to a value, if the fetch has not\n   * been aborted due to deletion, eviction, or being overwritten,\n   * then it is added to the cache using the options provided.\n   *\n   * If the key is evicted or deleted before the `fetchMethod`\n   * resolves, then the AbortSignal passed to the `fetchMethod` will\n   * receive an `abort` event, and the promise returned by `fetch()`\n   * will reject with the reason for the abort.\n   *\n   * If a `signal` is passed to the `fetch()` call, then aborting the\n   * signal will abort the fetch and cause the `fetch()` promise to\n   * reject with the reason provided.\n   *\n   * **Setting `context`**\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the {@link LRUCache} constructor, then all\n   * calls to `cache.fetch()` _must_ provide a `context` option. If\n   * set to `undefined` or `void`, then calls to fetch _must not_\n   * provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that\n   * might be relevant in the course of fetching the data. It is only\n   * relevant for the course of a single `fetch()` operation, and\n   * discarded afterwards.\n   *\n   * **Note: `fetch()` calls are inflight-unique**\n   *\n   * If you call `fetch()` multiple times with the same key value,\n   * then every call after the first will resolve on the same\n   * promise<sup>1</sup>,\n   * _even if they have different settings that would otherwise change\n   * the behavior of the fetch_, such as `noDeleteOnFetchRejection`\n   * or `ignoreFetchAbort`.\n   *\n   * In most cases, this is not a problem (in fact, only fetching\n   * something once is what you probably want, if you're caching in\n   * the first place). If you are changing the fetch() options\n   * dramatically between runs, there's a good chance that you might\n   * be trying to fit divergent semantics into a single object, and\n   * would be better off with multiple cache instances.\n   *\n   * **1**: Ie, they're not the \"same Promise\", but they resolve at\n   * the same time, because they're both waiting on the same\n   * underlying fetchMethod response.\n   */\n\n  fetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<undefined | V>\n\n  // this overload not allowed if context is required\n  fetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<undefined | V>\n\n  async fetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<undefined | V> {\n    const {\n      // get options\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      // set options\n      ttl = this.ttl,\n      noDisposeOnSet = this.noDisposeOnSet,\n      size = 0,\n      sizeCalculation = this.sizeCalculation,\n      noUpdateTTL = this.noUpdateTTL,\n      // fetch exclusive options\n      noDeleteOnFetchRejection = this.noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection = this.allowStaleOnFetchRejection,\n      ignoreFetchAbort = this.ignoreFetchAbort,\n      allowStaleOnFetchAbort = this.allowStaleOnFetchAbort,\n      context,\n      forceRefresh = false,\n      status,\n      signal,\n    } = fetchOptions\n\n    if (!this.#hasFetchMethod) {\n      if (status) status.fetch = 'get'\n      return this.get(k, {\n        allowStale,\n        updateAgeOnGet,\n        noDeleteOnStaleGet,\n        status,\n      })\n    }\n\n    const options = {\n      allowStale,\n      updateAgeOnGet,\n      noDeleteOnStaleGet,\n      ttl,\n      noDisposeOnSet,\n      size,\n      sizeCalculation,\n      noUpdateTTL,\n      noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      status,\n      signal,\n    }\n\n    let index = this.#keyMap.get(k)\n    if (index === undefined) {\n      if (status) status.fetch = 'miss'\n      const p = this.#backgroundFetch(k, index, options, context)\n      return (p.__returned = p)\n    } else {\n      // in cache, maybe already fetching\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        const stale = allowStale && v.__staleWhileFetching !== undefined\n        if (status) {\n          status.fetch = 'inflight'\n          if (stale) status.returnedStale = true\n        }\n        return stale ? v.__staleWhileFetching : (v.__returned = v)\n      }\n\n      // if we force a refresh, that means do NOT serve the cached value,\n      // unless we are already in the process of refreshing the cache.\n      const isStale = this.#isStale(index)\n      if (!forceRefresh && !isStale) {\n        if (status) status.fetch = 'hit'\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        if (status) this.#statusTTL(status, index)\n        return v\n      }\n\n      // ok, it is stale or a forced refresh, and not already fetching.\n      // refresh the cache.\n      const p = this.#backgroundFetch(k, index, options, context)\n      const hasStale = p.__staleWhileFetching !== undefined\n      const staleVal = hasStale && allowStale\n      if (status) {\n        status.fetch = isStale ? 'stale' : 'refresh'\n        if (staleVal && isStale) status.returnedStale = true\n      }\n      return staleVal ? p.__staleWhileFetching : (p.__returned = p)\n    }\n  }\n\n  /**\n   * In some cases, `cache.fetch()` may resolve to `undefined`, either because\n   * a {@link LRUCache.OptionsBase#fetchMethod} was not provided (turning\n   * `cache.fetch(k)` into just an async wrapper around `cache.get(k)`) or\n   * because `ignoreFetchAbort` was specified (either to the constructor or\n   * in the {@link LRUCache.FetchOptions}). Also, the\n   * {@link LRUCache.OptionsBase.fetchMethod} may return `undefined` or `void`, making\n   * the test even more complicated.\n   *\n   * Because inferring the cases where `undefined` might be returned are so\n   * cumbersome, but testing for `undefined` can also be annoying, this method\n   * can be used, which will reject if `this.fetch()` resolves to undefined.\n   */\n  forceFetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<V>\n  // this overload not allowed if context is required\n  forceFetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<V>\n  async forceFetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<V> {\n    const v = await this.fetch(\n      k,\n      fetchOptions as unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n      : LRUCache.FetchOptionsWithContext<K, V, FC>,\n    )\n    if (v === undefined) throw new Error('fetch() returned undefined')\n    return v\n  }\n\n  /**\n   * If the key is found in the cache, then this is equivalent to\n   * {@link LRUCache#get}. If not, in the cache, then calculate the value using\n   * the {@link LRUCache.OptionsBase.memoMethod}, and add it to the cache.\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the LRUCache constructor, then all calls to `cache.memo()`\n   * _must_ provide a `context` option. If set to `undefined` or `void`, then\n   * calls to memo _must not_ provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that might be\n   * relevant in the course of fetching the data. It is only relevant for the\n   * course of a single `memo()` operation, and discarded afterwards.\n   */\n  memo(\n    k: K,\n    memoOptions: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : LRUCache.MemoOptionsWithContext<K, V, FC>,\n  ): V\n  // this overload not allowed if context is required\n  memo(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    memoOptions?: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : never,\n  ): V\n  memo(k: K, memoOptions: LRUCache.MemoOptions<K, V, FC> = {}) {\n    const memoMethod = this.#memoMethod\n    if (!memoMethod) {\n      throw new Error('no memoMethod provided to constructor')\n    }\n    const { context, forceRefresh, ...options } = memoOptions\n    const v = this.get(k, options)\n    if (!forceRefresh && v !== undefined) return v\n    const vv = memoMethod(k, v, {\n      options,\n      context,\n    } as LRUCache.MemoizerOptions<K, V, FC>)\n    this.set(k, vv, options)\n    return vv\n  }\n\n  /**\n   * Return a value from the cache. Will update the recency of the cache\n   * entry found.\n   *\n   * If the key is not found, get() will return `undefined`.\n   */\n  get(k: K, getOptions: LRUCache.GetOptions<K, V, FC> = {}) {\n    const {\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      status,\n    } = getOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const value = this.#valList[index]\n      const fetching = this.#isBackgroundFetch(value)\n      if (status) this.#statusTTL(status, index)\n      if (this.#isStale(index)) {\n        if (status) status.get = 'stale'\n        // delete only if not an in-flight background fetch\n        if (!fetching) {\n          if (!noDeleteOnStaleGet) {\n            this.#delete(k, 'expire')\n          }\n          if (status && allowStale) status.returnedStale = true\n          return allowStale ? value : undefined\n        } else {\n          if (\n            status &&\n            allowStale &&\n            value.__staleWhileFetching !== undefined\n          ) {\n            status.returnedStale = true\n          }\n          return allowStale ? value.__staleWhileFetching : undefined\n        }\n      } else {\n        if (status) status.get = 'hit'\n        // if we're currently fetching it, we don't actually have it yet\n        // it's not stale, which means this isn't a staleWhileRefetching.\n        // If it's not stale, and fetching, AND has a __staleWhileFetching\n        // value, then that means the user fetched with {forceRefresh:true},\n        // so it's safe to return that value.\n        if (fetching) {\n          return value.__staleWhileFetching\n        }\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        return value\n      }\n    } else if (status) {\n      status.get = 'miss'\n    }\n  }\n\n  #connect(p: Index, n: Index) {\n    this.#prev[n] = p\n    this.#next[p] = n\n  }\n\n  #moveToTail(index: Index): void {\n    // if tail already, nothing to do\n    // if head, move head to next[index]\n    // else\n    //   move next[prev[index]] to next[index] (head has no prev)\n    //   move prev[next[index]] to prev[index]\n    // prev[index] = tail\n    // next[tail] = index\n    // tail = index\n    if (index !== this.#tail) {\n      if (index === this.#head) {\n        this.#head = this.#next[index] as Index\n      } else {\n        this.#connect(\n          this.#prev[index] as Index,\n          this.#next[index] as Index,\n        )\n      }\n      this.#connect(this.#tail, index)\n      this.#tail = index\n    }\n  }\n\n  /**\n   * Deletes a key out of the cache.\n   *\n   * Returns true if the key was deleted, false otherwise.\n   */\n  delete(k: K) {\n    return this.#delete(k, 'delete')\n  }\n\n  #delete(k: K, reason: LRUCache.DisposeReason) {\n    let deleted = false\n    if (this.#size !== 0) {\n      const index = this.#keyMap.get(k)\n      if (index !== undefined) {\n        if (this.#autopurgeTimers?.[index]) {\n          clearTimeout(this.#autopurgeTimers?.[index])\n          this.#autopurgeTimers[index] = undefined\n        }\n        deleted = true\n        if (this.#size === 1) {\n          this.#clear(reason)\n        } else {\n          this.#removeItemSize(index)\n          const v = this.#valList[index]\n          if (this.#isBackgroundFetch(v)) {\n            v.__abortController.abort(new Error('deleted'))\n          } else if (this.#hasDispose || this.#hasDisposeAfter) {\n            if (this.#hasDispose) {\n              this.#dispose?.(v as V, k, reason)\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([v as V, k, reason])\n            }\n          }\n          this.#keyMap.delete(k)\n          this.#keyList[index] = undefined\n          this.#valList[index] = undefined\n          if (index === this.#tail) {\n            this.#tail = this.#prev[index] as Index\n          } else if (index === this.#head) {\n            this.#head = this.#next[index] as Index\n          } else {\n            const pi = this.#prev[index] as number\n            this.#next[pi] = this.#next[index] as number\n            const ni = this.#next[index] as number\n            this.#prev[ni] = this.#prev[index] as number\n          }\n          this.#size--\n          this.#free.push(index)\n        }\n      }\n    }\n    if (this.#hasDisposeAfter && this.#disposed?.length) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Clear the cache entirely, throwing away all values.\n   */\n  clear() {\n    return this.#clear('delete')\n  }\n  #clear(reason: LRUCache.DisposeReason) {\n    for (const index of this.#rindexes({ allowStale: true })) {\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        v.__abortController.abort(new Error('deleted'))\n      } else {\n        const k = this.#keyList[index]\n        if (this.#hasDispose) {\n          this.#dispose?.(v as V, k as K, reason)\n        }\n        if (this.#hasDisposeAfter) {\n          this.#disposed?.push([v as V, k as K, reason])\n        }\n      }\n    }\n\n    this.#keyMap.clear()\n    this.#valList.fill(undefined)\n    this.#keyList.fill(undefined)\n    if (this.#ttls && this.#starts) {\n      this.#ttls.fill(0)\n      this.#starts.fill(0)\n      for (const t of this.#autopurgeTimers ?? []) {\n        if (t !== undefined) clearTimeout(t)\n      }\n      this.#autopurgeTimers?.fill(undefined)\n    }\n    if (this.#sizes) {\n      this.#sizes.fill(0)\n    }\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free.length = 0\n    this.#calculatedSize = 0\n    this.#size = 0\n    if (this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n  }\n}\n", "import { LRUCache } from 'lru-cache'\nimport { posix, win32 } from 'node:path'\n\nimport { fileURLToPath } from 'node:url'\n\nimport {\n  lstatSync,\n  readdir as readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync as rps,\n} from 'fs'\nimport * as actualFS from 'node:fs'\n\nconst realpathSync = rps.native\n// TODO: test perf of fs/promises realpath vs realpathCB,\n// since the promises one uses realpath.native\n\nimport { lstat, readdir, readlink, realpath } from 'node:fs/promises'\n\nimport { Minipass } from 'minipass'\nimport type { Dirent, Stats } from 'node:fs'\n\n/**\n * An object that will be used to override the default `fs`\n * methods.  Any methods that are not overridden will use Node's\n * built-in implementations.\n *\n * - lstatSync\n * - readdir (callback `withFileTypes` Dirent variant, used for\n *   readdirCB and most walks)\n * - readdirSync\n * - readlinkSync\n * - realpathSync\n * - promises: Object containing the following async methods:\n *   - lstat\n *   - readdir (Dirent variant only)\n *   - readlink\n *   - realpath\n */\nexport interface FSOption {\n  lstatSync?: (path: string) => Stats\n  readdir?: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync?: (\n    path: string,\n    options: { withFileTypes: true },\n  ) => Dirent[]\n  readlinkSync?: (path: string) => string\n  realpathSync?: (path: string) => string\n  promises?: {\n    lstat?: (path: string) => Promise<Stats>\n    readdir?: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink?: (path: string) => Promise<string>\n    realpath?: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\ninterface FSValue {\n  lstatSync: (path: string) => Stats\n  readdir: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync: (path: string, options: { withFileTypes: true }) => Dirent[]\n  readlinkSync: (path: string) => string\n  realpathSync: (path: string) => string\n  promises: {\n    lstat: (path: string) => Promise<Stats>\n    readdir: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink: (path: string) => Promise<string>\n    realpath: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\nconst defaultFS: FSValue = {\n  lstatSync,\n  readdir: readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync,\n  promises: {\n    lstat,\n    readdir,\n    readlink,\n    realpath,\n  },\n}\n\n// if they just gave us require('fs') then use our default\nconst fsFromOption = (fsOption?: FSOption): FSValue =>\n  !fsOption || fsOption === defaultFS || fsOption === actualFS ?\n    defaultFS\n  : {\n      ...defaultFS,\n      ...fsOption,\n      promises: {\n        ...defaultFS.promises,\n        ...(fsOption.promises || {}),\n      },\n    }\n\n// turn something like //?/c:/ into c:\\\nconst uncDriveRegexp = /^\\\\\\\\\\?\\\\([a-z]:)\\\\?$/i\nconst uncToDrive = (rootPath: string): string =>\n  rootPath.replace(/\\//g, '\\\\').replace(uncDriveRegexp, '$1\\\\')\n\n// windows paths are separated by either / or \\\nconst eitherSep = /[\\\\\\/]/\n\nconst UNKNOWN = 0 // may not even exist, for all we know\nconst IFIFO = 0b0001\nconst IFCHR = 0b0010\nconst IFDIR = 0b0100\nconst IFBLK = 0b0110\nconst IFREG = 0b1000\nconst IFLNK = 0b1010\nconst IFSOCK = 0b1100\nconst IFMT = 0b1111\n\nexport type Type =\n  | 'Unknown'\n  | 'FIFO'\n  | 'CharacterDevice'\n  | 'Directory'\n  | 'BlockDevice'\n  | 'File'\n  | 'SymbolicLink'\n  | 'Socket'\n\n// mask to unset low 4 bits\nconst IFMT_UNKNOWN = ~IFMT\n\n// set after successfully calling readdir() and getting entries.\nconst READDIR_CALLED = 0b0000_0001_0000\n// set after a successful lstat()\nconst LSTAT_CALLED = 0b0000_0010_0000\n// set if an entry (or one of its parents) is definitely not a dir\nconst ENOTDIR = 0b0000_0100_0000\n// set if an entry (or one of its parents) does not exist\n// (can also be set on lstat errors like EACCES or ENAMETOOLONG)\nconst ENOENT = 0b0000_1000_0000\n// cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK\n// set if we fail to readlink\nconst ENOREADLINK = 0b0001_0000_0000\n// set if we know realpath() will fail\nconst ENOREALPATH = 0b0010_0000_0000\n\nconst ENOCHILD = ENOTDIR | ENOENT | ENOREALPATH\nconst TYPEMASK = 0b0011_1111_1111\n\nconst entToType = (s: Dirent | Stats) =>\n  s.isFile() ? IFREG\n  : s.isDirectory() ? IFDIR\n  : s.isSymbolicLink() ? IFLNK\n  : s.isCharacterDevice() ? IFCHR\n  : s.isBlockDevice() ? IFBLK\n  : s.isSocket() ? IFSOCK\n  : s.isFIFO() ? IFIFO\n  : UNKNOWN\n\n// normalize unicode path names\nconst normalizeCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalize = (s: string) => {\n  const c = normalizeCache.get(s)\n  if (c) return c\n  const n = s.normalize('NFKD')\n  normalizeCache.set(s, n)\n  return n\n}\n\nconst normalizeNocaseCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalizeNocase = (s: string) => {\n  const c = normalizeNocaseCache.get(s)\n  if (c) return c\n  const n = normalize(s.toLowerCase())\n  normalizeNocaseCache.set(s, n)\n  return n\n}\n\n/**\n * Options that may be provided to the Path constructor\n */\nexport interface PathOpts {\n  fullpath?: string\n  relative?: string\n  relativePosix?: string\n  parent?: PathBase\n  /**\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * An LRUCache for storing resolved path strings or Path objects.\n * @internal\n */\nexport class ResolveCache extends LRUCache<string, string> {\n  constructor() {\n    super({ max: 256 })\n  }\n}\n\n// In order to prevent blowing out the js heap by allocating hundreds of\n// thousands of Path entries when walking extremely large trees, the \"children\"\n// in this tree are represented by storing an array of Path entries in an\n// LRUCache, indexed by the parent.  At any time, Path.children() may return an\n// empty array, indicating that it doesn't know about any of its children, and\n// thus has to rebuild that cache.  This is fine, it just means that we don't\n// benefit as much from having the cached entries, but huge directory walks\n// don't blow out the stack, and smaller ones are still as fast as possible.\n//\n//It does impose some complexity when building up the readdir data, because we\n//need to pass a reference to the children array that we started with.\n\n/**\n * an LRUCache for storing child entries.\n * @internal\n */\nexport class ChildrenCache extends LRUCache<PathBase, Children> {\n  constructor(maxSize: number = 16 * 1024) {\n    super({\n      maxSize,\n      // parent + children\n      sizeCalculation: a => a.length + 1,\n    })\n  }\n}\n\n/**\n * Array of Path objects, plus a marker indicating the first provisional entry\n *\n * @internal\n */\nexport type Children = PathBase[] & { provisional: number }\n\nconst setAsCwd = Symbol('PathScurry setAsCwd')\n\n/**\n * Path objects are sort of like a super-powered\n * {@link https://nodejs.org/docs/latest/api/fs.html#class-fsdirent fs.Dirent}\n *\n * Each one represents a single filesystem entry on disk, which may or may not\n * exist. It includes methods for reading various types of information via\n * lstat, readlink, and readdir, and caches all information to the greatest\n * degree possible.\n *\n * Note that fs operations that would normally throw will instead return an\n * \"empty\" value. This is in order to prevent excessive overhead from error\n * stack traces.\n */\nexport abstract class PathBase implements Dirent {\n  /**\n   * the basename of this path\n   *\n   * **Important**: *always* test the path name against any test string\n   * usingthe {@link isNamed} method, and not by directly comparing this\n   * string. Otherwise, unicode path strings that the system sees as identical\n   * will not be properly treated as the same path, leading to incorrect\n   * behavior and possible security issues.\n   */\n  name: string\n  /**\n   * the Path entry corresponding to the path root.\n   *\n   * @internal\n   */\n  root: PathBase\n  /**\n   * All roots found within the current PathScurry family\n   *\n   * @internal\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * a reference to the parent path, or undefined in the case of root entries\n   *\n   * @internal\n   */\n  parent?: PathBase\n  /**\n   * boolean indicating whether paths are compared case-insensitively\n   * @internal\n   */\n  nocase: boolean\n\n  /**\n   * boolean indicating that this path is the current working directory\n   * of the PathScurry collection that contains it.\n   */\n  isCWD: boolean = false\n\n  /**\n   * the string or regexp used to split paths. On posix, it is `'/'`, and on\n   * windows it is a RegExp matching either `'/'` or `'\\\\'`\n   */\n  abstract splitSep: string | RegExp\n  /**\n   * The path separator string to use when joining paths\n   */\n  abstract sep: string\n\n  // potential default fs override\n  #fs: FSValue\n\n  // Stats fields\n  #dev?: number\n  get dev() {\n    return this.#dev\n  }\n  #mode?: number\n  get mode() {\n    return this.#mode\n  }\n  #nlink?: number\n  get nlink() {\n    return this.#nlink\n  }\n  #uid?: number\n  get uid() {\n    return this.#uid\n  }\n  #gid?: number\n  get gid() {\n    return this.#gid\n  }\n  #rdev?: number\n  get rdev() {\n    return this.#rdev\n  }\n  #blksize?: number\n  get blksize() {\n    return this.#blksize\n  }\n  #ino?: number\n  get ino() {\n    return this.#ino\n  }\n  #size?: number\n  get size() {\n    return this.#size\n  }\n  #blocks?: number\n  get blocks() {\n    return this.#blocks\n  }\n  #atimeMs?: number\n  get atimeMs() {\n    return this.#atimeMs\n  }\n  #mtimeMs?: number\n  get mtimeMs() {\n    return this.#mtimeMs\n  }\n  #ctimeMs?: number\n  get ctimeMs() {\n    return this.#ctimeMs\n  }\n  #birthtimeMs?: number\n  get birthtimeMs() {\n    return this.#birthtimeMs\n  }\n  #atime?: Date\n  get atime() {\n    return this.#atime\n  }\n  #mtime?: Date\n  get mtime() {\n    return this.#mtime\n  }\n  #ctime?: Date\n  get ctime() {\n    return this.#ctime\n  }\n  #birthtime?: Date\n  get birthtime() {\n    return this.#birthtime\n  }\n\n  #matchName: string\n  #depth?: number\n  #fullpath?: string\n  #fullpathPosix?: string\n  #relative?: string\n  #relativePosix?: string\n  #type: number\n  #children: ChildrenCache\n  #linkTarget?: PathBase\n  #realpath?: PathBase\n\n  /**\n   * This property is for compatibility with the Dirent class as of\n   * Node v20, where Dirent['parentPath'] refers to the path of the\n   * directory that was passed to readdir. For root entries, it's the path\n   * to the entry itself.\n   */\n  get parentPath(): string {\n    return (this.parent || this).fullpath()\n  }\n\n  /* c8 ignore start */\n  /**\n   * Deprecated alias for Dirent['parentPath'] Somewhat counterintuitively,\n   * this property refers to the *parent* path, not the path object itself.\n   *\n   * @deprecated\n   */\n  get path(): string {\n    return this.parentPath\n  }\n  /* c8 ignore stop */\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    this.name = name\n    this.#matchName = nocase ? normalizeNocase(name) : normalize(name)\n    this.#type = type & TYPEMASK\n    this.nocase = nocase\n    this.roots = roots\n    this.root = root || this\n    this.#children = children\n    this.#fullpath = opts.fullpath\n    this.#relative = opts.relative\n    this.#relativePosix = opts.relativePosix\n    this.parent = opts.parent\n    if (this.parent) {\n      this.#fs = this.parent.#fs\n    } else {\n      this.#fs = fsFromOption(opts.fs)\n    }\n  }\n\n  /**\n   * Returns the depth of the Path object from its root.\n   *\n   * For example, a path at `/foo/bar` would have a depth of 2.\n   */\n  depth(): number {\n    if (this.#depth !== undefined) return this.#depth\n    if (!this.parent) return (this.#depth = 0)\n    return (this.#depth = this.parent.depth() + 1)\n  }\n\n  /**\n   * @internal\n   */\n  abstract getRootString(path: string): string\n  /**\n   * @internal\n   */\n  abstract getRoot(rootPath: string): PathBase\n  /**\n   * @internal\n   */\n  abstract newChild(name: string, type?: number, opts?: PathOpts): PathBase\n\n  /**\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Get the Path object referenced by the string path, resolved from this Path\n   */\n  resolve(path?: string): PathBase {\n    if (!path) {\n      return this\n    }\n    const rootPath = this.getRootString(path)\n    const dir = path.substring(rootPath.length)\n    const dirParts = dir.split(this.splitSep)\n    const result: PathBase =\n      rootPath ?\n        this.getRoot(rootPath).#resolveParts(dirParts)\n      : this.#resolveParts(dirParts)\n    return result\n  }\n\n  #resolveParts(dirParts: string[]) {\n    let p: PathBase = this\n    for (const part of dirParts) {\n      p = p.child(part)\n    }\n    return p\n  }\n\n  /**\n   * Returns the cached children Path objects, if still available.  If they\n   * have fallen out of the cache, then returns an empty array, and resets the\n   * READDIR_CALLED bit, so that future calls to readdir() will require an fs\n   * lookup.\n   *\n   * @internal\n   */\n  children(): Children {\n    const cached = this.#children.get(this)\n    if (cached) {\n      return cached\n    }\n    const children: Children = Object.assign([], { provisional: 0 })\n    this.#children.set(this, children)\n    this.#type &= ~READDIR_CALLED\n    return children\n  }\n\n  /**\n   * Resolves a path portion and returns or creates the child Path.\n   *\n   * Returns `this` if pathPart is `''` or `'.'`, or `parent` if pathPart is\n   * `'..'`.\n   *\n   * This should not be called directly.  If `pathPart` contains any path\n   * separators, it will lead to unsafe undefined behavior.\n   *\n   * Use `Path.resolve()` instead.\n   *\n   * @internal\n   */\n  child(pathPart: string, opts?: PathOpts): PathBase {\n    if (pathPart === '' || pathPart === '.') {\n      return this\n    }\n    if (pathPart === '..') {\n      return this.parent || this\n    }\n\n    // find the child\n    const children = this.children()\n    const name =\n      this.nocase ? normalizeNocase(pathPart) : normalize(pathPart)\n    for (const p of children) {\n      if (p.#matchName === name) {\n        return p\n      }\n    }\n\n    // didn't find it, create provisional child, since it might not\n    // actually exist.  If we know the parent isn't a dir, then\n    // in fact it CAN'T exist.\n    const s = this.parent ? this.sep : ''\n    const fullpath =\n      this.#fullpath ? this.#fullpath + s + pathPart : undefined\n    const pchild = this.newChild(pathPart, UNKNOWN, {\n      ...opts,\n      parent: this,\n      fullpath,\n    })\n\n    if (!this.canReaddir()) {\n      pchild.#type |= ENOENT\n    }\n\n    // don't have to update provisional, because if we have real children,\n    // then provisional is set to children.length, otherwise a lower number\n    children.push(pchild)\n    return pchild\n  }\n\n  /**\n   * The relative path from the cwd. If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpath()\n   */\n  relative(): string {\n    if (this.isCWD) return ''\n    if (this.#relative !== undefined) {\n      return this.#relative\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relative = this.name)\n    }\n    const pv = p.relative()\n    return pv + (!pv || !p.parent ? '' : this.sep) + name\n  }\n\n  /**\n   * The relative path from the cwd, using / as the path separator.\n   * If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpathPosix()\n   * On posix systems, this is identical to relative().\n   */\n  relativePosix(): string {\n    if (this.sep === '/') return this.relative()\n    if (this.isCWD) return ''\n    if (this.#relativePosix !== undefined) return this.#relativePosix\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relativePosix = this.fullpathPosix())\n    }\n    const pv = p.relativePosix()\n    return pv + (!pv || !p.parent ? '' : '/') + name\n  }\n\n  /**\n   * The fully resolved path string for this Path entry\n   */\n  fullpath(): string {\n    if (this.#fullpath !== undefined) {\n      return this.#fullpath\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#fullpath = this.name)\n    }\n    const pv = p.fullpath()\n    const fp = pv + (!p.parent ? '' : this.sep) + name\n    return (this.#fullpath = fp)\n  }\n\n  /**\n   * On platforms other than windows, this is identical to fullpath.\n   *\n   * On windows, this is overridden to return the forward-slash form of the\n   * full UNC path.\n   */\n  fullpathPosix(): string {\n    if (this.#fullpathPosix !== undefined) return this.#fullpathPosix\n    if (this.sep === '/') return (this.#fullpathPosix = this.fullpath())\n    if (!this.parent) {\n      const p = this.fullpath().replace(/\\\\/g, '/')\n      if (/^[a-z]:\\//i.test(p)) {\n        return (this.#fullpathPosix = `//?/${p}`)\n      } else {\n        return (this.#fullpathPosix = p)\n      }\n    }\n    const p = this.parent\n    const pfpp = p.fullpathPosix()\n    const fpp = pfpp + (!pfpp || !p.parent ? '' : '/') + this.name\n    return (this.#fullpathPosix = fpp)\n  }\n\n  /**\n   * Is the Path of an unknown type?\n   *\n   * Note that we might know *something* about it if there has been a previous\n   * filesystem operation, for example that it does not exist, or is not a\n   * link, or whether it has child entries.\n   */\n  isUnknown(): boolean {\n    return (this.#type & IFMT) === UNKNOWN\n  }\n\n  isType(type: Type): boolean {\n    return this[`is${type}`]()\n  }\n\n  getType(): Type {\n    return (\n      this.isUnknown() ? 'Unknown'\n      : this.isDirectory() ? 'Directory'\n      : this.isFile() ? 'File'\n      : this.isSymbolicLink() ? 'SymbolicLink'\n      : this.isFIFO() ? 'FIFO'\n      : this.isCharacterDevice() ? 'CharacterDevice'\n      : this.isBlockDevice() ? 'BlockDevice'\n      : /* c8 ignore start */ this.isSocket() ? 'Socket'\n      : 'Unknown'\n    )\n    /* c8 ignore stop */\n  }\n\n  /**\n   * Is the Path a regular file?\n   */\n  isFile(): boolean {\n    return (this.#type & IFMT) === IFREG\n  }\n\n  /**\n   * Is the Path a directory?\n   */\n  isDirectory(): boolean {\n    return (this.#type & IFMT) === IFDIR\n  }\n\n  /**\n   * Is the path a character device?\n   */\n  isCharacterDevice(): boolean {\n    return (this.#type & IFMT) === IFCHR\n  }\n\n  /**\n   * Is the path a block device?\n   */\n  isBlockDevice(): boolean {\n    return (this.#type & IFMT) === IFBLK\n  }\n\n  /**\n   * Is the path a FIFO pipe?\n   */\n  isFIFO(): boolean {\n    return (this.#type & IFMT) === IFIFO\n  }\n\n  /**\n   * Is the path a socket?\n   */\n  isSocket(): boolean {\n    return (this.#type & IFMT) === IFSOCK\n  }\n\n  /**\n   * Is the path a symbolic link?\n   */\n  isSymbolicLink(): boolean {\n    return (this.#type & IFLNK) === IFLNK\n  }\n\n  /**\n   * Return the entry if it has been subject of a successful lstat, or\n   * undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* simply\n   * mean that we haven't called lstat on it.\n   */\n  lstatCached(): PathBase | undefined {\n    return this.#type & LSTAT_CALLED ? this : undefined\n  }\n\n  /**\n   * Return the cached link target if the entry has been the subject of a\n   * successful readlink, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readlink() has been called at some point.\n   */\n  readlinkCached(): PathBase | undefined {\n    return this.#linkTarget\n  }\n\n  /**\n   * Returns the cached realpath target if the entry has been the subject\n   * of a successful realpath, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * realpath() has been called at some point.\n   */\n  realpathCached(): PathBase | undefined {\n    return this.#realpath\n  }\n\n  /**\n   * Returns the cached child Path entries array if the entry has been the\n   * subject of a successful readdir(), or [] otherwise.\n   *\n   * Does not read the filesystem, so an empty array *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readdir() has been called recently enough to still be valid.\n   */\n  readdirCached(): PathBase[] {\n    const children = this.children()\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * Return true if it's worth trying to readlink.  Ie, we don't (yet) have\n   * any indication that readlink will definitely fail.\n   *\n   * Returns false if the path is known to not be a symlink, if a previous\n   * readlink failed, or if the entry does not exist.\n   */\n  canReadlink(): boolean {\n    if (this.#linkTarget) return true\n    if (!this.parent) return false\n    // cases where it cannot possibly succeed\n    const ifmt = this.#type & IFMT\n    return !(\n      (ifmt !== UNKNOWN && ifmt !== IFLNK) ||\n      this.#type & ENOREADLINK ||\n      this.#type & ENOENT\n    )\n  }\n\n  /**\n   * Return true if readdir has previously been successfully called on this\n   * path, indicating that cachedReaddir() is likely valid.\n   */\n  calledReaddir(): boolean {\n    return !!(this.#type & READDIR_CALLED)\n  }\n\n  /**\n   * Returns true if the path is known to not exist. That is, a previous lstat\n   * or readdir failed to verify its existence when that would have been\n   * expected, or a parent entry was marked either enoent or enotdir.\n   */\n  isENOENT(): boolean {\n    return !!(this.#type & ENOENT)\n  }\n\n  /**\n   * Return true if the path is a match for the given path name.  This handles\n   * case sensitivity and unicode normalization.\n   *\n   * Note: even on case-sensitive systems, it is **not** safe to test the\n   * equality of the `.name` property to determine whether a given pathname\n   * matches, due to unicode normalization mismatches.\n   *\n   * Always use this method instead of testing the `path.name` property\n   * directly.\n   */\n  isNamed(n: string): boolean {\n    return !this.nocase ?\n        this.#matchName === normalize(n)\n      : this.#matchName === normalizeNocase(n)\n  }\n\n  /**\n   * Return the Path object corresponding to the target of a symbolic link.\n   *\n   * If the Path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   */\n  async readlink(): Promise<PathBase | undefined> {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = await this.#fs.promises.readlink(this.fullpath())\n      const linkTarget = (await this.parent.realpath())?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  /**\n   * Synchronous {@link PathBase.readlink}\n   */\n  readlinkSync(): PathBase | undefined {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = this.#fs.readlinkSync(this.fullpath())\n      const linkTarget = this.parent.realpathSync()?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  #readdirSuccess(children: Children) {\n    // succeeded, mark readdir called bit\n    this.#type |= READDIR_CALLED\n    // mark all remaining provisional children as ENOENT\n    for (let p = children.provisional; p < children.length; p++) {\n      const c = children[p]\n      if (c) c.#markENOENT()\n    }\n  }\n\n  #markENOENT() {\n    // mark as UNKNOWN and ENOENT\n    if (this.#type & ENOENT) return\n    this.#type = (this.#type | ENOENT) & IFMT_UNKNOWN\n    this.#markChildrenENOENT()\n  }\n\n  #markChildrenENOENT() {\n    // all children are provisional and do not exist\n    const children = this.children()\n    children.provisional = 0\n    for (const p of children) {\n      p.#markENOENT()\n    }\n  }\n\n  #markENOREALPATH() {\n    this.#type |= ENOREALPATH\n    this.#markENOTDIR()\n  }\n\n  // save the information when we know the entry is not a dir\n  #markENOTDIR() {\n    // entry is not a directory, so any children can't exist.\n    // this *should* be impossible, since any children created\n    // after it's been marked ENOTDIR should be marked ENOENT,\n    // so it won't even get to this point.\n    /* c8 ignore start */\n    if (this.#type & ENOTDIR) return\n    /* c8 ignore stop */\n    let t = this.#type\n    // this could happen if we stat a dir, then delete it,\n    // then try to read it or one of its children.\n    if ((t & IFMT) === IFDIR) t &= IFMT_UNKNOWN\n    this.#type = t | ENOTDIR\n    this.#markChildrenENOENT()\n  }\n\n  #readdirFail(code: string = '') {\n    // markENOTDIR and markENOENT also set provisional=0\n    if (code === 'ENOTDIR' || code === 'EPERM') {\n      this.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      this.#markENOENT()\n    } else {\n      this.children().provisional = 0\n    }\n  }\n\n  #lstatFail(code: string = '') {\n    // Windows just raises ENOENT in this case, disable for win CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR') {\n      // already know it has a parent by this point\n      const p = this.parent as PathBase\n      p.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      /* c8 ignore stop */\n      this.#markENOENT()\n    }\n  }\n\n  #readlinkFail(code: string = '') {\n    let ter = this.#type\n    ter |= ENOREADLINK\n    if (code === 'ENOENT') ter |= ENOENT\n    // windows gets a weird error when you try to readlink a file\n    if (code === 'EINVAL' || code === 'UNKNOWN') {\n      // exists, but not a symlink, we don't know WHAT it is, so remove\n      // all IFMT bits.\n      ter &= IFMT_UNKNOWN\n    }\n    this.#type = ter\n    // windows just gets ENOENT in this case.  We do cover the case,\n    // just disabled because it's impossible on Windows CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR' && this.parent) {\n      this.parent.#markENOTDIR()\n    }\n    /* c8 ignore stop */\n  }\n\n  #readdirAddChild(e: Dirent, c: Children) {\n    return (\n      this.#readdirMaybePromoteChild(e, c) ||\n      this.#readdirAddNewChild(e, c)\n    )\n  }\n\n  #readdirAddNewChild(e: Dirent, c: Children): PathBase {\n    // alloc new entry at head, so it's never provisional\n    const type = entToType(e)\n    const child = this.newChild(e.name, type, { parent: this })\n    const ifmt = child.#type & IFMT\n    if (ifmt !== IFDIR && ifmt !== IFLNK && ifmt !== UNKNOWN) {\n      child.#type |= ENOTDIR\n    }\n    c.unshift(child)\n    c.provisional++\n    return child\n  }\n\n  #readdirMaybePromoteChild(e: Dirent, c: Children): PathBase | undefined {\n    for (let p = c.provisional; p < c.length; p++) {\n      const pchild = c[p]\n      const name =\n        this.nocase ? normalizeNocase(e.name) : normalize(e.name)\n      if (name !== pchild!.#matchName) {\n        continue\n      }\n\n      return this.#readdirPromoteChild(e, pchild!, p, c)\n    }\n  }\n\n  #readdirPromoteChild(\n    e: Dirent,\n    p: PathBase,\n    index: number,\n    c: Children,\n  ): PathBase {\n    const v = p.name\n    // retain any other flags, but set ifmt from dirent\n    p.#type = (p.#type & IFMT_UNKNOWN) | entToType(e)\n    // case sensitivity fixing when we learn the true name.\n    if (v !== e.name) p.name = e.name\n\n    // just advance provisional index (potentially off the list),\n    // otherwise we have to splice/pop it out and re-insert at head\n    if (index !== c.provisional) {\n      if (index === c.length - 1) c.pop()\n      else c.splice(index, 1)\n      c.unshift(p)\n    }\n    c.provisional++\n    return p\n  }\n\n  /**\n   * Call lstat() on this Path, and update all known information that can be\n   * determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(): Promise<PathBase | undefined> {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(await this.#fs.promises.lstat(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  /**\n   * synchronous {@link PathBase.lstat}\n   */\n  lstatSync(): PathBase | undefined {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(this.#fs.lstatSync(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  #applyStat(st: Stats) {\n    const {\n      atime,\n      atimeMs,\n      birthtime,\n      birthtimeMs,\n      blksize,\n      blocks,\n      ctime,\n      ctimeMs,\n      dev,\n      gid,\n      ino,\n      mode,\n      mtime,\n      mtimeMs,\n      nlink,\n      rdev,\n      size,\n      uid,\n    } = st\n    this.#atime = atime\n    this.#atimeMs = atimeMs\n    this.#birthtime = birthtime\n    this.#birthtimeMs = birthtimeMs\n    this.#blksize = blksize\n    this.#blocks = blocks\n    this.#ctime = ctime\n    this.#ctimeMs = ctimeMs\n    this.#dev = dev\n    this.#gid = gid\n    this.#ino = ino\n    this.#mode = mode\n    this.#mtime = mtime\n    this.#mtimeMs = mtimeMs\n    this.#nlink = nlink\n    this.#rdev = rdev\n    this.#size = size\n    this.#uid = uid\n    const ifmt = entToType(st)\n    // retain any other flags, but set the ifmt\n    this.#type = (this.#type & IFMT_UNKNOWN) | ifmt | LSTAT_CALLED\n    if (ifmt !== UNKNOWN && ifmt !== IFDIR && ifmt !== IFLNK) {\n      this.#type |= ENOTDIR\n    }\n  }\n\n  #onReaddirCB: ((\n    er: NodeJS.ErrnoException | null,\n    entries: Path[],\n  ) => any)[] = []\n  #readdirCBInFlight: boolean = false\n  #callOnReaddirCB(children: Path[]) {\n    this.#readdirCBInFlight = false\n    const cbs = this.#onReaddirCB.slice()\n    this.#onReaddirCB.length = 0\n    cbs.forEach(cb => cb(null, children))\n  }\n\n  /**\n   * Standard node-style callback interface to get list of directory entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * @param cb The callback called with (er, entries).  Note that the `er`\n   * param is somewhat extraneous, as all readdir() errors are handled and\n   * simply result in an empty set of entries being returned.\n   * @param allowZalgo Boolean indicating that immediately known results should\n   * *not* be deferred with `queueMicrotask`. Defaults to `false`. Release\n   * zalgo at your peril, the dark pony lord is devious and unforgiving.\n   */\n  readdirCB(\n    cb: (er: NodeJS.ErrnoException | null, entries: PathBase[]) => any,\n    allowZalgo: boolean = false,\n  ): void {\n    if (!this.canReaddir()) {\n      if (allowZalgo) cb(null, [])\n      else queueMicrotask(() => cb(null, []))\n      return\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      const c = children.slice(0, children.provisional)\n      if (allowZalgo) cb(null, c)\n      else queueMicrotask(() => cb(null, c))\n      return\n    }\n\n    // don't have to worry about zalgo at this point.\n    this.#onReaddirCB.push(cb)\n    if (this.#readdirCBInFlight) {\n      return\n    }\n    this.#readdirCBInFlight = true\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    this.#fs.readdir(fullpath, { withFileTypes: true }, (er, entries) => {\n      if (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      } else {\n        // if we didn't get an error, we always get entries.\n        //@ts-ignore\n        for (const e of entries) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      }\n      this.#callOnReaddirCB(children.slice(0, children.provisional))\n      return\n    })\n  }\n\n  #asyncReaddirInFlight?: Promise<void>\n\n  /**\n   * Return an array of known child entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async readdir(): Promise<PathBase[]> {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    if (this.#asyncReaddirInFlight) {\n      await this.#asyncReaddirInFlight\n    } else {\n      /* c8 ignore start */\n      let resolve: () => void = () => {}\n      /* c8 ignore stop */\n      this.#asyncReaddirInFlight = new Promise<void>(\n        res => (resolve = res),\n      )\n      try {\n        for (const e of await this.#fs.promises.readdir(fullpath, {\n          withFileTypes: true,\n        })) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      } catch (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      }\n      this.#asyncReaddirInFlight = undefined\n      resolve()\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * synchronous {@link PathBase.readdir}\n   */\n  readdirSync(): PathBase[] {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    try {\n      for (const e of this.#fs.readdirSync(fullpath, {\n        withFileTypes: true,\n      })) {\n        this.#readdirAddChild(e, children)\n      }\n      this.#readdirSuccess(children)\n    } catch (er) {\n      this.#readdirFail((er as NodeJS.ErrnoException).code)\n      children.provisional = 0\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  canReaddir() {\n    if (this.#type & ENOCHILD) return false\n    const ifmt = IFMT & this.#type\n    // we always set ENOTDIR when setting IFMT, so should be impossible\n    /* c8 ignore start */\n    if (!(ifmt === UNKNOWN || ifmt === IFDIR || ifmt === IFLNK)) {\n      return false\n    }\n    /* c8 ignore stop */\n    return true\n  }\n\n  shouldWalk(\n    dirs: Set<PathBase | undefined>,\n    walkFilter?: (e: PathBase) => boolean,\n  ): boolean {\n    return (\n      (this.#type & IFDIR) === IFDIR &&\n      !(this.#type & ENOCHILD) &&\n      !dirs.has(this) &&\n      (!walkFilter || walkFilter(this))\n    )\n  }\n\n  /**\n   * Return the Path object corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   * On success, returns a Path object.\n   */\n  async realpath(): Promise<PathBase | undefined> {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = await this.#fs.promises.realpath(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Synchronous {@link realpath}\n   */\n  realpathSync(): PathBase | undefined {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = this.#fs.realpathSync(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Internal method to mark this Path object as the scurry cwd,\n   * called by {@link PathScurry#chdir}\n   *\n   * @internal\n   */\n  [setAsCwd](oldCwd: PathBase): void {\n    if (oldCwd === this) return\n    oldCwd.isCWD = false\n    this.isCWD = true\n\n    const changed = new Set<PathBase>([])\n    let rp = []\n    let p: PathBase = this\n    while (p && p.parent) {\n      changed.add(p)\n      p.#relative = rp.join(this.sep)\n      p.#relativePosix = rp.join('/')\n      p = p.parent\n      rp.push('..')\n    }\n    // now un-memoize parents of old cwd\n    p = oldCwd\n    while (p && p.parent && !changed.has(p)) {\n      p.#relative = undefined\n      p.#relativePosix = undefined\n      p = p.parent\n    }\n  }\n}\n\n/**\n * Path class used on win32 systems\n *\n * Uses `'\\\\'` as the path separator for returned paths, either `'\\\\'` or `'/'`\n * as the path separator for parsing paths.\n */\nexport class PathWin32 extends PathBase {\n  /**\n   * Separator for generating path strings.\n   */\n  sep: '\\\\' = '\\\\'\n  /**\n   * Separator for parsing path strings.\n   */\n  splitSep: RegExp = eitherSep\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathWin32(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return win32.parse(path).root\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(rootPath: string): PathBase {\n    rootPath = uncToDrive(rootPath.toUpperCase())\n    if (rootPath === this.root.name) {\n      return this.root\n    }\n    // ok, not that one, check if it matches another we know about\n    for (const [compare, root] of Object.entries(this.roots)) {\n      if (this.sameRoot(rootPath, compare)) {\n        return (this.roots[rootPath] = root)\n      }\n    }\n    // otherwise, have to create a new one.\n    return (this.roots[rootPath] = new PathScurryWin32(\n      rootPath,\n      this,\n    ).root)\n  }\n\n  /**\n   * @internal\n   */\n  sameRoot(rootPath: string, compare: string = this.root.name): boolean {\n    // windows can (rarely) have case-sensitive filesystem, but\n    // UNC and drive letters are always case-insensitive, and canonically\n    // represented uppercase.\n    rootPath = rootPath\n      .toUpperCase()\n      .replace(/\\//g, '\\\\')\n      .replace(uncDriveRegexp, '$1\\\\')\n    return rootPath === compare\n  }\n}\n\n/**\n * Path class used on all posix systems.\n *\n * Uses `'/'` as the path separator.\n */\nexport class PathPosix extends PathBase {\n  /**\n   * separator for parsing path strings\n   */\n  splitSep: '/' = '/'\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return path.startsWith('/') ? '/' : ''\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(_rootPath: string): PathBase {\n    return this.root\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathPosix(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n}\n\n/**\n * Options that may be provided to the PathScurry constructor\n */\nexport interface PathScurryOpts {\n  /**\n   * perform case-insensitive path matching. Default based on platform\n   * subclass.\n   */\n  nocase?: boolean\n  /**\n   * Number of Path entries to keep in the cache of Path child references.\n   *\n   * Setting this higher than 65536 will dramatically increase the data\n   * consumption and construction time overhead of each PathScurry.\n   *\n   * Setting this value to 256 or lower will significantly reduce the data\n   * consumption and construction time overhead, but may also reduce resolve()\n   * and readdir() performance on large filesystems.\n   *\n   * Default `16384`.\n   */\n  childrenCacheSize?: number\n  /**\n   * An object that overrides the built-in functions from the fs and\n   * fs/promises modules.\n   *\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * The base class for all PathScurry classes, providing the interface for path\n * resolution and filesystem operations.\n *\n * Typically, you should *not* instantiate this class directly, but rather one\n * of the platform-specific classes, or the exported {@link PathScurry} which\n * defaults to the current platform.\n */\nexport abstract class PathScurryBase {\n  /**\n   * The root Path entry for the current working directory of this Scurry\n   */\n  root: PathBase\n  /**\n   * The string path for the root of this Scurry's current working directory\n   */\n  rootPath: string\n  /**\n   * A collection of all roots encountered, referenced by rootPath\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * The Path entry corresponding to this PathScurry's current working directory.\n   */\n  cwd: PathBase\n  #resolveCache: ResolveCache\n  #resolvePosixCache: ResolveCache\n  #children: ChildrenCache\n  /**\n   * Perform path comparisons case-insensitively.\n   *\n   * Defaults true on Darwin and Windows systems, false elsewhere.\n   */\n  nocase: boolean\n\n  /**\n   * The path separator used for parsing paths\n   *\n   * `'/'` on Posix systems, either `'/'` or `'\\\\'` on Windows\n   */\n  abstract sep: string | RegExp\n\n  #fs: FSValue\n\n  /**\n   * This class should not be instantiated directly.\n   *\n   * Use PathScurryWin32, PathScurryDarwin, PathScurryPosix, or PathScurry\n   *\n   * @internal\n   */\n  constructor(\n    cwd: URL | string = process.cwd(),\n    pathImpl: typeof win32 | typeof posix,\n    sep: string | RegExp,\n    {\n      nocase,\n      childrenCacheSize = 16 * 1024,\n      fs = defaultFS,\n    }: PathScurryOpts = {},\n  ) {\n    this.#fs = fsFromOption(fs)\n    if (cwd instanceof URL || cwd.startsWith('file://')) {\n      cwd = fileURLToPath(cwd)\n    }\n    // resolve and split root, and then add to the store.\n    // this is the only time we call path.resolve()\n    const cwdPath = pathImpl.resolve(cwd)\n    this.roots = Object.create(null)\n    this.rootPath = this.parseRootPath(cwdPath)\n    this.#resolveCache = new ResolveCache()\n    this.#resolvePosixCache = new ResolveCache()\n    this.#children = new ChildrenCache(childrenCacheSize)\n\n    const split = cwdPath.substring(this.rootPath.length).split(sep)\n    // resolve('/') leaves '', splits to [''], we don't want that.\n    if (split.length === 1 && !split[0]) {\n      split.pop()\n    }\n    /* c8 ignore start */\n    if (nocase === undefined) {\n      throw new TypeError(\n        'must provide nocase setting to PathScurryBase ctor',\n      )\n    }\n    /* c8 ignore stop */\n    this.nocase = nocase\n    this.root = this.newRoot(this.#fs)\n    this.roots[this.rootPath] = this.root\n    let prev: PathBase = this.root\n    let len = split.length - 1\n    const joinSep = pathImpl.sep\n    let abs = this.rootPath\n    let sawFirst = false\n    for (const part of split) {\n      const l = len--\n      prev = prev.child(part, {\n        relative: new Array(l).fill('..').join(joinSep),\n        relativePosix: new Array(l).fill('..').join('/'),\n        fullpath: (abs += (sawFirst ? '' : joinSep) + part),\n      })\n      sawFirst = true\n    }\n    this.cwd = prev\n  }\n\n  /**\n   * Get the depth of a provided path, string, or the cwd\n   */\n  depth(path: Path | string = this.cwd): number {\n    if (typeof path === 'string') {\n      path = this.cwd.resolve(path)\n    }\n    return path.depth()\n  }\n\n  /**\n   * Parse the root portion of a path string\n   *\n   * @internal\n   */\n  abstract parseRootPath(dir: string): string\n  /**\n   * create a new Path to use as root during construction.\n   *\n   * @internal\n   */\n  abstract newRoot(fs: FSValue): PathBase\n  /**\n   * Determine whether a given path string is absolute\n   */\n  abstract isAbsolute(p: string): boolean\n\n  /**\n   * Return the cache of child entries.  Exposed so subclasses can create\n   * child Path objects in a platform-specific way.\n   *\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolve(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolveCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpath()\n    this.#resolveCache.set(r, result)\n    return result\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string, returning\n   * the posix path.  Identical to .resolve() on posix systems, but on\n   * windows will return a forward-slash separated UNC path.\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolvePosix(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolvePosixCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpathPosix()\n    this.#resolvePosixCache.set(r, result)\n    return result\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or entry\n   */\n  relative(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relative()\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or\n   * entry, using / as the path delimiter, even on Windows.\n   */\n  relativePosix(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relativePosix()\n  }\n\n  /**\n   * Return the basename for the provided string or Path object\n   */\n  basename(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.name\n  }\n\n  /**\n   * Return the dirname for the provided string or Path object\n   */\n  dirname(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return (entry.parent || entry).fullpath()\n  }\n\n  /**\n   * Return an array of known child entries.\n   *\n   * First argument may be either a string, or a Path object.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * Unlike `fs.readdir()`, the `withFileTypes` option defaults to `true`. Set\n   * `{ withFileTypes: false }` to return strings.\n   */\n\n  readdir(): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: true }): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: false }): Promise<string[]>\n  readdir(opts: { withFileTypes: boolean }): Promise<PathBase[] | string[]>\n  readdir(entry: PathBase | string): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): Promise<string[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): Promise<PathBase[] | string[]>\n  async readdir(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else {\n      const p = await entry.readdir()\n      return withFileTypes ? p : p.map(e => e.name)\n    }\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readdir}\n   */\n  readdirSync(): PathBase[]\n  readdirSync(opts: { withFileTypes: true }): PathBase[]\n  readdirSync(opts: { withFileTypes: false }): string[]\n  readdirSync(opts: { withFileTypes: boolean }): PathBase[] | string[]\n  readdirSync(entry: PathBase | string): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): string[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): PathBase[] | string[]\n  readdirSync(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes = true } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else if (withFileTypes) {\n      return entry.readdirSync()\n    } else {\n      return entry.readdirSync().map(e => e.name)\n    }\n  }\n\n  /**\n   * Call lstat() on the string or Path object, and update all known\n   * information that can be determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(\n    entry: string | PathBase = this.cwd,\n  ): Promise<PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstat()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.lstat}\n   */\n  lstatSync(entry: string | PathBase = this.cwd): PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstatSync()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to the target of a\n   * symbolic link.\n   *\n   * If the path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  readlink(): Promise<string | undefined>\n  readlink(opt: { withFileTypes: false }): Promise<string | undefined>\n  readlink(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  readlink(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async readlink(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.readlink()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readlink}\n   */\n  readlinkSync(): string | undefined\n  readlinkSync(opt: { withFileTypes: false }): string | undefined\n  readlinkSync(opt: { withFileTypes: true }): PathBase | undefined\n  readlinkSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.readlinkSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  realpath(): Promise<string | undefined>\n  realpath(opt: { withFileTypes: false }): Promise<string | undefined>\n  realpath(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  realpath(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async realpath(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.realpath()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  realpathSync(): string | undefined\n  realpathSync(opt: { withFileTypes: false }): string | undefined\n  realpathSync(opt: { withFileTypes: true }): PathBase | undefined\n  realpathSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  realpathSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.realpathSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Asynchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walk(): Promise<PathBase[]>\n  walk(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(opts: WalkOptionsWithFileTypesFalse): Promise<string[]>\n  walk(opts: WalkOptions): Promise<string[] | PathBase[]>\n  walk(entry: string | PathBase): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Promise<string[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Promise<PathBase[] | string[]>\n  async walk(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const walk = (\n      dir: PathBase,\n      cb: (er?: NodeJS.ErrnoException) => void,\n    ) => {\n      dirs.add(dir)\n      dir.readdirCB((er, entries) => {\n        /* c8 ignore start */\n        if (er) {\n          return cb(er)\n        }\n        /* c8 ignore stop */\n        let len = entries.length\n        if (!len) return cb()\n        const next = () => {\n          if (--len === 0) {\n            cb()\n          }\n        }\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            results.push(withFileTypes ? e : e.fullpath())\n          }\n          if (follow && e.isSymbolicLink()) {\n            e.realpath()\n              .then(r => (r?.isUnknown() ? r.lstat() : r))\n              .then(r =>\n                r?.shouldWalk(dirs, walkFilter) ? walk(r, next) : next(),\n              )\n          } else {\n            if (e.shouldWalk(dirs, walkFilter)) {\n              walk(e, next)\n            } else {\n              next()\n            }\n          }\n        }\n      }, true) // zalgooooooo\n    }\n\n    const start = entry\n    return new Promise<PathBase[] | string[]>((res, rej) => {\n      walk(start, er => {\n        /* c8 ignore start */\n        if (er) return rej(er)\n        /* c8 ignore stop */\n        res(results as PathBase[] | string[])\n      })\n    })\n  }\n\n  /**\n   * Synchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walkSync(): PathBase[]\n  walkSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): PathBase[]\n  walkSync(opts: WalkOptionsWithFileTypesFalse): string[]\n  walkSync(opts: WalkOptions): string[] | PathBase[]\n  walkSync(entry: string | PathBase): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): string[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): PathBase[] | string[]\n  walkSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          results.push(withFileTypes ? e : e.fullpath())\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n    return results as string[] | PathBase[]\n  }\n\n  /**\n   * Support for `for await`\n   *\n   * Alias for {@link PathScurryBase.iterate}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n\n  /**\n   * Async generator form of {@link PathScurryBase.walk}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking, especially if most/all of the directory tree has been previously\n   * walked.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  iterate(): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(opts: WalkOptions): AsyncGenerator<string | PathBase, void, void>\n  iterate(entry: string | PathBase): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): AsyncGenerator<PathBase | string, void, void>\n  iterate(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    options: WalkOptions = {},\n  ): AsyncGenerator<PathBase | string, void, void> {\n    // iterating async over the stream is significantly more performant,\n    // especially in the warm-cache scenario, because it buffers up directory\n    // entries in the background instead of waiting for a yield for each one.\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      options = entry\n      entry = this.cwd\n    }\n    return this.stream(entry, options)[Symbol.asyncIterator]()\n  }\n\n  /**\n   * Iterating over a PathScurry performs a synchronous walk.\n   *\n   * Alias for {@link PathScurryBase.iterateSync}\n   */\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  iterateSync(): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(opts: WalkOptions): Generator<string | PathBase, void, void>\n  iterateSync(entry: string | PathBase): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Generator<PathBase | string, void, void>\n  *iterateSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Generator<PathBase | string, void, void> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    if (!filter || filter(entry)) {\n      yield withFileTypes ? entry : entry.fullpath()\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          yield withFileTypes ? e : e.fullpath()\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n  }\n\n  /**\n   * Stream form of {@link PathScurryBase.walk}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   */\n  stream(): Minipass<PathBase>\n  stream(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  stream(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  stream(opts: WalkOptions): Minipass<string | PathBase>\n  stream(entry: string | PathBase): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  stream(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n\n        processing++\n        dirs.add(dir)\n\n        const onReaddir = (\n          er: null | NodeJS.ErrnoException,\n          entries: PathBase[],\n          didRealpaths: boolean = false,\n        ) => {\n          /* c8 ignore start */\n          if (er) return results.emit('error', er)\n          /* c8 ignore stop */\n          if (follow && !didRealpaths) {\n            const promises: Promise<PathBase | undefined>[] = []\n            for (const e of entries) {\n              if (e.isSymbolicLink()) {\n                promises.push(\n                  e\n                    .realpath()\n                    .then((r: PathBase | undefined) =>\n                      r?.isUnknown() ? r.lstat() : r,\n                    ),\n                )\n              }\n            }\n            if (promises.length) {\n              Promise.all(promises).then(() =>\n                onReaddir(null, entries, true),\n              )\n              return\n            }\n          }\n\n          for (const e of entries) {\n            if (e && (!filter || filter(e))) {\n              if (!results.write(withFileTypes ? e : e.fullpath())) {\n                paused = true\n              }\n            }\n          }\n\n          processing--\n          for (const e of entries) {\n            const r = e.realpathCached() || e\n            if (r.shouldWalk(dirs, walkFilter)) {\n              queue.push(r)\n            }\n          }\n          if (paused && !results.flowing) {\n            results.once('drain', process)\n          } else if (!sync) {\n            process()\n          }\n        }\n\n        // zalgo containment\n        let sync = true\n        dir.readdirCB(onReaddir, true)\n        sync = false\n      }\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  /**\n   * Synchronous form of {@link PathScurryBase.stream}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   *\n   * Will complete the walk in a single tick if the stream is consumed fully.\n   * Otherwise, will pause as needed for stream backpressure.\n   */\n  streamSync(): Minipass<PathBase>\n  streamSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  streamSync(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  streamSync(opts: WalkOptions): Minipass<string | PathBase>\n  streamSync(entry: string | PathBase): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    const dirs = new Set<PathBase>()\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n        processing++\n        dirs.add(dir)\n\n        const entries = dir.readdirSync()\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            if (!results.write(withFileTypes ? e : e.fullpath())) {\n              paused = true\n            }\n          }\n        }\n        processing--\n        for (const e of entries) {\n          let r: PathBase | undefined = e\n          if (e.isSymbolicLink()) {\n            if (!(follow && (r = e.realpathSync()))) continue\n            if (r.isUnknown()) r.lstatSync()\n          }\n          if (r.shouldWalk(dirs, walkFilter)) {\n            queue.push(r)\n          }\n        }\n      }\n      if (paused && !results.flowing) results.once('drain', process)\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  chdir(path: string | Path = this.cwd) {\n    const oldCwd = this.cwd\n    this.cwd = typeof path === 'string' ? this.cwd.resolve(path) : path\n    this.cwd[setAsCwd](oldCwd)\n  }\n}\n\n/**\n * Options provided to all walk methods.\n */\nexport interface WalkOptions {\n  /**\n   * Return results as {@link PathBase} objects rather than strings.\n   * When set to false, results are fully resolved paths, as returned by\n   * {@link PathBase.fullpath}.\n   * @default true\n   */\n  withFileTypes?: boolean\n\n  /**\n   *  Attempt to read directory entries from symbolic links. Otherwise, only\n   *  actual directories are traversed. Regardless of this setting, a given\n   *  target path will only ever be walked once, meaning that a symbolic link\n   *  to a previously traversed directory will never be followed.\n   *\n   *  Setting this imposes a slight performance penalty, because `readlink`\n   *  must be called on all symbolic links encountered, in order to avoid\n   *  infinite cycles.\n   * @default false\n   */\n  follow?: boolean\n\n  /**\n   * Only return entries where the provided function returns true.\n   *\n   * This will not prevent directories from being traversed, even if they do\n   * not pass the filter, though it will prevent directories themselves from\n   * being included in the result set.  See {@link walkFilter}\n   *\n   * Asynchronous functions are not supported here.\n   *\n   * By default, if no filter is provided, all entries and traversed\n   * directories are included.\n   */\n  filter?: (entry: PathBase) => boolean\n\n  /**\n   * Only traverse directories (and in the case of {@link follow} being set to\n   * true, symbolic links to directories) if the provided function returns\n   * true.\n   *\n   * This will not prevent directories from being included in the result set,\n   * even if they do not pass the supplied filter function.  See {@link filter}\n   * to do that.\n   *\n   * Asynchronous functions are not supported here.\n   */\n  walkFilter?: (entry: PathBase) => boolean\n}\n\nexport type WalkOptionsWithFileTypesUnset = WalkOptions & {\n  withFileTypes?: undefined\n}\nexport type WalkOptionsWithFileTypesTrue = WalkOptions & {\n  withFileTypes: true\n}\nexport type WalkOptionsWithFileTypesFalse = WalkOptions & {\n  withFileTypes: false\n}\n\n/**\n * Windows implementation of {@link PathScurryBase}\n *\n * Defaults to case insensitve, uses `'\\\\'` to generate path strings.  Uses\n * {@link PathWin32} for Path objects.\n */\nexport class PathScurryWin32 extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '\\\\' = '\\\\'\n\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, win32, '\\\\', { ...opts, nocase })\n    this.nocase = nocase\n    for (let p: PathBase | undefined = this.cwd; p; p = p.parent) {\n      p.nocase = this.nocase\n    }\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(dir: string): string {\n    // if the path starts with a single separator, it's not a UNC, and we'll\n    // just get separator as the root, and driveFromUNC will return \\\n    // In that case, mount \\ on the root from the cwd.\n    return win32.parse(dir).root.toUpperCase()\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathWin32(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return (\n      p.startsWith('/') || p.startsWith('\\\\') || /^[a-z]:(\\/|\\\\)/i.test(p)\n    )\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for all posix systems other than Darwin.\n *\n * Defaults to case-sensitive matching, uses `'/'` to generate path strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryPosix extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = false } = opts\n    super(cwd, posix, '/', { ...opts, nocase })\n    this.nocase = nocase\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(_dir: string): string {\n    return '/'\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathPosix(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return p.startsWith('/')\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for Darwin (macOS) systems.\n *\n * Defaults to case-insensitive matching, uses `'/'` for generating path\n * strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryDarwin extends PathScurryPosix {\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, { ...opts, nocase })\n  }\n}\n\n/**\n * Default {@link PathBase} implementation for the current platform.\n *\n * {@link PathWin32} on Windows systems, {@link PathPosix} on all others.\n */\nexport const Path = process.platform === 'win32' ? PathWin32 : PathPosix\nexport type Path = PathBase | InstanceType<typeof Path>\n\n/**\n * Default {@link PathScurryBase} implementation for the current platform.\n *\n * {@link PathScurryWin32} on Windows systems, {@link PathScurryDarwin} on\n * Darwin (macOS) systems, {@link PathScurryPosix} on all others.\n */\nexport const PathScurry:\n  | typeof PathScurryWin32\n  | typeof PathScurryDarwin\n  | typeof PathScurryPosix =\n  process.platform === 'win32' ? PathScurryWin32\n  : process.platform === 'darwin' ? PathScurryDarwin\n  : PathScurryPosix\nexport type PathScurry = PathScurryBase | InstanceType<typeof PathScurry>\n", "const proc =\n  typeof process === 'object' && process\n    ? process\n    : {\n        stdout: null,\n        stderr: null,\n      }\nimport { EventEmitter } from 'node:events'\nimport Stream from 'node:stream'\nimport { StringDecoder } from 'node:string_decoder'\n\n/**\n * Same as StringDecoder, but exposing the `lastNeed` flag on the type\n */\ntype SD = StringDecoder & { lastNeed: boolean }\n\nexport type { SD, Pipe, PipeProxyErrors }\n\n/**\n * Return true if the argument is a Minipass stream, Node stream, or something\n * else that Minipass can interact with.\n */\nexport const isStream = (\n  s: any\n): s is Minipass.Readable | Minipass.Writable =>\n  !!s &&\n  typeof s === 'object' &&\n  (s instanceof Minipass ||\n    s instanceof Stream ||\n    isReadable(s) ||\n    isWritable(s))\n\n/**\n * Return true if the argument is a valid {@link Minipass.Readable}\n */\nexport const isReadable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Readable).pipe === 'function' &&\n  // node core Writable streams have a pipe() method, but it throws\n  (s as Minipass.Readable).pipe !== Stream.Writable.prototype.pipe\n\n/**\n * Return true if the argument is a valid {@link Minipass.Writable}\n */\nexport const isWritable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Writable).write === 'function' &&\n  typeof (s as Minipass.Writable).end === 'function'\n\nconst EOF = Symbol('EOF')\nconst MAYBE_EMIT_END = Symbol('maybeEmitEnd')\nconst EMITTED_END = Symbol('emittedEnd')\nconst EMITTING_END = Symbol('emittingEnd')\nconst EMITTED_ERROR = Symbol('emittedError')\nconst CLOSED = Symbol('closed')\nconst READ = Symbol('read')\nconst FLUSH = Symbol('flush')\nconst FLUSHCHUNK = Symbol('flushChunk')\nconst ENCODING = Symbol('encoding')\nconst DECODER = Symbol('decoder')\nconst FLOWING = Symbol('flowing')\nconst PAUSED = Symbol('paused')\nconst RESUME = Symbol('resume')\nconst BUFFER = Symbol('buffer')\nconst PIPES = Symbol('pipes')\nconst BUFFERLENGTH = Symbol('bufferLength')\nconst BUFFERPUSH = Symbol('bufferPush')\nconst BUFFERSHIFT = Symbol('bufferShift')\nconst OBJECTMODE = Symbol('objectMode')\n// internal event when stream is destroyed\nconst DESTROYED = Symbol('destroyed')\n// internal event when stream has an error\nconst ERROR = Symbol('error')\nconst EMITDATA = Symbol('emitData')\nconst EMITEND = Symbol('emitEnd')\nconst EMITEND2 = Symbol('emitEnd2')\nconst ASYNC = Symbol('async')\nconst ABORT = Symbol('abort')\nconst ABORTED = Symbol('aborted')\nconst SIGNAL = Symbol('signal')\nconst DATALISTENERS = Symbol('dataListeners')\nconst DISCARDED = Symbol('discarded')\n\nconst defer = (fn: (...a: any[]) => any) => Promise.resolve().then(fn)\nconst nodefer = (fn: (...a: any[]) => any) => fn()\n\n// events that mean 'the stream is over'\n// these are treated specially, and re-emitted\n// if they are listened for after emitting.\ntype EndishEvent = 'end' | 'finish' | 'prefinish'\nconst isEndish = (ev: any): ev is EndishEvent =>\n  ev === 'end' || ev === 'finish' || ev === 'prefinish'\n\nconst isArrayBufferLike = (b: any): b is ArrayBufferLike =>\n  b instanceof ArrayBuffer ||\n  (!!b &&\n    typeof b === 'object' &&\n    b.constructor &&\n    b.constructor.name === 'ArrayBuffer' &&\n    b.byteLength >= 0)\n\nconst isArrayBufferView = (b: any): b is ArrayBufferView =>\n  !Buffer.isBuffer(b) && ArrayBuffer.isView(b)\n\n/**\n * Options that may be passed to stream.pipe()\n */\nexport interface PipeOptions {\n  /**\n   * end the destination stream when the source stream ends\n   */\n  end?: boolean\n  /**\n   * proxy errors from the source stream to the destination stream\n   */\n  proxyErrors?: boolean\n}\n\n/**\n * Internal class representing a pipe to a destination stream.\n *\n * @internal\n */\nclass Pipe<T extends unknown> {\n  src: Minipass<T>\n  dest: Minipass<any, T>\n  opts: PipeOptions\n  ondrain: () => any\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    this.src = src\n    this.dest = dest as Minipass<any, T>\n    this.opts = opts\n    this.ondrain = () => src[RESUME]()\n    this.dest.on('drain', this.ondrain)\n  }\n  unpipe() {\n    this.dest.removeListener('drain', this.ondrain)\n  }\n  // only here for the prototype\n  /* c8 ignore start */\n  proxyErrors(_er: any) {}\n  /* c8 ignore stop */\n  end() {\n    this.unpipe()\n    if (this.opts.end) this.dest.end()\n  }\n}\n\n/**\n * Internal class representing a pipe to a destination stream where\n * errors are proxied.\n *\n * @internal\n */\nclass PipeProxyErrors<T> extends Pipe<T> {\n  unpipe() {\n    this.src.removeListener('error', this.proxyErrors)\n    super.unpipe()\n  }\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    super(src, dest, opts)\n    this.proxyErrors = (er: Error) => this.dest.emit('error', er)\n    src.on('error', this.proxyErrors)\n  }\n}\n\nexport namespace Minipass {\n  /**\n   * Encoding used to create a stream that outputs strings rather than\n   * Buffer objects.\n   */\n  export type Encoding = BufferEncoding | 'buffer' | null\n\n  /**\n   * Any stream that Minipass can pipe into\n   */\n  export type Writable =\n    | Minipass<any, any, any>\n    | NodeJS.WriteStream\n    | (NodeJS.WriteStream & { fd: number })\n    | (EventEmitter & {\n        end(): any\n        write(chunk: any, ...args: any[]): any\n      })\n\n  /**\n   * Any stream that can be read from\n   */\n  export type Readable =\n    | Minipass<any, any, any>\n    | NodeJS.ReadStream\n    | (NodeJS.ReadStream & { fd: number })\n    | (EventEmitter & {\n        pause(): any\n        resume(): any\n        pipe(...destArgs: any[]): any\n      })\n\n  /**\n   * Utility type that can be iterated sync or async\n   */\n  export type DualIterable<T> = Iterable<T> & AsyncIterable<T>\n\n  type EventArguments = Record<string | symbol, unknown[]>\n\n  /**\n   * The listing of events that a Minipass class can emit.\n   * Extend this when extending the Minipass class, and pass as\n   * the third template argument.  The key is the name of the event,\n   * and the value is the argument list.\n   *\n   * Any undeclared events will still be allowed, but the handler will get\n   * arguments as `unknown[]`.\n   */\n  export interface Events<RType extends any = Buffer>\n    extends EventArguments {\n    readable: []\n    data: [chunk: RType]\n    error: [er: unknown]\n    abort: [reason: unknown]\n    drain: []\n    resume: []\n    end: []\n    finish: []\n    prefinish: []\n    close: []\n    [DESTROYED]: [er?: unknown]\n    [ERROR]: [er: unknown]\n  }\n\n  /**\n   * String or buffer-like data that can be joined and sliced\n   */\n  export type ContiguousData =\n    | Buffer\n    | ArrayBufferLike\n    | ArrayBufferView\n    | string\n  export type BufferOrString = Buffer | string\n\n  /**\n   * Options passed to the Minipass constructor.\n   */\n  export type SharedOptions = {\n    /**\n     * Defer all data emission and other events until the end of the\n     * current tick, similar to Node core streams\n     */\n    async?: boolean\n    /**\n     * A signal which will abort the stream\n     */\n    signal?: AbortSignal\n    /**\n     * Output string encoding. Set to `null` or `'buffer'` (or omit) to\n     * emit Buffer objects rather than strings.\n     *\n     * Conflicts with `objectMode`\n     */\n    encoding?: BufferEncoding | null | 'buffer'\n    /**\n     * Output data exactly as it was written, supporting non-buffer/string\n     * data (such as arbitrary objects, falsey values, etc.)\n     *\n     * Conflicts with `encoding`\n     */\n    objectMode?: boolean\n  }\n\n  /**\n   * Options for a string encoded output\n   */\n  export type EncodingOptions = SharedOptions & {\n    encoding: BufferEncoding\n    objectMode?: false\n  }\n\n  /**\n   * Options for contiguous data buffer output\n   */\n  export type BufferOptions = SharedOptions & {\n    encoding?: null | 'buffer'\n    objectMode?: false\n  }\n\n  /**\n   * Options for objectMode arbitrary output\n   */\n  export type ObjectModeOptions = SharedOptions & {\n    objectMode: true\n    encoding?: null\n  }\n\n  /**\n   * Utility type to determine allowed options based on read type\n   */\n  export type Options<T> =\n    | ObjectModeOptions\n    | (T extends string\n        ? EncodingOptions\n        : T extends Buffer\n        ? BufferOptions\n        : SharedOptions)\n}\n\nconst isObjectModeOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.ObjectModeOptions => !!o.objectMode\n\nconst isEncodingOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.EncodingOptions =>\n  !o.objectMode && !!o.encoding && o.encoding !== 'buffer'\n\n/**\n * Main export, the Minipass class\n *\n * `RType` is the type of data emitted, defaults to Buffer\n *\n * `WType` is the type of data to be written, if RType is buffer or string,\n * then any {@link Minipass.ContiguousData} is allowed.\n *\n * `Events` is the set of event handler signatures that this object\n * will emit, see {@link Minipass.Events}\n */\nexport class Minipass<\n    RType extends unknown = Buffer,\n    WType extends unknown = RType extends Minipass.BufferOrString\n      ? Minipass.ContiguousData\n      : RType,\n    Events extends Minipass.Events<RType> = Minipass.Events<RType>\n  >\n  extends EventEmitter\n  implements Minipass.DualIterable<RType>\n{\n  [FLOWING]: boolean = false;\n  [PAUSED]: boolean = false;\n  [PIPES]: Pipe<RType>[] = [];\n  [BUFFER]: RType[] = [];\n  [OBJECTMODE]: boolean;\n  [ENCODING]: BufferEncoding | null;\n  [ASYNC]: boolean;\n  [DECODER]: SD | null;\n  [EOF]: boolean = false;\n  [EMITTED_END]: boolean = false;\n  [EMITTING_END]: boolean = false;\n  [CLOSED]: boolean = false;\n  [EMITTED_ERROR]: unknown = null;\n  [BUFFERLENGTH]: number = 0;\n  [DESTROYED]: boolean = false;\n  [SIGNAL]?: AbortSignal;\n  [ABORTED]: boolean = false;\n  [DATALISTENERS]: number = 0;\n  [DISCARDED]: boolean = false\n\n  /**\n   * true if the stream can be written\n   */\n  writable: boolean = true\n  /**\n   * true if the stream can be read\n   */\n  readable: boolean = true\n\n  /**\n   * If `RType` is Buffer, then options do not need to be provided.\n   * Otherwise, an options object must be provided to specify either\n   * {@link Minipass.SharedOptions.objectMode} or\n   * {@link Minipass.SharedOptions.encoding}, as appropriate.\n   */\n  constructor(\n    ...args:\n      | [Minipass.ObjectModeOptions]\n      | (RType extends Buffer\n          ? [] | [Minipass.Options<RType>]\n          : [Minipass.Options<RType>])\n  ) {\n    const options: Minipass.Options<RType> = (args[0] ||\n      {}) as Minipass.Options<RType>\n    super()\n    if (options.objectMode && typeof options.encoding === 'string') {\n      throw new TypeError(\n        'Encoding and objectMode may not be used together'\n      )\n    }\n    if (isObjectModeOptions(options)) {\n      this[OBJECTMODE] = true\n      this[ENCODING] = null\n    } else if (isEncodingOptions(options)) {\n      this[ENCODING] = options.encoding\n      this[OBJECTMODE] = false\n    } else {\n      this[OBJECTMODE] = false\n      this[ENCODING] = null\n    }\n    this[ASYNC] = !!options.async\n    this[DECODER] = this[ENCODING]\n      ? (new StringDecoder(this[ENCODING]) as SD)\n      : null\n\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposeBuffer === true) {\n      Object.defineProperty(this, 'buffer', { get: () => this[BUFFER] })\n    }\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposePipes === true) {\n      Object.defineProperty(this, 'pipes', { get: () => this[PIPES] })\n    }\n\n    const { signal } = options\n    if (signal) {\n      this[SIGNAL] = signal\n      if (signal.aborted) {\n        this[ABORT]()\n      } else {\n        signal.addEventListener('abort', () => this[ABORT]())\n      }\n    }\n  }\n\n  /**\n   * The amount of data stored in the buffer waiting to be read.\n   *\n   * For Buffer strings, this will be the total byte length.\n   * For string encoding streams, this will be the string character length,\n   * according to JavaScript's `string.length` logic.\n   * For objectMode streams, this is a count of the items waiting to be\n   * emitted.\n   */\n  get bufferLength() {\n    return this[BUFFERLENGTH]\n  }\n\n  /**\n   * The `BufferEncoding` currently in use, or `null`\n   */\n  get encoding() {\n    return this[ENCODING]\n  }\n\n  /**\n   * @deprecated - This is a read only property\n   */\n  set encoding(_enc) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * @deprecated - Encoding may only be set at instantiation time\n   */\n  setEncoding(_enc: Minipass.Encoding) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * True if this is an objectMode stream\n   */\n  get objectMode() {\n    return this[OBJECTMODE]\n  }\n\n  /**\n   * @deprecated - This is a read-only property\n   */\n  set objectMode(_om) {\n    throw new Error('objectMode must be set at instantiation time')\n  }\n\n  /**\n   * true if this is an async stream\n   */\n  get ['async'](): boolean {\n    return this[ASYNC]\n  }\n  /**\n   * Set to true to make this stream async.\n   *\n   * Once set, it cannot be unset, as this would potentially cause incorrect\n   * behavior.  Ie, a sync stream can be made async, but an async stream\n   * cannot be safely made sync.\n   */\n  set ['async'](a: boolean) {\n    this[ASYNC] = this[ASYNC] || !!a\n  }\n\n  // drop everything and get out of the flow completely\n  [ABORT]() {\n    this[ABORTED] = true\n    this.emit('abort', this[SIGNAL]?.reason)\n    this.destroy(this[SIGNAL]?.reason)\n  }\n\n  /**\n   * True if the stream has been aborted.\n   */\n  get aborted() {\n    return this[ABORTED]\n  }\n  /**\n   * No-op setter. Stream aborted status is set via the AbortSignal provided\n   * in the constructor options.\n   */\n  set aborted(_) {}\n\n  /**\n   * Write data into the stream\n   *\n   * If the chunk written is a string, and encoding is not specified, then\n   * `utf8` will be assumed. If the stream encoding matches the encoding of\n   * a written string, and the state of the string decoder allows it, then\n   * the string will be passed through to either the output or the internal\n   * buffer without any processing. Otherwise, it will be turned into a\n   * Buffer object for processing into the desired encoding.\n   *\n   * If provided, `cb` function is called immediately before return for\n   * sync streams, or on next tick for async streams, because for this\n   * base class, a chunk is considered \"processed\" once it is accepted\n   * and either emitted or buffered. That is, the callback does not indicate\n   * that the chunk has been eventually emitted, though of course child\n   * classes can override this function to do whatever processing is required\n   * and call `super.write(...)` only once processing is completed.\n   */\n  write(chunk: WType, cb?: () => void): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding,\n    cb?: () => void\n  ): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): boolean {\n    if (this[ABORTED]) return false\n    if (this[EOF]) throw new Error('write after end')\n\n    if (this[DESTROYED]) {\n      this.emit(\n        'error',\n        Object.assign(\n          new Error('Cannot call write after a stream was destroyed'),\n          { code: 'ERR_STREAM_DESTROYED' }\n        )\n      )\n      return true\n    }\n\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n\n    if (!encoding) encoding = 'utf8'\n\n    const fn = this[ASYNC] ? defer : nodefer\n\n    // convert array buffers and typed array views into buffers\n    // at some point in the future, we may want to do the opposite!\n    // leave strings and buffers as-is\n    // anything is only allowed if in object mode, so throw\n    if (!this[OBJECTMODE] && !Buffer.isBuffer(chunk)) {\n      if (isArrayBufferView(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(\n          chunk.buffer,\n          chunk.byteOffset,\n          chunk.byteLength\n        )\n      } else if (isArrayBufferLike(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(chunk)\n      } else if (typeof chunk !== 'string') {\n        throw new Error(\n          'Non-contiguous data written to non-objectMode stream'\n        )\n      }\n    }\n\n    // handle object mode up front, since it's simpler\n    // this yields better performance, fewer checks later.\n    if (this[OBJECTMODE]) {\n      // maybe impossible?\n      /* c8 ignore start */\n      if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n      /* c8 ignore stop */\n\n      if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n      else this[BUFFERPUSH](chunk as unknown as RType)\n\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n      if (cb) fn(cb)\n\n      return this[FLOWING]\n    }\n\n    // at this point the chunk is a buffer or string\n    // don't buffer it up or send it to the decoder\n    if (!(chunk as Minipass.BufferOrString).length) {\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n      if (cb) fn(cb)\n      return this[FLOWING]\n    }\n\n    // fast-path writing strings of same encoding to a stream with\n    // an empty buffer, skipping the buffer/decoder dance\n    if (\n      typeof chunk === 'string' &&\n      // unless it is a string already ready for us to use\n      !(encoding === this[ENCODING] && !this[DECODER]?.lastNeed)\n    ) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = Buffer.from(chunk, encoding)\n    }\n\n    if (Buffer.isBuffer(chunk) && this[ENCODING]) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = this[DECODER].write(chunk)\n    }\n\n    // Note: flushing CAN potentially switch us into not-flowing mode\n    if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n\n    if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n    else this[BUFFERPUSH](chunk as unknown as RType)\n\n    if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n    if (cb) fn(cb)\n\n    return this[FLOWING]\n  }\n\n  /**\n   * Low-level explicit read method.\n   *\n   * In objectMode, the argument is ignored, and one item is returned if\n   * available.\n   *\n   * `n` is the number of bytes (or in the case of encoding streams,\n   * characters) to consume. If `n` is not provided, then the entire buffer\n   * is returned, or `null` is returned if no data is available.\n   *\n   * If `n` is greater that the amount of data in the internal buffer,\n   * then `null` is returned.\n   */\n  read(n?: number | null): RType | null {\n    if (this[DESTROYED]) return null\n    this[DISCARDED] = false\n\n    if (\n      this[BUFFERLENGTH] === 0 ||\n      n === 0 ||\n      (n && n > this[BUFFERLENGTH])\n    ) {\n      this[MAYBE_EMIT_END]()\n      return null\n    }\n\n    if (this[OBJECTMODE]) n = null\n\n    if (this[BUFFER].length > 1 && !this[OBJECTMODE]) {\n      // not object mode, so if we have an encoding, then RType is string\n      // otherwise, must be Buffer\n      this[BUFFER] = [\n        (this[ENCODING]\n          ? this[BUFFER].join('')\n          : Buffer.concat(\n              this[BUFFER] as Buffer[],\n              this[BUFFERLENGTH]\n            )) as RType,\n      ]\n    }\n\n    const ret = this[READ](n || null, this[BUFFER][0] as RType)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [READ](n: number | null, chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERSHIFT]()\n    else {\n      const c = chunk as Minipass.BufferOrString\n      if (n === c.length || n === null) this[BUFFERSHIFT]()\n      else if (typeof c === 'string') {\n        this[BUFFER][0] = c.slice(n) as RType\n        chunk = c.slice(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      } else {\n        this[BUFFER][0] = c.subarray(n) as RType\n        chunk = c.subarray(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      }\n    }\n\n    this.emit('data', chunk)\n\n    if (!this[BUFFER].length && !this[EOF]) this.emit('drain')\n\n    return chunk\n  }\n\n  /**\n   * End the stream, optionally providing a final write.\n   *\n   * See {@link Minipass#write} for argument descriptions\n   */\n  end(cb?: () => void): this\n  end(chunk: WType, cb?: () => void): this\n  end(chunk: WType, encoding?: Minipass.Encoding, cb?: () => void): this\n  end(\n    chunk?: WType | (() => void),\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): this {\n    if (typeof chunk === 'function') {\n      cb = chunk as () => void\n      chunk = undefined\n    }\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n    if (chunk !== undefined) this.write(chunk, encoding)\n    if (cb) this.once('end', cb)\n    this[EOF] = true\n    this.writable = false\n\n    // if we haven't written anything, then go ahead and emit,\n    // even if we're not reading.\n    // we'll re-emit if a new 'end' listener is added anyway.\n    // This makes MP more suitable to write-only use cases.\n    if (this[FLOWING] || !this[PAUSED]) this[MAYBE_EMIT_END]()\n    return this\n  }\n\n  // don't let the internal resume be overwritten\n  [RESUME]() {\n    if (this[DESTROYED]) return\n\n    if (!this[DATALISTENERS] && !this[PIPES].length) {\n      this[DISCARDED] = true\n    }\n    this[PAUSED] = false\n    this[FLOWING] = true\n    this.emit('resume')\n    if (this[BUFFER].length) this[FLUSH]()\n    else if (this[EOF]) this[MAYBE_EMIT_END]()\n    else this.emit('drain')\n  }\n\n  /**\n   * Resume the stream if it is currently in a paused state\n   *\n   * If called when there are no pipe destinations or `data` event listeners,\n   * this will place the stream in a \"discarded\" state, where all data will\n   * be thrown away. The discarded state is removed if a pipe destination or\n   * data handler is added, if pause() is called, or if any synchronous or\n   * asynchronous iteration is started.\n   */\n  resume() {\n    return this[RESUME]()\n  }\n\n  /**\n   * Pause the stream\n   */\n  pause() {\n    this[FLOWING] = false\n    this[PAUSED] = true\n    this[DISCARDED] = false\n  }\n\n  /**\n   * true if the stream has been forcibly destroyed\n   */\n  get destroyed() {\n    return this[DESTROYED]\n  }\n\n  /**\n   * true if the stream is currently in a flowing state, meaning that\n   * any writes will be immediately emitted.\n   */\n  get flowing() {\n    return this[FLOWING]\n  }\n\n  /**\n   * true if the stream is currently in a paused state\n   */\n  get paused() {\n    return this[PAUSED]\n  }\n\n  [BUFFERPUSH](chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] += 1\n    else this[BUFFERLENGTH] += (chunk as Minipass.BufferOrString).length\n    this[BUFFER].push(chunk)\n  }\n\n  [BUFFERSHIFT](): RType {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] -= 1\n    else\n      this[BUFFERLENGTH] -= (\n        this[BUFFER][0] as Minipass.BufferOrString\n      ).length\n    return this[BUFFER].shift() as RType\n  }\n\n  [FLUSH](noDrain: boolean = false) {\n    do {} while (\n      this[FLUSHCHUNK](this[BUFFERSHIFT]()) &&\n      this[BUFFER].length\n    )\n\n    if (!noDrain && !this[BUFFER].length && !this[EOF]) this.emit('drain')\n  }\n\n  [FLUSHCHUNK](chunk: RType) {\n    this.emit('data', chunk)\n    return this[FLOWING]\n  }\n\n  /**\n   * Pipe all data emitted by this stream into the destination provided.\n   *\n   * Triggers the flow of data.\n   */\n  pipe<W extends Minipass.Writable>(dest: W, opts?: PipeOptions): W {\n    if (this[DESTROYED]) return dest\n    this[DISCARDED] = false\n\n    const ended = this[EMITTED_END]\n    opts = opts || {}\n    if (dest === proc.stdout || dest === proc.stderr) opts.end = false\n    else opts.end = opts.end !== false\n    opts.proxyErrors = !!opts.proxyErrors\n\n    // piping an ended stream ends immediately\n    if (ended) {\n      if (opts.end) dest.end()\n    } else {\n      // \"as\" here just ignores the WType, which pipes don't care about,\n      // since they're only consuming from us, and writing to the dest\n      this[PIPES].push(\n        !opts.proxyErrors\n          ? new Pipe<RType>(this as Minipass<RType>, dest, opts)\n          : new PipeProxyErrors<RType>(this as Minipass<RType>, dest, opts)\n      )\n      if (this[ASYNC]) defer(() => this[RESUME]())\n      else this[RESUME]()\n    }\n\n    return dest\n  }\n\n  /**\n   * Fully unhook a piped destination stream.\n   *\n   * If the destination stream was the only consumer of this stream (ie,\n   * there are no other piped destinations or `'data'` event listeners)\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  unpipe<W extends Minipass.Writable>(dest: W) {\n    const p = this[PIPES].find(p => p.dest === dest)\n    if (p) {\n      if (this[PIPES].length === 1) {\n        if (this[FLOWING] && this[DATALISTENERS] === 0) {\n          this[FLOWING] = false\n        }\n        this[PIPES] = []\n      } else this[PIPES].splice(this[PIPES].indexOf(p), 1)\n      p.unpipe()\n    }\n  }\n\n  /**\n   * Alias for {@link Minipass#on}\n   */\n  addListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    return this.on(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.on`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * - Adding a 'data' event handler will trigger the flow of data\n   *\n   * - Adding a 'readable' event handler when there is data waiting to be read\n   *   will cause 'readable' to be emitted immediately.\n   *\n   * - Adding an 'endish' event handler ('end', 'finish', etc.) which has\n   *   already passed will cause the event to be emitted immediately and all\n   *   handlers removed.\n   *\n   * - Adding an 'error' event handler after an error has been emitted will\n   *   cause the event to be re-emitted immediately with the error previously\n   *   raised.\n   */\n  on<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    const ret = super.on(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    if (ev === 'data') {\n      this[DISCARDED] = false\n      this[DATALISTENERS]++\n      if (!this[PIPES].length && !this[FLOWING]) {\n        this[RESUME]()\n      }\n    } else if (ev === 'readable' && this[BUFFERLENGTH] !== 0) {\n      super.emit('readable')\n    } else if (isEndish(ev) && this[EMITTED_END]) {\n      super.emit(ev)\n      this.removeAllListeners(ev)\n    } else if (ev === 'error' && this[EMITTED_ERROR]) {\n      const h = handler as (...a: Events['error']) => any\n      if (this[ASYNC]) defer(() => h.call(this, this[EMITTED_ERROR]))\n      else h.call(this, this[EMITTED_ERROR])\n    }\n    return ret\n  }\n\n  /**\n   * Alias for {@link Minipass#off}\n   */\n  removeListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    return this.off(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.off`\n   *\n   * If a 'data' event handler is removed, and it was the last consumer\n   * (ie, there are no pipe destinations or other 'data' event listeners),\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  off<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    const ret = super.off(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    // if we previously had listeners, and now we don't, and we don't\n    // have any pipes, then stop the flow, unless it's been explicitly\n    // put in a discarded flowing state via stream.resume().\n    if (ev === 'data') {\n      this[DATALISTENERS] = this.listeners('data').length\n      if (\n        this[DATALISTENERS] === 0 &&\n        !this[DISCARDED] &&\n        !this[PIPES].length\n      ) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.removeAllListeners`\n   *\n   * If all 'data' event handlers are removed, and they were the last consumer\n   * (ie, there are no pipe destinations), then the flow of data will stop\n   * until there is another consumer or {@link Minipass#resume} is explicitly\n   * called.\n   */\n  removeAllListeners<Event extends keyof Events>(ev?: Event) {\n    const ret = super.removeAllListeners(ev as string | symbol | undefined)\n    if (ev === 'data' || ev === undefined) {\n      this[DATALISTENERS] = 0\n      if (!this[DISCARDED] && !this[PIPES].length) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * true if the 'end' event has been emitted\n   */\n  get emittedEnd() {\n    return this[EMITTED_END]\n  }\n\n  [MAYBE_EMIT_END]() {\n    if (\n      !this[EMITTING_END] &&\n      !this[EMITTED_END] &&\n      !this[DESTROYED] &&\n      this[BUFFER].length === 0 &&\n      this[EOF]\n    ) {\n      this[EMITTING_END] = true\n      this.emit('end')\n      this.emit('prefinish')\n      this.emit('finish')\n      if (this[CLOSED]) this.emit('close')\n      this[EMITTING_END] = false\n    }\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.emit`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * If the stream has been destroyed, and the event is something other\n   * than 'close' or 'error', then `false` is returned and no handlers\n   * are called.\n   *\n   * If the event is 'end', and has already been emitted, then the event\n   * is ignored. If the stream is in a paused or non-flowing state, then\n   * the event will be deferred until data flow resumes. If the stream is\n   * async, then handlers will be called on the next tick rather than\n   * immediately.\n   *\n   * If the event is 'close', and 'end' has not yet been emitted, then\n   * the event will be deferred until after 'end' is emitted.\n   *\n   * If the event is 'error', and an AbortSignal was provided for the stream,\n   * and there are no listeners, then the event is ignored, matching the\n   * behavior of node core streams in the presense of an AbortSignal.\n   *\n   * If the event is 'finish' or 'prefinish', then all listeners will be\n   * removed after emitting the event, to prevent double-firing.\n   */\n  emit<Event extends keyof Events>(\n    ev: Event,\n    ...args: Events[Event]\n  ): boolean {\n    const data = args[0]\n    // error and close are only events allowed after calling destroy()\n    if (\n      ev !== 'error' &&\n      ev !== 'close' &&\n      ev !== DESTROYED &&\n      this[DESTROYED]\n    ) {\n      return false\n    } else if (ev === 'data') {\n      return !this[OBJECTMODE] && !data\n        ? false\n        : this[ASYNC]\n        ? (defer(() => this[EMITDATA](data as RType)), true)\n        : this[EMITDATA](data as RType)\n    } else if (ev === 'end') {\n      return this[EMITEND]()\n    } else if (ev === 'close') {\n      this[CLOSED] = true\n      // don't emit close before 'end' and 'finish'\n      if (!this[EMITTED_END] && !this[DESTROYED]) return false\n      const ret = super.emit('close')\n      this.removeAllListeners('close')\n      return ret\n    } else if (ev === 'error') {\n      this[EMITTED_ERROR] = data\n      super.emit(ERROR, data)\n      const ret =\n        !this[SIGNAL] || this.listeners('error').length\n          ? super.emit('error', data)\n          : false\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'resume') {\n      const ret = super.emit('resume')\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'finish' || ev === 'prefinish') {\n      const ret = super.emit(ev)\n      this.removeAllListeners(ev)\n      return ret\n    }\n\n    // Some other unknown event\n    const ret = super.emit(ev as string, ...args)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITDATA](data: RType) {\n    for (const p of this[PIPES]) {\n      if (p.dest.write(data as RType) === false) this.pause()\n    }\n    const ret = this[DISCARDED] ? false : super.emit('data', data)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITEND]() {\n    if (this[EMITTED_END]) return false\n\n    this[EMITTED_END] = true\n    this.readable = false\n    return this[ASYNC]\n      ? (defer(() => this[EMITEND2]()), true)\n      : this[EMITEND2]()\n  }\n\n  [EMITEND2]() {\n    if (this[DECODER]) {\n      const data = this[DECODER].end()\n      if (data) {\n        for (const p of this[PIPES]) {\n          p.dest.write(data as RType)\n        }\n        if (!this[DISCARDED]) super.emit('data', data)\n      }\n    }\n\n    for (const p of this[PIPES]) {\n      p.end()\n    }\n    const ret = super.emit('end')\n    this.removeAllListeners('end')\n    return ret\n  }\n\n  /**\n   * Return a Promise that resolves to an array of all emitted data once\n   * the stream ends.\n   */\n  async collect(): Promise<RType[] & { dataLength: number }> {\n    const buf: RType[] & { dataLength: number } = Object.assign([], {\n      dataLength: 0,\n    })\n    if (!this[OBJECTMODE]) buf.dataLength = 0\n    // set the promise first, in case an error is raised\n    // by triggering the flow here.\n    const p = this.promise()\n    this.on('data', c => {\n      buf.push(c)\n      if (!this[OBJECTMODE])\n        buf.dataLength += (c as Minipass.BufferOrString).length\n    })\n    await p\n    return buf\n  }\n\n  /**\n   * Return a Promise that resolves to the concatenation of all emitted data\n   * once the stream ends.\n   *\n   * Not allowed on objectMode streams.\n   */\n  async concat(): Promise<RType> {\n    if (this[OBJECTMODE]) {\n      throw new Error('cannot concat in objectMode')\n    }\n    const buf = await this.collect()\n    return (\n      this[ENCODING]\n        ? buf.join('')\n        : Buffer.concat(buf as Buffer[], buf.dataLength)\n    ) as RType\n  }\n\n  /**\n   * Return a void Promise that resolves once the stream ends.\n   */\n  async promise(): Promise<void> {\n    return new Promise<void>((resolve, reject) => {\n      this.on(DESTROYED, () => reject(new Error('stream destroyed')))\n      this.on('error', er => reject(er))\n      this.on('end', () => resolve())\n    })\n  }\n\n  /**\n   * Asynchronous `for await of` iteration.\n   *\n   * This will continue emitting all chunks until the stream terminates.\n   */\n  [Symbol.asyncIterator](): AsyncGenerator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = async (): Promise<IteratorReturnResult<void>> => {\n      this.pause()\n      stopped = true\n      return { value: undefined, done: true }\n    }\n    const next = (): Promise<IteratorResult<RType, void>> => {\n      if (stopped) return stop()\n      const res = this.read()\n      if (res !== null) return Promise.resolve({ done: false, value: res })\n\n      if (this[EOF]) return stop()\n\n      let resolve!: (res: IteratorResult<RType>) => void\n      let reject!: (er: unknown) => void\n      const onerr = (er: unknown) => {\n        this.off('data', ondata)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        reject(er)\n      }\n      const ondata = (value: RType) => {\n        this.off('error', onerr)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        this.pause()\n        resolve({ value, done: !!this[EOF] })\n      }\n      const onend = () => {\n        this.off('error', onerr)\n        this.off('data', ondata)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        resolve({ done: true, value: undefined })\n      }\n      const ondestroy = () => onerr(new Error('stream destroyed'))\n      return new Promise<IteratorResult<RType>>((res, rej) => {\n        reject = rej\n        resolve = res\n        this.once(DESTROYED, ondestroy)\n        this.once('error', onerr)\n        this.once('end', onend)\n        this.once('data', ondata)\n      })\n    }\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.asyncIterator]() {\n        return this\n      },\n      [Symbol.asyncDispose]: async () => {},\n    }\n  }\n\n  /**\n   * Synchronous `for of` iteration.\n   *\n   * The iteration will terminate when the internal buffer runs out, even\n   * if the stream has not yet terminated.\n   */\n  [Symbol.iterator](): Generator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = (): IteratorReturnResult<void> => {\n      this.pause()\n      this.off(ERROR, stop)\n      this.off(DESTROYED, stop)\n      this.off('end', stop)\n      stopped = true\n      return { done: true, value: undefined }\n    }\n\n    const next = (): IteratorResult<RType, void> => {\n      if (stopped) return stop()\n      const value = this.read()\n      return value === null ? stop() : { done: false, value }\n    }\n\n    this.once('end', stop)\n    this.once(ERROR, stop)\n    this.once(DESTROYED, stop)\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.iterator]() {\n        return this\n      },\n      [Symbol.dispose]: () => {},\n    }\n  }\n\n  /**\n   * Destroy a stream, preventing it from being used for any further purpose.\n   *\n   * If the stream has a `close()` method, then it will be called on\n   * destruction.\n   *\n   * After destruction, any attempt to write data, read data, or emit most\n   * events will be ignored.\n   *\n   * If an error argument is provided, then it will be emitted in an\n   * 'error' event.\n   */\n  destroy(er?: unknown) {\n    if (this[DESTROYED]) {\n      if (er) this.emit('error', er)\n      else this.emit(DESTROYED)\n      return this\n    }\n\n    this[DESTROYED] = true\n    this[DISCARDED] = true\n\n    // throw away all buffered data, it's never coming out\n    this[BUFFER].length = 0\n    this[BUFFERLENGTH] = 0\n\n    const wc = this as Minipass<RType, WType, Events> & {\n      close?: () => void\n    }\n    if (typeof wc.close === 'function' && !this[CLOSED]) wc.close()\n\n    if (er) this.emit('error', er)\n    // if no error to emit, still reject pending promises\n    else this.emit(DESTROYED)\n\n    return this\n  }\n\n  /**\n   * Alias for {@link isStream}\n   *\n   * Former export location, maintained for backwards compatibility.\n   *\n   * @deprecated\n   */\n  static get isStream() {\n    return isStream\n  }\n}\n", "// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[],\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\nconst customInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform,\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  [customInspect]() {\n    return 'Pattern <' + this.#globList.slice(this.#index).join('/') + '>'\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index] as MMPattern\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0 ?\n        this.isAbsolute() ?\n          this.#globList[0] + this.#globList.slice(1).join('/')\n        : this.#globList.join('/')\n      : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform,\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined ?\n        this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined ?\n        this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined ?\n        this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return (\n        typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ) ?\n        p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n", "// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n  add?: (ignore: string) => void\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n  platform: NodeJS.Platform\n  mmopts: MinimatchOptions\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts,\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    this.platform = platform\n    this.mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n    for (const ign of ignored) this.add(ign)\n  }\n\n  add(ign: string) {\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    const mm = new Minimatch(ign, this.mmopts)\n    for (let i = 0; i < mm.set.length; i++) {\n      const parsed = mm.set[i]\n      const globParts = mm.globParts[i]\n      /* c8 ignore start */\n      if (!parsed || !globParts) {\n        throw new Error('invalid pattern object')\n      }\n      // strip off leading ./ portions\n      // https://github.com/isaacs/node-glob/issues/570\n      while (parsed[0] === '.' && globParts[0] === '.') {\n        parsed.shift()\n        globParts.shift()\n      }\n      /* c8 ignore stop */\n      const p = new Pattern(parsed, globParts, 0, this.platform)\n      const m = new Minimatch(p.globString(), this.mmopts)\n      const children = globParts[globParts.length - 1] === '**'\n      const absolute = p.isAbsolute()\n      if (absolute) this.absolute.push(m)\n      else this.relative.push(m)\n      if (children) {\n        if (absolute) this.absoluteChildren.push(m)\n        else this.relativeChildren.push(m)\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) return true\n    }\n    return false\n  }\n}\n", "// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache =\n      hasWalkedCache ? hasWalkedCache.copy() : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined ?\n            this.opts.root\n          : root,\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must not be final entry, otherwise we would have\n        // concatenated it earlier.\n        const ifDir = p === '..' || p === '' || p === '.'\n        this.matches.add(t.resolve(p), absolute, ifDir)\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n", "/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport { Ignore, IgnoreLike } from './ignore.js'\n\n// XXX can we somehow make it so that it NEVER processes a given path more than\n// once, enough that the match set tracking is no longer needed?  that'd speed\n// things up a lot.  Or maybe bring back nounique, and skip it in that case?\n\n// a single minimatch set entry with 1 or more parts\nimport { Pattern } from './pattern.js'\nimport { Processor } from './processor.js'\n\nexport interface GlobWalkerOpts {\n  absolute?: boolean\n  allowWindowsEscape?: boolean\n  cwd?: string | URL\n  dot?: boolean\n  dotRelative?: boolean\n  follow?: boolean\n  ignore?: string | string[] | IgnoreLike\n  mark?: boolean\n  matchBase?: boolean\n  // Note: maxDepth here means \"maximum actual Path.depth()\",\n  // not \"maximum depth beyond cwd\"\n  maxDepth?: number\n  nobrace?: boolean\n  nocase?: boolean\n  nodir?: boolean\n  noext?: boolean\n  noglobstar?: boolean\n  platform?: NodeJS.Platform\n  posix?: boolean\n  realpath?: boolean\n  root?: string\n  stat?: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape?: boolean\n  withFileTypes?: boolean\n  includeChildMatches?: boolean\n}\n\nexport type GWOFileTypesTrue = GlobWalkerOpts & {\n  withFileTypes: true\n}\nexport type GWOFileTypesFalse = GlobWalkerOpts & {\n  withFileTypes: false\n}\nexport type GWOFileTypesUnset = GlobWalkerOpts & {\n  withFileTypes?: undefined\n}\n\nexport type Result<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Path\n  : O extends GWOFileTypesFalse ? string\n  : O extends GWOFileTypesUnset ? string\n  : Path | string\n\nexport type Matches<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Set<Path>\n  : O extends GWOFileTypesFalse ? Set<string>\n  : O extends GWOFileTypesUnset ? Set<string>\n  : Set<Path | string>\n\nexport type MatchStream<O extends GlobWalkerOpts> = Minipass<\n  Result<O>,\n  Result<O>\n>\n\nconst makeIgnore = (\n  ignore: string | string[] | IgnoreLike,\n  opts: GlobWalkerOpts,\n): IgnoreLike =>\n  typeof ignore === 'string' ? new Ignore([ignore], opts)\n  : Array.isArray(ignore) ? new Ignore(ignore, opts)\n  : ignore\n\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport abstract class GlobUtil<O extends GlobWalkerOpts = GlobWalkerOpts> {\n  path: Path\n  patterns: Pattern[]\n  opts: O\n  seen: Set<Path> = new Set<Path>()\n  paused: boolean = false\n  aborted: boolean = false\n  #onResume: (() => any)[] = []\n  #ignore?: IgnoreLike\n  #sep: '\\\\' | '/'\n  signal?: AbortSignal\n  maxDepth: number\n  includeChildMatches: boolean\n\n  constructor(patterns: Pattern[], path: Path, opts: O)\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    this.patterns = patterns\n    this.path = path\n    this.opts = opts\n    this.#sep = !opts.posix && opts.platform === 'win32' ? '\\\\' : '/'\n    this.includeChildMatches = opts.includeChildMatches !== false\n    if (opts.ignore || !this.includeChildMatches) {\n      this.#ignore = makeIgnore(opts.ignore ?? [], opts)\n      if (\n        !this.includeChildMatches &&\n        typeof this.#ignore.add !== 'function'\n      ) {\n        const m = 'cannot ignore child matches, ignore lacks add() method.'\n        throw new Error(m)\n      }\n    }\n    // ignore, always set with maxDepth, but it's optional on the\n    // GlobOptions type\n    /* c8 ignore start */\n    this.maxDepth = opts.maxDepth || Infinity\n    /* c8 ignore stop */\n    if (opts.signal) {\n      this.signal = opts.signal\n      this.signal.addEventListener('abort', () => {\n        this.#onResume.length = 0\n      })\n    }\n  }\n\n  #ignored(path: Path): boolean {\n    return this.seen.has(path) || !!this.#ignore?.ignored?.(path)\n  }\n  #childrenIgnored(path: Path): boolean {\n    return !!this.#ignore?.childrenIgnored?.(path)\n  }\n\n  // backpressure mechanism\n  pause() {\n    this.paused = true\n  }\n  resume() {\n    /* c8 ignore start */\n    if (this.signal?.aborted) return\n    /* c8 ignore stop */\n    this.paused = false\n    let fn: (() => any) | undefined = undefined\n    while (!this.paused && (fn = this.#onResume.shift())) {\n      fn()\n    }\n  }\n  onResume(fn: () => any) {\n    if (this.signal?.aborted) return\n    /* c8 ignore start */\n    if (!this.paused) {\n      fn()\n    } else {\n      /* c8 ignore stop */\n      this.#onResume.push(fn)\n    }\n  }\n\n  // do the requisite realpath/stat checking, and return the path\n  // to add or undefined to filter it out.\n  async matchCheck(e: Path, ifDir: boolean): Promise<Path | undefined> {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || (await e.realpath())\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? await e.lstat() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = await s.realpath()\n      /* c8 ignore start */\n      if (target && (target.isUnknown() || this.opts.stat)) {\n        await target.lstat()\n      }\n      /* c8 ignore stop */\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  matchCheckTest(e: Path | undefined, ifDir: boolean): Path | undefined {\n    return (\n        e &&\n          (this.maxDepth === Infinity || e.depth() <= this.maxDepth) &&\n          (!ifDir || e.canReaddir()) &&\n          (!this.opts.nodir || !e.isDirectory()) &&\n          (!this.opts.nodir ||\n            !this.opts.follow ||\n            !e.isSymbolicLink() ||\n            !e.realpathCached()?.isDirectory()) &&\n          !this.#ignored(e)\n      ) ?\n        e\n      : undefined\n  }\n\n  matchCheckSync(e: Path, ifDir: boolean): Path | undefined {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || e.realpathSync()\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? e.lstatSync() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = s.realpathSync()\n      if (target && (target?.isUnknown() || this.opts.stat)) {\n        target.lstatSync()\n      }\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  abstract matchEmit(p: Result<O>): void\n  abstract matchEmit(p: string | Path): void\n\n  matchFinish(e: Path, absolute: boolean) {\n    if (this.#ignored(e)) return\n    // we know we have an ignore if this is false, but TS doesn't\n    if (!this.includeChildMatches && this.#ignore?.add) {\n      const ign = `${e.relativePosix()}/**`\n      this.#ignore.add(ign)\n    }\n    const abs =\n      this.opts.absolute === undefined ? absolute : this.opts.absolute\n    this.seen.add(e)\n    const mark = this.opts.mark && e.isDirectory() ? this.#sep : ''\n    // ok, we have what we need!\n    if (this.opts.withFileTypes) {\n      this.matchEmit(e)\n    } else if (abs) {\n      const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath()\n      this.matchEmit(abs + mark)\n    } else {\n      const rel = this.opts.posix ? e.relativePosix() : e.relative()\n      const pre =\n        this.opts.dotRelative && !rel.startsWith('..' + this.#sep) ?\n          '.' + this.#sep\n        : ''\n      this.matchEmit(!rel ? '.' + mark : pre + rel + mark)\n    }\n  }\n\n  async match(e: Path, absolute: boolean, ifDir: boolean): Promise<void> {\n    const p = await this.matchCheck(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  matchSync(e: Path, absolute: boolean, ifDir: boolean): void {\n    const p = this.matchCheckSync(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  walkCB(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() => this.walkCB2(target, patterns, processor, cb))\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const childrenCached = t.readdirCached()\n      if (t.calledReaddir())\n        this.walkCB3(t, childrenCached, processor, next)\n      else {\n        t.readdirCB(\n          (_, entries) => this.walkCB3(t, entries, processor, next),\n          true,\n        )\n      }\n    }\n\n    next()\n  }\n\n  walkCB3(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n\n  walkCBSync(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2Sync(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2Sync(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() =>\n        this.walkCB2Sync(target, patterns, processor, cb),\n      )\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const children = t.readdirSync()\n      this.walkCB3Sync(t, children, processor, next)\n    }\n\n    next()\n  }\n\n  walkCB3Sync(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2Sync(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n}\n\nexport class GlobWalker<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  matches = new Set<Result<O>>()\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.matches.add(e)\n  }\n\n  async walk(): Promise<Set<Result<O>>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      await this.path.lstat()\n    }\n    await new Promise((res, rej) => {\n      this.walkCB(this.path, this.patterns, () => {\n        if (this.signal?.aborted) {\n          rej(this.signal.reason)\n        } else {\n          res(this.matches)\n        }\n      })\n    })\n    return this.matches\n  }\n\n  walkSync(): Set<Result<O>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    // nothing for the callback to do, because this never pauses\n    this.walkCBSync(this.path, this.patterns, () => {\n      if (this.signal?.aborted) throw this.signal.reason\n    })\n    return this.matches\n  }\n}\n\nexport class GlobStream<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  results: Minipass<Result<O>, Result<O>>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.results = new Minipass<Result<O>, Result<O>>({\n      signal: this.signal,\n      objectMode: true,\n    })\n    this.results.on('drain', () => this.resume())\n    this.results.on('resume', () => this.resume())\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.results.write(e)\n    if (!this.results.flowing) this.pause()\n  }\n\n  stream(): MatchStream<O> {\n    const target = this.path\n    if (target.isUnknown()) {\n      target.lstat().then(() => {\n        this.walkCB(target, this.patterns, () => this.results.end())\n      })\n    } else {\n      this.walkCB(target, this.patterns, () => this.results.end())\n    }\n    return this.results\n  }\n\n  streamSync(): MatchStream<O> {\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    this.walkCBSync(this.path, this.patterns, () => this.results.end())\n    return this.results\n  }\n}\n", "import { Minimatch } from 'minimatch'\nimport { GlobOptions } from './glob.js'\n\n/**\n * Return true if the patterns provided contain any magic glob characters,\n * given the options provided.\n *\n * Brace expansion is not considered \"magic\" unless the `magicalBraces` option\n * is set, as brace expansion just turns one string into an array of strings.\n * So a pattern like `'x{a,b}y'` would return `false`, because `'xay'` and\n * `'xby'` both do not contain any magic glob characters, and it's treated the\n * same as if you had called it on `['xay', 'xby']`. When `magicalBraces:true`\n * is in the options, brace expansion _is_ treated as a pattern having magic.\n */\nexport const hasMagic = (\n  pattern: string | string[],\n  options: GlobOptions = {},\n): boolean => {\n  if (!Array.isArray(pattern)) {\n    pattern = [pattern]\n  }\n  for (const p of pattern) {\n    if (new Minimatch(p, options).hasMagic()) return true\n  }\n  return false\n}\n", "import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\nexport { escape, unescape } from 'minimatch'\nexport type {\n  FSOption,\n  Path,\n  WalkOptions,\n  WalkOptionsWithFileTypesTrue,\n  WalkOptionsWithFileTypesUnset,\n} from 'path-scurry'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport { Ignore } from './ignore.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions,\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions,\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n", "import { execFileSync } from 'child_process';\nimport { existsSync, readdirSync } from 'fs';\nimport { join, resolve } from 'path';\n\nimport type { ValidatedCdsCommand } from './types';\nimport { fileExists } from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport type { CdsDependencyGraph } from '../parser/types';\n\n/** Default timeout for command execution in milliseconds. **/\nexport const DEFAULT_COMMAND_TIMEOUT_MS = 10000;\n\n/**\n * Cache for CDS command test results to avoid running the same CLI commands repeatedly.\n */\ninterface CdsCommandCache {\n  /** Map of command strings to their test results */\n  commandResults: Map<string, { works: boolean; version?: string; error?: string }>;\n  /** Available cache directories discovered during testing */\n  availableCacheDirs: string[];\n  /** Global command test results */\n  globalCommand?: string;\n  /** Whether cache has been initialized */\n  initialized: boolean;\n}\n\n// Global cache instance to share results across all calls\nconst cdsCommandCache: CdsCommandCache = {\n  commandResults: new Map(),\n  availableCacheDirs: [],\n  initialized: false,\n};\n\n/**\n * Information about CDS version dependencies from a project's package.json\n */\ninterface CdsVersionInfo {\n  /** Semver range for @sap/cds */\n  cdsVersion?: string;\n  /** Semver range for @sap/cds-dk */\n  cdsDkVersion?: string;\n  /** Computed compatible @sap/cds-dk version */\n  preferredDkVersion?: string;\n}\n\n/**\n * Factory functions to create {@link ValidatedCdsCommand} instances.\n */\nconst createCdsCommands = {\n  // Global CDS command\n  cds: (): ValidatedCdsCommand => ({\n    executable: 'cds',\n    args: [],\n    originalCommand: 'cds',\n  }),\n  // NPX with @sap/cds package\n  npxCds: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', '@sap/cds', 'cds'],\n    originalCommand: 'npx --yes --package @sap/cds cds',\n  }),\n  // NPX with @sap/cds-dk package\n  npxCdsDk: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', '@sap/cds-dk', 'cds'],\n    originalCommand: 'npx --yes --package @sap/cds-dk cds',\n  }),\n  // NPX with @sap/cds-dk package (alternative flag)\n  npxCdsDkAlt: (): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '@sap/cds-dk', 'cds'],\n    originalCommand: 'npx --yes @sap/cds-dk cds',\n  }),\n  // NPX with versioned @sap/cds-dk package\n  npxCdsDkWithVersion: (version: string): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', `@sap/cds-dk@${version}`, 'cds'],\n    originalCommand: `npx --yes --package @sap/cds-dk@${version} cds`,\n  }),\n  // NPX with versioned @sap/cds package\n  npxCdsWithVersion: (version: string): ValidatedCdsCommand => ({\n    executable: 'npx',\n    args: ['--yes', '--package', `@sap/cds@${version}`, 'cds'],\n    originalCommand: `npx --yes --package @sap/cds@${version} cds`,\n  }),\n};\n\n/**\n * Converts a command string to a ValidatedCdsCommand object\n * @param commandString The command string to convert\n * @returns A ValidatedCdsCommand object\n */\nfunction parseCommandString(commandString: string): ValidatedCdsCommand {\n  const parts = commandString.trim().split(/\\s+/);\n  if (parts.length === 0) {\n    throw new Error('Empty command string');\n  }\n\n  const executable = parts[0];\n  const args = parts.slice(1);\n\n  return {\n    executable,\n    args,\n    originalCommand: commandString,\n  };\n}\n\n/**\n * Determines version-aware CDS commands for both primary and retry scenarios\n * @param cacheDir Optional cache directory\n * @param sourceRoot Source root directory\n * @param projectPath Project path for version resolution\n * @param dependencyGraph Dependency graph for version information\n * @returns Object containing both primary and retry commands\n */\nexport function determineVersionAwareCdsCommands(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): { primaryCommand: ValidatedCdsCommand; retryCommand: ValidatedCdsCommand } {\n  try {\n    // Get the best command string using existing logic\n    const commandString = getBestCdsCommand(cacheDir, sourceRoot, projectPath, dependencyGraph);\n\n    // Convert to ValidatedCdsCommand for primary use\n    const primaryCommand = parseCommandString(commandString);\n\n    // For retry command, always try to use a version-aware npx command if project context is available\n    let retryCommand: ValidatedCdsCommand;\n\n    if (projectPath && dependencyGraph) {\n      try {\n        const versionInfo = resolveCdsVersions(projectPath, dependencyGraph);\n        if (versionInfo?.preferredDkVersion) {\n          // Use version-specific command for retry\n          retryCommand = createCdsCommands.npxCdsDkWithVersion(versionInfo.preferredDkVersion);\n        } else if (versionInfo?.cdsDkVersion) {\n          // Use explicit cds-dk version\n          retryCommand = createCdsCommands.npxCdsDkWithVersion(versionInfo.cdsDkVersion);\n        } else {\n          // Fall back to generic npx cds-dk\n          retryCommand = createCdsCommands.npxCdsDk();\n        }\n      } catch (error) {\n        // If version resolution fails, fall back to generic npx\n        cdsExtractorLog(\n          'warn',\n          `Failed to resolve version info for ${projectPath}: ${String(error)}`,\n        );\n        retryCommand = createCdsCommands.npxCdsDk();\n      }\n    } else {\n      // No project context - use generic npx as fallback\n      retryCommand = createCdsCommands.npxCdsDk();\n    }\n\n    return { primaryCommand, retryCommand };\n  } catch (error) {\n    // If anything fails, fall back to simple commands\n    cdsExtractorLog('error', `Failed to determine version-aware commands: ${String(error)}`);\n    const fallbackCommand = parseCommandString('cds');\n    return {\n      primaryCommand: fallbackCommand,\n      retryCommand: createCdsCommands.npxCdsDk(),\n    };\n  }\n} /**\n * Creates a validated CDS command for an absolute path to a CDS executable.\n * @param absolutePath The absolute path to the CDS executable\n * @returns A {@link ValidatedCdsCommand} if the path exists and is valid, null otherwise\n */\nfunction createCdsCommandForPath(absolutePath: string): ValidatedCdsCommand | null {\n  try {\n    const resolvedPath = resolve(absolutePath);\n    if (resolvedPath && fileExists(resolvedPath)) {\n      return {\n        executable: resolvedPath,\n        args: [],\n        originalCommand: absolutePath,\n      };\n    }\n  } catch {\n    // Ignore path resolution errors\n  }\n  return null;\n}\n\n/**\n * Resolve CDS version information from a project's package.json via dependency graph\n * @param projectPath The path to the project\n * @param dependencyGraph The CDS dependency graph containing project information\n * @returns CDS version information or undefined if not available\n */\nfunction resolveCdsVersions(\n  projectPath: string,\n  dependencyGraph: CdsDependencyGraph,\n): CdsVersionInfo | undefined {\n  const project = dependencyGraph.projects.get(projectPath);\n  if (!project?.packageJson) {\n    return undefined;\n  }\n\n  const { dependencies = {}, devDependencies = {} } = project.packageJson;\n  const allDependencies = { ...dependencies, ...devDependencies };\n\n  const cdsVersion = allDependencies['@sap/cds'];\n  const cdsDkVersion = allDependencies['@sap/cds-dk'];\n\n  if (!cdsVersion && !cdsDkVersion) {\n    return undefined;\n  }\n\n  let preferredDkVersion: string | undefined;\n  if (cdsDkVersion) {\n    // Use explicit @sap/cds-dk version if available, but enforce minimum\n    preferredDkVersion = enforceMinimumCdsDkVersion(cdsDkVersion);\n  } else if (cdsVersion) {\n    // Derive compatible @sap/cds-dk version from @sap/cds version\n    preferredDkVersion = deriveCompatibleCdsDkVersion(cdsVersion);\n  }\n\n  return {\n    cdsVersion,\n    cdsDkVersion,\n    preferredDkVersion,\n  };\n}\n\n/**\n * Enforce minimum @sap/cds-dk version requirement\n * @param version The version string to check\n * @returns The version string with minimum version enforcement applied\n */\nfunction enforceMinimumCdsDkVersion(version: string): string {\n  const minimumVersion = 8;\n  const majorVersionMatch = version.match(/\\^?(\\d+)/);\n\n  if (majorVersionMatch) {\n    const majorVersion = parseInt(majorVersionMatch[1], 10);\n    if (majorVersion < minimumVersion) {\n      // Use the minimum version if derived version is too low\n      return `^${minimumVersion}`;\n    }\n  }\n\n  // Return original version if it meets minimum requirement or can't be parsed\n  return version;\n}\n\n/**\n * Derive a compatible @sap/cds-dk version from an @sap/cds version\n * @param cdsVersion The @sap/cds version semver range\n * @returns A compatible @sap/cds-dk version range with minimum version enforcement\n */\nfunction deriveCompatibleCdsDkVersion(cdsVersion: string): string {\n  // For simplicity, we'll use the same major version range\n  // This can be enhanced with more sophisticated logic as needed\n  const majorVersionMatch = cdsVersion.match(/\\^?(\\d+)/);\n  let derivedVersion: string;\n\n  if (majorVersionMatch) {\n    const majorVersion = majorVersionMatch[1];\n    derivedVersion = `^${majorVersion}`;\n  } else {\n    // Fallback to the original version if we can't parse it\n    derivedVersion = cdsVersion;\n  }\n\n  // Apply minimum version enforcement\n  return enforceMinimumCdsDkVersion(derivedVersion);\n}\n\n/**\n * Create a version-aware CDS command based on project information\n * @param projectPath The path to the project\n * @param dependencyGraph The CDS dependency graph containing project information\n * @returns A ValidatedCdsCommand if version information is available, null otherwise\n */\nfunction createVersionAwareCdsCommand(\n  projectPath: string,\n  dependencyGraph: CdsDependencyGraph,\n): ValidatedCdsCommand | null {\n  const versionInfo = resolveCdsVersions(projectPath, dependencyGraph);\n\n  if (!versionInfo?.preferredDkVersion) {\n    return null;\n  }\n\n  return createCdsCommands.npxCdsDkWithVersion(versionInfo.preferredDkVersion);\n}\n\n/**\n * Determine the `cds` command to use based on the environment and cache directory.\n *\n * This function uses a caching strategy to minimize repeated CLI command testing:\n * - Initializes a global cache on first call\n * - Tests global commands once and caches results\n * - Discovers all available cache directories upfront\n * - Reuses test results across multiple calls\n * - Supports project-specific version-aware command generation\n */\nexport function determineCdsCommand(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): string {\n  try {\n    // Always use the efficient path - debug information is collected separately\n    return getBestCdsCommand(cacheDir, sourceRoot, projectPath, dependencyGraph);\n  } catch (error) {\n    const errorMessage = `Failed to determine CDS command: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n    throw new Error(errorMessage);\n  }\n}\n\n/**\n * Discover all available cache directories in the source tree\n * @param sourceRoot The source root directory\n * @returns Array of cache directory paths\n */\nfunction discoverAvailableCacheDirs(sourceRoot: string): string[] {\n  if (cdsCommandCache.availableCacheDirs.length > 0) {\n    return cdsCommandCache.availableCacheDirs;\n  }\n\n  const cacheRootDir = join(sourceRoot, '.cds-extractor-cache');\n  const availableDirs: string[] = [];\n\n  try {\n    if (existsSync(cacheRootDir)) {\n      const entries = readdirSync(cacheRootDir, { withFileTypes: true });\n      for (const entry of entries) {\n        if (entry.isDirectory() && entry.name.startsWith('cds-')) {\n          const cacheDir = join(cacheRootDir, entry.name);\n          const cdsBin = join(cacheDir, 'node_modules', '.bin', 'cds');\n          if (fileExists(cdsBin)) {\n            availableDirs.push(cacheDir);\n          }\n        }\n      }\n    }\n  } catch (error) {\n    cdsExtractorLog('debug', `Failed to discover cache directories: ${String(error)}`);\n  }\n\n  cdsCommandCache.availableCacheDirs = availableDirs;\n  return availableDirs;\n}\n\n/**\n * Get the best CDS command for a specific cache directory\n * @param cacheDir Optional specific cache directory\n * @param sourceRoot The source root directory\n * @param projectPath Optional project path for version-aware commands\n * @param dependencyGraph Optional dependency graph for version information\n * @returns The best CDS command to use\n */\nfunction getBestCdsCommand(\n  cacheDir: string | undefined,\n  sourceRoot: string,\n  projectPath?: string,\n  dependencyGraph?: CdsDependencyGraph,\n): string {\n  // Initialize cache if needed\n  initializeCdsCommandCache(sourceRoot);\n\n  // If a specific cache directory is provided and valid, prefer it\n  if (cacheDir) {\n    const localCdsBin = join(cacheDir, 'node_modules', '.bin', 'cds');\n    const command = createCdsCommandForPath(localCdsBin);\n    if (command) {\n      const result = testCdsCommand(command, sourceRoot, true);\n      if (result.works) {\n        return localCdsBin;\n      }\n    }\n  }\n\n  // Try any available cache directories\n  for (const availableCacheDir of cdsCommandCache.availableCacheDirs) {\n    const localCdsBin = join(availableCacheDir, 'node_modules', '.bin', 'cds');\n    const command = createCdsCommandForPath(localCdsBin);\n    if (command) {\n      const result = testCdsCommand(command, sourceRoot, true);\n      if (result.works) {\n        return localCdsBin;\n      }\n    }\n  }\n\n  // Try project-specific version-aware commands if information is available\n  if (projectPath && dependencyGraph) {\n    const versionAwareCommand = createVersionAwareCdsCommand(projectPath, dependencyGraph);\n    if (versionAwareCommand) {\n      const result = testCdsCommand(versionAwareCommand, sourceRoot, true);\n      if (result.works) {\n        return versionAwareCommand.originalCommand;\n      }\n    }\n  }\n\n  // Fall back to global command\n  if (cdsCommandCache.globalCommand) {\n    return cdsCommandCache.globalCommand;\n  }\n\n  // Final fallback: test remaining npx options\n  const fallbackCommands = [createCdsCommands.npxCds(), createCdsCommands.npxCdsDk()];\n\n  for (const command of fallbackCommands) {\n    const result = testCdsCommand(command, sourceRoot, true);\n    if (result.works) {\n      return command.originalCommand;\n    }\n  }\n\n  // Return the default fallback even if it doesn't work, as tests expect this behavior\n  return createCdsCommands.npxCdsDk().originalCommand;\n}\n\n/**\n * Initialize the CDS command cache by testing global commands\n * @param sourceRoot The source root directory\n */\nfunction initializeCdsCommandCache(sourceRoot: string): void {\n  if (cdsCommandCache.initialized) {\n    return;\n  }\n\n  cdsExtractorLog('info', 'Initializing CDS command cache...');\n\n  // Test global commands first (most commonly used)\n  const globalCommands = [createCdsCommands.cds(), createCdsCommands.npxCdsDk()];\n\n  for (const command of globalCommands) {\n    const result = testCdsCommand(command, sourceRoot, true); // Silent testing\n    if (result.works) {\n      cdsCommandCache.globalCommand = command.originalCommand;\n      cdsExtractorLog(\n        'info',\n        `Found working global CDS command: ${command.originalCommand} (v${result.version ?? 'unknown'})`,\n      );\n      break;\n    }\n  }\n\n  // Discover available cache directories\n  const cacheDirs = discoverAvailableCacheDirs(sourceRoot);\n  if (cacheDirs.length > 0) {\n    cdsExtractorLog(\n      'info',\n      `Discovered ${cacheDirs.length} CDS cache director${cacheDirs.length === 1 ? 'y' : 'ies'}`,\n    );\n  }\n\n  cdsCommandCache.initialized = true;\n}\n\n/**\n * Reset the command cache - primarily for testing\n */\nexport function resetCdsCommandCache(): void {\n  cdsCommandCache.commandResults.clear();\n  cdsCommandCache.availableCacheDirs = [];\n  cdsCommandCache.globalCommand = undefined;\n  cdsCommandCache.initialized = false;\n}\n\n/**\n * Check if a CDS command is available and working.\n * @param validatedCommand The {@link ValidatedCdsCommand} instance for the command to test\n * @param sourceRoot The source root directory to use as cwd when testing the command\n * @param silent Whether to suppress logging of test failures\n * @returns Object with test result and version information\n */\nfunction testCdsCommand(\n  validatedCommand: ValidatedCdsCommand,\n  sourceRoot: string,\n  silent: boolean = false,\n): { works: boolean; version?: string; error?: string } {\n  const cacheKey = validatedCommand.originalCommand;\n\n  // Check cache first\n  const cachedResult = cdsCommandCache.commandResults.get(cacheKey);\n  if (cachedResult) {\n    return cachedResult;\n  }\n\n  try {\n    // Run the validated `cds` command with `--version` to test if it works.\n    const cleanEnv = {\n      ...process.env,\n      // Remove any CodeQL-specific environment variables that might interfere.\n      CODEQL_EXTRACTOR_CDS_WIP_DATABASE: undefined,\n      CODEQL_RUNNER: undefined,\n    };\n\n    const result = execFileSync(\n      validatedCommand.executable,\n      [...validatedCommand.args, '--version'],\n      {\n        encoding: 'utf8',\n        stdio: 'pipe',\n        timeout: DEFAULT_COMMAND_TIMEOUT_MS, // timeout after 10 seconds\n        cwd: sourceRoot,\n        env: cleanEnv,\n      },\n    ).toString();\n\n    // Extract version from output (typically in format \"@sap/cds-dk: 6.1.3\" or just \"6.1.3\")\n    const versionMatch = result.match(/(\\d+\\.\\d+\\.\\d+)/);\n    const version = versionMatch ? versionMatch[1] : undefined;\n\n    const testResult = { works: true, version };\n    cdsCommandCache.commandResults.set(cacheKey, testResult);\n    return testResult;\n  } catch (error) {\n    const errorMessage = String(error);\n    if (!silent) {\n      cdsExtractorLog('debug', `CDS command test failed for '${cacheKey}': ${errorMessage}`);\n    }\n\n    const testResult = { works: false, error: errorMessage };\n    cdsCommandCache.commandResults.set(cacheKey, testResult);\n    return testResult;\n  }\n}\n", "import {\n  existsSync,\n  readFileSync,\n  readdirSync,\n  renameSync,\n  statSync,\n  unlinkSync,\n  writeFileSync,\n} from 'fs';\nimport { format, join, parse } from 'path';\n\nimport { cdsExtractorMarkerFileContent, cdsExtractorMarkerFileName } from './constants';\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Check if a directory exists\n * @param dirPath Path to the directory to check\n * @returns True if the directory exists, false otherwise\n */\nexport function dirExists(dirPath: string): boolean {\n  return existsSync(dirPath) && statSync(dirPath).isDirectory();\n}\n\n/**\n * Check if a file exists and can be read\n * @param filePath Path to the file to check\n * @returns True if the file exists and can be read, false otherwise\n */\nexport function fileExists(filePath: string): boolean {\n  return existsSync(filePath) && statSync(filePath).isFile();\n}\n\n/**\n * Recursively renames all .json files to .cds.json in the given directory and\n * its subdirectories, except for those that already have .cds.json extension.\n *\n * @param {string} dirPath - The directory path to start recursion from\n */\nexport function recursivelyRenameJsonFiles(dirPath: string): void {\n  // Make sure the directory exists\n  if (!dirExists(dirPath)) {\n    cdsExtractorLog('info', `Directory not found: ${dirPath}`);\n    return;\n  }\n  cdsExtractorLog('info', `Processing JSON files in directory: ${dirPath}`);\n\n  // Get all entries in the directory\n  const entries = readdirSync(dirPath, { withFileTypes: true });\n\n  for (const entry of entries) {\n    const fullPath = join(dirPath, entry.name);\n\n    if (entry.isDirectory()) {\n      // Recursively process subdirectories\n      recursivelyRenameJsonFiles(fullPath);\n    } else if (\n      entry.isFile() &&\n      entry.name.endsWith('.json') &&\n      !entry.name.endsWith('.cds.json')\n    ) {\n      // Rename .json files to .cds.json\n      const newPath = format({ ...parse(fullPath), base: '', ext: '.cds.json' });\n      renameSync(fullPath, newPath);\n      cdsExtractorLog('info', `Renamed CDS output file from ${fullPath} to ${newPath}`);\n    }\n  }\n}\n\n/**\n * Create the marker file with dummy content.\n * This file is required by the JavaScript extractor starting with CodeQL CLI v2.23.5.\n * @param sourceRoot The source root directory where the marker file should be created\n * @returns The path to the created marker file\n */\nexport function createMarkerFile(sourceRoot: string): string {\n  const markerFilePath = join(sourceRoot, cdsExtractorMarkerFileName);\n  try {\n    writeFileSync(markerFilePath, cdsExtractorMarkerFileContent, 'utf8');\n    cdsExtractorLog('info', `Created marker file: ${markerFilePath}`);\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to create marker file: ${String(error)}`);\n  }\n  return markerFilePath;\n}\n\n/**\n * Remove the cdsExtractorMarkerFileName file if it exists.\n * This cleanup prevents the marker file from being accidentally committed.\n * @param markerFilePath The path to the marker file to remove\n */\nexport function removeMarkerFile(markerFilePath: string): void {\n  if (existsSync(markerFilePath)) {\n    try {\n      unlinkSync(markerFilePath);\n      cdsExtractorLog('info', `Removed marker file: ${markerFilePath}`);\n    } catch (error) {\n      cdsExtractorLog('warn', `Failed to remove marker file: ${String(error)}`);\n    }\n  }\n}\n\n/**\n * Normalize all `$location.file` values in a parsed CDS JSON object to use\n * POSIX forward slashes. The CDS compiler on Windows produces backslash paths\n * (e.g. `\"srv\\\\service1.cds\"`), but the CodeQL libraries expect forward slashes\n * (e.g. `\"srv/service1.cds\"`).\n *\n * Mutates the object in place and returns it for convenience.\n */\nexport function normalizeCdsJsonLocations(data: Record<string, unknown>): Record<string, unknown> {\n  if (typeof data !== 'object' || data === null) return data;\n\n  // Normalize top-level $location.file\n  const topLoc = data['$location'] as Record<string, unknown> | undefined;\n  if (topLoc?.file && typeof topLoc.file === 'string') {\n    topLoc.file = topLoc.file.split('\\\\').join('/');\n  }\n\n  // Normalize $location.file in all definitions (and their nested elements/params)\n  const definitions = data['definitions'] as Record<string, Record<string, unknown>> | undefined;\n  if (definitions) {\n    for (const defn of Object.values(definitions)) {\n      normalizeLocationsRecursive(defn);\n    }\n  }\n\n  return data;\n}\n\n/**\n * Recursively normalize `$location.file` values in a CDS JSON object node.\n */\nfunction normalizeLocationsRecursive(obj: unknown): void {\n  if (typeof obj !== 'object' || obj === null) return;\n\n  const record = obj as Record<string, unknown>;\n  const loc = record['$location'] as Record<string, unknown> | undefined;\n  if (loc?.file && typeof loc.file === 'string') {\n    loc.file = loc.file.split('\\\\').join('/');\n  }\n\n  // Recurse into known nested structures: elements, params, actions, functions\n  for (const key of ['elements', 'params', 'actions', 'functions', 'items', 'returns']) {\n    const nested = record[key];\n    if (typeof nested === 'object' && nested !== null && !Array.isArray(nested)) {\n      for (const child of Object.values(nested as Record<string, unknown>)) {\n        normalizeLocationsRecursive(child);\n      }\n    }\n  }\n}\n\n/**\n * Read a `.cds.json` file, normalize all `$location.file` values to POSIX\n * forward slashes, and write it back. No-op if the file doesn't change.\n *\n * @param filePath Absolute path to the `.cds.json` file\n */\nexport function normalizeLocationPathsInFile(filePath: string): void {\n  if (!fileExists(filePath)) return;\n\n  const raw = readFileSync(filePath, 'utf8');\n  const data = JSON.parse(raw) as Record<string, unknown>;\n  normalizeCdsJsonLocations(data);\n  const normalized = JSON.stringify(data, null, 2) + '\\n';\n\n  if (normalized !== raw) {\n    writeFileSync(filePath, normalized, 'utf8');\n    cdsExtractorLog('info', `Normalized $location paths in: ${filePath}`);\n  }\n}\n", "/** Common constants used throughout the CDS extractor. */\n\n/**\n * Common, expected name of the JSON file created by CDS compilation\n * tasks performed by, or on behalf of, the CDS extractor.\n */\nexport const modelCdsJsonFile = 'model.cds.json';\n\n/**\n * Common, expected name of the marker file created to meet the JavaScript\n * extractor's requirement for at least one .js file to be present under\n * the source root. This file is auto-created in the source root directory\n * prior to invoking the JavaScript extractor, and removed afterwards, to\n * enable extraction of the .cds.json files by the JavaScript extractor.\n */\nexport const cdsExtractorMarkerFileName = 'cds-extractor-marker.js';\n\n/**\n * Expected content of the {@link cdsExtractorMarkerFileName} file.\n */\nexport const cdsExtractorMarkerFileContent =\n  '\"Placeholder content created by the CDS extractor. This file can be safely deleted.\";';\n", "import type { LogLevel } from './types';\n\n/**\n * Source root directory for logging context.\n */\nlet sourceRootDirectory: string | undefined;\n\n/**\n * Unique session ID for this CDS extractor run to help distinguish\n * between multiple concurrent or sequential runs in logs.\n * Uses the extractor start timestamp for uniqueness.\n */\nconst sessionId = Date.now().toString();\n\n/**\n * Start time of the CDS extractor session for performance tracking.\n */\nconst extractorStartTime = Date.now();\n\n/**\n * Performance tracking state for timing critical operations.\n */\nconst performanceTracking = new Map<string, number>();\n\n/**\n * Unified logging function for the CDS extractor. Provides consistent\n * log formatting with level prefixes, elapsed time, and session IDs.\n *\n * @param level - The log level ('debug', 'info', 'warn', 'error')\n * @param message - The primary message or data to log\n * @param optionalParams - Additional parameters to log (same as console.log)\n */\nexport function cdsExtractorLog(\n  level: LogLevel,\n  message: unknown,\n  ...optionalParams: unknown[]\n): void {\n  if (!sourceRootDirectory) {\n    throw new Error('Source root directory is not set. Call setSourceRootDirectory() first.');\n  }\n\n  const currentTime = Date.now();\n  const elapsedMs = currentTime - extractorStartTime;\n  const levelPrefix = `[CDS-${sessionId} ${elapsedMs}] ${level.toUpperCase()}: `;\n\n  // Select the appropriate console function based on log level\n  switch (level) {\n    case 'debug':\n    case 'info':\n      if (typeof message === 'string') {\n        console.log(levelPrefix + message, ...optionalParams);\n      } else {\n        console.log(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    case 'warn':\n      if (typeof message === 'string') {\n        console.warn(levelPrefix + message, ...optionalParams);\n      } else {\n        console.warn(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    case 'error':\n      if (typeof message === 'string') {\n        console.error(levelPrefix + message, ...optionalParams);\n      } else {\n        console.error(levelPrefix, message, ...optionalParams);\n      }\n      break;\n    default:\n      // This should never happen due to TypeScript typing\n      throw new Error(`Invalid log level: ${String(level)}`);\n  }\n}\n/**\n * Calculates elapsed time from start and formats it with appropriate units.\n *\n * @param startTime - The start timestamp in milliseconds\n * @param endTime - The end timestamp in milliseconds (defaults to current time)\n * @returns Formatted duration string\n */\nfunction formatDuration(startTime: number, endTime: number = Date.now()): string {\n  const durationMs = endTime - startTime;\n\n  if (durationMs < 1000) {\n    return `${durationMs}ms`;\n  } else if (durationMs < 60000) {\n    return `${(durationMs / 1000).toFixed(2)}s`;\n  } else {\n    const minutes = Math.floor(durationMs / 60000);\n    const seconds = ((durationMs % 60000) / 1000).toFixed(2);\n    return `${minutes}m ${seconds}s`;\n  }\n}\n\n/**\n * Logs the start of the CDS extractor session with session information.\n *\n * @param sourceRoot - The source root directory being processed\n */\nexport function logExtractorStart(sourceRoot: string): void {\n  cdsExtractorLog('info', `=== CDS EXTRACTOR START [${sessionId}] ===`);\n  cdsExtractorLog('info', `Source Root: ${sourceRoot}`);\n}\n\n/**\n * Logs the end of the CDS extractor session with final performance summary.\n *\n * @param success - Whether the extraction completed successfully\n * @param additionalSummary - Optional additional summary information\n */\nexport function logExtractorStop(success: boolean = true, additionalSummary?: string): void {\n  const endTime = Date.now();\n  const totalDuration = formatDuration(extractorStartTime, endTime);\n  const status = success ? 'SUCCESS' : 'FAILURE';\n\n  if (additionalSummary) {\n    cdsExtractorLog('info', additionalSummary);\n  }\n\n  cdsExtractorLog('info', `=== CDS EXTRACTOR END [${sessionId}] - ${status} ===`);\n  cdsExtractorLog('info', `Total Duration: ${totalDuration}`);\n}\n\n/**\n * Logs a performance milestone with timing information.\n *\n * @param milestone - Description of the milestone reached\n * @param additionalInfo - Optional additional information to include\n */\nexport function logPerformanceMilestone(milestone: string, additionalInfo?: string): void {\n  const currentTime = Date.now();\n  const overallDuration = formatDuration(extractorStartTime, currentTime);\n  const info = additionalInfo ? ` - ${additionalInfo}` : '';\n  cdsExtractorLog('info', `MILESTONE: ${milestone} (after ${overallDuration})${info}`);\n}\n\n/**\n * Starts tracking performance for a named operation.\n *\n * @param operationName - Name of the operation to track\n */\nexport function logPerformanceTrackingStart(operationName: string): void {\n  performanceTracking.set(operationName, Date.now());\n  cdsExtractorLog('debug', `Started: ${operationName}`);\n}\n\n/**\n * Ends tracking performance for a named operation and logs the duration.\n *\n * @param operationName - Name of the operation to stop tracking\n */\nexport function logPerformanceTrackingStop(operationName: string): void {\n  const startTime = performanceTracking.get(operationName);\n  if (startTime) {\n    const duration = formatDuration(startTime);\n    performanceTracking.delete(operationName);\n    cdsExtractorLog('info', `Completed: ${operationName} (took ${duration})`);\n  } else {\n    cdsExtractorLog('warn', `No start time found for operation: ${operationName}`);\n  }\n}\n\n/**\n * Sets the source root directory for logging context.\n * This should typically be called once at the start of the CDS extractor.\n *\n * @param sourceRoot - The absolute path to the source root directory\n */\nexport function setSourceRootDirectory(sourceRoot: string): void {\n  sourceRootDirectory = sourceRoot;\n}\n", "import type { CdsDependencyGraph } from '../cds/parser';\n\n/**\n * Generate a comprehensive status report for the dependency graph\n * Supports both normal execution and debug modes\n */\nexport function generateStatusReport(dependencyGraph: CdsDependencyGraph): string {\n  const summary = dependencyGraph.statusSummary;\n  const lines: string[] = [];\n\n  lines.push('='.repeat(80));\n  lines.push(`CDS EXTRACTOR STATUS REPORT`);\n  lines.push('='.repeat(80));\n  lines.push('');\n\n  // OVERALL SUMMARY\n  lines.push('OVERALL SUMMARY:');\n  lines.push(`  Status: ${summary.overallSuccess ? 'SUCCESS' : 'FAILED'}`);\n  lines.push(`  Current Phase: ${dependencyGraph.currentPhase.toUpperCase()}`);\n  lines.push(`  Projects: ${summary.totalProjects}`);\n  lines.push(`  CDS Files: ${summary.totalCdsFiles}`);\n  lines.push(`  JSON Files Generated: ${summary.jsonFilesGenerated}`);\n  lines.push('');\n\n  // COMPILATION SUMMARY\n  lines.push('COMPILATION SUMMARY:');\n  lines.push(`  Total Tasks: ${summary.totalCompilationTasks}`);\n  lines.push(`  Successful: ${summary.successfulCompilations}`);\n  lines.push(`  Retried: ${dependencyGraph.retryStatus.totalRetryAttempts}`);\n  lines.push(`  Failed: ${summary.failedCompilations}`);\n  lines.push(`  Skipped: ${summary.skippedCompilations}`);\n  lines.push('');\n\n  // RETRY SUMMARY (if retry attempts were made)\n  if (dependencyGraph.retryStatus.totalRetryAttempts > 0) {\n    lines.push('RETRY SUMMARY:');\n    lines.push(`  Tasks Requiring Retry: ${dependencyGraph.retryStatus.totalTasksRequiringRetry}`);\n    lines.push(\n      `  Tasks Successfully Retried: ${dependencyGraph.retryStatus.totalTasksSuccessfullyRetried}`,\n    );\n    lines.push(`  Total Retry Attempts: ${dependencyGraph.retryStatus.totalRetryAttempts}`);\n    lines.push(\n      `  Projects Requiring Full Dependencies: ${dependencyGraph.retryStatus.projectsRequiringFullDependencies.size}`,\n    );\n    lines.push(\n      `  Projects with Full Dependencies: ${dependencyGraph.retryStatus.projectsWithFullDependencies.size}`,\n    );\n    lines.push('');\n  }\n\n  // PERFORMANCE metrics\n  lines.push('PERFORMANCE:');\n  lines.push(`  Total Duration: ${summary.performance.totalDurationMs}ms`);\n  lines.push(`  Parsing: ${summary.performance.parsingDurationMs}ms`);\n  lines.push(`  Compilation: ${summary.performance.compilationDurationMs}ms`);\n  lines.push(`  Extraction: ${summary.performance.extractionDurationMs}ms`);\n\n  // Add percentage breakdown if total duration > 0\n  if (summary.performance.totalDurationMs > 0) {\n    const parsingPct = Math.round(\n      (summary.performance.parsingDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n    const compilationPct = Math.round(\n      (summary.performance.compilationDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n    const extractionPct = Math.round(\n      (summary.performance.extractionDurationMs / summary.performance.totalDurationMs) * 100,\n    );\n\n    lines.push('  Breakdown:');\n    lines.push(`    Parsing: ${parsingPct}%`);\n    lines.push(`    Compilation: ${compilationPct}%`);\n    lines.push(`    Extraction: ${extractionPct}%`);\n  }\n  lines.push('');\n\n  // Errors and warnings\n  if (summary.criticalErrors.length > 0) {\n    lines.push('CRITICAL ERRORS:');\n    for (const error of summary.criticalErrors) {\n      lines.push(`  - ${error}`);\n    }\n    lines.push('');\n  }\n\n  if (summary.warnings.length > 0) {\n    lines.push('WARNINGS:');\n    for (const warning of summary.warnings) {\n      lines.push(`  - ${warning}`);\n    }\n    lines.push('');\n  }\n\n  lines.push('='.repeat(80));\n\n  return lines.join('\\n');\n}\n", "import { spawnSync, SpawnSyncOptions } from 'child_process';\nimport { basename, delimiter, dirname, join, relative, resolve, sep } from 'path';\n\nimport { CdsCompilationResult } from './types';\nimport { getCdsVersion } from './version';\nimport { modelCdsJsonFile } from '../../constants';\nimport { getPlatformInfo } from '../../environment';\nimport {\n  fileExists,\n  dirExists,\n  recursivelyRenameJsonFiles,\n  normalizeLocationPathsInFile,\n} from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport { BasicCdsProject } from '../parser/types';\n\n/**\n * Parses a command string for use with spawnSync, handling multi-word commands like 'npx cds'.\n * @param commandString The command string to parse (e.g., 'npx cds' or 'cds')\n * @returns Object with executable and args arrays for spawnSync\n */\nfunction parseCommandForSpawn(commandString: string): { executable: string; baseArgs: string[] } {\n  const parts = commandString.trim().split(/\\s+/);\n  const executable = parts[0];\n  const baseArgs = parts.slice(1);\n  return { executable, baseArgs };\n}\n\n/**\n * Determines compilation targets for a CDS project according to the new project-only compilation approach.\n * @param project The CDS project\n * @param sourceRoot The source root directory\n * @returns Array of compilation targets (directories or files relative to project base)\n */\nfunction determineCompilationTargets(project: BasicCdsProject, sourceRoot: string): string[] {\n  const projectAbsolutePath = join(sourceRoot, project.projectDir);\n\n  // Check for index.cds in the project root first, which takes precedence over CAP directories.\n  const rootCdsFiles = project.cdsFiles\n    .filter(file => dirname(join(sourceRoot, file)) === projectAbsolutePath)\n    .map(file => basename(file));\n\n  if (rootCdsFiles.includes('index.cds')) {\n    // Use only index.cds when it exists in the project root\n    return ['index.cds'];\n  }\n\n  // Check for standard CAP directories\n  const capDirectories = ['db', 'srv', 'app'];\n  const existingCapDirs = capDirectories.filter(dir => dirExists(join(projectAbsolutePath, dir)));\n\n  if (existingCapDirs.length > 0) {\n    // Use standard CAP directories\n    return existingCapDirs;\n  }\n\n  if (rootCdsFiles.length > 0) {\n    // Use other root-level files\n    return rootCdsFiles;\n  }\n\n  // Use all CDS files with their relative paths\n  return project.cdsFiles.map(file => relative(projectAbsolutePath, join(sourceRoot, file)));\n}\n\n/**\n * Compiles a CDS project to JSON using project-level compilation only.\n * This function has been simplified to only use project-level compilation,\n * eliminating all individual file compilation logic and standardizing output\n * to a single {@link modelCdsJsonFile} file per project.\n *\n *\n * @param cdsFilePath The path to the CDS file to compile, relative to the `sourceRoot`.\n * @param sourceRoot The source root directory scanned by the CDS extractor.\n * CRITICAL: All spawned processes will use the project base directory as their `cwd` to\n * ensure that paths in generated JSON are relative to the project base directory.\n *\n * @param cdsCommand The actual shell command to use for `cds compile`.\n * @param cacheDir Full path to the cache directory where dependencies are stored.\n * @param projectMap Map of project directories to {@link BasicCdsProject} instances.\n * @param projectDir The project directory to which `cdsFilePath` belongs.\n *\n * @returns The {@link CdsCompilationResult} of the compilation attempt.\n */\nexport function compileCdsToJson(\n  cdsFilePath: string,\n  sourceRoot: string,\n  cdsCommand: string,\n  cacheDir: string | undefined,\n  projectMap: Map<string, BasicCdsProject>,\n  projectDir: string,\n): CdsCompilationResult {\n  try {\n    const resolvedCdsFilePath = resolve(cdsFilePath);\n    if (!fileExists(resolvedCdsFilePath)) {\n      throw new Error(`Expected CDS file '${resolvedCdsFilePath}' does not exist.`);\n    }\n\n    // Get and log the CDS version\n    const cdsVersion = getCdsVersion(cdsCommand, cacheDir);\n    const versionInfo = cdsVersion ? `with CDS v${cdsVersion}` : '';\n\n    // Calculate project base directory for consistent working directory\n    const projectBaseDir = join(sourceRoot, projectDir);\n\n    // Create spawn options with project base directory as cwd.\n    const spawnOptions = createSpawnOptions(projectBaseDir, cdsCommand, cacheDir);\n\n    // Throw an error if projectDir cannot be found in the projectMap.\n    if (!projectMap || !projectDir || !projectMap.has(projectDir)) {\n      throw new Error(\n        `Project directory '${projectDir}' not found in projectMap. Ensure the project is properly initialized.`,\n      );\n    }\n\n    const project = projectMap.get(projectDir);\n\n    // Always use project-level compilation\n    return compileProject(sourceRoot, projectDir, cdsCommand, spawnOptions, versionInfo, project!);\n  } catch (error) {\n    return { success: false, message: String(error) };\n  }\n}\n\n/**\n * Handles project-level compilation for CAP projects.\n * CRITICAL: Uses the project base directory as cwd and calculates paths relative to project base directory.\n *\n * @param sourceRoot The source root directory\n * @param projectDir The project directory (relative to sourceRoot)\n * @param cdsCommand The CDS command to use\n * @param spawnOptions Pre-configured spawn options with project base directory as cwd\n * @param versionInfo Version information for logging\n * @param project The CDS project instance\n * @returns Compilation result\n */\nfunction compileProject(\n  sourceRoot: string,\n  projectDir: string,\n  cdsCommand: string,\n  spawnOptions: SpawnSyncOptions,\n  versionInfo: string,\n  project: BasicCdsProject,\n): CdsCompilationResult {\n  cdsExtractorLog('info', `Compiling CDS project '${projectDir}' using ${versionInfo}...`);\n\n  // Determine compilation targets using the new centralized logic\n  const compilationTargets = determineCompilationTargets(project, sourceRoot);\n\n  if (compilationTargets.length === 0) {\n    throw new Error(\n      `Project directory '${projectDir}' does not contain any CDS files and cannot be compiled`,\n    );\n  }\n\n  const projectJsonOutPath = join(sourceRoot, projectDir, modelCdsJsonFile);\n\n  const compileArgs = [\n    'compile',\n    ...compilationTargets,\n    '--to',\n    'json',\n    '--dest',\n    modelCdsJsonFile,\n    '--locations',\n    '--log-level',\n    'warn',\n  ];\n\n  cdsExtractorLog('info', `Compiling CDS project targets: ${compilationTargets.join(', ')}`);\n  cdsExtractorLog(\n    'info',\n    `Running compilation task for CDS project '${projectDir}': command='${cdsCommand}' args='${JSON.stringify(compileArgs)}'`,\n  );\n\n  // Parse command for proper spawnSync execution\n  const { executable, baseArgs } = parseCommandForSpawn(cdsCommand);\n  const allArgs = [...baseArgs, ...compileArgs];\n\n  const result = spawnSync(executable, allArgs, spawnOptions);\n\n  if (result.error) {\n    cdsExtractorLog('error', `SpawnSync error: ${result.error.message}`);\n    throw new Error(`Error executing CDS compiler: ${result.error.message}`);\n  }\n\n  // Log stderr for debugging even on success (CDS often writes warnings to stderr).\n  if (result.stderr && result.stderr.length > 0) {\n    cdsExtractorLog('warn', `CDS stderr output: ${result.stderr.toString()}`);\n  }\n\n  if (result.status !== 0) {\n    cdsExtractorLog('error', `CDS command failed with status ${result.status}`);\n    cdsExtractorLog(\n      'error',\n      `Command: ${cdsCommand} ${compileArgs.map(arg => (arg.includes(' ') ? `\"${arg}\"` : arg)).join(' ')}`,\n    );\n    cdsExtractorLog('error', `Stdout: ${result.stdout?.toString() || 'No stdout'}`);\n    cdsExtractorLog('error', `Stderr: ${result.stderr?.toString() || 'No stderr'}`);\n    throw new Error(\n      `Could not compile the CAP project ${projectDir}.\\nReported error(s):\\n\\`\\`\\`\\n${\n        result.stderr?.toString() || 'Unknown error'\n      }\\n\\`\\`\\``,\n    );\n  }\n\n  if (!fileExists(projectJsonOutPath) && !dirExists(projectJsonOutPath)) {\n    throw new Error(\n      `CAP project '${projectDir}' was not compiled to JSON. This is likely because the project structure is invalid.`,\n    );\n  }\n\n  // Handle directory output if the CDS compiler generated a directory.\n  if (dirExists(projectJsonOutPath)) {\n    cdsExtractorLog(\n      'info',\n      `CDS compiler generated JSON to output directory: ${projectJsonOutPath}`,\n    );\n    // Recursively rename generated .json files to have a .cds.json extension\n    recursivelyRenameJsonFiles(projectJsonOutPath);\n  } else {\n    cdsExtractorLog('info', `CDS compiler generated JSON to file: ${projectJsonOutPath}`);\n  }\n\n  // Normalize $location.file paths to POSIX forward slashes.\n  // The CDS compiler on Windows produces backslash paths (e.g. \"srv\\\\service1.cds\")\n  // but CodeQL libraries expect forward slashes (e.g. \"srv/service1.cds\").\n  normalizeLocationPathsInFile(projectJsonOutPath);\n\n  return {\n    success: true,\n    outputPath: projectJsonOutPath,\n    compiledAsProject: true,\n    message: 'Project was compiled using project-aware compilation',\n  };\n}\n\n/**\n * Creates spawn options for CDS compilation processes.\n * CRITICAL: Always sets cwd to project base directory to ensure generated JSON paths are relative to project base directory.\n *\n * @param projectBaseDir The project base directory (where package.json is located) - used as cwd for all spawned processes\n * @param cdsCommand The CDS command to determine if we need Node.js environment setup\n * @param cacheDir Optional cache directory for dependencies\n * @returns Spawn options configured for CDS compilation\n */\nfunction createSpawnOptions(\n  projectBaseDir: string,\n  cdsCommand: string,\n  cacheDir?: string,\n): SpawnSyncOptions {\n  // Check if we're using a direct binary path (contains node_modules/.bin/ or node_modules\\.bin\\) or npx-style command\n  // Check both platform-native separator and forward slash for cross-platform compatibility\n  const binPathNative = `node_modules${sep}.bin${sep}`;\n  const binPathPosix = 'node_modules/.bin/';\n  const isDirectBinary = cdsCommand.includes(binPathNative) || cdsCommand.includes(binPathPosix);\n\n  // Only enable shell on Windows for npx-style commands where .cmd resolution is needed.\n  // Direct binary paths (node_modules/.bin/cds) don't need shell on any platform.\n  const useShell = getPlatformInfo().isWindows && !isDirectBinary;\n\n  const spawnOptions: SpawnSyncOptions = {\n    cwd: projectBaseDir, // CRITICAL: Always use project base directory as cwd to ensure correct path generation\n    shell: useShell,\n    stdio: 'pipe',\n    env: { ...process.env },\n  };\n\n  // Only set up Node.js environment for npx-style commands, not for direct binary execution\n  if (cacheDir && !isDirectBinary) {\n    const nodePath = join(cacheDir, 'node_modules');\n\n    // Set up environment to use the cached dependencies\n    spawnOptions.env = {\n      ...process.env,\n      NODE_PATH: `${nodePath}${delimiter}${process.env.NODE_PATH ?? ''}`,\n      PATH: `${join(nodePath, '.bin')}${delimiter}${process.env.PATH}`,\n      // Add NPM configuration to ensure dependencies are resolved from the cache directory\n      npm_config_prefix: cacheDir,\n      // Ensure we don't pick up global CDS installations that might conflict\n      npm_config_global: 'false',\n      // Clear any existing CDS environment variables that might interfere\n      CDS_HOME: cacheDir,\n    };\n  } else if (isDirectBinary) {\n    // For direct binary execution, use minimal environment to avoid conflicts\n    // Remove Node.js-specific environment variables that might interfere\n    const cleanEnv = { ...process.env };\n    delete cleanEnv.NODE_PATH;\n    delete cleanEnv.npm_config_prefix;\n    delete cleanEnv.npm_config_global;\n    delete cleanEnv.CDS_HOME;\n\n    spawnOptions.env = cleanEnv;\n  }\n\n  return spawnOptions;\n}\n", "import { spawnSync, SpawnSyncOptions } from 'child_process';\nimport { join, delimiter } from 'path';\n\n/**\n * Get the CDS compiler version from a specific command or cache directory.\n * @param cdsCommand The CDS command to use.\n * @param cacheDir Optional path to a directory containing installed dependencies.\n * @returns The CDS compiler version string, or undefined if it couldn't be determined.\n */\nexport function getCdsVersion(cdsCommand: string, cacheDir?: string): string | undefined {\n  try {\n    // Set up environment vars if using a cache directory\n    const spawnOptions: SpawnSyncOptions = {\n      shell: true,\n      stdio: 'pipe',\n      env: { ...process.env },\n    };\n\n    // If a cache directory is provided, set NODE_PATH to use that cache\n    if (cacheDir) {\n      const nodePath = join(cacheDir, 'node_modules');\n\n      // Set up environment to use the cached dependencies\n      spawnOptions.env = {\n        ...process.env,\n        NODE_PATH: `${nodePath}${delimiter}${process.env.NODE_PATH ?? ''}`,\n        PATH: `${join(nodePath, '.bin')}${delimiter}${process.env.PATH}`,\n        npm_config_prefix: cacheDir,\n      };\n    }\n\n    // Execute the CDS command with the --version flag\n    // When shell: true is used, concatenate command and args to avoid DEP0190 deprecation warning\n    const result = spawnSync(`${cdsCommand} --version`, spawnOptions);\n    if (result.status === 0 && result.stdout) {\n      const versionOutput = result.stdout.toString().trim();\n      // Extract version number, which is typically in formats like \"@sap/cds: 6.1.3\" or similar\n      const match = versionOutput.match(/@sap\\/cds[^0-9]*([0-9]+\\.[0-9]+\\.[0-9]+)/);\n      if (match?.[1]) {\n        return match[1]; // Return just the version number\n      }\n      return versionOutput; // Return full output if we couldn't parse it\n    }\n    return undefined;\n  } catch {\n    return undefined;\n  }\n}\n", "import { execFileSync } from 'child_process';\nimport { existsSync } from 'fs';\nimport { arch, platform } from 'os';\nimport { join, resolve } from 'path';\n\nimport { cdsExtractorMarkerFileName } from './constants';\nimport { dirExists } from './filesystem';\nimport { cdsExtractorLog } from './logging';\nimport { getPathsIgnorePatterns } from './paths-ignore';\n\n/**\n * Interface for platform information\n */\nexport interface PlatformInfo {\n  platform: string;\n  arch: string;\n  isWindows: boolean;\n  exeExtension: string;\n}\n\n/**\n * Interface for environment validation results\n */\nexport interface EnvironmentSetupResult {\n  success: boolean;\n  errorMessages: string[];\n  codeqlExePath: string;\n  jsExtractorRoot: string;\n  autobuildScriptPath: string;\n  platformInfo: PlatformInfo;\n}\n\n/**\n * Get platform information\n * @returns Platform information including OS platform, architecture, and whether it's Windows\n */\nexport function getPlatformInfo(): PlatformInfo {\n  const osPlatform: string = platform();\n  const osPlatformArch: string = arch();\n  const isWindows = osPlatform === 'win32';\n  const exeExtension = isWindows ? '.exe' : '';\n\n  return {\n    platform: osPlatform,\n    arch: osPlatformArch,\n    isWindows,\n    exeExtension,\n  };\n}\n\n/**\n * Returns the platform-specific `npm` executable name.\n * On Windows, npm is a `.cmd` script that requires the full name for\n * `execFileSync`/`spawnSync` when `shell` is `false`.\n *\n * @returns `'npm.cmd'` on Windows, `'npm'` elsewhere.\n */\nexport function npmExecutable(): string {\n  return getPlatformInfo().isWindows ? 'npm.cmd' : 'npm';\n}\n\n/**\n * Returns the platform-specific `npx` executable name.\n * On Windows, npx is a `.cmd` script that requires the full name for\n * `execFileSync`/`spawnSync` when `shell` is `false`.\n *\n * @returns `'npx.cmd'` on Windows, `'npx'` elsewhere.\n */\nexport function npxExecutable(): string {\n  return getPlatformInfo().isWindows ? 'npx.cmd' : 'npx';\n}\n\n/**\n * Get the path to the CodeQL executable.\n * Prioritizes CODEQL_DIST if set and valid. Otherwise, tries to find CodeQL via system PATH.\n * @returns The resolved path to the CodeQL executable, or an empty string if not found.\n */\nexport function getCodeQLExePath(): string {\n  const platformInfo = getPlatformInfo();\n  const codeqlExeName: string = platformInfo.isWindows ? 'codeql.exe' : 'codeql';\n\n  // First, check if CODEQL_DIST is set and valid\n  const codeqlDist = process.env.CODEQL_DIST;\n  if (codeqlDist) {\n    const codeqlPathFromDist = resolve(join(codeqlDist, codeqlExeName));\n    if (existsSync(codeqlPathFromDist)) {\n      cdsExtractorLog('info', `Using CodeQL executable from CODEQL_DIST: ${codeqlPathFromDist}`);\n      return codeqlPathFromDist;\n    } else {\n      cdsExtractorLog(\n        'error',\n        `CODEQL_DIST is set to '${codeqlDist}', but CodeQL executable was not found at '${codeqlPathFromDist}'. Please ensure this path is correct. Falling back to PATH-based discovery.`,\n      );\n      // Fall through to PATH-based discovery\n    }\n  }\n\n  // CODEQL_DIST is not set or was invalid, attempt to find CodeQL via system PATH using 'codeql version --format=json'\n  cdsExtractorLog(\n    'info',\n    'CODEQL_DIST environment variable not set or invalid. Attempting to find CodeQL executable via system PATH using \"codeql version --format=json\".',\n  );\n  try {\n    const versionOutput = execFileSync(codeqlExeName, ['version', '--format=json'], {\n      encoding: 'utf8',\n      timeout: 5000, // 5 seconds timeout\n      stdio: 'pipe', // Suppress output to console\n    });\n\n    interface CodeQLVersionInfo {\n      unpackedLocation?: string;\n      cliVersion?: string; // For potential future use or richer logging\n    }\n\n    try {\n      const versionInfo = JSON.parse(versionOutput) as CodeQLVersionInfo;\n\n      if (\n        versionInfo &&\n        typeof versionInfo.unpackedLocation === 'string' &&\n        versionInfo.unpackedLocation\n      ) {\n        const resolvedPathFromVersion = resolve(join(versionInfo.unpackedLocation, codeqlExeName));\n        if (existsSync(resolvedPathFromVersion)) {\n          cdsExtractorLog(\n            'info',\n            `CodeQL executable found via 'codeql version --format=json' at: ${resolvedPathFromVersion}`,\n          );\n          return resolvedPathFromVersion;\n        }\n        cdsExtractorLog(\n          'warn',\n          `'codeql version --format=json' provided unpackedLocation '${versionInfo.unpackedLocation}', but executable not found at '${resolvedPathFromVersion}'.`,\n        );\n      } else {\n        cdsExtractorLog(\n          'warn',\n          \"Could not determine CodeQL executable path from 'codeql version --format=json' output. 'unpackedLocation' field missing, empty, or invalid.\",\n        );\n      }\n    } catch (parseError) {\n      cdsExtractorLog(\n        'warn',\n        `Failed to parse 'codeql version --format=json' output: ${String(parseError)}. Output was: ${versionOutput}`,\n      );\n    }\n  } catch (error) {\n    let errorMessage = `INFO: Failed to find CodeQL executable via 'codeql version --format=json'. Error: ${String(error)}`;\n    if (error && typeof error === 'object' && 'code' in error && error.code === 'ENOENT') {\n      errorMessage += `\\nINFO: The command '${codeqlExeName}' was not found in your system PATH.`;\n    }\n    cdsExtractorLog('info', errorMessage);\n  }\n\n  cdsExtractorLog(\n    'error',\n    'Failed to determine CodeQL executable path. Please ensure the CODEQL_DIST environment variable is set and points to a valid CodeQL distribution, or that the CodeQL CLI (codeql) is available in your system PATH and \"codeql version --format=json\" can provide its location.',\n  );\n  return ''; // Return empty string if all attempts fail\n}\n\n/**\n * Get the JavaScript extractor root path.\n * @param codeqlExePath The path to the CodeQL executable. If empty, resolution will be skipped.\n * @returns The JavaScript extractor root path, or an empty string if not found or if codeqlExePath is empty.\n */\nexport function getJavaScriptExtractorRoot(codeqlExePath: string): string {\n  let jsExtractorRoot = process.env.CODEQL_EXTRACTOR_JAVASCRIPT_ROOT ?? '';\n\n  if (jsExtractorRoot) {\n    cdsExtractorLog(\n      'info',\n      `Using JavaScript extractor root from environment variable CODEQL_EXTRACTOR_JAVASCRIPT_ROOT: ${jsExtractorRoot}`,\n    );\n    return jsExtractorRoot;\n  }\n\n  if (!codeqlExePath) {\n    cdsExtractorLog(\n      'warn',\n      'Cannot resolve JavaScript extractor root because the CodeQL executable path was not provided or found.',\n    );\n    return '';\n  }\n\n  try {\n    jsExtractorRoot = execFileSync(\n      codeqlExePath,\n      ['resolve', 'extractor', '--language=javascript'],\n      { stdio: 'pipe' }, // Suppress output from the command itself\n    )\n      .toString()\n      .trim();\n    if (jsExtractorRoot) {\n      cdsExtractorLog('info', `JavaScript extractor root resolved to: ${jsExtractorRoot}`);\n    } else {\n      cdsExtractorLog(\n        'warn',\n        `'codeql resolve extractor --language=javascript' using '${codeqlExePath}' returned an empty path.`,\n      );\n    }\n  } catch (error) {\n    cdsExtractorLog(\n      'error',\n      `Error resolving JavaScript extractor root using '${codeqlExePath}': ${String(error)}`,\n    );\n    jsExtractorRoot = ''; // Ensure it's empty on error\n  }\n  return jsExtractorRoot;\n}\n\n/**\n * Set JavaScript extractor environment variables using CDS extractor variables\n */\nexport function setupJavaScriptExtractorEnv(): void {\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_WIP_DATABASE =\n    process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_DIAGNOSTIC_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_DIAGNOSTIC_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_LOG_DIR = process.env.CODEQL_EXTRACTOR_CDS_LOG_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_SCRATCH_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_SCRATCH_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_TRAP_DIR = process.env.CODEQL_EXTRACTOR_CDS_TRAP_DIR;\n  process.env.CODEQL_EXTRACTOR_JAVASCRIPT_SOURCE_ARCHIVE_DIR =\n    process.env.CODEQL_EXTRACTOR_CDS_SOURCE_ARCHIVE_DIR;\n}\n\n/**\n * Get the path to the autobuild script\n * @param jsExtractorRoot The JavaScript extractor root path\n * @returns The path to the autobuild script, or an empty string if jsExtractorRoot is empty.\n */\nexport function getAutobuildScriptPath(jsExtractorRoot: string): string {\n  if (!jsExtractorRoot) return '';\n  const platformInfo = getPlatformInfo();\n  const autobuildScriptName: string = platformInfo.isWindows ? 'autobuild.cmd' : 'autobuild.sh';\n  return resolve(join(jsExtractorRoot, 'tools', autobuildScriptName));\n}\n\n/**\n * Configure LGTM index filters for CDS files\n */\nexport function configureLgtmIndexFilters(): void {\n  let excludeFilters = '';\n\n  if (process.env.LGTM_INDEX_FILTERS) {\n    cdsExtractorLog(\n      'info',\n      `Found $LGTM_INDEX_FILTERS already set to:\n${process.env.LGTM_INDEX_FILTERS}`,\n    );\n    // Use forward slashes explicitly \u2014 join() uses backslashes on Windows\n    // which causes 'Illegal use of **' errors in the JS extractor.\n    const allowedExcludePatterns = ['exclude:**/*', 'exclude:**/*.*'];\n\n    excludeFilters =\n      '\\n' +\n      process.env.LGTM_INDEX_FILTERS.split('\\n')\n        .filter(\n          line =>\n            line.startsWith('exclude') &&\n            !allowedExcludePatterns.some(pattern => line.includes(pattern)),\n        )\n        .join('\\n');\n  }\n\n  // Enable extraction of the .cds.json files only.\n  //\n  // The cdsExtractorMarkerFileName file is auto-created by the CDS extractor in order\n  // to force the underlying JS extractor to see at least one .js file, which became a\n  // requirement starting with v2.23.5 of the CodeQL CLI.\n  // Use forward slashes explicitly \u2014 join() uses backslashes on Windows\n  // which causes 'Illegal use of **' errors in the JS extractor.\n  const lgtmIndexFiltersPatterns = [\n    'exclude:**/*.*',\n    'include:**/*.cds.json',\n    'include:**/*.cds',\n    `include:**/${cdsExtractorMarkerFileName}`,\n    'exclude:**/node_modules/**/*.*',\n  ].join('\\n');\n\n  process.env.LGTM_INDEX_FILTERS = lgtmIndexFiltersPatterns + excludeFilters;\n  process.env.LGTM_INDEX_TYPESCRIPT = 'NONE';\n  // Configure to copy over the .cds files as well, by pretending they are JSON.\n  process.env.LGTM_INDEX_FILETYPES = '.cds:JSON';\n}\n\n/**\n * Applies paths-ignore patterns from the CodeQL configuration to the\n * LGTM_INDEX_FILTERS environment variable. This ensures the JavaScript\n * extractor also respects the user's paths-ignore configuration for\n * compiled .cds.json output files.\n *\n * @param sourceRoot - The source root directory used to locate the config file\n */\nexport function applyPathsIgnoreToLgtmFilters(sourceRoot: string): void {\n  const patterns = getPathsIgnorePatterns(sourceRoot);\n  if (patterns.length === 0) {\n    return;\n  }\n\n  const excludeLines = patterns.map(p => `exclude:${p}`).join('\\n');\n  const current = process.env.LGTM_INDEX_FILTERS ?? '';\n  process.env.LGTM_INDEX_FILTERS = current + '\\n' + excludeLines;\n\n  cdsExtractorLog(\n    'info',\n    `Applied ${patterns.length} paths-ignore pattern(s) to LGTM_INDEX_FILTERS`,\n  );\n}\n\n/**\n * Sets up the environment and validates key components for running the CDS extractor.\n * This includes checking for the CodeQL executable, validating the source root directory,\n * and setting up environment variables for the JavaScript extractor.\n *\n * @param sourceRoot The source root directory.\n *\n * @returns The {@link EnvironmentSetupResult} containing success status, error messages,\n *          CodeQL executable path, JavaScript extractor root, autobuild script path,\n *          and platform information.\n *\n * @throws Will throw an error if the environment setup fails.\n */\nexport function setupAndValidateEnvironment(sourceRoot: string): EnvironmentSetupResult {\n  const errorMessages: string[] = [];\n  const platformInfo = getPlatformInfo();\n\n  // Get the CodeQL executable path\n  const codeqlExePath = getCodeQLExePath();\n  if (!codeqlExePath) {\n    errorMessages.push(\n      'Failed to find CodeQL executable. Ensure CODEQL_DIST is set and valid, or CodeQL CLI is in PATH.',\n    );\n  }\n\n  // Validate that the required source root directory exists\n  if (!dirExists(sourceRoot)) {\n    errorMessages.push(`Project root directory '${sourceRoot}' does not exist.`);\n  }\n\n  // Get JavaScript extractor root\n  const jsExtractorRoot = getJavaScriptExtractorRoot(codeqlExePath);\n  if (!jsExtractorRoot) {\n    if (codeqlExePath) {\n      // Only add this error if codeqlExePath was found but JS extractor root wasn't\n      errorMessages.push(\n        'Failed to determine JavaScript extractor root using the found CodeQL executable.',\n      );\n    } else {\n      // If codeqlExePath is empty, the error from getCodeQLExePath is usually sufficient.\n      // However, we can add a more specific one if needed.\n      errorMessages.push(\n        'Cannot determine JavaScript extractor root because CodeQL executable was not found.',\n      );\n    }\n  }\n\n  // Set environment variables for JavaScript extractor only if jsExtractorRoot is valid\n  if (jsExtractorRoot) {\n    process.env.CODEQL_EXTRACTOR_JAVASCRIPT_ROOT = jsExtractorRoot;\n    setupJavaScriptExtractorEnv();\n  }\n\n  // Get autobuild script path\n  const autobuildScriptPath = jsExtractorRoot ? getAutobuildScriptPath(jsExtractorRoot) : '';\n  // Not having an autobuild script path might be an error depending on the run mode,\n  // but for now, the function just returns what it found.\n\n  return {\n    success: errorMessages.length === 0,\n    errorMessages,\n    codeqlExePath, // Will be '' if not found\n    jsExtractorRoot, // Will be '' if not found\n    autobuildScriptPath,\n    platformInfo,\n  };\n}\n", "import { existsSync, readFileSync } from 'fs';\nimport { join, relative, resolve } from 'path';\n\nimport { load as yamlLoad } from 'js-yaml';\nimport { minimatch } from 'minimatch';\n\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Well-known paths where a CodeQL configuration file may be located,\n * relative to the source root directory. Checked in order of priority.\n */\nconst DEFAULT_CONFIG_RELATIVE_PATHS = [\n  '.github/codeql/codeql-config.yml',\n  '.github/codeql/codeql-config.yaml',\n];\n\n/**\n * Cache for parsed paths-ignore patterns, keyed by source root.\n * Avoids re-reading and re-parsing the config file on every call.\n */\nconst patternsCache = new Map<string, string[]>();\n\n/**\n * Shape of the subset of a CodeQL configuration file that we care about.\n */\ninterface CodeqlConfig {\n  'paths-ignore'?: string[];\n}\n\n/**\n * Finds the CodeQL configuration file in the source root directory.\n *\n * When the `CODEQL_CONFIG_PATH` environment variable is set, its value\n * is treated as a path (relative to `sourceRoot`) to the config file.\n * The resolved path must reside under `sourceRoot`; otherwise it is\n * rejected to prevent path-traversal issues.\n *\n * When the environment variable is not set, the well-known default\n * paths are checked in order.\n *\n * @param sourceRoot - The source root directory\n * @returns The absolute path to the config file, or undefined if not found\n */\nexport function findCodeqlConfigFile(sourceRoot: string): string | undefined {\n  const envConfigPath = process.env.CODEQL_CONFIG_PATH;\n  if (envConfigPath) {\n    const resolvedRoot = resolve(sourceRoot);\n    const fullPath = resolve(resolvedRoot, envConfigPath);\n    const rel = relative(resolvedRoot, fullPath);\n    if (rel.startsWith('..') || resolve(resolvedRoot, rel) !== fullPath) {\n      cdsExtractorLog(\n        'warn',\n        `CODEQL_CONFIG_PATH '${envConfigPath}' resolves outside the source root. Ignoring.`,\n      );\n      return undefined;\n    }\n    if (existsSync(fullPath)) {\n      cdsExtractorLog('info', `Using CodeQL config file from CODEQL_CONFIG_PATH: ${fullPath}`);\n      return fullPath;\n    }\n    cdsExtractorLog(\n      'warn',\n      `CODEQL_CONFIG_PATH is set to '${envConfigPath}', but no file exists at '${fullPath}'.`,\n    );\n    return undefined;\n  }\n\n  for (const configPath of DEFAULT_CONFIG_RELATIVE_PATHS) {\n    const fullPath = join(sourceRoot, configPath);\n    if (existsSync(fullPath)) {\n      return fullPath;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Reads the CodeQL configuration file and extracts the `paths-ignore`\n * patterns list.\n *\n * @param sourceRoot - The source root directory\n * @returns Array of paths-ignore glob patterns, or empty array if none\n */\nexport function getPathsIgnorePatterns(sourceRoot: string): string[] {\n  const cached = patternsCache.get(sourceRoot);\n  if (cached !== undefined) {\n    return cached;\n  }\n\n  const configPath = findCodeqlConfigFile(sourceRoot);\n  if (!configPath) {\n    patternsCache.set(sourceRoot, []);\n    return [];\n  }\n\n  try {\n    const content = readFileSync(configPath, 'utf8');\n    const config = yamlLoad(content) as CodeqlConfig | null;\n\n    if (!config || !Array.isArray(config['paths-ignore'])) {\n      patternsCache.set(sourceRoot, []);\n      return [];\n    }\n\n    const patterns = config['paths-ignore'].filter(\n      (p): p is string => typeof p === 'string' && p.length > 0,\n    );\n\n    if (patterns.length > 0) {\n      cdsExtractorLog(\n        'info',\n        `Found ${patterns.length} paths-ignore pattern(s) in ${configPath}: ${patterns.join(', ')}`,\n      );\n    }\n\n    patternsCache.set(sourceRoot, patterns);\n    return patterns;\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to read CodeQL config file at ${configPath}: ${String(error)}`);\n    patternsCache.set(sourceRoot, []);\n    return [];\n  }\n}\n\n/**\n * Tests whether a single relative file path matches any of the given\n * paths-ignore patterns.\n *\n * Pattern matching follows the CodeQL `paths-ignore` semantics:\n *  - A bare directory name `vendor` matches anything under `vendor/`\n *  - `**` matches across directory boundaries\n *  - `*` matches within a single path segment\n *\n * @param relativePath - File path relative to the source root\n * @param patterns     - Array of paths-ignore glob patterns\n * @returns true if the path should be ignored\n */\nexport function shouldIgnorePath(relativePath: string, patterns: string[]): boolean {\n  const matchOptions = { dot: true, windowsPathsNoEscape: true };\n\n  for (const raw of patterns) {\n    // Strip trailing slashes so `vendor/` is treated the same as `vendor`\n    const pattern = raw.replace(/\\/+$/, '');\n\n    // Direct minimatch check\n    if (minimatch(relativePath, pattern, matchOptions)) {\n      return true;\n    }\n\n    // Also match as a directory prefix: pattern `vendor` should\n    // match `vendor/lib/foo.cds` (i.e. anything nested underneath).\n    if (minimatch(relativePath, `${pattern}/**`, matchOptions)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Filters a list of relative file paths, removing any that match the\n * given paths-ignore patterns.\n *\n * @param relativePaths - File paths relative to the source root\n * @param patterns      - Array of paths-ignore glob patterns\n * @returns Filtered list of paths that do NOT match any ignore pattern\n */\nexport function filterIgnoredPaths(relativePaths: string[], patterns: string[]): string[] {\n  if (patterns.length === 0) {\n    return relativePaths;\n  }\n  return relativePaths.filter(p => !shouldIgnorePath(p, patterns));\n}\n\n/**\n * Clears the internal patterns cache. Intended for testing only.\n */\nexport function clearPathsIgnoreCache(): void {\n  patternsCache.clear();\n}\n", "\n/*! js-yaml 4.1.1 https://github.com/nodeca/js-yaml @license MIT */\nfunction isNothing(subject) {\n  return (typeof subject === 'undefined') || (subject === null);\n}\n\n\nfunction isObject(subject) {\n  return (typeof subject === 'object') && (subject !== null);\n}\n\n\nfunction toArray(sequence) {\n  if (Array.isArray(sequence)) return sequence;\n  else if (isNothing(sequence)) return [];\n\n  return [ sequence ];\n}\n\n\nfunction extend(target, source) {\n  var index, length, key, sourceKeys;\n\n  if (source) {\n    sourceKeys = Object.keys(source);\n\n    for (index = 0, length = sourceKeys.length; index < length; index += 1) {\n      key = sourceKeys[index];\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}\n\n\nfunction repeat(string, count) {\n  var result = '', cycle;\n\n  for (cycle = 0; cycle < count; cycle += 1) {\n    result += string;\n  }\n\n  return result;\n}\n\n\nfunction isNegativeZero(number) {\n  return (number === 0) && (Number.NEGATIVE_INFINITY === 1 / number);\n}\n\n\nvar isNothing_1      = isNothing;\nvar isObject_1       = isObject;\nvar toArray_1        = toArray;\nvar repeat_1         = repeat;\nvar isNegativeZero_1 = isNegativeZero;\nvar extend_1         = extend;\n\nvar common = {\n\tisNothing: isNothing_1,\n\tisObject: isObject_1,\n\ttoArray: toArray_1,\n\trepeat: repeat_1,\n\tisNegativeZero: isNegativeZero_1,\n\textend: extend_1\n};\n\n// YAML error class. http://stackoverflow.com/questions/8458984\n\n\nfunction formatError(exception, compact) {\n  var where = '', message = exception.reason || '(unknown reason)';\n\n  if (!exception.mark) return message;\n\n  if (exception.mark.name) {\n    where += 'in \"' + exception.mark.name + '\" ';\n  }\n\n  where += '(' + (exception.mark.line + 1) + ':' + (exception.mark.column + 1) + ')';\n\n  if (!compact && exception.mark.snippet) {\n    where += '\\n\\n' + exception.mark.snippet;\n  }\n\n  return message + ' ' + where;\n}\n\n\nfunction YAMLException$1(reason, mark) {\n  // Super constructor\n  Error.call(this);\n\n  this.name = 'YAMLException';\n  this.reason = reason;\n  this.mark = mark;\n  this.message = formatError(this, false);\n\n  // Include stack trace in error object\n  if (Error.captureStackTrace) {\n    // Chrome and NodeJS\n    Error.captureStackTrace(this, this.constructor);\n  } else {\n    // FF, IE 10+ and Safari 6+. Fallback for others\n    this.stack = (new Error()).stack || '';\n  }\n}\n\n\n// Inherit from Error\nYAMLException$1.prototype = Object.create(Error.prototype);\nYAMLException$1.prototype.constructor = YAMLException$1;\n\n\nYAMLException$1.prototype.toString = function toString(compact) {\n  return this.name + ': ' + formatError(this, compact);\n};\n\n\nvar exception = YAMLException$1;\n\n// get snippet for a single line, respecting maxLength\nfunction getLine(buffer, lineStart, lineEnd, position, maxLineLength) {\n  var head = '';\n  var tail = '';\n  var maxHalfLength = Math.floor(maxLineLength / 2) - 1;\n\n  if (position - lineStart > maxHalfLength) {\n    head = ' ... ';\n    lineStart = position - maxHalfLength + head.length;\n  }\n\n  if (lineEnd - position > maxHalfLength) {\n    tail = ' ...';\n    lineEnd = position + maxHalfLength - tail.length;\n  }\n\n  return {\n    str: head + buffer.slice(lineStart, lineEnd).replace(/\\t/g, '\u2192') + tail,\n    pos: position - lineStart + head.length // relative position\n  };\n}\n\n\nfunction padStart(string, max) {\n  return common.repeat(' ', max - string.length) + string;\n}\n\n\nfunction makeSnippet(mark, options) {\n  options = Object.create(options || null);\n\n  if (!mark.buffer) return null;\n\n  if (!options.maxLength) options.maxLength = 79;\n  if (typeof options.indent      !== 'number') options.indent      = 1;\n  if (typeof options.linesBefore !== 'number') options.linesBefore = 3;\n  if (typeof options.linesAfter  !== 'number') options.linesAfter  = 2;\n\n  var re = /\\r?\\n|\\r|\\0/g;\n  var lineStarts = [ 0 ];\n  var lineEnds = [];\n  var match;\n  var foundLineNo = -1;\n\n  while ((match = re.exec(mark.buffer))) {\n    lineEnds.push(match.index);\n    lineStarts.push(match.index + match[0].length);\n\n    if (mark.position <= match.index && foundLineNo < 0) {\n      foundLineNo = lineStarts.length - 2;\n    }\n  }\n\n  if (foundLineNo < 0) foundLineNo = lineStarts.length - 1;\n\n  var result = '', i, line;\n  var lineNoLength = Math.min(mark.line + options.linesAfter, lineEnds.length).toString().length;\n  var maxLineLength = options.maxLength - (options.indent + lineNoLength + 3);\n\n  for (i = 1; i <= options.linesBefore; i++) {\n    if (foundLineNo - i < 0) break;\n    line = getLine(\n      mark.buffer,\n      lineStarts[foundLineNo - i],\n      lineEnds[foundLineNo - i],\n      mark.position - (lineStarts[foundLineNo] - lineStarts[foundLineNo - i]),\n      maxLineLength\n    );\n    result = common.repeat(' ', options.indent) + padStart((mark.line - i + 1).toString(), lineNoLength) +\n      ' | ' + line.str + '\\n' + result;\n  }\n\n  line = getLine(mark.buffer, lineStarts[foundLineNo], lineEnds[foundLineNo], mark.position, maxLineLength);\n  result += common.repeat(' ', options.indent) + padStart((mark.line + 1).toString(), lineNoLength) +\n    ' | ' + line.str + '\\n';\n  result += common.repeat('-', options.indent + lineNoLength + 3 + line.pos) + '^' + '\\n';\n\n  for (i = 1; i <= options.linesAfter; i++) {\n    if (foundLineNo + i >= lineEnds.length) break;\n    line = getLine(\n      mark.buffer,\n      lineStarts[foundLineNo + i],\n      lineEnds[foundLineNo + i],\n      mark.position - (lineStarts[foundLineNo] - lineStarts[foundLineNo + i]),\n      maxLineLength\n    );\n    result += common.repeat(' ', options.indent) + padStart((mark.line + i + 1).toString(), lineNoLength) +\n      ' | ' + line.str + '\\n';\n  }\n\n  return result.replace(/\\n$/, '');\n}\n\n\nvar snippet = makeSnippet;\n\nvar TYPE_CONSTRUCTOR_OPTIONS = [\n  'kind',\n  'multi',\n  'resolve',\n  'construct',\n  'instanceOf',\n  'predicate',\n  'represent',\n  'representName',\n  'defaultStyle',\n  'styleAliases'\n];\n\nvar YAML_NODE_KINDS = [\n  'scalar',\n  'sequence',\n  'mapping'\n];\n\nfunction compileStyleAliases(map) {\n  var result = {};\n\n  if (map !== null) {\n    Object.keys(map).forEach(function (style) {\n      map[style].forEach(function (alias) {\n        result[String(alias)] = style;\n      });\n    });\n  }\n\n  return result;\n}\n\nfunction Type$1(tag, options) {\n  options = options || {};\n\n  Object.keys(options).forEach(function (name) {\n    if (TYPE_CONSTRUCTOR_OPTIONS.indexOf(name) === -1) {\n      throw new exception('Unknown option \"' + name + '\" is met in definition of \"' + tag + '\" YAML type.');\n    }\n  });\n\n  // TODO: Add tag format check.\n  this.options       = options; // keep original options in case user wants to extend this type later\n  this.tag           = tag;\n  this.kind          = options['kind']          || null;\n  this.resolve       = options['resolve']       || function () { return true; };\n  this.construct     = options['construct']     || function (data) { return data; };\n  this.instanceOf    = options['instanceOf']    || null;\n  this.predicate     = options['predicate']     || null;\n  this.represent     = options['represent']     || null;\n  this.representName = options['representName'] || null;\n  this.defaultStyle  = options['defaultStyle']  || null;\n  this.multi         = options['multi']         || false;\n  this.styleAliases  = compileStyleAliases(options['styleAliases'] || null);\n\n  if (YAML_NODE_KINDS.indexOf(this.kind) === -1) {\n    throw new exception('Unknown kind \"' + this.kind + '\" is specified for \"' + tag + '\" YAML type.');\n  }\n}\n\nvar type = Type$1;\n\n/*eslint-disable max-len*/\n\n\n\n\n\nfunction compileList(schema, name) {\n  var result = [];\n\n  schema[name].forEach(function (currentType) {\n    var newIndex = result.length;\n\n    result.forEach(function (previousType, previousIndex) {\n      if (previousType.tag === currentType.tag &&\n          previousType.kind === currentType.kind &&\n          previousType.multi === currentType.multi) {\n\n        newIndex = previousIndex;\n      }\n    });\n\n    result[newIndex] = currentType;\n  });\n\n  return result;\n}\n\n\nfunction compileMap(/* lists... */) {\n  var result = {\n        scalar: {},\n        sequence: {},\n        mapping: {},\n        fallback: {},\n        multi: {\n          scalar: [],\n          sequence: [],\n          mapping: [],\n          fallback: []\n        }\n      }, index, length;\n\n  function collectType(type) {\n    if (type.multi) {\n      result.multi[type.kind].push(type);\n      result.multi['fallback'].push(type);\n    } else {\n      result[type.kind][type.tag] = result['fallback'][type.tag] = type;\n    }\n  }\n\n  for (index = 0, length = arguments.length; index < length; index += 1) {\n    arguments[index].forEach(collectType);\n  }\n  return result;\n}\n\n\nfunction Schema$1(definition) {\n  return this.extend(definition);\n}\n\n\nSchema$1.prototype.extend = function extend(definition) {\n  var implicit = [];\n  var explicit = [];\n\n  if (definition instanceof type) {\n    // Schema.extend(type)\n    explicit.push(definition);\n\n  } else if (Array.isArray(definition)) {\n    // Schema.extend([ type1, type2, ... ])\n    explicit = explicit.concat(definition);\n\n  } else if (definition && (Array.isArray(definition.implicit) || Array.isArray(definition.explicit))) {\n    // Schema.extend({ explicit: [ type1, type2, ... ], implicit: [ type1, type2, ... ] })\n    if (definition.implicit) implicit = implicit.concat(definition.implicit);\n    if (definition.explicit) explicit = explicit.concat(definition.explicit);\n\n  } else {\n    throw new exception('Schema.extend argument should be a Type, [ Type ], ' +\n      'or a schema definition ({ implicit: [...], explicit: [...] })');\n  }\n\n  implicit.forEach(function (type$1) {\n    if (!(type$1 instanceof type)) {\n      throw new exception('Specified list of YAML types (or a single Type object) contains a non-Type object.');\n    }\n\n    if (type$1.loadKind && type$1.loadKind !== 'scalar') {\n      throw new exception('There is a non-scalar type in the implicit list of a schema. Implicit resolving of such types is not supported.');\n    }\n\n    if (type$1.multi) {\n      throw new exception('There is a multi type in the implicit list of a schema. Multi tags can only be listed as explicit.');\n    }\n  });\n\n  explicit.forEach(function (type$1) {\n    if (!(type$1 instanceof type)) {\n      throw new exception('Specified list of YAML types (or a single Type object) contains a non-Type object.');\n    }\n  });\n\n  var result = Object.create(Schema$1.prototype);\n\n  result.implicit = (this.implicit || []).concat(implicit);\n  result.explicit = (this.explicit || []).concat(explicit);\n\n  result.compiledImplicit = compileList(result, 'implicit');\n  result.compiledExplicit = compileList(result, 'explicit');\n  result.compiledTypeMap  = compileMap(result.compiledImplicit, result.compiledExplicit);\n\n  return result;\n};\n\n\nvar schema = Schema$1;\n\nvar str = new type('tag:yaml.org,2002:str', {\n  kind: 'scalar',\n  construct: function (data) { return data !== null ? data : ''; }\n});\n\nvar seq = new type('tag:yaml.org,2002:seq', {\n  kind: 'sequence',\n  construct: function (data) { return data !== null ? data : []; }\n});\n\nvar map = new type('tag:yaml.org,2002:map', {\n  kind: 'mapping',\n  construct: function (data) { return data !== null ? data : {}; }\n});\n\nvar failsafe = new schema({\n  explicit: [\n    str,\n    seq,\n    map\n  ]\n});\n\nfunction resolveYamlNull(data) {\n  if (data === null) return true;\n\n  var max = data.length;\n\n  return (max === 1 && data === '~') ||\n         (max === 4 && (data === 'null' || data === 'Null' || data === 'NULL'));\n}\n\nfunction constructYamlNull() {\n  return null;\n}\n\nfunction isNull(object) {\n  return object === null;\n}\n\nvar _null = new type('tag:yaml.org,2002:null', {\n  kind: 'scalar',\n  resolve: resolveYamlNull,\n  construct: constructYamlNull,\n  predicate: isNull,\n  represent: {\n    canonical: function () { return '~';    },\n    lowercase: function () { return 'null'; },\n    uppercase: function () { return 'NULL'; },\n    camelcase: function () { return 'Null'; },\n    empty:     function () { return '';     }\n  },\n  defaultStyle: 'lowercase'\n});\n\nfunction resolveYamlBoolean(data) {\n  if (data === null) return false;\n\n  var max = data.length;\n\n  return (max === 4 && (data === 'true' || data === 'True' || data === 'TRUE')) ||\n         (max === 5 && (data === 'false' || data === 'False' || data === 'FALSE'));\n}\n\nfunction constructYamlBoolean(data) {\n  return data === 'true' ||\n         data === 'True' ||\n         data === 'TRUE';\n}\n\nfunction isBoolean(object) {\n  return Object.prototype.toString.call(object) === '[object Boolean]';\n}\n\nvar bool = new type('tag:yaml.org,2002:bool', {\n  kind: 'scalar',\n  resolve: resolveYamlBoolean,\n  construct: constructYamlBoolean,\n  predicate: isBoolean,\n  represent: {\n    lowercase: function (object) { return object ? 'true' : 'false'; },\n    uppercase: function (object) { return object ? 'TRUE' : 'FALSE'; },\n    camelcase: function (object) { return object ? 'True' : 'False'; }\n  },\n  defaultStyle: 'lowercase'\n});\n\nfunction isHexCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) ||\n         ((0x41/* A */ <= c) && (c <= 0x46/* F */)) ||\n         ((0x61/* a */ <= c) && (c <= 0x66/* f */));\n}\n\nfunction isOctCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x37/* 7 */));\n}\n\nfunction isDecCode(c) {\n  return ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */));\n}\n\nfunction resolveYamlInteger(data) {\n  if (data === null) return false;\n\n  var max = data.length,\n      index = 0,\n      hasDigits = false,\n      ch;\n\n  if (!max) return false;\n\n  ch = data[index];\n\n  // sign\n  if (ch === '-' || ch === '+') {\n    ch = data[++index];\n  }\n\n  if (ch === '0') {\n    // 0\n    if (index + 1 === max) return true;\n    ch = data[++index];\n\n    // base 2, base 8, base 16\n\n    if (ch === 'b') {\n      // base 2\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (ch !== '0' && ch !== '1') return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n\n\n    if (ch === 'x') {\n      // base 16\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (!isHexCode(data.charCodeAt(index))) return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n\n\n    if (ch === 'o') {\n      // base 8\n      index++;\n\n      for (; index < max; index++) {\n        ch = data[index];\n        if (ch === '_') continue;\n        if (!isOctCode(data.charCodeAt(index))) return false;\n        hasDigits = true;\n      }\n      return hasDigits && ch !== '_';\n    }\n  }\n\n  // base 10 (except 0)\n\n  // value should not start with `_`;\n  if (ch === '_') return false;\n\n  for (; index < max; index++) {\n    ch = data[index];\n    if (ch === '_') continue;\n    if (!isDecCode(data.charCodeAt(index))) {\n      return false;\n    }\n    hasDigits = true;\n  }\n\n  // Should have digits and should not end with `_`\n  if (!hasDigits || ch === '_') return false;\n\n  return true;\n}\n\nfunction constructYamlInteger(data) {\n  var value = data, sign = 1, ch;\n\n  if (value.indexOf('_') !== -1) {\n    value = value.replace(/_/g, '');\n  }\n\n  ch = value[0];\n\n  if (ch === '-' || ch === '+') {\n    if (ch === '-') sign = -1;\n    value = value.slice(1);\n    ch = value[0];\n  }\n\n  if (value === '0') return 0;\n\n  if (ch === '0') {\n    if (value[1] === 'b') return sign * parseInt(value.slice(2), 2);\n    if (value[1] === 'x') return sign * parseInt(value.slice(2), 16);\n    if (value[1] === 'o') return sign * parseInt(value.slice(2), 8);\n  }\n\n  return sign * parseInt(value, 10);\n}\n\nfunction isInteger(object) {\n  return (Object.prototype.toString.call(object)) === '[object Number]' &&\n         (object % 1 === 0 && !common.isNegativeZero(object));\n}\n\nvar int = new type('tag:yaml.org,2002:int', {\n  kind: 'scalar',\n  resolve: resolveYamlInteger,\n  construct: constructYamlInteger,\n  predicate: isInteger,\n  represent: {\n    binary:      function (obj) { return obj >= 0 ? '0b' + obj.toString(2) : '-0b' + obj.toString(2).slice(1); },\n    octal:       function (obj) { return obj >= 0 ? '0o'  + obj.toString(8) : '-0o'  + obj.toString(8).slice(1); },\n    decimal:     function (obj) { return obj.toString(10); },\n    /* eslint-disable max-len */\n    hexadecimal: function (obj) { return obj >= 0 ? '0x' + obj.toString(16).toUpperCase() :  '-0x' + obj.toString(16).toUpperCase().slice(1); }\n  },\n  defaultStyle: 'decimal',\n  styleAliases: {\n    binary:      [ 2,  'bin' ],\n    octal:       [ 8,  'oct' ],\n    decimal:     [ 10, 'dec' ],\n    hexadecimal: [ 16, 'hex' ]\n  }\n});\n\nvar YAML_FLOAT_PATTERN = new RegExp(\n  // 2.5e4, 2.5 and integers\n  '^(?:[-+]?(?:[0-9][0-9_]*)(?:\\\\.[0-9_]*)?(?:[eE][-+]?[0-9]+)?' +\n  // .2e4, .2\n  // special case, seems not from spec\n  '|\\\\.[0-9_]+(?:[eE][-+]?[0-9]+)?' +\n  // .inf\n  '|[-+]?\\\\.(?:inf|Inf|INF)' +\n  // .nan\n  '|\\\\.(?:nan|NaN|NAN))$');\n\nfunction resolveYamlFloat(data) {\n  if (data === null) return false;\n\n  if (!YAML_FLOAT_PATTERN.test(data) ||\n      // Quick hack to not allow integers end with `_`\n      // Probably should update regexp & check speed\n      data[data.length - 1] === '_') {\n    return false;\n  }\n\n  return true;\n}\n\nfunction constructYamlFloat(data) {\n  var value, sign;\n\n  value  = data.replace(/_/g, '').toLowerCase();\n  sign   = value[0] === '-' ? -1 : 1;\n\n  if ('+-'.indexOf(value[0]) >= 0) {\n    value = value.slice(1);\n  }\n\n  if (value === '.inf') {\n    return (sign === 1) ? Number.POSITIVE_INFINITY : Number.NEGATIVE_INFINITY;\n\n  } else if (value === '.nan') {\n    return NaN;\n  }\n  return sign * parseFloat(value, 10);\n}\n\n\nvar SCIENTIFIC_WITHOUT_DOT = /^[-+]?[0-9]+e/;\n\nfunction representYamlFloat(object, style) {\n  var res;\n\n  if (isNaN(object)) {\n    switch (style) {\n      case 'lowercase': return '.nan';\n      case 'uppercase': return '.NAN';\n      case 'camelcase': return '.NaN';\n    }\n  } else if (Number.POSITIVE_INFINITY === object) {\n    switch (style) {\n      case 'lowercase': return '.inf';\n      case 'uppercase': return '.INF';\n      case 'camelcase': return '.Inf';\n    }\n  } else if (Number.NEGATIVE_INFINITY === object) {\n    switch (style) {\n      case 'lowercase': return '-.inf';\n      case 'uppercase': return '-.INF';\n      case 'camelcase': return '-.Inf';\n    }\n  } else if (common.isNegativeZero(object)) {\n    return '-0.0';\n  }\n\n  res = object.toString(10);\n\n  // JS stringifier can build scientific format without dots: 5e-100,\n  // while YAML requres dot: 5.e-100. Fix it with simple hack\n\n  return SCIENTIFIC_WITHOUT_DOT.test(res) ? res.replace('e', '.e') : res;\n}\n\nfunction isFloat(object) {\n  return (Object.prototype.toString.call(object) === '[object Number]') &&\n         (object % 1 !== 0 || common.isNegativeZero(object));\n}\n\nvar float = new type('tag:yaml.org,2002:float', {\n  kind: 'scalar',\n  resolve: resolveYamlFloat,\n  construct: constructYamlFloat,\n  predicate: isFloat,\n  represent: representYamlFloat,\n  defaultStyle: 'lowercase'\n});\n\nvar json = failsafe.extend({\n  implicit: [\n    _null,\n    bool,\n    int,\n    float\n  ]\n});\n\nvar core = json;\n\nvar YAML_DATE_REGEXP = new RegExp(\n  '^([0-9][0-9][0-9][0-9])'          + // [1] year\n  '-([0-9][0-9])'                    + // [2] month\n  '-([0-9][0-9])$');                   // [3] day\n\nvar YAML_TIMESTAMP_REGEXP = new RegExp(\n  '^([0-9][0-9][0-9][0-9])'          + // [1] year\n  '-([0-9][0-9]?)'                   + // [2] month\n  '-([0-9][0-9]?)'                   + // [3] day\n  '(?:[Tt]|[ \\\\t]+)'                 + // ...\n  '([0-9][0-9]?)'                    + // [4] hour\n  ':([0-9][0-9])'                    + // [5] minute\n  ':([0-9][0-9])'                    + // [6] second\n  '(?:\\\\.([0-9]*))?'                 + // [7] fraction\n  '(?:[ \\\\t]*(Z|([-+])([0-9][0-9]?)' + // [8] tz [9] tz_sign [10] tz_hour\n  '(?::([0-9][0-9]))?))?$');           // [11] tz_minute\n\nfunction resolveYamlTimestamp(data) {\n  if (data === null) return false;\n  if (YAML_DATE_REGEXP.exec(data) !== null) return true;\n  if (YAML_TIMESTAMP_REGEXP.exec(data) !== null) return true;\n  return false;\n}\n\nfunction constructYamlTimestamp(data) {\n  var match, year, month, day, hour, minute, second, fraction = 0,\n      delta = null, tz_hour, tz_minute, date;\n\n  match = YAML_DATE_REGEXP.exec(data);\n  if (match === null) match = YAML_TIMESTAMP_REGEXP.exec(data);\n\n  if (match === null) throw new Error('Date resolve error');\n\n  // match: [1] year [2] month [3] day\n\n  year = +(match[1]);\n  month = +(match[2]) - 1; // JS month starts with 0\n  day = +(match[3]);\n\n  if (!match[4]) { // no hour\n    return new Date(Date.UTC(year, month, day));\n  }\n\n  // match: [4] hour [5] minute [6] second [7] fraction\n\n  hour = +(match[4]);\n  minute = +(match[5]);\n  second = +(match[6]);\n\n  if (match[7]) {\n    fraction = match[7].slice(0, 3);\n    while (fraction.length < 3) { // milli-seconds\n      fraction += '0';\n    }\n    fraction = +fraction;\n  }\n\n  // match: [8] tz [9] tz_sign [10] tz_hour [11] tz_minute\n\n  if (match[9]) {\n    tz_hour = +(match[10]);\n    tz_minute = +(match[11] || 0);\n    delta = (tz_hour * 60 + tz_minute) * 60000; // delta in mili-seconds\n    if (match[9] === '-') delta = -delta;\n  }\n\n  date = new Date(Date.UTC(year, month, day, hour, minute, second, fraction));\n\n  if (delta) date.setTime(date.getTime() - delta);\n\n  return date;\n}\n\nfunction representYamlTimestamp(object /*, style*/) {\n  return object.toISOString();\n}\n\nvar timestamp = new type('tag:yaml.org,2002:timestamp', {\n  kind: 'scalar',\n  resolve: resolveYamlTimestamp,\n  construct: constructYamlTimestamp,\n  instanceOf: Date,\n  represent: representYamlTimestamp\n});\n\nfunction resolveYamlMerge(data) {\n  return data === '<<' || data === null;\n}\n\nvar merge = new type('tag:yaml.org,2002:merge', {\n  kind: 'scalar',\n  resolve: resolveYamlMerge\n});\n\n/*eslint-disable no-bitwise*/\n\n\n\n\n\n// [ 64, 65, 66 ] -> [ padding, CR, LF ]\nvar BASE64_MAP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\\n\\r';\n\n\nfunction resolveYamlBinary(data) {\n  if (data === null) return false;\n\n  var code, idx, bitlen = 0, max = data.length, map = BASE64_MAP;\n\n  // Convert one by one.\n  for (idx = 0; idx < max; idx++) {\n    code = map.indexOf(data.charAt(idx));\n\n    // Skip CR/LF\n    if (code > 64) continue;\n\n    // Fail on illegal characters\n    if (code < 0) return false;\n\n    bitlen += 6;\n  }\n\n  // If there are any bits left, source was corrupted\n  return (bitlen % 8) === 0;\n}\n\nfunction constructYamlBinary(data) {\n  var idx, tailbits,\n      input = data.replace(/[\\r\\n=]/g, ''), // remove CR/LF & padding to simplify scan\n      max = input.length,\n      map = BASE64_MAP,\n      bits = 0,\n      result = [];\n\n  // Collect by 6*4 bits (3 bytes)\n\n  for (idx = 0; idx < max; idx++) {\n    if ((idx % 4 === 0) && idx) {\n      result.push((bits >> 16) & 0xFF);\n      result.push((bits >> 8) & 0xFF);\n      result.push(bits & 0xFF);\n    }\n\n    bits = (bits << 6) | map.indexOf(input.charAt(idx));\n  }\n\n  // Dump tail\n\n  tailbits = (max % 4) * 6;\n\n  if (tailbits === 0) {\n    result.push((bits >> 16) & 0xFF);\n    result.push((bits >> 8) & 0xFF);\n    result.push(bits & 0xFF);\n  } else if (tailbits === 18) {\n    result.push((bits >> 10) & 0xFF);\n    result.push((bits >> 2) & 0xFF);\n  } else if (tailbits === 12) {\n    result.push((bits >> 4) & 0xFF);\n  }\n\n  return new Uint8Array(result);\n}\n\nfunction representYamlBinary(object /*, style*/) {\n  var result = '', bits = 0, idx, tail,\n      max = object.length,\n      map = BASE64_MAP;\n\n  // Convert every three bytes to 4 ASCII characters.\n\n  for (idx = 0; idx < max; idx++) {\n    if ((idx % 3 === 0) && idx) {\n      result += map[(bits >> 18) & 0x3F];\n      result += map[(bits >> 12) & 0x3F];\n      result += map[(bits >> 6) & 0x3F];\n      result += map[bits & 0x3F];\n    }\n\n    bits = (bits << 8) + object[idx];\n  }\n\n  // Dump tail\n\n  tail = max % 3;\n\n  if (tail === 0) {\n    result += map[(bits >> 18) & 0x3F];\n    result += map[(bits >> 12) & 0x3F];\n    result += map[(bits >> 6) & 0x3F];\n    result += map[bits & 0x3F];\n  } else if (tail === 2) {\n    result += map[(bits >> 10) & 0x3F];\n    result += map[(bits >> 4) & 0x3F];\n    result += map[(bits << 2) & 0x3F];\n    result += map[64];\n  } else if (tail === 1) {\n    result += map[(bits >> 2) & 0x3F];\n    result += map[(bits << 4) & 0x3F];\n    result += map[64];\n    result += map[64];\n  }\n\n  return result;\n}\n\nfunction isBinary(obj) {\n  return Object.prototype.toString.call(obj) ===  '[object Uint8Array]';\n}\n\nvar binary = new type('tag:yaml.org,2002:binary', {\n  kind: 'scalar',\n  resolve: resolveYamlBinary,\n  construct: constructYamlBinary,\n  predicate: isBinary,\n  represent: representYamlBinary\n});\n\nvar _hasOwnProperty$3 = Object.prototype.hasOwnProperty;\nvar _toString$2       = Object.prototype.toString;\n\nfunction resolveYamlOmap(data) {\n  if (data === null) return true;\n\n  var objectKeys = [], index, length, pair, pairKey, pairHasKey,\n      object = data;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n    pairHasKey = false;\n\n    if (_toString$2.call(pair) !== '[object Object]') return false;\n\n    for (pairKey in pair) {\n      if (_hasOwnProperty$3.call(pair, pairKey)) {\n        if (!pairHasKey) pairHasKey = true;\n        else return false;\n      }\n    }\n\n    if (!pairHasKey) return false;\n\n    if (objectKeys.indexOf(pairKey) === -1) objectKeys.push(pairKey);\n    else return false;\n  }\n\n  return true;\n}\n\nfunction constructYamlOmap(data) {\n  return data !== null ? data : [];\n}\n\nvar omap = new type('tag:yaml.org,2002:omap', {\n  kind: 'sequence',\n  resolve: resolveYamlOmap,\n  construct: constructYamlOmap\n});\n\nvar _toString$1 = Object.prototype.toString;\n\nfunction resolveYamlPairs(data) {\n  if (data === null) return true;\n\n  var index, length, pair, keys, result,\n      object = data;\n\n  result = new Array(object.length);\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n\n    if (_toString$1.call(pair) !== '[object Object]') return false;\n\n    keys = Object.keys(pair);\n\n    if (keys.length !== 1) return false;\n\n    result[index] = [ keys[0], pair[keys[0]] ];\n  }\n\n  return true;\n}\n\nfunction constructYamlPairs(data) {\n  if (data === null) return [];\n\n  var index, length, pair, keys, result,\n      object = data;\n\n  result = new Array(object.length);\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    pair = object[index];\n\n    keys = Object.keys(pair);\n\n    result[index] = [ keys[0], pair[keys[0]] ];\n  }\n\n  return result;\n}\n\nvar pairs = new type('tag:yaml.org,2002:pairs', {\n  kind: 'sequence',\n  resolve: resolveYamlPairs,\n  construct: constructYamlPairs\n});\n\nvar _hasOwnProperty$2 = Object.prototype.hasOwnProperty;\n\nfunction resolveYamlSet(data) {\n  if (data === null) return true;\n\n  var key, object = data;\n\n  for (key in object) {\n    if (_hasOwnProperty$2.call(object, key)) {\n      if (object[key] !== null) return false;\n    }\n  }\n\n  return true;\n}\n\nfunction constructYamlSet(data) {\n  return data !== null ? data : {};\n}\n\nvar set = new type('tag:yaml.org,2002:set', {\n  kind: 'mapping',\n  resolve: resolveYamlSet,\n  construct: constructYamlSet\n});\n\nvar _default = core.extend({\n  implicit: [\n    timestamp,\n    merge\n  ],\n  explicit: [\n    binary,\n    omap,\n    pairs,\n    set\n  ]\n});\n\n/*eslint-disable max-len,no-use-before-define*/\n\n\n\n\n\n\n\nvar _hasOwnProperty$1 = Object.prototype.hasOwnProperty;\n\n\nvar CONTEXT_FLOW_IN   = 1;\nvar CONTEXT_FLOW_OUT  = 2;\nvar CONTEXT_BLOCK_IN  = 3;\nvar CONTEXT_BLOCK_OUT = 4;\n\n\nvar CHOMPING_CLIP  = 1;\nvar CHOMPING_STRIP = 2;\nvar CHOMPING_KEEP  = 3;\n\n\nvar PATTERN_NON_PRINTABLE         = /[\\x00-\\x08\\x0B\\x0C\\x0E-\\x1F\\x7F-\\x84\\x86-\\x9F\\uFFFE\\uFFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/;\nvar PATTERN_NON_ASCII_LINE_BREAKS = /[\\x85\\u2028\\u2029]/;\nvar PATTERN_FLOW_INDICATORS       = /[,\\[\\]\\{\\}]/;\nvar PATTERN_TAG_HANDLE            = /^(?:!|!!|![a-z\\-]+!)$/i;\nvar PATTERN_TAG_URI               = /^(?:!|[^,\\[\\]\\{\\}])(?:%[0-9a-f]{2}|[0-9a-z\\-#;\\/\\?:@&=\\+\\$,_\\.!~\\*'\\(\\)\\[\\]])*$/i;\n\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\n\nfunction is_EOL(c) {\n  return (c === 0x0A/* LF */) || (c === 0x0D/* CR */);\n}\n\nfunction is_WHITE_SPACE(c) {\n  return (c === 0x09/* Tab */) || (c === 0x20/* Space */);\n}\n\nfunction is_WS_OR_EOL(c) {\n  return (c === 0x09/* Tab */) ||\n         (c === 0x20/* Space */) ||\n         (c === 0x0A/* LF */) ||\n         (c === 0x0D/* CR */);\n}\n\nfunction is_FLOW_INDICATOR(c) {\n  return c === 0x2C/* , */ ||\n         c === 0x5B/* [ */ ||\n         c === 0x5D/* ] */ ||\n         c === 0x7B/* { */ ||\n         c === 0x7D/* } */;\n}\n\nfunction fromHexCode(c) {\n  var lc;\n\n  if ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) {\n    return c - 0x30;\n  }\n\n  /*eslint-disable no-bitwise*/\n  lc = c | 0x20;\n\n  if ((0x61/* a */ <= lc) && (lc <= 0x66/* f */)) {\n    return lc - 0x61 + 10;\n  }\n\n  return -1;\n}\n\nfunction escapedHexLen(c) {\n  if (c === 0x78/* x */) { return 2; }\n  if (c === 0x75/* u */) { return 4; }\n  if (c === 0x55/* U */) { return 8; }\n  return 0;\n}\n\nfunction fromDecimalCode(c) {\n  if ((0x30/* 0 */ <= c) && (c <= 0x39/* 9 */)) {\n    return c - 0x30;\n  }\n\n  return -1;\n}\n\nfunction simpleEscapeSequence(c) {\n  /* eslint-disable indent */\n  return (c === 0x30/* 0 */) ? '\\x00' :\n        (c === 0x61/* a */) ? '\\x07' :\n        (c === 0x62/* b */) ? '\\x08' :\n        (c === 0x74/* t */) ? '\\x09' :\n        (c === 0x09/* Tab */) ? '\\x09' :\n        (c === 0x6E/* n */) ? '\\x0A' :\n        (c === 0x76/* v */) ? '\\x0B' :\n        (c === 0x66/* f */) ? '\\x0C' :\n        (c === 0x72/* r */) ? '\\x0D' :\n        (c === 0x65/* e */) ? '\\x1B' :\n        (c === 0x20/* Space */) ? ' ' :\n        (c === 0x22/* \" */) ? '\\x22' :\n        (c === 0x2F/* / */) ? '/' :\n        (c === 0x5C/* \\ */) ? '\\x5C' :\n        (c === 0x4E/* N */) ? '\\x85' :\n        (c === 0x5F/* _ */) ? '\\xA0' :\n        (c === 0x4C/* L */) ? '\\u2028' :\n        (c === 0x50/* P */) ? '\\u2029' : '';\n}\n\nfunction charFromCodepoint(c) {\n  if (c <= 0xFFFF) {\n    return String.fromCharCode(c);\n  }\n  // Encode UTF-16 surrogate pair\n  // https://en.wikipedia.org/wiki/UTF-16#Code_points_U.2B010000_to_U.2B10FFFF\n  return String.fromCharCode(\n    ((c - 0x010000) >> 10) + 0xD800,\n    ((c - 0x010000) & 0x03FF) + 0xDC00\n  );\n}\n\n// set a property of a literal object, while protecting against prototype pollution,\n// see https://github.com/nodeca/js-yaml/issues/164 for more details\nfunction setProperty(object, key, value) {\n  // used for this specific key only because Object.defineProperty is slow\n  if (key === '__proto__') {\n    Object.defineProperty(object, key, {\n      configurable: true,\n      enumerable: true,\n      writable: true,\n      value: value\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nvar simpleEscapeCheck = new Array(256); // integer, for fast access\nvar simpleEscapeMap = new Array(256);\nfor (var i = 0; i < 256; i++) {\n  simpleEscapeCheck[i] = simpleEscapeSequence(i) ? 1 : 0;\n  simpleEscapeMap[i] = simpleEscapeSequence(i);\n}\n\n\nfunction State$1(input, options) {\n  this.input = input;\n\n  this.filename  = options['filename']  || null;\n  this.schema    = options['schema']    || _default;\n  this.onWarning = options['onWarning'] || null;\n  // (Hidden) Remove? makes the loader to expect YAML 1.1 documents\n  // if such documents have no explicit %YAML directive\n  this.legacy    = options['legacy']    || false;\n\n  this.json      = options['json']      || false;\n  this.listener  = options['listener']  || null;\n\n  this.implicitTypes = this.schema.compiledImplicit;\n  this.typeMap       = this.schema.compiledTypeMap;\n\n  this.length     = input.length;\n  this.position   = 0;\n  this.line       = 0;\n  this.lineStart  = 0;\n  this.lineIndent = 0;\n\n  // position of first leading tab in the current line,\n  // used to make sure there are no tabs in the indentation\n  this.firstTabInLine = -1;\n\n  this.documents = [];\n\n  /*\n  this.version;\n  this.checkLineBreaks;\n  this.tagMap;\n  this.anchorMap;\n  this.tag;\n  this.anchor;\n  this.kind;\n  this.result;*/\n\n}\n\n\nfunction generateError(state, message) {\n  var mark = {\n    name:     state.filename,\n    buffer:   state.input.slice(0, -1), // omit trailing \\0\n    position: state.position,\n    line:     state.line,\n    column:   state.position - state.lineStart\n  };\n\n  mark.snippet = snippet(mark);\n\n  return new exception(message, mark);\n}\n\nfunction throwError(state, message) {\n  throw generateError(state, message);\n}\n\nfunction throwWarning(state, message) {\n  if (state.onWarning) {\n    state.onWarning.call(null, generateError(state, message));\n  }\n}\n\n\nvar directiveHandlers = {\n\n  YAML: function handleYamlDirective(state, name, args) {\n\n    var match, major, minor;\n\n    if (state.version !== null) {\n      throwError(state, 'duplication of %YAML directive');\n    }\n\n    if (args.length !== 1) {\n      throwError(state, 'YAML directive accepts exactly one argument');\n    }\n\n    match = /^([0-9]+)\\.([0-9]+)$/.exec(args[0]);\n\n    if (match === null) {\n      throwError(state, 'ill-formed argument of the YAML directive');\n    }\n\n    major = parseInt(match[1], 10);\n    minor = parseInt(match[2], 10);\n\n    if (major !== 1) {\n      throwError(state, 'unacceptable YAML version of the document');\n    }\n\n    state.version = args[0];\n    state.checkLineBreaks = (minor < 2);\n\n    if (minor !== 1 && minor !== 2) {\n      throwWarning(state, 'unsupported YAML version of the document');\n    }\n  },\n\n  TAG: function handleTagDirective(state, name, args) {\n\n    var handle, prefix;\n\n    if (args.length !== 2) {\n      throwError(state, 'TAG directive accepts exactly two arguments');\n    }\n\n    handle = args[0];\n    prefix = args[1];\n\n    if (!PATTERN_TAG_HANDLE.test(handle)) {\n      throwError(state, 'ill-formed tag handle (first argument) of the TAG directive');\n    }\n\n    if (_hasOwnProperty$1.call(state.tagMap, handle)) {\n      throwError(state, 'there is a previously declared suffix for \"' + handle + '\" tag handle');\n    }\n\n    if (!PATTERN_TAG_URI.test(prefix)) {\n      throwError(state, 'ill-formed tag prefix (second argument) of the TAG directive');\n    }\n\n    try {\n      prefix = decodeURIComponent(prefix);\n    } catch (err) {\n      throwError(state, 'tag prefix is malformed: ' + prefix);\n    }\n\n    state.tagMap[handle] = prefix;\n  }\n};\n\n\nfunction captureSegment(state, start, end, checkJson) {\n  var _position, _length, _character, _result;\n\n  if (start < end) {\n    _result = state.input.slice(start, end);\n\n    if (checkJson) {\n      for (_position = 0, _length = _result.length; _position < _length; _position += 1) {\n        _character = _result.charCodeAt(_position);\n        if (!(_character === 0x09 ||\n              (0x20 <= _character && _character <= 0x10FFFF))) {\n          throwError(state, 'expected valid JSON character');\n        }\n      }\n    } else if (PATTERN_NON_PRINTABLE.test(_result)) {\n      throwError(state, 'the stream contains non-printable characters');\n    }\n\n    state.result += _result;\n  }\n}\n\nfunction mergeMappings(state, destination, source, overridableKeys) {\n  var sourceKeys, key, index, quantity;\n\n  if (!common.isObject(source)) {\n    throwError(state, 'cannot merge mappings; the provided source object is unacceptable');\n  }\n\n  sourceKeys = Object.keys(source);\n\n  for (index = 0, quantity = sourceKeys.length; index < quantity; index += 1) {\n    key = sourceKeys[index];\n\n    if (!_hasOwnProperty$1.call(destination, key)) {\n      setProperty(destination, key, source[key]);\n      overridableKeys[key] = true;\n    }\n  }\n}\n\nfunction storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode,\n  startLine, startLineStart, startPos) {\n\n  var index, quantity;\n\n  // The output is a plain object here, so keys can only be strings.\n  // We need to convert keyNode to a string, but doing so can hang the process\n  // (deeply nested arrays that explode exponentially using aliases).\n  if (Array.isArray(keyNode)) {\n    keyNode = Array.prototype.slice.call(keyNode);\n\n    for (index = 0, quantity = keyNode.length; index < quantity; index += 1) {\n      if (Array.isArray(keyNode[index])) {\n        throwError(state, 'nested arrays are not supported inside keys');\n      }\n\n      if (typeof keyNode === 'object' && _class(keyNode[index]) === '[object Object]') {\n        keyNode[index] = '[object Object]';\n      }\n    }\n  }\n\n  // Avoid code execution in load() via toString property\n  // (still use its own toString for arrays, timestamps,\n  // and whatever user schema extensions happen to have @@toStringTag)\n  if (typeof keyNode === 'object' && _class(keyNode) === '[object Object]') {\n    keyNode = '[object Object]';\n  }\n\n\n  keyNode = String(keyNode);\n\n  if (_result === null) {\n    _result = {};\n  }\n\n  if (keyTag === 'tag:yaml.org,2002:merge') {\n    if (Array.isArray(valueNode)) {\n      for (index = 0, quantity = valueNode.length; index < quantity; index += 1) {\n        mergeMappings(state, _result, valueNode[index], overridableKeys);\n      }\n    } else {\n      mergeMappings(state, _result, valueNode, overridableKeys);\n    }\n  } else {\n    if (!state.json &&\n        !_hasOwnProperty$1.call(overridableKeys, keyNode) &&\n        _hasOwnProperty$1.call(_result, keyNode)) {\n      state.line = startLine || state.line;\n      state.lineStart = startLineStart || state.lineStart;\n      state.position = startPos || state.position;\n      throwError(state, 'duplicated mapping key');\n    }\n\n    setProperty(_result, keyNode, valueNode);\n    delete overridableKeys[keyNode];\n  }\n\n  return _result;\n}\n\nfunction readLineBreak(state) {\n  var ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x0A/* LF */) {\n    state.position++;\n  } else if (ch === 0x0D/* CR */) {\n    state.position++;\n    if (state.input.charCodeAt(state.position) === 0x0A/* LF */) {\n      state.position++;\n    }\n  } else {\n    throwError(state, 'a line break is expected');\n  }\n\n  state.line += 1;\n  state.lineStart = state.position;\n  state.firstTabInLine = -1;\n}\n\nfunction skipSeparationSpace(state, allowComments, checkIndent) {\n  var lineBreaks = 0,\n      ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    while (is_WHITE_SPACE(ch)) {\n      if (ch === 0x09/* Tab */ && state.firstTabInLine === -1) {\n        state.firstTabInLine = state.position;\n      }\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    if (allowComments && ch === 0x23/* # */) {\n      do {\n        ch = state.input.charCodeAt(++state.position);\n      } while (ch !== 0x0A/* LF */ && ch !== 0x0D/* CR */ && ch !== 0);\n    }\n\n    if (is_EOL(ch)) {\n      readLineBreak(state);\n\n      ch = state.input.charCodeAt(state.position);\n      lineBreaks++;\n      state.lineIndent = 0;\n\n      while (ch === 0x20/* Space */) {\n        state.lineIndent++;\n        ch = state.input.charCodeAt(++state.position);\n      }\n    } else {\n      break;\n    }\n  }\n\n  if (checkIndent !== -1 && lineBreaks !== 0 && state.lineIndent < checkIndent) {\n    throwWarning(state, 'deficient indentation');\n  }\n\n  return lineBreaks;\n}\n\nfunction testDocumentSeparator(state) {\n  var _position = state.position,\n      ch;\n\n  ch = state.input.charCodeAt(_position);\n\n  // Condition state.position === state.lineStart is tested\n  // in parent on each call, for efficiency. No needs to test here again.\n  if ((ch === 0x2D/* - */ || ch === 0x2E/* . */) &&\n      ch === state.input.charCodeAt(_position + 1) &&\n      ch === state.input.charCodeAt(_position + 2)) {\n\n    _position += 3;\n\n    ch = state.input.charCodeAt(_position);\n\n    if (ch === 0 || is_WS_OR_EOL(ch)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction writeFoldedLines(state, count) {\n  if (count === 1) {\n    state.result += ' ';\n  } else if (count > 1) {\n    state.result += common.repeat('\\n', count - 1);\n  }\n}\n\n\nfunction readPlainScalar(state, nodeIndent, withinFlowCollection) {\n  var preceding,\n      following,\n      captureStart,\n      captureEnd,\n      hasPendingContent,\n      _line,\n      _lineStart,\n      _lineIndent,\n      _kind = state.kind,\n      _result = state.result,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (is_WS_OR_EOL(ch)      ||\n      is_FLOW_INDICATOR(ch) ||\n      ch === 0x23/* # */    ||\n      ch === 0x26/* & */    ||\n      ch === 0x2A/* * */    ||\n      ch === 0x21/* ! */    ||\n      ch === 0x7C/* | */    ||\n      ch === 0x3E/* > */    ||\n      ch === 0x27/* ' */    ||\n      ch === 0x22/* \" */    ||\n      ch === 0x25/* % */    ||\n      ch === 0x40/* @ */    ||\n      ch === 0x60/* ` */) {\n    return false;\n  }\n\n  if (ch === 0x3F/* ? */ || ch === 0x2D/* - */) {\n    following = state.input.charCodeAt(state.position + 1);\n\n    if (is_WS_OR_EOL(following) ||\n        withinFlowCollection && is_FLOW_INDICATOR(following)) {\n      return false;\n    }\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  captureStart = captureEnd = state.position;\n  hasPendingContent = false;\n\n  while (ch !== 0) {\n    if (ch === 0x3A/* : */) {\n      following = state.input.charCodeAt(state.position + 1);\n\n      if (is_WS_OR_EOL(following) ||\n          withinFlowCollection && is_FLOW_INDICATOR(following)) {\n        break;\n      }\n\n    } else if (ch === 0x23/* # */) {\n      preceding = state.input.charCodeAt(state.position - 1);\n\n      if (is_WS_OR_EOL(preceding)) {\n        break;\n      }\n\n    } else if ((state.position === state.lineStart && testDocumentSeparator(state)) ||\n               withinFlowCollection && is_FLOW_INDICATOR(ch)) {\n      break;\n\n    } else if (is_EOL(ch)) {\n      _line = state.line;\n      _lineStart = state.lineStart;\n      _lineIndent = state.lineIndent;\n      skipSeparationSpace(state, false, -1);\n\n      if (state.lineIndent >= nodeIndent) {\n        hasPendingContent = true;\n        ch = state.input.charCodeAt(state.position);\n        continue;\n      } else {\n        state.position = captureEnd;\n        state.line = _line;\n        state.lineStart = _lineStart;\n        state.lineIndent = _lineIndent;\n        break;\n      }\n    }\n\n    if (hasPendingContent) {\n      captureSegment(state, captureStart, captureEnd, false);\n      writeFoldedLines(state, state.line - _line);\n      captureStart = captureEnd = state.position;\n      hasPendingContent = false;\n    }\n\n    if (!is_WHITE_SPACE(ch)) {\n      captureEnd = state.position + 1;\n    }\n\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  captureSegment(state, captureStart, captureEnd, false);\n\n  if (state.result) {\n    return true;\n  }\n\n  state.kind = _kind;\n  state.result = _result;\n  return false;\n}\n\nfunction readSingleQuotedScalar(state, nodeIndent) {\n  var ch,\n      captureStart, captureEnd;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x27/* ' */) {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  state.position++;\n  captureStart = captureEnd = state.position;\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    if (ch === 0x27/* ' */) {\n      captureSegment(state, captureStart, state.position, true);\n      ch = state.input.charCodeAt(++state.position);\n\n      if (ch === 0x27/* ' */) {\n        captureStart = state.position;\n        state.position++;\n        captureEnd = state.position;\n      } else {\n        return true;\n      }\n\n    } else if (is_EOL(ch)) {\n      captureSegment(state, captureStart, captureEnd, true);\n      writeFoldedLines(state, skipSeparationSpace(state, false, nodeIndent));\n      captureStart = captureEnd = state.position;\n\n    } else if (state.position === state.lineStart && testDocumentSeparator(state)) {\n      throwError(state, 'unexpected end of the document within a single quoted scalar');\n\n    } else {\n      state.position++;\n      captureEnd = state.position;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a single quoted scalar');\n}\n\nfunction readDoubleQuotedScalar(state, nodeIndent) {\n  var captureStart,\n      captureEnd,\n      hexLength,\n      hexResult,\n      tmp,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x22/* \" */) {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n  state.position++;\n  captureStart = captureEnd = state.position;\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    if (ch === 0x22/* \" */) {\n      captureSegment(state, captureStart, state.position, true);\n      state.position++;\n      return true;\n\n    } else if (ch === 0x5C/* \\ */) {\n      captureSegment(state, captureStart, state.position, true);\n      ch = state.input.charCodeAt(++state.position);\n\n      if (is_EOL(ch)) {\n        skipSeparationSpace(state, false, nodeIndent);\n\n        // TODO: rework to inline fn with no type cast?\n      } else if (ch < 256 && simpleEscapeCheck[ch]) {\n        state.result += simpleEscapeMap[ch];\n        state.position++;\n\n      } else if ((tmp = escapedHexLen(ch)) > 0) {\n        hexLength = tmp;\n        hexResult = 0;\n\n        for (; hexLength > 0; hexLength--) {\n          ch = state.input.charCodeAt(++state.position);\n\n          if ((tmp = fromHexCode(ch)) >= 0) {\n            hexResult = (hexResult << 4) + tmp;\n\n          } else {\n            throwError(state, 'expected hexadecimal character');\n          }\n        }\n\n        state.result += charFromCodepoint(hexResult);\n\n        state.position++;\n\n      } else {\n        throwError(state, 'unknown escape sequence');\n      }\n\n      captureStart = captureEnd = state.position;\n\n    } else if (is_EOL(ch)) {\n      captureSegment(state, captureStart, captureEnd, true);\n      writeFoldedLines(state, skipSeparationSpace(state, false, nodeIndent));\n      captureStart = captureEnd = state.position;\n\n    } else if (state.position === state.lineStart && testDocumentSeparator(state)) {\n      throwError(state, 'unexpected end of the document within a double quoted scalar');\n\n    } else {\n      state.position++;\n      captureEnd = state.position;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a double quoted scalar');\n}\n\nfunction readFlowCollection(state, nodeIndent) {\n  var readNext = true,\n      _line,\n      _lineStart,\n      _pos,\n      _tag     = state.tag,\n      _result,\n      _anchor  = state.anchor,\n      following,\n      terminator,\n      isPair,\n      isExplicitPair,\n      isMapping,\n      overridableKeys = Object.create(null),\n      keyNode,\n      keyTag,\n      valueNode,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x5B/* [ */) {\n    terminator = 0x5D;/* ] */\n    isMapping = false;\n    _result = [];\n  } else if (ch === 0x7B/* { */) {\n    terminator = 0x7D;/* } */\n    isMapping = true;\n    _result = {};\n  } else {\n    return false;\n  }\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n\n  while (ch !== 0) {\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (ch === terminator) {\n      state.position++;\n      state.tag = _tag;\n      state.anchor = _anchor;\n      state.kind = isMapping ? 'mapping' : 'sequence';\n      state.result = _result;\n      return true;\n    } else if (!readNext) {\n      throwError(state, 'missed comma between flow collection entries');\n    } else if (ch === 0x2C/* , */) {\n      // \"flow collection entries can never be completely empty\", as per YAML 1.2, section 7.4\n      throwError(state, \"expected the node content, but found ','\");\n    }\n\n    keyTag = keyNode = valueNode = null;\n    isPair = isExplicitPair = false;\n\n    if (ch === 0x3F/* ? */) {\n      following = state.input.charCodeAt(state.position + 1);\n\n      if (is_WS_OR_EOL(following)) {\n        isPair = isExplicitPair = true;\n        state.position++;\n        skipSeparationSpace(state, true, nodeIndent);\n      }\n    }\n\n    _line = state.line; // Save the current line.\n    _lineStart = state.lineStart;\n    _pos = state.position;\n    composeNode(state, nodeIndent, CONTEXT_FLOW_IN, false, true);\n    keyTag = state.tag;\n    keyNode = state.result;\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if ((isExplicitPair || state.line === _line) && ch === 0x3A/* : */) {\n      isPair = true;\n      ch = state.input.charCodeAt(++state.position);\n      skipSeparationSpace(state, true, nodeIndent);\n      composeNode(state, nodeIndent, CONTEXT_FLOW_IN, false, true);\n      valueNode = state.result;\n    }\n\n    if (isMapping) {\n      storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode, _line, _lineStart, _pos);\n    } else if (isPair) {\n      _result.push(storeMappingPair(state, null, overridableKeys, keyTag, keyNode, valueNode, _line, _lineStart, _pos));\n    } else {\n      _result.push(keyNode);\n    }\n\n    skipSeparationSpace(state, true, nodeIndent);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (ch === 0x2C/* , */) {\n      readNext = true;\n      ch = state.input.charCodeAt(++state.position);\n    } else {\n      readNext = false;\n    }\n  }\n\n  throwError(state, 'unexpected end of the stream within a flow collection');\n}\n\nfunction readBlockScalar(state, nodeIndent) {\n  var captureStart,\n      folding,\n      chomping       = CHOMPING_CLIP,\n      didReadContent = false,\n      detectedIndent = false,\n      textIndent     = nodeIndent,\n      emptyLines     = 0,\n      atMoreIndented = false,\n      tmp,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch === 0x7C/* | */) {\n    folding = false;\n  } else if (ch === 0x3E/* > */) {\n    folding = true;\n  } else {\n    return false;\n  }\n\n  state.kind = 'scalar';\n  state.result = '';\n\n  while (ch !== 0) {\n    ch = state.input.charCodeAt(++state.position);\n\n    if (ch === 0x2B/* + */ || ch === 0x2D/* - */) {\n      if (CHOMPING_CLIP === chomping) {\n        chomping = (ch === 0x2B/* + */) ? CHOMPING_KEEP : CHOMPING_STRIP;\n      } else {\n        throwError(state, 'repeat of a chomping mode identifier');\n      }\n\n    } else if ((tmp = fromDecimalCode(ch)) >= 0) {\n      if (tmp === 0) {\n        throwError(state, 'bad explicit indentation width of a block scalar; it cannot be less than one');\n      } else if (!detectedIndent) {\n        textIndent = nodeIndent + tmp - 1;\n        detectedIndent = true;\n      } else {\n        throwError(state, 'repeat of an indentation width identifier');\n      }\n\n    } else {\n      break;\n    }\n  }\n\n  if (is_WHITE_SPACE(ch)) {\n    do { ch = state.input.charCodeAt(++state.position); }\n    while (is_WHITE_SPACE(ch));\n\n    if (ch === 0x23/* # */) {\n      do { ch = state.input.charCodeAt(++state.position); }\n      while (!is_EOL(ch) && (ch !== 0));\n    }\n  }\n\n  while (ch !== 0) {\n    readLineBreak(state);\n    state.lineIndent = 0;\n\n    ch = state.input.charCodeAt(state.position);\n\n    while ((!detectedIndent || state.lineIndent < textIndent) &&\n           (ch === 0x20/* Space */)) {\n      state.lineIndent++;\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    if (!detectedIndent && state.lineIndent > textIndent) {\n      textIndent = state.lineIndent;\n    }\n\n    if (is_EOL(ch)) {\n      emptyLines++;\n      continue;\n    }\n\n    // End of the scalar.\n    if (state.lineIndent < textIndent) {\n\n      // Perform the chomping.\n      if (chomping === CHOMPING_KEEP) {\n        state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n      } else if (chomping === CHOMPING_CLIP) {\n        if (didReadContent) { // i.e. only if the scalar is not empty.\n          state.result += '\\n';\n        }\n      }\n\n      // Break this `while` cycle and go to the funciton's epilogue.\n      break;\n    }\n\n    // Folded style: use fancy rules to handle line breaks.\n    if (folding) {\n\n      // Lines starting with white space characters (more-indented lines) are not folded.\n      if (is_WHITE_SPACE(ch)) {\n        atMoreIndented = true;\n        // except for the first content line (cf. Example 8.1)\n        state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n\n      // End of more-indented block.\n      } else if (atMoreIndented) {\n        atMoreIndented = false;\n        state.result += common.repeat('\\n', emptyLines + 1);\n\n      // Just one line break - perceive as the same line.\n      } else if (emptyLines === 0) {\n        if (didReadContent) { // i.e. only if we have already read some scalar content.\n          state.result += ' ';\n        }\n\n      // Several line breaks - perceive as different lines.\n      } else {\n        state.result += common.repeat('\\n', emptyLines);\n      }\n\n    // Literal style: just add exact number of line breaks between content lines.\n    } else {\n      // Keep all line breaks except the header line break.\n      state.result += common.repeat('\\n', didReadContent ? 1 + emptyLines : emptyLines);\n    }\n\n    didReadContent = true;\n    detectedIndent = true;\n    emptyLines = 0;\n    captureStart = state.position;\n\n    while (!is_EOL(ch) && (ch !== 0)) {\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    captureSegment(state, captureStart, state.position, false);\n  }\n\n  return true;\n}\n\nfunction readBlockSequence(state, nodeIndent) {\n  var _line,\n      _tag      = state.tag,\n      _anchor   = state.anchor,\n      _result   = [],\n      following,\n      detected  = false,\n      ch;\n\n  // there is a leading tab before this token, so it can't be a block sequence/mapping;\n  // it can still be flow sequence/mapping or a scalar\n  if (state.firstTabInLine !== -1) return false;\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    if (state.firstTabInLine !== -1) {\n      state.position = state.firstTabInLine;\n      throwError(state, 'tab characters must not be used in indentation');\n    }\n\n    if (ch !== 0x2D/* - */) {\n      break;\n    }\n\n    following = state.input.charCodeAt(state.position + 1);\n\n    if (!is_WS_OR_EOL(following)) {\n      break;\n    }\n\n    detected = true;\n    state.position++;\n\n    if (skipSeparationSpace(state, true, -1)) {\n      if (state.lineIndent <= nodeIndent) {\n        _result.push(null);\n        ch = state.input.charCodeAt(state.position);\n        continue;\n      }\n    }\n\n    _line = state.line;\n    composeNode(state, nodeIndent, CONTEXT_BLOCK_IN, false, true);\n    _result.push(state.result);\n    skipSeparationSpace(state, true, -1);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if ((state.line === _line || state.lineIndent > nodeIndent) && (ch !== 0)) {\n      throwError(state, 'bad indentation of a sequence entry');\n    } else if (state.lineIndent < nodeIndent) {\n      break;\n    }\n  }\n\n  if (detected) {\n    state.tag = _tag;\n    state.anchor = _anchor;\n    state.kind = 'sequence';\n    state.result = _result;\n    return true;\n  }\n  return false;\n}\n\nfunction readBlockMapping(state, nodeIndent, flowIndent) {\n  var following,\n      allowCompact,\n      _line,\n      _keyLine,\n      _keyLineStart,\n      _keyPos,\n      _tag          = state.tag,\n      _anchor       = state.anchor,\n      _result       = {},\n      overridableKeys = Object.create(null),\n      keyTag        = null,\n      keyNode       = null,\n      valueNode     = null,\n      atExplicitKey = false,\n      detected      = false,\n      ch;\n\n  // there is a leading tab before this token, so it can't be a block sequence/mapping;\n  // it can still be flow sequence/mapping or a scalar\n  if (state.firstTabInLine !== -1) return false;\n\n  if (state.anchor !== null) {\n    state.anchorMap[state.anchor] = _result;\n  }\n\n  ch = state.input.charCodeAt(state.position);\n\n  while (ch !== 0) {\n    if (!atExplicitKey && state.firstTabInLine !== -1) {\n      state.position = state.firstTabInLine;\n      throwError(state, 'tab characters must not be used in indentation');\n    }\n\n    following = state.input.charCodeAt(state.position + 1);\n    _line = state.line; // Save the current line.\n\n    //\n    // Explicit notation case. There are two separate blocks:\n    // first for the key (denoted by \"?\") and second for the value (denoted by \":\")\n    //\n    if ((ch === 0x3F/* ? */ || ch === 0x3A/* : */) && is_WS_OR_EOL(following)) {\n\n      if (ch === 0x3F/* ? */) {\n        if (atExplicitKey) {\n          storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n          keyTag = keyNode = valueNode = null;\n        }\n\n        detected = true;\n        atExplicitKey = true;\n        allowCompact = true;\n\n      } else if (atExplicitKey) {\n        // i.e. 0x3A/* : */ === character after the explicit key.\n        atExplicitKey = false;\n        allowCompact = true;\n\n      } else {\n        throwError(state, 'incomplete explicit mapping pair; a key node is missed; or followed by a non-tabulated empty line');\n      }\n\n      state.position += 1;\n      ch = following;\n\n    //\n    // Implicit notation case. Flow-style node as the key first, then \":\", and the value.\n    //\n    } else {\n      _keyLine = state.line;\n      _keyLineStart = state.lineStart;\n      _keyPos = state.position;\n\n      if (!composeNode(state, flowIndent, CONTEXT_FLOW_OUT, false, true)) {\n        // Neither implicit nor explicit notation.\n        // Reading is done. Go to the epilogue.\n        break;\n      }\n\n      if (state.line === _line) {\n        ch = state.input.charCodeAt(state.position);\n\n        while (is_WHITE_SPACE(ch)) {\n          ch = state.input.charCodeAt(++state.position);\n        }\n\n        if (ch === 0x3A/* : */) {\n          ch = state.input.charCodeAt(++state.position);\n\n          if (!is_WS_OR_EOL(ch)) {\n            throwError(state, 'a whitespace character is expected after the key-value separator within a block mapping');\n          }\n\n          if (atExplicitKey) {\n            storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n            keyTag = keyNode = valueNode = null;\n          }\n\n          detected = true;\n          atExplicitKey = false;\n          allowCompact = false;\n          keyTag = state.tag;\n          keyNode = state.result;\n\n        } else if (detected) {\n          throwError(state, 'can not read an implicit mapping pair; a colon is missed');\n\n        } else {\n          state.tag = _tag;\n          state.anchor = _anchor;\n          return true; // Keep the result of `composeNode`.\n        }\n\n      } else if (detected) {\n        throwError(state, 'can not read a block mapping entry; a multiline key may not be an implicit key');\n\n      } else {\n        state.tag = _tag;\n        state.anchor = _anchor;\n        return true; // Keep the result of `composeNode`.\n      }\n    }\n\n    //\n    // Common reading code for both explicit and implicit notations.\n    //\n    if (state.line === _line || state.lineIndent > nodeIndent) {\n      if (atExplicitKey) {\n        _keyLine = state.line;\n        _keyLineStart = state.lineStart;\n        _keyPos = state.position;\n      }\n\n      if (composeNode(state, nodeIndent, CONTEXT_BLOCK_OUT, true, allowCompact)) {\n        if (atExplicitKey) {\n          keyNode = state.result;\n        } else {\n          valueNode = state.result;\n        }\n      }\n\n      if (!atExplicitKey) {\n        storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, valueNode, _keyLine, _keyLineStart, _keyPos);\n        keyTag = keyNode = valueNode = null;\n      }\n\n      skipSeparationSpace(state, true, -1);\n      ch = state.input.charCodeAt(state.position);\n    }\n\n    if ((state.line === _line || state.lineIndent > nodeIndent) && (ch !== 0)) {\n      throwError(state, 'bad indentation of a mapping entry');\n    } else if (state.lineIndent < nodeIndent) {\n      break;\n    }\n  }\n\n  //\n  // Epilogue.\n  //\n\n  // Special case: last mapping's node contains only the key in explicit notation.\n  if (atExplicitKey) {\n    storeMappingPair(state, _result, overridableKeys, keyTag, keyNode, null, _keyLine, _keyLineStart, _keyPos);\n  }\n\n  // Expose the resulting mapping.\n  if (detected) {\n    state.tag = _tag;\n    state.anchor = _anchor;\n    state.kind = 'mapping';\n    state.result = _result;\n  }\n\n  return detected;\n}\n\nfunction readTagProperty(state) {\n  var _position,\n      isVerbatim = false,\n      isNamed    = false,\n      tagHandle,\n      tagName,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x21/* ! */) return false;\n\n  if (state.tag !== null) {\n    throwError(state, 'duplication of a tag property');\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n\n  if (ch === 0x3C/* < */) {\n    isVerbatim = true;\n    ch = state.input.charCodeAt(++state.position);\n\n  } else if (ch === 0x21/* ! */) {\n    isNamed = true;\n    tagHandle = '!!';\n    ch = state.input.charCodeAt(++state.position);\n\n  } else {\n    tagHandle = '!';\n  }\n\n  _position = state.position;\n\n  if (isVerbatim) {\n    do { ch = state.input.charCodeAt(++state.position); }\n    while (ch !== 0 && ch !== 0x3E/* > */);\n\n    if (state.position < state.length) {\n      tagName = state.input.slice(_position, state.position);\n      ch = state.input.charCodeAt(++state.position);\n    } else {\n      throwError(state, 'unexpected end of the stream within a verbatim tag');\n    }\n  } else {\n    while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n\n      if (ch === 0x21/* ! */) {\n        if (!isNamed) {\n          tagHandle = state.input.slice(_position - 1, state.position + 1);\n\n          if (!PATTERN_TAG_HANDLE.test(tagHandle)) {\n            throwError(state, 'named tag handle cannot contain such characters');\n          }\n\n          isNamed = true;\n          _position = state.position + 1;\n        } else {\n          throwError(state, 'tag suffix cannot contain exclamation marks');\n        }\n      }\n\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    tagName = state.input.slice(_position, state.position);\n\n    if (PATTERN_FLOW_INDICATORS.test(tagName)) {\n      throwError(state, 'tag suffix cannot contain flow indicator characters');\n    }\n  }\n\n  if (tagName && !PATTERN_TAG_URI.test(tagName)) {\n    throwError(state, 'tag name cannot contain such characters: ' + tagName);\n  }\n\n  try {\n    tagName = decodeURIComponent(tagName);\n  } catch (err) {\n    throwError(state, 'tag name is malformed: ' + tagName);\n  }\n\n  if (isVerbatim) {\n    state.tag = tagName;\n\n  } else if (_hasOwnProperty$1.call(state.tagMap, tagHandle)) {\n    state.tag = state.tagMap[tagHandle] + tagName;\n\n  } else if (tagHandle === '!') {\n    state.tag = '!' + tagName;\n\n  } else if (tagHandle === '!!') {\n    state.tag = 'tag:yaml.org,2002:' + tagName;\n\n  } else {\n    throwError(state, 'undeclared tag handle \"' + tagHandle + '\"');\n  }\n\n  return true;\n}\n\nfunction readAnchorProperty(state) {\n  var _position,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x26/* & */) return false;\n\n  if (state.anchor !== null) {\n    throwError(state, 'duplication of an anchor property');\n  }\n\n  ch = state.input.charCodeAt(++state.position);\n  _position = state.position;\n\n  while (ch !== 0 && !is_WS_OR_EOL(ch) && !is_FLOW_INDICATOR(ch)) {\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  if (state.position === _position) {\n    throwError(state, 'name of an anchor node must contain at least one character');\n  }\n\n  state.anchor = state.input.slice(_position, state.position);\n  return true;\n}\n\nfunction readAlias(state) {\n  var _position, alias,\n      ch;\n\n  ch = state.input.charCodeAt(state.position);\n\n  if (ch !== 0x2A/* * */) return false;\n\n  ch = state.input.charCodeAt(++state.position);\n  _position = state.position;\n\n  while (ch !== 0 && !is_WS_OR_EOL(ch) && !is_FLOW_INDICATOR(ch)) {\n    ch = state.input.charCodeAt(++state.position);\n  }\n\n  if (state.position === _position) {\n    throwError(state, 'name of an alias node must contain at least one character');\n  }\n\n  alias = state.input.slice(_position, state.position);\n\n  if (!_hasOwnProperty$1.call(state.anchorMap, alias)) {\n    throwError(state, 'unidentified alias \"' + alias + '\"');\n  }\n\n  state.result = state.anchorMap[alias];\n  skipSeparationSpace(state, true, -1);\n  return true;\n}\n\nfunction composeNode(state, parentIndent, nodeContext, allowToSeek, allowCompact) {\n  var allowBlockStyles,\n      allowBlockScalars,\n      allowBlockCollections,\n      indentStatus = 1, // 1: this>parent, 0: this=parent, -1: this<parent\n      atNewLine  = false,\n      hasContent = false,\n      typeIndex,\n      typeQuantity,\n      typeList,\n      type,\n      flowIndent,\n      blockIndent;\n\n  if (state.listener !== null) {\n    state.listener('open', state);\n  }\n\n  state.tag    = null;\n  state.anchor = null;\n  state.kind   = null;\n  state.result = null;\n\n  allowBlockStyles = allowBlockScalars = allowBlockCollections =\n    CONTEXT_BLOCK_OUT === nodeContext ||\n    CONTEXT_BLOCK_IN  === nodeContext;\n\n  if (allowToSeek) {\n    if (skipSeparationSpace(state, true, -1)) {\n      atNewLine = true;\n\n      if (state.lineIndent > parentIndent) {\n        indentStatus = 1;\n      } else if (state.lineIndent === parentIndent) {\n        indentStatus = 0;\n      } else if (state.lineIndent < parentIndent) {\n        indentStatus = -1;\n      }\n    }\n  }\n\n  if (indentStatus === 1) {\n    while (readTagProperty(state) || readAnchorProperty(state)) {\n      if (skipSeparationSpace(state, true, -1)) {\n        atNewLine = true;\n        allowBlockCollections = allowBlockStyles;\n\n        if (state.lineIndent > parentIndent) {\n          indentStatus = 1;\n        } else if (state.lineIndent === parentIndent) {\n          indentStatus = 0;\n        } else if (state.lineIndent < parentIndent) {\n          indentStatus = -1;\n        }\n      } else {\n        allowBlockCollections = false;\n      }\n    }\n  }\n\n  if (allowBlockCollections) {\n    allowBlockCollections = atNewLine || allowCompact;\n  }\n\n  if (indentStatus === 1 || CONTEXT_BLOCK_OUT === nodeContext) {\n    if (CONTEXT_FLOW_IN === nodeContext || CONTEXT_FLOW_OUT === nodeContext) {\n      flowIndent = parentIndent;\n    } else {\n      flowIndent = parentIndent + 1;\n    }\n\n    blockIndent = state.position - state.lineStart;\n\n    if (indentStatus === 1) {\n      if (allowBlockCollections &&\n          (readBlockSequence(state, blockIndent) ||\n           readBlockMapping(state, blockIndent, flowIndent)) ||\n          readFlowCollection(state, flowIndent)) {\n        hasContent = true;\n      } else {\n        if ((allowBlockScalars && readBlockScalar(state, flowIndent)) ||\n            readSingleQuotedScalar(state, flowIndent) ||\n            readDoubleQuotedScalar(state, flowIndent)) {\n          hasContent = true;\n\n        } else if (readAlias(state)) {\n          hasContent = true;\n\n          if (state.tag !== null || state.anchor !== null) {\n            throwError(state, 'alias node should not have any properties');\n          }\n\n        } else if (readPlainScalar(state, flowIndent, CONTEXT_FLOW_IN === nodeContext)) {\n          hasContent = true;\n\n          if (state.tag === null) {\n            state.tag = '?';\n          }\n        }\n\n        if (state.anchor !== null) {\n          state.anchorMap[state.anchor] = state.result;\n        }\n      }\n    } else if (indentStatus === 0) {\n      // Special case: block sequences are allowed to have same indentation level as the parent.\n      // http://www.yaml.org/spec/1.2/spec.html#id2799784\n      hasContent = allowBlockCollections && readBlockSequence(state, blockIndent);\n    }\n  }\n\n  if (state.tag === null) {\n    if (state.anchor !== null) {\n      state.anchorMap[state.anchor] = state.result;\n    }\n\n  } else if (state.tag === '?') {\n    // Implicit resolving is not allowed for non-scalar types, and '?'\n    // non-specific tag is only automatically assigned to plain scalars.\n    //\n    // We only need to check kind conformity in case user explicitly assigns '?'\n    // tag, for example like this: \"!<?> [0]\"\n    //\n    if (state.result !== null && state.kind !== 'scalar') {\n      throwError(state, 'unacceptable node kind for !<?> tag; it should be \"scalar\", not \"' + state.kind + '\"');\n    }\n\n    for (typeIndex = 0, typeQuantity = state.implicitTypes.length; typeIndex < typeQuantity; typeIndex += 1) {\n      type = state.implicitTypes[typeIndex];\n\n      if (type.resolve(state.result)) { // `state.result` updated in resolver if matched\n        state.result = type.construct(state.result);\n        state.tag = type.tag;\n        if (state.anchor !== null) {\n          state.anchorMap[state.anchor] = state.result;\n        }\n        break;\n      }\n    }\n  } else if (state.tag !== '!') {\n    if (_hasOwnProperty$1.call(state.typeMap[state.kind || 'fallback'], state.tag)) {\n      type = state.typeMap[state.kind || 'fallback'][state.tag];\n    } else {\n      // looking for multi type\n      type = null;\n      typeList = state.typeMap.multi[state.kind || 'fallback'];\n\n      for (typeIndex = 0, typeQuantity = typeList.length; typeIndex < typeQuantity; typeIndex += 1) {\n        if (state.tag.slice(0, typeList[typeIndex].tag.length) === typeList[typeIndex].tag) {\n          type = typeList[typeIndex];\n          break;\n        }\n      }\n    }\n\n    if (!type) {\n      throwError(state, 'unknown tag !<' + state.tag + '>');\n    }\n\n    if (state.result !== null && type.kind !== state.kind) {\n      throwError(state, 'unacceptable node kind for !<' + state.tag + '> tag; it should be \"' + type.kind + '\", not \"' + state.kind + '\"');\n    }\n\n    if (!type.resolve(state.result, state.tag)) { // `state.result` updated in resolver if matched\n      throwError(state, 'cannot resolve a node with !<' + state.tag + '> explicit tag');\n    } else {\n      state.result = type.construct(state.result, state.tag);\n      if (state.anchor !== null) {\n        state.anchorMap[state.anchor] = state.result;\n      }\n    }\n  }\n\n  if (state.listener !== null) {\n    state.listener('close', state);\n  }\n  return state.tag !== null ||  state.anchor !== null || hasContent;\n}\n\nfunction readDocument(state) {\n  var documentStart = state.position,\n      _position,\n      directiveName,\n      directiveArgs,\n      hasDirectives = false,\n      ch;\n\n  state.version = null;\n  state.checkLineBreaks = state.legacy;\n  state.tagMap = Object.create(null);\n  state.anchorMap = Object.create(null);\n\n  while ((ch = state.input.charCodeAt(state.position)) !== 0) {\n    skipSeparationSpace(state, true, -1);\n\n    ch = state.input.charCodeAt(state.position);\n\n    if (state.lineIndent > 0 || ch !== 0x25/* % */) {\n      break;\n    }\n\n    hasDirectives = true;\n    ch = state.input.charCodeAt(++state.position);\n    _position = state.position;\n\n    while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n      ch = state.input.charCodeAt(++state.position);\n    }\n\n    directiveName = state.input.slice(_position, state.position);\n    directiveArgs = [];\n\n    if (directiveName.length < 1) {\n      throwError(state, 'directive name must not be less than one character in length');\n    }\n\n    while (ch !== 0) {\n      while (is_WHITE_SPACE(ch)) {\n        ch = state.input.charCodeAt(++state.position);\n      }\n\n      if (ch === 0x23/* # */) {\n        do { ch = state.input.charCodeAt(++state.position); }\n        while (ch !== 0 && !is_EOL(ch));\n        break;\n      }\n\n      if (is_EOL(ch)) break;\n\n      _position = state.position;\n\n      while (ch !== 0 && !is_WS_OR_EOL(ch)) {\n        ch = state.input.charCodeAt(++state.position);\n      }\n\n      directiveArgs.push(state.input.slice(_position, state.position));\n    }\n\n    if (ch !== 0) readLineBreak(state);\n\n    if (_hasOwnProperty$1.call(directiveHandlers, directiveName)) {\n      directiveHandlers[directiveName](state, directiveName, directiveArgs);\n    } else {\n      throwWarning(state, 'unknown document directive \"' + directiveName + '\"');\n    }\n  }\n\n  skipSeparationSpace(state, true, -1);\n\n  if (state.lineIndent === 0 &&\n      state.input.charCodeAt(state.position)     === 0x2D/* - */ &&\n      state.input.charCodeAt(state.position + 1) === 0x2D/* - */ &&\n      state.input.charCodeAt(state.position + 2) === 0x2D/* - */) {\n    state.position += 3;\n    skipSeparationSpace(state, true, -1);\n\n  } else if (hasDirectives) {\n    throwError(state, 'directives end mark is expected');\n  }\n\n  composeNode(state, state.lineIndent - 1, CONTEXT_BLOCK_OUT, false, true);\n  skipSeparationSpace(state, true, -1);\n\n  if (state.checkLineBreaks &&\n      PATTERN_NON_ASCII_LINE_BREAKS.test(state.input.slice(documentStart, state.position))) {\n    throwWarning(state, 'non-ASCII line breaks are interpreted as content');\n  }\n\n  state.documents.push(state.result);\n\n  if (state.position === state.lineStart && testDocumentSeparator(state)) {\n\n    if (state.input.charCodeAt(state.position) === 0x2E/* . */) {\n      state.position += 3;\n      skipSeparationSpace(state, true, -1);\n    }\n    return;\n  }\n\n  if (state.position < (state.length - 1)) {\n    throwError(state, 'end of the stream or a document separator is expected');\n  } else {\n    return;\n  }\n}\n\n\nfunction loadDocuments(input, options) {\n  input = String(input);\n  options = options || {};\n\n  if (input.length !== 0) {\n\n    // Add tailing `\\n` if not exists\n    if (input.charCodeAt(input.length - 1) !== 0x0A/* LF */ &&\n        input.charCodeAt(input.length - 1) !== 0x0D/* CR */) {\n      input += '\\n';\n    }\n\n    // Strip BOM\n    if (input.charCodeAt(0) === 0xFEFF) {\n      input = input.slice(1);\n    }\n  }\n\n  var state = new State$1(input, options);\n\n  var nullpos = input.indexOf('\\0');\n\n  if (nullpos !== -1) {\n    state.position = nullpos;\n    throwError(state, 'null byte is not allowed in input');\n  }\n\n  // Use 0 as string terminator. That significantly simplifies bounds check.\n  state.input += '\\0';\n\n  while (state.input.charCodeAt(state.position) === 0x20/* Space */) {\n    state.lineIndent += 1;\n    state.position += 1;\n  }\n\n  while (state.position < (state.length - 1)) {\n    readDocument(state);\n  }\n\n  return state.documents;\n}\n\n\nfunction loadAll$1(input, iterator, options) {\n  if (iterator !== null && typeof iterator === 'object' && typeof options === 'undefined') {\n    options = iterator;\n    iterator = null;\n  }\n\n  var documents = loadDocuments(input, options);\n\n  if (typeof iterator !== 'function') {\n    return documents;\n  }\n\n  for (var index = 0, length = documents.length; index < length; index += 1) {\n    iterator(documents[index]);\n  }\n}\n\n\nfunction load$1(input, options) {\n  var documents = loadDocuments(input, options);\n\n  if (documents.length === 0) {\n    /*eslint-disable no-undefined*/\n    return undefined;\n  } else if (documents.length === 1) {\n    return documents[0];\n  }\n  throw new exception('expected a single document in the stream, but found more');\n}\n\n\nvar loadAll_1 = loadAll$1;\nvar load_1    = load$1;\n\nvar loader = {\n\tloadAll: loadAll_1,\n\tload: load_1\n};\n\n/*eslint-disable no-use-before-define*/\n\n\n\n\n\nvar _toString       = Object.prototype.toString;\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar CHAR_BOM                  = 0xFEFF;\nvar CHAR_TAB                  = 0x09; /* Tab */\nvar CHAR_LINE_FEED            = 0x0A; /* LF */\nvar CHAR_CARRIAGE_RETURN      = 0x0D; /* CR */\nvar CHAR_SPACE                = 0x20; /* Space */\nvar CHAR_EXCLAMATION          = 0x21; /* ! */\nvar CHAR_DOUBLE_QUOTE         = 0x22; /* \" */\nvar CHAR_SHARP                = 0x23; /* # */\nvar CHAR_PERCENT              = 0x25; /* % */\nvar CHAR_AMPERSAND            = 0x26; /* & */\nvar CHAR_SINGLE_QUOTE         = 0x27; /* ' */\nvar CHAR_ASTERISK             = 0x2A; /* * */\nvar CHAR_COMMA                = 0x2C; /* , */\nvar CHAR_MINUS                = 0x2D; /* - */\nvar CHAR_COLON                = 0x3A; /* : */\nvar CHAR_EQUALS               = 0x3D; /* = */\nvar CHAR_GREATER_THAN         = 0x3E; /* > */\nvar CHAR_QUESTION             = 0x3F; /* ? */\nvar CHAR_COMMERCIAL_AT        = 0x40; /* @ */\nvar CHAR_LEFT_SQUARE_BRACKET  = 0x5B; /* [ */\nvar CHAR_RIGHT_SQUARE_BRACKET = 0x5D; /* ] */\nvar CHAR_GRAVE_ACCENT         = 0x60; /* ` */\nvar CHAR_LEFT_CURLY_BRACKET   = 0x7B; /* { */\nvar CHAR_VERTICAL_LINE        = 0x7C; /* | */\nvar CHAR_RIGHT_CURLY_BRACKET  = 0x7D; /* } */\n\nvar ESCAPE_SEQUENCES = {};\n\nESCAPE_SEQUENCES[0x00]   = '\\\\0';\nESCAPE_SEQUENCES[0x07]   = '\\\\a';\nESCAPE_SEQUENCES[0x08]   = '\\\\b';\nESCAPE_SEQUENCES[0x09]   = '\\\\t';\nESCAPE_SEQUENCES[0x0A]   = '\\\\n';\nESCAPE_SEQUENCES[0x0B]   = '\\\\v';\nESCAPE_SEQUENCES[0x0C]   = '\\\\f';\nESCAPE_SEQUENCES[0x0D]   = '\\\\r';\nESCAPE_SEQUENCES[0x1B]   = '\\\\e';\nESCAPE_SEQUENCES[0x22]   = '\\\\\"';\nESCAPE_SEQUENCES[0x5C]   = '\\\\\\\\';\nESCAPE_SEQUENCES[0x85]   = '\\\\N';\nESCAPE_SEQUENCES[0xA0]   = '\\\\_';\nESCAPE_SEQUENCES[0x2028] = '\\\\L';\nESCAPE_SEQUENCES[0x2029] = '\\\\P';\n\nvar DEPRECATED_BOOLEANS_SYNTAX = [\n  'y', 'Y', 'yes', 'Yes', 'YES', 'on', 'On', 'ON',\n  'n', 'N', 'no', 'No', 'NO', 'off', 'Off', 'OFF'\n];\n\nvar DEPRECATED_BASE60_SYNTAX = /^[-+]?[0-9_]+(?::[0-9_]+)+(?:\\.[0-9_]*)?$/;\n\nfunction compileStyleMap(schema, map) {\n  var result, keys, index, length, tag, style, type;\n\n  if (map === null) return {};\n\n  result = {};\n  keys = Object.keys(map);\n\n  for (index = 0, length = keys.length; index < length; index += 1) {\n    tag = keys[index];\n    style = String(map[tag]);\n\n    if (tag.slice(0, 2) === '!!') {\n      tag = 'tag:yaml.org,2002:' + tag.slice(2);\n    }\n    type = schema.compiledTypeMap['fallback'][tag];\n\n    if (type && _hasOwnProperty.call(type.styleAliases, style)) {\n      style = type.styleAliases[style];\n    }\n\n    result[tag] = style;\n  }\n\n  return result;\n}\n\nfunction encodeHex(character) {\n  var string, handle, length;\n\n  string = character.toString(16).toUpperCase();\n\n  if (character <= 0xFF) {\n    handle = 'x';\n    length = 2;\n  } else if (character <= 0xFFFF) {\n    handle = 'u';\n    length = 4;\n  } else if (character <= 0xFFFFFFFF) {\n    handle = 'U';\n    length = 8;\n  } else {\n    throw new exception('code point within a string may not be greater than 0xFFFFFFFF');\n  }\n\n  return '\\\\' + handle + common.repeat('0', length - string.length) + string;\n}\n\n\nvar QUOTING_TYPE_SINGLE = 1,\n    QUOTING_TYPE_DOUBLE = 2;\n\nfunction State(options) {\n  this.schema        = options['schema'] || _default;\n  this.indent        = Math.max(1, (options['indent'] || 2));\n  this.noArrayIndent = options['noArrayIndent'] || false;\n  this.skipInvalid   = options['skipInvalid'] || false;\n  this.flowLevel     = (common.isNothing(options['flowLevel']) ? -1 : options['flowLevel']);\n  this.styleMap      = compileStyleMap(this.schema, options['styles'] || null);\n  this.sortKeys      = options['sortKeys'] || false;\n  this.lineWidth     = options['lineWidth'] || 80;\n  this.noRefs        = options['noRefs'] || false;\n  this.noCompatMode  = options['noCompatMode'] || false;\n  this.condenseFlow  = options['condenseFlow'] || false;\n  this.quotingType   = options['quotingType'] === '\"' ? QUOTING_TYPE_DOUBLE : QUOTING_TYPE_SINGLE;\n  this.forceQuotes   = options['forceQuotes'] || false;\n  this.replacer      = typeof options['replacer'] === 'function' ? options['replacer'] : null;\n\n  this.implicitTypes = this.schema.compiledImplicit;\n  this.explicitTypes = this.schema.compiledExplicit;\n\n  this.tag = null;\n  this.result = '';\n\n  this.duplicates = [];\n  this.usedDuplicates = null;\n}\n\n// Indents every line in a string. Empty lines (\\n only) are not indented.\nfunction indentString(string, spaces) {\n  var ind = common.repeat(' ', spaces),\n      position = 0,\n      next = -1,\n      result = '',\n      line,\n      length = string.length;\n\n  while (position < length) {\n    next = string.indexOf('\\n', position);\n    if (next === -1) {\n      line = string.slice(position);\n      position = length;\n    } else {\n      line = string.slice(position, next + 1);\n      position = next + 1;\n    }\n\n    if (line.length && line !== '\\n') result += ind;\n\n    result += line;\n  }\n\n  return result;\n}\n\nfunction generateNextLine(state, level) {\n  return '\\n' + common.repeat(' ', state.indent * level);\n}\n\nfunction testImplicitResolving(state, str) {\n  var index, length, type;\n\n  for (index = 0, length = state.implicitTypes.length; index < length; index += 1) {\n    type = state.implicitTypes[index];\n\n    if (type.resolve(str)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n// [33] s-white ::= s-space | s-tab\nfunction isWhitespace(c) {\n  return c === CHAR_SPACE || c === CHAR_TAB;\n}\n\n// Returns true if the character can be printed without escaping.\n// From YAML 1.2: \"any allowed characters known to be non-printable\n// should also be escaped. [However,] This isn\u2019t mandatory\"\n// Derived from nb-char - \\t - #x85 - #xA0 - #x2028 - #x2029.\nfunction isPrintable(c) {\n  return  (0x00020 <= c && c <= 0x00007E)\n      || ((0x000A1 <= c && c <= 0x00D7FF) && c !== 0x2028 && c !== 0x2029)\n      || ((0x0E000 <= c && c <= 0x00FFFD) && c !== CHAR_BOM)\n      ||  (0x10000 <= c && c <= 0x10FFFF);\n}\n\n// [34] ns-char ::= nb-char - s-white\n// [27] nb-char ::= c-printable - b-char - c-byte-order-mark\n// [26] b-char  ::= b-line-feed | b-carriage-return\n// Including s-white (for some reason, examples doesn't match specs in this aspect)\n// ns-char ::= c-printable - b-line-feed - b-carriage-return - c-byte-order-mark\nfunction isNsCharOrWhitespace(c) {\n  return isPrintable(c)\n    && c !== CHAR_BOM\n    // - b-char\n    && c !== CHAR_CARRIAGE_RETURN\n    && c !== CHAR_LINE_FEED;\n}\n\n// [127]  ns-plain-safe(c) ::= c = flow-out  \u21D2 ns-plain-safe-out\n//                             c = flow-in   \u21D2 ns-plain-safe-in\n//                             c = block-key \u21D2 ns-plain-safe-out\n//                             c = flow-key  \u21D2 ns-plain-safe-in\n// [128] ns-plain-safe-out ::= ns-char\n// [129]  ns-plain-safe-in ::= ns-char - c-flow-indicator\n// [130]  ns-plain-char(c) ::=  ( ns-plain-safe(c) - \u201C:\u201D - \u201C#\u201D )\n//                            | ( /* An ns-char preceding */ \u201C#\u201D )\n//                            | ( \u201C:\u201D /* Followed by an ns-plain-safe(c) */ )\nfunction isPlainSafe(c, prev, inblock) {\n  var cIsNsCharOrWhitespace = isNsCharOrWhitespace(c);\n  var cIsNsChar = cIsNsCharOrWhitespace && !isWhitespace(c);\n  return (\n    // ns-plain-safe\n    inblock ? // c = flow-in\n      cIsNsCharOrWhitespace\n      : cIsNsCharOrWhitespace\n        // - c-flow-indicator\n        && c !== CHAR_COMMA\n        && c !== CHAR_LEFT_SQUARE_BRACKET\n        && c !== CHAR_RIGHT_SQUARE_BRACKET\n        && c !== CHAR_LEFT_CURLY_BRACKET\n        && c !== CHAR_RIGHT_CURLY_BRACKET\n  )\n    // ns-plain-char\n    && c !== CHAR_SHARP // false on '#'\n    && !(prev === CHAR_COLON && !cIsNsChar) // false on ': '\n    || (isNsCharOrWhitespace(prev) && !isWhitespace(prev) && c === CHAR_SHARP) // change to true on '[^ ]#'\n    || (prev === CHAR_COLON && cIsNsChar); // change to true on ':[^ ]'\n}\n\n// Simplified test for values allowed as the first character in plain style.\nfunction isPlainSafeFirst(c) {\n  // Uses a subset of ns-char - c-indicator\n  // where ns-char = nb-char - s-white.\n  // No support of ( ( \u201C?\u201D | \u201C:\u201D | \u201C-\u201D ) /* Followed by an ns-plain-safe(c)) */ ) part\n  return isPrintable(c) && c !== CHAR_BOM\n    && !isWhitespace(c) // - s-white\n    // - (c-indicator ::=\n    // \u201C-\u201D | \u201C?\u201D | \u201C:\u201D | \u201C,\u201D | \u201C[\u201D | \u201C]\u201D | \u201C{\u201D | \u201C}\u201D\n    && c !== CHAR_MINUS\n    && c !== CHAR_QUESTION\n    && c !== CHAR_COLON\n    && c !== CHAR_COMMA\n    && c !== CHAR_LEFT_SQUARE_BRACKET\n    && c !== CHAR_RIGHT_SQUARE_BRACKET\n    && c !== CHAR_LEFT_CURLY_BRACKET\n    && c !== CHAR_RIGHT_CURLY_BRACKET\n    // | \u201C#\u201D | \u201C&\u201D | \u201C*\u201D | \u201C!\u201D | \u201C|\u201D | \u201C=\u201D | \u201C>\u201D | \u201C'\u201D | \u201C\"\u201D\n    && c !== CHAR_SHARP\n    && c !== CHAR_AMPERSAND\n    && c !== CHAR_ASTERISK\n    && c !== CHAR_EXCLAMATION\n    && c !== CHAR_VERTICAL_LINE\n    && c !== CHAR_EQUALS\n    && c !== CHAR_GREATER_THAN\n    && c !== CHAR_SINGLE_QUOTE\n    && c !== CHAR_DOUBLE_QUOTE\n    // | \u201C%\u201D | \u201C@\u201D | \u201C`\u201D)\n    && c !== CHAR_PERCENT\n    && c !== CHAR_COMMERCIAL_AT\n    && c !== CHAR_GRAVE_ACCENT;\n}\n\n// Simplified test for values allowed as the last character in plain style.\nfunction isPlainSafeLast(c) {\n  // just not whitespace or colon, it will be checked to be plain character later\n  return !isWhitespace(c) && c !== CHAR_COLON;\n}\n\n// Same as 'string'.codePointAt(pos), but works in older browsers.\nfunction codePointAt(string, pos) {\n  var first = string.charCodeAt(pos), second;\n  if (first >= 0xD800 && first <= 0xDBFF && pos + 1 < string.length) {\n    second = string.charCodeAt(pos + 1);\n    if (second >= 0xDC00 && second <= 0xDFFF) {\n      // https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae\n      return (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;\n    }\n  }\n  return first;\n}\n\n// Determines whether block indentation indicator is required.\nfunction needIndentIndicator(string) {\n  var leadingSpaceRe = /^\\n* /;\n  return leadingSpaceRe.test(string);\n}\n\nvar STYLE_PLAIN   = 1,\n    STYLE_SINGLE  = 2,\n    STYLE_LITERAL = 3,\n    STYLE_FOLDED  = 4,\n    STYLE_DOUBLE  = 5;\n\n// Determines which scalar styles are possible and returns the preferred style.\n// lineWidth = -1 => no limit.\n// Pre-conditions: str.length > 0.\n// Post-conditions:\n//    STYLE_PLAIN or STYLE_SINGLE => no \\n are in the string.\n//    STYLE_LITERAL => no lines are suitable for folding (or lineWidth is -1).\n//    STYLE_FOLDED => a line > lineWidth and can be folded (and lineWidth != -1).\nfunction chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth,\n  testAmbiguousType, quotingType, forceQuotes, inblock) {\n\n  var i;\n  var char = 0;\n  var prevChar = null;\n  var hasLineBreak = false;\n  var hasFoldableLine = false; // only checked if shouldTrackWidth\n  var shouldTrackWidth = lineWidth !== -1;\n  var previousLineBreak = -1; // count the first line correctly\n  var plain = isPlainSafeFirst(codePointAt(string, 0))\n          && isPlainSafeLast(codePointAt(string, string.length - 1));\n\n  if (singleLineOnly || forceQuotes) {\n    // Case: no block styles.\n    // Check for disallowed characters to rule out plain and single.\n    for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n      char = codePointAt(string, i);\n      if (!isPrintable(char)) {\n        return STYLE_DOUBLE;\n      }\n      plain = plain && isPlainSafe(char, prevChar, inblock);\n      prevChar = char;\n    }\n  } else {\n    // Case: block styles permitted.\n    for (i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n      char = codePointAt(string, i);\n      if (char === CHAR_LINE_FEED) {\n        hasLineBreak = true;\n        // Check if any line can be folded.\n        if (shouldTrackWidth) {\n          hasFoldableLine = hasFoldableLine ||\n            // Foldable line = too long, and not more-indented.\n            (i - previousLineBreak - 1 > lineWidth &&\n             string[previousLineBreak + 1] !== ' ');\n          previousLineBreak = i;\n        }\n      } else if (!isPrintable(char)) {\n        return STYLE_DOUBLE;\n      }\n      plain = plain && isPlainSafe(char, prevChar, inblock);\n      prevChar = char;\n    }\n    // in case the end is missing a \\n\n    hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&\n      (i - previousLineBreak - 1 > lineWidth &&\n       string[previousLineBreak + 1] !== ' '));\n  }\n  // Although every style can represent \\n without escaping, prefer block styles\n  // for multiline, since they're more readable and they don't add empty lines.\n  // Also prefer folding a super-long line.\n  if (!hasLineBreak && !hasFoldableLine) {\n    // Strings interpretable as another type have to be quoted;\n    // e.g. the string 'true' vs. the boolean true.\n    if (plain && !forceQuotes && !testAmbiguousType(string)) {\n      return STYLE_PLAIN;\n    }\n    return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n  }\n  // Edge case: block indentation indicator can only have one digit.\n  if (indentPerLevel > 9 && needIndentIndicator(string)) {\n    return STYLE_DOUBLE;\n  }\n  // At this point we know block styles are valid.\n  // Prefer literal style unless we want to fold.\n  if (!forceQuotes) {\n    return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;\n  }\n  return quotingType === QUOTING_TYPE_DOUBLE ? STYLE_DOUBLE : STYLE_SINGLE;\n}\n\n// Note: line breaking/folding is implemented for only the folded style.\n// NB. We drop the last trailing newline (if any) of a returned block scalar\n//  since the dumper adds its own newline. This always works:\n//    \u2022 No ending newline => unaffected; already using strip \"-\" chomping.\n//    \u2022 Ending newline    => removed then restored.\n//  Importantly, this keeps the \"+\" chomp indicator from gaining an extra line.\nfunction writeScalar(state, string, level, iskey, inblock) {\n  state.dump = (function () {\n    if (string.length === 0) {\n      return state.quotingType === QUOTING_TYPE_DOUBLE ? '\"\"' : \"''\";\n    }\n    if (!state.noCompatMode) {\n      if (DEPRECATED_BOOLEANS_SYNTAX.indexOf(string) !== -1 || DEPRECATED_BASE60_SYNTAX.test(string)) {\n        return state.quotingType === QUOTING_TYPE_DOUBLE ? ('\"' + string + '\"') : (\"'\" + string + \"'\");\n      }\n    }\n\n    var indent = state.indent * Math.max(1, level); // no 0-indent scalars\n    // As indentation gets deeper, let the width decrease monotonically\n    // to the lower bound min(state.lineWidth, 40).\n    // Note that this implies\n    //  state.lineWidth \u2264 40 + state.indent: width is fixed at the lower bound.\n    //  state.lineWidth > 40 + state.indent: width decreases until the lower bound.\n    // This behaves better than a constant minimum width which disallows narrower options,\n    // or an indent threshold which causes the width to suddenly increase.\n    var lineWidth = state.lineWidth === -1\n      ? -1 : Math.max(Math.min(state.lineWidth, 40), state.lineWidth - indent);\n\n    // Without knowing if keys are implicit/explicit, assume implicit for safety.\n    var singleLineOnly = iskey\n      // No block styles in flow mode.\n      || (state.flowLevel > -1 && level >= state.flowLevel);\n    function testAmbiguity(string) {\n      return testImplicitResolving(state, string);\n    }\n\n    switch (chooseScalarStyle(string, singleLineOnly, state.indent, lineWidth,\n      testAmbiguity, state.quotingType, state.forceQuotes && !iskey, inblock)) {\n\n      case STYLE_PLAIN:\n        return string;\n      case STYLE_SINGLE:\n        return \"'\" + string.replace(/'/g, \"''\") + \"'\";\n      case STYLE_LITERAL:\n        return '|' + blockHeader(string, state.indent)\n          + dropEndingNewline(indentString(string, indent));\n      case STYLE_FOLDED:\n        return '>' + blockHeader(string, state.indent)\n          + dropEndingNewline(indentString(foldString(string, lineWidth), indent));\n      case STYLE_DOUBLE:\n        return '\"' + escapeString(string) + '\"';\n      default:\n        throw new exception('impossible error: invalid scalar style');\n    }\n  }());\n}\n\n// Pre-conditions: string is valid for a block scalar, 1 <= indentPerLevel <= 9.\nfunction blockHeader(string, indentPerLevel) {\n  var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';\n\n  // note the special case: the string '\\n' counts as a \"trailing\" empty line.\n  var clip =          string[string.length - 1] === '\\n';\n  var keep = clip && (string[string.length - 2] === '\\n' || string === '\\n');\n  var chomp = keep ? '+' : (clip ? '' : '-');\n\n  return indentIndicator + chomp + '\\n';\n}\n\n// (See the note for writeScalar.)\nfunction dropEndingNewline(string) {\n  return string[string.length - 1] === '\\n' ? string.slice(0, -1) : string;\n}\n\n// Note: a long line without a suitable break point will exceed the width limit.\n// Pre-conditions: every char in str isPrintable, str.length > 0, width > 0.\nfunction foldString(string, width) {\n  // In folded style, $k$ consecutive newlines output as $k+1$ newlines\u2014\n  // unless they're before or after a more-indented line, or at the very\n  // beginning or end, in which case $k$ maps to $k$.\n  // Therefore, parse each chunk as newline(s) followed by a content line.\n  var lineRe = /(\\n+)([^\\n]*)/g;\n\n  // first line (possibly an empty line)\n  var result = (function () {\n    var nextLF = string.indexOf('\\n');\n    nextLF = nextLF !== -1 ? nextLF : string.length;\n    lineRe.lastIndex = nextLF;\n    return foldLine(string.slice(0, nextLF), width);\n  }());\n  // If we haven't reached the first content line yet, don't add an extra \\n.\n  var prevMoreIndented = string[0] === '\\n' || string[0] === ' ';\n  var moreIndented;\n\n  // rest of the lines\n  var match;\n  while ((match = lineRe.exec(string))) {\n    var prefix = match[1], line = match[2];\n    moreIndented = (line[0] === ' ');\n    result += prefix\n      + (!prevMoreIndented && !moreIndented && line !== ''\n        ? '\\n' : '')\n      + foldLine(line, width);\n    prevMoreIndented = moreIndented;\n  }\n\n  return result;\n}\n\n// Greedy line breaking.\n// Picks the longest line under the limit each time,\n// otherwise settles for the shortest line over the limit.\n// NB. More-indented lines *cannot* be folded, as that would add an extra \\n.\nfunction foldLine(line, width) {\n  if (line === '' || line[0] === ' ') return line;\n\n  // Since a more-indented line adds a \\n, breaks can't be followed by a space.\n  var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.\n  var match;\n  // start is an inclusive index. end, curr, and next are exclusive.\n  var start = 0, end, curr = 0, next = 0;\n  var result = '';\n\n  // Invariants: 0 <= start <= length-1.\n  //   0 <= curr <= next <= max(0, length-2). curr - start <= width.\n  // Inside the loop:\n  //   A match implies length >= 2, so curr and next are <= length-2.\n  while ((match = breakRe.exec(line))) {\n    next = match.index;\n    // maintain invariant: curr - start <= width\n    if (next - start > width) {\n      end = (curr > start) ? curr : next; // derive end <= length-2\n      result += '\\n' + line.slice(start, end);\n      // skip the space that was output as \\n\n      start = end + 1;                    // derive start <= length-1\n    }\n    curr = next;\n  }\n\n  // By the invariants, start <= length-1, so there is something left over.\n  // It is either the whole string or a part starting from non-whitespace.\n  result += '\\n';\n  // Insert a break if the remainder is too long and there is a break available.\n  if (line.length - start > width && curr > start) {\n    result += line.slice(start, curr) + '\\n' + line.slice(curr + 1);\n  } else {\n    result += line.slice(start);\n  }\n\n  return result.slice(1); // drop extra \\n joiner\n}\n\n// Escapes a double-quoted string.\nfunction escapeString(string) {\n  var result = '';\n  var char = 0;\n  var escapeSeq;\n\n  for (var i = 0; i < string.length; char >= 0x10000 ? i += 2 : i++) {\n    char = codePointAt(string, i);\n    escapeSeq = ESCAPE_SEQUENCES[char];\n\n    if (!escapeSeq && isPrintable(char)) {\n      result += string[i];\n      if (char >= 0x10000) result += string[i + 1];\n    } else {\n      result += escapeSeq || encodeHex(char);\n    }\n  }\n\n  return result;\n}\n\nfunction writeFlowSequence(state, level, object) {\n  var _result = '',\n      _tag    = state.tag,\n      index,\n      length,\n      value;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    value = object[index];\n\n    if (state.replacer) {\n      value = state.replacer.call(object, String(index), value);\n    }\n\n    // Write only valid elements, put null instead of invalid elements.\n    if (writeNode(state, level, value, false, false) ||\n        (typeof value === 'undefined' &&\n         writeNode(state, level, null, false, false))) {\n\n      if (_result !== '') _result += ',' + (!state.condenseFlow ? ' ' : '');\n      _result += state.dump;\n    }\n  }\n\n  state.tag = _tag;\n  state.dump = '[' + _result + ']';\n}\n\nfunction writeBlockSequence(state, level, object, compact) {\n  var _result = '',\n      _tag    = state.tag,\n      index,\n      length,\n      value;\n\n  for (index = 0, length = object.length; index < length; index += 1) {\n    value = object[index];\n\n    if (state.replacer) {\n      value = state.replacer.call(object, String(index), value);\n    }\n\n    // Write only valid elements, put null instead of invalid elements.\n    if (writeNode(state, level + 1, value, true, true, false, true) ||\n        (typeof value === 'undefined' &&\n         writeNode(state, level + 1, null, true, true, false, true))) {\n\n      if (!compact || _result !== '') {\n        _result += generateNextLine(state, level);\n      }\n\n      if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n        _result += '-';\n      } else {\n        _result += '- ';\n      }\n\n      _result += state.dump;\n    }\n  }\n\n  state.tag = _tag;\n  state.dump = _result || '[]'; // Empty sequence if no valid values.\n}\n\nfunction writeFlowMapping(state, level, object) {\n  var _result       = '',\n      _tag          = state.tag,\n      objectKeyList = Object.keys(object),\n      index,\n      length,\n      objectKey,\n      objectValue,\n      pairBuffer;\n\n  for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n\n    pairBuffer = '';\n    if (_result !== '') pairBuffer += ', ';\n\n    if (state.condenseFlow) pairBuffer += '\"';\n\n    objectKey = objectKeyList[index];\n    objectValue = object[objectKey];\n\n    if (state.replacer) {\n      objectValue = state.replacer.call(object, objectKey, objectValue);\n    }\n\n    if (!writeNode(state, level, objectKey, false, false)) {\n      continue; // Skip this pair because of invalid key;\n    }\n\n    if (state.dump.length > 1024) pairBuffer += '? ';\n\n    pairBuffer += state.dump + (state.condenseFlow ? '\"' : '') + ':' + (state.condenseFlow ? '' : ' ');\n\n    if (!writeNode(state, level, objectValue, false, false)) {\n      continue; // Skip this pair because of invalid value.\n    }\n\n    pairBuffer += state.dump;\n\n    // Both key and value are valid.\n    _result += pairBuffer;\n  }\n\n  state.tag = _tag;\n  state.dump = '{' + _result + '}';\n}\n\nfunction writeBlockMapping(state, level, object, compact) {\n  var _result       = '',\n      _tag          = state.tag,\n      objectKeyList = Object.keys(object),\n      index,\n      length,\n      objectKey,\n      objectValue,\n      explicitPair,\n      pairBuffer;\n\n  // Allow sorting keys so that the output file is deterministic\n  if (state.sortKeys === true) {\n    // Default sorting\n    objectKeyList.sort();\n  } else if (typeof state.sortKeys === 'function') {\n    // Custom sort function\n    objectKeyList.sort(state.sortKeys);\n  } else if (state.sortKeys) {\n    // Something is wrong\n    throw new exception('sortKeys must be a boolean or a function');\n  }\n\n  for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n    pairBuffer = '';\n\n    if (!compact || _result !== '') {\n      pairBuffer += generateNextLine(state, level);\n    }\n\n    objectKey = objectKeyList[index];\n    objectValue = object[objectKey];\n\n    if (state.replacer) {\n      objectValue = state.replacer.call(object, objectKey, objectValue);\n    }\n\n    if (!writeNode(state, level + 1, objectKey, true, true, true)) {\n      continue; // Skip this pair because of invalid key.\n    }\n\n    explicitPair = (state.tag !== null && state.tag !== '?') ||\n                   (state.dump && state.dump.length > 1024);\n\n    if (explicitPair) {\n      if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n        pairBuffer += '?';\n      } else {\n        pairBuffer += '? ';\n      }\n    }\n\n    pairBuffer += state.dump;\n\n    if (explicitPair) {\n      pairBuffer += generateNextLine(state, level);\n    }\n\n    if (!writeNode(state, level + 1, objectValue, true, explicitPair)) {\n      continue; // Skip this pair because of invalid value.\n    }\n\n    if (state.dump && CHAR_LINE_FEED === state.dump.charCodeAt(0)) {\n      pairBuffer += ':';\n    } else {\n      pairBuffer += ': ';\n    }\n\n    pairBuffer += state.dump;\n\n    // Both key and value are valid.\n    _result += pairBuffer;\n  }\n\n  state.tag = _tag;\n  state.dump = _result || '{}'; // Empty mapping if no valid pairs.\n}\n\nfunction detectType(state, object, explicit) {\n  var _result, typeList, index, length, type, style;\n\n  typeList = explicit ? state.explicitTypes : state.implicitTypes;\n\n  for (index = 0, length = typeList.length; index < length; index += 1) {\n    type = typeList[index];\n\n    if ((type.instanceOf  || type.predicate) &&\n        (!type.instanceOf || ((typeof object === 'object') && (object instanceof type.instanceOf))) &&\n        (!type.predicate  || type.predicate(object))) {\n\n      if (explicit) {\n        if (type.multi && type.representName) {\n          state.tag = type.representName(object);\n        } else {\n          state.tag = type.tag;\n        }\n      } else {\n        state.tag = '?';\n      }\n\n      if (type.represent) {\n        style = state.styleMap[type.tag] || type.defaultStyle;\n\n        if (_toString.call(type.represent) === '[object Function]') {\n          _result = type.represent(object, style);\n        } else if (_hasOwnProperty.call(type.represent, style)) {\n          _result = type.represent[style](object, style);\n        } else {\n          throw new exception('!<' + type.tag + '> tag resolver accepts not \"' + style + '\" style');\n        }\n\n        state.dump = _result;\n      }\n\n      return true;\n    }\n  }\n\n  return false;\n}\n\n// Serializes `object` and writes it to global `result`.\n// Returns true on success, or false on invalid object.\n//\nfunction writeNode(state, level, object, block, compact, iskey, isblockseq) {\n  state.tag = null;\n  state.dump = object;\n\n  if (!detectType(state, object, false)) {\n    detectType(state, object, true);\n  }\n\n  var type = _toString.call(state.dump);\n  var inblock = block;\n  var tagStr;\n\n  if (block) {\n    block = (state.flowLevel < 0 || state.flowLevel > level);\n  }\n\n  var objectOrArray = type === '[object Object]' || type === '[object Array]',\n      duplicateIndex,\n      duplicate;\n\n  if (objectOrArray) {\n    duplicateIndex = state.duplicates.indexOf(object);\n    duplicate = duplicateIndex !== -1;\n  }\n\n  if ((state.tag !== null && state.tag !== '?') || duplicate || (state.indent !== 2 && level > 0)) {\n    compact = false;\n  }\n\n  if (duplicate && state.usedDuplicates[duplicateIndex]) {\n    state.dump = '*ref_' + duplicateIndex;\n  } else {\n    if (objectOrArray && duplicate && !state.usedDuplicates[duplicateIndex]) {\n      state.usedDuplicates[duplicateIndex] = true;\n    }\n    if (type === '[object Object]') {\n      if (block && (Object.keys(state.dump).length !== 0)) {\n        writeBlockMapping(state, level, state.dump, compact);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + state.dump;\n        }\n      } else {\n        writeFlowMapping(state, level, state.dump);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;\n        }\n      }\n    } else if (type === '[object Array]') {\n      if (block && (state.dump.length !== 0)) {\n        if (state.noArrayIndent && !isblockseq && level > 0) {\n          writeBlockSequence(state, level - 1, state.dump, compact);\n        } else {\n          writeBlockSequence(state, level, state.dump, compact);\n        }\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + state.dump;\n        }\n      } else {\n        writeFlowSequence(state, level, state.dump);\n        if (duplicate) {\n          state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;\n        }\n      }\n    } else if (type === '[object String]') {\n      if (state.tag !== '?') {\n        writeScalar(state, state.dump, level, iskey, inblock);\n      }\n    } else if (type === '[object Undefined]') {\n      return false;\n    } else {\n      if (state.skipInvalid) return false;\n      throw new exception('unacceptable kind of an object to dump ' + type);\n    }\n\n    if (state.tag !== null && state.tag !== '?') {\n      // Need to encode all characters except those allowed by the spec:\n      //\n      // [35] ns-dec-digit    ::=  [#x30-#x39] /* 0-9 */\n      // [36] ns-hex-digit    ::=  ns-dec-digit\n      //                         | [#x41-#x46] /* A-F */ | [#x61-#x66] /* a-f */\n      // [37] ns-ascii-letter ::=  [#x41-#x5A] /* A-Z */ | [#x61-#x7A] /* a-z */\n      // [38] ns-word-char    ::=  ns-dec-digit | ns-ascii-letter | \u201C-\u201D\n      // [39] ns-uri-char     ::=  \u201C%\u201D ns-hex-digit ns-hex-digit | ns-word-char | \u201C#\u201D\n      //                         | \u201C;\u201D | \u201C/\u201D | \u201C?\u201D | \u201C:\u201D | \u201C@\u201D | \u201C&\u201D | \u201C=\u201D | \u201C+\u201D | \u201C$\u201D | \u201C,\u201D\n      //                         | \u201C_\u201D | \u201C.\u201D | \u201C!\u201D | \u201C~\u201D | \u201C*\u201D | \u201C'\u201D | \u201C(\u201D | \u201C)\u201D | \u201C[\u201D | \u201C]\u201D\n      //\n      // Also need to encode '!' because it has special meaning (end of tag prefix).\n      //\n      tagStr = encodeURI(\n        state.tag[0] === '!' ? state.tag.slice(1) : state.tag\n      ).replace(/!/g, '%21');\n\n      if (state.tag[0] === '!') {\n        tagStr = '!' + tagStr;\n      } else if (tagStr.slice(0, 18) === 'tag:yaml.org,2002:') {\n        tagStr = '!!' + tagStr.slice(18);\n      } else {\n        tagStr = '!<' + tagStr + '>';\n      }\n\n      state.dump = tagStr + ' ' + state.dump;\n    }\n  }\n\n  return true;\n}\n\nfunction getDuplicateReferences(object, state) {\n  var objects = [],\n      duplicatesIndexes = [],\n      index,\n      length;\n\n  inspectNode(object, objects, duplicatesIndexes);\n\n  for (index = 0, length = duplicatesIndexes.length; index < length; index += 1) {\n    state.duplicates.push(objects[duplicatesIndexes[index]]);\n  }\n  state.usedDuplicates = new Array(length);\n}\n\nfunction inspectNode(object, objects, duplicatesIndexes) {\n  var objectKeyList,\n      index,\n      length;\n\n  if (object !== null && typeof object === 'object') {\n    index = objects.indexOf(object);\n    if (index !== -1) {\n      if (duplicatesIndexes.indexOf(index) === -1) {\n        duplicatesIndexes.push(index);\n      }\n    } else {\n      objects.push(object);\n\n      if (Array.isArray(object)) {\n        for (index = 0, length = object.length; index < length; index += 1) {\n          inspectNode(object[index], objects, duplicatesIndexes);\n        }\n      } else {\n        objectKeyList = Object.keys(object);\n\n        for (index = 0, length = objectKeyList.length; index < length; index += 1) {\n          inspectNode(object[objectKeyList[index]], objects, duplicatesIndexes);\n        }\n      }\n    }\n  }\n}\n\nfunction dump$1(input, options) {\n  options = options || {};\n\n  var state = new State(options);\n\n  if (!state.noRefs) getDuplicateReferences(input, state);\n\n  var value = input;\n\n  if (state.replacer) {\n    value = state.replacer.call({ '': value }, '', value);\n  }\n\n  if (writeNode(state, 0, value, true, true)) return state.dump + '\\n';\n\n  return '';\n}\n\nvar dump_1 = dump$1;\n\nvar dumper = {\n\tdump: dump_1\n};\n\nfunction renamed(from, to) {\n  return function () {\n    throw new Error('Function yaml.' + from + ' is removed in js-yaml 4. ' +\n      'Use yaml.' + to + ' instead, which is now safe by default.');\n  };\n}\n\n\nvar Type                = type;\nvar Schema              = schema;\nvar FAILSAFE_SCHEMA     = failsafe;\nvar JSON_SCHEMA         = json;\nvar CORE_SCHEMA         = core;\nvar DEFAULT_SCHEMA      = _default;\nvar load                = loader.load;\nvar loadAll             = loader.loadAll;\nvar dump                = dumper.dump;\nvar YAMLException       = exception;\n\n// Re-export all types in case user wants to create custom schema\nvar types = {\n  binary:    binary,\n  float:     float,\n  map:       map,\n  null:      _null,\n  pairs:     pairs,\n  set:       set,\n  timestamp: timestamp,\n  bool:      bool,\n  int:       int,\n  merge:     merge,\n  omap:      omap,\n  seq:       seq,\n  str:       str\n};\n\n// Removed functions from JS-YAML 3.0.x\nvar safeLoad            = renamed('safeLoad', 'load');\nvar safeLoadAll         = renamed('safeLoadAll', 'loadAll');\nvar safeDump            = renamed('safeDump', 'dump');\n\nvar jsYaml = {\n\tType: Type,\n\tSchema: Schema,\n\tFAILSAFE_SCHEMA: FAILSAFE_SCHEMA,\n\tJSON_SCHEMA: JSON_SCHEMA,\n\tCORE_SCHEMA: CORE_SCHEMA,\n\tDEFAULT_SCHEMA: DEFAULT_SCHEMA,\n\tload: load,\n\tloadAll: loadAll,\n\tdump: dump,\n\tYAMLException: YAMLException,\n\ttypes: types,\n\tsafeLoad: safeLoad,\n\tsafeLoadAll: safeLoadAll,\n\tsafeDump: safeDump\n};\n\nexport { CORE_SCHEMA, DEFAULT_SCHEMA, FAILSAFE_SCHEMA, JSON_SCHEMA, Schema, Type, YAMLException, jsYaml as default, dump, load, loadAll, safeDump, safeLoad, safeLoadAll, types };\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ?\n          Math.max(Math.abs(numeric(n[2])), 1)\n        : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: unknown) => void = (\n  pattern: unknown,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string | null): c is ExtglobType =>\n  types.has(c as ExtglobType)\nconst isExtglobAST = (c: AST): c is AST & { type: ExtglobType } =>\n  isExtglobType(c.type)\n\n// Map of which extglob types can adopt the children of a nested extglob\n//\n// anything but ! can adopt a matching type:\n// +(a|+(b|c)|d) => +(a|b|c|d)\n// *(a|*(b|c)|d) => *(a|b|c|d)\n// @(a|@(b|c)|d) => @(a|b|c|d)\n// ?(a|?(b|c)|d) => ?(a|b|c|d)\n//\n// * can adopt anything, because 0 or repetition is allowed\n// *(a|?(b|c)|d) => *(a|b|c|d)\n// *(a|+(b|c)|d) => *(a|b|c|d)\n// *(a|@(b|c)|d) => *(a|b|c|d)\n//\n// + can adopt @, because 1 or repetition is allowed\n// +(a|@(b|c)|d) => +(a|b|c|d)\n//\n// + and @ CANNOT adopt *, because 0 would be allowed\n// +(a|*(b|c)|d) => would match \"\", on *(b|c)\n// @(a|*(b|c)|d) => would match \"\", on *(b|c)\n//\n// + and @ CANNOT adopt ?, because 0 would be allowed\n// +(a|?(b|c)|d) => would match \"\", on ?(b|c)\n// @(a|?(b|c)|d) => would match \"\", on ?(b|c)\n//\n// ? can adopt @, because 0 or 1 is allowed\n// ?(a|@(b|c)|d) => ?(a|b|c|d)\n//\n// ? and @ CANNOT adopt * or +, because >1 would be allowed\n// ?(a|*(b|c)|d) => would match bbb on *(b|c)\n// @(a|*(b|c)|d) => would match bbb on *(b|c)\n// ?(a|+(b|c)|d) => would match bbb on +(b|c)\n// @(a|+(b|c)|d) => would match bbb on +(b|c)\n//\n// ! CANNOT adopt ! (nothing else can either)\n// !(a|!(b|c)|d) => !(a|b|c|d) would fail to match on b (not not b|c)\n//\n// ! can adopt @\n// !(a|@(b|c)|d) => !(a|b|c|d)\n//\n// ! CANNOT adopt *\n// !(a|*(b|c)|d) => !(a|b|c|d) would match on bbb, not allowed\n//\n// ! CANNOT adopt +\n// !(a|+(b|c)|d) => !(a|b|c|d) would match on bbb, not allowed\n//\n// ! CANNOT adopt ?\n// x!(a|?(b|c)|d) => x!(a|b|c|d) would fail to match \"x\"\nconst adoptionMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['@']],\n  ['?', ['?', '@']],\n  ['@', ['@']],\n  ['*', ['*', '+', '?', '@']],\n  ['+', ['+', '@']],\n])\n\n// nested extglobs that can be adopted in, but with the addition of\n// a blank '' element.\nconst adoptionWithSpaceMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['?']],\n  ['@', ['?']],\n  ['+', ['?', '*']],\n])\n\n// union of the previous two maps\nconst adoptionAnyMap = new Map<ExtglobType, ExtglobType[]>([\n  ['!', ['?', '@']],\n  ['?', ['?', '@']],\n  ['@', ['?', '@']],\n  ['*', ['*', '+', '?', '@']],\n  ['+', ['+', '@', '?', '*']],\n])\n\n// Extglobs that can take over their parent if they are the only child\n// the key is parent, value maps child to resulting extglob parent type\n// '@' is omitted because it's a special case. An `@` extglob with a single\n// member can always be usurped by that subpattern.\nconst usurpMap = new Map<ExtglobType, Map<ExtglobType | null, ExtglobType | null>>([\n  ['!', new Map([['!', '@']])],\n  [\n    '?',\n    new Map([\n      ['*', '*'],\n      ['+', '*'],\n    ]),\n  ],\n  [\n    '@',\n    new Map([\n      ['!', '!'],\n      ['?', '?'],\n      ['@', '@'],\n      ['*', '*'],\n      ['+', '+'],\n    ]),\n  ],\n  [\n    '+',\n    new Map([\n      ['?', '*'],\n      ['*', '*'],\n    ]),\n  ],\n])\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nlet ID = 0\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  #parent?: AST\n  #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n  id = ++ID\n\n  get depth(): number {\n    return (this.#parent?.depth ?? -1) + 1\n  }\n\n  [Symbol.for('nodejs.util.inspect.custom')]() {\n    return {\n      '@@type': 'AST',\n      id: this.id,\n      type: this.type,\n      root: this.#root.id,\n      parent: this.#parent?.id,\n      depth: this.depth,\n      partsLength: this.#parts.length,\n      parts: this.#parts,\n    }\n  }\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n    extDepth: number,\n  ): number {\n    const maxDepth = opt.maxExtglobRecursion ?? 2\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        // we don't have to check for adoption here, because that's\n        // done at the other recursion point.\n        const doRecurse =\n          !opt.noext &&\n          isExtglobType(c) &&\n          str.charAt(i) === '(' &&\n          extDepth <= maxDepth\n        if (doRecurse) {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt, extDepth + 1)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      const doRecurse =\n        !opt.noext &&\n        isExtglobType(c) &&\n        str.charAt(i) === '(' &&\n        /* c8 ignore start - the maxDepth is sufficient here */\n        (extDepth <= maxDepth || (ast && ast.#canAdoptType(c)))\n      /* c8 ignore stop */\n      if (doRecurse) {\n        const depthAdd = ast && ast.#canAdoptType(c) ? 0 : 1\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt, extDepth + depthAdd)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  #canAdoptWithSpace(child?: AST | string): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    return this.#canAdopt(child, adoptionWithSpaceMap)\n  }\n\n  #canAdopt(\n    child?: AST | string,\n    map: Map<ExtglobType, ExtglobType[]> = adoptionMap,\n  ): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    if (\n      !child ||\n      typeof child !== 'object' ||\n      child.type !== null ||\n      child.#parts.length !== 1 ||\n      this.type === null\n    ) {\n      return false\n    }\n    const gc = child.#parts[0]\n    if (!gc || typeof gc !== 'object' || gc.type === null) {\n      return false\n    }\n    return (this as AST & { type: ExtglobType }).#canAdoptType(\n      gc.type,\n      map,\n    )\n  }\n  #canAdoptType(\n    c: string,\n    map: Map<ExtglobType, ExtglobType[]> = adoptionAnyMap,\n  ): c is ExtglobType {\n    return !!map.get(this.type as ExtglobType)?.includes(c as ExtglobType)\n  }\n\n  #adoptWithSpace(\n    this: AST & { type: ExtglobType },\n    child: AST & {\n      type: null\n    },\n    index: number,\n  ) {\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    const blank = new AST(null, gc, this.options)\n    blank.#parts.push('')\n    gc.push(blank)\n    this.#adopt(child, index)\n  }\n\n  #adopt(\n    child: AST & {\n      type: null\n    },\n    index: number,\n  ) {\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    this.#parts.splice(index, 1, ...gc.#parts)\n    for (const p of gc.#parts) {\n      if (typeof p === 'object') p.#parent = this\n    }\n    this.#toString = undefined\n  }\n\n  #canUsurpType(c: string): boolean {\n    const m = usurpMap.get(this.type as ExtglobType)\n    return !!(m?.has(c as ExtglobType))\n  }\n\n  #canUsurp (\n    child?: AST | string,\n  ): child is AST & {\n    type: null\n    parts: [AST & { type: ExtglobType }]\n  } {\n    if (\n      !child ||\n      typeof child !== 'object' ||\n      child.type !== null ||\n      child.#parts.length !== 1 ||\n      this.type === null ||\n      this.#parts.length !== 1\n    ) {\n      return false\n    }\n    const gc = child.#parts[0]\n    if (!gc || typeof gc !== 'object' || gc.type === null) {\n      return false\n    }\n    return (this as AST & { type: ExtglobType }).#canUsurpType(gc.type)\n  }\n\n  #usurp(this: AST & { type: ExtglobType }, child: AST & { type: null }) {\n    const m = usurpMap.get(this.type as ExtglobType)\n    const gc = child.#parts[0] as AST & { type: ExtglobType }\n    const nt = m?.get(gc.type)\n    /* c8 ignore start - impossible */\n    if (!nt) return false\n    /* c8 ignore stop */\n    this.#parts = gc.#parts\n    for (const p of this.#parts) {\n      if (typeof p === 'object') {\n        p.#parent = this\n      }\n    }\n    this.type = nt\n    this.#toString = undefined\n    this.#emptyExt = false\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options, 0)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) {\n      this.#flatten()\n      this.#fillNegs()\n    }\n    if (!isExtglobAST(this)) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      const me = this as AST\n      me.#parts = [s]\n      me.type = null\n      me.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #flatten() {\n    if (!isExtglobAST(this)) {\n      for (const p of this.#parts) {\n        if (typeof p === 'object') {\n          p.#flatten()\n        }\n      }\n    } else {\n      // do up to 10 passes to flatten as much as possible\n      let iterations = 0\n      let done = false\n      do {\n        done = true\n        for (let i = 0; i < this.#parts.length; i++) {\n          const c = this.#parts[i]\n          if (typeof c === 'object') {\n            c.#flatten()\n            if (this.#canAdopt(c)) {\n              done = false\n              this.#adopt(c, i)\n            } else if (this.#canAdoptWithSpace(c)) {\n              done = false\n              this.#adoptWithSpace(c, i)\n            } else if (this.#canUsurp(c)) {\n              done = false\n              this.#usurp(c)\n            }\n          }\n        }\n      } while (!done && ++iterations < 10)\n    }\n    this.#toString = undefined\n  }\n\n  #partsToRegExp(this: AST & { type: ExtglobType }, dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n  /**\n   * Max number of non-adjacent `**` patterns to recursively walk down.\n   *\n   * The default of 200 is almost certainly high enough for most purposes,\n   * and can handle absurdly excessive patterns.\n   */\n  maxGlobstarRecursion?: number\n\n  /**\n   * Max depth to traverse for nested extglobs like `*(a|b|c)`\n   *\n   * Default is 2, which is quite low, but any higher value\n   * swiftly results in punishing performance impacts. Note\n   * that this is *not*  relevant when the globstar types can\n   * be safely coalesced into a single set.\n   *\n   * For example, `*(a|@(b|c)|d)` would be flattened into\n   * `*(a|b|c|d)`. Thus, many common extglobs will retain good\n   * performance and  never hit this limit, even if they are\n   * excessively deep and complicated.\n   *\n   * If the limit is hit, then the extglob characters are simply\n   * not parsed, and the pattern effectively switches into\n   * `noextglob: true` mode for the contents of that nested\n   * sub-pattern. This will typically _not_ result in a match,\n   * but is considered a valid trade-off for security and\n   * performance.\n   */\n  maxExtglobRecursion?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n  maxGlobstarRecursion: number\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.maxGlobstarRecursion = options.maxGlobstarRecursion ?? 200\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    let fileStartIndex = 0\n    let patternStartIndex = 0\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        // start matching at the drive letter index of each\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          patternStartIndex = pdi\n          fileStartIndex = fdi\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    if (pattern.includes(GLOBSTAR)) {\n      return this.#matchGlobstar(\n        file,\n        pattern,\n        partial,\n        fileStartIndex,\n        patternStartIndex,\n      )\n    }\n\n    return this.#matchOne(\n      file,\n      pattern,\n      partial,\n      fileStartIndex,\n      patternStartIndex,\n    )\n  }\n\n  #matchGlobstar(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean,\n    fileIndex: number,\n    patternIndex: number,\n  ) {\n    // split the pattern into head, tail, and middle of ** delimited parts\n    const firstgs = pattern.indexOf(GLOBSTAR, patternIndex)\n    const lastgs = pattern.lastIndexOf(GLOBSTAR)\n\n    // split the pattern up into globstar-delimited sections\n    // the tail has to be at the end, and the others just have\n    // to be found in order from the head.\n    const [head, body, tail] = partial ? [\n      pattern.slice(patternIndex, firstgs),\n      pattern.slice(firstgs + 1),\n      [],\n    ] : [\n      pattern.slice(patternIndex, firstgs),\n      pattern.slice(firstgs + 1, lastgs),\n      pattern.slice(lastgs + 1),\n    ]\n\n    // check the head, from the current file/pattern index.\n    if (head.length) {\n      const fileHead = file.slice(fileIndex, fileIndex + head.length)\n      if (!this.#matchOne(fileHead, head, partial, 0, 0)) {\n        return false\n      }\n      fileIndex += head.length\n      patternIndex += head.length\n    }\n    // now we know the head matches!\n\n    // if the last portion is not empty, it MUST match the end\n    // check the tail\n    let fileTailMatch: number = 0\n    if (tail.length) {\n      // if head + tail > file, then we cannot possibly match\n      if (tail.length + fileIndex > file.length) return false\n\n      // try to match the tail\n      let tailStart = file.length - tail.length\n      if (this.#matchOne(file, tail, partial, tailStart, 0)) {\n        fileTailMatch = tail.length\n      } else {\n        // affordance for stuff like a/**/* matching a/b/\n        // if the last file portion is '', and there's more to the pattern\n        // then try without the '' bit.\n        if (\n          file[file.length - 1] !== '' ||\n          fileIndex + tail.length === file.length\n        ) {\n          return false\n        }\n        tailStart--\n        if (!this.#matchOne(file, tail, partial, tailStart, 0)) {\n          return false\n        }\n        fileTailMatch = tail.length + 1\n      }\n    }\n\n    // now we know the tail matches!\n\n    // the middle is zero or more portions wrapped in **, possibly\n    // containing more ** sections.\n    // so a/**/b/**/c/**/d has become **/b/**/c/**\n    // if it's empty, it means a/**/b, just verify we have no bad dots\n    // if there's no tail, so it ends on /**, then we must have *something*\n    // after the head, or it's not a matc\n    if (!body.length) {\n      let sawSome = !!fileTailMatch\n      for (let i = fileIndex; i < file.length - fileTailMatch; i++) {\n        const f = String(file[i])\n        sawSome = true\n        if (\n          f === '.' ||\n          f === '..' ||\n          (!this.options.dot && f.startsWith('.'))\n        ) {\n          return false\n        }\n      }\n      // in partial mode, we just need to get past all file parts\n      return partial || sawSome\n    }\n\n    // now we know that there's one or more body sections, which can\n    // be matched anywhere from the 0 index (because the head was pruned)\n    // through to the length-fileTailMatch index.\n    // split the body up into sections, and note the minimum index it can\n    // be found at (start with the length of all previous segments)\n    // [section, before, after]\n    const bodySegments: [ParseReturn[], number][] = [[[], 0]]\n    let currentBody: [ParseReturn[], number] = bodySegments[0]\n    let nonGsParts = 0\n    const nonGsPartsSums: number[] = [0]\n    for (const b of body) {\n      if (b === GLOBSTAR) {\n        nonGsPartsSums.push(nonGsParts)\n        currentBody = [[], 0]\n        bodySegments.push(currentBody)\n      } else {\n        currentBody[0].push(b)\n        nonGsParts++\n      }\n    }\n    let i = bodySegments.length - 1\n    const fileLength = file.length - fileTailMatch\n    for (const b of bodySegments) {\n      b[1] = fileLength - ((nonGsPartsSums[i--] as number) + b[0].length)\n    }\n\n    return !!this.#matchGlobStarBodySections(\n      file,\n      bodySegments,\n      fileIndex,\n      0,\n      partial,\n      0,\n      !!fileTailMatch,\n    )\n  }\n\n  // return false for \"nope, not matching\"\n  // return null for \"not matching, cannot keep trying\"\n  #matchGlobStarBodySections(\n    file: string[],\n    // pattern section, last possible position for it\n    bodySegments: [ParseReturn[], number][],\n    fileIndex: number,\n    bodyIndex: number,\n    partial: boolean,\n    globStarDepth: number,\n    sawTail: boolean,\n  ): boolean | null {\n    // take the first body segment, and walk from fileIndex to its \"after\"\n    // value at the end\n    // If it doesn't match at that position, we increment, until we hit\n    // that final possible position, and give up.\n    // If it does match, then advance and try to rest.\n    // If any of them fail we keep walking forward.\n    // this is still a bit recursively painful, but it's more constrained\n    // than previous implementations, because we never test something that\n    // can't possibly be a valid matching condition.\n    const bs = bodySegments[bodyIndex]\n    if (!bs) {\n      // just make sure that there's no bad dots\n      for (let i = fileIndex; i < file.length; i++) {\n        sawTail = true\n        const f = file[i]\n        if (\n          f === '.' ||\n          f === '..' ||\n          (!this.options.dot && f.startsWith('.'))\n        ) {\n          return false\n        }\n      }\n      return sawTail\n    }\n\n    // have a non-globstar body section to test\n    const [body, after] = bs\n    while (fileIndex <= after) {\n      const m = this.#matchOne(\n        file.slice(0, fileIndex + body.length),\n        body,\n        partial,\n        fileIndex,\n        0,\n      )\n      // if limit exceeded, no match. intentional false negative,\n      // acceptable break in correctness for security.\n      if (m && globStarDepth < this.maxGlobstarRecursion) {\n        // match! see if the rest match. if so, we're done!\n        const sub = this.#matchGlobStarBodySections(\n          file,\n          bodySegments,\n          fileIndex + body.length,\n          bodyIndex + 1,\n          partial,\n          globStarDepth + 1,\n          sawTail,\n        )\n        if (sub !== false) {\n          return sub\n        }\n      }\n      const f = file[fileIndex]\n      if (\n        f === '.' ||\n        f === '..' ||\n        (!this.options.dot && f.startsWith('.'))\n      ) {\n        return false\n      }\n\n      fileIndex++\n    }\n    // walked off. no point continuing\n    return partial || null\n  }\n\n  #matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean,\n    fileIndex: number,\n    patternIndex: number,\n  ) {\n    let fi: number\n    let pi: number\n    let pl: number\n    let fl: number\n    for (\n      fi = fileIndex,\n        pi = patternIndex,\n        fl = file.length,\n        pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      let p = pattern[pi]\n      let f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false || p === GLOBSTAR) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "/** Main retry orchestration logic for CDS compilation failures. */\n\nimport { join } from 'path';\n\nimport { compileCdsToJson } from './compile';\nimport type {\n  CompilationAttempt,\n  CompilationTask,\n  ResultRetryCompilationTask,\n  ResultRetryCompilationOrchestration,\n  ValidatedCdsCommand,\n} from './types';\nimport { identifyTasksRequiringRetry, updateCdsDependencyGraphStatus } from './validator';\nimport { addCompilationDiagnostic } from '../../diagnostics';\nimport { cdsExtractorLog } from '../../logging';\nimport { needsFullDependencyInstallation, projectInstallDependencies } from '../../packageManager';\nimport type { CdsDependencyGraph, CdsProject } from '../parser';\n\n/**\n * Add diagnostics only for tasks with `status: failed` in the {@link CdsDependencyGraph}.\n *\n * Compilation is project-level: a single failed task represents the whole project's\n * compilation failure, even though the task's `sourceFiles` may list every CDS file\n * in the project. To avoid spawning the CodeQL CLI once per source file (which can\n * take tens of minutes for projects with hundreds of `.cds` files), we emit a single\n * diagnostic per failed task, attached to the project's `package.json` when available\n * (or the project directory otherwise), and mention the affected file count in the\n * message body so that information is preserved.\n *\n * @param dependencyGraph The dependency graph to use as the source of truth for task status\n * @param codeqlExePath Path to CodeQL executable used to add a diagnostic notification\n * @param sourceRoot Source root directory to use for making file paths relative\n */\nfunction addCompilationDiagnosticsForFailedTasks(\n  dependencyGraph: CdsDependencyGraph,\n  codeqlExePath: string,\n  sourceRoot: string,\n): void {\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      // Add diagnostics for tasks that currently have a `status` of 'failed'.\n      if (task.status === 'failed') {\n        // Add a diagnostic if the task:\n        //  - failed initially and was never retried, or...\n        //  - failed initially and was retried without success (or without updating status).\n        const shouldAddDiagnostic = task.retryInfo?.hasBeenRetried ?? !task.retryInfo;\n\n        if (shouldAddDiagnostic) {\n          // Attach the diagnostic to the project's package.json when available,\n          // otherwise fall back to the project directory itself.\n          const diagnosticPath = project.packageJson\n            ? join(project.projectDir, 'package.json')\n            : project.projectDir;\n\n          const fileCount = task.sourceFiles.length;\n          const fileWord = fileCount === 1 ? 'file' : 'files';\n          const baseMessage = task.errorSummary ?? 'Compilation failed';\n          const messageWithCount = `${baseMessage}\\n\\n${fileCount} CDS ${fileWord} in this project ${fileCount === 1 ? 'was' : 'were'} not extracted.`;\n\n          addCompilationDiagnostic(diagnosticPath, messageWithCount, codeqlExePath, sourceRoot);\n        }\n      }\n    }\n  }\n}\n\n/**\n * Main orchestration function for retrying failed tasks in the {@link CdsDependencyGraph}.\n * @param dependencyGraph The dependency graph containing compilation tasks\n * @param codeqlExePath Path to `codeql` executable to use for adding diagnostic notifications\n * @returns The {@link ResultRetryCompilationOrchestration}\n */\nexport function orchestrateRetryAttempts(\n  dependencyGraph: CdsDependencyGraph,\n  codeqlExePath: string,\n): ResultRetryCompilationOrchestration {\n  const startTime = Date.now();\n  let dependencyInstallationStartTime = 0;\n  let dependencyInstallationEndTime = 0;\n  let retryCompilationStartTime = 0;\n  let retryCompilationEndTime = 0;\n\n  const result: ResultRetryCompilationOrchestration = {\n    success: true,\n    projectsWithRetries: [],\n    totalTasksRequiringRetry: 0,\n    totalSuccessfulRetries: 0,\n    totalFailedRetries: 0,\n    projectsWithSuccessfulDependencyInstallation: [],\n    projectsWithFailedDependencyInstallation: [],\n    retryDurationMs: 0,\n    dependencyInstallationDurationMs: 0,\n    retryCompilationDurationMs: 0,\n  };\n\n  try {\n    // Phase 1: Validate current outputs and identify failed tasks.\n    cdsExtractorLog('info', 'Identifying tasks requiring retry...');\n    const tasksRequiringRetry = identifyTasksRequiringRetry(dependencyGraph);\n\n    if (tasksRequiringRetry.size === 0) {\n      cdsExtractorLog('info', 'No tasks require retry - all compilations successful');\n      return result;\n    }\n\n    // Update retry status tracking.\n    result.totalTasksRequiringRetry = Array.from(tasksRequiringRetry.values()).reduce(\n      (sum, tasks) => sum + tasks.length,\n      0,\n    );\n    dependencyGraph.retryStatus.totalTasksRequiringRetry = result.totalTasksRequiringRetry;\n\n    // Phase 2: Install full dependencies for projects with failed tasks.\n    dependencyInstallationStartTime = Date.now();\n    for (const [projectDir, failedTasks] of tasksRequiringRetry) {\n      const project = dependencyGraph.projects.get(projectDir);\n      if (!project) {\n        continue;\n      }\n\n      if (needsFullDependencyInstallation(project)) {\n        try {\n          const installResult = projectInstallDependencies(project, dependencyGraph.sourceRootDir);\n\n          // Update project retry status.\n          project.retryStatus ??= {\n            fullDependenciesInstalled: false,\n            tasksRequiringRetry: failedTasks.length,\n            tasksRetried: 0,\n            installationErrors: [],\n          };\n\n          if (installResult.success) {\n            project.retryStatus.fullDependenciesInstalled = true;\n            result.projectsWithSuccessfulDependencyInstallation.push(projectDir);\n            dependencyGraph.retryStatus.projectsWithFullDependencies.add(projectDir);\n          } else {\n            project.retryStatus.installationErrors = [\n              ...(project.retryStatus.installationErrors ?? []),\n              installResult.error ?? 'Unknown installation error',\n            ];\n            result.projectsWithFailedDependencyInstallation.push(projectDir);\n          }\n\n          if (installResult.warnings.length > 0) {\n            for (const warning of installResult.warnings) {\n              dependencyGraph.errors.warnings.push({\n                phase: 'retry_dependency_installation',\n                message: warning,\n                timestamp: new Date(),\n                context: projectDir,\n              });\n            }\n          }\n        } catch (error) {\n          const errorMessage = `Failed to install full dependencies for project ${projectDir}: ${String(error)}`;\n          cdsExtractorLog('error', errorMessage);\n\n          dependencyGraph.errors.critical.push({\n            phase: 'retry_dependency_installation',\n            message: errorMessage,\n            timestamp: new Date(),\n          });\n\n          result.projectsWithFailedDependencyInstallation.push(projectDir);\n        }\n      }\n\n      dependencyGraph.retryStatus.projectsRequiringFullDependencies.add(projectDir);\n    }\n\n    dependencyInstallationEndTime = Date.now();\n    result.dependencyInstallationDurationMs =\n      dependencyInstallationEndTime - dependencyInstallationStartTime;\n\n    // Phase 3: Execute retry compilation attempts.\n    cdsExtractorLog('info', 'Executing retry compilation attempts...');\n    retryCompilationStartTime = Date.now();\n\n    for (const [projectDir, failedTasks] of tasksRequiringRetry) {\n      const project = dependencyGraph.projects.get(projectDir);\n      if (!project) {\n        continue;\n      }\n\n      const retryExecutionResult = retryCompilationTasksForProject(\n        failedTasks,\n        project,\n        dependencyGraph,\n      );\n\n      result.projectsWithRetries.push(projectDir);\n      result.totalSuccessfulRetries += retryExecutionResult.successfulRetries;\n      result.totalFailedRetries += retryExecutionResult.failedRetries;\n\n      // Update project retry status.\n      if (project.retryStatus) {\n        project.retryStatus.tasksRetried = retryExecutionResult.retriedTasks.length;\n      }\n    }\n\n    retryCompilationEndTime = Date.now();\n    result.retryCompilationDurationMs = retryCompilationEndTime - retryCompilationStartTime;\n\n    // After retry compilation attempts complete, update status.\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Phase 4: Update dependency graph with retry results.\n    updateDependencyGraphWithRetryResults(dependencyGraph, result);\n\n    // Phase 5: Add diagnostics for definitively failed tasks.\n    addCompilationDiagnosticsForFailedTasks(\n      dependencyGraph,\n      codeqlExePath,\n      dependencyGraph.sourceRootDir,\n    );\n\n    result.success = result.totalSuccessfulRetries > 0 || result.totalTasksRequiringRetry === 0;\n  } catch (error) {\n    const errorMessage = `Retry orchestration failed: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'retry_orchestration',\n      message: errorMessage,\n      timestamp: new Date(),\n    });\n\n    result.success = false;\n  } finally {\n    result.retryDurationMs = Date.now() - startTime;\n  }\n\n  return result;\n}\n\n/**\n * Retry the provided {@link CompilationTask} using the task's configured retry command.\n * @param task The {@link CompilationTask} to be retried\n * @param retryCommand Validated CDS command to use for retry\n * @param projectDir Project directory to use as working directory\n * @param dependencyGraph The {@link CdsDependencyGraph} to be processed and updated\n * if retry succeeds.\n * @returns The result of the {@link CompilationAttempt}.\n */\nfunction retryCompilationTask(\n  task: CompilationTask,\n  retryCommand: ValidatedCdsCommand,\n  projectDir: string,\n  dependencyGraph: CdsDependencyGraph,\n): CompilationAttempt {\n  const startTime = new Date();\n  const attemptId = `${task.id}_retry_${startTime.getTime()}`;\n\n  // Use the original command string for consistency with existing compilation logic.\n  const cdsCommandString = retryCommand.originalCommand;\n\n  const attempt: CompilationAttempt = {\n    id: attemptId,\n    cdsCommand: cdsCommandString,\n    cacheDir: projectDir,\n    timestamp: startTime,\n    result: {\n      success: false,\n      timestamp: startTime,\n    },\n  };\n\n  try {\n    // Use the same compilation logic as the original attempt.\n    const primarySourceFile = task.sourceFiles[0];\n\n    const compilationResult = compileCdsToJson(\n      primarySourceFile,\n      dependencyGraph.sourceRootDir,\n      cdsCommandString,\n      projectDir,\n      // Convert CDS projects to BasicCdsProject format expected by compileCdsToJson\n      new Map(\n        Array.from(dependencyGraph.projects.entries()).map(([key, value]) => [\n          key,\n          {\n            cdsFiles: value.cdsFiles,\n            compilationTargets: value.compilationTargets,\n            expectedOutputFile: value.expectedOutputFile,\n            projectDir: value.projectDir,\n            dependencies: value.dependencies,\n            imports: value.imports,\n            packageJson: value.packageJson,\n          },\n        ]),\n      ),\n      task.projectDir,\n    );\n\n    attempt.result = {\n      ...compilationResult,\n      timestamp: startTime,\n    };\n  } catch (error) {\n    attempt.error = {\n      message: String(error),\n      stack: error instanceof Error ? error.stack : undefined,\n    };\n  }\n\n  return attempt;\n}\n\n/**\n * Executes retries for the provided array of {@link CompilationTask} instances.\n * @param tasksToRetry Tasks that need to be retried\n * @param project The {@link CdsProject} associated with the compilation tasks to retry\n * @param dependencyGraph The {@link CdsDependencyGraph} to update as tasks are retried\n * @returns The {@link ResultRetryCompilationTask}\n */\nfunction retryCompilationTasksForProject(\n  tasksToRetry: CompilationTask[],\n  project: CdsProject,\n  dependencyGraph: CdsDependencyGraph,\n): ResultRetryCompilationTask {\n  const startTime = Date.now();\n\n  const result: ResultRetryCompilationTask = {\n    projectDir: project.projectDir,\n    retriedTasks: [],\n    successfulRetries: 0,\n    failedRetries: 0,\n    fullDependenciesAvailable: Boolean(project.retryStatus?.fullDependenciesInstalled),\n    executionDurationMs: 0,\n    retryErrors: [],\n  };\n\n  cdsExtractorLog(\n    'info',\n    `Retrying ${tasksToRetry.length} task(s) for project ${project.projectDir} using ${result.fullDependenciesAvailable ? 'full' : 'minimal'} dependencies`,\n  );\n\n  for (const task of tasksToRetry) {\n    try {\n      // Mark task as being retried\n      task.retryInfo = {\n        hasBeenRetried: true,\n        retryReason: 'Output validation failed',\n        fullDependenciesInstalled: result.fullDependenciesAvailable,\n        retryTimestamp: new Date(),\n      };\n\n      // Use the retry command configured for this task\n      const retryAttempt = retryCompilationTask(\n        task,\n        task.retryCommand,\n        project.projectDir,\n        dependencyGraph,\n      );\n\n      task.retryInfo.retryAttempt = retryAttempt;\n      task.attempts.push(retryAttempt);\n      result.retriedTasks.push(task);\n\n      if (retryAttempt.result.success) {\n        task.status = 'success';\n        result.successfulRetries++;\n        cdsExtractorLog('info', `Retry successful for task ${task.id}`);\n      } else {\n        task.status = 'failed';\n        task.errorSummary = retryAttempt.error?.message ?? 'Retry compilation failed';\n        result.failedRetries++;\n        result.retryErrors.push(task.errorSummary);\n        cdsExtractorLog('warn', `Retry failed for task ${task.id}: ${task.errorSummary}`);\n      }\n    } catch (error) {\n      const errorMessage = `Failed to retry task ${task.id}: ${String(error)}`;\n      result.retryErrors.push(errorMessage);\n      result.failedRetries++;\n      task.status = 'failed';\n      task.errorSummary = errorMessage;\n      cdsExtractorLog('error', errorMessage);\n    }\n  }\n\n  result.executionDurationMs = Date.now() - startTime;\n\n  cdsExtractorLog(\n    'info',\n    `Retry execution completed for project ${project.projectDir}: ${result.successfulRetries} successful, ${result.failedRetries} failed`,\n  );\n\n  return result;\n}\n\n/**\n * Updates dependency graph with retry results\n * @param dependencyGraph The dependency graph to update\n * @param retryResults The retry orchestration results\n */\nfunction updateDependencyGraphWithRetryResults(\n  dependencyGraph: CdsDependencyGraph,\n  retryResults: ResultRetryCompilationOrchestration,\n): void {\n  // Remove manual counter updates - let updateCdsDependencyGraphStatus handle this\n  // Keep only non-status updates like timing and project tracking\n  dependencyGraph.retryStatus.totalRetryAttempts =\n    retryResults.totalSuccessfulRetries + retryResults.totalFailedRetries;\n}\n", "/** Validation utilities for CDS compilation output files. */\n\nimport { readFileSync } from 'fs';\nimport { isAbsolute, join } from 'path';\n\nimport type {\n  CompilationTask,\n  ResultDependencyStatusUpdate,\n  ResultOutputFileValidation,\n  ResultTaskValidation,\n} from './types';\nimport { fileExists } from '../../filesystem';\nimport { cdsExtractorLog } from '../../logging';\nimport type { CdsDependencyGraph } from '../parser/types';\n\n/**\n * Identifies tasks requiring retry based on output validation\n * @param dependencyGraph The dependency graph containing tasks to validate\n * @returns Map of project directory to failed tasks that need retry\n */\nexport function identifyTasksRequiringRetry(\n  dependencyGraph: CdsDependencyGraph,\n): Map<string, CompilationTask[]> {\n  const tasksRequiringRetry = new Map<string, CompilationTask[]>();\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    const failedTasks: CompilationTask[] = [];\n\n    for (const task of project.compilationTasks) {\n      // Skip tasks that have already been retried.\n      if (task.retryInfo?.hasBeenRetried) {\n        continue;\n      }\n\n      // Always validate output files exist, regardless of task status.\n      const validationResult = validateTaskOutputs(task, dependencyGraph.sourceRootDir);\n\n      if (!validationResult.isValid) {\n        failedTasks.push(task);\n        cdsExtractorLog(\n          'info',\n          `Task ${task.id} requires retry: ${validationResult.validFileCount}/${validationResult.expectedFileCount} output files valid (status: ${task.status})`,\n        );\n\n        // Update task status to reflect actual file state.\n        if (task.status === 'success') {\n          cdsExtractorLog(\n            'warn',\n            `Task ${task.id} was marked as successful but output files are missing or invalid - updating status to failed`,\n          );\n          task.status = 'failed';\n        }\n      }\n    }\n\n    if (failedTasks.length > 0) {\n      tasksRequiringRetry.set(projectDir, failedTasks);\n    }\n  }\n\n  if (tasksRequiringRetry.size > 0) {\n    const totalFailedTasks = Array.from(tasksRequiringRetry.values()).reduce(\n      (sum, tasks) => sum + tasks.length,\n      0,\n    );\n    cdsExtractorLog(\n      'info',\n      `Identified ${totalFailedTasks} task(s) requiring retry across ${tasksRequiringRetry.size} project(s)`,\n    );\n  }\n\n  return tasksRequiringRetry;\n}\n\n/**\n * Updates the dependency graph with current task status based on filesystem validation.\n * This is the single source of truth for compilation task status across all phases.\n */\nexport function updateCdsDependencyGraphStatus(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRootDir: string,\n): ResultDependencyStatusUpdate {\n  let successfulTasks = 0;\n  let failedTasks = 0;\n  let tasksSuccessfullyRetried = 0;\n\n  // Validate all tasks using filesystem checks\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      const validationResult = validateTaskOutputs(task, sourceRootDir);\n      const isValid = validationResult.isValid;\n\n      if (isValid) {\n        task.status = 'success';\n        successfulTasks++;\n\n        // If task has retry info and is now successful, count as successfully retried\n        if (task.retryInfo?.hasBeenRetried) {\n          tasksSuccessfullyRetried++;\n        }\n      } else {\n        task.status = 'failed';\n        failedTasks++;\n      }\n    }\n  }\n\n  // Update dependency graph counters\n  dependencyGraph.statusSummary.successfulCompilations = successfulTasks;\n  dependencyGraph.statusSummary.failedCompilations = failedTasks;\n\n  // Update retry status tracking\n  dependencyGraph.retryStatus.totalTasksSuccessfullyRetried = tasksSuccessfullyRetried;\n  dependencyGraph.retryStatus.totalTasksRequiringRetry = failedTasks;\n\n  return {\n    tasksValidated: successfulTasks + failedTasks,\n    successfulTasks,\n    failedTasks,\n    tasksSuccessfullyRetried,\n  };\n}\n/**\n * Validates a single expected output file.\n * @param filePath Path to the output file to validate\n * @returns Validation result with details\n */\nexport function validateOutputFile(filePath: string): ResultOutputFileValidation {\n  const result: ResultOutputFileValidation = {\n    isValid: false,\n    filePath,\n    exists: false,\n  };\n\n  // Check if file exists\n  if (!fileExists(filePath)) {\n    result.error = 'File does not exist';\n    return result;\n  }\n\n  result.exists = true;\n\n  // For .cds.json files, validate JSON content\n  if (filePath.endsWith('.cds.json') || filePath.endsWith('.json')) {\n    try {\n      const content = readFileSync(filePath, 'utf8');\n\n      // Check if content is empty\n      if (!content.trim()) {\n        result.error = 'File is empty';\n        return result;\n      }\n\n      // Try to parse as JSON\n      const parsed: unknown = JSON.parse(content);\n\n      // Basic structure validation for CDS JSON files\n      if (typeof parsed !== 'object' || parsed === null) {\n        result.error = 'File does not contain a valid JSON object';\n        return result;\n      }\n\n      result.hasValidJson = true;\n      result.isValid = true;\n    } catch (error) {\n      result.error = `Invalid JSON content: ${String(error)}`;\n      return result;\n    }\n  } else {\n    // For non-JSON files, existence is sufficient\n    result.isValid = true;\n  }\n\n  return result;\n}\n\n/**\n * Validates that all expected output files exist for a compilation task.\n * @param task The compilation task to validate\n * @param sourceRoot Source root directory for resolving relative paths\n * @returns Task-level validation result\n */\nexport function validateTaskOutputs(\n  task: CompilationTask,\n  sourceRoot: string,\n): ResultTaskValidation {\n  const fileResults: ResultOutputFileValidation[] = [];\n\n  // Resolve the output file path relative to source root\n  const expectedOutput = task.expectedOutputFile;\n  const absolutePath = isAbsolute(expectedOutput)\n    ? expectedOutput\n    : join(sourceRoot, expectedOutput);\n\n  const fileResult = validateOutputFile(absolutePath);\n  fileResults.push(fileResult);\n\n  const validFileCount = fileResults.filter(r => r.isValid).length;\n  const expectedFileCount = 1;\n  const isValid = validFileCount === expectedFileCount && expectedFileCount > 0;\n\n  return {\n    isValid,\n    task,\n    fileResults,\n    validFileCount,\n    expectedFileCount,\n  };\n}\n", "import { execFileSync } from 'child_process';\nimport { isAbsolute, relative, resolve } from 'path';\n\nimport { cdsExtractorLog } from './logging';\n\n/**\n * Severity levels for diagnostics\n */\nexport enum DiagnosticSeverity {\n  Error = 'error',\n  Warning = 'warning',\n  Note = 'note',\n  Recommendation = 'recommendation',\n}\n\n/**\n * Converts a file path to be relative to the source root if possible\n * @param filePath The file path to convert\n * @param sourceRoot The source root directory to make the path relative to\n * @returns The relative path if the file is under source root, otherwise '.' (source root)\n */\nexport function convertToRelativePath(filePath: string, sourceRoot: string): string {\n  // Handle invalid inputs\n  if (!filePath || typeof filePath !== 'string' || !sourceRoot || typeof sourceRoot !== 'string') {\n    return '.';\n  }\n\n  try {\n    const resolvedSourceRoot = resolve(sourceRoot);\n\n    // If filePath is absolute, resolve it directly; otherwise resolve relative to sourceRoot\n    // Use path.isAbsolute() for cross-platform compatibility (Unix and Windows paths)\n    const resolvedFilePath = isAbsolute(filePath)\n      ? resolve(filePath)\n      : resolve(resolvedSourceRoot, filePath);\n\n    // If the file path is the same as source root, return '.'\n    if (resolvedFilePath === resolvedSourceRoot) {\n      return '.';\n    }\n\n    const relativePath = relative(resolvedSourceRoot, resolvedFilePath);\n\n    // If the relative path starts with '..' it means the file is outside the source root\n    // Per CodeQL requirements, we should point to the source root '.' instead\n    if (relativePath.startsWith('..')) {\n      return '.';\n    }\n\n    return relativePath;\n  } catch {\n    // If path resolution fails for any reason, fallback to source root\n    return '.';\n  }\n}\n\n/**\n * Base function to add a diagnostic to the CodeQL database\n * @param filePath Path to the file related to the diagnostic\n * @param message The diagnostic message\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceId The source ID for the diagnostic\n * @param sourceName The source name for the diagnostic\n * @param severity The severity level of the diagnostic\n * @param logPrefix Prefix for the log message\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nfunction addDiagnostic(\n  filePath: string,\n  message: string,\n  codeqlExePath: string,\n  sourceId: string,\n  sourceName: string,\n  severity: DiagnosticSeverity,\n  logPrefix: string,\n  sourceRoot?: string,\n): boolean {\n  const finalFilePath = sourceRoot\n    ? convertToRelativePath(filePath, sourceRoot)\n    : resolve(filePath);\n\n  // If the file was remapped to source root due to being outside the repository,\n  // append an explanatory note to the message\n  let finalMessage = message;\n  if (sourceRoot && finalFilePath === '.' && filePath !== sourceRoot) {\n    const resolvedSourceRoot = resolve(sourceRoot);\n    // Use path.isAbsolute() for cross-platform compatibility (Unix and Windows paths)\n    const resolvedFilePath = isAbsolute(filePath)\n      ? resolve(filePath)\n      : resolve(resolvedSourceRoot, filePath);\n\n    // Only add the note if the file was actually outside the source root\n    if (resolvedFilePath !== resolvedSourceRoot) {\n      finalMessage = `${message}\\n\\n**Note**: The file \\`${filePath}\\` is located outside the scanned source directory and cannot be linked directly in this diagnostic. This diagnostic is associated with the repository root instead.`;\n    }\n  }\n\n  try {\n    execFileSync(codeqlExePath, [\n      'database',\n      'add-diagnostic',\n      '--extractor-name=cds',\n      '--ready-for-status-page',\n      `--source-id=${sourceId}`,\n      `--source-name=${sourceName}`,\n      `--severity=${severity}`,\n      `--markdown-message=${finalMessage}`,\n      `--file-path=${finalFilePath}`,\n      '--',\n      `${process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE ?? ''}`,\n    ]);\n    cdsExtractorLog('info', `Added ${severity} diagnostic for ${logPrefix}: ${filePath}`);\n    return true;\n  } catch (err) {\n    cdsExtractorLog(\n      'error',\n      `Failed to add ${severity} diagnostic for ${logPrefix}=${filePath} : ${String(err)}`,\n    );\n    return false;\n  }\n}\n\n/**\n * Add a diagnostic warning to the CodeQL database for a CDS indexer failure\n * @param projectDir The project directory where the cds-indexer failed\n * @param errorMessage The error message from the cds-indexer execution\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addCdsIndexerDiagnostic(\n  projectDir: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    projectDir,\n    errorMessage,\n    codeqlExePath,\n    'cds/indexer-failure',\n    'Failure running @sap/cds-indexer for a SAP CAP CDS project',\n    DiagnosticSeverity.Warning,\n    'project directory',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic warning to the CodeQL database for a failed CDS compilation\n * @param cdsFilePath Path to the CDS file that failed to compile\n * @param errorMessage The error message from the compilation\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Optional source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addCompilationDiagnostic(\n  cdsFilePath: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    cdsFilePath,\n    errorMessage,\n    codeqlExePath,\n    'cds/compilation-failure',\n    'Failure to compile one or more SAP CAP CDS files',\n    DiagnosticSeverity.Warning,\n    'source file',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for dependency graph build failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from dependency graph build\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addDependencyGraphDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    errorMessage,\n    codeqlExePath,\n    'cds/dependency-graph-failure',\n    'CDS project dependency graph build failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for dependency installation failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from dependency installation\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addDependencyInstallationDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    errorMessage,\n    codeqlExePath,\n    'cds/dependency-installation-failure',\n    'CDS dependency installation failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for environment setup failure\n * @param sourceRoot Source root directory to use as file context\n * @param errorMessage The error message from environment setup\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addEnvironmentSetupDiagnostic(\n  sourceRoot: string,\n  errorMessage: string,\n  codeqlExePath: string,\n): boolean {\n  // Use a representative file from source root or the directory itself\n  const contextFile = sourceRoot;\n  return addDiagnostic(\n    contextFile,\n    errorMessage,\n    codeqlExePath,\n    'cds/environment-setup-failure',\n    'CDS extractor environment setup failure',\n    DiagnosticSeverity.Error,\n    'source root',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic error to the CodeQL database for a JavaScript extractor failure\n * @param filePath Path to a relevant file for the error context\n * @param errorMessage The error message from the JavaScript extractor\n * @param codeqlExePath Path to the CodeQL executable\n * @param sourceRoot Source root directory to make file paths relative to\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addJavaScriptExtractorDiagnostic(\n  filePath: string,\n  errorMessage: string,\n  codeqlExePath: string,\n  sourceRoot?: string,\n): boolean {\n  return addDiagnostic(\n    filePath,\n    errorMessage,\n    codeqlExePath,\n    'cds/js-extractor-failure',\n    'Failure in JavaScript extractor for SAP CAP CDS files',\n    DiagnosticSeverity.Error,\n    'extraction file',\n    sourceRoot,\n  );\n}\n\n/**\n * Add a diagnostic warning when no CDS projects are detected\n * @param sourceRoot Source root directory to use as file context\n * @param message The warning message about no CDS projects\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nexport function addNoCdsProjectsDiagnostic(\n  sourceRoot: string,\n  message: string,\n  codeqlExePath: string,\n): boolean {\n  return addDiagnostic(\n    sourceRoot,\n    message,\n    codeqlExePath,\n    'cds/no-cds-projects',\n    'No CDS projects detected in source',\n    DiagnosticSeverity.Warning,\n    'source root',\n    sourceRoot,\n  );\n}\n", "import { execFileSync } from 'child_process';\nimport { createHash } from 'crypto';\nimport { copyFileSync, existsSync, mkdirSync, writeFileSync } from 'fs';\nimport { dirname, join, resolve } from 'path';\n\nimport type { CdsDependencyCombination } from './types';\nimport { CdsDependencyGraph, CdsProject } from '../cds/parser/types';\nimport { DiagnosticSeverity } from '../diagnostics';\nimport { npmExecutable } from '../environment';\nimport { cdsExtractorLog } from '../logging';\nimport { resolveCdsVersions } from './versionResolver';\n\nconst cacheSubDirName = '.cds-extractor-cache';\n\n/**\n * Add a warning diagnostic for dependency version fallback\n * @param packageJsonPath Path to the package.json file\n * @param warningMessage The warning message\n * @param codeqlExePath Path to the CodeQL executable\n * @returns True if the diagnostic was added, false otherwise\n */\nfunction addDependencyVersionWarning(\n  packageJsonPath: string,\n  warningMessage: string,\n  codeqlExePath: string,\n): boolean {\n  try {\n    execFileSync(codeqlExePath, [\n      'database',\n      'add-diagnostic',\n      '--extractor-name=cds',\n      '--ready-for-status-page',\n      '--source-id=cds/dependency-version-fallback',\n      '--source-name=Using fallback versions for SAP CAP CDS dependencies',\n      `--severity=${DiagnosticSeverity.Warning}`,\n      `--markdown-message=${warningMessage}`,\n      `--file-path=${resolve(packageJsonPath)}`,\n      '--',\n      `${process.env.CODEQL_EXTRACTOR_CDS_WIP_DATABASE ?? ''}`,\n    ]);\n    cdsExtractorLog('info', `Added warning diagnostic for dependency fallback: ${packageJsonPath}`);\n    return true;\n  } catch (err) {\n    cdsExtractorLog(\n      'error',\n      `Failed to add warning diagnostic for ${packageJsonPath}: ${String(err)}`,\n    );\n    return false;\n  }\n}\n\n/**\n * Find the nearest `.npmrc` file by searching the given directory and its\n * ancestors up to (and including) the filesystem root. npm itself walks the\n * directory tree when looking for project-level `.npmrc` files, so we mirror\n * that behaviour here.\n *\n * @param startDir The directory from which to start the upward search.\n * @returns The absolute path to the nearest `.npmrc`, or `undefined` if none is found.\n */\nexport function findNearestNpmrc(startDir: string): string | undefined {\n  let current = resolve(startDir);\n\n  // Walk up the directory tree until we find an .npmrc or reach the root\n\n  while (true) {\n    const candidate = join(current, '.npmrc');\n    if (existsSync(candidate)) {\n      return candidate;\n    }\n    const parent = dirname(current);\n    if (parent === current) {\n      // Reached filesystem root without finding .npmrc\n      return undefined;\n    }\n    current = parent;\n  }\n}\n\n/**\n * Copy the project's `.npmrc` file (if any) into the cache directory so that\n * `npm install` inside the cache respects custom registry configuration such\n * as scoped registries (`@sap:registry=...`), authentication tokens, and\n * `strict-ssl` settings.\n *\n * @param cacheDir  The cache directory where dependencies will be installed.\n * @param projectDir Absolute path to the project directory whose `.npmrc` should be used.\n */\nexport function copyNpmrcToCache(cacheDir: string, projectDir: string): void {\n  const npmrcPath = findNearestNpmrc(projectDir);\n  if (!npmrcPath) {\n    return;\n  }\n\n  const dest = join(cacheDir, '.npmrc');\n  try {\n    copyFileSync(npmrcPath, dest);\n    cdsExtractorLog('info', `Copied .npmrc from '${npmrcPath}' to cache directory '${cacheDir}'`);\n  } catch (err) {\n    cdsExtractorLog(\n      'warn',\n      `Failed to copy .npmrc to cache directory: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n}\n\n/**\n * Install dependencies for CDS projects using a robust cache strategy with fallback logic\n * @param dependencyGraph The dependency graph of the project\n * @param sourceRoot Source root directory\n * @param codeqlExePath Path to the CodeQL executable (optional)\n * @returns Map of project directories to their corresponding cache directories\n */\nexport function cacheInstallDependencies(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRoot: string,\n  codeqlExePath?: string,\n): Map<string, string> {\n  // Sanity check that we found at least one project\n  if (dependencyGraph.projects.size === 0) {\n    cdsExtractorLog('info', 'No CDS projects found for dependency installation.');\n    cdsExtractorLog(\n      'info',\n      'This is expected if the source contains no CAP/CDS projects and should be handled by the caller.',\n    );\n    return new Map<string, string>();\n  }\n\n  // Extract unique dependency combinations from all projects with version resolution\n  const dependencyCombinations = extractUniqueDependencyCombinations(dependencyGraph.projects);\n\n  if (dependencyCombinations.length === 0) {\n    cdsExtractorLog(\n      'error',\n      'No CDS dependencies found in any project. This means projects were detected but lack proper @sap/cds dependencies.',\n    );\n    cdsExtractorLog(\n      'info',\n      'Will attempt to use system-installed CDS tools if available, but compilation may fail.',\n    );\n    return new Map<string, string>();\n  }\n\n  cdsExtractorLog(\n    'info',\n    `Found ${dependencyCombinations.length} unique CDS dependency combination(s).`,\n  );\n\n  // Log each dependency combination for transparency\n  for (const combination of dependencyCombinations) {\n    const { cdsVersion, cdsDkVersion, hash, resolvedCdsVersion, resolvedCdsDkVersion, isFallback } =\n      combination;\n    const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n    const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n    const fallbackNote = isFallback ? ' (using fallback versions)' : '';\n    const indexerNote = combination.cdsIndexerVersion\n      ? `, @sap/cds-indexer@${combination.cdsIndexerVersion}`\n      : '';\n\n    cdsExtractorLog(\n      'info',\n      `Dependency combination ${hash.substring(0, 8)}: @sap/cds@${actualCdsVersion}, @sap/cds-dk@${actualCdsDkVersion}${indexerNote}${fallbackNote}`,\n    );\n  }\n\n  // Create a cache directory under the source root directory.\n  const cacheRootDir = join(sourceRoot, cacheSubDirName);\n  cdsExtractorLog(\n    'info',\n    `Using cache directory '${cacheSubDirName}' within source root directory '${cacheRootDir}'`,\n  );\n\n  if (!existsSync(cacheRootDir)) {\n    try {\n      mkdirSync(cacheRootDir, { recursive: true });\n      cdsExtractorLog('info', `Created cache directory: ${cacheRootDir}`);\n    } catch (err) {\n      cdsExtractorLog(\n        'warn',\n        `Failed to create cache directory: ${err instanceof Error ? err.message : String(err)}`,\n      );\n      cdsExtractorLog('info', 'Skipping dependency installation due to cache directory failure.');\n      return new Map<string, string>();\n    }\n  } else {\n    cdsExtractorLog('info', `Cache directory already exists: ${cacheRootDir}`);\n  }\n\n  // Map to track which cache directory to use for each project\n  const projectCacheDirMap = new Map<string, string>();\n  let successfulInstallations = 0;\n\n  // Install each unique dependency combination in its own cache directory\n  for (const combination of dependencyCombinations) {\n    const { cdsVersion, cdsDkVersion, hash } = combination;\n    const { resolvedCdsVersion, resolvedCdsDkVersion } = combination;\n    const cacheDirName = `cds-${hash}`;\n    const cacheDir = join(cacheRootDir, cacheDirName);\n\n    cdsExtractorLog(\n      'info',\n      `Processing dependency combination ${hash.substring(0, 8)} in cache directory: ${cacheDirName}`,\n    );\n\n    // Create the cache directory if it doesn't exist\n    if (!existsSync(cacheDir)) {\n      try {\n        mkdirSync(cacheDir, { recursive: true });\n        cdsExtractorLog('info', `Created cache subdirectory: ${cacheDirName}`);\n      } catch (err) {\n        cdsExtractorLog(\n          'error',\n          `Failed to create cache directory for combination ${hash.substring(0, 8)} (${cacheDirName}): ${\n            err instanceof Error ? err.message : String(err)\n          }`,\n        );\n        continue;\n      }\n\n      // Create a package.json for this dependency combination using resolved versions\n      const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n      const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n\n      const cacheDeps: Record<string, string> = {\n        '@sap/cds': actualCdsVersion,\n        '@sap/cds-dk': actualCdsDkVersion,\n      };\n\n      // Include @sap/cds-indexer in the cache when a project depends on it.\n      // This is a best-effort optimization: on systems with access to the\n      // private npm registry that hosts @sap/cds-indexer, it will be cached\n      // alongside @sap/cds and @sap/cds-dk. On systems without access, the\n      // npm install will still succeed for the other packages (it won't fail\n      // the overall installation \u2014 npm install is run with --no-optional\n      // semantics handled below).\n      if (combination.cdsIndexerVersion) {\n        cacheDeps['@sap/cds-indexer'] = combination.cdsIndexerVersion;\n        cdsExtractorLog(\n          'info',\n          `Including @sap/cds-indexer@${combination.cdsIndexerVersion} in cache for combination ${hash.substring(0, 8)}`,\n        );\n      }\n\n      const packageJson = {\n        name: `cds-extractor-cache-${hash}`,\n        version: '1.0.0',\n        private: true,\n        dependencies: cacheDeps,\n      };\n\n      try {\n        writeFileSync(join(cacheDir, 'package.json'), JSON.stringify(packageJson, null, 2));\n        cdsExtractorLog('info', `Created package.json in cache subdirectory: ${cacheDirName}`);\n      } catch (err) {\n        cdsExtractorLog(\n          'error',\n          `Failed to create package.json in cache directory ${cacheDirName}: ${\n            err instanceof Error ? err.message : String(err)\n          }`,\n        );\n        continue;\n      }\n    }\n\n    // Ensure the cache directory has an .npmrc that reflects the projects' registry configuration\n    const npmrcProjectDir = Array.from(dependencyGraph.projects.values())\n      .map(project => project.projectDir)\n      .find(projectDir => projectDir && existsSync(join(sourceRoot, projectDir, '.npmrc')));\n    if (npmrcProjectDir) {\n      copyNpmrcToCache(cacheDir, join(sourceRoot, npmrcProjectDir));\n    }\n\n    // Try to install dependencies in the cache directory\n    // Get the first project package.json path for diagnostic purposes\n    const samplePackageJsonPath = Array.from(dependencyGraph.projects.values()).find(\n      project => project.packageJson,\n    )?.projectDir;\n    const packageJsonPath = samplePackageJsonPath\n      ? join(sourceRoot, samplePackageJsonPath, 'package.json')\n      : undefined;\n\n    const installSuccess = installDependenciesInCache(\n      cacheDir,\n      combination,\n      cacheDirName,\n      packageJsonPath,\n      codeqlExePath,\n    );\n\n    if (!installSuccess) {\n      cdsExtractorLog(\n        'warn',\n        `Skipping failed dependency combination ${hash.substring(0, 8)} (cache directory: ${cacheDirName})`,\n      );\n      continue;\n    }\n\n    successfulInstallations++;\n\n    // Associate projects with this dependency combination\n    for (const [projectDir, project] of Array.from(dependencyGraph.projects.entries())) {\n      if (!project.packageJson) {\n        continue;\n      }\n      const p_cdsVersion = project.packageJson.dependencies?.['@sap/cds'] ?? 'latest';\n      const p_cdsDkVersion = project.packageJson.devDependencies?.['@sap/cds-dk'] ?? p_cdsVersion;\n      const p_cdsIndexerVersion =\n        project.packageJson.dependencies?.['@sap/cds-indexer'] ??\n        project.packageJson.devDependencies?.['@sap/cds-indexer'] ??\n        undefined;\n\n      // Resolve the project's versions to match against the combination's resolved versions\n      const projectResolvedVersions = resolveCdsVersions(p_cdsVersion, p_cdsDkVersion);\n      const projectActualCdsVersion = projectResolvedVersions.resolvedCdsVersion ?? p_cdsVersion;\n      const projectActualCdsDkVersion =\n        projectResolvedVersions.resolvedCdsDkVersion ?? p_cdsDkVersion;\n\n      // Match based on resolved versions since that's what the hash is based on\n      const combinationActualCdsVersion = combination.resolvedCdsVersion ?? combination.cdsVersion;\n      const combinationActualCdsDkVersion =\n        combination.resolvedCdsDkVersion ?? combination.cdsDkVersion;\n\n      if (\n        projectActualCdsVersion === combinationActualCdsVersion &&\n        projectActualCdsDkVersion === combinationActualCdsDkVersion &&\n        p_cdsIndexerVersion === combination.cdsIndexerVersion\n      ) {\n        projectCacheDirMap.set(projectDir, cacheDir);\n      }\n    }\n  }\n\n  // Log final status\n  if (successfulInstallations === 0) {\n    cdsExtractorLog('error', 'Failed to install any dependency combinations.');\n    if (dependencyCombinations.length > 0) {\n      cdsExtractorLog(\n        'error',\n        `All ${dependencyCombinations.length} dependency combination(s) failed to install. This will likely cause compilation failures.`,\n      );\n    }\n  } else if (successfulInstallations < dependencyCombinations.length) {\n    cdsExtractorLog(\n      'warn',\n      `Successfully installed ${successfulInstallations} out of ${dependencyCombinations.length} dependency combinations.`,\n    );\n  } else {\n    cdsExtractorLog('info', 'All dependency combinations installed successfully.');\n  }\n\n  // Log project-to-cache-directory mappings for transparency.\n  if (projectCacheDirMap.size > 0) {\n    cdsExtractorLog('info', `Project to cache directory mappings:`);\n    for (const [projectDir, cacheDir] of Array.from(projectCacheDirMap.entries())) {\n      const cacheDirName = join(cacheDir).split('/').pop() ?? 'unknown';\n      cdsExtractorLog('info', `  ${projectDir} \u2192 ${cacheDirName}`);\n    }\n  } else {\n    cdsExtractorLog(\n      'warn',\n      'No project to cache directory mappings created. Projects may not have compatible dependencies installed.',\n    );\n  }\n\n  return projectCacheDirMap;\n}\n\n/**\n * Extracts unique dependency combinations from the dependency graph.\n * @param projects A map of projects from the dependency graph.\n * @returns An array of unique dependency combinations.\n */\nfunction extractUniqueDependencyCombinations(\n  projects: Map<string, CdsProject>,\n): CdsDependencyCombination[] {\n  const combinations = new Map<string, CdsDependencyCombination>();\n\n  for (const project of Array.from(projects.values())) {\n    if (!project.packageJson) {\n      continue;\n    }\n\n    const cdsVersion = project.packageJson.dependencies?.['@sap/cds'] ?? 'latest';\n    const cdsDkVersion = project.packageJson.devDependencies?.['@sap/cds-dk'] ?? cdsVersion;\n\n    // Detect optional @sap/cds-indexer dependency\n    const cdsIndexerVersion =\n      project.packageJson.dependencies?.['@sap/cds-indexer'] ??\n      project.packageJson.devDependencies?.['@sap/cds-indexer'] ??\n      undefined;\n\n    // Resolve versions first to ensure we cache based on actual resolved versions\n    cdsExtractorLog(\n      'info',\n      `Resolving available dependency versions for project '${project.projectDir}' with dependencies: [@sap/cds@${cdsVersion}, @sap/cds-dk@${cdsDkVersion}]`,\n    );\n    const resolvedVersions = resolveCdsVersions(cdsVersion, cdsDkVersion);\n    const { resolvedCdsVersion, resolvedCdsDkVersion, ...rest } = resolvedVersions;\n\n    // Log the resolved CDS dependency versions for the project\n    if (resolvedCdsVersion && resolvedCdsDkVersion) {\n      let statusMsg: string;\n      if (resolvedVersions.cdsExactMatch && resolvedVersions.cdsDkExactMatch) {\n        statusMsg = ' (exact match)';\n      } else if (!resolvedVersions.isFallback) {\n        statusMsg = ' (compatible versions)';\n      } else {\n        statusMsg = ' (using fallback versions)';\n      }\n      cdsExtractorLog(\n        'info',\n        `Resolved to: @sap/cds@${resolvedCdsVersion}, @sap/cds-dk@${resolvedCdsDkVersion}${statusMsg}`,\n      );\n    } else {\n      cdsExtractorLog(\n        'error',\n        `Failed to resolve CDS dependencies: @sap/cds@${cdsVersion}, @sap/cds-dk@${cdsDkVersion}`,\n      );\n    }\n\n    // Calculate hash based on resolved versions to ensure proper cache reuse\n    const actualCdsVersion = resolvedCdsVersion ?? cdsVersion;\n    const actualCdsDkVersion = resolvedCdsDkVersion ?? cdsDkVersion;\n    const hashInput = cdsIndexerVersion\n      ? `${actualCdsVersion}|${actualCdsDkVersion}|${cdsIndexerVersion}`\n      : `${actualCdsVersion}|${actualCdsDkVersion}`;\n    const hash = createHash('sha256').update(hashInput).digest('hex');\n\n    if (!combinations.has(hash)) {\n      combinations.set(hash, {\n        cdsVersion,\n        cdsDkVersion,\n        cdsIndexerVersion,\n        hash,\n        resolvedCdsVersion: resolvedCdsVersion ?? undefined,\n        resolvedCdsDkVersion: resolvedCdsDkVersion ?? undefined,\n        ...rest,\n      });\n    }\n  }\n\n  return Array.from(combinations.values());\n}\n\n/**\n * Attempt to install dependencies in a cache directory with fallback logic\n * @param cacheDir Cache directory path\n * @param combination Dependency combination to install\n * @param cacheDirName Name of the cache directory for logging\n * @param packageJsonPath Optional package.json path for diagnostics\n * @param codeqlExePath Optional CodeQL executable path for diagnostics\n * @returns True if installation succeeded, false otherwise\n */\nfunction installDependenciesInCache(\n  cacheDir: string,\n  combination: CdsDependencyCombination,\n  cacheDirName: string,\n  packageJsonPath?: string,\n  codeqlExePath?: string,\n): boolean {\n  const { resolvedCdsVersion, resolvedCdsDkVersion, isFallback, warning } = combination;\n\n  // Check if node_modules directory already exists in the cache dir\n  const nodeModulesExists =\n    existsSync(join(cacheDir, 'node_modules', '@sap', 'cds')) &&\n    existsSync(join(cacheDir, 'node_modules', '@sap', 'cds-dk'));\n\n  if (nodeModulesExists) {\n    cdsExtractorLog(\n      'info',\n      `Using cached dependencies for @sap/cds@${resolvedCdsVersion} and @sap/cds-dk@${resolvedCdsDkVersion} from ${cacheDirName}`,\n    );\n\n    // Add warning diagnostic if using fallback versions\n    if (isFallback && warning && packageJsonPath && codeqlExePath) {\n      addDependencyVersionWarning(packageJsonPath, warning, codeqlExePath);\n    }\n\n    return true;\n  }\n\n  if (!resolvedCdsVersion || !resolvedCdsDkVersion) {\n    cdsExtractorLog('error', 'Cannot install dependencies: no compatible versions found');\n    return false;\n  }\n\n  // Install dependencies in the cache directory\n  cdsExtractorLog(\n    'info',\n    `Installing @sap/cds@${resolvedCdsVersion} and @sap/cds-dk@${resolvedCdsDkVersion} in cache directory: ${cacheDirName}`,\n  );\n\n  if (isFallback && warning) {\n    cdsExtractorLog('warn', warning);\n  }\n\n  try {\n    execFileSync(npmExecutable(), ['install', '--quiet', '--no-audit', '--no-fund'], {\n      cwd: cacheDir,\n      stdio: 'inherit',\n    });\n\n    // Add warning diagnostic if using fallback versions\n    if (isFallback && warning && packageJsonPath && codeqlExePath) {\n      addDependencyVersionWarning(packageJsonPath, warning, codeqlExePath);\n    }\n\n    return true;\n  } catch (err) {\n    const errorMessage = `Failed to install resolved dependencies in cache directory ${cacheDir}: ${err instanceof Error ? err.message : String(err)}`;\n    cdsExtractorLog('error', errorMessage);\n    return false;\n  }\n}\n", "import { execSync } from 'child_process';\n\nimport type { SemanticVersion } from './types';\nimport { cdsExtractorLog } from '../logging';\n\n/**\n * Cache for storing available versions for npm packages to avoid duplicate\n * `npm view` calls.\n */\nconst availableVersionsCache = new Map<string, string[]>();\n\n// Define the set of allowed npm packages for which we cache versions.\ntype CachedPackageName = '@sap/cds' | '@sap/cds-dk';\n\n/**\n * Cache statistics for debugging purposes\n */\nconst cacheStats = {\n  hits: 0,\n  misses: 0,\n  get hitRate() {\n    const total = this.hits + this.misses;\n    return total > 0 ? ((this.hits / total) * 100).toFixed(1) : '0.0';\n  },\n};\n\n/**\n * Check if @sap/cds and @sap/cds-dk versions are likely compatible.\n * @param cdsVersion The @sap/cds version\n * @param cdsDkVersion The @sap/cds-dk version\n * @returns Object with compatibility information and warnings\n */\nexport function checkVersionCompatibility(\n  cdsVersion: string,\n  cdsDkVersion: string,\n): {\n  isCompatible: boolean;\n  warning?: string;\n} {\n  // If either version is 'latest', assume they are compatible\n  if (cdsVersion === 'latest' || cdsDkVersion === 'latest') {\n    return { isCompatible: true };\n  }\n\n  const parsedCds = parseSemanticVersion(cdsVersion);\n  const parsedCdsDk = parseSemanticVersion(cdsDkVersion);\n\n  if (!parsedCds || !parsedCdsDk) {\n    return {\n      isCompatible: false,\n      warning: 'Unable to parse version numbers for compatibility check',\n    };\n  }\n\n  // Generally, @sap/cds and @sap/cds-dk should have the same major version\n  // and ideally the same minor version for best compatibility\n  const majorVersionsMatch = parsedCds.major === parsedCdsDk.major;\n  const minorVersionsMatch = parsedCds.minor === parsedCdsDk.minor;\n\n  if (!majorVersionsMatch) {\n    return {\n      isCompatible: false,\n      warning: `Major version mismatch: @sap/cds ${cdsVersion} and @sap/cds-dk ${cdsDkVersion} may not be compatible`,\n    };\n  }\n\n  if (!minorVersionsMatch) {\n    return {\n      isCompatible: true,\n      warning: `Minor version difference: @sap/cds ${cdsVersion} and @sap/cds-dk ${cdsDkVersion} - consider aligning versions for best compatibility`,\n    };\n  }\n\n  return { isCompatible: true };\n}\n\n/**\n * Compare two semantic versions\n * @param a First version\n * @param b Second version\n * @returns Negative if a < b, 0 if equal, positive if a > b\n */\nexport function compareVersions(a: SemanticVersion, b: SemanticVersion): number {\n  if (a.major !== b.major) return a.major - b.major;\n  if (a.minor !== b.minor) return a.minor - b.minor;\n  if (a.patch !== b.patch) return a.patch - b.patch;\n\n  // Handle prerelease versions (prerelease < release)\n  if (a.prerelease && !b.prerelease) return -1;\n  if (!a.prerelease && b.prerelease) return 1;\n  if (a.prerelease && b.prerelease) {\n    return a.prerelease.localeCompare(b.prerelease);\n  }\n\n  return 0;\n}\n\n/**\n * Find the best available version from a list of versions for a given requirement\n * @param availableVersions List of available version strings\n * @param requiredVersion Required version string\n * @returns Best matching version or null if no compatible version found\n */\nexport function findBestAvailableVersion(\n  availableVersions: string[],\n  requiredVersion: string,\n): string | null {\n  const parsedVersions = availableVersions\n    .map(v => parseSemanticVersion(v))\n    .filter((v): v is SemanticVersion => v !== null);\n\n  if (parsedVersions.length === 0) {\n    return null;\n  }\n\n  // First, try to find versions that satisfy the range\n  const satisfyingVersions = parsedVersions.filter(v => satisfiesRange(v, requiredVersion));\n\n  if (satisfyingVersions.length > 0) {\n    // Sort in descending order (newest first) and return the best match\n    satisfyingVersions.sort((a, b) => compareVersions(b, a));\n    return satisfyingVersions[0].original;\n  }\n\n  // If no exact match, prefer newer versions over older ones\n  // Sort all versions in descending order and return the newest\n  parsedVersions.sort((a, b) => compareVersions(b, a));\n  return parsedVersions[0].original;\n}\n\n/**\n * Get available versions for an npm package with caching to avoid duplicate\n * calls of the `npm view` command.\n * @param packageName The {@link CachedPackageName} for which to get versions\n * @returns Array of available version strings\n */\nexport function getAvailableVersions(packageName: CachedPackageName): string[] {\n  // Check cache first\n  if (availableVersionsCache.has(packageName)) {\n    cacheStats.hits++;\n    return availableVersionsCache.get(packageName)!;\n  }\n\n  // Cache miss - fetch from npm\n  cacheStats.misses++;\n  try {\n    const output = execSync(`npm view ${packageName} versions --json`, {\n      encoding: 'utf8',\n      timeout: 30000, // 30 second timeout\n    });\n\n    const versions: unknown = JSON.parse(output);\n    let versionArray: string[] = [];\n\n    if (Array.isArray(versions)) {\n      versionArray = versions.filter((v): v is string => typeof v === 'string');\n    } else if (typeof versions === 'string') {\n      versionArray = [versions];\n    }\n\n    // Cache the result\n    availableVersionsCache.set(packageName, versionArray);\n\n    return versionArray;\n  } catch (error) {\n    cdsExtractorLog('warn', `Failed to fetch versions for ${packageName}: ${String(error)}`);\n    // Cache empty array to avoid repeated failures\n    availableVersionsCache.set(packageName, []);\n    return [];\n  }\n}\n\n/**\n * Get cache statistics for debugging purposes\n * @returns Object with cache hit/miss statistics\n */\nexport function getCacheStatistics(): {\n  hits: number;\n  misses: number;\n  hitRate: string;\n  cachedPackages: string[];\n} {\n  return {\n    hits: cacheStats.hits,\n    misses: cacheStats.misses,\n    hitRate: cacheStats.hitRate,\n    cachedPackages: Array.from(availableVersionsCache.keys()),\n  };\n}\n\n/**\n * Parse a semantic version string\n * @param version Version string to parse (e.g., \"6.1.3\", \"^6.0.0\", \"~6.1.0\", \"latest\")\n * @returns Parsed semantic version or null if invalid\n */\nexport function parseSemanticVersion(version: string): SemanticVersion | null {\n  if (version === 'latest') {\n    // Return a very high version number for 'latest' to ensure it's preferred\n    return {\n      major: 999,\n      minor: 999,\n      patch: 999,\n      original: version,\n    };\n  }\n\n  // Remove common version prefixes\n  const cleanVersion = version.replace(/^[\\^~>=<]+/, '');\n\n  // Basic semver regex\n  const semverRegex = /^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([a-zA-Z0-9.-]+))?(?:\\+([a-zA-Z0-9.-]+))?$/;\n  const match = cleanVersion.match(semverRegex);\n\n  if (!match) {\n    return null;\n  }\n\n  return {\n    major: parseInt(match[1], 10),\n    minor: parseInt(match[2], 10),\n    patch: parseInt(match[3], 10),\n    prerelease: match[4],\n    build: match[5],\n    original: version,\n  };\n}\n\n/**\n * Check if a resolved version satisfies the originally requested version.\n * @param resolvedVersion The version that was resolved\n * @param requestedVersion The originally requested version\n * @returns true if the resolved version satisfies the requested version range\n */\nfunction isSatisfyingVersion(resolvedVersion: string, requestedVersion: string): boolean {\n  // Exact string match or 'latest' case\n  if (resolvedVersion === requestedVersion || requestedVersion === 'latest') {\n    return true;\n  }\n\n  const parsedResolved = parseSemanticVersion(resolvedVersion);\n  if (!parsedResolved) {\n    return false;\n  }\n\n  return satisfiesRange(parsedResolved, requestedVersion);\n}\n\n/**\n * Resolve the best available version for CDS dependencies\n * @param cdsVersion Required @sap/cds version\n * @param cdsDkVersion Required @sap/cds-dk version\n * @returns Object with resolved versions and compatibility info\n */\nexport function resolveCdsVersions(\n  cdsVersion: string,\n  cdsDkVersion: string,\n): {\n  resolvedCdsVersion: string | null;\n  resolvedCdsDkVersion: string | null;\n  cdsExactMatch: boolean;\n  cdsDkExactMatch: boolean;\n  warning?: string;\n  isFallback?: boolean;\n} {\n  const cdsVersions = getAvailableVersions('@sap/cds');\n  const cdsDkVersions = getAvailableVersions('@sap/cds-dk');\n\n  const resolvedCdsVersion = findBestAvailableVersion(cdsVersions, cdsVersion);\n  const resolvedCdsDkVersion = findBestAvailableVersion(cdsDkVersions, cdsDkVersion);\n\n  // Check if resolved versions are exact matches (string equality or 'latest' case).\n  const cdsExactMatch =\n    resolvedCdsVersion === cdsVersion || (cdsVersion === 'latest' && resolvedCdsVersion !== null);\n  const cdsDkExactMatch =\n    resolvedCdsDkVersion === cdsDkVersion ||\n    (cdsDkVersion === 'latest' && resolvedCdsDkVersion !== null);\n\n  // Check if resolved versions satisfy the requested ranges (including exact matches).\n  const cdsSatisfiesRange = resolvedCdsVersion\n    ? isSatisfyingVersion(resolvedCdsVersion, cdsVersion)\n    : false;\n  const cdsDkSatisfiesRange = resolvedCdsDkVersion\n    ? isSatisfyingVersion(resolvedCdsDkVersion, cdsDkVersion)\n    : false;\n\n  // Only consider it a fallback if we couldn't find a satisfying version.\n  const isFallback = !cdsSatisfiesRange || !cdsDkSatisfiesRange;\n\n  let warning: string | undefined;\n\n  // Check compatibility between resolved versions (only if both were resolved).\n  // Show warnings when:\n  // 1. We're using fallback versions (couldn't find compatible versions), OR\n  // 2. At least one version isn't an exact match (version range was used), OR\n  // 3. Resolved versions have actual compatibility issues (e.g., major version mismatch).\n  if (resolvedCdsVersion && resolvedCdsDkVersion) {\n    const compatibility = checkVersionCompatibility(resolvedCdsVersion, resolvedCdsDkVersion);\n\n    const shouldShowWarning =\n      isFallback ||\n      !cdsExactMatch ||\n      !cdsDkExactMatch ||\n      (compatibility.warning && !compatibility.isCompatible);\n\n    if (compatibility.warning && shouldShowWarning) {\n      warning = compatibility.warning;\n    }\n  }\n\n  return {\n    resolvedCdsVersion,\n    resolvedCdsDkVersion,\n    cdsExactMatch,\n    cdsDkExactMatch,\n    warning,\n    isFallback,\n  };\n}\n\n/**\n * Check if version satisfies a version range.\n * @param version Version to check\n * @param range Version range (e.g., \"^6.0.0\", \"~6.1.0\", \">=6.0.0\")\n * @returns true if version satisfies the range\n */\nexport function satisfiesRange(version: SemanticVersion, range: string): boolean {\n  if (range === 'latest') {\n    return true;\n  }\n\n  const rangeVersion = parseSemanticVersion(range);\n  if (!rangeVersion) {\n    return false;\n  }\n\n  if (range.startsWith('^')) {\n    // Caret range: compatible within same major version\n    return version.major === rangeVersion.major && compareVersions(version, rangeVersion) >= 0;\n  } else if (range.startsWith('~')) {\n    // Tilde range: compatible within same minor version\n    return (\n      version.major === rangeVersion.major &&\n      version.minor === rangeVersion.minor &&\n      compareVersions(version, rangeVersion) >= 0\n    );\n  } else if (range.startsWith('>=')) {\n    // Greater than or equal\n    return compareVersions(version, rangeVersion) >= 0;\n  } else if (range.startsWith('>')) {\n    // Greater than\n    return compareVersions(version, rangeVersion) > 0;\n  } else if (range.startsWith('<=')) {\n    // Less than or equal\n    return compareVersions(version, rangeVersion) <= 0;\n  } else if (range.startsWith('<')) {\n    // Less than\n    return compareVersions(version, rangeVersion) < 0;\n  } else {\n    // Exact match\n    return compareVersions(version, rangeVersion) === 0;\n  }\n}\n\n/**\n * Test-only exports - DO NOT USE IN PRODUCTION CODE\n * These are exported only for testing purposes\n */\nexport const __testOnly__ = {\n  availableVersionsCache,\n  cacheStats,\n};\n", "/** Full dependency installation utilities for retry scenarios. */\n\nimport { execFileSync } from 'child_process';\nimport { join } from 'path';\n\nimport { npmExecutable } from '../environment';\nimport type { FullDependencyInstallationResult } from './types';\nimport type { CdsProject } from '../cds/parser';\nimport { cdsExtractorLog } from '../logging';\n\n/**\n * Determines if a {@link CdsProject} requires \"full\" dependency installation.\n *\n * @param project The {@link CdsProject} to check\n * @returns `true` if the project has at least one compilation task that is\n * currently marked as `failed` AND has not yet been retried. Otherwise, `false`.\n */\nexport function needsFullDependencyInstallation(project: CdsProject): boolean {\n  // Check if already installed\n  if (project.retryStatus?.fullDependenciesInstalled) {\n    return false;\n  }\n\n  // Check if project has failed tasks that could benefit from full dependencies.\n  //\n  // Currently, we only allow for one retry, because the only significant change we\n  // can make (to justify a retry) is to install and use the full set of declared\n  // dependencies instead of the minimal set of cached (`@sap/cds` and `@sap/cds-dk`)\n  // dependencies.\n  const hasFailedTasks = project.compilationTasks.some(\n    task => task.status === 'failed' && !task.retryInfo?.hasBeenRetried,\n  );\n\n  return hasFailedTasks && project.packageJson !== undefined;\n}\n\n/**\n * Installs full dependencies for a {@link CdsProject} in support of retry behavior\n * for compilation tasks that fail unless the `cds` CLI/compiler has access to the\n * full set of dependencies declared for the project.\n *\n * @param project The CDS project to install dependencies for\n * @param sourceRoot Source root directory\n * @returns Installation result with details\n */\nexport function projectInstallDependencies(\n  project: CdsProject,\n  sourceRoot: string,\n): FullDependencyInstallationResult {\n  const startTime = Date.now();\n  const projectPath = join(sourceRoot, project.projectDir);\n\n  const result: FullDependencyInstallationResult = {\n    success: false,\n    projectDir: projectPath,\n    warnings: [],\n    durationMs: 0,\n    timedOut: false,\n  };\n\n  try {\n    // Check if project has package.json\n    if (!project.packageJson) {\n      result.error = 'No package.json found for project';\n      return result;\n    }\n\n    // Install dependencies using npm in the project's directory\n    cdsExtractorLog(\n      'info',\n      `Installing full dependencies for project ${project.projectDir} in project's node_modules`,\n    );\n\n    try {\n      execFileSync(\n        npmExecutable(),\n        ['install', '--ignore-scripts', '--quiet', '--no-audit', '--no-fund'],\n        {\n          cwd: projectPath,\n          stdio: 'inherit',\n          timeout: 120000, // 2-minute timeout\n        },\n      );\n\n      result.success = true;\n      cdsExtractorLog(\n        'info',\n        `Successfully installed full dependencies for project ${project.projectDir}`,\n      );\n    } catch (execError) {\n      if (execError instanceof Error && 'signal' in execError && execError.signal === 'SIGTERM') {\n        result.timedOut = true;\n        result.error = 'Dependency installation timed out';\n      } else {\n        result.error = `npm install failed: ${String(execError)}`;\n      }\n\n      // Still attempt retry compilation even if dependency installation fails (optimistic approach)\n      result.warnings.push(\n        `Dependency installation failed but will still attempt retry compilation: ${result.error}`,\n      );\n      cdsExtractorLog('warn', result.warnings[0]);\n    }\n  } catch (error) {\n    result.error = `Failed to install full dependencies: ${String(error)}`;\n    cdsExtractorLog('error', result.error);\n  } finally {\n    result.durationMs = Date.now() - startTime;\n  }\n\n  return result;\n}\n", "import { determineCdsCommand, determineVersionAwareCdsCommands } from './command';\nimport { compileCdsToJson } from './compile';\nimport { orchestrateRetryAttempts } from './retry';\nimport {\n  CompilationAttempt,\n  CompilationTask,\n  CompilationConfig,\n  ValidatedCdsCommand,\n} from './types';\nimport { updateCdsDependencyGraphStatus } from './validator';\nimport { cdsExtractorLog, generateStatusReport } from '../../logging';\nimport { CdsDependencyGraph, CdsProject } from '../parser/types';\n\n/** Attempt compilation with a specific command and configuration. */\nfunction attemptCompilation(\n  task: CompilationTask,\n  cdsCommand: string,\n  cacheDir: string | undefined,\n  dependencyGraph: CdsDependencyGraph,\n): CompilationAttempt {\n  const startTime = new Date();\n  const attemptId = `${task.id}_${startTime.getTime()}`;\n\n  const attempt: CompilationAttempt = {\n    id: attemptId,\n    cdsCommand,\n    cacheDir,\n    timestamp: startTime,\n    result: {\n      success: false,\n      timestamp: startTime,\n    },\n  };\n\n  try {\n    // For now, we'll use the first source file for compilation\n    // In a more sophisticated implementation, we might handle project-level compilation differently\n    const primarySourceFile = task.sourceFiles[0];\n\n    const compilationResult = compileCdsToJson(\n      primarySourceFile,\n      dependencyGraph.sourceRootDir,\n      cdsCommand,\n      cacheDir,\n      // Convert CDS projects to BasicCdsProject format expected by compileCdsToJson\n      new Map(\n        Array.from(dependencyGraph.projects.entries()).map(([key, value]) => [\n          key,\n          {\n            cdsFiles: value.cdsFiles,\n            compilationTargets: value.compilationTargets,\n            expectedOutputFile: value.expectedOutputFile,\n            projectDir: value.projectDir,\n            dependencies: value.dependencies,\n            imports: value.imports,\n            packageJson: value.packageJson,\n            compilationConfig: value.compilationConfig,\n          },\n        ]),\n      ),\n      task.projectDir,\n    );\n\n    const endTime = new Date();\n    attempt.result = {\n      ...compilationResult,\n      timestamp: endTime,\n      durationMs: endTime.getTime() - startTime.getTime(),\n      commandUsed: cdsCommand,\n      cacheDir,\n    };\n\n    if (compilationResult.success && compilationResult.outputPath) {\n      dependencyGraph.statusSummary.jsonFilesGenerated++;\n    }\n  } catch (error) {\n    const endTime = new Date();\n    attempt.error = {\n      message: String(error),\n      stack: error instanceof Error ? error.stack : undefined,\n    };\n    attempt.result.timestamp = endTime;\n    attempt.result.durationMs = endTime.getTime() - startTime.getTime();\n  }\n\n  task.attempts.push(attempt);\n  return attempt;\n}\n\n/**\n * Create a compilation task for a project or individual file\n */\nfunction createCompilationTask(\n  type: 'file' | 'project',\n  sourceFiles: string[],\n  expectedOutputFile: string,\n  projectDir: string,\n): CompilationTask {\n  // Create default commands for tasks - these should be updated later with proper commands\n  const defaultPrimaryCommand: ValidatedCdsCommand = {\n    executable: 'cds',\n    args: [],\n    originalCommand: 'cds',\n  };\n\n  const defaultRetryCommand: ValidatedCdsCommand = {\n    executable: 'npx',\n    args: ['cds'],\n    originalCommand: 'npx cds',\n  };\n\n  return {\n    id: `${type}_${projectDir}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`,\n    type,\n    status: 'pending',\n    sourceFiles,\n    expectedOutputFile,\n    projectDir,\n    attempts: [],\n    dependencies: [],\n    primaryCommand: defaultPrimaryCommand,\n    retryCommand: defaultRetryCommand,\n  };\n}\n\nfunction createCompilationConfig(\n  cdsCommand: string,\n  cacheDir: string | undefined,\n): CompilationConfig {\n  return {\n    cdsCommand: cdsCommand,\n    cacheDir: cacheDir,\n    versionCompatibility: {\n      isCompatible: true, // Will be validated during planning\n    },\n    maxRetryAttempts: 3,\n  };\n}\n\n/**\n * Execute a single compilation task\n */\nfunction executeCompilationTask(\n  task: CompilationTask,\n  project: CdsProject,\n  dependencyGraph: CdsDependencyGraph,\n  _codeqlExePath: string,\n): void {\n  task.status = 'in_progress';\n\n  const config = project.enhancedCompilationConfig;\n  if (!config) {\n    throw new Error(`No compilation configuration found for project ${project.projectDir}`);\n  }\n\n  const compilationAttempt = attemptCompilation(\n    task,\n    config.cdsCommand,\n    config.cacheDir,\n    dependencyGraph,\n  );\n\n  if (compilationAttempt.result.success) {\n    task.status = 'success';\n    return;\n  }\n\n  // Compilation failed - mark task as failed\n  const lastError = compilationAttempt.error\n    ? new Error(compilationAttempt.error.message)\n    : new Error('Compilation failed');\n\n  task.status = 'failed';\n  task.errorSummary = lastError?.message || 'Compilation failed';\n\n  // Note: Diagnostics are deferred until after retry phase completes\n  // to implement \"Silent Success\" - only add diagnostics for definitively failed tasks\n\n  cdsExtractorLog('error', `Compilation failed for task ${task.id}: ${task.errorSummary}`);\n}\n\n/**\n * Executes all compilation tasks for the provided {@link CdsDependencyGraph}.\n * Uses the provided `codeqlExePath` to run the CodeQL CLI, as needed, for\n * generating diagnositic warnings and/or errors for problems encountered while\n * running the CodeQL CDS extractor.\n */\nfunction executeCompilationTasks(dependencyGraph: CdsDependencyGraph, codeqlExePath: string): void {\n  cdsExtractorLog('info', 'Starting compilation execution for all projects...');\n\n  dependencyGraph.currentPhase = 'compiling';\n  const compilationStartTime = new Date();\n\n  // Collect all compilation tasks from all projects.\n  const allTasks: Array<{ task: CompilationTask; project: CdsProject }> = [];\n\n  for (const project of dependencyGraph.projects.values()) {\n    for (const task of project.compilationTasks) {\n      allTasks.push({ task, project });\n    }\n  }\n\n  // Execute compilation tasks sequentially. There is room for optimization in the future.\n  // For now, we keep it simple to ensure consistent debug information collection.\n  cdsExtractorLog('info', `Executing ${allTasks.length} compilation task(s)...`);\n  for (const { task, project } of allTasks) {\n    try {\n      executeCompilationTask(task, project, dependencyGraph, codeqlExePath);\n    } catch (error) {\n      const errorMessage = `Failed to execute compilation task ${task.id}: ${String(error)}`;\n      cdsExtractorLog('error', errorMessage);\n\n      dependencyGraph.errors.critical.push({\n        phase: 'compiling',\n        message: errorMessage,\n        timestamp: new Date(),\n        stack: error instanceof Error ? error.stack : undefined,\n      });\n\n      task.status = 'failed';\n      task.errorSummary = errorMessage;\n      dependencyGraph.statusSummary.failedCompilations++;\n    }\n  }\n\n  // Update project statuses\n  for (const project of dependencyGraph.projects.values()) {\n    const allTasksCompleted = project.compilationTasks.every(\n      task => task.status === 'success' || task.status === 'failed',\n    );\n\n    if (allTasksCompleted) {\n      const hasFailedTasks = project.compilationTasks.some(task => task.status === 'failed');\n      project.status = hasFailedTasks ? 'failed' : 'completed';\n      project.timestamps.compilationCompleted = new Date();\n    }\n  }\n\n  const compilationEndTime = new Date();\n  dependencyGraph.statusSummary.performance.compilationDurationMs =\n    compilationEndTime.getTime() - compilationStartTime.getTime();\n\n  cdsExtractorLog(\n    'info',\n    `Compilation execution completed. Success: ${dependencyGraph.statusSummary.successfulCompilations}, Failed: ${dependencyGraph.statusSummary.failedCompilations}`,\n  );\n}\n\n/**\n * Orchestrates the compilation process for CDS files based on a dependency graph.\n *\n * This function coordinates the planning and execution of compilation tasks,\n * tracks the compilation status, and generates a post-compilation report.\n *\n * @param dependencyGraph - The {@link CdsDependencyGraph} representing the CDS projects,\n * project dependencies, expected compilation tasks, and their statuses.\n * @param projectCacheDirMap - A map from project identifiers to their cache directory paths.\n * @param codeqlExePath - The path to the CodeQL executable. Used for generating diagnostic\n * messages as part of the broader CodeQL (JavaScript) extraction process.\n * @throws Will rethrow any errors encountered during compilation, after logging them.\n */\nexport function orchestrateCompilation(\n  dependencyGraph: CdsDependencyGraph,\n  projectCacheDirMap: Map<string, string>,\n  codeqlExePath: string,\n): void {\n  try {\n    // Phase 1: Initial compilation\n    planCompilationTasks(dependencyGraph, projectCacheDirMap);\n    executeCompilationTasks(dependencyGraph, codeqlExePath);\n\n    // CENTRALIZED STATUS UPDATE: Establish post-initial-compilation state\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Phase 2: Retry orchestration\n    cdsExtractorLog('info', 'Starting retry orchestration phase...');\n    const retryResults = orchestrateRetryAttempts(dependencyGraph, codeqlExePath);\n\n    // CENTRALIZED STATUS UPDATE: Final validation and status synchronization\n    updateCdsDependencyGraphStatus(dependencyGraph, dependencyGraph.sourceRootDir);\n\n    // Log retry results\n    if (retryResults.totalTasksRequiringRetry > 0) {\n      cdsExtractorLog(\n        'info',\n        `Retry phase completed: ${retryResults.totalTasksRequiringRetry} tasks retried, ${retryResults.totalSuccessfulRetries} successful, ${retryResults.totalFailedRetries} failed`,\n      );\n    } else {\n      cdsExtractorLog('info', 'Retry phase completed: no tasks required retry');\n    }\n\n    // Phase 3: Final status update\n    const hasFailures =\n      dependencyGraph.statusSummary.failedCompilations > 0 ||\n      dependencyGraph.errors.critical.length > 0;\n\n    dependencyGraph.statusSummary.overallSuccess = !hasFailures;\n    dependencyGraph.currentPhase = hasFailures ? 'failed' : 'completed';\n\n    // Phase 3: Status reporting (now guaranteed to be accurate)\n    const statusReport = generateStatusReport(dependencyGraph);\n    cdsExtractorLog('info', 'CDS Extractor Status Report : Post-Compilation...\\n' + statusReport);\n  } catch (error) {\n    const errorMessage = `Compilation orchestration failed: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'compiling',\n      message: errorMessage,\n      timestamp: new Date(),\n      stack: error instanceof Error ? error.stack : undefined,\n    });\n\n    dependencyGraph.currentPhase = 'failed';\n    dependencyGraph.statusSummary.overallSuccess = false;\n\n    throw error;\n  }\n}\n\n/** Plan compilation tasks for all projects in the dependency graph. */\nfunction planCompilationTasks(\n  dependencyGraph: CdsDependencyGraph,\n  projectCacheDirMap: Map<string, string>,\n): void {\n  cdsExtractorLog('info', 'Planning compilation tasks for all projects...');\n\n  dependencyGraph.currentPhase = 'compilation_planning';\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    try {\n      const cacheDir = projectCacheDirMap.get(projectDir);\n\n      // Determine version-aware CDS commands for both primary and retry scenarios\n      const commands = determineVersionAwareCdsCommands(\n        cacheDir,\n        dependencyGraph.sourceRootDir,\n        projectDir,\n        dependencyGraph,\n      );\n\n      // Keep backward compatibility - determine command string for compilation config\n      const cdsCommand = determineCdsCommand(cacheDir, dependencyGraph.sourceRootDir);\n\n      // Create compilation configuration (always project-level now)\n      const compilationConfig = createCompilationConfig(cdsCommand, cacheDir);\n\n      project.enhancedCompilationConfig = compilationConfig;\n\n      // Create compilation task (always project-level now)\n      const task = createCompilationTask(\n        'project',\n        project.cdsFiles,\n        project.expectedOutputFile,\n        projectDir,\n      );\n\n      // Update task with version-aware commands\n      task.primaryCommand = commands.primaryCommand;\n      task.retryCommand = commands.retryCommand;\n\n      project.compilationTasks = [task];\n\n      project.status = 'compilation_planned';\n      project.timestamps.compilationStarted = new Date();\n\n      cdsExtractorLog(\n        'info',\n        `Planned ${project.compilationTasks.length} compilation task(s) for project ${projectDir}`,\n      );\n    } catch (error) {\n      const errorMessage = `Failed to plan compilation for project ${projectDir}: ${String(error)}`;\n      cdsExtractorLog('error', errorMessage);\n\n      dependencyGraph.errors.critical.push({\n        phase: 'compilation_planning',\n        message: errorMessage,\n        timestamp: new Date(),\n        stack: error instanceof Error ? error.stack : undefined,\n      });\n\n      project.status = 'failed';\n    }\n  }\n\n  const totalTasks = Array.from(dependencyGraph.projects.values()).reduce(\n    (sum, project) => sum + project.compilationTasks.length,\n    0,\n  );\n\n  dependencyGraph.statusSummary.totalCompilationTasks = totalTasks;\n\n  cdsExtractorLog('info', `Compilation planning completed. Total tasks: ${totalTasks}`);\n}\n", "import { relative } from 'path';\n\n/**\n * Helper functions for mapping CDS files to their projects and cache directories\n */\n\n/**\n * Find the project directory for a CDS file\n * @param cdsFilePath Path to the CDS file\n * @param sourceRoot Source root directory\n * @param projectMap Map of project directories to project objects\n * @returns The project directory the file belongs to, or undefined if not found\n */\nexport function findProjectForCdsFile(\n  cdsFilePath: string,\n  sourceRoot: string,\n  projectMap: Map<string, { cdsFiles: string[] }>,\n): string | undefined {\n  // Get the relative path to the project directory for this CDS file\n  const relativeCdsFilePath = relative(sourceRoot, cdsFilePath);\n\n  // If the file is outside the source root, path.relative() will start with '../'\n  // In this case, we should also check against the absolute path\n  const isOutsideSourceRoot = relativeCdsFilePath.startsWith('../');\n\n  // Find the project this file belongs to\n  for (const [projectDir, project] of projectMap.entries()) {\n    if (\n      project.cdsFiles.some(\n        cdsFile =>\n          cdsFile === relativeCdsFilePath ||\n          relativeCdsFilePath.startsWith(projectDir) ||\n          (isOutsideSourceRoot && cdsFile === cdsFilePath),\n      )\n    ) {\n      return projectDir;\n    }\n  }\n\n  return undefined;\n}\n", "/** CDS indexer support for SAP CAP projects that use @sap/cds-indexer. */\n\nimport { spawnSync } from 'child_process';\nimport { delimiter, join } from 'path';\n\nimport { addCdsIndexerDiagnostic } from '../diagnostics';\nimport { npxExecutable } from '../environment';\nimport { cdsExtractorLog } from '../logging';\nimport { projectInstallDependencies } from '../packageManager';\nimport type { CdsDependencyGraph, CdsProject } from './parser/types';\n\n/** Maximum time (ms) allowed for a single cds-indexer invocation. */\nconst CDS_INDEXER_TIMEOUT_MS = 600_000;\n\n/** The npm package name for cds-indexer. */\nconst CDS_INDEXER_PACKAGE = '@sap/cds-indexer';\n\n/**\n * Result of running @sap/cds-indexer for a single project.\n */\nexport interface CdsIndexerResult {\n  /** Whether the cds-indexer ran successfully. */\n  success: boolean;\n  /** The project directory (relative to source root). */\n  projectDir: string;\n  /** Error message if the run failed. */\n  error?: string;\n  /** Duration of the run in milliseconds. */\n  durationMs: number;\n  /** Whether the run timed out. */\n  timedOut: boolean;\n}\n\n/**\n * Summary of running cds-indexer across all applicable projects.\n */\nexport interface CdsIndexerSummary {\n  /** Total number of projects in the dependency graph. */\n  totalProjects: number;\n  /** Number of projects that required cds-indexer. */\n  projectsRequiringIndexer: number;\n  /** Number of successful cds-indexer runs. */\n  successfulRuns: number;\n  /** Number of failed cds-indexer runs. */\n  failedRuns: number;\n  /** Per-project results (only for projects that required cds-indexer). */\n  results: CdsIndexerResult[];\n}\n\n/**\n * Determines whether a {@link CdsProject} uses `@sap/cds-indexer` by checking\n * the project's `package.json` for the package in `dependencies` or `devDependencies`.\n *\n * @param project The CDS project to check.\n * @returns `true` if the project declares `@sap/cds-indexer` as a dependency.\n */\nexport function projectUsesCdsIndexer(project: CdsProject): boolean {\n  if (!project.packageJson) {\n    return false;\n  }\n\n  const inDeps = project.packageJson.dependencies?.[CDS_INDEXER_PACKAGE] !== undefined;\n  const inDevDeps = project.packageJson.devDependencies?.[CDS_INDEXER_PACKAGE] !== undefined;\n\n  return inDeps || inDevDeps;\n}\n\n/**\n * Runs `npx @sap/cds-indexer` for a given CDS project directory.\n *\n * The function spawns `npx @sap/cds-indexer` with appropriate environment\n * variables to ensure the indexer can locate dependencies from the cache\n * directory (if provided) or the project's own `node_modules`.\n *\n * @param project The CDS project to run the indexer for.\n * @param sourceRoot The source root directory.\n * @param cacheDir Optional cache directory containing installed dependencies.\n * @returns A {@link CdsIndexerResult} with the outcome of the run.\n */\nexport function runCdsIndexer(\n  project: CdsProject,\n  sourceRoot: string,\n  cacheDir?: string,\n): CdsIndexerResult {\n  const projectAbsPath = join(sourceRoot, project.projectDir);\n  const startTime = Date.now();\n\n  const result: CdsIndexerResult = {\n    success: false,\n    projectDir: project.projectDir,\n    durationMs: 0,\n    timedOut: false,\n  };\n\n  try {\n    // Build NODE_PATH to include cache and project node_modules so npx can\n    // resolve the package even when it was installed in the cache directory.\n    const nodePaths: string[] = [];\n    if (cacheDir) {\n      nodePaths.push(join(cacheDir, 'node_modules'));\n    }\n    nodePaths.push(join(projectAbsPath, 'node_modules'));\n\n    const env: Record<string, string | undefined> = {\n      ...process.env,\n      NODE_PATH: nodePaths.join(delimiter),\n    };\n\n    cdsExtractorLog(\n      'info',\n      `Running ${CDS_INDEXER_PACKAGE} for project '${project.projectDir}'...`,\n    );\n\n    const spawnResult = spawnSync(npxExecutable(), ['--yes', CDS_INDEXER_PACKAGE], {\n      cwd: projectAbsPath,\n      env,\n      stdio: 'pipe',\n      timeout: CDS_INDEXER_TIMEOUT_MS,\n    });\n\n    result.durationMs = Date.now() - startTime;\n\n    // Check for timeout (signal-based termination)\n    if (spawnResult.signal === 'SIGTERM' || spawnResult.signal === 'SIGKILL') {\n      result.timedOut = true;\n      result.error = `${CDS_INDEXER_PACKAGE} timed out after ${CDS_INDEXER_TIMEOUT_MS}ms for project '${project.projectDir}'`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Check for spawn error (e.g. npx not found)\n    if (spawnResult.error) {\n      result.error = `${CDS_INDEXER_PACKAGE} failed to start for project '${project.projectDir}': ${String(spawnResult.error)}`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Check exit code\n    if (spawnResult.status !== 0) {\n      const stderr = spawnResult.stderr?.toString().trim() ?? '';\n      const stdout = spawnResult.stdout?.toString().trim() ?? '';\n      const output = stderr || stdout || 'unknown error';\n      result.error = `${CDS_INDEXER_PACKAGE} failed for project '${project.projectDir}' (exit code ${spawnResult.status}): ${output}`;\n      cdsExtractorLog('warn', result.error);\n      return result;\n    }\n\n    // Success\n    result.success = true;\n    cdsExtractorLog(\n      'info',\n      `Successfully ran ${CDS_INDEXER_PACKAGE} for project '${project.projectDir}' (${result.durationMs}ms)`,\n    );\n  } catch (error) {\n    result.durationMs = Date.now() - startTime;\n    result.error = `${CDS_INDEXER_PACKAGE} threw an unexpected error for project '${project.projectDir}': ${String(error)}`;\n    cdsExtractorLog('error', result.error);\n  }\n\n  return result;\n}\n\n/**\n * Orchestrates running `@sap/cds-indexer` for all applicable projects in the\n * dependency graph. This should be called after dependency installation and\n * before CDS compilation.\n *\n * Projects that do not declare `@sap/cds-indexer` in their `package.json` are\n * skipped. Failures are handled gracefully: a diagnostic warning is added to\n * the CodeQL database and processing continues with the remaining projects.\n *\n * @param dependencyGraph The CDS dependency graph.\n * @param sourceRoot The source root directory.\n * @param projectCacheDirMap Map of project directories to their cache directories.\n * @param codeqlExePath Optional path to the CodeQL executable for diagnostics.\n * @returns A {@link CdsIndexerSummary} with the outcome of all runs.\n */\nexport function orchestrateCdsIndexer(\n  dependencyGraph: CdsDependencyGraph,\n  sourceRoot: string,\n  projectCacheDirMap: Map<string, string>,\n  codeqlExePath?: string,\n): CdsIndexerSummary {\n  const summary: CdsIndexerSummary = {\n    totalProjects: dependencyGraph.projects.size,\n    projectsRequiringIndexer: 0,\n    successfulRuns: 0,\n    failedRuns: 0,\n    results: [],\n  };\n\n  for (const [projectDir, project] of dependencyGraph.projects.entries()) {\n    if (!projectUsesCdsIndexer(project)) {\n      continue;\n    }\n\n    summary.projectsRequiringIndexer++;\n    const cacheDir = projectCacheDirMap.get(projectDir);\n    const result = runCdsIndexer(project, sourceRoot, cacheDir);\n    summary.results.push(result);\n\n    if (result.success) {\n      summary.successfulRuns++;\n\n      // Install the project's full dependencies so the CDS compiler can\n      // resolve all CDS model imports (e.g. `@sap/cds-shim`) during\n      // compilation.  The cache directory only contains `@sap/cds`,\n      // `@sap/cds-dk`, and `@sap/cds-indexer`, which is not enough for\n      // projects that reference additional CDS packages.\n      const installResult = projectInstallDependencies(project, sourceRoot);\n      if (!installResult.success) {\n        cdsExtractorLog(\n          'warn',\n          `Full dependency installation failed for project '${projectDir}' after successful cds-indexer run: ${installResult.error ?? 'unknown error'}`,\n        );\n      }\n    } else {\n      summary.failedRuns++;\n\n      // Add a diagnostic warning \u2014 the compilation may still succeed without\n      // the indexer, so we use a warning rather than an error.\n      if (codeqlExePath) {\n        addCdsIndexerDiagnostic(\n          projectDir,\n          result.error ?? `${CDS_INDEXER_PACKAGE} failed for project '${projectDir}'`,\n          codeqlExePath,\n          sourceRoot,\n        );\n      }\n    }\n  }\n\n  // Log summary\n  if (summary.projectsRequiringIndexer > 0) {\n    cdsExtractorLog(\n      'info',\n      `CDS indexer summary: ${summary.projectsRequiringIndexer} project(s) required indexer, ${summary.successfulRuns} succeeded, ${summary.failedRuns} failed`,\n    );\n  } else {\n    cdsExtractorLog('info', 'No projects require @sap/cds-indexer.');\n  }\n\n  return summary;\n}\n", "import { dirname, join, resolve, sep, basename } from 'path';\n\nimport {\n  determineCdsFilesForProjectDir,\n  determineCdsFilesToCompile,\n  determineCdsProjectsUnderSourceDir,\n  extractCdsImports,\n  readPackageJsonFile,\n} from './functions';\nimport { CdsDependencyGraph, CdsImport, CdsProject, BasicCdsProject } from './types';\nimport { modelCdsJsonFile } from '../../constants';\nimport { cdsExtractorLog } from '../../logging';\nimport { getPathsIgnorePatterns, shouldIgnorePath } from '../../paths-ignore';\n\n/**\n * Builds a basic dependency graph of CDS projects and performs the initial parsing stage of the CDS extractor.\n * This is the internal function that creates basic project structures.\n *\n * @param sourceRootDir - Source root directory\n * @returns Map of project directories to their BasicCdsProject objects with dependency information\n */\nfunction buildBasicCdsProjectDependencyGraph(sourceRootDir: string): Map<string, BasicCdsProject> {\n  // Find all CDS projects under the source directory\n  cdsExtractorLog('info', 'Detecting CDS projects...');\n  const projectDirs = determineCdsProjectsUnderSourceDir(sourceRootDir);\n\n  if (projectDirs.length === 0) {\n    cdsExtractorLog('info', 'No CDS projects found.');\n    return new Map<string, BasicCdsProject>();\n  }\n\n  cdsExtractorLog('info', `Found ${projectDirs.length} CDS project(s) under source directory.`);\n\n  // Load paths-ignore patterns once for the entire source root\n  const pathsIgnorePatterns = getPathsIgnorePatterns(sourceRootDir);\n\n  const projectMap = new Map<string, BasicCdsProject>();\n\n  // First pass: create CdsProject objects for each project directory\n  for (const projectDir of projectDirs) {\n    // Skip projects whose directory matches a paths-ignore pattern\n    if (pathsIgnorePatterns.length > 0 && shouldIgnorePath(projectDir, pathsIgnorePatterns)) {\n      cdsExtractorLog('info', `Skipping project '${projectDir}' \u2014 matches paths-ignore pattern`);\n      continue;\n    }\n\n    const absoluteProjectDir = join(sourceRootDir, projectDir);\n    const cdsFiles = determineCdsFilesForProjectDir(sourceRootDir, absoluteProjectDir);\n\n    // Skip projects with no CDS files remaining after paths-ignore filtering\n    if (cdsFiles.length === 0) {\n      cdsExtractorLog(\n        'info',\n        `Skipping project '${projectDir}' \u2014 no CDS files remain after paths-ignore filtering`,\n      );\n      continue;\n    }\n\n    // Try to load package.json if it exists\n    const packageJsonPath = join(absoluteProjectDir, 'package.json');\n    const packageJson = readPackageJsonFile(packageJsonPath);\n\n    projectMap.set(projectDir, {\n      projectDir,\n      cdsFiles,\n      compilationTargets: [], // Will be populated in the third pass\n      expectedOutputFile: join(projectDir, modelCdsJsonFile),\n      packageJson,\n      dependencies: [],\n      imports: new Map<string, CdsImport[]>(),\n    });\n  }\n\n  // Second pass: analyze dependencies between projects\n  cdsExtractorLog('info', 'Analyzing dependencies between CDS projects...');\n  for (const [projectDir, project] of projectMap.entries()) {\n    // Check each CDS file for imports\n    for (const relativeFilePath of project.cdsFiles) {\n      const absoluteFilePath = join(sourceRootDir, relativeFilePath);\n\n      try {\n        const imports = extractCdsImports(absoluteFilePath);\n        const enrichedImports: CdsImport[] = [];\n\n        // Process each import\n        for (const importInfo of imports) {\n          const enrichedImport: CdsImport = { ...importInfo };\n\n          if (importInfo.isRelative) {\n            // Resolve the relative import path\n            const importedFilePath = resolve(dirname(absoluteFilePath), importInfo.path);\n            const normalizedImportedPath = importedFilePath.endsWith('.cds')\n              ? importedFilePath\n              : `${importedFilePath}.cds`;\n\n            // Store the resolved path relative to source root\n            try {\n              const relativeToDirPath = dirname(relativeFilePath);\n              const resolvedPath = resolve(join(sourceRootDir, relativeToDirPath), importInfo.path);\n              const normalizedResolvedPath = resolvedPath.endsWith('.cds')\n                ? resolvedPath\n                : `${resolvedPath}.cds`;\n\n              // Convert to relative path from source root\n              if (normalizedResolvedPath.startsWith(sourceRootDir)) {\n                enrichedImport.resolvedPath = normalizedResolvedPath\n                  .substring(sourceRootDir.length)\n                  .replace(/^[/\\\\]/, '');\n              }\n            } catch (error) {\n              cdsExtractorLog(\n                'warn',\n                `Could not resolve import path for ${importInfo.path} in ${relativeFilePath}: ${String(error)}`,\n              );\n            }\n\n            // Find which project contains this imported file\n            for (const [otherProjectDir, otherProject] of projectMap.entries()) {\n              if (otherProjectDir === projectDir) continue; // Skip self\n\n              const otherProjectAbsoluteDir = join(sourceRootDir, otherProjectDir);\n\n              // Check if the imported file is in the other project\n              const isInOtherProject = otherProject.cdsFiles.some(otherFile => {\n                const otherAbsolutePath = join(sourceRootDir, otherFile);\n                return (\n                  otherAbsolutePath === normalizedImportedPath ||\n                  normalizedImportedPath.startsWith(otherProjectAbsoluteDir + sep)\n                );\n              });\n\n              if (isInOtherProject) {\n                // Add dependency if not already present\n                project.dependencies ??= [];\n\n                if (!project.dependencies.includes(otherProject)) {\n                  project.dependencies.push(otherProject);\n                }\n              }\n            }\n          }\n          // For module imports, check package.json dependencies\n          else if (importInfo.isModule && project.packageJson) {\n            const dependencies = {\n              ...(project.packageJson.dependencies ?? {}),\n              ...(project.packageJson.devDependencies ?? {}),\n            };\n\n            // Extract module name from import path (e.g., '@sap/cds/common' -> '@sap/cds')\n            const moduleName = importInfo.path.split('/')[0].startsWith('@')\n              ? importInfo.path.split('/').slice(0, 2).join('/')\n              : importInfo.path.split('/')[0];\n\n            if (dependencies[moduleName]) {\n              // This is a valid module dependency, nothing more to do here\n              // In the future, we could track module dependencies separately\n            }\n          }\n\n          enrichedImports.push(enrichedImport);\n        }\n\n        // Store the enriched imports in the project\n        project.imports?.set(relativeFilePath, enrichedImports);\n      } catch (error: unknown) {\n        cdsExtractorLog(\n          'warn',\n          `Error processing imports in ${absoluteFilePath}: ${String(error)}`,\n        );\n      }\n    }\n  }\n\n  // Third pass: determine CDS files to compile and expected output files for each project\n  cdsExtractorLog(\n    'info',\n    'Determining CDS files to compile and expected output files for each project...',\n  );\n  for (const [, project] of projectMap.entries()) {\n    try {\n      const projectPlan = determineCdsFilesToCompile(sourceRootDir, project);\n\n      // Assign the calculated values back to the project\n      project.compilationTargets = projectPlan.compilationTargets;\n      project.expectedOutputFile = projectPlan.expectedOutputFile;\n    } catch (error) {\n      cdsExtractorLog(\n        'warn',\n        `Error determining files to compile for project ${project.projectDir}: ${String(error)}`,\n      );\n      // Fall back to default project compilation on error\n      project.compilationTargets = project.cdsFiles.map(file => basename(file));\n      project.expectedOutputFile = join(project.projectDir, modelCdsJsonFile);\n    }\n  }\n\n  return projectMap;\n}\n\n/**\n * Builds a CDS dependency graph with comprehensive tracking and debug information.\n * This is the main function that returns a CdsDependencyGraph instead of a simple Map.\n * The extractor now runs in autobuild mode by default.\n *\n * @param sourceRootDir - Source root directory\n * @returns CDS dependency graph with comprehensive tracking\n */\nexport function buildCdsProjectDependencyGraph(sourceRootDir: string): CdsDependencyGraph {\n  const startTime = new Date();\n\n  // Create the initial dependency graph structure\n  const dependencyGraph: CdsDependencyGraph = {\n    id: `cds_graph_${Date.now()}`,\n    sourceRootDir,\n    projects: new Map<string, CdsProject>(),\n    debugInfo: {\n      extractor: {\n        runMode: 'autobuild',\n        sourceRootDir,\n        startTime,\n        environment: {\n          nodeVersion: process.version,\n          platform: process.platform,\n          cwd: process.cwd(),\n          argv: process.argv,\n        },\n      },\n      parser: {\n        projectsDetected: 0,\n        cdsFilesFound: 0,\n        dependencyResolutionSuccess: true,\n        parsingErrors: [],\n        parsingWarnings: [],\n      },\n      compiler: {\n        availableCommands: [],\n        selectedCommand: '',\n        cacheDirectories: [],\n        cacheInitialized: false,\n      },\n    },\n    currentPhase: 'parsing',\n    statusSummary: {\n      overallSuccess: false,\n      totalProjects: 0,\n      totalCdsFiles: 0,\n      totalCompilationTasks: 0,\n      successfulCompilations: 0,\n      failedCompilations: 0,\n      skippedCompilations: 0,\n      jsonFilesGenerated: 0,\n      criticalErrors: [],\n      warnings: [],\n      performance: {\n        totalDurationMs: 0,\n        parsingDurationMs: 0,\n        compilationDurationMs: 0,\n        extractionDurationMs: 0,\n      },\n    },\n    config: {\n      maxRetryAttempts: 3,\n      enableDetailedLogging: false, // Debug modes removed\n      generateDebugOutput: false, // Debug modes removed\n      compilationTimeoutMs: 30000, // 30 seconds\n    },\n    errors: {\n      critical: [],\n      warnings: [],\n    },\n    retryStatus: {\n      totalTasksRequiringRetry: 0,\n      totalTasksSuccessfullyRetried: 0,\n      totalRetryAttempts: 0,\n      projectsRequiringFullDependencies: new Set<string>(),\n      projectsWithFullDependencies: new Set<string>(),\n    },\n  };\n\n  try {\n    // Use the existing function to build the basic project map\n    const basicProjectMap = buildBasicCdsProjectDependencyGraph(sourceRootDir);\n\n    // Convert basic projects to CDS projects\n    for (const [projectDir, basicProject] of basicProjectMap.entries()) {\n      const cdsProject: CdsProject = {\n        ...basicProject,\n        id: `project_${projectDir.replace(/[^a-zA-Z0-9]/g, '_')}_${Date.now()}`,\n        enhancedCompilationConfig: undefined, // Will be set during compilation planning\n        compilationTasks: [],\n        parserDebugInfo: {\n          dependenciesResolved: [],\n          importErrors: [],\n          parseErrors: new Map<string, string>(),\n        },\n        status: 'discovered',\n        timestamps: {\n          discovered: new Date(),\n        },\n      };\n\n      dependencyGraph.projects.set(projectDir, cdsProject);\n    }\n\n    // Update summary statistics\n    dependencyGraph.statusSummary.totalProjects = dependencyGraph.projects.size;\n    dependencyGraph.statusSummary.totalCdsFiles = Array.from(\n      dependencyGraph.projects.values(),\n    ).reduce((sum, project) => sum + project.cdsFiles.length, 0);\n\n    dependencyGraph.debugInfo.parser.projectsDetected = dependencyGraph.projects.size;\n    dependencyGraph.debugInfo.parser.cdsFilesFound = dependencyGraph.statusSummary.totalCdsFiles;\n\n    // Mark dependency resolution phase as completed\n    dependencyGraph.currentPhase = 'dependency_resolution';\n\n    const endTime = new Date();\n    dependencyGraph.debugInfo.extractor.endTime = endTime;\n    dependencyGraph.debugInfo.extractor.durationMs = endTime.getTime() - startTime.getTime();\n    dependencyGraph.statusSummary.performance.parsingDurationMs =\n      dependencyGraph.debugInfo.extractor.durationMs;\n\n    cdsExtractorLog(\n      'info',\n      `CDS dependency graph created with ${dependencyGraph.projects.size} projects and ${dependencyGraph.statusSummary.totalCdsFiles} CDS files`,\n    );\n\n    return dependencyGraph;\n  } catch (error) {\n    const errorMessage = `Failed to build CDS dependency graph: ${String(error)}`;\n    cdsExtractorLog('error', errorMessage);\n\n    dependencyGraph.errors.critical.push({\n      phase: 'parsing',\n      message: errorMessage,\n      timestamp: new Date(),\n      stack: error instanceof Error ? error.stack : undefined,\n    });\n\n    dependencyGraph.currentPhase = 'failed';\n    return dependencyGraph;\n  }\n}\n", "import { existsSync, readFileSync, statSync } from 'fs';\nimport { basename, dirname, join, relative, sep } from 'path';\n\nimport { sync } from 'glob';\n\nimport { CdsFilesToCompile, CdsImport, PackageJson } from './types';\nimport { modelCdsJsonFile } from '../../constants';\nimport { cdsExtractorLog } from '../../logging';\nimport { filterIgnoredPaths, getPathsIgnorePatterns } from '../../paths-ignore';\n\n/**\n * Determines the list of CDS files to be parsed for the specified project directory.\n *\n * @param sourceRootDir - The source root directory to search for CDS files. This is\n * used to resolve relative paths in relation to a common (source root) directory for\n * multiple projects.\n * @param projectDir - The full, local filesystem path of the directory that contains\n * the individual `.cds` definition files for some `CAP` project.\n * @returns An array of strings representing the paths, relative to the source root\n * directory, of the `.cds` files to be parsed for a given project.\n */\nexport function determineCdsFilesForProjectDir(\n  sourceRootDir: string,\n  projectDir: string,\n): string[] {\n  if (!sourceRootDir || !projectDir) {\n    throw new Error(\n      `Unable to determine CDS files for project dir '${projectDir}'; both sourceRootDir and projectDir must be provided.`,\n    );\n  }\n\n  // Normalize paths by removing trailing slashes for comparison\n  const normalizedSourceRoot = sourceRootDir.replace(/[/\\\\]+$/, '');\n  const normalizedProjectDir = projectDir.replace(/[/\\\\]+$/, '');\n\n  if (\n    !normalizedProjectDir.startsWith(normalizedSourceRoot) &&\n    normalizedProjectDir !== normalizedSourceRoot\n  ) {\n    throw new Error(\n      'projectDir must be a subdirectory of sourceRootDir or equal to sourceRootDir.',\n    );\n  }\n\n  try {\n    // Use glob to find all .cds files under the project directory, excluding node_modules\n    const cdsFiles = sync(join(projectDir, '**/*.cds'), {\n      nodir: true,\n      ignore: ['**/node_modules/**', '**/*.testproj/**'],\n      windowsPathsNoEscape: true,\n    });\n\n    // Convert absolute paths to paths relative to sourceRootDir\n    const relativePaths = cdsFiles.map(file => relative(sourceRootDir, file));\n\n    // Apply paths-ignore filtering from CodeQL config\n    const pathsIgnorePatterns = getPathsIgnorePatterns(sourceRootDir);\n    if (pathsIgnorePatterns.length > 0) {\n      const filtered = filterIgnoredPaths(relativePaths, pathsIgnorePatterns);\n      const ignoredCount = relativePaths.length - filtered.length;\n      if (ignoredCount > 0) {\n        cdsExtractorLog(\n          'info',\n          `Filtered ${ignoredCount} CDS file(s) matching paths-ignore patterns in project ${relative(sourceRootDir, projectDir) || '.'}`,\n        );\n      }\n      return filtered;\n    }\n\n    return relativePaths;\n  } catch (error: unknown) {\n    cdsExtractorLog('error', `Error finding CDS files in ${projectDir}: ${String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Determines the list of distinct CDS projects under the specified source\n * directory.\n * @param sourceRootDir - The source root directory to search for CDS projects.\n * @returns An array of strings representing the paths, relative to the source\n * root directory, of the detected CDS projects.\n */\nexport function determineCdsProjectsUnderSourceDir(sourceRootDir: string): string[] {\n  if (!sourceRootDir || !existsSync(sourceRootDir)) {\n    throw new Error(`Source root directory '${sourceRootDir}' does not exist.`);\n  }\n\n  const foundProjects = new Set<string>();\n\n  // Find all potential project directories by looking for package.json files and CDS files\n  const packageJsonFiles = sync(join(sourceRootDir, '**/package.json'), {\n    nodir: true,\n    ignore: ['**/node_modules/**', '**/*.testproj/**'],\n    windowsPathsNoEscape: true,\n  });\n\n  const cdsFiles = sync(join(sourceRootDir, '**/*.cds'), {\n    nodir: true,\n    ignore: ['**/node_modules/**', '**/*.testproj/**'],\n    windowsPathsNoEscape: true,\n  });\n\n  // Collect all potential project directories\n  const candidateDirectories = new Set<string>();\n\n  // Add directories with package.json files\n  for (const packageJsonFile of packageJsonFiles) {\n    candidateDirectories.add(dirname(packageJsonFile));\n  }\n\n  // Add directories with CDS files and try to find their project roots\n  for (const cdsFile of cdsFiles) {\n    const cdsDir = dirname(cdsFile);\n    const projectRoot = findProjectRootFromCdsFile(cdsDir, sourceRootDir);\n    if (projectRoot) {\n      candidateDirectories.add(projectRoot);\n    } else {\n      candidateDirectories.add(cdsDir);\n    }\n  }\n\n  // Filter candidates to only include likely CDS projects\n  for (const dir of candidateDirectories) {\n    if (isLikelyCdsProject(dir)) {\n      const relativePath = relative(sourceRootDir, dir);\n      const projectDir = relativePath || '.';\n\n      // Check if this project is already included as a parent or child of an existing project\n      let shouldAdd = true;\n      const existingProjects = Array.from(foundProjects);\n\n      for (const existingProject of existingProjects) {\n        const existingAbsPath = join(sourceRootDir, existingProject);\n\n        // Skip if this directory is a subdirectory of an existing project,\n        // but only if the parent is not a monorepo with its own CDS content\n        if (dir.startsWith(existingAbsPath + sep)) {\n          // Check if parent is a monorepo root with its own CDS content\n          const parentPackageJsonPath = join(existingAbsPath, 'package.json');\n          const parentPackageJson = readPackageJsonFile(parentPackageJsonPath);\n          const isParentMonorepo =\n            parentPackageJson?.workspaces &&\n            Array.isArray(parentPackageJson.workspaces) &&\n            parentPackageJson.workspaces.length > 0;\n\n          // If parent is a monorepo with CDS content, allow both parent and child\n          if (\n            isParentMonorepo &&\n            (hasStandardCdsContent(existingAbsPath) || hasDirectCdsContent(existingAbsPath))\n          ) {\n            // Both parent and child can coexist as separate CDS projects\n            shouldAdd = true;\n          } else {\n            // Traditional case: exclude subdirectory\n            shouldAdd = false;\n          }\n          break;\n        }\n\n        // Remove existing project if it's a subdirectory of the current directory,\n        // unless the current directory is a monorepo root and the existing project has its own CDS content\n        if (existingAbsPath.startsWith(dir + sep)) {\n          const currentPackageJsonPath = join(dir, 'package.json');\n          const currentPackageJson = readPackageJsonFile(currentPackageJsonPath);\n          const isCurrentMonorepo =\n            currentPackageJson?.workspaces &&\n            Array.isArray(currentPackageJson.workspaces) &&\n            currentPackageJson.workspaces.length > 0;\n\n          // If current is a monorepo and the existing project is a legitimate CDS project, keep both\n          if (!(isCurrentMonorepo && isLikelyCdsProject(existingAbsPath))) {\n            foundProjects.delete(existingProject);\n          }\n        }\n      }\n\n      if (shouldAdd) {\n        foundProjects.add(projectDir);\n      }\n    }\n  }\n\n  return Array.from(foundProjects).sort();\n}\n\n/**\n * Parses a CDS file to extract import statements\n *\n * @param filePath - Path to the CDS file\n * @returns Array of import statements found in the file\n */\nexport function extractCdsImports(filePath: string): CdsImport[] {\n  if (!existsSync(filePath)) {\n    throw new Error(`File does not exist: ${filePath}`);\n  }\n\n  const content = readFileSync(filePath, 'utf8');\n  const imports: CdsImport[] = [];\n\n  // Regular expression to match using statements\n  // This handles: using X from 'path'; and using { X, Y } from 'path';\n  // and also using X as Y from 'path';\n  const usingRegex =\n    /using\\s+(?:{[^}]+}|[\\w.]+(?:\\s+as\\s+[\\w.]+)?)\\s+from\\s+['\"`]([^'\"`]+)['\"`]\\s*;/g;\n\n  let match;\n  while ((match = usingRegex.exec(content)) !== null) {\n    const path = match[1];\n    imports.push({\n      statement: match[0],\n      path,\n      isRelative: path.startsWith('./') || path.startsWith('../'),\n      isModule: !path.startsWith('./') && !path.startsWith('../') && !path.startsWith('/'),\n    });\n  }\n\n  return imports;\n}\n\n/**\n * Attempts to find the project root directory starting from a directory containing a CDS file\n *\n * @param cdsFileDir - Directory containing a CDS file\n * @param sourceRootDir - Source root directory to limit the search\n * @returns The project root directory or null if not found\n */\nfunction findProjectRootFromCdsFile(cdsFileDir: string, sourceRootDir: string): string | null {\n  // Skip node_modules and testproj directories entirely\n  if (cdsFileDir.includes('node_modules') || cdsFileDir.includes('.testproj')) {\n    return null;\n  }\n\n  let currentDir = cdsFileDir;\n\n  // Limit the upward search to the sourceRootDir\n  while (currentDir.startsWith(sourceRootDir)) {\n    // Check if this directory looks like a project root\n    if (isLikelyCdsProject(currentDir)) {\n      // If this is a standard CAP subdirectory (srv, db, app), check if the parent\n      // directory should be the real project root\n      const currentDirName = basename(currentDir);\n      const isStandardSubdir = ['srv', 'db', 'app'].includes(currentDirName);\n\n      if (isStandardSubdir) {\n        const parentDir = dirname(currentDir);\n\n        if (\n          parentDir !== currentDir &&\n          parentDir.startsWith(sourceRootDir) &&\n          !parentDir.includes('node_modules') &&\n          !parentDir.includes('.testproj') &&\n          isLikelyCdsProject(parentDir)\n        ) {\n          // The parent is also a CDS project, so it's likely the real project root\n          return parentDir;\n        }\n      }\n\n      // For non-standard subdirectories, also check if the parent might be a better project root\n      const parentDir = dirname(currentDir);\n\n      if (\n        parentDir !== currentDir &&\n        parentDir.startsWith(sourceRootDir) &&\n        !parentDir.includes('node_modules') &&\n        !parentDir.includes('.testproj')\n      ) {\n        const hasDbDir =\n          existsSync(join(parentDir, 'db')) && statSync(join(parentDir, 'db')).isDirectory();\n        const hasSrvDir =\n          existsSync(join(parentDir, 'srv')) && statSync(join(parentDir, 'srv')).isDirectory();\n        const hasAppDir =\n          existsSync(join(parentDir, 'app')) && statSync(join(parentDir, 'app')).isDirectory();\n\n        // Use the same CAP project structure logic as below\n        if ((hasDbDir && hasSrvDir) || (hasSrvDir && hasAppDir)) {\n          return parentDir;\n        }\n      }\n\n      return currentDir;\n    }\n\n    // Check for typical CAP project structure indicators\n    const hasDbDir =\n      existsSync(join(currentDir, 'db')) && statSync(join(currentDir, 'db')).isDirectory();\n    const hasSrvDir =\n      existsSync(join(currentDir, 'srv')) && statSync(join(currentDir, 'srv')).isDirectory();\n    const hasAppDir =\n      existsSync(join(currentDir, 'app')) && statSync(join(currentDir, 'app')).isDirectory();\n\n    if ((hasDbDir && hasSrvDir) || (hasSrvDir && hasAppDir)) {\n      return currentDir;\n    }\n\n    // Move up one directory\n    const parentDir = dirname(currentDir);\n    if (parentDir === currentDir) {\n      // We've reached the root of the filesystem\n      break;\n    }\n    currentDir = parentDir;\n  }\n\n  // If we couldn't determine a proper project root, return the original directory\n  return cdsFileDir;\n}\n\n/**\n * Determines if a directory likely contains a CAP project by checking for key\n * indicators like package.json with CAP dependencies or .cds files in standard\n * locations.\n *\n * @param dir - Directory to check\n * @returns true if the directory likely contains a CAP project\n */\nexport function isLikelyCdsProject(dir: string): boolean {\n  try {\n    // Skip node_modules and testproj directories entirely\n    if (dir.includes('node_modules') || dir.includes('.testproj')) {\n      return false;\n    }\n\n    // Check for CDS files in standard locations (checking both direct and nested files)\n    const hasStandardCdsDirectories = hasStandardCdsContent(dir);\n    const hasDirectCdsFiles = hasDirectCdsContent(dir);\n    const hasCdsFiles = hasStandardCdsDirectories || hasDirectCdsFiles;\n\n    // Check if package.json exists and has CAP dependencies\n    const hasCapDependencies = hasPackageJsonWithCapDeps(dir);\n\n    if (hasCapDependencies) {\n      // If there are CAP dependencies but no CDS files, there's nothing for us to do\n      if (!hasCdsFiles) {\n        return false;\n      }\n\n      // Check if this is a monorepo root\n      const packageJsonPath = join(dir, 'package.json');\n      const packageJson = readPackageJsonFile(packageJsonPath);\n\n      if (\n        packageJson?.workspaces &&\n        Array.isArray(packageJson.workspaces) &&\n        packageJson.workspaces.length > 0\n      ) {\n        // This is likely a monorepo - only treat as CDS project if it has actual CDS content\n        if (!hasCdsFiles) {\n          // This is a monorepo root without its own CDS content\n          return false;\n        }\n      }\n\n      return true;\n    }\n\n    // If no CAP dependencies, only consider it a CDS project if it has CDS files\n    return hasCdsFiles;\n  } catch (error: unknown) {\n    cdsExtractorLog('error', `Error checking directory ${dir}: ${String(error)}`);\n    return false;\n  }\n}\n\n/**\n * Check if a directory has CDS content in standard CAP directories.\n */\nfunction hasStandardCdsContent(dir: string): boolean {\n  const standardLocations = [join(dir, 'db'), join(dir, 'srv'), join(dir, 'app')];\n\n  for (const location of standardLocations) {\n    if (existsSync(location) && statSync(location).isDirectory()) {\n      // Check for any .cds files at any level under these directories.\n      const cdsFiles = sync(join(location, '**/*.cds'), {\n        nodir: true,\n        windowsPathsNoEscape: true,\n      });\n      if (cdsFiles.length > 0) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\n/**\n * Check if a directory has direct CDS files.\n */\nfunction hasDirectCdsContent(dir: string): boolean {\n  const directCdsFiles = sync(join(dir, '*.cds'), { windowsPathsNoEscape: true });\n  return directCdsFiles.length > 0;\n}\n\n/**\n * Safely parses a package.json file, using the cache if available\n * @param filePath - Path to the package.json file\n * @returns The parsed package.json content or undefined if the file doesn't exist or can't be parsed\n */\nexport function readPackageJsonFile(filePath: string): PackageJson | undefined {\n  if (!existsSync(filePath)) {\n    return undefined;\n  }\n\n  try {\n    const content = readFileSync(filePath, 'utf8');\n    const packageJson = JSON.parse(content) as PackageJson;\n    return packageJson;\n  } catch (error) {\n    cdsExtractorLog('warn', `Error parsing package.json at ${filePath}: ${String(error)}`);\n    return undefined;\n  }\n}\n\n/**\n * Determines which CDS files should be compiled for a given project and what output files to expect.\n * This function analyzes the project structure and dependencies to decide\n * whether to use project-level compilation or individual file compilation.\n *\n * For CAP projects (identified by either having @sap/cds dependencies or\n * typical CAP directory structure), it returns a special marker indicating\n * project-level compilation should be used. For other projects, it attempts\n * to identify root files (files that are not imported by others) and returns\n * those for individual compilation.\n *\n * @param sourceRootDir - The source root directory\n * @param project - The project to analyze, containing cdsFiles, imports, and projectDir\n * @returns Object containing files to compile and expected output files\n */\nexport function determineCdsFilesToCompile(\n  sourceRootDir: string,\n  project: {\n    cdsFiles: string[];\n    imports?: Map<string, CdsImport[]>;\n    projectDir: string;\n  },\n): CdsFilesToCompile {\n  if (!project.cdsFiles || project.cdsFiles.length === 0) {\n    return {\n      compilationTargets: [],\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  const absoluteProjectDir = join(sourceRootDir, project.projectDir);\n\n  // Check for standard CAP directories\n  const capDirectories = ['db', 'srv', 'app'];\n  const existingCapDirs = capDirectories.filter(dir => existsSync(join(absoluteProjectDir, dir)));\n\n  if (existingCapDirs.length > 0) {\n    // Use standard CAP directories\n    return {\n      compilationTargets: existingCapDirs,\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  // Check for root-level CDS files\n  const rootCdsFiles = project.cdsFiles\n    .filter(file => dirname(join(sourceRootDir, file)) === absoluteProjectDir)\n    .map(file => basename(file));\n\n  if (rootCdsFiles.length > 0) {\n    // Use root-level files\n    return {\n      compilationTargets: rootCdsFiles,\n      expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n    };\n  }\n\n  // Use all CDS files with their relative paths\n  const compilationTargets = project.cdsFiles.map(file =>\n    relative(absoluteProjectDir, join(sourceRootDir, file)),\n  );\n\n  return {\n    compilationTargets,\n    expectedOutputFile: join(project.projectDir, modelCdsJsonFile),\n  };\n}\n\n/**\n * Checks if a directory has a package.json with CAP dependencies.\n * This function is used to determine if a directory has the necessary CAP packages installed,\n * which is one indicator that it might be a CAP project.\n *\n * @param dir - Directory to check for package.json with CAP dependencies\n * @returns true if the directory has a package.json with CAP dependencies\n */\nexport function hasPackageJsonWithCapDeps(dir: string): boolean {\n  try {\n    const packageJsonPath = join(dir, 'package.json');\n    const packageJson = readPackageJsonFile(packageJsonPath);\n\n    if (packageJson) {\n      const dependencies = {\n        ...(packageJson.dependencies ?? {}),\n        ...(packageJson.devDependencies ?? {}),\n      };\n\n      // Check for common CAP dependencies\n      return !!(dependencies['@sap/cds'] || dependencies['@sap/cds-dk']);\n    }\n\n    return false;\n  } catch {\n    return false;\n  }\n}\n", "import { spawnSync, SpawnSyncReturns } from 'child_process';\n\nimport type { CdsDependencyGraph } from './cds/parser';\nimport { addJavaScriptExtractorDiagnostic } from './diagnostics';\nimport { applyPathsIgnoreToLgtmFilters, configureLgtmIndexFilters } from './environment';\nimport { createMarkerFile, removeMarkerFile } from './filesystem';\nimport {\n  cdsExtractorLog,\n  logExtractorStop,\n  logPerformanceTrackingStart,\n  logPerformanceTrackingStop,\n} from './logging';\n\n/**\n * Run the JavaScript extractor autobuild script\n * @param sourceRoot The source root directory\n * @param autobuildScriptPath Path to the autobuild script\n * @param codeqlExePath Path to the CodeQL executable (optional)\n * @returns Success status and any error message\n */\nexport function runJavaScriptExtractor(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath?: string,\n): { success: boolean; error?: string } {\n  cdsExtractorLog(\n    'info',\n    `Extracting the .cds.json files by running the 'javascript' extractor autobuild script:\n        ${autobuildScriptPath}`,\n  );\n\n  /**\n   * Invoke the javascript autobuilder to index the .cds.json files only.\n   *\n   * Environment variables must be passed from this script's process to the\n   * process that invokes the autobuild script, otherwise the CDS autobuild.sh\n   * script will not be invoked by the autobuild script built into the\n   * 'javascript' extractor.\n   *\n   * IMPORTANT: The JavaScript extractor autobuild script must be invoked with\n   * the current working directory set to the project (source) root directory\n   * because it assumes it is running from there.\n   */\n  const result: SpawnSyncReturns<Buffer> = spawnSync(autobuildScriptPath, {\n    cwd: sourceRoot,\n    env: process.env,\n    shell: true,\n    stdio: 'inherit',\n  });\n\n  if (result.error) {\n    const errorMessage = `Error running JavaScript extractor: ${result.error.message}`;\n    if (codeqlExePath) {\n      addJavaScriptExtractorDiagnostic(sourceRoot, errorMessage, codeqlExePath, sourceRoot);\n    }\n    return {\n      success: false,\n      error: errorMessage,\n    };\n  }\n\n  if (result.status !== 0) {\n    const errorMessage = `JavaScript extractor failed with exit code ${String(result.status)}`;\n    if (codeqlExePath) {\n      addJavaScriptExtractorDiagnostic(sourceRoot, errorMessage, codeqlExePath, sourceRoot);\n    }\n    return {\n      success: false,\n      error: errorMessage,\n    };\n  }\n\n  return { success: true };\n}\n\n/**\n * Runs JavaScript extraction with marker file handling and optional dependency graph updates.\n * Encapsulates the common pattern used in multiple places throughout the extractor.\n *\n * @param sourceRoot - The root directory of the source code\n * @param autobuildScriptPath - Path to the autobuild script\n * @param codeqlExePath - Path to the CodeQL executable\n * @param dependencyGraph - Optional dependency graph to update with performance metrics\n * @returns True if extraction was successful, false otherwise\n */\nexport function runJavaScriptExtractionWithMarker(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath: string,\n  dependencyGraph?: CdsDependencyGraph,\n): boolean {\n  // Configure LGTM index filters\n  configureLgtmIndexFilters();\n\n  // Apply paths-ignore patterns from CodeQL config to LGTM_INDEX_FILTERS\n  applyPathsIgnoreToLgtmFilters(sourceRoot);\n\n  // Create marker file\n  const markerFilePath = createMarkerFile(sourceRoot);\n\n  try {\n    logPerformanceTrackingStart('JavaScript Extraction');\n    const extractionStartTime = Date.now();\n    const extractorResult = runJavaScriptExtractor(sourceRoot, autobuildScriptPath, codeqlExePath);\n    const extractionEndTime = Date.now();\n    logPerformanceTrackingStop('JavaScript Extraction');\n\n    // Update dependency graph metrics if provided\n    if (dependencyGraph) {\n      dependencyGraph.statusSummary.performance.extractionDurationMs =\n        extractionEndTime - extractionStartTime;\n      dependencyGraph.statusSummary.performance.totalDurationMs =\n        dependencyGraph.statusSummary.performance.parsingDurationMs +\n        dependencyGraph.statusSummary.performance.compilationDurationMs +\n        dependencyGraph.statusSummary.performance.extractionDurationMs;\n    }\n\n    // Handle extraction failure\n    if (!extractorResult.success && extractorResult.error) {\n      cdsExtractorLog('error', `Error running JavaScript extractor: ${extractorResult.error}`);\n\n      if (codeqlExePath) {\n        let representativeFile = sourceRoot;\n        if (dependencyGraph && dependencyGraph.projects.size > 0) {\n          const firstProject = Array.from(dependencyGraph.projects.values())[0];\n          representativeFile = firstProject.cdsFiles[0] ?? sourceRoot;\n        }\n        addJavaScriptExtractorDiagnostic(\n          representativeFile,\n          extractorResult.error,\n          codeqlExePath,\n          sourceRoot,\n        );\n      }\n      return false;\n    }\n\n    return true;\n  } finally {\n    // Always clean up marker file\n    removeMarkerFile(markerFilePath);\n  }\n}\n\n/**\n * Handles early exit scenarios by running JavaScript extraction and exiting gracefully.\n * This function never returns - it always exits the process with code 0.\n *\n * @param sourceRoot - The root directory of the source code\n * @param autobuildScriptPath - Path to the autobuild script\n * @param codeqlExePath - Path to the CodeQL executable\n * @param skipMessage - Message to log when exiting early\n */\nexport function handleEarlyExit(\n  sourceRoot: string,\n  autobuildScriptPath: string,\n  codeqlExePath: string,\n  skipMessage: string,\n): never {\n  const success = runJavaScriptExtractionWithMarker(sourceRoot, autobuildScriptPath, codeqlExePath);\n  logExtractorStop(success, success ? skipMessage : 'JavaScript extractor failed');\n  console.log(`Completed run of the cds-extractor.js script for the CDS extractor.`);\n  process.exit(0);\n}\n", "import { resolve } from 'path';\n\nconst USAGE_MESSAGE = `\\tUsage: node <script> <source-root>`;\n\n/**\n * Resolves and validates a source root directory path.\n *\n * This function takes a source root path, validates it, normalizes it,\n * and returns an absolute path to the directory.\n *\n * @param sourceRoot - The source root path to resolve\n * @returns The normalized absolute path to the source root directory\n * @throws {Error} If the source root is null, undefined, an empty string,\n *                 or does not point to a valid directory\n */\nfunction resolveSourceRoot(sourceRoot: string): string {\n  // Check for null, undefined, or empty string\n  if (!sourceRoot || typeof sourceRoot !== 'string') {\n    throw new Error('Source root must be a non-empty string');\n  }\n\n  // Normalize the path and resolve it to an absolute path.\n  const normalizedPath = resolve(sourceRoot);\n\n  // Check if the resolved path points to a valid, existing directory.\n  if (!normalizedPath || normalizedPath === '/') {\n    throw new Error('Source root must point to a valid directory');\n  }\n\n  return normalizedPath;\n}\n\n/**\n * Check if the script was invoked with the required arguments.\n * This function validates and sanitizes script arguments and returns them if valid.\n *\n * Requirements:\n * - Only requires: <source-root>\n *\n * @param args Command line arguments to check.\n * @returns Object with validation result, usage message if failed, and validated\n * arguments if successful.\n */\nexport function validateArguments(args: string[]): {\n  isValid: boolean;\n  usageMessage?: string;\n  args?: {\n    sourceRoot: string;\n  };\n} {\n  // Minimum arguments: node, script, source-root (3 total)\n  if (args.length < 3) {\n    return {\n      isValid: false,\n      usageMessage: USAGE_MESSAGE,\n    };\n  }\n\n  // Get the source root from args (now the first parameter after script name)\n  const rawSourceRoot: string = args[2];\n\n  // Validate and sanitize the source root path\n  let sourceRoot: string;\n  try {\n    sourceRoot = resolveSourceRoot(rawSourceRoot);\n  } catch (error) {\n    return {\n      isValid: false,\n      usageMessage: `Invalid source root: ${String(error)}`,\n    };\n  }\n\n  // Return the validated arguments\n  return {\n    isValid: true,\n    usageMessage: `<source-root>`,\n    args: {\n      sourceRoot,\n    },\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAAAA,gBAAqB;;;ASErB,sBAA8B;AED9B,uBAA6B;AAE7B,IAAAC,mBAA8B;AAE9B,gBAMO;AACP,SAA0B;AAM1B,sBAAmD;ACXnD,yBAA6B;AAC7B,yBAAmB;AACnB,iCAA8B;AXTvB,IAAMC,KAAW,CACtBC,IACAC,GACAC,MACE;AACF,MAAMC,IAAKH,cAAa,SAASI,GAAWJ,IAAGE,CAAG,IAAIF,IAChDK,IAAKJ,aAAa,SAASG,GAAWH,GAAGC,CAAG,IAAID,GAEhD,IAAIE,MAAO,QAAQE,KAAM,QAAQC,GAAMH,GAAIE,GAAIH,CAAG;AAExD,SACE,KAAK,EACH,OAAO,EAAE,CAAC,GACV,KAAK,EAAE,CAAC,GACR,KAAKA,EAAI,MAAM,GAAG,EAAE,CAAC,CAAC,GACtB,MAAMA,EAAI,MAAM,EAAE,CAAC,IAAIC,EAAG,QAAQ,EAAE,CAAC,CAAC,GACtC,MAAMD,EAAI,MAAM,EAAE,CAAC,IAAIG,EAAG,MAAM,EAAA;AAGtC;AAnBO,IAqBDD,KAAa,CAACG,IAAaL,MAAe;AAC9C,MAAMM,IAAIN,EAAI,MAAMK,EAAG;AACvB,SAAOC,IAAIA,EAAE,CAAC,IAAI;AACpB;AAxBO,IA0BMF,KAAQ,CACnBN,IACAC,GACAC,MACgC;AAChC,MAAIO,GACFC,GACAC,GACAC,GACAC,GACEC,IAAKZ,EAAI,QAAQF,EAAC,GAClBe,IAAKb,EAAI,QAAQD,GAAGa,IAAK,CAAC,GAC1BE,IAAIF;AAER,MAAIA,KAAM,KAAKC,IAAK,GAAG;AACrB,QAAIf,OAAMC,EACR,QAAO,CAACa,GAAIC,CAAE;AAKhB,SAHAN,IAAO,CAAA,GACPE,IAAOT,EAAI,QAEJc,KAAK,KAAK,CAACH,KAAQ;AACxB,UAAIG,MAAMF,EACRL,GAAK,KAAKO,CAAC,GACXF,IAAKZ,EAAI,QAAQF,IAAGgB,IAAI,CAAC;eAChBP,EAAK,WAAW,GAAG;AAC5B,YAAMQ,IAAIR,EAAK,IAAG;AACdQ,cAAM,WAAWJ,IAAS,CAACI,GAAGF,CAAE;MACtC,MACEL,KAAMD,EAAK,IAAG,GACVC,MAAQ,UAAaA,IAAMC,MAC7BA,IAAOD,GACPE,IAAQG,IAGVA,IAAKb,EAAI,QAAQD,GAAGe,IAAI,CAAC;AAG3BA,UAAIF,IAAKC,KAAMD,KAAM,IAAIA,IAAKC;IAChC;AAEIN,MAAK,UAAUG,MAAU,WAC3BC,IAAS,CAACF,GAAMC,CAAK;EAEzB;AAEA,SAAOC;AACT;ACvEA,IAAMK,KAAW,YAAY,KAAK,OAAM,IAAK;AAA7C,IACMC,KAAU,WAAW,KAAK,OAAM,IAAK;AAD3C,IAEMC,KAAW,YAAY,KAAK,OAAM,IAAK;AAF7C,IAGMC,KAAW,YAAY,KAAK,OAAM,IAAK;AAH7C,IAIMC,KAAY,aAAa,KAAK,OAAM,IAAK;AAJ/C,IAKMC,KAAkB,IAAI,OAAOL,IAAU,GAAG;AALhD,IAMMM,KAAiB,IAAI,OAAOL,IAAS,GAAG;AAN9C,IAOMM,KAAkB,IAAI,OAAOL,IAAU,GAAG;AAPhD,IAQMM,KAAkB,IAAI,OAAOL,IAAU,GAAG;AARhD,IASMM,KAAmB,IAAI,OAAOL,IAAW,GAAG;AATlD,IAUMM,KAAe;AAVrB,IAWMC,KAAc;AAXpB,IAYMC,KAAe;AAZrB,IAaMC,KAAe;AAbrB,IAcMC,KAAgB;AAdtB,IAgBaC,KAAgB;AAE7B,SAASC,GAAQhC,IAAW;AAC1B,SAAQ,MAAMA,EAAU,IAAwBA,GAAI,WAAW,CAAC,IAApC,SAASA,IAAK,EAAE;AAC9C;AAEA,SAASiC,GAAajC,IAAW;AAC/B,SAAOA,GACJ,QAAQ0B,IAAcV,EAAQ,EAC9B,QAAQW,IAAaV,EAAO,EAC5B,QAAQW,IAAcV,EAAQ,EAC9B,QAAQW,IAAcV,EAAQ,EAC9B,QAAQW,IAAeV,EAAS;AACrC;AAEA,SAASc,GAAelC,IAAW;AACjC,SAAOA,GACJ,QAAQqB,IAAiB,IAAI,EAC7B,QAAQC,IAAgB,GAAG,EAC3B,QAAQC,IAAiB,GAAG,EAC5B,QAAQC,IAAiB,GAAG,EAC5B,QAAQC,IAAkB,GAAG;AAClC;AAOA,SAASU,GAAgBnC,IAAW;AAClC,MAAI,CAACA,GACH,QAAO,CAAC,EAAE;AAGZ,MAAMoC,IAAkB,CAAA,GAClB9B,IAAIT,GAAS,KAAK,KAAKG,EAAG;AAEhC,MAAI,CAACM,EACH,QAAON,GAAI,MAAM,GAAG;AAGtB,MAAM,EAAE,KAAAqC,GAAK,MAAAC,GAAM,MAAAC,EAAI,IAAKjC,GACtBkC,IAAIH,EAAI,MAAM,GAAG;AAEvBG,IAAEA,EAAE,SAAS,CAAC,KAAK,MAAMF,IAAO;AAChC,MAAMG,IAAYN,GAAgBI,CAAI;AACtC,SAAIA,EAAK,WACLC,EAAEA,EAAE,SAAS,CAAC,KAAgBC,EAAU,MAAK,GAC/CD,EAAE,KAAK,MAAMA,GAAGC,CAAS,IAG3BL,EAAM,KAAK,MAAMA,GAAOI,CAAC,GAElBJ;AACT;AAMM,SAAUM,GAAO1C,IAAa2C,IAAiC,CAAA,GAAE;AACrE,MAAI,CAAC3C,GACH,QAAO,CAAA;AAGT,MAAM,EAAE,KAAA4C,IAAMb,GAAa,IAAKY;AAQhC,SAAI3C,GAAI,MAAM,GAAG,CAAC,MAAM,SACtBA,KAAM,WAAWA,GAAI,MAAM,CAAC,IAGvB6C,GAAQZ,GAAajC,EAAG,GAAG4C,GAAK,IAAI,EAAE,IAAIV,EAAc;AACjE;AAEA,SAASY,GAAQ9C,IAAW;AAC1B,SAAO,MAAMA,KAAM;AACrB;AAEA,SAAS+C,GAASC,IAAU;AAC1B,SAAO,SAAS,KAAKA,EAAE;AACzB;AAEA,SAASC,GAAInC,IAAWoC,GAAS;AAC/B,SAAOpC,MAAKoC;AACd;AAEA,SAASC,GAAIrC,IAAWoC,GAAS;AAC/B,SAAOpC,MAAKoC;AACd;AAEA,SAASL,GAAQ7C,IAAa4C,GAAaQ,GAAc;AAEvD,MAAMC,IAAuB,CAAA,GAEvB/C,IAAIT,GAAS,KAAK,KAAKG,EAAG;AAChC,MAAI,CAACM,EAAG,QAAO,CAACN,EAAG;AAGnB,MAAMqC,IAAM/B,EAAE,KACRiC,IAAiBjC,EAAE,KAAK,SAASuC,GAAQvC,EAAE,MAAMsC,GAAK,KAAK,IAAI,CAAC,EAAE;AAExE,MAAI,MAAM,KAAKtC,EAAE,GAAG,EAClB,UAASgD,IAAI,GAAGA,IAAIf,EAAK,UAAUe,IAAIV,GAAKU,KAAK;AAC/C,QAAMC,IAAYlB,IAAM,MAAM/B,EAAE,OAAO,MAAMiC,EAAKe,CAAC;AACnDD,MAAW,KAAKE,CAAS;EAC3B;OACK;AACL,QAAMC,IAAoB,iCAAiC,KAAKlD,EAAE,IAAI,GAChEmD,IAAkB,uCAAuC,KAC7DnD,EAAE,IAAI,GAEFoD,IAAaF,KAAqBC,GAClCE,IAAYrD,EAAE,KAAK,QAAQ,GAAG,KAAK;AACzC,QAAI,CAACoD,KAAc,CAACC,EAElB,QAAIrD,EAAE,KAAK,MAAM,YAAY,KAC3BN,KAAMM,EAAE,MAAM,MAAMA,EAAE,OAAOY,KAAWZ,EAAE,MACnCuC,GAAQ7C,IAAK4C,GAAK,IAAI,KAExB,CAAC5C,EAAG;AAGb,QAAI4D;AACJ,QAAIF,EACFE,KAAItD,EAAE,KAAK,MAAM,MAAM;aAEvBsD,IAAIzB,GAAgB7B,EAAE,IAAI,GACtBsD,EAAE,WAAW,KAAKA,EAAE,CAAC,MAAM,WAE7BA,IAAIf,GAAQe,EAAE,CAAC,GAAGhB,GAAK,KAAK,EAAE,IAAIE,EAAO,GAGrCc,EAAE,WAAW,GACf,QAAOrB,EAAK,IAAIC,OAAKlC,EAAE,MAAMsD,EAAE,CAAC,IAAIpB,CAAC;AAQ3C,QAAIqB;AAEJ,QAAIH,KAAcE,EAAE,CAAC,MAAM,UAAaA,EAAE,CAAC,MAAM,QAAW;AAC1D,UAAME,IAAI9B,GAAQ4B,EAAE,CAAC,CAAC,GAChBV,IAAIlB,GAAQ4B,EAAE,CAAC,CAAC,GAChBG,IAAQ,KAAK,IAAIH,EAAE,CAAC,EAAE,QAAQA,EAAE,CAAC,EAAE,MAAM,GAC3CI,IACFJ,EAAE,WAAW,KAAKA,EAAE,CAAC,MAAM,SAAY,KAAK,IAAI5B,GAAQ4B,EAAE,CAAC,CAAC,CAAC,IAAI,GAC/DK,IAAOhB;AACKC,UAAIY,MAElBE,KAAQ,IACRC,IAAOd;AAET,UAAMe,IAAMN,EAAE,KAAKb,EAAQ;AAE3Bc,UAAI,CAAA;AAEJ,eAAS/C,IAAIgD,GAAGG,EAAKnD,GAAGoC,CAAC,GAAGpC,KAAKkD,GAAM;AACrC,YAAIG;AACJ,YAAIV,EACFU,KAAI,OAAO,aAAarD,CAAC,GACrBqD,MAAM,SACRA,IAAI;iBAGNA,IAAI,OAAOrD,CAAC,GACRoD,GAAK;AACP,cAAME,IAAOL,IAAQI,EAAE;AACvB,cAAIC,IAAO,GAAG;AACZ,gBAAMC,IAAI,IAAI,MAAMD,IAAO,CAAC,EAAE,KAAK,GAAG;AAClCtD,gBAAI,IACNqD,IAAI,MAAME,IAAIF,EAAE,MAAM,CAAC,IAEvBA,IAAIE,IAAIF;UAEZ;QACF;AAEFN,UAAE,KAAKM,CAAC;MACV;IACF,OAAO;AACLN,UAAI,CAAA;AAEJ,eAASS,IAAI,GAAGA,IAAIV,EAAE,QAAQU,IAC5BT,GAAE,KAAK,MAAMA,GAAGhB,GAAQe,EAAEU,CAAC,GAAa1B,GAAK,KAAK,CAAC;IAEvD;AAEA,aAAS0B,IAAI,GAAGA,IAAIT,EAAE,QAAQS,IAC5B,UAAShB,IAAI,GAAGA,IAAIf,EAAK,UAAUc,EAAW,SAAST,GAAKU,KAAK;AAC/D,UAAMC,IAAYlB,IAAMwB,EAAES,CAAC,IAAI/B,EAAKe,CAAC;AAAA,OACjC,CAACF,KAASM,KAAcH,MAC1BF,EAAW,KAAKE,CAAS;IAE7B;EAEJ;AAEA,SAAOF;AACT;AChOO,IAAMkB,KACXC,CAAAA,OAC6B;AAC7B,MAAI,OAAOA,MAAY,SACrB,OAAM,IAAI,UAAU,iBAAiB;AAGvC,MAAIA,GAAQ,SAAS,MACnB,OAAM,IAAI,UAAU,qBAAqB;AAE7C;ACPA,IAAMC,KACJ,EACE,aAAa,CAAC,wBAAwB,IAAI,GAC1C,aAAa,CAAC,iBAAiB,IAAI,GACnC,aAAa,CAAC,eAAyB,KAAK,GAC5C,aAAa,CAAC,cAAc,IAAI,GAChC,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,gBAAgB,MAAM,IAAI,GACxC,aAAa,CAAC,WAAW,IAAI,GAC7B,aAAa,CAAC,UAAU,IAAI,GAC5B,aAAa,CAAC,UAAU,IAAI,GAC5B,aAAa,CAAC,yBAAyB,IAAI,GAC3C,aAAa,CAAC,WAAW,IAAI,GAC7B,YAAY,CAAC,+BAA+B,IAAI,GAChD,cAAc,CAAC,aAAa,KAAK,EAAA;AAfrC,IAoBMC,KAAeC,CAAAA,OAAcA,GAAE,QAAQ,aAAa,MAAM;AApBhE,IAsBMC,KAAgBD,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAvB9C,IA0BME,KAAkBC,CAAAA,OAA6BA,GAAO,KAAK,EAAE;AA1BnE,IAyCaC,KAAa,CACxBC,IACAC,MACoB;AACpB,MAAMC,IAAMD;AAEZ,MAAID,GAAK,OAAOE,CAAG,MAAM,IACvB,OAAM,IAAI,MAAM,2BAA2B;AAG7C,MAAMJ,IAAmB,CAAA,GACnBK,IAAiB,CAAA,GAEnBrE,IAAIoE,IAAM,GACVE,IAAW,OACXC,IAAQ,OACRC,IAAW,OACXC,IAAS,OACTC,IAASN,GACTO,IAAa;AACjBC,IAAO,QAAO5E,IAAIkE,GAAK,UAAQ;AAC7B,QAAMb,IAAIa,GAAK,OAAOlE,CAAC;AACvB,SAAKqD,MAAM,OAAOA,MAAM,QAAQrD,MAAMoE,IAAM,GAAG;AAC7CK,UAAS,MACTzE;AACA;IACF;AAEA,QAAIqD,MAAM,OAAOiB,KAAY,CAACE,GAAU;AACtCE,UAAS1E,IAAI;AACb;IACF;AAGA,QADAsE,IAAW,MACPjB,MAAM,QACJ,CAACmB,GAAU;AACbA,UAAW,MACXxE;AACA;IACF;AAGF,QAAIqD,MAAM,OAAO,CAACmB,GAAAA;AAEhB,eAAW,CAACK,GAAK,CAACC,GAAMC,GAAGC,CAAG,CAAC,KAAK,OAAO,QAAQrB,EAAY,EAC7D,KAAIO,GAAK,WAAWW,GAAK7E,CAAC,GAAG;AAE3B,YAAI2E,EACF,QAAO,CAAC,MAAM,OAAOT,GAAK,SAASE,GAAK,IAAI;AAE9CpE,aAAK6E,EAAI,QACLG,IAAKX,EAAK,KAAKS,CAAI,IAClBd,EAAO,KAAKc,CAAI,GACrBP,IAAQA,KAASQ;AACjB,iBAASH;MACX;IAAA;AAMJ,QADAJ,IAAW,OACPG,GAAY;AAGVtB,UAAIsB,IACNX,EAAO,KAAKJ,GAAYe,CAAU,IAAI,MAAMf,GAAYP,CAAC,CAAC,IACjDA,MAAMsB,KACfX,EAAO,KAAKJ,GAAYP,CAAC,CAAC,GAE5BsB,IAAa,IACb3E;AACA;IACF;AAIA,QAAIkE,GAAK,WAAW,MAAMlE,IAAI,CAAC,GAAG;AAChCgE,QAAO,KAAKJ,GAAYP,IAAI,GAAG,CAAC,GAChCrD,KAAK;AACL;IACF;AACA,QAAIkE,GAAK,WAAW,KAAKlE,IAAI,CAAC,GAAG;AAC/B2E,UAAatB,GACbrD,KAAK;AACL;IACF;AAGAgE,MAAO,KAAKJ,GAAYP,CAAC,CAAC,GAC1BrD;EACF;AAEA,MAAI0E,IAAS1E,EAGX,QAAO,CAAC,IAAI,OAAO,GAAG,KAAK;AAK7B,MAAI,CAACgE,EAAO,UAAU,CAACK,EAAK,OAC1B,QAAO,CAAC,MAAM,OAAOH,GAAK,SAASE,GAAK,IAAI;AAO9C,MACEC,EAAK,WAAW,KAChBL,EAAO,WAAW,KAClB,SAAS,KAAKA,EAAO,CAAC,CAAC,KACvB,CAACS,GACD;AACA,QAAMxE,IAAI+D,EAAO,CAAC,EAAE,WAAW,IAAIA,EAAO,CAAC,EAAE,MAAM,EAAE,IAAIA,EAAO,CAAC;AACjE,WAAO,CAACF,GAAa7D,CAAC,GAAG,OAAOyE,IAASN,GAAK,KAAK;EACrD;AAEA,MAAMa,IAAU,OAAOR,IAAS,MAAM,MAAMV,GAAeC,CAAM,IAAI,KAC/DkB,IAAQ,OAAOT,IAAS,KAAK,OAAOV,GAAeM,CAAI,IAAI;AAMjE,SAAO,CAJLL,EAAO,UAAUK,EAAK,SAAS,MAAMY,IAAU,MAAMC,IAAQ,MAC3DlB,EAAO,SAASiB,IAChBC,GAEUX,GAAOG,IAASN,GAAK,IAAI;AACzC;ACrJO,IAAMe,IAAW,CACtBtB,IACA,EACE,sBAAAuB,IAAuB,OACvB,eAAAC,IAAgB,KAAI,IACgD,CAAA,MAElEA,IACKD,IACHvB,GAAE,QAAQ,kBAAkB,IAAI,IAChCA,GACG,QAAQ,6BAA6B,MAAM,EAC3C,QAAQ,cAAc,IAAI,IAE5BuB,IACHvB,GAAE,QAAQ,oBAAoB,IAAI,IAClCA,GACG,QAAQ,+BAA+B,MAAM,EAC7C,QAAQ,gBAAgB,IAAI;ACIrC,IAAMyB,KAAQ,oBAAI,IAAiB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AAA5D,IACMC,KAAiBlC,CAAAA,OACrBiC,GAAM,IAAIjC,EAAgB;AAF5B,IAQMmC,KAAmB;AARzB,IASMC,KAAa;AATnB,IAcMC,KAAkB,oBAAI,IAAI,CAAC,KAAK,GAAG,CAAC;AAd1C,IAgBMC,KAAW,oBAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AAhBpC,IAiBMC,KAAa,IAAI,IAAI,iBAAiB;AAjB5C,IAkBMC,KAAgBhC,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAnB9C,IAsBMiC,KAAQ;AAtBd,IAyBMC,KAAOD,KAAQ;AAzBrB,IA4BME,KAAcF,KAAQ;AA5B5B,IAiCaG,IAAP,MAAOC,EAAG;EACd;EACSC;EAETC;EACAC,KAAkB;EAClBC,KAA2B,CAAA;EAClBC;EACAC;EACTC;EACAC,KAAuB;EACvBC;EACAC;EAGAC,KAAqB;EAErB,YACEC,GACAC,GACAlF,IAA4B,CAAA,GAAE;AAE9B,SAAK,OAAOiF,GAERA,MAAM,KAAKV,KAAY,OAC3B,KAAKG,KAAUQ,GACf,KAAKZ,KAAQ,KAAKI,KAAU,KAAKA,GAAQJ,KAAQ,MACjD,KAAKQ,KAAW,KAAKR,OAAU,OAAOtE,IAAU,KAAKsE,GAAMQ,IAC3D,KAAKF,KAAQ,KAAKN,OAAU,OAAO,CAAA,IAAK,KAAKA,GAAMM,IAC/CK,MAAS,OAAO,CAAC,KAAKX,GAAMO,MAAa,KAAKD,GAAM,KAAK,IAAI,GACjE,KAAKD,KAAe,KAAKD,KAAU,KAAKA,GAAQD,GAAO,SAAS;EAClE;EAEA,IAAI,WAAQ;AAEV,QAAI,KAAKF,OAAc,OAAW,QAAO,KAAKA;AAE9C,aAAW1E,KAAK,KAAK4E,GACnB,KAAI,OAAO5E,KAAM,aACbA,EAAE,QAAQA,EAAE,UAAU,QAAQ,KAAK0E,KAAY;AAGrD,WAAO,KAAKA;EACd;EAGA,WAAQ;AACN,WAAI,KAAKQ,OAAc,SAAkB,KAAKA,KACzC,KAAK,OAGA,KAAKA,KACX,KAAK,OAAO,MAAM,KAAKN,GAAO,IAAI5E,OAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,MAHxD,KAAKkF,KAAY,KAAKN,GAAO,IAAI5E,OAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,EAAE;EAKpE;EAEAsF,KAAS;AAEP,QAAI,SAAS,KAAKb,GAAO,OAAM,IAAI,MAAM,0BAA0B;AACnE,QAAI,KAAKO,GAAa,QAAO;AAI7B,SAAK,SAAQ,GACb,KAAKA,KAAc;AACnB,QAAI5D;AACJ,WAAQA,IAAI,KAAK2D,GAAM,IAAG,KAAK;AAC7B,UAAI3D,EAAE,SAAS,IAAK;AAEpB,UAAIpB,IAAqBoB,GACrBmE,IAAKvF,EAAE6E;AACX,aAAOU,KAAI;AACT,iBACM,IAAIvF,EAAE8E,KAAe,GACzB,CAACS,EAAG,QAAQ,IAAIA,EAAGX,GAAO,QAC1B,IAEA,UAAWY,KAAQpE,EAAEwD,IAAQ;AAE3B,cAAI,OAAOY,KAAS,SAClB,OAAM,IAAI,MAAM,8BAA8B;AAGhDA,YAAK,OAAOD,EAAGX,GAAO,CAAC,CAAC;QAC1B;AAEF5E,YAAIuF,GACJA,IAAKvF,EAAE6E;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAQjF,GAAuB;AAC7B,aAAWI,KAAKJ,EACd,KAAII,MAAM,IAEV;AAAA,UACE,OAAOA,KAAM,YACb,EAAEA,aAAawE,KAAOxE,EAAE6E,OAAY,MAEpC,OAAM,IAAI,MAAM,mBAAmB7E,CAAC;AAGtC,WAAK4E,GAAO,KAAK5E,CAAC;IAAA;EAEtB;EAEA,SAAM;AACJ,QAAMyF,IACJ,KAAK,SAAS,OACZ,KAAKb,GACF,MAAK,EACL,IAAI5E,OAAM,OAAOA,KAAM,WAAWA,IAAIA,EAAE,OAAM,CAAG,IACpD,CAAC,KAAK,MAAM,GAAG,KAAK4E,GAAO,IAAI5E,OAAMA,EAAU,OAAM,CAAE,CAAC;AAC5D,WAAI,KAAK,QAAO,KAAM,CAAC,KAAK,QAAMyF,EAAI,QAAQ,CAAA,CAAE,GAE9C,KAAK,MAAK,MACT,SAAS,KAAKhB,MACZ,KAAKA,GAAMO,MAAe,KAAKH,IAAS,SAAS,QAEpDY,EAAI,KAAK,CAAA,CAAE,GAENA;EACT;EAEA,UAAO;AACL,QAAI,KAAKhB,OAAU,KAAM,QAAO;AAEhC,QAAI,CAAC,KAAKI,IAAS,QAAO,EAAI,QAAO;AACrC,QAAI,KAAKC,OAAiB,EAAG,QAAO;AAEpC,QAAM9E,IAAI,KAAK6E;AACf,aAASvG,IAAI,GAAGA,IAAI,KAAKwG,IAAcxG,KAAK;AAC1C,UAAMiH,IAAKvF,EAAE4E,GAAOtG,CAAC;AACrB,UAAI,EAAEiH,aAAcf,KAAOe,EAAG,SAAS,KACrC,QAAO;IAEX;AACA,WAAO;EACT;EAEA,QAAK;AAEH,QADI,KAAKd,OAAU,QACf,KAAKI,IAAS,SAAS,IAAK,QAAO;AACvC,QAAI,CAAC,KAAKA,IAAS,MAAK,EAAI,QAAO;AACnC,QAAI,CAAC,KAAK,KAAM,QAAO,KAAKA,IAAS,MAAK;AAG1C,QAAMa,IAAK,KAAKb,KAAU,KAAKA,GAAQD,GAAO,SAAS;AAEvD,WAAO,KAAKE,OAAiBY,IAAK;EACpC;EAEA,OAAOF,GAAkB;AACnB,WAAOA,KAAS,WAAU,KAAK,KAAKA,CAAI,IACvC,KAAK,KAAKA,EAAK,MAAM,IAAI,CAAC;EACjC;EAEA,MAAMH,GAAW;AACf,QAAM1D,IAAI,IAAI6C,EAAI,KAAK,MAAMa,CAAM;AACnC,aAAWrF,KAAK,KAAK4E,GACnBjD,GAAE,OAAO3B,CAAC;AAEZ,WAAO2B;EACT;EAEA,OAAOgE,GACLnI,GACAoI,GACAlD,GACAmD,GAAqB;AAErB,QAAI/C,IAAW,OACXgD,IAAU,OACVC,IAAa,IACbC,IAAW;AACf,QAAIJ,EAAI,SAAS,MAAM;AAErB,UAAItH,IAAIoE,GACJuD,IAAM;AACV,aAAO3H,IAAId,EAAI,UAAQ;AACrB,YAAMmE,IAAInE,EAAI,OAAOc,GAAG;AAGxB,YAAIwE,KAAYnB,MAAM,MAAM;AAC1BmB,cAAW,CAACA,GACZmD,KAAOtE;AACP;QACF;AAEA,YAAImE,GAAS;AACPxH,gBAAMyH,IAAa,KACjBpE,MAAM,OAAOA,MAAM,SACrBqE,IAAW,QAEJrE,MAAM,OAAO,EAAErD,MAAMyH,IAAa,KAAKC,OAChDF,IAAU,QAEZG,KAAOtE;AACP;QACF,WAAWA,MAAM,KAAK;AACpBmE,cAAU,MACVC,IAAazH,GACb0H,IAAW,OACXC,KAAOtE;AACP;QACF;AAEA,YAAI,CAACkE,EAAI,SAAShC,GAAclC,CAAC,KAAKnE,EAAI,OAAOc,CAAC,MAAM,KAAK;AAC3DsH,YAAI,KAAKK,CAAG,GACZA,IAAM;AACN,cAAMC,IAAM,IAAI1B,EAAI7C,GAAGiE,CAAG;AAC1BtH,cAAIkG,EAAImB,GAAUnI,GAAK0I,GAAK5H,GAAGuH,CAAG,GAClCD,EAAI,KAAKM,CAAG;AACZ;QACF;AACAD,aAAOtE;MACT;AACA,aAAAiE,EAAI,KAAKK,CAAG,GACL3H;IACT;AAIA,QAAIA,IAAIoE,IAAM,GACV8C,IAAO,IAAIhB,EAAI,MAAMoB,CAAG,GACtBhG,IAAe,CAAA,GACjBqG,IAAM;AACV,WAAO3H,IAAId,EAAI,UAAQ;AACrB,UAAMmE,IAAInE,EAAI,OAAOc,GAAG;AAGxB,UAAIwE,KAAYnB,MAAM,MAAM;AAC1BmB,YAAW,CAACA,GACZmD,KAAOtE;AACP;MACF;AAEA,UAAImE,GAAS;AACPxH,cAAMyH,IAAa,KACjBpE,MAAM,OAAOA,MAAM,SACrBqE,IAAW,QAEJrE,MAAM,OAAO,EAAErD,MAAMyH,IAAa,KAAKC,OAChDF,IAAU,QAEZG,KAAOtE;AACP;MACF,WAAWA,MAAM,KAAK;AACpBmE,YAAU,MACVC,IAAazH,GACb0H,IAAW,OACXC,KAAOtE;AACP;MACF;AAEA,UAAIkC,GAAclC,CAAC,KAAKnE,EAAI,OAAOc,CAAC,MAAM,KAAK;AAC7CkH,UAAK,KAAKS,CAAG,GACbA,IAAM;AACN,YAAMC,IAAM,IAAI1B,EAAI7C,GAAG6D,CAAI;AAC3BA,UAAK,KAAKU,CAAG,GACb5H,IAAIkG,EAAImB,GAAUnI,GAAK0I,GAAK5H,GAAGuH,CAAG;AAClC;MACF;AACA,UAAIlE,MAAM,KAAK;AACb6D,UAAK,KAAKS,CAAG,GACbA,IAAM,IACNrG,EAAM,KAAK4F,CAAI,GACfA,IAAO,IAAIhB,EAAI,MAAMoB,CAAG;AACxB;MACF;AACA,UAAIjE,MAAM,IACR,QAAIsE,MAAQ,MAAML,EAAIhB,GAAO,WAAW,MACtCgB,EAAIT,KAAY,OAElBK,EAAK,KAAKS,CAAG,GACbA,IAAM,IACNL,EAAI,KAAK,GAAGhG,GAAO4F,CAAI,GAChBlH;AAET2H,WAAOtE;IACT;AAKA,WAAAiE,EAAI,OAAO,MACXA,EAAIlB,KAAY,QAChBkB,EAAIhB,KAAS,CAACpH,EAAI,UAAUkF,IAAM,CAAC,CAAC,GAC7BpE;EACT;EAEA,OAAO,SAAS0D,GAAiB7B,IAA4B,CAAA,GAAE;AAC7D,QAAMyF,IAAM,IAAIpB,EAAI,MAAM,QAAWrE,CAAO;AAC5C,WAAAqE,EAAImB,GAAU3D,GAAS4D,GAAK,GAAGzF,CAAO,GAC/ByF;EACT;EAIA,cAAW;AAGT,QAAI,SAAS,KAAKnB,GAAO,QAAO,KAAKA,GAAM,YAAW;AAEtD,QAAMjC,IAAO,KAAK,SAAQ,GACpB,CAAC2D,GAAIrG,GAAMsG,GAAUvD,CAAK,IAAI,KAAK,eAAc;AAUvD,QAAI,EALFuD,KACA,KAAK1B,MACJ,KAAKO,GAAS,UACb,CAAC,KAAKA,GAAS,mBACfzC,EAAK,YAAW,MAAOA,EAAK,YAAW,GAEzC,QAAO1C;AAGT,QAAMuG,KAAS,KAAKpB,GAAS,SAAS,MAAM,OAAOpC,IAAQ,MAAM;AACjE,WAAO,OAAO,OAAO,IAAI,OAAO,IAAIsD,CAAE,KAAKE,CAAK,GAAG,EACjD,MAAMF,GACN,OAAO3D,EAAAA,CACR;EACH;EAEA,IAAI,UAAO;AACT,WAAO,KAAKyC;EACd;EAuEA,eACEqB,GAAkB;AAElB,QAAMC,IAAMD,KAAY,CAAC,CAAC,KAAKrB,GAAS;AAExC,QADI,KAAKR,OAAU,QAAM,KAAKa,GAAS,GACnC,CAAC,KAAK,MAAM;AACd,UAAMkB,IACJ,KAAK,QAAO,KACZ,KAAK,MAAK,KACV,CAAC,KAAK5B,GAAO,KAAKzC,OAAK,OAAOA,KAAM,QAAQ,GACxCsE,IAAM,KAAK7B,GACd,IAAI5E,OAAI;AACP,YAAM,CAACmG,GAAIO,GAAGN,GAAUvD,CAAK,IAC3B,OAAO7C,KAAM,WACXwE,EAAImC,GAAW3G,GAAG,KAAK0E,IAAW8B,CAAO,IACzCxG,EAAE,eAAesG,CAAQ;AAC7B,eAAA,KAAK5B,KAAY,KAAKA,MAAa0B,GACnC,KAAKzB,KAAS,KAAKA,MAAU9B,GACtBsD;MACT,CAAC,EACA,KAAK,EAAE,GAENS,IAAQ;AACZ,UAAI,KAAK,QAAO,KACV,OAAO,KAAKhC,GAAO,CAAC,KAAM,YAQxB,EADF,KAAKA,GAAO,WAAW,KAAKX,GAAS,IAAI,KAAKW,GAAO,CAAC,CAAC,IACpC;AACnB,YAAMiC,IAAM7C,IAGN8C,IAEHP,KAAOM,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,KAE5BA,EAAI,WAAW,KAAK,KAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,KAE9CA,EAAI,WAAW,QAAQ,KAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAG9CM,IAAY,CAACR,KAAO,CAACD,KAAYO,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC;AAE5DG,YACEE,IAAahD,KACXiD,IAAYhD,KACZ;MACN;AAKJ,UAAIiD,IAAM;AACV,aACE,KAAK,MAAK,KACV,KAAKvC,GAAMO,MACX,KAAKH,IAAS,SAAS,QAEvBmC,IAAM,cAGD,CADOJ,IAAQH,IAAMO,GAG1BvD,EAASgD,CAAG,GACX,KAAK/B,KAAY,CAAC,CAAC,KAAKA,IACzB,KAAKC,EAAAA;IAET;AAMA,QAAMsC,IAAW,KAAK,SAAS,OAAO,KAAK,SAAS,KAE9CL,IAAQ,KAAK,SAAS,MAAM,cAAc,OAC5C9G,IAAO,KAAKoH,GAAeX,CAAG;AAElC,QAAI,KAAK,QAAO,KAAM,KAAK,MAAK,KAAM,CAACzG,KAAQ,KAAK,SAAS,KAAK;AAGhE,UAAMqC,IAAI,KAAK,SAAQ;AACvB,aAAA,KAAKyC,KAAS,CAACzC,CAAC,GAChB,KAAK,OAAO,MACZ,KAAKuC,KAAY,QACV,CAACvC,GAAGsB,EAAS,KAAK,SAAQ,CAAE,GAAG,OAAO,KAAK;IACpD;AAGA,QAAI0D,IACF,CAACF,KAAYX,KAAYC,KAAO,CAACxC,KAC/B,KACA,KAAKmD,GAAe,IAAI;AACxBC,UAAmBrH,MACrBqH,IAAiB,KAEfA,MACFrH,IAAO,MAAMA,CAAI,OAAOqH,CAAc;AAIxC,QAAIC,IAAQ;AACZ,QAAI,KAAK,SAAS,OAAO,KAAKjC,GAC5BiC,MAAS,KAAK,QAAO,KAAM,CAACb,IAAMxC,KAAa,MAAMO;SAChD;AACL,UAAM+C,IACJ,KAAK,SAAS,MAEZ,QACC,KAAK,QAAO,KAAM,CAACd,KAAO,CAACD,IAAWvC,KAAa,MACpDM,KACA,MACA,KAAK,SAAS,MAAM,MACpB,KAAK,SAAS,MAAM,OACpB,KAAK,SAAS,OAAO8C,IAAiB,MACtC,KAAK,SAAS,OAAOA,IAAiB,OACtC,IAAI,KAAK,IAAI;AACjBC,UAAQR,IAAQ9G,IAAOuH;IACzB;AACA,WAAO,CACLD,GACA3D,EAAS3D,CAAI,GACZ,KAAK4E,KAAY,CAAC,CAAC,KAAKA,IACzB,KAAKC,EAAAA;EAET;EAEAuC,GAAeX,GAAY;AACzB,WAAO,KAAK3B,GACT,IAAI5E,OAAI;AAGP,UAAI,OAAOA,KAAM,SACf,OAAM,IAAI,MAAM,8BAA8B;AAIhD,UAAM,CAACmG,GAAIO,GAAGY,GAAWzE,CAAK,IAAI7C,EAAE,eAAeuG,CAAG;AACtD,aAAA,KAAK5B,KAAS,KAAKA,MAAU9B,GACtBsD;IACT,CAAC,EACA,OAAOnG,OAAK,EAAE,KAAK,QAAO,KAAM,KAAK,MAAK,MAAO,CAAC,CAACA,CAAC,EACpD,KAAK,GAAG;EACb;EAEA,OAAO2G,GACLnE,GACA4D,GACAI,IAAmB,OAAK;AAExB,QAAI1D,IAAW,OACXqD,IAAK,IACLtD,IAAQ,OAER0E,IAAS;AACb,aAASjJ,IAAI,GAAGA,IAAIkE,EAAK,QAAQlE,KAAK;AACpC,UAAMqD,IAAIa,EAAK,OAAOlE,CAAC;AACvB,UAAIwE,GAAU;AACZA,YAAW,OACXqD,MAAOjC,GAAW,IAAIvC,CAAC,IAAI,OAAO,MAAMA;AACxC;MACF;AACA,UAAIA,MAAM,KAAK;AACb,YAAI4F,EAAQ;AACZA,YAAS,MACTpB,KAAMK,KAAW,SAAS,KAAKhE,CAAI,IAAI8B,KAAcD,IACrD+B,IAAW;AACX;MACF,MACEmB,KAAS;AAEX,UAAI5F,MAAM,MAAM;AACVrD,cAAMkE,EAAK,SAAS,IACtB2D,KAAM,SAENrD,IAAW;AAEb;MACF;AACA,UAAInB,MAAM,KAAK;AACb,YAAM,CAAC8E,GAAKe,GAAWC,GAAUC,CAAK,IAAInF,GAAWC,GAAMlE,CAAC;AAC5D,YAAImJ,GAAU;AACZtB,eAAMM,GACN5D,IAAQA,KAAS2E,GACjBlJ,KAAKmJ,IAAW,GAChBrB,IAAWA,KAAYsB;AACvB;QACF;MACF;AACA,UAAI/F,MAAM,KAAK;AACbwE,aAAM/B,IACNgC,IAAW;AACX;MACF;AACAD,WAAMhC,GAAaxC,CAAC;IACtB;AACA,WAAO,CAACwE,GAAI1C,EAASjB,CAAI,GAAG,CAAC,CAAC4D,GAAUvD,CAAK;EAC/C;AAAA;ACzpBK,IAAM8E,KAAS,CACpBxF,IACA,EACE,sBAAAuB,IAAuB,OACvB,eAAAC,IAAgB,MAAK,IAC+C,CAAA,MAKlEA,IACKD,IACHvB,GAAE,QAAQ,gBAAgB,MAAM,IAChCA,GAAE,QAAQ,kBAAkB,MAAM,IAEjCuB,IACHvB,GAAE,QAAQ,cAAc,MAAM,IAC9BA,GAAE,QAAQ,gBAAgB,MAAM;AC6D/B,IAAMyF,IAAY,CACvB5H,IACAgC,GACA7B,IAA4B,CAAA,OAE5B4B,GAAmBC,CAAO,GAGtB,CAAC7B,EAAQ,aAAa6B,EAAQ,OAAO,CAAC,MAAM,MACvC,QAGF,IAAI6F,EAAU7F,GAAS7B,CAAO,EAAE,MAAMH,EAAC;AAZzC,IAgBD8H,KAAe;AAhBd,IAiBDC,KAAkB7B,CAAAA,OAAiB8B,OACvC,CAACA,EAAE,WAAW,GAAG,KAAKA,EAAE,SAAS9B,EAAG;AAlB/B,IAmBD+B,KAAqB/B,CAAAA,OAAiB8B,OAAcA,EAAE,SAAS9B,EAAG;AAnBjE,IAoBDgC,KAAwBhC,CAAAA,QAC5BA,KAAMA,GAAI,YAAW,GACb8B,OAAc,CAACA,EAAE,WAAW,GAAG,KAAKA,EAAE,YAAW,EAAG,SAAS9B,EAAG;AAtBnE,IAwBDiC,KAA2BjC,CAAAA,QAC/BA,KAAMA,GAAI,YAAW,GACb8B,OAAcA,EAAE,YAAW,EAAG,SAAS9B,EAAG;AA1B7C,IA4BDkC,KAAgB;AA5Bf,IA6BDC,KAAmBL,CAAAA,OACvB,CAACA,GAAE,WAAW,GAAG,KAAKA,GAAE,SAAS,GAAG;AA9B/B,IA+BDM,KAAsBN,CAAAA,OAC1BA,OAAM,OAAOA,OAAM,QAAQA,GAAE,SAAS,GAAG;AAhCpC,IAiCDO,KAAY;AAjCX,IAkCDC,KAAeR,CAAAA,OACnBA,OAAM,OAAOA,OAAM,QAAQA,GAAE,WAAW,GAAG;AAnCtC,IAoCDS,KAAS;AApCR,IAqCDC,KAAYV,CAAAA,OAAcA,GAAE,WAAW,KAAK,CAACA,GAAE,WAAW,GAAG;AArC5D,IAsCDW,KAAeX,CAAAA,OACnBA,GAAE,WAAW,KAAKA,OAAM,OAAOA,OAAM;AAvChC,IAwCDY,KAAW;AAxCV,IAyCDC,KAAmB,CAAC,CAACC,IAAI5C,IAAM,EAAE,MAAuB;AAC5D,MAAM6C,IAAQC,GAAgB,CAACF,EAAE,CAAC;AAClC,SAAK5C,KACLA,IAAMA,EAAI,YAAW,GACb8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,KAF7C6C;AAGnB;AA9CO,IA+CDE,KAAsB,CAAC,CAACH,IAAI5C,IAAM,EAAE,MAAuB;AAC/D,MAAM6C,IAAQG,GAAmB,CAACJ,EAAE,CAAC;AACrC,SAAK5C,KACLA,IAAMA,EAAI,YAAW,GACb8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,KAF7C6C;AAGnB;AApDO,IAqDDI,KAAgB,CAAC,CAACL,IAAI5C,IAAM,EAAE,MAAuB;AACzD,MAAM6C,IAAQG,GAAmB,CAACJ,EAAE,CAAC;AACrC,SAAQ5C,IAAe8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,SAAS9B,CAAG,IAAjD6C;AAChB;AAxDO,IAyDDK,KAAa,CAAC,CAACN,IAAI5C,IAAM,EAAE,MAAuB;AACtD,MAAM6C,IAAQC,GAAgB,CAACF,EAAE,CAAC;AAClC,SAAQ5C,IAAe8B,OAAce,EAAMf,CAAC,KAAKA,EAAE,SAAS9B,CAAG,IAAjD6C;AAChB;AA5DO,IA6DDC,KAAkB,CAAC,CAACF,EAAE,MAAuB;AACjD,MAAMO,IAAMP,GAAG;AACf,SAAQd,OAAcA,EAAE,WAAWqB,KAAO,CAACrB,EAAE,WAAW,GAAG;AAC7D;AAhEO,IAiEDkB,KAAqB,CAAC,CAACJ,EAAE,MAAuB;AACpD,MAAMO,IAAMP,GAAG;AACf,SAAQd,OAAcA,EAAE,WAAWqB,KAAOrB,MAAM,OAAOA,MAAM;AAC/D;AApEO,IAuEDsB,KACJ,OAAO,WAAY,YAAY,UAC5B,OAAO,QAAQ,OAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACd,QAAQ,WACR;AA7EG,IAiFDC,KAAsC,EAC1C,OAAO,EAAE,KAAK,KAAI,GAClB,OAAO,EAAE,KAAK,IAAG,EAAA;AAnFZ,IAuFMC,KACXF,OAAoB,UAAUC,GAAK,MAAM,MAAMA,GAAK,MAAM;AAC5D3B,EAAU,MAAM4B;AAET,IAAMC,IAAW,uBAAO,aAAa;AAC5C7B,EAAU,WAAW6B;AAIrB,IAAMrF,KAAQ;AAAd,IAGMC,KAAOD,KAAQ;AAHrB,IAQMsF,KAAa;AARnB,IAYMC,KAAe;AAZrB,IAcaC,KACX,CAAC5H,IAAiB7B,IAA4B,CAAA,MAC7CH,OACC4H,EAAU5H,GAAGgC,IAAS7B,CAAO;AACjCyH,EAAU,SAASgC;AAEnB,IAAM1D,IAAM,CAAC5I,IAAqBC,IAAsB,CAAA,MACtD,OAAO,OAAO,CAAA,GAAID,IAAGC,CAAC;AADxB,IAGasM,KAAYC,CAAAA,OAA2C;AAClE,MAAI,CAACA,MAAO,OAAOA,MAAQ,YAAY,CAAC,OAAO,KAAKA,EAAG,EAAE,OACvD,QAAOlC;AAGT,MAAMmC,IAAOnC;AAKb,SAAO,OAAO,OAHJ,CAAC5H,GAAWgC,GAAiB7B,IAA4B,CAAA,MACjE4J,EAAK/J,GAAGgC,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAEZ,EACtB,WAAW,cAAwB4J,EAAK,UAAS;IAC/C,YAAY/H,GAAiB7B,IAA4B,CAAA,GAAE;AACzD,YAAM6B,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC;IAClC;IACA,OAAO,SAASA,GAAyB;AACvC,aAAO4J,EAAK,SAAS7D,EAAI4D,IAAK3J,CAAO,CAAC,EAAE;IAC1C;EAAA,GAGF,KAAK,cAAkB4J,EAAK,IAAG;IAE7B,YACE3E,GACAC,GACAlF,IAA4B,CAAA,GAAE;AAE9B,YAAMiF,GAAMC,GAAQa,EAAI4D,IAAK3J,CAAO,CAAC;IACvC;IAGA,OAAO,SAAS6B,GAAiB7B,IAA4B,CAAA,GAAE;AAC7D,aAAO4J,EAAK,IAAI,SAAS/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC;IACrD;EAAA,GAGF,UAAU,CACR,GACAA,IAGI,CAAA,MACD4J,EAAK,SAAS,GAAG7D,EAAI4D,IAAK3J,CAAO,CAAC,GAEvC,QAAQ,CACN,GACAA,IAGI,CAAA,MACD4J,EAAK,OAAO,GAAG7D,EAAI4D,IAAK3J,CAAO,CAAC,GAErC,QAAQ,CAAC6B,GAAiB7B,IAA4B,CAAA,MACpD4J,EAAK,OAAO/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAExC,UAAWA,OACT4J,EAAK,SAAS7D,EAAI4D,IAAK3J,CAAO,CAAC,GAEjC,QAAQ,CAAC6B,GAAiB7B,IAA4B,CAAA,MACpD4J,EAAK,OAAO/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAExC,aAAa,CAAC6B,GAAiB7B,IAA4B,CAAA,MACzD4J,EAAK,YAAY/H,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAE7C,OAAO,CACL6J,GACAhI,GACA7B,IAA4B,CAAA,MACzB4J,EAAK,MAAMC,GAAMhI,GAASkE,EAAI4D,IAAK3J,CAAO,CAAC,GAEhD,KAAK4J,EAAK,KACV,UAAUN,EAAAA,CACX;AACH;AACA7B,EAAU,WAAWiC;AAYd,IAAMI,KAAc,CACzBjI,IACA7B,IAA4B,CAAA,OAE5B4B,GAAmBC,EAAO,GAItB7B,EAAQ,WAAW,CAAC,mBAAmB,KAAK6B,EAAO,IAE9C,CAACA,EAAO,IAGV9B,GAAO8B,IAAS,EAAE,KAAK7B,EAAQ,eAAc,CAAE;AAExDyH,EAAU,cAAcqC;AAcjB,IAAMC,KAAS,CAAClI,IAAiB7B,IAA4B,CAAA,MAClE,IAAI0H,EAAU7F,IAAS7B,CAAO,EAAE,OAAM;AACxCyH,EAAU,SAASsC;AAEZ,IAAMC,KAAQ,CACnBH,IACAhI,GACA7B,IAA4B,CAAA,MAC1B;AACF,MAAMiK,IAAK,IAAIvC,EAAU7F,GAAS7B,CAAO;AACzC,SAAA6J,KAAOA,GAAK,OAAOhC,OAAKoC,EAAG,MAAMpC,CAAC,CAAC,GAC/BoC,EAAG,QAAQ,UAAU,CAACJ,GAAK,UAC7BA,GAAK,KAAKhI,CAAO,GAEZgI;AACT;AACApC,EAAU,QAAQuC;AAGlB,IAAME,KAAY;AAAlB,IACMlG,KAAgBhC,CAAAA,OACpBA,GAAE,QAAQ,4BAA4B,MAAM;AAF9C,IAYa0F,IAAP,MAAgB;EACpB;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EAEA;EACA,YAAY7F,GAAiB7B,IAA4B,CAAA,GAAE;AACzD4B,OAAmBC,CAAO,GAE1B7B,IAAUA,KAAW,CAAA,GACrB,KAAK,UAAUA,GACf,KAAK,UAAU6B,GACf,KAAK,WAAW7B,EAAQ,YAAYmJ,IACpC,KAAK,YAAY,KAAK,aAAa;AAEnC,QAAMgB,IAAO;AACb,SAAK,uBACH,CAAC,CAACnK,EAAQ,wBAAwBA,EAAQmK,CAAG,MAAM,OACjD,KAAK,yBACP,KAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG,IAEhD,KAAK,0BAA0B,CAAC,CAACnK,EAAQ,yBACzC,KAAK,SAAS,MACd,KAAK,SAAS,OACd,KAAK,WAAW,CAAC,CAACA,EAAQ,UAC1B,KAAK,UAAU,OACf,KAAK,QAAQ,OACb,KAAK,UAAU,CAAC,CAACA,EAAQ,SACzB,KAAK,SAAS,CAAC,CAAC,KAAK,QAAQ,QAC7B,KAAK,qBACHA,EAAQ,uBAAuB,SAC7BA,EAAQ,qBACR,CAAC,EAAE,KAAK,aAAa,KAAK,SAE9B,KAAK,UAAU,CAAA,GACf,KAAK,YAAY,CAAA,GACjB,KAAK,MAAM,CAAA,GAGX,KAAK,KAAI;EACX;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,EAClD,QAAO;AAET,aAAW6B,KAAW,KAAK,IACzB,UAAWwD,KAAQxD,EACjB,KAAI,OAAOwD,KAAS,SAAU,QAAO;AAGzC,WAAO;EACT;EAEA,SAASkB,GAAQ;EAAG;EAEpB,OAAI;AACF,QAAM1E,IAAU,KAAK,SACf7B,IAAU,KAAK;AAGrB,QAAI,CAACA,EAAQ,aAAa6B,EAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAK,UAAU;AACf;IACF;AAEA,QAAI,CAACA,GAAS;AACZ,WAAK,QAAQ;AACb;IACF;AAGA,SAAK,YAAW,GAGhB,KAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC,GAE1C7B,EAAQ,UACV,KAAK,QAAQ,IAAIoK,MAAgB,QAAQ,MAAM,GAAGA,CAAI,IAGxD,KAAK,MAAM,KAAK,SAAS,KAAK,OAAO;AAWrC,QAAMC,IAAe,KAAK,QAAQ,IAAIrI,OAAK,KAAK,WAAWA,CAAC,CAAC;AAC7D,SAAK,YAAY,KAAK,WAAWqI,CAAY,GAC7C,KAAK,MAAM,KAAK,SAAS,KAAK,SAAS;AAGvC,QAAIC,IAAM,KAAK,UAAU,IAAI,CAACtI,GAAGuE,GAAGgE,MAAM;AACxC,UAAI,KAAK,aAAa,KAAK,oBAAoB;AAE7C,YAAMC,IACJxI,EAAE,CAAC,MAAM,MACTA,EAAE,CAAC,MAAM,OACRA,EAAE,CAAC,MAAM,OAAO,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,MACrC,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,GAChByI,IAAU,WAAW,KAAKzI,EAAE,CAAC,CAAC;AACpC,YAAIwI,EACF,QAAO,CACL,GAAGxI,EAAE,MAAM,GAAG,CAAC,GACf,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC,CAAA;AAEnC,YAAID,EACT,QAAO,CAACzI,EAAE,CAAC,GAAG,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC,CAAC;MAEzD;AACA,aAAO1I,EAAE,IAAI0I,OAAM,KAAK,MAAMA,CAAE,CAAC;IACnC,CAAC;AAUD,QARA,KAAK,MAAM,KAAK,SAASJ,CAAG,GAG5B,KAAK,MAAMA,EAAI,OACbtI,OAAKA,EAAE,QAAQ,KAAK,MAAM,EAAE,GAI1B,KAAK,UACP,UAAS7D,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAM0B,IAAI,KAAK,IAAI1B,CAAC;AAElB0B,QAAE,CAAC,MAAM,MACTA,EAAE,CAAC,MAAM,MACT,KAAK,UAAU1B,CAAC,EAAE,CAAC,MAAM,OACzB,OAAO0B,EAAE,CAAC,KAAM,YAChB,YAAY,KAAKA,EAAE,CAAC,CAAC,MAErBA,EAAE,CAAC,IAAI;IAEX;AAGF,SAAK,MAAM,KAAK,SAAS,KAAK,GAAG;EACnC;EAOA,WAAW8K,GAAqB;AAE9B,QAAI,KAAK,QAAQ,WACf,UAASxM,IAAI,GAAGA,IAAIwM,EAAU,QAAQxM,IACpC,UAASwD,IAAI,GAAGA,IAAIgJ,EAAUxM,CAAC,EAAE,QAAQwD,IACnCgJ,GAAUxM,CAAC,EAAEwD,CAAC,MAAM,SACtBgJ,EAAUxM,CAAC,EAAEwD,CAAC,IAAI;AAM1B,QAAM,EAAE,mBAAAiJ,IAAoB,EAAC,IAAK,KAAK;AAEvC,WAAIA,KAAqB,KAEvBD,IAAY,KAAK,qBAAqBA,CAAS,GAC/CA,IAAY,KAAK,sBAAsBA,CAAS,KACvCC,KAAqB,IAE9BD,IAAY,KAAK,iBAAiBA,CAAS,IAG3CA,IAAY,KAAK,0BAA0BA,CAAS,GAG/CA;EACT;EAGA,0BAA0BA,GAAqB;AAC7C,WAAOA,EAAU,IAAIlL,OAAQ;AAC3B,UAAIoL,IAAa;AACjB,cAAeA,IAAKpL,EAAM,QAAQ,MAAMoL,IAAK,CAAC,OAAvC,MAA2C;AAChD,YAAI,IAAIA;AACR,eAAOpL,EAAM,IAAI,CAAC,MAAM,OACtB;AAEE,cAAMoL,KACRpL,EAAM,OAAOoL,GAAI,IAAIA,CAAE;MAE3B;AACA,aAAOpL;IACT,CAAC;EACH;EAGA,iBAAiBkL,GAAqB;AACpC,WAAOA,EAAU,IAAIlL,QACnBA,IAAQA,EAAM,OAAO,CAAC6K,GAAejF,MAAQ;AAC3C,UAAMyF,IAAOR,EAAIA,EAAI,SAAS,CAAC;AAC/B,aAAIjF,MAAS,QAAQyF,MAAS,OACrBR,IAELjF,MAAS,QACPyF,KAAQA,MAAS,QAAQA,MAAS,OAAOA,MAAS,QACpDR,EAAI,IAAG,GACAA,MAGXA,EAAI,KAAKjF,CAAI,GACNiF;IACT,GAAG,CAAA,CAAE,GACE7K,EAAM,WAAW,IAAI,CAAC,EAAE,IAAIA,EACpC;EACH;EAEA,qBAAqBA,GAAwB;AACtC,UAAM,QAAQA,CAAK,MACtBA,IAAQ,KAAK,WAAWA,CAAK;AAE/B,QAAIsL,IAAwB;AAC5B,OAAG;AAGD,UAFAA,IAAe,OAEX,CAAC,KAAK,yBAAyB;AACjC,iBAAS,IAAI,GAAG,IAAItL,EAAM,SAAS,GAAG,KAAK;AACzC,cAAMI,IAAIJ,EAAM,CAAC;AAEb,gBAAM,KAAKI,MAAM,MAAMJ,EAAM,CAAC,MAAM,OACpCI,MAAM,OAAOA,MAAM,QACrBkL,IAAe,MACftL,EAAM,OAAO,GAAG,CAAC,GACjB;QAEJ;AAEEA,UAAM,CAAC,MAAM,OACbA,EAAM,WAAW,MAChBA,EAAM,CAAC,MAAM,OAAOA,EAAM,CAAC,MAAM,QAElCsL,IAAe,MACftL,EAAM,IAAG;MAEb;AAGA,UAAIuL,IAAa;AACjB,cAAeA,IAAKvL,EAAM,QAAQ,MAAMuL,IAAK,CAAC,OAAvC,MAA2C;AAChD,YAAMnL,IAAIJ,EAAMuL,IAAK,CAAC;AAClBnL,aAAKA,MAAM,OAAOA,MAAM,QAAQA,MAAM,SACxCkL,IAAe,MACftL,EAAM,OAAOuL,IAAK,GAAG,CAAC,GACtBA,KAAM;MAEV;IACF,SAASD;AACT,WAAOtL,EAAM,WAAW,IAAI,CAAC,EAAE,IAAIA;EACrC;EAoBA,qBAAqBkL,GAAqB;AACxC,QAAII,IAAe;AACnB,OAAG;AACDA,UAAe;AAEf,eAAStL,KAASkL,GAAW;AAC3B,YAAIE,IAAa;AACjB,gBAAeA,IAAKpL,EAAM,QAAQ,MAAMoL,IAAK,CAAC,OAAvC,MAA2C;AAChD,cAAII,IAAcJ;AAClB,iBAAOpL,EAAMwL,IAAM,CAAC,MAAM,OAExBA;AAIEA,cAAMJ,KACRpL,EAAM,OAAOoL,IAAK,GAAGI,IAAMJ,CAAE;AAG/B,cAAIK,IAAOzL,EAAMoL,IAAK,CAAC,GACjBhL,IAAIJ,EAAMoL,IAAK,CAAC,GAChBM,IAAK1L,EAAMoL,IAAK,CAAC;AAEvB,cADIK,MAAS,QAEX,CAACrL,KACDA,MAAM,OACNA,MAAM,QACN,CAACsL,KACDA,MAAO,OACPA,MAAO,KAEP;AAEFJ,cAAe,MAEftL,EAAM,OAAOoL,GAAI,CAAC;AAClB,cAAMO,IAAQ3L,EAAM,MAAM,CAAC;AAC3B2L,YAAMP,CAAE,IAAI,MACZF,EAAU,KAAKS,CAAK,GACpBP;QACF;AAGA,YAAI,CAAC,KAAK,yBAAyB;AACjC,mBAAS1M,IAAI,GAAGA,IAAIsB,EAAM,SAAS,GAAGtB,KAAK;AACzC,gBAAM0B,IAAIJ,EAAMtB,CAAC;AAEbA,kBAAM,KAAK0B,MAAM,MAAMJ,EAAM,CAAC,MAAM,OACpCI,MAAM,OAAOA,MAAM,QACrBkL,IAAe,MACftL,EAAM,OAAOtB,GAAG,CAAC,GACjBA;UAEJ;AAEEsB,YAAM,CAAC,MAAM,OACbA,EAAM,WAAW,MAChBA,EAAM,CAAC,MAAM,OAAOA,EAAM,CAAC,MAAM,QAElCsL,IAAe,MACftL,EAAM,IAAG;QAEb;AAGA,YAAIuL,IAAa;AACjB,gBAAeA,IAAKvL,EAAM,QAAQ,MAAMuL,IAAK,CAAC,OAAvC,MAA2C;AAChD,cAAMnL,IAAIJ,EAAMuL,IAAK,CAAC;AACtB,cAAInL,KAAKA,MAAM,OAAOA,MAAM,QAAQA,MAAM,MAAM;AAC9CkL,gBAAe;AAEf,gBAAMM,IADUL,MAAO,KAAKvL,EAAMuL,IAAK,CAAC,MAAM,OACtB,CAAC,GAAG,IAAI,CAAA;AAChCvL,cAAM,OAAOuL,IAAK,GAAG,GAAG,GAAGK,CAAK,GAC5B5L,EAAM,WAAW,KAAGA,EAAM,KAAK,EAAE,GACrCuL,KAAM;UACR;QACF;MACF;IACF,SAASD;AAET,WAAOJ;EACT;EASA,sBAAsBA,GAAqB;AACzC,aAASxM,IAAI,GAAGA,IAAIwM,EAAU,SAAS,GAAGxM,IACxC,UAASwD,IAAIxD,IAAI,GAAGwD,IAAIgJ,EAAU,QAAQhJ,KAAK;AAC7C,UAAM2J,IAAU,KAAK,WACnBX,EAAUxM,CAAC,GACXwM,EAAUhJ,CAAC,GACX,CAAC,KAAK,uBAAuB;AAE/B,UAAI2J,GAAS;AACXX,UAAUxM,CAAC,IAAI,CAAA,GACfwM,EAAUhJ,CAAC,IAAI2J;AACf;MACF;IACF;AAEF,WAAOX,EAAU,OAAOE,OAAMA,EAAG,MAAM;EACzC;EAEA,WACE1N,GACAC,GACAmO,IAAwB,OAAK;AAE7B,QAAItN,IAAK,GACLC,IAAK,GACLF,IAAmB,CAAA,GACnBwN,IAAgB;AACpB,WAAOvN,IAAKd,EAAE,UAAUe,IAAKd,EAAE,SAC7B,KAAID,EAAEc,CAAE,MAAMb,EAAEc,CAAE,EAChBF,GAAO,KAAKwN,MAAU,MAAMpO,EAAEc,CAAE,IAAIf,EAAEc,CAAE,CAAC,GACzCA,KACAC;aACSqN,KAAgBpO,EAAEc,CAAE,MAAM,QAAQb,EAAEc,CAAE,MAAMf,EAAEc,IAAK,CAAC,EAC7DD,GAAO,KAAKb,EAAEc,CAAE,CAAC,GACjBA;aACSsN,KAAgBnO,EAAEc,CAAE,MAAM,QAAQf,EAAEc,CAAE,MAAMb,EAAEc,IAAK,CAAC,EAC7DF,GAAO,KAAKZ,EAAEc,CAAE,CAAC,GACjBA;aAEAf,EAAEc,CAAE,MAAM,OACVb,EAAEc,CAAE,MACH,KAAK,QAAQ,OAAO,CAACd,EAAEc,CAAE,EAAE,WAAW,GAAG,MAC1Cd,EAAEc,CAAE,MAAM,MACV;AACA,UAAIsN,MAAU,IAAK,QAAO;AAC1BA,UAAQ,KACRxN,EAAO,KAAKb,EAAEc,CAAE,CAAC,GACjBA,KACAC;IACF,WACEd,EAAEc,CAAE,MAAM,OACVf,EAAEc,CAAE,MACH,KAAK,QAAQ,OAAO,CAACd,EAAEc,CAAE,EAAE,WAAW,GAAG,MAC1Cd,EAAEc,CAAE,MAAM,MACV;AACA,UAAIuN,MAAU,IAAK,QAAO;AAC1BA,UAAQ,KACRxN,EAAO,KAAKZ,EAAEc,CAAE,CAAC,GACjBD,KACAC;IACF,MACE,QAAO;AAKX,WAAOf,EAAE,WAAWC,EAAE,UAAUY;EAClC;EAEA,cAAW;AACT,QAAI,KAAK,SAAU;AAEnB,QAAM6D,IAAU,KAAK,SACjBe,IAAS,OACT6I,IAAe;AAEnB,aAAS,IAAI,GAAG,IAAI5J,EAAQ,UAAUA,EAAQ,OAAO,CAAC,MAAM,KAAK,IAC/De,KAAS,CAACA,GACV6I;AAGEA,UAAc,KAAK,UAAU5J,EAAQ,MAAM4J,CAAY,IAC3D,KAAK,SAAS7I;EAChB;EAOA,SACE8I,GACA7J,GACA8J,IAAmB,OAAK;AAExB,QAAM3L,IAAU,KAAK;AAKrB,QAAI,KAAK,WAAW;AAClB,UAAM4L,IACJ,OAAOF,EAAK,CAAC,KAAM,YAAY,YAAY,KAAKA,EAAK,CAAC,CAAC,GACnDG,IACJ,CAACD,KACDF,EAAK,CAAC,MAAM,MACZA,EAAK,CAAC,MAAM,MACZA,EAAK,CAAC,MAAM,OACZ,YAAY,KAAKA,EAAK,CAAC,CAAC,GAEpBI,IACJ,OAAOjK,EAAQ,CAAC,KAAM,YAAY,YAAY,KAAKA,EAAQ,CAAC,CAAC,GACzDkK,IACJ,CAACD,KACDjK,EAAQ,CAAC,MAAM,MACfA,EAAQ,CAAC,MAAM,MACfA,EAAQ,CAAC,MAAM,OACf,OAAOA,EAAQ,CAAC,KAAM,YACtB,YAAY,KAAKA,EAAQ,CAAC,CAAC,GAEvBmK,IACJH,IAAU,IACRD,IAAY,IACZ,QACEK,IACJF,IAAa,IACXD,IAAe,IACf;AACJ,UAAI,OAAOE,KAAQ,YAAY,OAAOC,KAAQ,UAAU;AACtD,YAAM,CAACC,GAAIC,CAAE,IAAsB,CACjCT,EAAKM,CAAG,GACRnK,EAAQoK,CAAG,CAAA;AAETC,UAAG,YAAW,MAAOC,EAAG,YAAW,MACrCtK,EAAQoK,CAAG,IAAIC,GACXD,IAAMD,IACRnK,IAAUA,EAAQ,MAAMoK,CAAG,IAClBD,IAAMC,MACfP,IAAOA,EAAK,MAAMM,CAAG;MAG3B;IACF;AAIA,QAAM,EAAE,mBAAApB,IAAoB,EAAC,IAAK,KAAK;AACnCA,SAAqB,MACvBc,IAAO,KAAK,qBAAqBA,CAAI,IAGvC,KAAK,MAAM,YAAY,MAAM,EAAE,MAAAA,GAAM,SAAA7J,EAAO,CAAE,GAC9C,KAAK,MAAM,YAAY6J,EAAK,QAAQ7J,EAAQ,MAAM;AAElD,aACMuK,IAAK,GAAGC,IAAK,GAAGC,IAAKZ,EAAK,QAAQnG,IAAK1D,EAAQ,QACnDuK,IAAKE,KAAMD,IAAK9G,GAChB6G,KAAMC,KACN;AACA,WAAK,MAAM,eAAe;AAC1B,UAAIxM,IAAIgC,EAAQwK,CAAE,GACdxE,IAAI6D,EAAKU,CAAE;AAOf,UALA,KAAK,MAAMvK,GAAShC,GAAGgI,CAAC,GAKpBhI,MAAM,MACR,QAAO;AAIT,UAAIA,MAAMyJ,GAAU;AAClB,aAAK,MAAM,YAAY,CAACzH,GAAShC,GAAGgI,CAAC,CAAC;AAwBtC,YAAI0E,IAAKH,GACLI,IAAKH,IAAK;AACd,YAAIG,MAAOjH,GAAI;AAQb,eAPA,KAAK,MAAM,eAAe,GAOnB6G,IAAKE,GAAIF,IACd,KACEV,EAAKU,CAAE,MAAM,OACbV,EAAKU,CAAE,MAAM,QACZ,CAACpM,EAAQ,OAAO0L,EAAKU,CAAE,EAAE,OAAO,CAAC,MAAM,IAExC,QAAO;AAEX,iBAAO;QACT;AAGA,eAAOG,IAAKD,KAAI;AACd,cAAIG,IAAYf,EAAKa,CAAE;AAKvB,cAHA,KAAK,MAAM;iBAAoBb,GAAMa,GAAI1K,GAAS2K,GAAIC,CAAS,GAG3D,KAAK,SAASf,EAAK,MAAMa,CAAE,GAAG1K,EAAQ,MAAM2K,CAAE,GAAGb,CAAO,EAC1D,QAAA,KAAK,MAAM,yBAAyBY,GAAID,GAAIG,CAAS,GAE9C;AAIP,cACEA,MAAc,OACdA,MAAc,QACb,CAACzM,EAAQ,OAAOyM,EAAU,OAAO,CAAC,MAAM,KACzC;AACA,iBAAK,MAAM,iBAAiBf,GAAMa,GAAI1K,GAAS2K,CAAE;AACjD;UACF;AAGA,eAAK,MAAM,0CAA0C,GACrDD;QAEJ;AAKA,eAAI,CAAA,EAAAZ,MAEF,KAAK,MAAM;yBAA4BD,GAAMa,GAAI1K,GAAS2K,CAAE,GACxDD,MAAOD;MAMf;AAKA,UAAII;AASJ,UARI,OAAO7M,KAAM,YACf6M,IAAM7E,MAAMhI,GACZ,KAAK,MAAM,gBAAgBA,GAAGgI,GAAG6E,CAAG,MAEpCA,IAAM7M,EAAE,KAAKgI,CAAC,GACd,KAAK,MAAM,iBAAiBhI,GAAGgI,GAAG6E,CAAG,IAGnC,CAACA,EAAK,QAAO;IACnB;AAcA,QAAIN,MAAOE,KAAMD,MAAO9G,EAGtB,QAAO;AACF,QAAI6G,MAAOE,EAIhB,QAAOX;AACF,QAAIU,MAAO9G,EAKhB,QAAO6G,MAAOE,IAAK,KAAKZ,EAAKU,CAAE,MAAM;AAKrC,UAAM,IAAI,MAAM,MAAM;EAG1B;EAEA,cAAW;AACT,WAAOtC,GAAY,KAAK,SAAS,KAAK,OAAO;EAC/C;EAEA,MAAMjI,GAAe;AACnBD,OAAmBC,CAAO;AAE1B,QAAM7B,IAAU,KAAK;AAGrB,QAAI6B,MAAY,KAAM,QAAOyH;AAC7B,QAAIzH,MAAY,GAAI,QAAO;AAI3B,QAAIlE,GACAgP,IAA4C;AAAA,KAC3ChP,IAAIkE,EAAQ,MAAMyG,EAAM,KAC3BqE,IAAW3M,EAAQ,MAAMwI,KAAcD,MAC7B5K,IAAIkE,EAAQ,MAAM8F,EAAY,KACxCgF,KACE3M,EAAQ,SACNA,EAAQ,MACNgI,KACAD,KACF/H,EAAQ,MAAM8H,KACdF,IAAgBjK,EAAE,CAAC,CAAC,KACdA,IAAIkE,EAAQ,MAAM4G,EAAQ,KACpCkE,KACE3M,EAAQ,SACNA,EAAQ,MACN8I,KACAJ,KACF1I,EAAQ,MAAMgJ,KACdC,IAAYtL,CAAC,KACPA,IAAIkE,EAAQ,MAAMoG,EAAa,KACzC0E,IAAW3M,EAAQ,MAAMmI,KAAqBD,MACpCvK,IAAIkE,EAAQ,MAAMuG,EAAS,OACrCuE,IAAWtE;AAGb,QAAMrC,IAAK5B,EAAI,SAASvC,GAAS,KAAK,OAAO,EAAE,YAAW;AAC1D,WAAI8K,KAAY,OAAO3G,KAAO,YAE5B,QAAQ,eAAeA,GAAI,QAAQ,EAAE,OAAO2G,EAAQ,CAAE,GAEjD3G;EACT;EAEA,SAAM;AACJ,QAAI,KAAK,UAAU,KAAK,WAAW,MAAO,QAAO,KAAK;AAQtD,QAAMsE,IAAM,KAAK;AAEjB,QAAI,CAACA,EAAI,OACP,QAAA,KAAK,SAAS,OACP,KAAK;AAEd,QAAMtK,IAAU,KAAK,SAEf4M,IACJ5M,EAAQ,aAAakE,KACnBlE,EAAQ,MAAMuJ,KACdC,IACEtD,IAAQ,IAAI,IAAIlG,EAAQ,SAAS,CAAC,GAAG,IAAI,CAAA,CAAE,GAQ7CgG,IAAKsE,EACN,IAAIzI,OAAU;AACb,UAAMuD,IAAmCvD,EAAQ,IAAIhC,OAAI;AACvD,YAAIA,aAAa,OACf,UAAWgI,KAAKhI,EAAE,MAAM,MAAM,EAAE,EAAGqG,GAAM,IAAI2B,CAAC;AAEhD,eACE,OAAOhI,KAAM,WAAWmE,GAAanE,CAAC,IACpCA,MAAMyJ,IAAWA,IACjBzJ,EAAE;MAER,CAAC;AACDuF,QAAG,QAAQ,CAACvF,GAAG1B,MAAK;AAClB,YAAM+M,IAAO9F,EAAGjH,IAAI,CAAC,GACf2M,IAAO1F,EAAGjH,IAAI,CAAC;AACjB0B,cAAMyJ,KAAYwB,MAASxB,MAG3BwB,MAAS,SACPI,MAAS,UAAaA,MAAS5B,IACjClE,EAAGjH,IAAI,CAAC,IAAI,YAAYyO,IAAU,UAAU1B,IAE5C9F,EAAGjH,CAAC,IAAIyO,IAED1B,MAAS,SAClB9F,EAAGjH,IAAI,CAAC,IAAI2M,IAAO,eAAe8B,IAAU,OACnC1B,MAAS5B,MAClBlE,EAAGjH,IAAI,CAAC,IAAI2M,IAAO,eAAe8B,IAAU,SAAS1B,GACrD9F,EAAGjH,IAAI,CAAC,IAAImL;MAEhB,CAAC;AACD,UAAMuD,IAAWzH,EAAG,OAAOvF,OAAKA,MAAMyJ,CAAQ;AAK9C,UAAI,KAAK,WAAWuD,EAAS,UAAU,GAAG;AACxC,YAAMC,IAAqB,CAAA;AAC3B,iBAAS3O,IAAI,GAAGA,KAAK0O,EAAS,QAAQ1O,IACpC2O,GAAS,KAAKD,EAAS,MAAM,GAAG1O,CAAC,EAAE,KAAK,GAAG,CAAC;AAE9C,eAAO,QAAQ2O,EAAS,KAAK,GAAG,IAAI;MACtC;AAEA,aAAOD,EAAS,KAAK,GAAG;IAC1B,CAAC,EACA,KAAK,GAAG,GAIL,CAACE,GAAM7F,CAAK,IAAIoD,EAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAG7DtE,QAAK,MAAM+G,IAAO/G,IAAKkB,IAAQ,KAG3B,KAAK,YACPlB,IAAK,aAAa+G,IAAO/G,EAAG,MAAM,GAAG,EAAE,IAAIkB,IAAQ,OAIjD,KAAK,WAAQlB,IAAK,SAASA,IAAK;AAEpC,QAAI;AACF,WAAK,SAAS,IAAI,OAAOA,GAAI,CAAC,GAAGE,CAAK,EAAE,KAAK,EAAE,CAAC;IAElD,QAAa;AAEX,WAAK,SAAS;IAChB;AAEA,WAAO,KAAK;EACd;EAEA,WAAWrG,GAAS;AAKlB,WAAI,KAAK,0BACAA,EAAE,MAAM,GAAG,IACT,KAAK,aAAa,cAAc,KAAKA,CAAC,IAExC,CAAC,IAAI,GAAGA,EAAE,MAAM,KAAK,CAAC,IAEtBA,EAAE,MAAM,KAAK;EAExB;EAEA,MAAMgI,GAAW8D,IAAU,KAAK,SAAO;AAIrC,QAHA,KAAK,MAAM,SAAS9D,GAAG,KAAK,OAAO,GAG/B,KAAK,QACP,QAAO;AAET,QAAI,KAAK,MACP,QAAOA,MAAM;AAGf,QAAIA,MAAM,OAAO8D,EACf,QAAO;AAGT,QAAM3L,IAAU,KAAK;AAGjB,SAAK,cACP6H,IAAIA,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG;AAI5B,QAAMmF,IAAK,KAAK,WAAWnF,CAAC;AAC5B,SAAK,MAAM,KAAK,SAAS,SAASmF,CAAE;AAOpC,QAAM1C,IAAM,KAAK;AACjB,SAAK,MAAM,KAAK,SAAS,OAAOA,CAAG;AAGnC,QAAI2C,IAAmBD,EAAGA,EAAG,SAAS,CAAC;AACvC,QAAI,CAACC,EACH,UAAS9O,IAAI6O,EAAG,SAAS,GAAG,CAACC,KAAY9O,KAAK,GAAGA,IAC/C8O,KAAWD,EAAG7O,CAAC;AAInB,aAASA,IAAI,GAAGA,IAAImM,EAAI,QAAQnM,KAAK;AACnC,UAAM0D,IAAUyI,EAAInM,CAAC,GACjBuN,IAAOsB;AAKX,UAJIhN,EAAQ,aAAa6B,EAAQ,WAAW,MAC1C6J,IAAO,CAACuB,CAAQ,IAEN,KAAK,SAASvB,GAAM7J,GAAS8J,CAAO,EAE9C,QAAI3L,EAAQ,aACH,OAEF,CAAC,KAAK;IAEjB;AAIA,WAAIA,EAAQ,aACH,QAEF,KAAK;EACd;EAEA,OAAO,SAAS2J,GAAqB;AACnC,WAAOlC,EAAU,SAASkC,CAAG,EAAE;EACjC;AAAA;AAOFlC,EAAU,MAAMrD;AAChBqD,EAAU,YAAYC;AACtBD,EAAU,SAASD;AACnBC,EAAU,WAAWnE;AEvwCrB,IAAM4J,KAEF,OAAO,eAAgB,YACvB,eACA,OAAO,YAAY,OAAQ,aAE3B,cACA;AAPJ,IASMC,KAAS,oBAAI;AATnB,IAeMC,KACJ,OAAO,WAAY,YAAc,UAC/B,UACA,CAAA;AAlBJ,IAqBMC,KAAc,CAClBC,IACArI,GACAsI,GACAC,MACE;AACF,SAAOJ,GAAQ,eAAgB,aAC7BA,GAAQ,YAAYE,IAAKrI,GAAMsI,GAAMC,CAAE,IACvC,QAAQ,MAAM,IAAID,CAAI,KAAKtI,CAAI,KAAKqI,EAAG,EAAE;AAC7C;AA9BA,IAgCIG,KAAK,WAAW;AAhCpB,IAiCIC,KAAK,WAAW;AAGpB,IAAI,OAAOD,KAAO,KAAa;AAE7BC,OAAK,MAAiB;IACpB;IACA,WAAqC,CAAA;IACrC;IACA,UAAmB;IACnB,iBAAiBnH,GAAWiH,GAAwB;AAClD,WAAK,SAAS,KAAKA,CAAE;IACvB;EAAA,GAGFC,KAAK,MAAqB;IACxB,cAAA;AACEE,QAAc;IAChB;IACA,SAAS,IAAID;IACb,MAAME,GAAW;AACf,UAAI,CAAA,KAAK,OAAO,SAEhB;AAAA,aAAK,OAAO,SAASA,GAErB,KAAK,OAAO,UAAU;AAEtB,iBAAWJ,KAAM,KAAK,OAAO,SAC3BA,GAAGI,CAAM;AAEX,aAAK,OAAO,UAAUA,CAAM;MAAA;IAC9B;EAAA;AAEF,MAAIC,KACFT,GAAQ,KAAK,gCAAgC,KACzCO,IAAiB,MAAK;AACrBE,IAAAA,OACLA,KAAyB,OACzBR,GACE,oaAOA,uBACA,WACAM,CAAc;EAElB;AACF;AAGA,IAAMG,KAAcP,CAAAA,OAAiB,CAACJ,GAAO,IAAII,EAAI;AAArD,IAMMQ,IAAY9M,CAAAA,OAChBA,MAAKA,OAAM,KAAK,MAAMA,EAAC,KAAKA,KAAI,KAAK,SAASA,EAAC;AAPjD,IAqBM+M,KAAgB/N,CAAAA,OACnB8N,EAAS9N,EAAG,IACXA,MAAO,KAAK,IAAI,GAAG,CAAC,IAAI,aACxBA,MAAO,KAAK,IAAI,GAAG,EAAE,IAAI,cACzBA,MAAO,KAAK,IAAI,GAAG,EAAE,IAAI,cACzBA,MAAO,OAAO,mBAAmBgO,KACjC,OALe;AAtBnB,IA8BMA,KAAN,cAAwB,MAAa;EACnC,YAAYC,IAAY;AACtB,UAAMA,EAAI,GACV,KAAK,KAAK,CAAC;EACb;AAAA;AAlCF,IAwCMC,KAAN,MAAMC,GAAK;EACT;EACA;EAEA,OAAOC,KAAyB;EAChC,OAAO,OAAOpO,GAAW;AACvB,QAAMqO,IAAUN,GAAa/N,CAAG;AAChC,QAAI,CAACqO,EAAS,QAAO,CAAA;AACrBF,OAAMC,KAAgB;AACtB,QAAMrM,IAAI,IAAIoM,GAAMnO,GAAKqO,CAAO;AAChC,WAAAF,GAAMC,KAAgB,OACfrM;EACT;EACA,YAAY/B,GAAaqO,GAAyC;AAEhE,QAAI,CAACF,GAAMC,GACT,OAAM,IAAI,UAAU,yCAAyC;AAG/D,SAAK,OAAO,IAAIC,EAAQrO,CAAG,GAC3B,KAAK,SAAS;EAChB;EACA,KAAKgB,GAAQ;AACX,SAAK,KAAK,KAAK,QAAQ,IAAIA;EAC7B;EACA,MAAG;AACD,WAAO,KAAK,KAAK,EAAE,KAAK,MAAM;EAChC;AAAA;AAnEF,IAoiCasN,KAAP,MAAOC,GAAQ;EAEVC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAKT,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EAKA;EAKA;EAIA;EAIA;EAIA;EAIA;EAKA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAIA;EAGAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAEAC;EACAC;EACAC;EACAC;EAWA,OAAO,sBAIL3O,GAAqB;AACrB,WAAO,EAEL,QAAQA,EAAEqO,IACV,MAAMrO,EAAEsO,IACR,iBAAiBtO,EAAEuO,IACnB,OAAOvO,EAAEoO,IACT,QAAQpO,EAAE2N,IACV,SAAS3N,EAAE4N,IACX,SAAS5N,EAAE6N,IACX,MAAM7N,EAAE8N,IACR,MAAM9N,EAAE+N,IACR,IAAI,OAAI;AACN,aAAO/N,EAAEgO;IACX,GACA,IAAI,OAAI;AACN,aAAOhO,EAAEiO;IACX,GACA,MAAMjO,EAAEkO,IAER,mBAAoB7P,OAAW2B,EAAE4O,GAAmBvQ,CAAC,GACrD,iBAAiB,CACfc,GACA0P,GACArQ,GACAsQ,MAEA9O,EAAE+O,GACA5P,GACA0P,GACArQ,GACAsQ,CAAO,GAEX,YAAaD,OAAwB7O,EAAEgP,GAAYH,CAAc,GACjE,SAAUrQ,OAAsCwB,EAAEiP,GAASzQ,CAAO,GAClE,UAAWA,OACTwB,EAAEkP,GAAU1Q,CAAO,GACrB,SAAUqQ,OAA8B7O,EAAEmP,GAASN,CAAc,EAAA;EAErE;EAOA,IAAI,MAAG;AACL,WAAO,KAAK5B;EACd;EAIA,IAAI,UAAO;AACT,WAAO,KAAKC;EACd;EAIA,IAAI,iBAAc;AAChB,WAAO,KAAKQ;EACd;EAIA,IAAI,OAAI;AACN,WAAO,KAAKD;EACd;EAIA,IAAI,cAAW;AACb,WAAO,KAAKH;EACd;EACA,IAAI,aAAU;AACZ,WAAO,KAAKC;EACd;EAIA,IAAI,UAAO;AACT,WAAO,KAAKJ;EACd;EAIA,IAAI,WAAQ;AACV,WAAO,KAAKC;EACd;EAIA,IAAI,eAAY;AACd,WAAO,KAAKC;EACd;EAEA,YAAY7O,GAAwD;AAClE,QAAM,EACJ,KAAAC,IAAM,GACN,KAAA2Q,GACA,eAAAC,IAAgB,GAChB,cAAAC,GACA,gBAAAC,GACA,gBAAAC,GACA,YAAAC,GACA,SAAAC,GACA,UAAAC,GACA,cAAAC,GACA,gBAAAC,GACA,aAAAC,GACA,SAAAC,IAAU,GACV,cAAAC,IAAe,GACf,iBAAAC,GACA,aAAAC,GACA,YAAAC,GACA,0BAAAC,GACA,oBAAAC,GACA,4BAAAC,GACA,wBAAAC,GACA,kBAAAC,GACA,MAAAC,EAAI,IACFjS;AAEJ,QAAIiS,MAAS,UACP,OAAOA,GAAM,OAAQ,WACvB,OAAM,IAAI,UACR,mDAAmD;AAOzD,QAFA,KAAKjD,KAAQiD,KAAQ/E,IAEjBjN,MAAQ,KAAK,CAAC8N,EAAS9N,CAAG,EAC5B,OAAM,IAAI,UAAU,0CAA0C;AAGhE,QAAMiS,IAAYjS,IAAM+N,GAAa/N,CAAG,IAAI;AAC5C,QAAI,CAACiS,EACH,OAAM,IAAI,MAAM,wBAAwBjS,CAAG;AAO7C,QAJA,KAAKwO,KAAOxO,GACZ,KAAKyO,KAAW6C,GAChB,KAAK,eAAeC,KAAgB,KAAK9C,IACzC,KAAK,kBAAkB+C,GACnB,KAAK,iBAAiB;AACxB,UAAI,CAAC,KAAK/C,MAAY,CAAC,KAAK,aAC1B,OAAM,IAAI,UACR,oEAAoE;AAGxE,UAAI,OAAO,KAAK,mBAAoB,WAClC,OAAM,IAAI,UAAU,qCAAqC;IAE7D;AAEA,QAAIiD,MAAe,UAAa,OAAOA,KAAe,WACpD,OAAM,IAAI,UAAU,0CAA0C;AAIhE,QAFA,KAAK5C,KAAc4C,GAEfD,MAAgB,UAAa,OAAOA,KAAgB,WACtD,OAAM,IAAI,UAAU,6CAA6C;AAyCnE,QAvCA,KAAK5C,KAAe4C,GACpB,KAAKzB,KAAkB,CAAC,CAACyB,GAEzB,KAAKvC,KAAU,oBAAI,OACnB,KAAKC,KAAW,IAAI,MAAMnP,CAAG,EAAE,KAAK,MAAS,GAC7C,KAAKoP,KAAW,IAAI,MAAMpP,CAAG,EAAE,KAAK,MAAS,GAC7C,KAAKqP,KAAQ,IAAI4C,EAAUjS,CAAG,GAC9B,KAAKsP,KAAQ,IAAI2C,EAAUjS,CAAG,GAC9B,KAAKuP,KAAQ,GACb,KAAKC,KAAQ,GACb,KAAKC,KAAQvB,GAAM,OAAOlO,CAAG,GAC7B,KAAKgP,KAAQ,GACb,KAAKC,KAAkB,GAEnB,OAAOgC,KAAY,eACrB,KAAKvC,KAAWuC,IAEd,OAAOC,KAAa,eACtB,KAAKvC,KAAYuC,IAEf,OAAOC,KAAiB,cAC1B,KAAKvC,KAAgBuC,GACrB,KAAKzB,KAAY,CAAA,MAEjB,KAAKd,KAAgB,QACrB,KAAKc,KAAY,SAEnB,KAAKK,KAAc,CAAC,CAAC,KAAKrB,IAC1B,KAAKwB,KAAe,CAAC,CAAC,KAAKvB,IAC3B,KAAKsB,KAAmB,CAAC,CAAC,KAAKrB,IAE/B,KAAK,iBAAiB,CAAC,CAACwC,GACxB,KAAK,cAAc,CAAC,CAACC,GACrB,KAAK,2BAA2B,CAAC,CAACM,GAClC,KAAK,6BAA6B,CAAC,CAACE,GACpC,KAAK,yBAAyB,CAAC,CAACC,GAChC,KAAK,mBAAmB,CAAC,CAACC,GAGtB,KAAK,iBAAiB,GAAG;AAC3B,UAAI,KAAKtD,OAAa,KAChB,CAACX,EAAS,KAAKW,EAAQ,EACzB,OAAM,IAAI,UACR,iDAAiD;AAIvD,UAAI,CAACX,EAAS,KAAK,YAAY,EAC7B,OAAM,IAAI,UACR,sDAAsD;AAG1D,WAAKoE,GAAuB;IAC9B;AAUA,QARA,KAAK,aAAa,CAAC,CAAClB,GACpB,KAAK,qBAAqB,CAAC,CAACY,GAC5B,KAAK,iBAAiB,CAAC,CAACd,GACxB,KAAK,iBAAiB,CAAC,CAACC,GACxB,KAAK,gBACHjD,EAAS8C,CAAa,KAAKA,MAAkB,IAAIA,IAAgB,GACnE,KAAK,eAAe,CAAC,CAACC,GACtB,KAAK,MAAMF,KAAO,GACd,KAAK,KAAK;AACZ,UAAI,CAAC7C,EAAS,KAAK,GAAG,EACpB,OAAM,IAAI,UAAU,6CAA6C;AAEnE,WAAKqE,GAAsB;IAC7B;AAGA,QAAI,KAAK3D,OAAS,KAAK,KAAK,QAAQ,KAAK,KAAKC,OAAa,EACzD,OAAM,IAAI,UACR,kDAAkD;AAGtD,QAAI,CAAC,KAAK,gBAAgB,CAAC,KAAKD,MAAQ,CAAC,KAAKC,IAAU;AACtD,UAAMnB,KAAO;AACTO,SAAWP,EAAI,MACjBJ,GAAO,IAAII,EAAI,GAIfF,GAFE,iGAEe,yBAAyBE,IAAMiB,EAAQ;IAE5D;EACF;EAMA,gBAAgB6D,GAAM;AACpB,WAAO,KAAKlD,GAAQ,IAAIkD,CAAG,IAAI,IAAA,IAAW;EAC5C;EAEAD,KAAsB;AACpB,QAAME,IAAO,IAAIrE,GAAU,KAAKQ,EAAI,GAC9B8D,IAAS,IAAItE,GAAU,KAAKQ,EAAI;AACtC,SAAKqB,KAAQwC,GACb,KAAKzC,KAAU0C;AACf,QAAMC,IACJ,KAAK,eACH,IAAI,MAAiD,KAAK/D,EAAI,IAC9D;AACJ,SAAKsB,KAAmByC,GAExB,KAAKC,KAAc,CAACpC,GAAOO,GAAKnK,IAAQ,KAAKuI,GAAM,IAAG,MAAM;AAU1D,UATAuD,EAAOlC,CAAK,IAAIO,MAAQ,IAAInK,IAAQ,GACpC6L,EAAKjC,CAAK,IAAIO,GAIV4B,IAAcnC,CAAK,MACrB,aAAamC,EAAYnC,CAAK,CAAC,GAC/BmC,EAAYnC,CAAK,IAAI,SAEnBO,MAAQ,KAAK4B,GAAa;AAC5B,YAAME,IAAI,WAAW,MAAK;AACpB,eAAK/B,GAASN,CAAK,KACrB,KAAKsC,GAAQ,KAAKvD,GAASiB,CAAK,GAAQ,QAAQ;QAEpD,GAAGO,IAAM,CAAC;AAGN8B,UAAE,SACJA,EAAE,MAAK,GAGTF,EAAYnC,CAAK,IAAIqC;MACvB;IACF,GAEA,KAAKE,KAAiBvC,OAAQ;AAC5BkC,QAAOlC,CAAK,IAAIiC,EAAKjC,CAAK,MAAM,IAAI,KAAKrB,GAAM,IAAG,IAAK;IACzD,GAEA,KAAK6D,KAAa,CAACC,GAAQzC,MAAS;AAClC,UAAIiC,EAAKjC,CAAK,GAAG;AACf,YAAMO,IAAM0B,EAAKjC,CAAK,GAChB5J,IAAQ8L,EAAOlC,CAAK;AAE1B,YAAI,CAACO,KAAO,CAACnK,EAAO;AACpBqM,UAAO,MAAMlC,GACbkC,EAAO,QAAQrM,GACfqM,EAAO,MAAMC,KAAaC,EAAM;AAChC,YAAMC,IAAMH,EAAO,MAAMrM;AACzBqM,UAAO,eAAelC,IAAMqC;MAC9B;IACF;AAIA,QAAIF,IAAY,GACVC,IAAS,MAAK;AAClB,UAAM/R,IAAI,KAAK+N,GAAM,IAAG;AACxB,UAAI,KAAK,gBAAgB,GAAG;AAC1B+D,YAAY9R;AACZ,YAAMyR,IAAI,WAAW,MAAOK,IAAY,GAAI,KAAK,aAAa;AAG1DL,UAAE,SACJA,EAAE,MAAK;MAGX;AACA,aAAOzR;IACT;AAEA,SAAK,kBAAkBoR,OAAM;AAC3B,UAAMhC,IAAQ,KAAKlB,GAAQ,IAAIkD,CAAG;AAClC,UAAIhC,MAAU,OACZ,QAAO;AAET,UAAMO,IAAM0B,EAAKjC,CAAK,GAChB5J,IAAQ8L,EAAOlC,CAAK;AAC1B,UAAI,CAACO,KAAO,CAACnK,EACX,QAAO,IAAA;AAET,UAAMwM,KAAOF,KAAaC,EAAM,KAAMvM;AACtC,aAAOmK,IAAMqC;IACf,GAEA,KAAKtC,KAAWN,OAAQ;AACtB,UAAMrO,IAAIuQ,EAAOlC,CAAK,GAChBqC,IAAIJ,EAAKjC,CAAK;AACpB,aAAO,CAAC,CAACqC,KAAK,CAAC,CAAC1Q,MAAM+Q,KAAaC,EAAM,KAAMhR,IAAI0Q;IACrD;EACF;EAGAE,KAAyC,MAAK;EAAE;EAChDC,KAAiE,MAAK;EAAE;EACxEJ,KAMY,MAAK;EAAE;EAGnB9B,KAAsC,MAAM;EAE5CwB,KAAuB;AACrB,QAAMe,IAAQ,IAAIjF,GAAU,KAAKQ,EAAI;AACrC,SAAKS,KAAkB,GACvB,KAAKU,KAASsD,GACd,KAAKC,KAAkB9C,OAAQ;AAC7B,WAAKnB,MAAmBgE,EAAM7C,CAAK,GACnC6C,EAAM7C,CAAK,IAAI;IACjB,GACA,KAAK+C,KAAe,CAACzS,GAAG0S,GAAGnF,GAAMuD,MAAmB;AAGlD,UAAI,KAAKrB,GAAmBiD,CAAC,EAC3B,QAAO;AAET,UAAI,CAACtF,EAASG,CAAI,EAChB,KAAIuD,GAAiB;AACnB,YAAI,OAAOA,KAAoB,WAC7B,OAAM,IAAI,UAAU,oCAAoC;AAG1D,YADAvD,IAAOuD,EAAgB4B,GAAG1S,CAAC,GACvB,CAACoN,EAASG,CAAI,EAChB,OAAM,IAAI,UACR,0DAA0D;MAGhE,MACE,OAAM,IAAI,UACR,2HAEwB;AAI9B,aAAOA;IACT,GACA,KAAKoF,KAAe,CAClBjD,GACAnC,GACA4E,MACE;AAEF,UADAI,EAAM7C,CAAK,IAAInC,GACX,KAAKQ,IAAU;AACjB,YAAM6C,IAAU,KAAK7C,KAAYwE,EAAM7C,CAAK;AAC5C,eAAO,KAAKnB,KAAkBqC,IAC5B,MAAKgC,GAAO,IAAI;MAEpB;AACA,WAAKrE,MAAmBgE,EAAM7C,CAAK,GAC/ByC,MACFA,EAAO,YAAY5E,GACnB4E,EAAO,sBAAsB,KAAK5D;IAEtC;EACF;EAEAiE,KAA0CK,OAAK;EAAE;EACjDF,KAIY,CAACE,GAAIC,GAAIC,MAAO;EAAE;EAC9BN,KAKqB,CACnBO,GACAC,GACA1F,GACAuD,MACE;AACF,QAAIvD,KAAQuD,EACV,OAAM,IAAI,UACR,kEAAkE;AAGtE,WAAO;EACT;EAEA,CAAChB,GAAS,EAAE,YAAAQ,IAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC7C,QAAI,KAAKhC,GACP,UAAS9Q,IAAI,KAAKsR,IACZ,EAAA,CAAC,KAAKoE,GAAc1V,CAAC,OAGrB8S,KAAc,CAAC,KAAKN,GAASxS,CAAC,OAChC,MAAMA,IAEJA,MAAM,KAAKqR,OAGbrR,KAAI,KAAKoR,GAAMpR,CAAC;EAIxB;EAEA,CAACuS,GAAU,EAAE,YAAAO,IAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC9C,QAAI,KAAKhC,GACP,UAAS9Q,IAAI,KAAKqR,IACZ,EAAA,CAAC,KAAKqE,GAAc1V,CAAC,OAGrB8S,KAAc,CAAC,KAAKN,GAASxS,CAAC,OAChC,MAAMA,IAEJA,MAAM,KAAKsR,OAGbtR,KAAI,KAAKmR,GAAMnR,CAAC;EAIxB;EAEA0V,GAAcxD,GAAY;AACxB,WACEA,MAAU,UACV,KAAKlB,GAAQ,IAAI,KAAKC,GAASiB,CAAK,CAAM,MAAMA;EAEpD;EAMA,CAAC,UAAO;AACN,aAAWlS,KAAK,KAAKsS,GAAQ,EAEzB,MAAKpB,GAASlR,CAAC,MAAM,UACrB,KAAKiR,GAASjR,CAAC,MAAM,UACrB,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAEzC,MAAM,CAAC,KAAKiR,GAASjR,CAAC,GAAG,KAAKkR,GAASlR,CAAC,CAAC;EAG/C;EAQA,CAAC,WAAQ;AACP,aAAWA,KAAK,KAAKuS,GAAS,EAE1B,MAAKrB,GAASlR,CAAC,MAAM,UACrB,KAAKiR,GAASjR,CAAC,MAAM,UACrB,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAEzC,MAAM,CAAC,KAAKiR,GAASjR,CAAC,GAAG,KAAKkR,GAASlR,CAAC,CAAC;EAG/C;EAMA,CAAC,OAAI;AACH,aAAWA,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM9P,IAAI,KAAKyO,GAASjR,CAAC;AACrBwC,YAAM,UAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAMwC;IAEV;EACF;EAQA,CAAC,QAAK;AACJ,aAAWxC,KAAK,KAAKuS,GAAS,GAAI;AAChC,UAAM/P,IAAI,KAAKyO,GAASjR,CAAC;AACrBwC,YAAM,UAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAMwC;IAEV;EACF;EAMA,CAAC,SAAM;AACL,aAAWxC,KAAK,KAAKsS,GAAQ,EACjB,MAAKpB,GAASlR,CAAC,MACf,UAAa,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAM,KAAKkR,GAASlR,CAAC;EAG3B;EAQA,CAAC,UAAO;AACN,aAAWA,KAAK,KAAKuS,GAAS,EAClB,MAAKrB,GAASlR,CAAC,MACf,UAAa,CAAC,KAAKiS,GAAmB,KAAKf,GAASlR,CAAC,CAAC,MAC9D,MAAM,KAAKkR,GAASlR,CAAC;EAG3B;EAMA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,QAAO;EACrB;EAOA,CAAC,OAAO,WAAW,IAAI;EAMvB,KACEqP,GACAsG,IAA4C,CAAA,GAAE;AAE9C,aAAW3V,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM4C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACpE,UAAIU,MAAU,UACVvG,EAAGuG,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI,EACvC,QAAO,KAAK,IAAI,KAAKiR,GAASjR,CAAC,GAAQ2V,CAAU;IAErD;EACF;EAaA,QACEtG,GACAwG,IAAa,MAAI;AAEjB,aAAW7V,KAAK,KAAKsS,GAAQ,GAAI;AAC/B,UAAM4C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AAChEU,YAAU,UACdvG,EAAG,KAAKwG,GAAOD,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI;IACnD;EACF;EAMA,SACEqP,GACAwG,IAAa,MAAI;AAEjB,aAAW7V,KAAK,KAAKuS,GAAS,GAAI;AAChC,UAAM2C,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IAAQ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AAChEU,YAAU,UACdvG,EAAG,KAAKwG,GAAOD,GAAO,KAAK3E,GAASjR,CAAC,GAAQ,IAAI;IACnD;EACF;EAMA,aAAU;AACR,QAAI8V,IAAU;AACd,aAAW9V,KAAK,KAAKuS,GAAU,EAAE,YAAY,KAAI,CAAE,EAC7C,MAAKC,GAASxS,CAAC,MACjB,KAAKwU,GAAQ,KAAKvD,GAASjR,CAAC,GAAQ,QAAQ,GAC5C8V,IAAU;AAGd,WAAOA;EACT;EAcA,KAAK5B,GAAM;AACT,QAAMlU,IAAI,KAAKgR,GAAQ,IAAIkD,CAAG;AAC9B,QAAIlU,MAAM,OAAW;AACrB,QAAMkV,IAAI,KAAKhE,GAASlR,CAAC,GAGnB4V,IACJ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACxD,QAAIU,MAAU,OAAW;AAEzB,QAAMG,IAA2B,EAAE,OAAAH,EAAK;AACxC,QAAI,KAAKjE,MAAS,KAAKD,IAAS;AAC9B,UAAMe,IAAM,KAAKd,GAAM3R,CAAC,GAClBsI,IAAQ,KAAKoJ,GAAQ1R,CAAC;AAC5B,UAAIyS,KAAOnK,GAAO;AAChB,YAAM0N,IAASvD,KAAO,KAAK5B,GAAM,IAAG,IAAKvI;AACzCyN,UAAM,MAAMC,GACZD,EAAM,QAAQ,KAAK,IAAG;MACxB;IACF;AACA,WAAI,KAAKtE,OACPsE,EAAM,OAAO,KAAKtE,GAAOzR,CAAC,IAErB+V;EACT;EAeA,OAAI;AACF,QAAME,IAAgC,CAAA;AACtC,aAAWjW,KAAK,KAAKsS,GAAS,EAAE,YAAY,KAAI,CAAE,GAAG;AACnD,UAAM4B,IAAM,KAAKjD,GAASjR,CAAC,GACrBkV,IAAI,KAAKhE,GAASlR,CAAC,GACnB4V,IACJ,KAAK3D,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;AACxD,UAAIU,MAAU,UAAa1B,MAAQ,OAAW;AAC9C,UAAM6B,IAA2B,EAAE,OAAAH,EAAK;AACxC,UAAI,KAAKjE,MAAS,KAAKD,IAAS;AAC9BqE,UAAM,MAAM,KAAKpE,GAAM3R,CAAC;AAGxB,YAAM8U,IAAM,KAAKjE,GAAM,IAAG,IAAM,KAAKa,GAAQ1R,CAAC;AAC9C+V,UAAM,QAAQ,KAAK,MAAM,KAAK,IAAG,IAAKjB,CAAG;MAC3C;AACI,WAAKrD,OACPsE,EAAM,OAAO,KAAKtE,GAAOzR,CAAC,IAE5BiW,EAAI,QAAQ,CAAC/B,GAAK6B,CAAK,CAAC;IAC1B;AACA,WAAOE;EACT;EAWA,KAAKA,GAA6B;AAChC,SAAK,MAAK;AACV,aAAW,CAAC/B,GAAK6B,CAAK,KAAKE,GAAK;AAC9B,UAAIF,EAAM,OAAO;AAOf,YAAMjB,IAAM,KAAK,IAAG,IAAKiB,EAAM;AAC/BA,UAAM,QAAQ,KAAKlF,GAAM,IAAG,IAAKiE;MACnC;AACA,WAAK,IAAIZ,GAAK6B,EAAM,OAAOA,CAAK;IAClC;EACF;EAgCA,IACEvT,GACA0S,GACAgB,IAA4C,CAAA,GAAE;AAE9C,QAAIhB,MAAM,OACR,QAAA,KAAK,OAAO1S,CAAC,GACN;AAET,QAAM,EACJ,KAAAiQ,IAAM,KAAK,KACX,OAAAnK,GACA,gBAAA4K,IAAiB,KAAK,gBACtB,iBAAAI,IAAkB,KAAK,iBACvB,QAAAqB,EAAM,IACJuB,GACA,EAAE,aAAA/C,IAAc,KAAK,YAAW,IAAK+C,GAEnCnG,IAAO,KAAKkF,GAChBzS,GACA0S,GACAgB,EAAW,QAAQ,GACnB5C,CAAe;AAIjB,QAAI,KAAK,gBAAgBvD,IAAO,KAAK,aACnC,QAAI4E,MACFA,EAAO,MAAM,QACbA,EAAO,uBAAuB,OAGhC,KAAKH,GAAQhS,GAAG,KAAK,GACd;AAET,QAAI0P,IAAQ,KAAKpB,OAAU,IAAI,SAAY,KAAKE,GAAQ,IAAIxO,CAAC;AAC7D,QAAI0P,MAAU,OAEZA,KACE,KAAKpB,OAAU,IAAI,KAAKQ,KACtB,KAAKC,GAAM,WAAW,IAAI,KAAKA,GAAM,IAAG,IACxC,KAAKT,OAAU,KAAKR,KAAO,KAAK8E,GAAO,KAAK,IAC5C,KAAKtE,IACT,KAAKG,GAASiB,CAAK,IAAI1P,GACvB,KAAK0O,GAASgB,CAAK,IAAIgD,GACvB,KAAKlE,GAAQ,IAAIxO,GAAG0P,CAAK,GACzB,KAAKf,GAAM,KAAKG,EAAK,IAAIY,GACzB,KAAKd,GAAMc,CAAK,IAAI,KAAKZ,IACzB,KAAKA,KAAQY,GACb,KAAKpB,MACL,KAAKqE,GAAajD,GAAOnC,GAAM4E,CAAM,GACjCA,MAAQA,EAAO,MAAM,QACzBxB,IAAc,OACV,KAAKnB,MACP,KAAKvB,KAAYyE,GAAQ1S,GAAG,KAAK;SAE9B;AAEL,WAAK6P,GAAYH,CAAK;AACtB,UAAMiE,IAAS,KAAKjF,GAASgB,CAAK;AAClC,UAAIgD,MAAMiB,GAAQ;AAChB,YAAI,KAAKrE,MAAmB,KAAKG,GAAmBkE,CAAM,GAAG;AAC3DA,YAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC;AACpD,cAAM,EAAE,sBAAsBtS,EAAC,IAAKsS;AAChCtS,gBAAM,UAAa,CAACqP,MAClB,KAAKrB,MACP,KAAKrB,KAAW3M,GAAQrB,GAAG,KAAK,GAE9B,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC3N,GAAQrB,GAAG,KAAK,CAAC;QAG7C,MAAY0Q,OACN,KAAKrB,MACP,KAAKrB,KAAW2F,GAAa3T,GAAG,KAAK,GAEnC,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC2E,GAAa3T,GAAG,KAAK,CAAC;AAMhD,YAHA,KAAKwS,GAAgB9C,CAAK,GAC1B,KAAKiD,GAAajD,GAAOnC,GAAM4E,CAAM,GACrC,KAAKzD,GAASgB,CAAK,IAAIgD,GACnBP,GAAQ;AACVA,YAAO,MAAM;AACb,cAAMyB,IACJD,KAAU,KAAKlE,GAAmBkE,CAAM,IACtCA,EAAO,uBACPA;AACAC,gBAAa,WAAWzB,EAAO,WAAWyB;QAChD;MACF,MAAWzB,OACTA,EAAO,MAAM;AAGX,WAAK3C,MACP,KAAK,WAAWkD,GAAQ1S,GAAG0S,MAAMiB,IAAS,WAAW,SAAS;IAElE;AAUA,QATI1D,MAAQ,KAAK,CAAC,KAAKd,MACrB,KAAKsC,GAAsB,GAEzB,KAAKtC,OACFwB,KACH,KAAKmB,GAAYpC,GAAOO,GAAKnK,CAAK,GAEhCqM,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,IAEvC,CAACgB,KAAkB,KAAKnB,MAAoB,KAAKP,IAAW;AAC9D,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;AACA,WAAO;EACT;EAMA,MAAG;AACD,QAAI;AACF,aAAO,KAAKxF,MAAO;AACjB,YAAMyF,IAAM,KAAKrF,GAAS,KAAKG,EAAK;AAEpC,YADA,KAAK+D,GAAO,IAAI,GACZ,KAAKnD,GAAmBsE,CAAG,GAAA;AAC7B,cAAIA,EAAI,qBACN,QAAOA,EAAI;QAAA,WAEJA,MAAQ,OACjB,QAAOA;MAEX;IACF,UAAA;AACE,UAAI,KAAKxE,MAAoB,KAAKP,IAAW;AAC3C,YAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,eAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;MAEhC;IACF;EACF;EAEAlB,GAAOoB,GAAa;AAClB,QAAMC,IAAO,KAAKpF,IACZ7O,IAAI,KAAKyO,GAASwF,CAAI,GACtBvB,IAAI,KAAKhE,GAASuF,CAAI;AAC5B,WAAI,KAAK3E,MAAmB,KAAKG,GAAmBiD,CAAC,IACnDA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KACrC,KAAKrD,MAAe,KAAKE,QAC9B,KAAKF,MACP,KAAKrB,KAAW0E,GAAG1S,GAAG,OAAO,GAE3B,KAAKuP,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAG1S,GAAG,OAAO,CAAC,IAGxC,KAAKwS,GAAgByB,CAAI,GACrB,KAAK7E,KAAmB6E,CAAI,MAC9B,aAAa,KAAK7E,GAAiB6E,CAAI,CAAC,GACxC,KAAK7E,GAAiB6E,CAAI,IAAI,SAG5BD,MACF,KAAKvF,GAASwF,CAAI,IAAI,QACtB,KAAKvF,GAASuF,CAAI,IAAI,QACtB,KAAKlF,GAAM,KAAKkF,CAAI,IAElB,KAAK3F,OAAU,KACjB,KAAKO,KAAQ,KAAKC,KAAQ,GAC1B,KAAKC,GAAM,SAAS,KAEpB,KAAKF,KAAQ,KAAKF,GAAMsF,CAAI,GAE9B,KAAKzF,GAAQ,OAAOxO,CAAC,GACrB,KAAKsO,MACE2F;EACT;EAkBA,IAAIjU,GAAMkU,IAA4C,CAAA,GAAE;AACtD,QAAM,EAAE,gBAAA7D,IAAiB,KAAK,gBAAgB,QAAA8B,EAAM,IAAK+B,GACnDxE,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,QAAW;AACvB,UAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UACE,KAAKD,GAAmBiD,CAAC,KACzBA,EAAE,yBAAyB,OAE3B,QAAO;AAET,UAAK,KAAK1C,GAASN,CAAK,EASbyC,OACTA,EAAO,MAAM,SACb,KAAKD,GAAWC,GAAQzC,CAAK;UAV7B,QAAIW,KACF,KAAK4B,GAAevC,CAAK,GAEvByC,MACFA,EAAO,MAAM,OACb,KAAKD,GAAWC,GAAQzC,CAAK,IAExB;IAKX,MAAWyC,OACTA,EAAO,MAAM;AAEf,WAAO;EACT;EASA,KAAKnS,GAAMmU,IAA8C,CAAA,GAAE;AACzD,QAAM,EAAE,YAAA7D,IAAa,KAAK,WAAU,IAAK6D,GACnCzE,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,UAAc,CAACY,KAAc,KAAKN,GAASN,CAAK,EAC5D;AAEF,QAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAE7B,WAAO,KAAKD,GAAmBiD,CAAC,IAAIA,EAAE,uBAAuBA;EAC/D;EAEA9C,GACE5P,GACA0P,GACArQ,GACAsQ,GAAY;AAEZ,QAAM+C,IAAIhD,MAAU,SAAY,SAAY,KAAKhB,GAASgB,CAAK;AAC/D,QAAI,KAAKD,GAAmBiD,CAAC,EAC3B,QAAOA;AAGT,QAAM0B,IAAK,IAAItH,MACT,EAAE,QAAAuH,EAAM,IAAKhV;AAEnBgV,OAAQ,iBAAiB,SAAS,MAAMD,EAAG,MAAMC,EAAO,MAAM,GAAG,EAC/D,QAAQD,EAAG,OAAA,CACZ;AAED,QAAME,IAAY,EAChB,QAAQF,EAAG,QACX,SAAA/U,GACA,SAAAsQ,EAAAA,GAGI4E,IAAK,CAAC7B,GAAkB8B,IAAc,UAAwB;AAClE,UAAM,EAAE,SAAAC,EAAO,IAAKL,EAAG,QACjBM,IAAcrV,EAAQ,oBAAoBqT,MAAM,QAChDiC,IAAUtV,EAAQ,oBACtB,CAAC,EAAEA,EAAQ,0BAA0BqT,MAAM;AAU7C,UATIrT,EAAQ,WACNoV,KAAW,CAACD,KACdnV,EAAQ,OAAO,eAAe,MAC9BA,EAAQ,OAAO,aAAa+U,EAAG,OAAO,QAClCM,MAAarV,EAAQ,OAAO,oBAAoB,SAEpDA,EAAQ,OAAO,gBAAgB,OAG/BoV,KAAW,CAACC,KAAe,CAACF,EAC9B,QAAOI,EAAUR,EAAG,OAAO,QAAQO,CAAO;AAG5C,UAAME,IAAK3V,GAIL4V,IAAK,KAAKpG,GAASgB,CAAc;AACvC,cAAIoF,MAAO5V,KAAMwV,KAAeF,KAAeM,MAAO,YAChDpC,MAAM,SACJmC,EAAG,yBAAyB,SAC9B,KAAKnG,GAASgB,CAAc,IAAImF,EAAG,uBAEnC,KAAK7C,GAAQhS,GAAG,OAAO,KAGrBX,EAAQ,WAAQA,EAAQ,OAAO,eAAe,OAClD,KAAK,IAAIW,GAAG0S,GAAG4B,EAAU,OAAO,KAG7B5B;IACT,GAEMqC,IAAMC,QACN3V,EAAQ,WACVA,EAAQ,OAAO,gBAAgB,MAC/BA,EAAQ,OAAO,aAAa2V,IAGvBJ,EAAUI,GAAI,KAAK,IAGtBJ,IAAY,CAACI,GAASL,MAAmC;AAC7D,UAAM,EAAE,SAAAF,EAAO,IAAKL,EAAG,QACjBa,IAAoBR,KAAWpV,EAAQ,wBACvCiR,IACJ2E,KAAqB5V,EAAQ,4BACzB6V,IAAW5E,KAAcjR,EAAQ,0BACjCwV,IAAK3V;AAgBX,UAfI,KAAKwP,GAASgB,CAAc,MAAMxQ,MAGxB,CAACgW,KACX,CAACP,KAAWE,EAAG,yBAAyB,SAExC,KAAK7C,GAAQhS,GAAG,OAAO,IACbiV,MAKV,KAAKvG,GAASgB,CAAc,IAAImF,EAAG,wBAGnCvE,EACF,QAAIjR,EAAQ,UAAUwV,EAAG,yBAAyB,WAChDxV,EAAQ,OAAO,gBAAgB,OAE1BwV,EAAG;AACL,UAAIA,EAAG,eAAeA,EAC3B,OAAMG;IAEV,GAEMG,IAAQ,CACZC,GACAC,MACE;AACF,UAAMC,IAAM,KAAKnH,KAAenO,GAAG0S,GAAG4B,CAAS;AAC3CgB,WAAOA,aAAe,WACxBA,EAAI,KAAK5C,OAAK0C,EAAI1C,MAAM,SAAY,SAAYA,CAAC,GAAG2C,CAAG,GAKzDjB,EAAG,OAAO,iBAAiB,SAAS,MAAK;AAAA,SACnC,CAAC/U,EAAQ,oBAAoBA,EAAQ,4BACvC+V,EAAI,MAAS,GAET/V,EAAQ,2BACV+V,IAAM1C,OAAK6B,EAAG7B,GAAG,IAAI;MAG3B,CAAC;IACH;AAEIrT,MAAQ,WAAQA,EAAQ,OAAO,kBAAkB;AACrD,QAAMH,IAAI,IAAI,QAAQiW,CAAK,EAAE,KAAKZ,GAAIQ,CAAE,GAClCF,IAAyB,OAAO,OAAO3V,GAAG,EAC9C,mBAAmBkV,GACnB,sBAAsB1B,GACtB,YAAY,OAAA,CACb;AAED,WAAIhD,MAAU,UAEZ,KAAK,IAAI1P,GAAG6U,GAAI,EAAE,GAAGP,EAAU,SAAS,QAAQ,OAAS,CAAE,GAC3D5E,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,KAE1B,KAAK0O,GAASgB,CAAK,IAAImF,GAElBA;EACT;EAEApF,GAAmBvQ,GAAM;AACvB,QAAI,CAAC,KAAKoQ,GAAiB,QAAO;AAClC,QAAM7S,IAAIyC;AACV,WACE,CAAC,CAACzC,KACFA,aAAa,WACbA,EAAE,eAAe,sBAAsB,KACvCA,EAAE,6BAA6BqQ;EAEnC;EAyGA,MAAM,MACJ9M,GACAuV,IAAgD,CAAA,GAAE;AAElD,QAAM,EAEJ,YAAAjF,IAAa,KAAK,YAClB,gBAAAF,IAAiB,KAAK,gBACtB,oBAAAc,IAAqB,KAAK,oBAE1B,KAAAjB,IAAM,KAAK,KACX,gBAAAS,IAAiB,KAAK,gBACtB,MAAAnD,IAAO,GACP,iBAAAuD,IAAkB,KAAK,iBACvB,aAAAH,IAAc,KAAK,aAEnB,0BAAAM,IAA2B,KAAK,0BAChC,4BAAAE,IAA6B,KAAK,4BAClC,kBAAAE,IAAmB,KAAK,kBACxB,wBAAAD,IAAyB,KAAK,wBAC9B,SAAAzB,GACA,cAAA6F,IAAe,OACf,QAAArD,GACA,QAAAkC,EAAM,IACJkB;AAEJ,QAAI,CAAC,KAAKjG,GACR,QAAI6C,MAAQA,EAAO,QAAQ,QACpB,KAAK,IAAInS,GAAG,EACjB,YAAAsQ,GACA,gBAAAF,GACA,oBAAAc,GACA,QAAAiB,EAAAA,CACD;AAGH,QAAM9S,IAAU,EACd,YAAAiR,GACA,gBAAAF,GACA,oBAAAc,GACA,KAAAjB,GACA,gBAAAS,GACA,MAAAnD,GACA,iBAAAuD,GACA,aAAAH,GACA,0BAAAM,GACA,4BAAAE,GACA,wBAAAC,GACA,kBAAAC,GACA,QAAAc,GACA,QAAAkC,EAAAA,GAGE3E,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAC9B,QAAI0P,MAAU,QAAW;AACnByC,YAAQA,EAAO,QAAQ;AAC3B,UAAMjT,IAAI,KAAK0Q,GAAiB5P,GAAG0P,GAAOrQ,GAASsQ,CAAO;AAC1D,aAAQzQ,EAAE,aAAaA;IACzB,OAAO;AAEL,UAAMwT,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UAAI,KAAKD,GAAmBiD,CAAC,GAAG;AAC9B,YAAM+C,IAAQnF,KAAcoC,EAAE,yBAAyB;AACvD,eAAIP,MACFA,EAAO,QAAQ,YACXsD,MAAOtD,EAAO,gBAAgB,QAE7BsD,IAAQ/C,EAAE,uBAAwBA,EAAE,aAAaA;MAC1D;AAIA,UAAMgD,IAAU,KAAK1F,GAASN,CAAK;AACnC,UAAI,CAAC8F,KAAgB,CAACE,EACpB,QAAIvD,MAAQA,EAAO,QAAQ,QAC3B,KAAKtC,GAAYH,CAAK,GAClBU,KACF,KAAK6B,GAAevC,CAAK,GAEvByC,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,GAClCgD;AAKT,UAAMxT,IAAI,KAAK0Q,GAAiB5P,GAAG0P,GAAOrQ,GAASsQ,CAAO,GAEpDgG,IADWzW,EAAE,yBAAyB,UACfoR;AAC7B,aAAI6B,MACFA,EAAO,QAAQuD,IAAU,UAAU,WAC/BC,KAAYD,MAASvD,EAAO,gBAAgB,QAE3CwD,IAAWzW,EAAE,uBAAwBA,EAAE,aAAaA;IAC7D;EACF;EA8BA,MAAM,WACJc,GACAuV,IAAgD,CAAA,GAAE;AAElD,QAAM7C,IAAI,MAAM,KAAK,MACnB1S,GACAuV,CAE4C;AAE9C,QAAI7C,MAAM,OAAW,OAAM,IAAI,MAAM,4BAA4B;AACjE,WAAOA;EACT;EA+BA,KAAK1S,GAAM4V,IAA8C,CAAA,GAAE;AACzD,QAAM5E,IAAa,KAAK5C;AACxB,QAAI,CAAC4C,EACH,OAAM,IAAI,MAAM,uCAAuC;AAEzD,QAAM,EAAE,SAAArB,GAAS,cAAA6F,GAAc,GAAGnW,EAAO,IAAKuW,GACxClD,IAAI,KAAK,IAAI1S,GAAGX,CAAO;AAC7B,QAAI,CAACmW,KAAgB9C,MAAM,OAAW,QAAOA;AAC7C,QAAMmD,IAAK7E,EAAWhR,GAAG0S,GAAG,EAC1B,SAAArT,GACA,SAAAsQ,EAAAA,CACqC;AACvC,WAAA,KAAK,IAAI3P,GAAG6V,GAAIxW,CAAO,GAChBwW;EACT;EAQA,IAAI7V,GAAMmT,IAA4C,CAAA,GAAE;AACtD,QAAM,EACJ,YAAA7C,IAAa,KAAK,YAClB,gBAAAF,IAAiB,KAAK,gBACtB,oBAAAc,IAAqB,KAAK,oBAC1B,QAAAiB,EAAM,IACJgB,GACEzD,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,QAAI0P,MAAU,QAAW;AACvB,UAAM0D,IAAQ,KAAK1E,GAASgB,CAAK,GAC3BoG,IAAW,KAAKrG,GAAmB2D,CAAK;AAE9C,aADIjB,KAAQ,KAAKD,GAAWC,GAAQzC,CAAK,GACrC,KAAKM,GAASN,CAAK,KACjByC,MAAQA,EAAO,MAAM,UAEpB2D,KAQD3D,KACA7B,KACA8C,EAAM,yBAAyB,WAE/BjB,EAAO,gBAAgB,OAElB7B,IAAa8C,EAAM,uBAAuB,WAb5ClC,KACH,KAAKc,GAAQhS,GAAG,QAAQ,GAEtBmS,KAAU7B,MAAY6B,EAAO,gBAAgB,OAC1C7B,IAAa8C,IAAQ,YAY1BjB,MAAQA,EAAO,MAAM,QAMrB2D,IACK1C,EAAM,wBAEf,KAAKvD,GAAYH,CAAK,GAClBU,KACF,KAAK6B,GAAevC,CAAK,GAEpB0D;IAEX,MAAWjB,OACTA,EAAO,MAAM;EAEjB;EAEA4D,GAAS7W,GAAUoB,GAAQ;AACzB,SAAKsO,GAAMtO,CAAC,IAAIpB,GAChB,KAAKyP,GAAMzP,CAAC,IAAIoB;EAClB;EAEAuP,GAAYH,GAAY;AASlBA,UAAU,KAAKZ,OACbY,MAAU,KAAKb,KACjB,KAAKA,KAAQ,KAAKF,GAAMe,CAAK,IAE7B,KAAKqG,GACH,KAAKnH,GAAMc,CAAK,GAChB,KAAKf,GAAMe,CAAK,CAAU,GAG9B,KAAKqG,GAAS,KAAKjH,IAAOY,CAAK,GAC/B,KAAKZ,KAAQY;EAEjB;EAOA,OAAO1P,GAAI;AACT,WAAO,KAAKgS,GAAQhS,GAAG,QAAQ;EACjC;EAEAgS,GAAQhS,GAAMiN,GAA8B;AAC1C,QAAIqG,IAAU;AACd,QAAI,KAAKhF,OAAU,GAAG;AACpB,UAAMoB,IAAQ,KAAKlB,GAAQ,IAAIxO,CAAC;AAChC,UAAI0P,MAAU,OAMZ,KALI,KAAKN,KAAmBM,CAAK,MAC/B,aAAa,KAAKN,KAAmBM,CAAK,CAAC,GAC3C,KAAKN,GAAiBM,CAAK,IAAI,SAEjC4D,IAAU,MACN,KAAKhF,OAAU,EACjB,MAAK0H,GAAO/I,CAAM;WACb;AACL,aAAKuF,GAAgB9C,CAAK;AAC1B,YAAMgD,IAAI,KAAKhE,GAASgB,CAAK;AAc7B,YAbI,KAAKD,GAAmBiD,CAAC,IAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KACrC,KAAKrD,MAAe,KAAKE,QAC9B,KAAKF,MACP,KAAKrB,KAAW0E,GAAQ1S,GAAGiN,CAAM,GAE/B,KAAKsC,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAQ1S,GAAGiN,CAAM,CAAC,IAG5C,KAAKuB,GAAQ,OAAOxO,CAAC,GACrB,KAAKyO,GAASiB,CAAK,IAAI,QACvB,KAAKhB,GAASgB,CAAK,IAAI,QACnBA,MAAU,KAAKZ,GACjB,MAAKA,KAAQ,KAAKF,GAAMc,CAAK;iBACpBA,MAAU,KAAKb,GACxB,MAAKA,KAAQ,KAAKF,GAAMe,CAAK;aACxB;AACL,cAAMhE,IAAK,KAAKkD,GAAMc,CAAK;AAC3B,eAAKf,GAAMjD,CAAE,IAAI,KAAKiD,GAAMe,CAAK;AACjC,cAAMuG,IAAK,KAAKtH,GAAMe,CAAK;AAC3B,eAAKd,GAAMqH,CAAE,IAAI,KAAKrH,GAAMc,CAAK;QACnC;AACA,aAAKpB,MACL,KAAKS,GAAM,KAAKW,CAAK;MACvB;IAEJ;AACA,QAAI,KAAKH,MAAoB,KAAKP,IAAW,QAAQ;AACnD,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;AACA,WAAOR;EACT;EAKA,QAAK;AACH,WAAO,KAAK0C,GAAO,QAAQ;EAC7B;EACAA,GAAO/I,GAA8B;AACnC,aAAWyC,KAAS,KAAKK,GAAU,EAAE,YAAY,KAAI,CAAE,GAAG;AACxD,UAAM2C,IAAI,KAAKhE,GAASgB,CAAK;AAC7B,UAAI,KAAKD,GAAmBiD,CAAC,EAC3BA,GAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;WACzC;AACL,YAAM1S,IAAI,KAAKyO,GAASiB,CAAK;AACzB,aAAKL,MACP,KAAKrB,KAAW0E,GAAQ1S,GAAQiN,CAAM,GAEpC,KAAKsC,MACP,KAAKP,IAAW,KAAK,CAAC0D,GAAQ1S,GAAQiN,CAAM,CAAC;MAEjD;IACF;AAKA,QAHA,KAAKuB,GAAQ,MAAK,GAClB,KAAKE,GAAS,KAAK,MAAS,GAC5B,KAAKD,GAAS,KAAK,MAAS,GACxB,KAAKU,MAAS,KAAKD,IAAS;AAC9B,WAAKC,GAAM,KAAK,CAAC,GACjB,KAAKD,GAAQ,KAAK,CAAC;AACnB,eAAW6C,KAAK,KAAK3C,MAAoB,CAAA,EACnC2C,OAAM,UAAW,aAAaA,CAAC;AAErC,WAAK3C,IAAkB,KAAK,MAAS;IACvC;AASA,QARI,KAAKH,MACP,KAAKA,GAAO,KAAK,CAAC,GAEpB,KAAKJ,KAAQ,GACb,KAAKC,KAAQ,GACb,KAAKC,GAAM,SAAS,GACpB,KAAKR,KAAkB,GACvB,KAAKD,KAAQ,GACT,KAAKiB,MAAoB,KAAKP,IAAW;AAC3C,UAAM6E,IAAK,KAAK7E,IACZ8E;AACJ,aAAQA,IAAOD,GAAI,MAAK,IACtB,MAAK3F,KAAgB,GAAG4F,CAAI;IAEhC;EACF;AAAA;AEz4FF,IAAMoC,KACJ,OAAO,WAAY,YAAY,UAC3B,UACA,EACE,QAAQ,MACR,QAAQ,KAAA;AALhB,IAsBaC,KACX9U,CAAAA,OAEA,CAAC,CAACA,MACF,OAAOA,MAAM,aACZA,cAAa+U,KACZ/U,cAAagV,mBAAAA,WACbC,GAAWjV,EAAC,KACZkV,GAAWlV,EAAC;AA9BhB,IAmCaiV,KAAcjV,CAAAA,OACzB,CAAC,CAACA,MACF,OAAOA,MAAM,YACbA,cAAamV,mBAAAA,gBACb,OAAQnV,GAAwB,QAAS,cAExCA,GAAwB,SAASgV,mBAAAA,QAAO,SAAS,UAAU;AAzC9D,IA8CaE,KAAclV,CAAAA,OACzB,CAAC,CAACA,MACF,OAAOA,MAAM,YACbA,cAAamV,mBAAAA,gBACb,OAAQnV,GAAwB,SAAU,cAC1C,OAAQA,GAAwB,OAAQ;AAnD1C,IAqDMoV,IAAM,uBAAO,KAAK;AArDxB,IAsDMC,IAAiB,uBAAO,cAAc;AAtD5C,IAuDMC,IAAc,uBAAO,YAAY;AAvDvC,IAwDMC,KAAe,uBAAO,aAAa;AAxDzC,IAyDMC,KAAgB,uBAAO,cAAc;AAzD3C,IA0DMC,KAAS,uBAAO,QAAQ;AA1D9B,IA2DMC,KAAO,uBAAO,MAAM;AA3D1B,IA4DMC,KAAQ,uBAAO,OAAO;AA5D5B,IA6DMC,KAAa,uBAAO,YAAY;AA7DtC,IA8DMC,IAAW,uBAAO,UAAU;AA9DlC,IA+DMC,KAAU,uBAAO,SAAS;AA/DhC,IAgEMC,IAAU,uBAAO,SAAS;AAhEhC,IAiEMC,KAAS,uBAAO,QAAQ;AAjE9B,IAkEMC,KAAS,uBAAO,QAAQ;AAlE9B,IAmEMC,IAAS,uBAAO,QAAQ;AAnE9B,IAoEMC,IAAQ,uBAAO,OAAO;AApE5B,IAqEMC,IAAe,uBAAO,cAAc;AArE1C,IAsEMC,KAAa,uBAAO,YAAY;AAtEtC,IAuEMC,KAAc,uBAAO,aAAa;AAvExC,IAwEMC,IAAa,uBAAO,YAAY;AAxEtC,IA0EMC,IAAY,uBAAO,WAAW;AA1EpC,IA4EMC,KAAQ,uBAAO,OAAO;AA5E5B,IA6EMC,KAAW,uBAAO,UAAU;AA7ElC,IA8EMC,KAAU,uBAAO,SAAS;AA9EhC,IA+EMC,KAAW,uBAAO,UAAU;AA/ElC,IAgFMC,IAAQ,uBAAO,OAAO;AAhF5B,IAiFMC,KAAQ,uBAAO,OAAO;AAjF5B,IAkFMC,KAAU,uBAAO,SAAS;AAlFhC,IAmFMC,KAAS,uBAAO,QAAQ;AAnF9B,IAoFMC,IAAgB,uBAAO,eAAe;AApF5C,IAqFMC,IAAY,uBAAO,WAAW;AArFpC,IAuFMC,KAAS3L,CAAAA,OAA6B,QAAQ,QAAO,EAAG,KAAKA,EAAE;AAvFrE,IAwFM4L,KAAW5L,CAAAA,OAA6BA,GAAE;AAxFhD,IA8FM6L,KAAYC,CAAAA,OAChBA,OAAO,SAASA,OAAO,YAAYA,OAAO;AA/F5C,IAiGMC,KAAqBnc,CAAAA,OACzBA,cAAa,eACZ,CAAC,CAACA,MACD,OAAOA,MAAM,YACbA,GAAE,eACFA,GAAE,YAAY,SAAS,iBACvBA,GAAE,cAAc;AAvGpB,IAyGMoc,KAAqBpc,CAAAA,OACzB,CAAC,OAAO,SAASA,EAAC,KAAK,YAAY,OAAOA,EAAC;AA1G7C,IA+HMqc,KAAN,MAAU;EACR;EACA;EACA;EACA;EACA,YACEnT,GACAoT,GACAC,GACA;AACA,SAAK,MAAMrT,GACX,KAAK,OAAOoT,GACZ,KAAK,OAAOC,GACZ,KAAK,UAAU,MAAMrT,EAAI2R,EAAM,EAAC,GAChC,KAAK,KAAK,GAAG,SAAS,KAAK,OAAO;EAAC;EAErC,SAAS;AACP,SAAK,KAAK,eAAe,SAAS,KAAK,OAAO;EAAC;EAIjD,YAAY2B,GAAU;EAAC;EAEvB,MAAM;AACJ,SAAK,OAAM,GACP,KAAK,KAAK,OAAK,KAAK,KAAK,IAAG;EAAE;AAAA;AAxJtC,IAkKMC,KAAN,cAAiCJ,GAAO;EACtC,SAAS;AACP,SAAK,IAAI,eAAe,SAAS,KAAK,WAAW,GACjD,MAAM,OAAM;EAAE;EAEhB,YACEnT,GACAoT,GACAC,GACA;AACA,UAAMrT,GAAKoT,GAAMC,CAAI,GACrB,KAAK,cAAehE,OAAc,KAAK,KAAK,KAAK,SAASA,CAAE,GAC5DrP,EAAI,GAAG,SAAS,KAAK,WAAW;EAAC;AAAA;AA9KrC,IA6TMwT,KACJC,CAAAA,OACoC,CAAC,CAACA,GAAE;AA/T1C,IAiUMC,KACJD,CAAAA,OAEA,CAACA,GAAE,cAAc,CAAC,CAACA,GAAE,YAAYA,GAAE,aAAa;AApUlD,IAiVahD,IAAP,cAOII,mBAAAA,aAAY;EAGpB,CAACY,CAAO,IAAa;EACrB,CAACC,EAAM,IAAa;EACpB,CAACG,CAAK,IAAmB,CAAA;EACzB,CAACD,CAAM,IAAa,CAAA;EACpB,CAACK,CAAU;EACX,CAACV,CAAQ;EACT,CAACgB,CAAK;EACN,CAACf,EAAO;EACR,CAACV,CAAG,IAAa;EACjB,CAACE,CAAW,IAAa;EACzB,CAACC,EAAY,IAAa;EAC1B,CAACE,EAAM,IAAa;EACpB,CAACD,EAAa,IAAa;EAC3B,CAACY,CAAY,IAAY;EACzB,CAACI,CAAS,IAAa;EACvB,CAACQ,EAAM;EACP,CAACD,EAAO,IAAa;EACrB,CAACE,CAAa,IAAY;EAC1B,CAACC,CAAS,IAAa;EAKvB,WAAoB;EAIpB,WAAoB;EAQpB,eACK9O,GAKH;AACA,QAAMpK,IAAoCoK,EAAK,CAAC,KAC9C,CAAA;AAEF,QADA,MAAK,GACDpK,EAAQ,cAAc,OAAOA,EAAQ,YAAa,SACpD,OAAM,IAAI,UACR,kDAAkD;AAGlD8Z,OAAoB9Z,CAAO,KAC7B,KAAKuY,CAAU,IAAI,MACnB,KAAKV,CAAQ,IAAI,QACRmC,GAAkBha,CAAO,KAClC,KAAK6X,CAAQ,IAAI7X,EAAQ,UACzB,KAAKuY,CAAU,IAAI,UAEnB,KAAKA,CAAU,IAAI,OACnB,KAAKV,CAAQ,IAAI,OAEnB,KAAKgB,CAAK,IAAI,CAAC,CAAC7Y,EAAQ,OACxB,KAAK8X,EAAO,IAAI,KAAKD,CAAQ,IACxB,IAAIoC,2BAAAA,cAAc,KAAKpC,CAAQ,CAAC,IACjC,MAGA7X,KAAWA,EAAQ,sBAAsB,QAC3C,OAAO,eAAe,MAAM,UAAU,EAAE,KAAK,MAAM,KAAKkY,CAAM,EAAC,CAAE,GAG/DlY,KAAWA,EAAQ,qBAAqB,QAC1C,OAAO,eAAe,MAAM,SAAS,EAAE,KAAK,MAAM,KAAKmY,CAAK,EAAC,CAAE;AAGjE,QAAM,EAAE,QAAAnD,EAAM,IAAKhV;AACfgV,UACF,KAAKgE,EAAM,IAAIhE,GACXA,EAAO,UACT,KAAK8D,EAAK,EAAC,IAEX9D,EAAO,iBAAiB,SAAS,MAAM,KAAK8D,EAAK,EAAC,CAAE;EAEvD;EAYH,IAAI,eAAe;AACjB,WAAO,KAAKV,CAAY;EAAC;EAM3B,IAAI,WAAW;AACb,WAAO,KAAKP,CAAQ;EAAC;EAMvB,IAAI,SAASqC,GAAM;AACjB,UAAM,IAAI,MAAM,4CAA4C;EAAC;EAM/D,YAAYA,GAAyB;AACnC,UAAM,IAAI,MAAM,4CAA4C;EAAC;EAM/D,IAAI,aAAa;AACf,WAAO,KAAK3B,CAAU;EAAC;EAMzB,IAAI,WAAW4B,GAAK;AAClB,UAAM,IAAI,MAAM,8CAA8C;EAAC;EAMjE,IAAK,QAAoB;AACvB,WAAO,KAAKtB,CAAK;EAAC;EASpB,IAAK,MAAS1b,GAAY;AACxB,SAAK0b,CAAK,IAAI,KAAKA,CAAK,KAAK,CAAC,CAAC1b;EAAC;EAIlC,CAAC2b,EAAK,IAAI;AACR,SAAKC,EAAO,IAAI,MAChB,KAAK,KAAK,SAAS,KAAKC,EAAM,GAAG,MAAM,GACvC,KAAK,QAAQ,KAAKA,EAAM,GAAG,MAAM;EAAC;EAMpC,IAAI,UAAU;AACZ,WAAO,KAAKD,EAAO;EAAC;EAMtB,IAAI,QAAQxS,GAAG;EAAC;EA0BhB,MACE6T,GACAC,GACAnF,GACS;AACT,QAAI,KAAK6D,EAAO,EAAG,QAAO;AAC1B,QAAI,KAAK3B,CAAG,EAAG,OAAM,IAAI,MAAM,iBAAiB;AAEhD,QAAI,KAAKoB,CAAS,EAChB,QAAA,KAAK,KACH,SACA,OAAO,OACL,IAAI,MAAM,gDAAgD,GAC1D,EAAE,MAAM,uBAAsB,CAAE,CACjC,GAEI;AAGL,WAAO6B,KAAa,eACtBnF,IAAKmF,GACLA,IAAW,SAGRA,MAAUA,IAAW;AAE1B,QAAM7M,IAAK,KAAKqL,CAAK,IAAIM,KAAQC;AAMjC,QAAI,CAAC,KAAKb,CAAU,KAAK,CAAC,OAAO,SAAS6B,CAAK,GAAA;AAC7C,UAAIZ,GAAkBY,CAAK,EAEzBA,KAAQ,OAAO,KACbA,EAAM,QACNA,EAAM,YACNA,EAAM,UAAU;eAETb,GAAkBa,CAAK,EAEhCA,KAAQ,OAAO,KAAKA,CAAK;eAChB,OAAOA,KAAU,SAC1B,OAAM,IAAI,MACR,sDAAsD;IAAA;AAO5D,WAAI,KAAK7B,CAAU,KAGb,KAAKR,CAAO,KAAK,KAAKK,CAAY,MAAM,KAAG,KAAKT,EAAK,EAAE,IAAI,GAG3D,KAAKI,CAAO,IAAG,KAAK,KAAK,QAAQqC,CAAyB,IACzD,KAAK/B,EAAU,EAAE+B,CAAyB,GAE3C,KAAKhC,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAE9ClD,KAAI1H,EAAG0H,CAAE,GAEN,KAAK6C,CAAO,KAKfqC,EAAkC,UAStC,OAAOA,KAAU,YAEjB,EAAEC,MAAa,KAAKxC,CAAQ,KAAK,CAAC,KAAKC,EAAO,GAAG,cAGjDsC,IAAQ,OAAO,KAAKA,GAAOC,CAAQ,IAGjC,OAAO,SAASD,CAAK,KAAK,KAAKvC,CAAQ,MAEzCuC,IAAQ,KAAKtC,EAAO,EAAE,MAAMsC,CAAK,IAI/B,KAAKrC,CAAO,KAAK,KAAKK,CAAY,MAAM,KAAG,KAAKT,EAAK,EAAE,IAAI,GAE3D,KAAKI,CAAO,IAAG,KAAK,KAAK,QAAQqC,CAAyB,IACzD,KAAK/B,EAAU,EAAE+B,CAAyB,GAE3C,KAAKhC,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAE9ClD,KAAI1H,EAAG0H,CAAE,GAEN,KAAK6C,CAAO,MA/Bb,KAAKK,CAAY,MAAM,KAAG,KAAK,KAAK,UAAU,GAC9ClD,KAAI1H,EAAG0H,CAAE,GACN,KAAK6C,CAAO;EA6BD;EAgBtB,KAAK9W,GAAiC;AACpC,QAAI,KAAKuX,CAAS,EAAG,QAAO;AAG5B,QAFA,KAAKU,CAAS,IAAI,OAGhB,KAAKd,CAAY,MAAM,KACvBnX,MAAM,KACLA,KAAKA,IAAI,KAAKmX,CAAY,EAE3B,QAAA,KAAKf,CAAc,EAAC,GACb;AAGL,SAAKkB,CAAU,MAAGtX,IAAI,OAEtB,KAAKiX,CAAM,EAAE,SAAS,KAAK,CAAC,KAAKK,CAAU,MAG7C,KAAKL,CAAM,IAAI,CACZ,KAAKL,CAAQ,IACV,KAAKK,CAAM,EAAE,KAAK,EAAE,IACpB,OAAO,OACL,KAAKA,CAAM,GACX,KAAKE,CAAY,CAAC,CAAA;AAK5B,QAAM9S,IAAM,KAAKoS,EAAI,EAAEzW,KAAK,MAAM,KAAKiX,CAAM,EAAE,CAAC,CAAU;AAC1D,WAAA,KAAKb,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACoS,EAAI,EAAEzW,GAAkBmZ,GAAc;AACrC,QAAI,KAAK7B,CAAU,EAAG,MAAKD,EAAW,EAAC;SAClC;AACH,UAAM9W,IAAI4Y;AACNnZ,YAAMO,EAAE,UAAUP,MAAM,OAAM,KAAKqX,EAAW,EAAC,IAC1C,OAAO9W,KAAM,YACpB,KAAK0W,CAAM,EAAE,CAAC,IAAI1W,EAAE,MAAMP,CAAC,GAC3BmZ,IAAQ5Y,EAAE,MAAM,GAAGP,CAAC,GACpB,KAAKmX,CAAY,KAAKnX,MAEtB,KAAKiX,CAAM,EAAE,CAAC,IAAI1W,EAAE,SAASP,CAAC,GAC9BmZ,IAAQ5Y,EAAE,SAAS,GAAGP,CAAC,GACvB,KAAKmX,CAAY,KAAKnX;IAE1B;AAEA,WAAA,KAAK,KAAK,QAAQmZ,CAAK,GAEnB,CAAC,KAAKlC,CAAM,EAAE,UAAU,CAAC,KAAKd,CAAG,KAAG,KAAK,KAAK,OAAO,GAElDgD;EAAK;EAWd,IACEA,GACAC,GACAnF,GACM;AACN,WAAI,OAAOkF,KAAU,eACnBlF,IAAKkF,GACLA,IAAQ,SAEN,OAAOC,KAAa,eACtBnF,IAAKmF,GACLA,IAAW,SAETD,MAAU,UAAW,KAAK,MAAMA,GAAOC,CAAQ,GAC/CnF,KAAI,KAAK,KAAK,OAAOA,CAAE,GAC3B,KAAKkC,CAAG,IAAI,MACZ,KAAK,WAAW,QAMZ,KAAKW,CAAO,KAAK,CAAC,KAAKC,EAAM,MAAG,KAAKX,CAAc,EAAC,GACjD;EAAI;EAIb,CAACY,EAAM,IAAI;AACL,SAAKO,CAAS,MAEd,CAAC,KAAKS,CAAa,KAAK,CAAC,KAAKd,CAAK,EAAE,WACvC,KAAKe,CAAS,IAAI,OAEpB,KAAKlB,EAAM,IAAI,OACf,KAAKD,CAAO,IAAI,MAChB,KAAK,KAAK,QAAQ,GACd,KAAKG,CAAM,EAAE,SAAQ,KAAKP,EAAK,EAAC,IAC3B,KAAKP,CAAG,IAAG,KAAKC,CAAc,EAAC,IACnC,KAAK,KAAK,OAAO;EAAC;EAYzB,SAAS;AACP,WAAO,KAAKY,EAAM,EAAC;EAAE;EAMvB,QAAQ;AACN,SAAKF,CAAO,IAAI,OAChB,KAAKC,EAAM,IAAI,MACf,KAAKkB,CAAS,IAAI;EAAK;EAMzB,IAAI,YAAY;AACd,WAAO,KAAKV,CAAS;EAAC;EAOxB,IAAI,UAAU;AACZ,WAAO,KAAKT,CAAO;EAAC;EAMtB,IAAI,SAAS;AACX,WAAO,KAAKC,EAAM;EAAC;EAGrB,CAACK,EAAU,EAAE+B,GAAc;AACrB,SAAK7B,CAAU,IAAG,KAAKH,CAAY,KAAK,IACvC,KAAKA,CAAY,KAAMgC,EAAkC,QAC9D,KAAKlC,CAAM,EAAE,KAAKkC,CAAK;EAAC;EAG1B,CAAC9B,EAAW,IAAW;AACrB,WAAI,KAAKC,CAAU,IAAG,KAAKH,CAAY,KAAK,IAE1C,KAAKA,CAAY,KACf,KAAKF,CAAM,EAAE,CAAC,EACd,QACG,KAAKA,CAAM,EAAE,MAAK;EAAW;EAGtC,CAACP,EAAK,EAAE2C,IAAmB,OAAO;AAChC;AAAG;WACD,KAAK1C,EAAU,EAAE,KAAKU,EAAW,EAAC,CAAE,KACpC,KAAKJ,CAAM,EAAE;AAGX,KAACoC,KAAW,CAAC,KAAKpC,CAAM,EAAE,UAAU,CAAC,KAAKd,CAAG,KAAG,KAAK,KAAK,OAAO;EAAC;EAGxE,CAACQ,EAAU,EAAEwC,GAAc;AACzB,WAAA,KAAK,KAAK,QAAQA,CAAK,GAChB,KAAKrC,CAAO;EAAC;EAQtB,KAAkC2B,GAASC,GAAuB;AAChE,QAAI,KAAKnB,CAAS,EAAG,QAAOkB;AAC5B,SAAKR,CAAS,IAAI;AAElB,QAAMqB,IAAQ,KAAKjD,CAAW;AAC9B,WAAAqC,IAAOA,KAAQ,CAAA,GACXD,MAAS7C,GAAK,UAAU6C,MAAS7C,GAAK,SAAQ8C,EAAK,MAAM,QACxDA,EAAK,MAAMA,EAAK,QAAQ,OAC7BA,EAAK,cAAc,CAAC,CAACA,EAAK,aAGtBY,IACEZ,EAAK,OAAKD,EAAK,IAAG,KAItB,KAAKvB,CAAK,EAAE,KACTwB,EAAK,cAEF,IAAIE,GAAuB,MAAyBH,GAAMC,CAAI,IAD9D,IAAIF,GAAY,MAAyBC,GAAMC,CAAI,CACY,GAEjE,KAAKd,CAAK,IAAGM,GAAM,MAAM,KAAKlB,EAAM,EAAC,CAAE,IACtC,KAAKA,EAAM,EAAC,IAGZyB;EAAI;EAWb,OAAoCA,GAAS;AAC3C,QAAM7Z,IAAI,KAAKsY,CAAK,EAAE,KAAKtY,OAAKA,EAAE,SAAS6Z,CAAI;AAC3C7Z,UACE,KAAKsY,CAAK,EAAE,WAAW,KACrB,KAAKJ,CAAO,KAAK,KAAKkB,CAAa,MAAM,MAC3C,KAAKlB,CAAO,IAAI,QAElB,KAAKI,CAAK,IAAI,CAAA,KACT,KAAKA,CAAK,EAAE,OAAO,KAAKA,CAAK,EAAE,QAAQtY,CAAC,GAAG,CAAC,GACnDA,EAAE,OAAM;EACT;EAMH,YACEyZ,GACAkB,GACM;AACN,WAAO,KAAK,GAAGlB,GAAIkB,CAAO;EAAC;EAoB7B,GACElB,GACAkB,GACM;AACN,QAAMlV,IAAM,MAAM,GAChBgU,GACAkB,CAA+B;AAEjC,QAAIlB,MAAO,OACT,MAAKJ,CAAS,IAAI,OAClB,KAAKD,CAAa,KACd,CAAC,KAAKd,CAAK,EAAE,UAAU,CAAC,KAAKJ,CAAO,KACtC,KAAKE,EAAM,EAAC;aAELqB,MAAO,cAAc,KAAKlB,CAAY,MAAM,EACrD,OAAM,KAAK,UAAU;aACZiB,GAASC,CAAE,KAAK,KAAKhC,CAAW,EACzC,OAAM,KAAKgC,CAAE,GACb,KAAK,mBAAmBA,CAAE;aACjBA,MAAO,WAAW,KAAK9B,EAAa,GAAG;AAChD,UAAMiD,IAAID;AACN,WAAK3B,CAAK,IAAGM,GAAM,MAAMsB,EAAE,KAAK,MAAM,KAAKjD,EAAa,CAAC,CAAC,IACzDiD,EAAE,KAAK,MAAM,KAAKjD,EAAa,CAAC;IACvC;AACA,WAAOlS;EAAG;EAMZ,eACEgU,GACAkB,GACA;AACA,WAAO,KAAK,IAAIlB,GAAIkB,CAAO;EAAC;EAW9B,IACElB,GACAkB,GACA;AACA,QAAMlV,IAAM,MAAM,IAChBgU,GACAkB,CAA+B;AAKjC,WAAIlB,MAAO,WACT,KAAKL,CAAa,IAAI,KAAK,UAAU,MAAM,EAAE,QAE3C,KAAKA,CAAa,MAAM,KACxB,CAAC,KAAKC,CAAS,KACf,CAAC,KAAKf,CAAK,EAAE,WAEb,KAAKJ,CAAO,IAAI,SAGbzS;EAAG;EAWZ,mBAA+CgU,GAAY;AACzD,QAAMhU,IAAM,MAAM,mBAAmBgU,CAAiC;AACtE,YAAIA,MAAO,UAAUA,MAAO,YAC1B,KAAKL,CAAa,IAAI,GAClB,CAAC,KAAKC,CAAS,KAAK,CAAC,KAAKf,CAAK,EAAE,WACnC,KAAKJ,CAAO,IAAI,SAGbzS;EAAG;EAMZ,IAAI,aAAa;AACf,WAAO,KAAKgS,CAAW;EAAC;EAG1B,CAACD,CAAc,IAAI;AAEf,KAAC,KAAKE,EAAY,KAClB,CAAC,KAAKD,CAAW,KACjB,CAAC,KAAKkB,CAAS,KACf,KAAKN,CAAM,EAAE,WAAW,KACxB,KAAKd,CAAG,MAER,KAAKG,EAAY,IAAI,MACrB,KAAK,KAAK,KAAK,GACf,KAAK,KAAK,WAAW,GACrB,KAAK,KAAK,QAAQ,GACd,KAAKE,EAAM,KAAG,KAAK,KAAK,OAAO,GACnC,KAAKF,EAAY,IAAI;EACtB;EA2BH,KACE+B,MACGlP,GACM;AACT,QAAMsQ,IAAOtQ,EAAK,CAAC;AAEnB,QACEkP,MAAO,WACPA,MAAO,WACPA,MAAOd,KACP,KAAKA,CAAS,EAEd,QAAO;AACF,QAAIc,MAAO,OAChB,QAAO,CAAC,KAAKf,CAAU,KAAK,CAACmC,IACzB,QACA,KAAK7B,CAAK,KACTM,GAAM,MAAM,KAAKT,EAAQ,EAAEgC,CAAa,CAAC,GAAG,QAC7C,KAAKhC,EAAQ,EAAEgC,CAAa;AAC3B,QAAIpB,MAAO,MAChB,QAAO,KAAKX,EAAO,EAAC;AACf,QAAIW,MAAO,SAAS;AAGzB,UAFA,KAAK7B,EAAM,IAAI,MAEX,CAAC,KAAKH,CAAW,KAAK,CAAC,KAAKkB,CAAS,EAAG,QAAO;AACnD,UAAMlT,IAAM,MAAM,KAAK,OAAO;AAC9B,aAAA,KAAK,mBAAmB,OAAO,GACxBA;IACT,WAAWgU,MAAO,SAAS;AACzB,WAAK9B,EAAa,IAAIkD,GACtB,MAAM,KAAKjC,IAAOiC,CAAI;AACtB,UAAMpV,IACJ,CAAC,KAAK0T,EAAM,KAAK,KAAK,UAAU,OAAO,EAAE,SACrC,MAAM,KAAK,SAAS0B,CAAI,IACxB;AACN,aAAA,KAAKrD,CAAc,EAAC,GACb/R;IACT,WAAWgU,MAAO,UAAU;AAC1B,UAAMhU,IAAM,MAAM,KAAK,QAAQ;AAC/B,aAAA,KAAK+R,CAAc,EAAC,GACb/R;IACT,WAAWgU,MAAO,YAAYA,MAAO,aAAa;AAChD,UAAMhU,IAAM,MAAM,KAAKgU,CAAE;AACzB,aAAA,KAAK,mBAAmBA,CAAE,GACnBhU;IACT;AAGA,QAAMA,IAAM,MAAM,KAAKgU,GAAc,GAAGlP,CAAI;AAC5C,WAAA,KAAKiN,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACoT,EAAQ,EAAEgC,GAAa;AACtB,aAAW7a,KAAK,KAAKsY,CAAK,EACpBtY,GAAE,KAAK,MAAM6a,CAAa,MAAM,SAAO,KAAK,MAAK;AAEvD,QAAMpV,IAAM,KAAK4T,CAAS,IAAI,QAAQ,MAAM,KAAK,QAAQwB,CAAI;AAC7D,WAAA,KAAKrD,CAAc,EAAC,GACb/R;EAAG;EAGZ,CAACqT,EAAO,IAAI;AACV,WAAI,KAAKrB,CAAW,IAAU,SAE9B,KAAKA,CAAW,IAAI,MACpB,KAAK,WAAW,OACT,KAAKuB,CAAK,KACZM,GAAM,MAAM,KAAKP,EAAQ,EAAC,CAAE,GAAG,QAChC,KAAKA,EAAQ,EAAC;EAAE;EAGtB,CAACA,EAAQ,IAAI;AACX,QAAI,KAAKd,EAAO,GAAG;AACjB,UAAM4C,IAAO,KAAK5C,EAAO,EAAE,IAAG;AAC9B,UAAI4C,GAAM;AACR,iBAAW7a,KAAK,KAAKsY,CAAK,EACxBtY,GAAE,KAAK,MAAM6a,CAAa;AAEvB,aAAKxB,CAAS,KAAG,MAAM,KAAK,QAAQwB,CAAI;MAC/C;IACF;AAEA,aAAW7a,KAAK,KAAKsY,CAAK,EACxBtY,GAAE,IAAG;AAEP,QAAMyF,IAAM,MAAM,KAAK,KAAK;AAC5B,WAAA,KAAK,mBAAmB,KAAK,GACtBA;EAAG;EAOZ,MAAM,UAAqD;AACzD,QAAMqV,IAAwC,OAAO,OAAO,CAAA,GAAI,EAC9D,YAAY,EAAA,CACb;AACI,SAAKpC,CAAU,MAAGoC,EAAI,aAAa;AAGxC,QAAM9a,IAAI,KAAK,QAAO;AACtB,WAAA,KAAK,GAAG,QAAQ2B,OAAK;AACnBmZ,QAAI,KAAKnZ,CAAC,GACL,KAAK+W,CAAU,MAClBoC,EAAI,cAAenZ,EAA8B;IAAM,CAC1D,GACD,MAAM3B,GACC8a;EAAG;EASZ,MAAM,SAAyB;AAC7B,QAAI,KAAKpC,CAAU,EACjB,OAAM,IAAI,MAAM,6BAA6B;AAE/C,QAAMoC,IAAM,MAAM,KAAK,QAAO;AAC9B,WACE,KAAK9C,CAAQ,IACT8C,EAAI,KAAK,EAAE,IACX,OAAO,OAAOA,GAAiBA,EAAI,UAAU;EACzC;EAMZ,MAAM,UAAyB;AAC7B,WAAO,IAAI,QAAc,CAACC,GAASC,MAAW;AAC5C,WAAK,GAAGrC,GAAW,MAAMqC,EAAO,IAAI,MAAM,kBAAkB,CAAC,CAAC,GAC9D,KAAK,GAAG,SAASlF,OAAMkF,EAAOlF,CAAE,CAAC,GACjC,KAAK,GAAG,OAAO,MAAMiF,EAAO,CAAE;IAAC,CAChC;EAAC;EAQJ,CAAC,OAAO,aAAa,IAAuC;AAG1D,SAAK1B,CAAS,IAAI;AAClB,QAAI4B,IAAU,OACRC,IAAO,aACX,KAAK,MAAK,GACVD,IAAU,MACH,EAAE,OAAO,QAAW,MAAM,KAAI;AA2CvC,WAAO,EACL,MA1CW,MAA4C;AACvD,UAAIA,EAAS,QAAOC,EAAI;AACxB,UAAMhF,IAAM,KAAK,KAAI;AACrB,UAAIA,MAAQ,KAAM,QAAO,QAAQ,QAAQ,EAAE,MAAM,OAAO,OAAOA,EAAG,CAAE;AAEpE,UAAI,KAAKqB,CAAG,EAAG,QAAO2D,EAAI;AAE1B,UAAIH,GACAC,GACEG,IAASrF,OAAgB;AAC7B,aAAK,IAAI,QAAQsF,CAAM,GACvB,KAAK,IAAI,OAAOC,CAAK,GACrB,KAAK,IAAI1C,GAAW2C,CAAS,GAC7BJ,EAAI,GACJF,EAAOlF,CAAE;MAAC,GAENsF,IAAUlH,OAAiB;AAC/B,aAAK,IAAI,SAASiH,CAAK,GACvB,KAAK,IAAI,OAAOE,CAAK,GACrB,KAAK,IAAI1C,GAAW2C,CAAS,GAC7B,KAAK,MAAK,GACVP,EAAQ,EAAE,OAAA7G,GAAO,MAAM,CAAC,CAAC,KAAKqD,CAAG,EAAC,CAAE;MAAC,GAEjC8D,IAAQ,MAAM;AAClB,aAAK,IAAI,SAASF,CAAK,GACvB,KAAK,IAAI,QAAQC,CAAM,GACvB,KAAK,IAAIzC,GAAW2C,CAAS,GAC7BJ,EAAI,GACJH,EAAQ,EAAE,MAAM,MAAM,OAAO,OAAS,CAAE;MAAC,GAErCO,IAAY,MAAMH,EAAM,IAAI,MAAM,kBAAkB,CAAC;AAC3D,aAAO,IAAI,QAA+B,CAACjF,GAAKC,MAAQ;AACtD6E,YAAS7E,GACT4E,IAAU7E,GACV,KAAK,KAAKyC,GAAW2C,CAAS,GAC9B,KAAK,KAAK,SAASH,CAAK,GACxB,KAAK,KAAK,OAAOE,CAAK,GACtB,KAAK,KAAK,QAAQD,CAAM;MAAC,CAC1B;IAAC,GAKF,OAAOF,GACP,QAAQA,GACR,CAAC,OAAO,aAAa,IAAI;AACvB,aAAO;IAAI,GAEb,CAAC,OAAO,YAAY,GAAG,YAAY;IAAC,EAAA;EACrC;EASH,CAAC,OAAO,QAAQ,IAAkC;AAGhD,SAAK7B,CAAS,IAAI;AAClB,QAAI4B,IAAU,OACRC,IAAO,OACX,KAAK,MAAK,GACV,KAAK,IAAItC,IAAOsC,CAAI,GACpB,KAAK,IAAIvC,GAAWuC,CAAI,GACxB,KAAK,IAAI,OAAOA,CAAI,GACpBD,IAAU,MACH,EAAE,MAAM,MAAM,OAAO,OAAS,IAGjC5P,IAAO,MAAmC;AAC9C,UAAI4P,EAAS,QAAOC,EAAI;AACxB,UAAMhH,IAAQ,KAAK,KAAI;AACvB,aAAOA,MAAU,OAAOgH,EAAI,IAAK,EAAE,MAAM,OAAO,OAAAhH,EAAK;IAAE;AAGzD,WAAA,KAAK,KAAK,OAAOgH,CAAI,GACrB,KAAK,KAAKtC,IAAOsC,CAAI,GACrB,KAAK,KAAKvC,GAAWuC,CAAI,GAElB,EACL,MAAA7P,GACA,OAAO6P,GACP,QAAQA,GACR,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;IAAI,GAEb,CAAC,OAAO,OAAO,GAAG,MAAM;IAAC,EAAA;EAC1B;EAeH,QAAQpF,GAAc;AACpB,QAAI,KAAK6C,CAAS,EAChB,QAAI7C,IAAI,KAAK,KAAK,SAASA,CAAE,IACxB,KAAK,KAAK6C,CAAS,GACjB;AAGT,SAAKA,CAAS,IAAI,MAClB,KAAKU,CAAS,IAAI,MAGlB,KAAKhB,CAAM,EAAE,SAAS,GACtB,KAAKE,CAAY,IAAI;AAErB,QAAMgD,IAAK;AAGX,WAAI,OAAOA,EAAG,SAAU,cAAc,CAAC,KAAK3D,EAAM,KAAG2D,EAAG,MAAK,GAEzDzF,IAAI,KAAK,KAAK,SAASA,CAAE,IAExB,KAAK,KAAK6C,CAAS,GAEjB;EAAI;EAUb,WAAW,WAAW;AACpB,WAAO1B;EAAQ;AAAA;ADtzCnB,IAAMuE,KAAeC,UAAAA,aAAI;AAAzB,IA2EMC,KAAqB,EACzB,WAAAC,UAAAA,WACA,SAASC,UAAAA,SACT,aAAAC,UAAAA,aACA,cAAAC,UAAAA,cACA,cAAAN,IACA,UAAU,EACR,OAAAO,gBAAAA,OACA,SAAAC,gBAAAA,SACA,UAAAC,gBAAAA,UACA,UAAAC,gBAAAA,SAAAA,EAAAA;AArFJ,IA0FMC,KAAgBC,CAAAA,OACpB,CAACA,MAAYA,OAAaV,MAAaU,OAAaC,KAClDX,KACA,EACE,GAAGA,IACH,GAAGU,IACH,UAAU,EACR,GAAGV,GAAU,UACb,GAAIU,GAAS,YAAY,CAAA,EAAA,EAAA;AAlGjC,IAuGME,KAAiB;AAvGvB,IAwGMC,KAAcC,CAAAA,OAClBA,GAAS,QAAQ,OAAO,IAAI,EAAE,QAAQF,IAAgB,MAAM;AAzG9D,IA4GMG,KAAY;AA5GlB,IA8GMC,IAAU;AA9GhB,IA+GMC,KAAQ;AA/Gd,IAgHMC,KAAQ;AAhHd,IAiHMC,IAAQ;AAjHd,IAkHMC,KAAQ;AAlHd,IAmHMC,KAAQ;AAnHd,IAoHMC,IAAQ;AApHd,IAqHMC,KAAS;AArHf,IAsHMC,IAAO;AAtHb,IAmIMC,KAAe,CAACD;AAnItB,IAsIME,KAAiB;AAtIvB,IAwIMC,KAAe;AAxIrB,IA0IMC,KAAU;AA1IhB,IA6IMC,IAAS;AA7If,IAgJMC,KAAc;AAhJpB,IAkJMC,KAAc;AAlJpB,IAoJMC,KAAWJ,KAAUC,IAASE;AApJpC,IAqJME,KAAW;AArJjB,IAuJMC,KAAazb,CAAAA,OACjBA,GAAE,OAAM,IAAK4a,KACX5a,GAAE,YAAW,IAAK0a,IAClB1a,GAAE,eAAc,IAAK6a,IACrB7a,GAAE,kBAAiB,IAAKya,KACxBza,GAAE,cAAa,IAAK2a,KACpB3a,GAAE,SAAQ,IAAK8a,KACf9a,GAAE,OAAM,IAAKwa,KACbD;AA/JJ,IAkKMmB,KAAiB,IAAIC,GAAyB,EAAE,KAAK,KAAK,GAAE,CAAE;AAlKpE,IAmKMC,KAAa5b,CAAAA,OAAa;AAC9B,MAAMR,IAAIkc,GAAe,IAAI1b,EAAC;AAC9B,MAAIR,EAAG,QAAOA;AACd,MAAMP,IAAIe,GAAE,UAAU,MAAM;AAC5B,SAAA0b,GAAe,IAAI1b,IAAGf,CAAC,GAChBA;AACT;AAzKA,IA2KM4c,KAAuB,IAAIF,GAAyB,EAAE,KAAK,KAAK,GAAE,CAAE;AA3K1E,IA4KMG,KAAmB9b,CAAAA,OAAa;AACpC,MAAMR,IAAIqc,GAAqB,IAAI7b,EAAC;AACpC,MAAIR,EAAG,QAAOA;AACd,MAAMP,IAAI2c,GAAU5b,GAAE,YAAW,CAAE;AACnC,SAAA6b,GAAqB,IAAI7b,IAAGf,CAAC,GACtBA;AACT;AAlLA,IAsMa8c,KAAP,cAA4BJ,GAAwB;EACxD,cAAA;AACE,UAAM,EAAE,KAAK,IAAG,CAAE;EACpB;AAAA;AAzMF,IA4NaK,KAAP,cAA6BL,GAA4B;EAC7D,YAAYpM,IAAkB,KAAK,MAAI;AACrC,UAAM,EACJ,SAAAA,GAEA,iBAAiBpU,OAAKA,EAAE,SAAS,EAAA,CAClC;EACH;AAAA;AAnOF,IA6OM8gB,KAAW,uBAAO,qBAAqB;AA7O7C,IA4PsBC,IAAhB,MAAwB;EAU5B;EAMA;EAMA;EAMA;EAKA;EAMA,QAAiB;EAajBC;EAGAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,MAAG;AACL,WAAO,KAAKA;EACd;EACA1P;EACA,IAAI,OAAI;AACN,WAAO,KAAKA;EACd;EACA2P;EACA,IAAI,SAAM;AACR,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,UAAO;AACT,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,cAAW;AACb,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,QAAK;AACP,WAAO,KAAKA;EACd;EACAC;EACA,IAAI,YAAS;AACX,WAAO,KAAKA;EACd;EAEAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EACAC;EAQA,IAAI,aAAU;AACZ,YAAQ,KAAK,UAAU,MAAM,SAAQ;EACvC;EASA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;EASA,YACEC,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,SAAK,OAAOoG,GACZ,KAAKV,KAAaa,IAASpC,GAAgBiC,CAAI,IAAInC,GAAUmC,CAAI,GACjE,KAAKJ,KAAQ1a,IAAOuY,IACpB,KAAK,SAAS0C,GACd,KAAK,QAAQD,GACb,KAAK,OAAOD,KAAQ,MACpB,KAAKJ,KAAYO,GACjB,KAAKZ,KAAY5F,EAAK,UACtB,KAAK8F,KAAY9F,EAAK,UACtB,KAAK+F,KAAiB/F,EAAK,eAC3B,KAAK,SAASA,EAAK,QACf,KAAK,SACP,KAAKwE,KAAM,KAAK,OAAOA,KAEvB,KAAKA,KAAMnC,GAAarC,EAAK,EAAE;EAEnC;EAOA,QAAK;AACH,WAAI,KAAK2F,OAAW,SAAkB,KAAKA,KACtC,KAAK,SACF,KAAKA,KAAS,KAAK,OAAO,MAAK,IAAK,IADlB,KAAKA,KAAS;EAE1C;EAkBA,gBAAa;AACX,WAAO,KAAKM;EACd;EAKA,QAAQxW,GAAa;AACnB,QAAI,CAACA,EACH,QAAO;AAET,QAAMiT,IAAW,KAAK,cAAcjT,CAAI,GAElCgX,IADMhX,EAAK,UAAUiT,EAAS,MAAM,EACrB,MAAM,KAAK,QAAQ;AAKxC,WAHEA,IACE,KAAK,QAAQA,CAAQ,EAAEgE,GAAcD,CAAQ,IAC7C,KAAKC,GAAcD,CAAQ;EAEjC;EAEAC,GAAcD,GAAkB;AAC9B,QAAIvgB,IAAc;AAClB,aAAWwF,KAAQ+a,EACjBvgB,KAAIA,EAAE,MAAMwF,CAAI;AAElB,WAAOxF;EACT;EAUA,WAAQ;AACN,QAAMygB,IAAS,KAAKV,GAAU,IAAI,IAAI;AACtC,QAAIU,EACF,QAAOA;AAET,QAAMH,IAAqB,OAAO,OAAO,CAAA,GAAI,EAAE,aAAa,EAAC,CAAE;AAC/D,WAAA,KAAKP,GAAU,IAAI,MAAMO,CAAQ,GACjC,KAAKR,MAAS,CAAC1C,IACRkD;EACT;EAeA,MAAMI,GAAkB5G,GAAe;AACrC,QAAI4G,MAAa,MAAMA,MAAa,IAClC,QAAO;AAET,QAAIA,MAAa,KACf,QAAO,KAAK,UAAU;AAIxB,QAAMJ,IAAW,KAAK,SAAQ,GACxBJ,IACJ,KAAK,SAASjC,GAAgByC,CAAQ,IAAI3C,GAAU2C,CAAQ;AAC9D,aAAW1gB,KAAKsgB,EACd,KAAItgB,EAAEwf,OAAeU,EACnB,QAAOlgB;AAOX,QAAMmC,IAAI,KAAK,SAAS,KAAK,MAAM,IAC7Bwe,IACJ,KAAKjB,KAAY,KAAKA,KAAYvd,IAAIue,IAAW,QAC7CE,IAAS,KAAK,SAASF,GAAUhE,GAAS,EAC9C,GAAG5C,GACH,QAAQ,MACR,UAAA6G,EAAAA,CACD;AAED,WAAK,KAAK,WAAU,MAClBC,EAAOd,MAASvC,IAKlB+C,EAAS,KAAKM,CAAM,GACbA;EACT;EAMA,WAAQ;AACN,QAAI,KAAK,MAAO,QAAO;AACvB,QAAI,KAAKhB,OAAc,OACrB,QAAO,KAAKA;AAEd,QAAMM,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK4f,KAAY,KAAK;AAEhC,QAAMiB,IAAK7gB,EAAE,SAAQ;AACrB,WAAO6gB,KAAM,CAACA,KAAM,CAAC7gB,EAAE,SAAS,KAAK,KAAK,OAAOkgB;EACnD;EAQA,gBAAa;AACX,QAAI,KAAK,QAAQ,IAAK,QAAO,KAAK,SAAQ;AAC1C,QAAI,KAAK,MAAO,QAAO;AACvB,QAAI,KAAKL,OAAmB,OAAW,QAAO,KAAKA;AACnD,QAAMK,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK6f,KAAiB,KAAK,cAAa;AAElD,QAAMgB,IAAK7gB,EAAE,cAAa;AAC1B,WAAO6gB,KAAM,CAACA,KAAM,CAAC7gB,EAAE,SAAS,KAAK,OAAOkgB;EAC9C;EAKA,WAAQ;AACN,QAAI,KAAKR,OAAc,OACrB,QAAO,KAAKA;AAEd,QAAMQ,IAAO,KAAK,MACZlgB,IAAI,KAAK;AACf,QAAI,CAACA,EACH,QAAQ,KAAK0f,KAAY,KAAK;AAGhC,QAAMoB,IADK9gB,EAAE,SAAQ,KACHA,EAAE,SAAc,KAAK,MAAV,MAAiBkgB;AAC9C,WAAQ,KAAKR,KAAYoB;EAC3B;EAQA,gBAAa;AACX,QAAI,KAAKnB,OAAmB,OAAW,QAAO,KAAKA;AACnD,QAAI,KAAK,QAAQ,IAAK,QAAQ,KAAKA,KAAiB,KAAK,SAAQ;AACjE,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAM3f,IAAI,KAAK,SAAQ,EAAG,QAAQ,OAAO,GAAG;AAC5C,aAAI,aAAa,KAAKA,CAAC,IACb,KAAK2f,KAAiB,OAAO3f,CAAC,KAE9B,KAAK2f,KAAiB3f;IAElC;AACA,QAAMA,IAAI,KAAK,QACT+gB,IAAO/gB,EAAE,cAAa,GACtBghB,IAAMD,KAAQ,CAACA,KAAQ,CAAC/gB,EAAE,SAAS,KAAK,OAAO,KAAK;AAC1D,WAAQ,KAAK2f,KAAiBqB;EAChC;EASA,YAAS;AACP,YAAQ,KAAKlB,KAAQ5C,OAAUR;EACjC;EAEA,OAAOtX,GAAU;AACf,WAAO,KAAK,KAAKA,CAAI,EAAE,EAAC;EAC1B;EAEA,UAAO;AACL,WACE,KAAK,UAAS,IAAK,YACjB,KAAK,YAAW,IAAK,cACrB,KAAK,OAAM,IAAK,SAChB,KAAK,eAAc,IAAK,iBACxB,KAAK,OAAM,IAAK,SAChB,KAAK,kBAAiB,IAAK,oBAC3B,KAAK,cAAa,IAAK,gBACD,KAAK,SAAQ,IAAK,WACxC;EAGN;EAKA,SAAM;AACJ,YAAQ,KAAK0a,KAAQ5C,OAAUH;EACjC;EAKA,cAAW;AACT,YAAQ,KAAK+C,KAAQ5C,OAAUL;EACjC;EAKA,oBAAiB;AACf,YAAQ,KAAKiD,KAAQ5C,OAAUN;EACjC;EAKA,gBAAa;AACX,YAAQ,KAAKkD,KAAQ5C,OAAUJ;EACjC;EAKA,SAAM;AACJ,YAAQ,KAAKgD,KAAQ5C,OAAUP;EACjC;EAKA,WAAQ;AACN,YAAQ,KAAKmD,KAAQ5C,OAAUD;EACjC;EAKA,iBAAc;AACZ,YAAQ,KAAK6C,KAAQ9C,OAAWA;EAClC;EASA,cAAW;AACT,WAAO,KAAK8C,KAAQzC,KAAe,OAAO;EAC5C;EAUA,iBAAc;AACZ,WAAO,KAAK2C;EACd;EAUA,iBAAc;AACZ,WAAO,KAAKC;EACd;EAUA,gBAAa;AACX,QAAMK,IAAW,KAAK,SAAQ;AAC9B,WAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EASA,cAAW;AACT,QAAI,KAAKN,GAAa,QAAO;AAC7B,QAAI,CAAC,KAAK,OAAQ,QAAO;AAEzB,QAAMiB,IAAO,KAAKnB,KAAQ5C;AAC1B,WAAO,EACJ+D,MAASvE,KAAWuE,MAASjE,KAC9B,KAAK8C,KAAQtC,MACb,KAAKsC,KAAQvC;EAEjB;EAMA,gBAAa;AACX,WAAO,CAAC,EAAE,KAAKuC,KAAQ1C;EACzB;EAOA,WAAQ;AACN,WAAO,CAAC,EAAE,KAAK0C,KAAQvC;EACzB;EAaA,QAAQnc,GAAS;AACf,WAAQ,KAAK,SAET,KAAKoe,OAAevB,GAAgB7c,CAAC,IADrC,KAAKoe,OAAezB,GAAU3c,CAAC;EAErC;EAUA,MAAM,WAAQ;AACZ,QAAM8f,IAAS,KAAKlB;AACpB,QAAIkB,EACF,QAAOA;AAET,QAAK,KAAK,YAAW,KAKhB,KAAK,OAIV,KAAI;AACF,UAAMC,IAAO,MAAM,KAAK7C,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,GACvD8C,KAAc,MAAM,KAAK,OAAO,SAAQ,IAAK,QAAQD,CAAI;AAC/D,UAAIC,EACF,QAAQ,KAAKpB,KAAcoB;IAE/B,SAAStL,GAAI;AACX,WAAKuL,GAAevL,EAA6B,IAAI;AACrD;IACF;EACF;EAKA,eAAY;AACV,QAAMoL,IAAS,KAAKlB;AACpB,QAAIkB,EACF,QAAOA;AAET,QAAK,KAAK,YAAW,KAKhB,KAAK,OAIV,KAAI;AACF,UAAMC,IAAO,KAAK7C,GAAI,aAAa,KAAK,SAAQ,CAAE,GAC5C8C,IAAa,KAAK,OAAO,aAAY,GAAI,QAAQD,CAAI;AAC3D,UAAIC,EACF,QAAQ,KAAKpB,KAAcoB;IAE/B,SAAStL,GAAI;AACX,WAAKuL,GAAevL,EAA6B,IAAI;AACrD;IACF;EACF;EAEAwL,GAAgBhB,GAAkB;AAEhC,SAAKR,MAAS1C;AAEd,aAASpd,IAAIsgB,EAAS,aAAatgB,IAAIsgB,EAAS,QAAQtgB,KAAK;AAC3D,UAAM2B,IAAI2e,EAAStgB,CAAC;AAChB2B,WAAGA,EAAE4f,GAAW;IACtB;EACF;EAEAA,KAAW;AAEL,SAAKzB,KAAQvC,MACjB,KAAKuC,MAAS,KAAKA,KAAQvC,KAAUJ,IACrC,KAAKqE,GAAmB;EAC1B;EAEAA,KAAmB;AAEjB,QAAMlB,IAAW,KAAK,SAAQ;AAC9BA,MAAS,cAAc;AACvB,aAAWtgB,KAAKsgB,EACdtgB,GAAEuhB,GAAW;EAEjB;EAEAE,KAAgB;AACd,SAAK3B,MAASrC,IACd,KAAKiE,GAAY;EACnB;EAGAA,KAAY;AAMV,QAAI,KAAK5B,KAAQxC,GAAS;AAE1B,QAAI,IAAI,KAAKwC;AAAAA,KAGR,IAAI5C,OAAUL,MAAO,KAAKM,KAC/B,KAAK2C,KAAQ,IAAIxC,IACjB,KAAKkE,GAAmB;EAC1B;EAEAG,GAAajU,IAAe,IAAE;AAExBA,UAAS,aAAaA,MAAS,UACjC,KAAKgU,GAAY,IACRhU,MAAS,WAClB,KAAK6T,GAAW,IAEhB,KAAK,SAAQ,EAAG,cAAc;EAElC;EAEAK,GAAWlU,IAAe,IAAE;AAGtBA,UAAS,YAED,KAAK,OACbgU,GAAY,IACLhU,MAAS,YAElB,KAAK6T,GAAW;EAEpB;EAEAF,GAAc3T,IAAe,IAAE;AAC7B,QAAImU,IAAM,KAAK/B;AACf+B,SAAOrE,IACH9P,MAAS,aAAUmU,KAAOtE,KAE1B7P,MAAS,YAAYA,MAAS,eAGhCmU,KAAO1E,KAET,KAAK2C,KAAQ+B,GAITnU,MAAS,aAAa,KAAK,UAC7B,KAAK,OAAOgU,GAAY;EAG5B;EAEAI,GAAiBC,GAAWpgB,GAAW;AACrC,WACE,KAAKqgB,GAA0BD,GAAGpgB,CAAC,KACnC,KAAKsgB,GAAoBF,GAAGpgB,CAAC;EAEjC;EAEAsgB,GAAoBF,GAAWpgB,GAAW;AAExC,QAAMyD,IAAOwY,GAAUmE,CAAC,GAClBG,IAAQ,KAAK,SAASH,EAAE,MAAM3c,GAAM,EAAE,QAAQ,KAAI,CAAE,GACpD6b,IAAOiB,EAAMpC,KAAQ5C;AAC3B,WAAI+D,MAASpE,KAASoE,MAASjE,KAASiE,MAASvE,MAC/CwF,EAAMpC,MAASxC,KAEjB3b,EAAE,QAAQugB,CAAK,GACfvgB,EAAE,eACKugB;EACT;EAEAF,GAA0BD,GAAWpgB,GAAW;AAC9C,aAAS3B,IAAI2B,EAAE,aAAa3B,IAAI2B,EAAE,QAAQ3B,KAAK;AAC7C,UAAM4gB,IAASjf,EAAE3B,CAAC;AAGlB,WADE,KAAK,SAASie,GAAgB8D,EAAE,IAAI,IAAIhE,GAAUgE,EAAE,IAAI,OAC7CnB,EAAQpB,GAIrB,QAAO,KAAK2C,GAAqBJ,GAAGnB,GAAS5gB,GAAG2B,CAAC;IACnD;EACF;EAEAwgB,GACEJ,GACA/hB,GACAwQ,GACA7O,GAAW;AAEX,QAAM6R,IAAIxT,EAAE;AAEZ,WAAAA,EAAE8f,KAAS9f,EAAE8f,KAAQ3C,KAAgBS,GAAUmE,CAAC,GAE5CvO,MAAMuO,EAAE,SAAM/hB,EAAE,OAAO+hB,EAAE,OAIzBvR,MAAU7O,EAAE,gBACV6O,MAAU7O,EAAE,SAAS,IAAGA,EAAE,IAAG,IAC5BA,EAAE,OAAO6O,GAAO,CAAC,GACtB7O,EAAE,QAAQ3B,CAAC,IAEb2B,EAAE,eACK3B;EACT;EAiBA,MAAM,QAAK;AACT,SAAK,KAAK8f,KAAQvC,OAAY,EAC5B,KAAI;AACF,aAAA,KAAK6E,GAAW,MAAM,KAAK9D,GAAI,SAAS,MAAM,KAAK,SAAQ,CAAE,CAAC,GACvD;IACT,SAASxI,GAAI;AACX,WAAK8L,GAAY9L,EAA6B,IAAI;IACpD;EAEJ;EAKA,YAAS;AACP,SAAK,KAAKgK,KAAQvC,OAAY,EAC5B,KAAI;AACF,aAAA,KAAK6E,GAAW,KAAK9D,GAAI,UAAU,KAAK,SAAQ,CAAE,CAAC,GAC5C;IACT,SAASxI,GAAI;AACX,WAAK8L,GAAY9L,EAA6B,IAAI;IACpD;EAEJ;EAEAsM,GAAWC,GAAS;AAClB,QAAM,EACJ,OAAAC,GACA,SAAAC,GACA,WAAAC,GACA,aAAAC,GACA,SAAAC,GACA,QAAAC,GACA,OAAAC,GACA,SAAAC,GACA,KAAAC,GACA,KAAAC,GACA,KAAAC,GACA,MAAAC,GACA,OAAAC,GACA,SAAAC,GACA,OAAAC,GACA,MAAAC,GACA,MAAAhV,GACA,KAAAiV,EAAG,IACDjB;AACJ,SAAKjD,KAASkD,GACd,KAAKtD,KAAWuD,GAChB,KAAKhD,KAAaiD,GAClB,KAAKrD,KAAesD,GACpB,KAAK5D,KAAW6D,GAChB,KAAK3D,KAAU4D,GACf,KAAKrD,KAASsD,GACd,KAAK1D,KAAW2D,GAChB,KAAKtE,KAAOuE,GACZ,KAAKnE,KAAOoE,GACZ,KAAKjE,KAAOkE,GACZ,KAAKxE,KAAQyE,GACb,KAAK5D,KAAS6D,GACd,KAAKjE,KAAWkE,GAChB,KAAK1E,KAAS2E,GACd,KAAKxE,KAAQyE,GACb,KAAKjU,KAAQf,GACb,KAAKqQ,KAAO4E;AACZ,QAAMrC,IAAOrD,GAAUyE,CAAE;AAEzB,SAAKvC,KAAS,KAAKA,KAAQ3C,KAAgB8D,IAAO5D,IAC9C4D,MAASvE,KAAWuE,MAASpE,KAASoE,MAASjE,MACjD,KAAK8C,MAASxC;EAElB;EAEAiG,KAGc,CAAA;EACdC,KAA8B;EAC9BC,GAAiBnD,GAAgB;AAC/B,SAAKkD,KAAqB;AAC1B,QAAME,IAAM,KAAKH,GAAa,MAAK;AACnC,SAAKA,GAAa,SAAS,GAC3BG,EAAI,QAAQrO,OAAMA,EAAG,MAAMiL,CAAQ,CAAC;EACtC;EAkBA,UACEjL,GACAsO,IAAsB,OAAK;AAE3B,QAAI,CAAC,KAAK,WAAU,GAAI;AAClBA,UAAYtO,EAAG,MAAM,CAAA,CAAE,IACtB,eAAe,MAAMA,EAAG,MAAM,CAAA,CAAE,CAAC;AACtC;IACF;AAEA,QAAMiL,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,GAAI;AACxB,UAAM3e,IAAI2e,EAAS,MAAM,GAAGA,EAAS,WAAW;AAC5CqD,UAAYtO,EAAG,MAAM1T,CAAC,IACrB,eAAe,MAAM0T,EAAG,MAAM1T,CAAC,CAAC;AACrC;IACF;AAIA,QADA,KAAK4hB,GAAa,KAAKlO,CAAE,GACrB,KAAKmO,GACP;AAEF,SAAKA,KAAqB;AAI1B,QAAM7C,IAAW,KAAK,SAAQ;AAC9B,SAAKrC,GAAI,QAAQqC,GAAU,EAAE,eAAe,KAAI,GAAI,CAAC7K,GAAI8N,MAAW;AAClE,UAAI9N,EACF,MAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;WAClB;AAGL,iBAAWyB,KAAK6B,EACd,MAAK9B,GAAiBC,GAAGzB,CAAQ;AAEnC,aAAKgB,GAAgBhB,CAAQ;MAC/B;AACA,WAAKmD,GAAiBnD,EAAS,MAAM,GAAGA,EAAS,WAAW,CAAC;IAE/D,CAAC;EACH;EAEAuD;EAWA,MAAM,UAAO;AACX,QAAI,CAAC,KAAK,WAAU,EAClB,QAAO,CAAA;AAGT,QAAMvD,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,EACpB,QAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;AAK/C,QAAMK,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAKkD,GACP,OAAM,KAAKA;SACN;AAEL,UAAI9I,IAAsB,MAAK;MAAE;AAEjC,WAAK8I,KAAwB,IAAI,QAC/B3N,OAAQ6E,IAAU7E,CAAI;AAExB,UAAI;AACF,iBAAW6L,KAAK,MAAM,KAAKzD,GAAI,SAAS,QAAQqC,GAAU,EACxD,eAAe,KAAA,CAChB,EACC,MAAKmB,GAAiBC,GAAGzB,CAAQ;AAEnC,aAAKgB,GAAgBhB,CAAQ;MAC/B,SAASxK,GAAI;AACX,aAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;MACzB;AACA,WAAKuD,KAAwB,QAC7B9I,EAAO;IACT;AACA,WAAOuF,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EAKA,cAAW;AACT,QAAI,CAAC,KAAK,WAAU,EAClB,QAAO,CAAA;AAGT,QAAMA,IAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,EACpB,QAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;AAK/C,QAAMK,IAAW,KAAK,SAAQ;AAC9B,QAAI;AACF,eAAWoB,KAAK,KAAKzD,GAAI,YAAYqC,GAAU,EAC7C,eAAe,KAAA,CAChB,EACC,MAAKmB,GAAiBC,GAAGzB,CAAQ;AAEnC,WAAKgB,GAAgBhB,CAAQ;IAC/B,SAASxK,GAAI;AACX,WAAK6L,GAAc7L,EAA6B,IAAI,GACpDwK,EAAS,cAAc;IACzB;AACA,WAAOA,EAAS,MAAM,GAAGA,EAAS,WAAW;EAC/C;EAEA,aAAU;AACR,QAAI,KAAKR,KAAQpC,GAAU,QAAO;AAClC,QAAMuD,IAAO/D,IAAO,KAAK4C;AAGzB,WAAMmB,MAASvE,KAAWuE,MAASpE,KAASoE,MAASjE;EAKvD;EAEA,WACE8G,GACAC,GAAqC;AAErC,YACG,KAAKjE,KAAQjD,OAAWA,KACzB,EAAE,KAAKiD,KAAQpC,OACf,CAACoG,EAAK,IAAI,IAAI,MACb,CAACC,KAAcA,EAAW,IAAI;EAEnC;EAWA,MAAM,WAAQ;AACZ,QAAI,KAAK9D,GAAW,QAAO,KAAKA;AAChC,QAAK,GAAAxC,KAAcD,KAAcD,KAAU,KAAKuC,IAChD,KAAI;AACF,UAAMkE,IAAK,MAAM,KAAK1F,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE;AAC3D,aAAQ,KAAK2B,KAAY,KAAK,QAAQ+D,CAAE;IAC1C,QAAY;AACV,WAAKvC,GAAgB;IACvB;EACF;EAKA,eAAY;AACV,QAAI,KAAKxB,GAAW,QAAO,KAAKA;AAChC,QAAK,GAAAxC,KAAcD,KAAcD,KAAU,KAAKuC,IAChD,KAAI;AACF,UAAMkE,IAAK,KAAK1F,GAAI,aAAa,KAAK,SAAQ,CAAE;AAChD,aAAQ,KAAK2B,KAAY,KAAK,QAAQ+D,CAAE;IAC1C,QAAY;AACV,WAAKvC,GAAgB;IACvB;EACF;EAQA,CAACrD,EAAQ,EAAE6F,GAAgB;AACzB,QAAIA,MAAW,KAAM;AACrBA,MAAO,QAAQ,OACf,KAAK,QAAQ;AAEb,QAAMC,IAAU,oBAAI,IAAc,CAAA,CAAE,GAChCF,IAAK,CAAA,GACLhkB,IAAc;AAClB,WAAOA,KAAKA,EAAE,SACZkkB,GAAQ,IAAIlkB,CAAC,GACbA,EAAE4f,KAAYoE,EAAG,KAAK,KAAK,GAAG,GAC9BhkB,EAAE6f,KAAiBmE,EAAG,KAAK,GAAG,GAC9BhkB,IAAIA,EAAE,QACNgkB,EAAG,KAAK,IAAI;AAId,SADAhkB,IAAIikB,GACGjkB,KAAKA,EAAE,UAAU,CAACkkB,EAAQ,IAAIlkB,CAAC,IACpCA,GAAE4f,KAAY,QACd5f,EAAE6f,KAAiB,QACnB7f,IAAIA,EAAE;EAEV;AAAA;AAx1CF,IAi2CamkB,KAAP,MAAOC,WAAkB/F,EAAQ;EAIrC,MAAY;EAIZ,WAAmB5B;EAQnB,YACEyD,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,UAAMoG,GAAM9a,GAAM+a,GAAMC,GAAOC,GAAQC,GAAUxG,CAAI;EACvD;EAKA,SAASoG,GAAc9a,IAAesX,GAAS5C,IAAiB,CAAA,GAAE;AAChE,WAAO,IAAIsK,GACTlE,GACA9a,GACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB0U,CAAI;EAER;EAKA,cAAcvQ,GAAY;AACxB,WAAO8a,iBAAAA,MAAM,MAAM9a,CAAI,EAAE;EAC3B;EAKA,QAAQiT,GAAgB;AAEtB,QADAA,IAAWD,GAAWC,EAAS,YAAW,CAAE,GACxCA,MAAa,KAAK,KAAK,KACzB,QAAO,KAAK;AAGd,aAAW,CAAC8H,GAASnE,CAAI,KAAK,OAAO,QAAQ,KAAK,KAAK,EACrD,KAAI,KAAK,SAAS3D,GAAU8H,CAAO,EACjC,QAAQ,KAAK,MAAM9H,CAAQ,IAAI2D;AAInC,WAAQ,KAAK,MAAM3D,CAAQ,IAAI,IAAI+H,GACjC/H,GACA,IAAI,EACJ;EACJ;EAKA,SAASA,GAAkB8H,IAAkB,KAAK,KAAK,MAAI;AAIzD,WAAA9H,IAAWA,EACR,YAAW,EACX,QAAQ,OAAO,IAAI,EACnB,QAAQF,IAAgB,MAAM,GAC1BE,MAAa8H;EACtB;AAAA;AAp7CF,IA47CaE,KAAP,MAAOC,WAAkBpG,EAAQ;EAIrC,WAAgB;EAIhB,MAAW;EAQX,YACE6B,GACA9a,IAAesX,GACfyD,GACAC,GACAC,GACAC,GACAxG,GAAc;AAEd,UAAMoG,GAAM9a,GAAM+a,GAAMC,GAAOC,GAAQC,GAAUxG,CAAI;EACvD;EAKA,cAAcvQ,GAAY;AACxB,WAAOA,EAAK,WAAW,GAAG,IAAI,MAAM;EACtC;EAKA,QAAQmb,GAAiB;AACvB,WAAO,KAAK;EACd;EAKA,SAASxE,GAAc9a,IAAesX,GAAS5C,IAAiB,CAAA,GAAE;AAChE,WAAO,IAAI2K,GACTvE,GACA9a,GACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB0U,CAAI;EAER;AAAA;AAn/CF,IA6hDsB6K,KAAhB,MAA8B;EAIlC;EAIA;EAIA;EAIA;EACAC;EACAC;EACA9E;EAMA;EASAzB;EASA,YACEwG,IAAoB,QAAQ,IAAG,GAC/BC,GACAvb,GACA,EACE,QAAA6W,GACA,mBAAA2E,IAAoB,KAAK,MACzB,IAAAC,IAAKvJ,GAAS,IACI,CAAA,GAAE;AAEtB,SAAK4C,KAAMnC,GAAa8I,CAAE,IACtBH,aAAe,OAAOA,EAAI,WAAW,SAAS,OAChDA,QAAMI,iBAAAA,eAAcJ,CAAG;AAIzB,QAAMK,IAAUJ,EAAS,QAAQD,CAAG;AACpC,SAAK,QAAQ,uBAAO,OAAO,IAAI,GAC/B,KAAK,WAAW,KAAK,cAAcK,CAAO,GAC1C,KAAKP,KAAgB,IAAI1G,MACzB,KAAK2G,KAAqB,IAAI3G,MAC9B,KAAK6B,KAAY,IAAI5B,GAAc6G,CAAiB;AAEpD,QAAMI,IAAQD,EAAQ,UAAU,KAAK,SAAS,MAAM,EAAE,MAAM3b,CAAG;AAM/D,QAJI4b,EAAM,WAAW,KAAK,CAACA,EAAM,CAAC,KAChCA,EAAM,IAAG,GAGP/E,MAAW,OACb,OAAM,IAAI,UACR,oDAAoD;AAIxD,SAAK,SAASA,GACd,KAAK,OAAO,KAAK,QAAQ,KAAK/B,EAAG,GACjC,KAAK,MAAM,KAAK,QAAQ,IAAI,KAAK;AACjC,QAAIrT,IAAiB,KAAK,MACtB5B,IAAM+b,EAAM,SAAS,GACnBC,IAAUN,EAAS,KACrBO,IAAM,KAAK,UACXC,IAAW;AACf,aAAW/f,KAAQ4f,GAAO;AACxB,UAAMI,IAAInc;AACV4B,UAAOA,EAAK,MAAMzF,GAAM,EACtB,UAAU,IAAI,MAAMggB,CAAC,EAAE,KAAK,IAAI,EAAE,KAAKH,CAAO,GAC9C,eAAe,IAAI,MAAMG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,GAC/C,UAAWF,MAAQC,IAAW,KAAKF,KAAW7f,EAAAA,CAC/C,GACD+f,IAAW;IACb;AACA,SAAK,MAAMta;EACb;EAKA,MAAM1B,IAAsB,KAAK,KAAG;AAClC,WAAI,OAAOA,KAAS,aAClBA,IAAO,KAAK,IAAI,QAAQA,CAAI,IAEvBA,EAAK,MAAK;EACnB;EAyBA,gBAAa;AACX,WAAO,KAAKwW;EACd;EAWA,WAAW0F,GAAe;AAGxB,QAAIlnB,IAAI;AACR,aAASD,IAAImnB,EAAM,SAAS,GAAGnnB,KAAK,GAAGA,KAAK;AAC1C,UAAM0B,IAAIylB,EAAMnnB,CAAC;AACjB,UAAI,EAAA,CAAC0B,KAAKA,MAAM,SAChBzB,IAAIA,IAAI,GAAGyB,CAAC,IAAIzB,CAAC,KAAKyB,GAClB,KAAK,WAAWA,CAAC,GACnB;IAEJ;AACA,QAAMygB,IAAS,KAAKmE,GAAc,IAAIrmB,CAAC;AACvC,QAAIkiB,MAAW,OACb,QAAOA;AAET,QAAMtiB,IAAS,KAAK,IAAI,QAAQI,CAAC,EAAE,SAAQ;AAC3C,WAAA,KAAKqmB,GAAc,IAAIrmB,GAAGJ,CAAM,GACzBA;EACT;EAaA,gBAAgBsnB,GAAe;AAG7B,QAAIlnB,IAAI;AACR,aAASD,IAAImnB,EAAM,SAAS,GAAGnnB,KAAK,GAAGA,KAAK;AAC1C,UAAM0B,IAAIylB,EAAMnnB,CAAC;AACjB,UAAI,EAAA,CAAC0B,KAAKA,MAAM,SAChBzB,IAAIA,IAAI,GAAGyB,CAAC,IAAIzB,CAAC,KAAKyB,GAClB,KAAK,WAAWA,CAAC,GACnB;IAEJ;AACA,QAAMygB,IAAS,KAAKoE,GAAmB,IAAItmB,CAAC;AAC5C,QAAIkiB,MAAW,OACb,QAAOA;AAET,QAAMtiB,IAAS,KAAK,IAAI,QAAQI,CAAC,EAAE,cAAa;AAChD,WAAA,KAAKsmB,GAAmB,IAAItmB,GAAGJ,CAAM,GAC9BA;EACT;EAKA,SAASkW,IAA2B,KAAK,KAAG;AAC1C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,SAAQ;EACvB;EAMA,cAAcA,IAA2B,KAAK,KAAG;AAC/C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,cAAa;EAC5B;EAKA,SAASA,IAA2B,KAAK,KAAG;AAC1C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM;EACf;EAKA,QAAQA,IAA2B,KAAK,KAAG;AACzC,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,KAExBA,EAAM,UAAUA,GAAO,SAAQ;EACzC;EAkCA,MAAM,QACJA,IAAwD,KAAK,KAC7DyF,IAAmC,EACjC,eAAe,KAAA,GAChB;AAEG,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EAAE,eAAAqR,EAAa,IAAK5L;AAC1B,QAAKzF,EAAM,WAAU,GAEd;AACL,UAAMrU,IAAI,MAAMqU,EAAM,QAAO;AAC7B,aAAOqR,IAAgB1lB,IAAIA,EAAE,IAAI+hB,OAAKA,EAAE,IAAI;IAC9C,MAJE,QAAO,CAAA;EAKX;EAsBA,YACE1N,IAAwD,KAAK,KAC7DyF,IAAmC,EACjC,eAAe,KAAA,GAChB;AAEG,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EAAE,eAAAqR,IAAgB,KAAI,IAAK5L;AACjC,WAAKzF,EAAM,WAAU,IAEVqR,IACFrR,EAAM,YAAW,IAEjBA,EAAM,YAAW,EAAG,IAAI0N,OAAKA,EAAE,IAAI,IAJnC,CAAA;EAMX;EAiBA,MAAM,MACJ1N,IAA2B,KAAK,KAAG;AAEnC,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,MAAK;EACpB;EAKA,UAAUA,IAA2B,KAAK,KAAG;AAC3C,WAAI,OAAOA,KAAU,aACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IAEzBA,EAAM,UAAS;EACxB;EAkCA,MAAM,SACJA,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI,MAAM1N,EAAM,SAAQ;AAC9B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAuBA,aACE1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI1N,EAAM,aAAY;AAC5B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAiCA,MAAM,SACJ1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI,MAAM1N,EAAM,SAAQ;AAC9B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EAoBA,aACE1N,IAAwD,KAAK,KAC7D,EAAE,eAAAqR,EAAa,IAAiC,EAC9C,eAAe,MAAA,GAChB;AAEG,WAAOrR,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BqH,IAAgBrR,EAAM,eACtBA,IAAQ,KAAK;AAEf,QAAM0N,IAAI1N,EAAM,aAAY;AAC5B,WAAOqR,IAAgB3D,IAAIA,GAAG,SAAQ;EACxC;EA6BA,MAAM,KACJ1N,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAiC,CAAA;AAAA,KACnC,CAAChc,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,KAAKF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAEvD,QAAMyP,IAAO,oBAAI,OACX+B,IAAO,CACXC,GACAzQ,MACE;AACFyO,QAAK,IAAIgC,CAAG,GACZA,EAAI,UAAU,CAAChQ,GAAI8N,MAAW;AAE5B,YAAI9N,EACF,QAAOT,EAAGS,CAAE;AAGd,YAAIzM,IAAMua,EAAQ;AAClB,YAAI,CAACva,EAAK,QAAOgM,EAAE;AACnB,YAAMhK,IAAO,MAAK;AACZ,YAAEhC,MAAQ,KACZgM,EAAE;QAEN;AACA,iBAAW0M,KAAK6B,EAAAA,EACV,CAACha,KAAUA,EAAOmY,CAAC,MACrB6D,EAAQ,KAAKF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,GAE3C4D,KAAU5D,EAAE,eAAc,IAC5BA,EAAE,SAAQ,EACP,KAAKxjB,OAAMA,GAAG,UAAS,IAAKA,EAAE,MAAK,IAAKA,CAAE,EAC1C,KAAKA,OACJA,GAAG,WAAWulB,GAAMC,CAAU,IAAI8B,EAAKtnB,GAAG8M,CAAI,IAAIA,EAAI,CAAE,IAGxD0W,EAAE,WAAW+B,GAAMC,CAAU,IAC/B8B,EAAK9D,GAAG1W,CAAI,IAEZA,EAAI;MAIZ,GAAG,IAAI;IACT,GAEMzE,IAAQyN;AACd,WAAO,IAAI,QAA+B,CAAC6B,GAAKC,MAAO;AACrD0P,QAAKjf,GAAOkP,OAAK;AAEf,YAAIA,EAAI,QAAOK,EAAIL,CAAE;AAErBI,UAAI0P,CAAgC;MACtC,CAAC;IACH,CAAC;EACH;EA6BA,SACEvR,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAiC,CAAA;AAAA,KACnC,CAAChc,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,KAAKF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAEvD,QAAMyP,IAAO,oBAAI,IAAc,CAACzP,CAAK,CAAC;AACtC,aAAWyR,KAAOhC,GAAM;AACtB,UAAMF,IAAUkC,EAAI,YAAW;AAC/B,eAAW/D,KAAK6B,GAAS;AAAA,SACnB,CAACha,KAAUA,EAAOmY,CAAC,MACrB6D,EAAQ,KAAKF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE;AAE/C,YAAIxjB,IAA0BwjB;AAC9B,YAAIA,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,YAAE,UAAS,KAAIA,EAAE,UAAS;QAChC;AACIA,UAAE,WAAWulB,GAAMC,CAAU,KAC/BD,EAAK,IAAIvlB,CAAC;MAEd;IACF;AACA,WAAOqnB;EACT;EAWA,CAAC,OAAO,aAAa,IAAC;AACpB,WAAO,KAAK,QAAO;EACrB;EA+BA,QACEvR,IAAyC,KAAK,KAC9ClU,IAAuB,CAAA,GAAE;AAKzB,WAAI,OAAOkU,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5Ble,IAAUkU,GACVA,IAAQ,KAAK,MAER,KAAK,OAAOA,GAAOlU,CAAO,EAAE,OAAO,aAAa,EAAC;EAC1D;EAOA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,YAAW;EACzB;EAuBA,CAAC,YACCkU,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK;AAAAA,KACA,CAAClQ,KAAUA,EAAOyK,CAAK,OACzB,MAAMqR,IAAgBrR,IAAQA,EAAM,SAAQ;AAE9C,QAAMyP,IAAO,oBAAI,IAAc,CAACzP,CAAK,CAAC;AACtC,aAAWyR,KAAOhC,GAAM;AACtB,UAAMF,IAAUkC,EAAI,YAAW;AAC/B,eAAW/D,KAAK6B,GAAS;AAAA,SACnB,CAACha,KAAUA,EAAOmY,CAAC,OACrB,MAAM2D,IAAgB3D,IAAIA,EAAE,SAAQ;AAEtC,YAAIxjB,IAA0BwjB;AAC9B,YAAIA,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,YAAE,UAAS,KAAIA,EAAE,UAAS;QAChC;AACIA,UAAE,WAAWulB,GAAMC,CAAU,KAC/BD,EAAK,IAAIvlB,CAAC;MAEd;IACF;EACF;EA2BA,OACE8V,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAU,IAAI1O,EAA4B,EAAE,YAAY,KAAI,CAAE;AAAA,KAChE,CAACtN,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,MAAMF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAExD,QAAMyP,IAAO,oBAAI,OACXiC,IAAoB,CAAC1R,CAAK,GAC5B2R,IAAa,GACXC,IAAU,MAAK;AACnB,UAAIC,IAAS;AACb,aAAO,CAACA,KAAQ;AACd,YAAMJ,IAAMC,EAAM,MAAK;AACvB,YAAI,CAACD,GAAK;AACJE,gBAAe,KAAGJ,EAAQ,IAAG;AACjC;QACF;AAEAI,aACAlC,EAAK,IAAIgC,CAAG;AAEZ,YAAMK,IAAY,CAChBrQ,GACA8N,GACAwC,IAAwB,UACtB;AAEF,cAAItQ,EAAI,QAAO8P,EAAQ,KAAK,SAAS9P,CAAE;AAEvC,cAAI6P,KAAU,CAACS,GAAc;AAC3B,gBAAMC,IAA4C,CAAA;AAClD,qBAAWtE,KAAK6B,EACV7B,GAAE,eAAc,KAClBsE,EAAS,KACPtE,EACG,SAAQ,EACR,KAAMxjB,OACLA,GAAG,UAAS,IAAKA,EAAE,MAAK,IAAKA,CAAC,CAC/B;AAIT,gBAAI8nB,EAAS,QAAQ;AACnB,sBAAQ,IAAIA,CAAQ,EAAE,KAAK,MACzBF,EAAU,MAAMvC,GAAS,IAAI,CAAC;AAEhC;YACF;UACF;AAEA,mBAAW7B,KAAK6B,EACV7B,OAAM,CAACnY,KAAUA,EAAOmY,CAAC,OACtB6D,EAAQ,MAAMF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,MACjDmE,IAAS;AAKfF;AACA,mBAAWjE,KAAK6B,GAAS;AACvB,gBAAMrlB,IAAIwjB,EAAE,eAAc,KAAMA;AAC5BxjB,cAAE,WAAWulB,GAAMC,CAAU,KAC/BgC,EAAM,KAAKxnB,CAAC;UAEhB;AACI2nB,eAAU,CAACN,EAAQ,UACrBA,EAAQ,KAAK,SAASK,CAAO,IACnBK,KACVL,EAAO;QAEX,GAGIK,IAAO;AACXR,UAAI,UAAUK,GAAW,IAAI,GAC7BG,IAAO;MACT;IACF;AACA,WAAAL,EAAO,GACAL;EACT;EA8BA,WACEvR,IAAyC,KAAK,KAC9CyF,IAAoB,CAAA,GAAE;AAElB,WAAOzF,KAAU,WACnBA,IAAQ,KAAK,IAAI,QAAQA,CAAK,IACnBA,aAAiBgK,MAC5BvE,IAAOzF,GACPA,IAAQ,KAAK;AAEf,QAAM,EACJ,eAAAqR,IAAgB,MAChB,QAAAC,IAAS,OACT,QAAA/b,GACA,YAAAma,EAAU,IACRjK,GACE8L,IAAU,IAAI1O,EAA4B,EAAE,YAAY,KAAI,CAAE,GAC9D4M,IAAO,oBAAI;AAAA,KACb,CAACla,KAAUA,EAAOyK,CAAK,MACzBuR,EAAQ,MAAMF,IAAgBrR,IAAQA,EAAM,SAAQ,CAAE;AAExD,QAAM0R,IAAoB,CAAC1R,CAAK,GAC5B2R,IAAa,GACXC,IAAU,MAAK;AACnB,UAAIC,IAAS;AACb,aAAO,CAACA,KAAQ;AACd,YAAMJ,IAAMC,EAAM,MAAK;AACvB,YAAI,CAACD,GAAK;AACJE,gBAAe,KAAGJ,EAAQ,IAAG;AACjC;QACF;AACAI,aACAlC,EAAK,IAAIgC,CAAG;AAEZ,YAAMlC,IAAUkC,EAAI,YAAW;AAC/B,iBAAW/D,KAAK6B,EAAAA,EACV,CAACha,KAAUA,EAAOmY,CAAC,OAChB6D,EAAQ,MAAMF,IAAgB3D,IAAIA,EAAE,SAAQ,CAAE,MACjDmE,IAAS;AAIfF;AACA,iBAAWjE,KAAK6B,GAAS;AACvB,cAAIrlB,IAA0BwjB;AAC9B,cAAIA,EAAE,eAAc,GAAI;AACtB,gBAAI,EAAE4D,MAAWpnB,IAAIwjB,EAAE,aAAY,IAAM;AACrCxjB,cAAE,UAAS,KAAIA,EAAE,UAAS;UAChC;AACIA,YAAE,WAAWulB,GAAMC,CAAU,KAC/BgC,EAAM,KAAKxnB,CAAC;QAEhB;MACF;AACI2nB,WAAU,CAACN,EAAQ,WAASA,EAAQ,KAAK,SAASK,CAAO;IAC/D;AACA,WAAAA,EAAO,GACAL;EACT;EAEA,MAAMrc,IAAsB,KAAK,KAAG;AAClC,QAAM0a,IAAS,KAAK;AACpB,SAAK,MAAM,OAAO1a,KAAS,WAAW,KAAK,IAAI,QAAQA,CAAI,IAAIA,GAC/D,KAAK,IAAI6U,EAAQ,EAAE6F,CAAM;EAC3B;AAAA;AA1iFF,IAknFaM,KAAP,cAA+BI,GAAc;EAIjD,MAAY;EAEZ,YACEG,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,KAAI,IAAKvG;AAC1B,UAAMgL,GAAKT,iBAAAA,OAAO,MAAM,EAAE,GAAGvK,GAAM,QAAAuG,EAAM,CAAE,GAC3C,KAAK,SAASA;AACd,aAASrgB,IAA0B,KAAK,KAAKA,GAAGA,IAAIA,EAAE,OACpDA,GAAE,SAAS,KAAK;EAEpB;EAKA,cAAc8lB,GAAW;AAIvB,WAAOzB,iBAAAA,MAAM,MAAMyB,CAAG,EAAE,KAAK,YAAW;EAC1C;EAKA,QAAQb,GAAW;AACjB,WAAO,IAAId,GACT,KAAK,UACLtH,GACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAoI,EAAE,CAAE;EAEV;EAKA,WAAWjlB,GAAS;AAClB,WACEA,EAAE,WAAW,GAAG,KAAKA,EAAE,WAAW,IAAI,KAAK,kBAAkB,KAAKA,CAAC;EAEvE;AAAA;AApqFF,IA8qFaumB,KAAP,cAA+B5B,GAAc;EAIjD,MAAW;EACX,YACEG,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,MAAK,IAAKvG;AAC3B,UAAMgL,GAAK0B,iBAAAA,OAAO,KAAK,EAAE,GAAG1M,GAAM,QAAAuG,EAAM,CAAE,GAC1C,KAAK,SAASA;EAChB;EAKA,cAAcoG,GAAY;AACxB,WAAO;EACT;EAKA,QAAQxB,GAAW;AACjB,WAAO,IAAIT,GACT,KAAK,UACL3H,GACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAoI,EAAE,CAAE;EAEV;EAKA,WAAWjlB,GAAS;AAClB,WAAOA,EAAE,WAAW,GAAG;EACzB;AAAA;AAvtFF,IAkuFa0mB,KAAP,cAAgCH,GAAe;EACnD,YACEzB,IAAoB,QAAQ,IAAG,GAC/BhL,IAAuB,CAAA,GAAE;AAEzB,QAAM,EAAE,QAAAuG,IAAS,KAAI,IAAKvG;AAC1B,UAAMgL,GAAK,EAAE,GAAGhL,GAAM,QAAAuG,EAAM,CAAE;EAChC;AAAA;AAzuFF,IAivFasG,KAAO,QAAQ,aAAa,UAAUxC,KAAYK;AAjvF/D,IA0vFaoC,KAIX,QAAQ,aAAa,UAAUrC,KAC7B,QAAQ,aAAa,WAAWmC,KAChCH;AE5vFJ,IAAMM,KAAiBnhB,CAAAA,OACrBA,GAAG,UAAU;AADf,IAEMohB,KAAcC,CAAAA,OAAiCA,GAAG,UAAU;AAFlE,IAIMC,KAAgB,uBAAO,IAAI,4BAA4B;AAJ7D,IAUaC,KAAP,MAAOC,GAAO;EACTC;EACAC;EACAC;EACA;EACAC;EACTC;EACAC;EACAC;EACAC;EACAC;EACAC,KAA2B;EAE3B,YACEC,GACAC,GACAtX,GACAuX,GAAyB;AAEzB,QAAI,CAAClB,GAAcgB,CAAW,EAC5B,OAAM,IAAI,UAAU,oBAAoB;AAE1C,QAAI,CAACf,GAAWgB,CAAQ,EACtB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,QAAIA,EAAS,WAAWD,EAAY,OAClC,OAAM,IAAI,UAAU,+CAA+C;AAGrE,QADA,KAAK,SAASA,EAAY,QACtBrX,IAAQ,KAAKA,KAAS,KAAK,OAC7B,OAAM,IAAI,UAAU,oBAAoB;AAQ1C,QANA,KAAK2W,KAAeU,GACpB,KAAKT,KAAYU,GACjB,KAAKT,KAAS7W,GACd,KAAK8W,KAAYS,GAGb,KAAKV,OAAW,GAAA;AASlB,UAAI,KAAK,MAAK,GAAI;AAEhB,YAAM,CAACW,GAAIC,GAAI3c,GAAI4c,GAAI,GAAGC,CAAK,IAAI,KAAKhB,IAClC,CAACiB,GAAIC,GAAIC,GAAIC,GAAI,GAAGC,CAAK,IAAI,KAAKpB;AACpCe,UAAM,CAAC,MAAM,OAEfA,EAAM,MAAK,GACXK,EAAM,MAAK;AAEb,YAAM,IAAI,CAACR,GAAIC,GAAI3c,GAAI4c,GAAI,EAAE,EAAE,KAAK,GAAG,GACjCO,IAAI,CAACL,GAAIC,GAAIC,GAAIC,GAAI,EAAE,EAAE,KAAK,GAAG;AACvC,aAAKpB,KAAe,CAAC,GAAG,GAAGgB,CAAK,GAChC,KAAKf,KAAY,CAACqB,GAAG,GAAGD,CAAK,GAC7B,KAAK,SAAS,KAAKrB,GAAa;MAClC,WAAW,KAAK,QAAO,KAAM,KAAK,WAAU,GAAI;AAC9C,YAAM,CAACc,GAAI,GAAGE,CAAK,IAAI,KAAKhB,IACtB,CAACkB,GAAI,GAAGG,CAAK,IAAI,KAAKpB;AACxBe,UAAM,CAAC,MAAM,OAEfA,EAAM,MAAK,GACXK,EAAM,MAAK;AAEb,YAAMxoB,IAAKioB,IAAgB,KACrBQ,IAAIJ,IAAK;AACf,aAAKlB,KAAe,CAACnnB,GAAG,GAAGmoB,CAAK,GAChC,KAAKf,KAAY,CAACqB,GAAG,GAAGD,CAAK,GAC7B,KAAK,SAAS,KAAKrB,GAAa;MAClC;IAAA;EAEJ;EAEA,CAACH,EAAa,IAAC;AACb,WAAO,cAAc,KAAKI,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG,IAAI;EACrE;EAKA,UAAO;AACL,WAAO,KAAKF,GAAa,KAAKE,EAAM;EACtC;EAKA,WAAQ;AACN,WAAO,OAAO,KAAKF,GAAa,KAAKE,EAAM,KAAM;EACnD;EAIA,aAAU;AACR,WAAO,KAAKF,GAAa,KAAKE,EAAM,MAAM5d;EAC5C;EAIA,WAAQ;AACN,WAAO,KAAK0d,GAAa,KAAKE,EAAM,aAAa;EACnD;EAKA,aAAU;AACR,WAAQ,KAAKG,KACX,KAAKA,OACJ,KAAKH,OAAW,IACf,KAAK,WAAU,IACb,KAAKD,GAAU,CAAC,IAAI,KAAKA,GAAU,MAAM,CAAC,EAAE,KAAK,GAAG,IACpD,KAAKA,GAAU,KAAK,GAAG,IACzB,KAAKA,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG;EAChD;EAKA,UAAO;AACL,WAAO,KAAK,SAAS,KAAKA,KAAS;EACrC;EAKA,OAAI;AACF,WAAI,KAAKE,OAAU,SAAkB,KAAKA,KACrC,KAAK,QAAO,KACjB,KAAKA,KAAQ,IAAIL,GACf,KAAKC,IACL,KAAKC,IACL,KAAKC,KAAS,GACd,KAAKC,EAAS,GAEhB,KAAKC,GAAMI,KAAc,KAAKA,IAC9B,KAAKJ,GAAMG,KAAS,KAAKA,IACzB,KAAKH,GAAME,KAAW,KAAKA,IACpB,KAAKF,MAViB,KAAKA,KAAQ;EAW5C;EAKA,QAAK;AACH,QAAM7hB,IAAK,KAAKyhB;AAChB,WAAO,KAAKO,OAAW,SACnB,KAAKA,KACJ,KAAKA,KACJ,KAAKJ,OAAc,WACnB,KAAKD,OAAW,KAChB3hB,EAAG,CAAC,MAAM,MACVA,EAAG,CAAC,MAAM,MACV,OAAOA,EAAG,CAAC,KAAM,YACjB,CAAC,CAACA,EAAG,CAAC,KACN,OAAOA,EAAG,CAAC,KAAM,YACjB,CAAC,CAACA,EAAG,CAAC;EACd;EAUA,UAAO;AACL,QAAMA,IAAK,KAAKyhB;AAChB,WAAO,KAAKM,OAAa,SACrB,KAAKA,KACJ,KAAKA,KACJ,KAAKH,OAAc,WACnB,KAAKD,OAAW,KAChB,KAAK,SAAS,KACd,OAAO3hB,EAAG,CAAC,KAAM,YACjB,YAAY,KAAKA,EAAG,CAAC,CAAC;EAC9B;EAQA,aAAU;AACR,QAAMA,IAAK,KAAKyhB;AAChB,WAAO,KAAKQ,OAAgB,SACxB,KAAKA,KACJ,KAAKA,KACHjiB,EAAG,CAAC,MAAM,MAAMA,EAAG,SAAS,KAC7B,KAAK,QAAO,KACZ,KAAK,MAAK;EAClB;EAKA,OAAI;AACF,QAAM1F,IAAI,KAAKmnB,GAAa,CAAC;AAC7B,WACI,OAAOnnB,KAAM,YAAY,KAAK,WAAU,KAAM,KAAKqnB,OAAW,IAE9DrnB,IACA;EACN;EAMA,sBAAmB;AACjB,WAAO,EACL,KAAKqnB,OAAW,KAChB,CAAC,KAAK,WAAU,KAChB,CAAC,KAAKO;EAEV;EAKA,qBAAkB;AAChB,WAAI,KAAKP,OAAW,KAAK,CAAC,KAAK,WAAU,KAAM,CAAC,KAAKO,KAC5C,SACT,KAAKA,KAAkB,OAChB;EACT;AAAA;ACpPF,IAAMte,KAEF,OAAO,WAAY,YACnB,WACA,OAAO,QAAQ,YAAa,WAE5B,QAAQ,WACR;AAPJ,IAYaof,KAAP,MAAa;EACjB;EACA;EACA;EACA;EACA;EACA;EAEA,YACEC,GACA,EACE,SAAAC,GACA,QAAAvI,GACA,OAAAtX,GACA,YAAA8f,GACA,UAAAd,IAAWze,GAAe,GACX;AAEjB,SAAK,WAAW,CAAA,GAChB,KAAK,WAAW,CAAA,GAChB,KAAK,mBAAmB,CAAA,GACxB,KAAK,mBAAmB,CAAA,GACxB,KAAK,WAAWye,GAChB,KAAK,SAAS,EACZ,KAAK,MACL,SAAAa,GACA,QAAAvI,GACA,OAAAtX,GACA,YAAA8f,GACA,mBAAmB,GACnB,UAAAd,GACA,WAAW,MACX,UAAU,KAAA;AAEZ,aAAWe,KAAOH,EAAS,MAAK,IAAIG,CAAG;EACzC;EAEA,IAAIA,GAAW;AAab,QAAM1e,IAAK,IAAIvC,EAAUihB,GAAK,KAAK,MAAM;AACzC,aAASxqB,IAAI,GAAGA,IAAI8L,EAAG,IAAI,QAAQ9L,KAAK;AACtC,UAAMyqB,IAAS3e,EAAG,IAAI9L,CAAC,GACjBwM,IAAYV,EAAG,UAAU9L,CAAC;AAEhC,UAAI,CAACyqB,KAAU,CAACje,EACd,OAAM,IAAI,MAAM,wBAAwB;AAI1C,aAAOie,EAAO,CAAC,MAAM,OAAOje,EAAU,CAAC,MAAM,MAC3Cie,GAAO,MAAK,GACZje,EAAU,MAAK;AAGjB,UAAM9K,IAAI,IAAIinB,GAAQ8B,GAAQje,GAAW,GAAG,KAAK,QAAQ,GACnDhN,IAAI,IAAI+J,EAAU7H,EAAE,WAAU,GAAI,KAAK,MAAM,GAC7CsgB,IAAWxV,EAAUA,EAAU,SAAS,CAAC,MAAM,MAC/Cke,IAAWhpB,EAAE,WAAU;AACzBgpB,UAAU,KAAK,SAAS,KAAKlrB,CAAC,IAC7B,KAAK,SAAS,KAAKA,CAAC,GACrBwiB,MACE0I,IAAU,KAAK,iBAAiB,KAAKlrB,CAAC,IACrC,KAAK,iBAAiB,KAAKA,CAAC;IAErC;EACF;EAEA,QAAQkC,GAAO;AACb,QAAM2gB,IAAW3gB,EAAE,SAAQ,GACrBipB,IAAY,GAAGtI,CAAQ,KACvBuI,IAAWlpB,EAAE,SAAQ,KAAM,KAC3BmpB,IAAY,GAAGD,CAAQ;AAC7B,aAAWprB,KAAK,KAAK,SACnB,KAAIA,EAAE,MAAMorB,CAAQ,KAAKprB,EAAE,MAAMqrB,CAAS,EAAG,QAAO;AAEtD,aAAWrrB,KAAK,KAAK,SACnB,KAAIA,EAAE,MAAM6iB,CAAQ,KAAK7iB,EAAE,MAAMmrB,CAAS,EAAG,QAAO;AAEtD,WAAO;EACT;EAEA,gBAAgBjpB,GAAO;AACrB,QAAM2gB,IAAW3gB,EAAE,SAAQ,IAAK,KAC1BkpB,KAAYlpB,EAAE,SAAQ,KAAM,OAAO;AACzC,aAAWlC,KAAK,KAAK,iBACnB,KAAIA,EAAE,MAAMorB,CAAQ,EAAG,QAAO;AAEhC,aAAWprB,KAAK,KAAK,iBACnB,KAAIA,EAAE,MAAM6iB,CAAQ,EAAG,QAAO;AAEhC,WAAO;EACT;AAAA;ACxHI,IAAOyI,KAAP,MAAOC,GAAc;EACzB;EACA,YAAYC,IAAkC,oBAAI,OAAK;AACrD,SAAK,QAAQA;EACf;EACA,OAAI;AACF,WAAO,IAAID,GAAe,IAAI,IAAI,KAAK,KAAK,CAAC;EAC/C;EACA,UAAUnI,GAAclf,GAAgB;AACtC,WAAO,KAAK,MAAM,IAAIkf,EAAO,SAAQ,CAAE,GAAG,IAAIlf,EAAQ,WAAU,CAAE;EACpE;EACA,YAAYkf,GAAclf,GAAgB;AACxC,QAAM2e,IAAWO,EAAO,SAAQ,GAC1BT,IAAS,KAAK,MAAM,IAAIE,CAAQ;AAClCF,QAAQA,EAAO,IAAIze,EAAQ,WAAU,CAAE,IACtC,KAAK,MAAM,IAAI2e,GAAU,oBAAI,IAAI,CAAC3e,EAAQ,WAAU,CAAE,CAAC,CAAC;EAC/D;AAAA;AAhBI,IAwBOunB,KAAP,MAAkB;EACtB,QAA2B,oBAAI;EAC/B,IAAIrI,GAAc8H,GAAmBQ,GAAc;AACjD,QAAMpoB,KAAK4nB,IAAW,IAAI,MAAMQ,IAAQ,IAAI,IACtCC,IAAU,KAAK,MAAM,IAAIvI,CAAM;AACrC,SAAK,MAAM,IAAIA,GAAQuI,MAAY,SAAYroB,IAAIA,IAAIqoB,CAAO;EAChE;EAEA,UAAO;AACL,WAAO,CAAC,GAAG,KAAK,MAAM,QAAO,CAAE,EAAE,IAAI,CAAC,CAAClgB,GAAMnI,CAAC,MAAM,CAClDmI,GACA,CAAC,EAAEnI,IAAI,IACP,CAAC,EAAEA,IAAI,EAAA,CACR;EACH;AAAA;AAtCI,IA6COsoB,KAAP,MAAe;EACnB,QAA8B,oBAAI;EAClC,IAAIxI,GAAclf,GAAgB;AAChC,QAAI,CAACkf,EAAO,WAAU,EACpB;AAEF,QAAMyI,IAAO,KAAK,MAAM,IAAIzI,CAAM;AAC9ByI,QACGA,EAAK,KAAK3pB,OAAKA,EAAE,WAAU,MAAOgC,EAAQ,WAAU,CAAE,KACzD2nB,EAAK,KAAK3nB,CAAO,IAEd,KAAK,MAAM,IAAIkf,GAAQ,CAAClf,CAAO,CAAC;EACzC;EACA,IAAIkf,GAAY;AACd,QAAMyI,IAAO,KAAK,MAAM,IAAIzI,CAAM;AAElC,QAAI,CAACyI,EACH,OAAM,IAAI,MAAM,iCAAiC;AAGnD,WAAOA;EACT;EACA,UAAO;AACL,WAAO,KAAK,KAAI,EAAG,IAAI7oB,OAAK,CAACA,GAAG,KAAK,MAAM,IAAIA,CAAC,CAAc,CAAC;EACjE;EACA,OAAI;AACF,WAAO,CAAC,GAAG,KAAK,MAAM,KAAI,CAAE,EAAE,OAAO,OAAK,EAAE,WAAU,CAAE;EAC1D;AAAA;AAxEI,IAiFO8oB,KAAP,MAAOC,GAAS;EACpB;EACA,UAAU,IAAIN;EACd,WAAW,IAAIG;EACf;EACA;EACA;EACA;EAEA,YAAY5P,GAAsBgQ,GAA+B;AAC/D,SAAK,OAAOhQ,GACZ,KAAK,SAAS,CAAC,CAACA,EAAK,QACrB,KAAK,MAAM,CAAC,CAACA,EAAK,KAClB,KAAK,iBACHgQ,IAAiBA,EAAe,KAAI,IAAK,IAAIV;EACjD;EAEA,gBAAgBlI,GAAc6I,GAAmB;AAC/C,SAAK,WAAWA;AAChB,QAAMC,IAAmCD,EAAS,IAAI/pB,OAAK,CAACkhB,GAAQlhB,CAAC,CAAC;AAKtE,aAAS,CAAC6S,GAAG7Q,CAAO,KAAKgoB,GAAe;AACtC,WAAK,eAAe,YAAYnX,GAAG7Q,CAAO;AAE1C,UAAMme,IAAOne,EAAQ,KAAI,GACnBgnB,IAAWhnB,EAAQ,WAAU,KAAM,KAAK,KAAK,aAAa;AAGhE,UAAIme,GAAM;AACRtN,YAAIA,EAAE,QACJsN,MAAS,OAAO,KAAK,KAAK,SAAS,SACjC,KAAK,KAAK,OACVA,CAAI;AAER,YAAM8J,IAAOjoB,EAAQ,KAAI;AACzB,YAAKioB,EAIHjoB,KAAUioB;aAJD;AACT,eAAK,QAAQ,IAAIpX,GAAG,MAAM,KAAK;AAC/B;QACF;MAGF;AAEA,UAAIA,EAAE,SAAQ,EAAI;AAElB,UAAI7S,GACAiqB,GACA/F,IAAU;AACd,aACE,QAAQlkB,IAAIgC,EAAQ,QAAO,MAAQ,aAClCioB,IAAOjoB,EAAQ,KAAI,KAGpB6Q,KADUA,EAAE,QAAQ7S,CAAC,GAErBgC,IAAUioB,GACV/F,IAAU;AAIZ,UAFAlkB,IAAIgC,EAAQ,QAAO,GACnBioB,IAAOjoB,EAAQ,KAAI,GACfkiB,GAAS;AACX,YAAI,KAAK,eAAe,UAAUrR,GAAG7Q,CAAO,EAAG;AAC/C,aAAK,eAAe,YAAY6Q,GAAG7Q,CAAO;MAC5C;AAKA,UAAI,OAAOhC,KAAM,UAAU;AAGzB,YAAMwpB,IAAQxpB,MAAM,QAAQA,MAAM,MAAMA,MAAM;AAC9C,aAAK,QAAQ,IAAI6S,EAAE,QAAQ7S,CAAC,GAAGgpB,GAAUQ,CAAK;AAC9C;MACF,WAAWxpB,MAAMyJ,GAAU;AAAA,SAOvB,CAACoJ,EAAE,eAAc,KACjB,KAAK,UACL7Q,EAAQ,oBAAmB,MAE3B,KAAK,SAAS,IAAI6Q,GAAG7Q,CAAO;AAE9B,YAAMgiB,IAAKiG,GAAM,QAAO,GAClBC,IAAQD,GAAM,KAAI;AACxB,YAAI,CAACA,MAAUjG,MAAO,MAAMA,MAAO,QAAQ,CAACkG,EAG1C,MAAK,QAAQ,IAAIrX,GAAGmW,GAAUhF,MAAO,MAAMA,MAAO,GAAG;iBAEjDA,MAAO,MAAM;AAIf,cAAMmG,IAAKtX,EAAE,UAAUA;AAElBqX,cACK,KAAK,eAAe,UAAUC,GAAID,CAAK,KAC/C,KAAK,SAAS,IAAIC,GAAID,CAAK,IAFjB,KAAK,QAAQ,IAAIC,GAAInB,GAAU,IAAI;QAIjD;MAEJ,MAAWhpB,cAAa,UACtB,KAAK,SAAS,IAAI6S,GAAG7Q,CAAO;IAEhC;AAEA,WAAO;EACT;EAEA,iBAAc;AACZ,WAAO,KAAK,SAAS,KAAI;EAC3B;EAEA,QAAK;AACH,WAAO,IAAI6nB,GAAU,KAAK,MAAM,KAAK,cAAc;EACrD;EAMA,cAAcxkB,GAAcue,GAAe;AACzC,QAAMmG,IAAW,KAAK,SAAS,IAAI1kB,CAAM,GAEnCugB,IAAU,KAAK,MAAK;AAC1B,aAAW7D,KAAK6B,EACd,UAAW5hB,KAAW+nB,GAAU;AAC9B,UAAMf,IAAWhnB,EAAQ,WAAU,GAC7BhC,IAAIgC,EAAQ,QAAO,GACnBioB,IAAOjoB,EAAQ,KAAI;AACrBhC,YAAMyJ,IACRmc,EAAQ,aAAa7D,GAAG/f,GAASioB,GAAMjB,CAAQ,IACtChpB,aAAa,SACtB4lB,EAAQ,WAAW7D,GAAG/hB,GAAGiqB,GAAMjB,CAAQ,IAEvCpD,EAAQ,WAAW7D,GAAG/hB,GAAGiqB,GAAMjB,CAAQ;IAE3C;AAEF,WAAOpD;EACT;EAEA,aACE7D,GACA/f,GACAioB,GACAjB,GAAiB;AAyBjB,SAvBI,KAAK,OAAO,CAACjH,EAAE,KAAK,WAAW,GAAG,OAC/B/f,EAAQ,QAAO,KAClB,KAAK,QAAQ,IAAI+f,GAAGiH,GAAU,KAAK,GAEjCjH,EAAE,WAAU,MAMV,KAAK,UAAU,CAACA,EAAE,eAAc,IAClC,KAAK,SAAS,IAAIA,GAAG/f,CAAO,IACnB+f,EAAE,eAAc,MACrBkI,KAAQjoB,EAAQ,oBAAmB,IACrC,KAAK,SAAS,IAAI+f,GAAGkI,CAAI,IAChBjoB,EAAQ,mBAAkB,KACnC,KAAK,SAAS,IAAI+f,GAAG/f,CAAO,MAOhCioB,GAAM;AACR,UAAMjG,IAAKiG,EAAK,QAAO;AACvB,UACE,OAAOjG,KAAO,YAEdA,MAAO,QACPA,MAAO,MACPA,MAAO,IAEP,MAAK,WAAWjC,GAAGiC,GAAIiG,EAAK,KAAI,GAAIjB,CAAQ;eACnChF,MAAO,MAAM;AAEtB,YAAMoG,IAAKrI,EAAE,UAAUA;AAEvB,aAAK,SAAS,IAAIqI,GAAIH,CAAI;MAC5B,MAAWjG,cAAc,UACvB,KAAK,WAAWjC,GAAGiC,GAAIiG,EAAK,KAAI,GAAIjB,CAAQ;IAEhD;EACF;EAEA,WACEjH,GACA/hB,GACAiqB,GACAjB,GAAiB;AAEZhpB,MAAE,KAAK+hB,EAAE,IAAI,MACbkI,IAGH,KAAK,SAAS,IAAIlI,GAAGkI,CAAI,IAFzB,KAAK,QAAQ,IAAIlI,GAAGiH,GAAU,KAAK;EAIvC;EAEA,WAAWjH,GAAS/hB,GAAWiqB,GAAsBjB,GAAiB;AAE/DjH,MAAE,QAAQ/hB,CAAC,MACXiqB,IAGH,KAAK,SAAS,IAAIlI,GAAGkI,CAAI,IAFzB,KAAK,QAAQ,IAAIlI,GAAGiH,GAAU,KAAK;EAIvC;AAAA;AC9OF,IAAMqB,KAAa,CACjBC,IACAxQ,MAEA,OAAOwQ,MAAW,WAAW,IAAI5B,GAAO,CAAC4B,EAAM,GAAGxQ,CAAI,IACpD,MAAM,QAAQwQ,EAAM,IAAI,IAAI5B,GAAO4B,IAAQxQ,CAAI,IAC/CwQ;AANJ,IAWsBC,KAAhB,MAAwB;EAC5B;EACA;EACA;EACA,OAAkB,oBAAI;EACtB,SAAkB;EAClB,UAAmB;EACnBC,KAA2B,CAAA;EAC3BC;EACAC;EACA;EACA;EACA;EAGA,YAAYX,GAAqBxgB,GAAYuQ,GAAO;AAMlD,QALA,KAAK,WAAWiQ,GAChB,KAAK,OAAOxgB,GACZ,KAAK,OAAOuQ,GACZ,KAAK4Q,KAAO,CAAC5Q,EAAK,SAASA,EAAK,aAAa,UAAU,OAAO,KAC9D,KAAK,sBAAsBA,EAAK,wBAAwB,QACpDA,EAAK,UAAU,CAAC,KAAK,yBACvB,KAAK2Q,KAAUJ,GAAWvQ,EAAK,UAAU,CAAA,GAAIA,CAAI,GAE/C,CAAC,KAAK,uBACN,OAAO,KAAK2Q,GAAQ,OAAQ,aAC5B;AACA,UAAM3sB,IAAI;AACV,YAAM,IAAI,MAAMA,CAAC;IACnB;AAKF,SAAK,WAAWgc,EAAK,YAAY,IAAA,GAE7BA,EAAK,WACP,KAAK,SAASA,EAAK,QACnB,KAAK,OAAO,iBAAiB,SAAS,MAAK;AACzC,WAAK0Q,GAAU,SAAS;IAC1B,CAAC;EAEL;EAEAG,GAASphB,GAAU;AACjB,WAAO,KAAK,KAAK,IAAIA,CAAI,KAAK,CAAC,CAAC,KAAKkhB,IAAS,UAAUlhB,CAAI;EAC9D;EACAqhB,GAAiBrhB,GAAU;AACzB,WAAO,CAAC,CAAC,KAAKkhB,IAAS,kBAAkBlhB,CAAI;EAC/C;EAGA,QAAK;AACH,SAAK,SAAS;EAChB;EACA,SAAM;AAEJ,QAAI,KAAK,QAAQ,QAAS;AAE1B,SAAK,SAAS;AACd,QAAIoE;AACJ,WAAO,CAAC,KAAK,WAAWA,IAAK,KAAK6c,GAAU,MAAK,KAC/C7c,GAAE;EAEN;EACA,SAASA,GAAa;AAChB,SAAK,QAAQ,YAEZ,KAAK,SAIR,KAAK6c,GAAU,KAAK7c,CAAE,IAHtBA,EAAE;EAKN;EAIA,MAAM,WAAWoU,GAASyH,GAAc;AACtC,QAAIA,KAAS,KAAK,KAAK,MAAO;AAC9B,QAAIqB;AACJ,QAAI,KAAK,KAAK,UAAU;AAEtB,UADAA,IAAM9I,EAAE,eAAc,KAAO,MAAMA,EAAE,SAAQ,GACzC,CAAC8I,EAAK;AACV9I,UAAI8I;IACN;AAEA,QAAM1oB,IADW4f,EAAE,UAAS,KAAM,KAAK,KAAK,OACvB,MAAMA,EAAE,MAAK,IAAKA;AACvC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS5f,GAAG,eAAc,GAAI;AAC9D,UAAM+e,IAAS,MAAM/e,EAAE,SAAQ;AAE3B+e,YAAWA,EAAO,UAAS,KAAM,KAAK,KAAK,SAC7C,MAAMA,EAAO,MAAK;IAGtB;AACA,WAAO,KAAK,eAAe/e,GAAGqnB,CAAK;EACrC;EAEA,eAAezH,GAAqByH,GAAc;AAChD,WACIzH,MACG,KAAK,aAAa,IAAA,KAAYA,EAAE,MAAK,KAAM,KAAK,cAChD,CAACyH,KAASzH,EAAE,WAAU,OACtB,CAAC,KAAK,KAAK,SAAS,CAACA,EAAE,YAAW,OAClC,CAAC,KAAK,KAAK,SACV,CAAC,KAAK,KAAK,UACX,CAACA,EAAE,eAAc,KACjB,CAACA,EAAE,eAAc,GAAI,YAAW,MAClC,CAAC,KAAK4I,GAAS5I,CAAC,IAElBA,IACA;EACN;EAEA,eAAeA,GAASyH,GAAc;AACpC,QAAIA,KAAS,KAAK,KAAK,MAAO;AAC9B,QAAIqB;AACJ,QAAI,KAAK,KAAK,UAAU;AAEtB,UADAA,IAAM9I,EAAE,eAAc,KAAMA,EAAE,aAAY,GACtC,CAAC8I,EAAK;AACV9I,UAAI8I;IACN;AAEA,QAAM1oB,IADW4f,EAAE,UAAS,KAAM,KAAK,KAAK,OACvBA,EAAE,UAAS,IAAKA;AACrC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS5f,GAAG,eAAc,GAAI;AAC9D,UAAM+e,IAAS/e,EAAE,aAAY;AACzB+e,YAAWA,GAAQ,UAAS,KAAM,KAAK,KAAK,SAC9CA,EAAO,UAAS;IAEpB;AACA,WAAO,KAAK,eAAe/e,GAAGqnB,CAAK;EACrC;EAKA,YAAYzH,GAASiH,GAAiB;AACpC,QAAI,KAAK2B,GAAS5I,CAAC,EAAG;AAEtB,QAAI,CAAC,KAAK,uBAAuB,KAAK0I,IAAS,KAAK;AAClD,UAAM3B,IAAM,GAAG/G,EAAE,cAAa,CAAE;AAChC,WAAK0I,GAAQ,IAAI3B,CAAG;IACtB;AACA,QAAMxD,IACJ,KAAK,KAAK,aAAa,SAAY0D,IAAW,KAAK,KAAK;AAC1D,SAAK,KAAK,IAAIjH,CAAC;AACf,QAAM+I,IAAO,KAAK,KAAK,QAAQ/I,EAAE,YAAW,IAAK,KAAK2I,KAAO;AAE7D,QAAI,KAAK,KAAK,cACZ,MAAK,UAAU3I,CAAC;aACPuD,GAAK;AACd,UAAMA,IAAM,KAAK,KAAK,QAAQvD,EAAE,cAAa,IAAKA,EAAE,SAAQ;AAC5D,WAAK,UAAUuD,IAAMwF,CAAI;IAC3B,OAAO;AACL,UAAMC,IAAM,KAAK,KAAK,QAAQhJ,EAAE,cAAa,IAAKA,EAAE,SAAQ,GACtDliB,IACJ,KAAK,KAAK,eAAe,CAACkrB,EAAI,WAAW,OAAO,KAAKL,EAAI,IACvD,MAAM,KAAKA,KACX;AACJ,WAAK,UAAWK,IAAmBlrB,IAAMkrB,IAAMD,IAAzB,MAAMA,CAAuB;IACrD;EACF;EAEA,MAAM,MAAM/I,GAASiH,GAAmBQ,GAAc;AACpD,QAAMxpB,IAAI,MAAM,KAAK,WAAW+hB,GAAGyH,CAAK;AACpCxpB,SAAG,KAAK,YAAYA,GAAGgpB,CAAQ;EACrC;EAEA,UAAUjH,GAASiH,GAAmBQ,GAAc;AAClD,QAAMxpB,IAAI,KAAK,eAAe+hB,GAAGyH,CAAK;AAClCxpB,SAAG,KAAK,YAAYA,GAAGgpB,CAAQ;EACrC;EAEA,OAAO9H,GAAc6I,GAAqB1U,GAAa;AAEjD,SAAK,QAAQ,WAASA,EAAE,GAE5B,KAAK,QAAQ6L,GAAQ6I,GAAU,IAAIH,GAAU,KAAK,IAAI,GAAGvU,CAAE;EAC7D;EAEA,QACE6L,GACA6I,GACAiB,GACA3V,GAAa;AAEb,QAAI,KAAKuV,GAAiB1J,CAAM,EAAG,QAAO7L,EAAE;AAE5C,QADI,KAAK,QAAQ,WAASA,EAAE,GACxB,KAAK,QAAQ;AACf,WAAK,SAAS,MAAM,KAAK,QAAQ6L,GAAQ6I,GAAUiB,GAAW3V,CAAE,CAAC;AACjE;IACF;AACA2V,MAAU,gBAAgB9J,GAAQ6I,CAAQ;AAK1C,QAAIkB,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,MACnBmtB,KACA,KAAK,MAAMntB,GAAGkrB,GAAUQ,CAAK,EAAE,KAAK,MAAMne,EAAI,CAAE;AAGlD,aAAWwH,KAAKmY,EAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,IAAA,KAAYnY,EAAE,MAAK,KAAM,KAAK,SAClD;AAEFoY;AACA,UAAMC,IAAiBrY,EAAE,cAAa;AAClCA,QAAE,cAAa,IACjB,KAAK,QAAQA,GAAGqY,GAAgBF,GAAW3f,CAAI,IAE/CwH,EAAE,UACA,CAACnM,GAAGkd,MAAY,KAAK,QAAQ/Q,GAAG+Q,GAASoH,GAAW3f,CAAI,GACxD,IAAI;IAGV;AAEAA,MAAI;EACN;EAEA,QACE6V,GACA0C,GACAoH,GACA3V,GAAa;AAEb2V,QAAYA,EAAU,cAAc9J,GAAQ0C,CAAO;AAEnD,QAAIqH,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,MACnBmtB,KACA,KAAK,MAAMntB,GAAGkrB,GAAUQ,CAAK,EAAE,KAAK,MAAMne,EAAI,CAAE;AAElD,aAAW,CAAC6V,GAAQ6I,CAAQ,KAAKiB,EAAU,SAAS,QAAO,EACzDC,MACA,KAAK,QAAQ/J,GAAQ6I,GAAUiB,EAAU,MAAK,GAAI3f,CAAI;AAGxDA,MAAI;EACN;EAEA,WAAW6V,GAAc6I,GAAqB1U,GAAa;AAErD,SAAK,QAAQ,WAASA,EAAE,GAE5B,KAAK,YAAY6L,GAAQ6I,GAAU,IAAIH,GAAU,KAAK,IAAI,GAAGvU,CAAE;EACjE;EAEA,YACE6L,GACA6I,GACAiB,GACA3V,GAAa;AAEb,QAAI,KAAKuV,GAAiB1J,CAAM,EAAG,QAAO7L,EAAE;AAE5C,QADI,KAAK,QAAQ,WAASA,EAAE,GACxB,KAAK,QAAQ;AACf,WAAK,SAAS,MACZ,KAAK,YAAY6L,GAAQ6I,GAAUiB,GAAW3V,CAAE,CAAC;AAEnD;IACF;AACA2V,MAAU,gBAAgB9J,GAAQ6I,CAAQ;AAK1C,QAAIkB,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,KACnB,KAAK,UAAUA,GAAGkrB,GAAUQ,CAAK;AAGnC,aAAW3W,KAAKmY,EAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,IAAA,KAAYnY,EAAE,MAAK,KAAM,KAAK,SAClD;AAEFoY;AACA,UAAM3K,IAAWzN,EAAE,YAAW;AAC9B,WAAK,YAAYA,GAAGyN,GAAU0K,GAAW3f,CAAI;IAC/C;AAEAA,MAAI;EACN;EAEA,YACE6V,GACA0C,GACAoH,GACA3V,GAAa;AAEb2V,QAAYA,EAAU,cAAc9J,GAAQ0C,CAAO;AAEnD,QAAIqH,IAAQ,GACN5f,IAAO,MAAK;AACZ,QAAE4f,MAAU,KAAG5V,EAAE;IACvB;AAEA,aAAW,CAACvX,GAAGkrB,GAAUQ,CAAK,KAAKwB,EAAU,QAAQ,QAAO,EACtD,MAAKL,GAAS7sB,CAAC,KACnB,KAAK,UAAUA,GAAGkrB,GAAUQ,CAAK;AAEnC,aAAW,CAACtI,GAAQ6I,CAAQ,KAAKiB,EAAU,SAAS,QAAO,EACzDC,MACA,KAAK,YAAY/J,GAAQ6I,GAAUiB,EAAU,MAAK,GAAI3f,CAAI;AAG5DA,MAAI;EACN;AAAA;AAhVF,IAmVa8f,KAAP,cAEIZ,GAAW;EACnB,UAAU,oBAAI;EAEd,YAAYR,GAAqBxgB,GAAYuQ,GAAO;AAClD,UAAMiQ,GAAUxgB,GAAMuQ,CAAI;EAC5B;EAEA,UAAUiI,GAAY;AACpB,SAAK,QAAQ,IAAIA,CAAC;EACpB;EAEA,MAAM,OAAI;AACR,QAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;AAC5C,WAAI,KAAK,KAAK,UAAS,KACrB,MAAM,KAAK,KAAK,MAAK,GAEvB,MAAM,IAAI,QAAQ,CAAC7L,GAAKC,MAAO;AAC7B,WAAK,OAAO,KAAK,MAAM,KAAK,UAAU,MAAK;AACrC,aAAK,QAAQ,UACfA,EAAI,KAAK,OAAO,MAAM,IAEtBD,EAAI,KAAK,OAAO;MAEpB,CAAC;IACH,CAAC,GACM,KAAK;EACd;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;AAC5C,WAAI,KAAK,KAAK,UAAS,KACrB,KAAK,KAAK,UAAS,GAGrB,KAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAK;AAC7C,UAAI,KAAK,QAAQ,QAAS,OAAM,KAAK,OAAO;IAC9C,CAAC,GACM,KAAK;EACd;AAAA;AA3XF,IA8XakV,KAAP,cAEIb,GAAW;EACnB;EAEA,YAAYR,GAAqBxgB,GAAYuQ,GAAO;AAClD,UAAMiQ,GAAUxgB,GAAMuQ,CAAI,GAC1B,KAAK,UAAU,IAAI5C,EAA+B,EAChD,QAAQ,KAAK,QACb,YAAY,KAAA,CACb,GACD,KAAK,QAAQ,GAAG,SAAS,MAAM,KAAK,OAAM,CAAE,GAC5C,KAAK,QAAQ,GAAG,UAAU,MAAM,KAAK,OAAM,CAAE;EAC/C;EAEA,UAAU6K,GAAY;AACpB,SAAK,QAAQ,MAAMA,CAAC,GACf,KAAK,QAAQ,WAAS,KAAK,MAAK;EACvC;EAEA,SAAM;AACJ,QAAMb,IAAS,KAAK;AACpB,WAAIA,EAAO,UAAS,IAClBA,EAAO,MAAK,EAAG,KAAK,MAAK;AACvB,WAAK,OAAOA,GAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE;IAC7D,CAAC,IAED,KAAK,OAAOA,GAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE,GAEtD,KAAK;EACd;EAEA,aAAU;AACR,WAAI,KAAK,KAAK,UAAS,KACrB,KAAK,KAAK,UAAS,GAErB,KAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE,GAC3D,KAAK;EACd;AAAA;AP1dF,IAAM5X,KAEF,OAAO,WAAY,YACnB,WACA,OAAO,QAAQ,YAAa,WAE5B,QAAQ,WACR;AAPJ,IA4Wa+hB,IAAP,MAAW;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAKA;EAKA;EAcA,YAAYrpB,GAA4B8X,GAAU;AAEhD,QAAI,CAACA,EAAM,OAAM,IAAI,UAAU,uBAAuB;AA8BtD,QA5BA,KAAK,gBAAgB,CAAC,CAACA,EAAK,eAC5B,KAAK,SAASA,EAAK,QACnB,KAAK,SAAS,CAAC,CAACA,EAAK,QACrB,KAAK,MAAM,CAAC,CAACA,EAAK,KAClB,KAAK,cAAc,CAAC,CAACA,EAAK,aAC1B,KAAK,QAAQ,CAAC,CAACA,EAAK,OACpB,KAAK,OAAO,CAAC,CAACA,EAAK,MACdA,EAAK,OAECA,EAAK,eAAe,OAAOA,EAAK,IAAI,WAAW,SAAS,OACjEA,EAAK,UAAMoL,gBAAAA,eAAcpL,EAAK,GAAG,KAFjC,KAAK,MAAM,IAIb,KAAK,MAAMA,EAAK,OAAO,IACvB,KAAK,OAAOA,EAAK,MACjB,KAAK,gBAAgB,CAAC,CAACA,EAAK,eAC5B,KAAK,UAAU,CAAC,CAACA,EAAK,SACtB,KAAK,QAAQ,CAAC,CAACA,EAAK,OACpB,KAAK,WAAW,CAAC,CAACA,EAAK,UACvB,KAAK,WAAWA,EAAK,UACrB,KAAK,sBAAsBA,EAAK,wBAAwB,OAExD,KAAK,aAAa,CAAC,CAACA,EAAK,YACzB,KAAK,YAAY,CAAC,CAACA,EAAK,WACxB,KAAK,WACH,OAAOA,EAAK,YAAa,WAAWA,EAAK,WAAW,IAAA,GACtD,KAAK,OAAO,CAAC,CAACA,EAAK,MACnB,KAAK,SAASA,EAAK,QAEf,KAAK,iBAAiB,KAAK,aAAa,OAC1C,OAAM,IAAI,MAAM,4CAA4C;AAgB9D,QAbI,OAAO9X,KAAY,aACrBA,IAAU,CAACA,CAAO,IAGpB,KAAK,uBACH,CAAC,CAAC8X,EAAK,wBACNA,EAA0C,uBACzC,OAEA,KAAK,yBACP9X,IAAUA,EAAQ,IAAIhC,OAAKA,EAAE,QAAQ,OAAO,GAAG,CAAC,IAG9C,KAAK,WAAW;AAClB,UAAI8Z,EAAK,WACP,OAAM,IAAI,UAAU,iCAAiC;AAEvD9X,UAAUA,EAAQ,IAAIhC,OAAMA,EAAE,SAAS,GAAG,IAAIA,IAAI,QAAQA,CAAC,EAAG;IAChE;AAMA,QAJA,KAAK,UAAUgC,GAEf,KAAK,WAAW8X,EAAK,YAAYxQ,IACjC,KAAK,OAAO,EAAE,GAAGwQ,GAAM,UAAU,KAAK,SAAQ,GAC1CA,EAAK,QAAA;AAEP,UADA,KAAK,SAASA,EAAK,QAEjBA,EAAK,WAAW,UAChBA,EAAK,WAAWA,EAAK,OAAO,OAE5B,OAAM,IAAI,MAAM,kDAAkD;IAAA,OAE/D;AACL,UAAMwR,IACJxR,EAAK,aAAa,UAAUyK,KAC1BzK,EAAK,aAAa,WAAW4M,KAC7B5M,EAAK,WAAWyM,KAChBK;AACJ,WAAK,SAAS,IAAI0E,EAAO,KAAK,KAAK,EACjC,QAAQxR,EAAK,QACb,IAAIA,EAAK,GAAA,CACV;IACH;AACA,SAAK,SAAS,KAAK,OAAO;AAM1B,QAAMyR,IACJ,KAAK,aAAa,YAAY,KAAK,aAAa,SAE5CC,IAAwB,EAC5B,gBAAgB,KAChB,GAAG1R,GACH,KAAK,KAAK,KACV,WAAW,KAAK,WAChB,SAAS,KAAK,SAEd,QAAQ,KAAK,QACb,iBAAAyR,GACA,WAAW,MACX,OAAO,KAAK,OACZ,UAAU,MACV,mBAAmB,GACnB,UAAU,KAAK,UACf,sBAAsB,KAAK,sBAC3B,OAAO,CAAC,CAAC,KAAK,KAAK,MAAA,GAGfE,IAAM,KAAK,QAAQ,IAAIzrB,OAAK,IAAI6H,EAAU7H,GAAGwrB,CAAG,CAAC,GACjD,CAACE,GAAU5gB,CAAS,IAAI2gB,EAAI,OAChC,CAAChhB,GAA4B3M,OAC3B2M,EAAI,CAAC,EAAE,KAAK,GAAG3M,EAAE,GAAG,GACpB2M,EAAI,CAAC,EAAE,KAAK,GAAG3M,EAAE,SAAS,GACnB2M,IAET,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC;AAEV,SAAK,WAAWihB,EAAS,IAAI,CAACjhB,GAAKnM,MAAK;AACtC,UAAMmqB,IAAI3d,EAAUxM,CAAC;AAErB,UAAI,CAACmqB,EAAG,OAAM,IAAI,MAAM,wBAAwB;AAEhD,aAAO,IAAIxB,GAAQxc,GAAKge,GAAG,GAAG,KAAK,QAAQ;IAC7C,CAAC;EACH;EAMA,MAAM,OAAI;AAKR,WAAO,CACL,GAAI,MAAM,IAAI0C,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACvD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,KAAI,CAAA;EAEX;EAMA,WAAQ;AACN,WAAO,CACL,GAAG,IAAIA,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EAChD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,SAAQ,CAAA;EAEf;EAMA,SAAM;AACJ,WAAO,IAAIC,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACpD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,OAAM;EACX;EAMA,aAAU;AACR,WAAO,IAAIA,GAAW,KAAK,UAAU,KAAK,OAAO,KAAK,EACpD,GAAG,KAAK,MACR,UACE,KAAK,aAAa,IAAA,IAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC,IAAA,GACJ,UAAU,KAAK,UACf,QAAQ,KAAK,QACb,qBAAqB,KAAK,oBAAA,CAC3B,EAAE,WAAU;EACf;EAMA,cAAW;AACT,WAAO,KAAK,WAAU,EAAG,OAAO,QAAQ,EAAC;EAC3C;EACA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,YAAW;EACzB;EAMA,UAAO;AACL,WAAO,KAAK,OAAM,EAAG,OAAO,aAAa,EAAC;EAC5C;EACA,CAAC,OAAO,aAAa,IAAC;AACpB,WAAO,KAAK,QAAO;EACrB;AAAA;AQ/nBK,IAAMhlB,KAAW,CACtBpE,IACA7B,IAAuB,CAAA,MACZ;AACN,QAAM,QAAQ6B,EAAO,MACxBA,KAAU,CAACA,EAAO;AAEpB,WAAWhC,KAAKgC,GACd,KAAI,IAAI6F,EAAU7H,GAAGG,CAAO,EAAE,SAAQ,EAAI,QAAO;AAEnD,SAAO;AACT;AC4BM,SAAUwrB,GACd3pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,WAAU;AAC9C;AAsBM,SAAUyrB,GACd5pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,OAAM;AAC1C;AAqBM,SAAU0rB,GACd7pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,SAAQ;AAC5C;AAwBA,eAAe2rB,GACb9pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,KAAI;AACxC;AAqBM,SAAU4rB,GACd/pB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,YAAW;AAC/C;AAqBM,SAAU6rB,GACdhqB,IACA7B,IAAuB,CAAA,GAAE;AAEzB,SAAO,IAAIkrB,EAAKrpB,IAAS7B,CAAO,EAAE,QAAO;AAC3C;AAGO,IAAM8rB,KAAaN;AAAnB,IACMO,KAAS,OAAO,OAAON,IAAY,EAAE,MAAMD,GAAc,CAAE;AADjE,IAEMQ,KAAcJ;AAFpB,IAGMK,KAAU,OAAO,OAAOJ,IAAa,EAChD,MAAMD,GAAAA,CACP;AALM,IAMMzF,KAAO,OAAO,OAAOuF,IAAU,EAC1C,QAAQF,IACR,SAASI,GAAAA,CACV;AATM,IAWMvpB,KAAO,OAAO,OAAOspB,IAAO,EACvC,MAAMA,IACN,UAAAD,IACA,MAAAvF,IACA,YAAAsF,IACA,QAAAM,IACA,gBAAAP,IACA,YAAAM,IACA,aAAAD,IACA,SAAAI,IACA,iBAAAL,IACA,aAAAI,IACA,MAAAd,GACA,UAAAjlB,IACA,QAAAuB,IACA,UAAAlE,EAAAA,CACD;AACDjB,GAAK,OAAOA;;;AC/NZ,2BAA6B;AAC7B,IAAA6pB,aAAwC;AACxC,IAAAC,eAA8B;;;ACF9B,IAAAC,aAQO;AACP,kBAAoC;;;ACH7B,IAAM,mBAAmB;AASzB,IAAM,6BAA6B;AAKnC,IAAM,gCACX;;;AChBF,IAAI;AAOJ,IAAM,YAAY,KAAK,IAAI,EAAE,SAAS;AAKtC,IAAM,qBAAqB,KAAK,IAAI;AAKpC,IAAM,sBAAsB,oBAAI,IAAoB;AAU7C,SAAS,gBACd,OACA,YACG,gBACG;AACN,MAAI,CAAC,qBAAqB;AACxB,UAAM,IAAI,MAAM,wEAAwE;AAAA,EAC1F;AAEA,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,YAAY,cAAc;AAChC,QAAM,cAAc,QAAQ,SAAS,IAAI,SAAS,KAAK,MAAM,YAAY,CAAC;AAG1E,UAAQ,OAAO;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,IAAI,cAAc,SAAS,GAAG,cAAc;AAAA,MACtD,OAAO;AACL,gBAAQ,IAAI,aAAa,SAAS,GAAG,cAAc;AAAA,MACrD;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,KAAK,cAAc,SAAS,GAAG,cAAc;AAAA,MACvD,OAAO;AACL,gBAAQ,KAAK,aAAa,SAAS,GAAG,cAAc;AAAA,MACtD;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,YAAY,UAAU;AAC/B,gBAAQ,MAAM,cAAc,SAAS,GAAG,cAAc;AAAA,MACxD,OAAO;AACL,gBAAQ,MAAM,aAAa,SAAS,GAAG,cAAc;AAAA,MACvD;AACA;AAAA,IACF;AAEE,YAAM,IAAI,MAAM,sBAAsB,OAAO,KAAK,CAAC,EAAE;AAAA,EACzD;AACF;AAQA,SAAS,eAAe,WAAmB,UAAkB,KAAK,IAAI,GAAW;AAC/E,QAAM,aAAa,UAAU;AAE7B,MAAI,aAAa,KAAM;AACrB,WAAO,GAAG,UAAU;AAAA,EACtB,WAAW,aAAa,KAAO;AAC7B,WAAO,IAAI,aAAa,KAAM,QAAQ,CAAC,CAAC;AAAA,EAC1C,OAAO;AACL,UAAM,UAAU,KAAK,MAAM,aAAa,GAAK;AAC7C,UAAM,WAAY,aAAa,MAAS,KAAM,QAAQ,CAAC;AACvD,WAAO,GAAG,OAAO,KAAK,OAAO;AAAA,EAC/B;AACF;AAOO,SAAS,kBAAkBC,aAA0B;AAC1D,kBAAgB,QAAQ,4BAA4B,SAAS,OAAO;AACpE,kBAAgB,QAAQ,gBAAgBA,WAAU,EAAE;AACtD;AAQO,SAAS,iBAAiB,UAAmB,MAAM,mBAAkC;AAC1F,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,gBAAgB,eAAe,oBAAoB,OAAO;AAChE,QAAM,SAAS,UAAU,YAAY;AAErC,MAAI,mBAAmB;AACrB,oBAAgB,QAAQ,iBAAiB;AAAA,EAC3C;AAEA,kBAAgB,QAAQ,0BAA0B,SAAS,OAAO,MAAM,MAAM;AAC9E,kBAAgB,QAAQ,mBAAmB,aAAa,EAAE;AAC5D;AAQO,SAAS,wBAAwB,WAAmB,gBAA+B;AACxF,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,kBAAkB,eAAe,oBAAoB,WAAW;AACtE,QAAM,OAAO,iBAAiB,MAAM,cAAc,KAAK;AACvD,kBAAgB,QAAQ,cAAc,SAAS,WAAW,eAAe,IAAI,IAAI,EAAE;AACrF;AAOO,SAAS,4BAA4B,eAA6B;AACvE,sBAAoB,IAAI,eAAe,KAAK,IAAI,CAAC;AACjD,kBAAgB,SAAS,YAAY,aAAa,EAAE;AACtD;AAOO,SAAS,2BAA2B,eAA6B;AACtE,QAAM,YAAY,oBAAoB,IAAI,aAAa;AACvD,MAAI,WAAW;AACb,UAAM,WAAW,eAAe,SAAS;AACzC,wBAAoB,OAAO,aAAa;AACxC,oBAAgB,QAAQ,cAAc,aAAa,UAAU,QAAQ,GAAG;AAAA,EAC1E,OAAO;AACL,oBAAgB,QAAQ,sCAAsC,aAAa,EAAE;AAAA,EAC/E;AACF;AAQO,SAAS,uBAAuBA,aAA0B;AAC/D,wBAAsBA;AACxB;;;ACrKO,SAAS,qBAAqBC,kBAA6C;AAChF,QAAM,UAAUA,iBAAgB;AAChC,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AACzB,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AACzB,QAAM,KAAK,EAAE;AAGb,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,aAAa,QAAQ,iBAAiB,YAAY,QAAQ,EAAE;AACvE,QAAM,KAAK,oBAAoBA,iBAAgB,aAAa,YAAY,CAAC,EAAE;AAC3E,QAAM,KAAK,eAAe,QAAQ,aAAa,EAAE;AACjD,QAAM,KAAK,gBAAgB,QAAQ,aAAa,EAAE;AAClD,QAAM,KAAK,2BAA2B,QAAQ,kBAAkB,EAAE;AAClE,QAAM,KAAK,EAAE;AAGb,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,kBAAkB,QAAQ,qBAAqB,EAAE;AAC5D,QAAM,KAAK,iBAAiB,QAAQ,sBAAsB,EAAE;AAC5D,QAAM,KAAK,cAAcA,iBAAgB,YAAY,kBAAkB,EAAE;AACzE,QAAM,KAAK,aAAa,QAAQ,kBAAkB,EAAE;AACpD,QAAM,KAAK,cAAc,QAAQ,mBAAmB,EAAE;AACtD,QAAM,KAAK,EAAE;AAGb,MAAIA,iBAAgB,YAAY,qBAAqB,GAAG;AACtD,UAAM,KAAK,gBAAgB;AAC3B,UAAM,KAAK,4BAA4BA,iBAAgB,YAAY,wBAAwB,EAAE;AAC7F,UAAM;AAAA,MACJ,iCAAiCA,iBAAgB,YAAY,6BAA6B;AAAA,IAC5F;AACA,UAAM,KAAK,2BAA2BA,iBAAgB,YAAY,kBAAkB,EAAE;AACtF,UAAM;AAAA,MACJ,2CAA2CA,iBAAgB,YAAY,kCAAkC,IAAI;AAAA,IAC/G;AACA,UAAM;AAAA,MACJ,sCAAsCA,iBAAgB,YAAY,6BAA6B,IAAI;AAAA,IACrG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,cAAc;AACzB,QAAM,KAAK,qBAAqB,QAAQ,YAAY,eAAe,IAAI;AACvE,QAAM,KAAK,cAAc,QAAQ,YAAY,iBAAiB,IAAI;AAClE,QAAM,KAAK,kBAAkB,QAAQ,YAAY,qBAAqB,IAAI;AAC1E,QAAM,KAAK,iBAAiB,QAAQ,YAAY,oBAAoB,IAAI;AAGxE,MAAI,QAAQ,YAAY,kBAAkB,GAAG;AAC3C,UAAM,aAAa,KAAK;AAAA,MACrB,QAAQ,YAAY,oBAAoB,QAAQ,YAAY,kBAAmB;AAAA,IAClF;AACA,UAAM,iBAAiB,KAAK;AAAA,MACzB,QAAQ,YAAY,wBAAwB,QAAQ,YAAY,kBAAmB;AAAA,IACtF;AACA,UAAM,gBAAgB,KAAK;AAAA,MACxB,QAAQ,YAAY,uBAAuB,QAAQ,YAAY,kBAAmB;AAAA,IACrF;AAEA,UAAM,KAAK,cAAc;AACzB,UAAM,KAAK,gBAAgB,UAAU,GAAG;AACxC,UAAM,KAAK,oBAAoB,cAAc,GAAG;AAChD,UAAM,KAAK,mBAAmB,aAAa,GAAG;AAAA,EAChD;AACA,QAAM,KAAK,EAAE;AAGb,MAAI,QAAQ,eAAe,SAAS,GAAG;AACrC,UAAM,KAAK,kBAAkB;AAC7B,eAAW,SAAS,QAAQ,gBAAgB;AAC1C,YAAM,KAAK,OAAO,KAAK,EAAE;AAAA,IAC3B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,UAAM,KAAK,WAAW;AACtB,eAAW,WAAW,QAAQ,UAAU;AACtC,YAAM,KAAK,OAAO,OAAO,EAAE;AAAA,IAC7B;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AAEzB,SAAO,MAAM,KAAK,IAAI;AACxB;;;AH7EO,SAAS,UAAU,SAA0B;AAClD,aAAO,uBAAW,OAAO,SAAK,qBAAS,OAAO,EAAE,YAAY;AAC9D;AAOO,SAAS,WAAW,UAA2B;AACpD,aAAO,uBAAW,QAAQ,SAAK,qBAAS,QAAQ,EAAE,OAAO;AAC3D;AAQO,SAAS,2BAA2B,SAAuB;AAEhE,MAAI,CAAC,UAAU,OAAO,GAAG;AACvB,oBAAgB,QAAQ,wBAAwB,OAAO,EAAE;AACzD;AAAA,EACF;AACA,kBAAgB,QAAQ,uCAAuC,OAAO,EAAE;AAGxE,QAAM,cAAU,wBAAY,SAAS,EAAE,eAAe,KAAK,CAAC;AAE5D,aAAW,SAAS,SAAS;AAC3B,UAAM,eAAW,kBAAK,SAAS,MAAM,IAAI;AAEzC,QAAI,MAAM,YAAY,GAAG;AAEvB,iCAA2B,QAAQ;AAAA,IACrC,WACE,MAAM,OAAO,KACb,MAAM,KAAK,SAAS,OAAO,KAC3B,CAAC,MAAM,KAAK,SAAS,WAAW,GAChC;AAEA,YAAM,cAAU,oBAAO,EAAE,OAAG,mBAAM,QAAQ,GAAG,MAAM,IAAI,KAAK,YAAY,CAAC;AACzE,iCAAW,UAAU,OAAO;AAC5B,sBAAgB,QAAQ,gCAAgC,QAAQ,OAAO,OAAO,EAAE;AAAA,IAClF;AAAA,EACF;AACF;AAQO,SAAS,iBAAiBC,aAA4B;AAC3D,QAAM,qBAAiB,kBAAKA,aAAY,0BAA0B;AAClE,MAAI;AACF,kCAAc,gBAAgB,+BAA+B,MAAM;AACnE,oBAAgB,QAAQ,wBAAwB,cAAc,EAAE;AAAA,EAClE,SAAS,OAAO;AACd,oBAAgB,QAAQ,iCAAiC,OAAO,KAAK,CAAC,EAAE;AAAA,EAC1E;AACA,SAAO;AACT;AAOO,SAAS,iBAAiB,gBAA8B;AAC7D,UAAI,uBAAW,cAAc,GAAG;AAC9B,QAAI;AACF,iCAAW,cAAc;AACzB,sBAAgB,QAAQ,wBAAwB,cAAc,EAAE;AAAA,IAClE,SAAS,OAAO;AACd,sBAAgB,QAAQ,iCAAiC,OAAO,KAAK,CAAC,EAAE;AAAA,IAC1E;AAAA,EACF;AACF;AAUO,SAAS,0BAA0B,MAAwD;AAChG,MAAI,OAAO,SAAS,YAAY,SAAS,KAAM,QAAO;AAGtD,QAAM,SAAS,KAAK,WAAW;AAC/B,MAAI,QAAQ,QAAQ,OAAO,OAAO,SAAS,UAAU;AACnD,WAAO,OAAO,OAAO,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG;AAAA,EAChD;AAGA,QAAM,cAAc,KAAK,aAAa;AACtC,MAAI,aAAa;AACf,eAAW,QAAQ,OAAO,OAAO,WAAW,GAAG;AAC7C,kCAA4B,IAAI;AAAA,IAClC;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,4BAA4B,KAAoB;AACvD,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM;AAE7C,QAAM,SAAS;AACf,QAAM,MAAM,OAAO,WAAW;AAC9B,MAAI,KAAK,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,QAAI,OAAO,IAAI,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG;AAAA,EAC1C;AAGA,aAAW,OAAO,CAAC,YAAY,UAAU,WAAW,aAAa,SAAS,SAAS,GAAG;AACpF,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC3E,iBAAW,SAAS,OAAO,OAAO,MAAiC,GAAG;AACpE,oCAA4B,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,6BAA6B,UAAwB;AACnE,MAAI,CAAC,WAAW,QAAQ,EAAG;AAE3B,QAAM,UAAM,yBAAa,UAAU,MAAM;AACzC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,4BAA0B,IAAI;AAC9B,QAAM,aAAa,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;AAEnD,MAAI,eAAe,KAAK;AACtB,kCAAc,UAAU,YAAY,MAAM;AAC1C,oBAAgB,QAAQ,kCAAkC,QAAQ,EAAE;AAAA,EACtE;AACF;;;ADhKO,IAAM,6BAA6B;AAiB1C,IAAM,kBAAmC;AAAA,EACvC,gBAAgB,oBAAI,IAAI;AAAA,EACxB,oBAAoB,CAAC;AAAA,EACrB,aAAa;AACf;AAiBA,IAAM,oBAAoB;AAAA;AAAA,EAExB,KAAK,OAA4B;AAAA,IAC/B,YAAY;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,QAAQ,OAA4B;AAAA,IAClC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,YAAY,KAAK;AAAA,IAC9C,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,UAAU,OAA4B;AAAA,IACpC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,eAAe,KAAK;AAAA,IACjD,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,aAAa,OAA4B;AAAA,IACvC,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,eAAe,KAAK;AAAA,IACpC,iBAAiB;AAAA,EACnB;AAAA;AAAA,EAEA,qBAAqB,CAAC,aAA0C;AAAA,IAC9D,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,eAAe,OAAO,IAAI,KAAK;AAAA,IAC5D,iBAAiB,mCAAmC,OAAO;AAAA,EAC7D;AAAA;AAAA,EAEA,mBAAmB,CAAC,aAA0C;AAAA,IAC5D,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,aAAa,YAAY,OAAO,IAAI,KAAK;AAAA,IACzD,iBAAiB,gCAAgC,OAAO;AAAA,EAC1D;AACF;AAOA,SAAS,mBAAmB,eAA4C;AACtE,QAAM,QAAQ,cAAc,KAAK,EAAE,MAAM,KAAK;AAC9C,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AAEA,QAAM,aAAa,MAAM,CAAC;AAC1B,QAAM,OAAO,MAAM,MAAM,CAAC;AAE1B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,iBAAiB;AAAA,EACnB;AACF;AAUO,SAAS,iCACd,UACAC,aACA,aACAC,kBAC4E;AAC5E,MAAI;AAEF,UAAM,gBAAgB,kBAAkB,UAAUD,aAAY,aAAaC,gBAAe;AAG1F,UAAM,iBAAiB,mBAAmB,aAAa;AAGvD,QAAI;AAEJ,QAAI,eAAeA,kBAAiB;AAClC,UAAI;AACF,cAAM,cAAc,mBAAmB,aAAaA,gBAAe;AACnE,YAAI,aAAa,oBAAoB;AAEnC,yBAAe,kBAAkB,oBAAoB,YAAY,kBAAkB;AAAA,QACrF,WAAW,aAAa,cAAc;AAEpC,yBAAe,kBAAkB,oBAAoB,YAAY,YAAY;AAAA,QAC/E,OAAO;AAEL,yBAAe,kBAAkB,SAAS;AAAA,QAC5C;AAAA,MACF,SAAS,OAAO;AAEd;AAAA,UACE;AAAA,UACA,sCAAsC,WAAW,KAAK,OAAO,KAAK,CAAC;AAAA,QACrE;AACA,uBAAe,kBAAkB,SAAS;AAAA,MAC5C;AAAA,IACF,OAAO;AAEL,qBAAe,kBAAkB,SAAS;AAAA,IAC5C;AAEA,WAAO,EAAE,gBAAgB,aAAa;AAAA,EACxC,SAAS,OAAO;AAEd,oBAAgB,SAAS,+CAA+C,OAAO,KAAK,CAAC,EAAE;AACvF,UAAM,kBAAkB,mBAAmB,KAAK;AAChD,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,cAAc,kBAAkB,SAAS;AAAA,IAC3C;AAAA,EACF;AACF;AAKA,SAAS,wBAAwB,cAAkD;AACjF,MAAI;AACF,UAAM,mBAAe,sBAAQ,YAAY;AACzC,QAAI,gBAAgB,WAAW,YAAY,GAAG;AAC5C,aAAO;AAAA,QACL,YAAY;AAAA,QACZ,MAAM,CAAC;AAAA,QACP,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAQA,SAAS,mBACP,aACAA,kBAC4B;AAC5B,QAAM,UAAUA,iBAAgB,SAAS,IAAI,WAAW;AACxD,MAAI,CAAC,SAAS,aAAa;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,eAAe,CAAC,GAAG,kBAAkB,CAAC,EAAE,IAAI,QAAQ;AAC5D,QAAM,kBAAkB,EAAE,GAAG,cAAc,GAAG,gBAAgB;AAE9D,QAAM,aAAa,gBAAgB,UAAU;AAC7C,QAAM,eAAe,gBAAgB,aAAa;AAElD,MAAI,CAAC,cAAc,CAAC,cAAc;AAChC,WAAO;AAAA,EACT;AAEA,MAAI;AACJ,MAAI,cAAc;AAEhB,yBAAqB,2BAA2B,YAAY;AAAA,EAC9D,WAAW,YAAY;AAErB,yBAAqB,6BAA6B,UAAU;AAAA,EAC9D;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOA,SAAS,2BAA2B,SAAyB;AAC3D,QAAM,iBAAiB;AACvB,QAAM,oBAAoB,QAAQ,MAAM,UAAU;AAElD,MAAI,mBAAmB;AACrB,UAAM,eAAe,SAAS,kBAAkB,CAAC,GAAG,EAAE;AACtD,QAAI,eAAe,gBAAgB;AAEjC,aAAO,IAAI,cAAc;AAAA,IAC3B;AAAA,EACF;AAGA,SAAO;AACT;AAOA,SAAS,6BAA6B,YAA4B;AAGhE,QAAM,oBAAoB,WAAW,MAAM,UAAU;AACrD,MAAI;AAEJ,MAAI,mBAAmB;AACrB,UAAM,eAAe,kBAAkB,CAAC;AACxC,qBAAiB,IAAI,YAAY;AAAA,EACnC,OAAO;AAEL,qBAAiB;AAAA,EACnB;AAGA,SAAO,2BAA2B,cAAc;AAClD;AAQA,SAAS,6BACP,aACAA,kBAC4B;AAC5B,QAAM,cAAc,mBAAmB,aAAaA,gBAAe;AAEnE,MAAI,CAAC,aAAa,oBAAoB;AACpC,WAAO;AAAA,EACT;AAEA,SAAO,kBAAkB,oBAAoB,YAAY,kBAAkB;AAC7E;AAYO,SAAS,oBACd,UACAD,aACA,aACAC,kBACQ;AACR,MAAI;AAEF,WAAO,kBAAkB,UAAUD,aAAY,aAAaC,gBAAe;AAAA,EAC7E,SAAS,OAAO;AACd,UAAM,eAAe,oCAAoC,OAAO,KAAK,CAAC;AACtE,oBAAgB,SAAS,YAAY;AACrC,UAAM,IAAI,MAAM,YAAY;AAAA,EAC9B;AACF;AAOA,SAAS,2BAA2BD,aAA8B;AAChE,MAAI,gBAAgB,mBAAmB,SAAS,GAAG;AACjD,WAAO,gBAAgB;AAAA,EACzB;AAEA,QAAM,mBAAe,mBAAKA,aAAY,sBAAsB;AAC5D,QAAM,gBAA0B,CAAC;AAEjC,MAAI;AACF,YAAI,uBAAW,YAAY,GAAG;AAC5B,YAAM,cAAU,wBAAY,cAAc,EAAE,eAAe,KAAK,CAAC;AACjE,iBAAW,SAAS,SAAS;AAC3B,YAAI,MAAM,YAAY,KAAK,MAAM,KAAK,WAAW,MAAM,GAAG;AACxD,gBAAM,eAAW,mBAAK,cAAc,MAAM,IAAI;AAC9C,gBAAM,aAAS,mBAAK,UAAU,gBAAgB,QAAQ,KAAK;AAC3D,cAAI,WAAW,MAAM,GAAG;AACtB,0BAAc,KAAK,QAAQ;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,oBAAgB,SAAS,yCAAyC,OAAO,KAAK,CAAC,EAAE;AAAA,EACnF;AAEA,kBAAgB,qBAAqB;AACrC,SAAO;AACT;AAUA,SAAS,kBACP,UACAA,aACA,aACAC,kBACQ;AAER,4BAA0BD,WAAU;AAGpC,MAAI,UAAU;AACZ,UAAM,kBAAc,mBAAK,UAAU,gBAAgB,QAAQ,KAAK;AAChE,UAAM,UAAU,wBAAwB,WAAW;AACnD,QAAI,SAAS;AACX,YAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,aAAW,qBAAqB,gBAAgB,oBAAoB;AAClE,UAAM,kBAAc,mBAAK,mBAAmB,gBAAgB,QAAQ,KAAK;AACzE,UAAM,UAAU,wBAAwB,WAAW;AACnD,QAAI,SAAS;AACX,YAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAeC,kBAAiB;AAClC,UAAM,sBAAsB,6BAA6B,aAAaA,gBAAe;AACrF,QAAI,qBAAqB;AACvB,YAAM,SAAS,eAAe,qBAAqBD,aAAY,IAAI;AACnE,UAAI,OAAO,OAAO;AAChB,eAAO,oBAAoB;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAGA,MAAI,gBAAgB,eAAe;AACjC,WAAO,gBAAgB;AAAA,EACzB;AAGA,QAAM,mBAAmB,CAAC,kBAAkB,OAAO,GAAG,kBAAkB,SAAS,CAAC;AAElF,aAAW,WAAW,kBAAkB;AACtC,UAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,QAAI,OAAO,OAAO;AAChB,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AAGA,SAAO,kBAAkB,SAAS,EAAE;AACtC;AAMA,SAAS,0BAA0BA,aAA0B;AAC3D,MAAI,gBAAgB,aAAa;AAC/B;AAAA,EACF;AAEA,kBAAgB,QAAQ,mCAAmC;AAG3D,QAAM,iBAAiB,CAAC,kBAAkB,IAAI,GAAG,kBAAkB,SAAS,CAAC;AAE7E,aAAW,WAAW,gBAAgB;AACpC,UAAM,SAAS,eAAe,SAASA,aAAY,IAAI;AACvD,QAAI,OAAO,OAAO;AAChB,sBAAgB,gBAAgB,QAAQ;AACxC;AAAA,QACE;AAAA,QACA,qCAAqC,QAAQ,eAAe,MAAM,OAAO,WAAW,SAAS;AAAA,MAC/F;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,2BAA2BA,WAAU;AACvD,MAAI,UAAU,SAAS,GAAG;AACxB;AAAA,MACE;AAAA,MACA,cAAc,UAAU,MAAM,sBAAsB,UAAU,WAAW,IAAI,MAAM,KAAK;AAAA,IAC1F;AAAA,EACF;AAEA,kBAAgB,cAAc;AAChC;AAmBA,SAAS,eACP,kBACAE,aACA,SAAkB,OACoC;AACtD,QAAM,WAAW,iBAAiB;AAGlC,QAAM,eAAe,gBAAgB,eAAe,IAAI,QAAQ;AAChE,MAAI,cAAc;AAChB,WAAO;AAAA,EACT;AAEA,MAAI;AAEF,UAAM,WAAW;AAAA,MACf,GAAG,QAAQ;AAAA;AAAA,MAEX,mCAAmC;AAAA,MACnC,eAAe;AAAA,IACjB;AAEA,UAAM,aAAS;AAAA,MACb,iBAAiB;AAAA,MACjB,CAAC,GAAG,iBAAiB,MAAM,WAAW;AAAA,MACtC;AAAA,QACE,UAAU;AAAA,QACV,OAAO;AAAA,QACP,SAAS;AAAA;AAAA,QACT,KAAKA;AAAA,QACL,KAAK;AAAA,MACP;AAAA,IACF,EAAE,SAAS;AAGX,UAAM,eAAe,OAAO,MAAM,iBAAiB;AACnD,UAAM,UAAU,eAAe,aAAa,CAAC,IAAI;AAEjD,UAAM,aAAa,EAAE,OAAO,MAAM,QAAQ;AAC1C,oBAAgB,eAAe,IAAI,UAAU,UAAU;AACvD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,eAAe,OAAO,KAAK;AACjC,QAAI,CAAC,QAAQ;AACX,sBAAgB,SAAS,gCAAgC,QAAQ,MAAM,YAAY,EAAE;AAAA,IACvF;AAEA,UAAM,aAAa,EAAE,OAAO,OAAO,OAAO,aAAa;AACvD,oBAAgB,eAAe,IAAI,UAAU,UAAU;AACvD,WAAO;AAAA,EACT;AACF;;;AKlhBA,IAAAC,wBAA4C;AAC5C,IAAAC,eAA2E;;;ACD3E,IAAAC,wBAA4C;AAC5C,IAAAC,eAAgC;AAQzB,SAAS,cAAc,YAAoB,UAAuC;AACvF,MAAI;AAEF,UAAM,eAAiC;AAAA,MACrC,OAAO;AAAA,MACP,OAAO;AAAA,MACP,KAAK,EAAE,GAAG,QAAQ,IAAI;AAAA,IACxB;AAGA,QAAI,UAAU;AACZ,YAAM,eAAW,mBAAK,UAAU,cAAc;AAG9C,mBAAa,MAAM;AAAA,QACjB,GAAG,QAAQ;AAAA,QACX,WAAW,GAAG,QAAQ,GAAG,sBAAS,GAAG,QAAQ,IAAI,aAAa,EAAE;AAAA,QAChE,MAAM,OAAG,mBAAK,UAAU,MAAM,CAAC,GAAG,sBAAS,GAAG,QAAQ,IAAI,IAAI;AAAA,QAC9D,mBAAmB;AAAA,MACrB;AAAA,IACF;AAIA,UAAM,aAAS,iCAAU,GAAG,UAAU,cAAc,YAAY;AAChE,QAAI,OAAO,WAAW,KAAK,OAAO,QAAQ;AACxC,YAAM,gBAAgB,OAAO,OAAO,SAAS,EAAE,KAAK;AAEpD,YAAMC,SAAQ,cAAc,MAAM,0CAA0C;AAC5E,UAAIA,SAAQ,CAAC,GAAG;AACd,eAAOA,OAAM,CAAC;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;AC/CA,IAAAC,wBAA6B;AAC7B,IAAAC,aAA2B;AAC3B,gBAA+B;AAC/B,IAAAC,eAA8B;;;ACH9B,IAAAC,aAAyC;AACzC,IAAAC,eAAwC;;;ACCxC,SAAS,UAAU,SAAS;AAC1B,SAAQ,OAAO,YAAY,eAAiB,YAAY;AAC1D;AAGA,SAAS,SAAS,SAAS;AACzB,SAAQ,OAAO,YAAY,YAAc,YAAY;AACvD;AAGA,SAAS,QAAQ,UAAU;AACzB,MAAI,MAAM,QAAQ,QAAQ,EAAG,QAAO;AAAA,WAC3B,UAAU,QAAQ,EAAG,QAAO,CAAC;AAEtC,SAAO,CAAE,QAAS;AACpB;AAGA,SAAS,OAAO,QAAQ,QAAQ;AAC9B,MAAI,OAAO,QAAQ,KAAK;AAExB,MAAI,QAAQ;AACV,iBAAa,OAAO,KAAK,MAAM;AAE/B,SAAK,QAAQ,GAAG,SAAS,WAAW,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtE,YAAM,WAAW,KAAK;AACtB,aAAO,GAAG,IAAI,OAAO,GAAG;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,OAAO,QAAQ,OAAO;AAC7B,MAAI,SAAS,IAAI;AAEjB,OAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AACzC,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAGA,SAAS,eAAe,QAAQ;AAC9B,SAAQ,WAAW,KAAO,OAAO,sBAAsB,IAAI;AAC7D;AAGA,IAAI,cAAmB;AACvB,IAAI,aAAmB;AACvB,IAAI,YAAmB;AACvB,IAAI,WAAmB;AACvB,IAAI,mBAAmB;AACvB,IAAI,WAAmB;AAEvB,IAAI,SAAS;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AAAA,EACV,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,gBAAgB;AAAA,EAChB,QAAQ;AACT;AAKA,SAAS,YAAYC,YAAW,SAAS;AACvC,MAAI,QAAQ,IAAI,UAAUA,WAAU,UAAU;AAE9C,MAAI,CAACA,WAAU,KAAM,QAAO;AAE5B,MAAIA,WAAU,KAAK,MAAM;AACvB,aAAS,SAASA,WAAU,KAAK,OAAO;AAAA,EAC1C;AAEA,WAAS,OAAOA,WAAU,KAAK,OAAO,KAAK,OAAOA,WAAU,KAAK,SAAS,KAAK;AAE/E,MAAI,CAAC,WAAWA,WAAU,KAAK,SAAS;AACtC,aAAS,SAASA,WAAU,KAAK;AAAA,EACnC;AAEA,SAAO,UAAU,MAAM;AACzB;AAGA,SAAS,gBAAgB,QAAQ,MAAM;AAErC,QAAM,KAAK,IAAI;AAEf,OAAK,OAAO;AACZ,OAAK,SAAS;AACd,OAAK,OAAO;AACZ,OAAK,UAAU,YAAY,MAAM,KAAK;AAGtC,MAAI,MAAM,mBAAmB;AAE3B,UAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,EAChD,OAAO;AAEL,SAAK,QAAS,IAAI,MAAM,EAAG,SAAS;AAAA,EACtC;AACF;AAIA,gBAAgB,YAAY,OAAO,OAAO,MAAM,SAAS;AACzD,gBAAgB,UAAU,cAAc;AAGxC,gBAAgB,UAAU,WAAW,SAAS,SAAS,SAAS;AAC9D,SAAO,KAAK,OAAO,OAAO,YAAY,MAAM,OAAO;AACrD;AAGA,IAAI,YAAY;AAGhB,SAAS,QAAQ,QAAQ,WAAW,SAAS,UAAU,eAAe;AACpE,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,gBAAgB,KAAK,MAAM,gBAAgB,CAAC,IAAI;AAEpD,MAAI,WAAW,YAAY,eAAe;AACxC,WAAO;AACP,gBAAY,WAAW,gBAAgB,KAAK;AAAA,EAC9C;AAEA,MAAI,UAAU,WAAW,eAAe;AACtC,WAAO;AACP,cAAU,WAAW,gBAAgB,KAAK;AAAA,EAC5C;AAEA,SAAO;AAAA,IACL,KAAK,OAAO,OAAO,MAAM,WAAW,OAAO,EAAE,QAAQ,OAAO,QAAG,IAAI;AAAA,IACnE,KAAK,WAAW,YAAY,KAAK;AAAA;AAAA,EACnC;AACF;AAGA,SAAS,SAAS,QAAQ,KAAK;AAC7B,SAAO,OAAO,OAAO,KAAK,MAAM,OAAO,MAAM,IAAI;AACnD;AAGA,SAAS,YAAY,MAAM,SAAS;AAClC,YAAU,OAAO,OAAO,WAAW,IAAI;AAEvC,MAAI,CAAC,KAAK,OAAQ,QAAO;AAEzB,MAAI,CAAC,QAAQ,UAAW,SAAQ,YAAY;AAC5C,MAAI,OAAO,QAAQ,WAAgB,SAAU,SAAQ,SAAc;AACnE,MAAI,OAAO,QAAQ,gBAAgB,SAAU,SAAQ,cAAc;AACnE,MAAI,OAAO,QAAQ,eAAgB,SAAU,SAAQ,aAAc;AAEnE,MAAIC,MAAK;AACT,MAAI,aAAa,CAAE,CAAE;AACrB,MAAI,WAAW,CAAC;AAChB,MAAIC;AACJ,MAAI,cAAc;AAElB,SAAQA,SAAQD,IAAG,KAAK,KAAK,MAAM,GAAI;AACrC,aAAS,KAAKC,OAAM,KAAK;AACzB,eAAW,KAAKA,OAAM,QAAQA,OAAM,CAAC,EAAE,MAAM;AAE7C,QAAI,KAAK,YAAYA,OAAM,SAAS,cAAc,GAAG;AACnD,oBAAc,WAAW,SAAS;AAAA,IACpC;AAAA,EACF;AAEA,MAAI,cAAc,EAAG,eAAc,WAAW,SAAS;AAEvD,MAAI,SAAS,IAAI,GAAG;AACpB,MAAI,eAAe,KAAK,IAAI,KAAK,OAAO,QAAQ,YAAY,SAAS,MAAM,EAAE,SAAS,EAAE;AACxF,MAAI,gBAAgB,QAAQ,aAAa,QAAQ,SAAS,eAAe;AAEzE,OAAK,IAAI,GAAG,KAAK,QAAQ,aAAa,KAAK;AACzC,QAAI,cAAc,IAAI,EAAG;AACzB,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,cAAc,CAAC;AAAA,MAC1B,SAAS,cAAc,CAAC;AAAA,MACxB,KAAK,YAAY,WAAW,WAAW,IAAI,WAAW,cAAc,CAAC;AAAA,MACrE;AAAA,IACF;AACA,aAAS,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,IAAI,GAAG,SAAS,GAAG,YAAY,IACjG,QAAQ,KAAK,MAAM,OAAO;AAAA,EAC9B;AAEA,SAAO,QAAQ,KAAK,QAAQ,WAAW,WAAW,GAAG,SAAS,WAAW,GAAG,KAAK,UAAU,aAAa;AACxG,YAAU,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,GAAG,SAAS,GAAG,YAAY,IAC9F,QAAQ,KAAK,MAAM;AACrB,YAAU,OAAO,OAAO,KAAK,QAAQ,SAAS,eAAe,IAAI,KAAK,GAAG,IAAI;AAE7E,OAAK,IAAI,GAAG,KAAK,QAAQ,YAAY,KAAK;AACxC,QAAI,cAAc,KAAK,SAAS,OAAQ;AACxC,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,cAAc,CAAC;AAAA,MAC1B,SAAS,cAAc,CAAC;AAAA,MACxB,KAAK,YAAY,WAAW,WAAW,IAAI,WAAW,cAAc,CAAC;AAAA,MACrE;AAAA,IACF;AACA,cAAU,OAAO,OAAO,KAAK,QAAQ,MAAM,IAAI,UAAU,KAAK,OAAO,IAAI,GAAG,SAAS,GAAG,YAAY,IAClG,QAAQ,KAAK,MAAM;AAAA,EACvB;AAEA,SAAO,OAAO,QAAQ,OAAO,EAAE;AACjC;AAGA,IAAI,UAAU;AAEd,IAAI,2BAA2B;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAI,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,oBAAoBC,MAAK;AAChC,MAAI,SAAS,CAAC;AAEd,MAAIA,SAAQ,MAAM;AAChB,WAAO,KAAKA,IAAG,EAAE,QAAQ,SAAU,OAAO;AACxC,MAAAA,KAAI,KAAK,EAAE,QAAQ,SAAU,OAAO;AAClC,eAAO,OAAO,KAAK,CAAC,IAAI;AAAA,MAC1B,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,OAAO,KAAK,SAAS;AAC5B,YAAU,WAAW,CAAC;AAEtB,SAAO,KAAK,OAAO,EAAE,QAAQ,SAAU,MAAM;AAC3C,QAAI,yBAAyB,QAAQ,IAAI,MAAM,IAAI;AACjD,YAAM,IAAI,UAAU,qBAAqB,OAAO,gCAAgC,MAAM,cAAc;AAAA,IACtG;AAAA,EACF,CAAC;AAGD,OAAK,UAAgB;AACrB,OAAK,MAAgB;AACrB,OAAK,OAAgB,QAAQ,MAAM,KAAc;AACjD,OAAK,UAAgB,QAAQ,SAAS,KAAW,WAAY;AAAE,WAAO;AAAA,EAAM;AAC5E,OAAK,YAAgB,QAAQ,WAAW,KAAS,SAAU,MAAM;AAAE,WAAO;AAAA,EAAM;AAChF,OAAK,aAAgB,QAAQ,YAAY,KAAQ;AACjD,OAAK,YAAgB,QAAQ,WAAW,KAAS;AACjD,OAAK,YAAgB,QAAQ,WAAW,KAAS;AACjD,OAAK,gBAAgB,QAAQ,eAAe,KAAK;AACjD,OAAK,eAAgB,QAAQ,cAAc,KAAM;AACjD,OAAK,QAAgB,QAAQ,OAAO,KAAa;AACjD,OAAK,eAAgB,oBAAoB,QAAQ,cAAc,KAAK,IAAI;AAExE,MAAI,gBAAgB,QAAQ,KAAK,IAAI,MAAM,IAAI;AAC7C,UAAM,IAAI,UAAU,mBAAmB,KAAK,OAAO,yBAAyB,MAAM,cAAc;AAAA,EAClG;AACF;AAEA,IAAI,OAAO;AAQX,SAAS,YAAYC,SAAQ,MAAM;AACjC,MAAI,SAAS,CAAC;AAEd,EAAAA,QAAO,IAAI,EAAE,QAAQ,SAAU,aAAa;AAC1C,QAAI,WAAW,OAAO;AAEtB,WAAO,QAAQ,SAAU,cAAc,eAAe;AACpD,UAAI,aAAa,QAAQ,YAAY,OACjC,aAAa,SAAS,YAAY,QAClC,aAAa,UAAU,YAAY,OAAO;AAE5C,mBAAW;AAAA,MACb;AAAA,IACF,CAAC;AAED,WAAO,QAAQ,IAAI;AAAA,EACrB,CAAC;AAED,SAAO;AACT;AAGA,SAAS,aAA2B;AAClC,MAAI,SAAS;AAAA,IACP,QAAQ,CAAC;AAAA,IACT,UAAU,CAAC;AAAA,IACX,SAAS,CAAC;AAAA,IACV,UAAU,CAAC;AAAA,IACX,OAAO;AAAA,MACL,QAAQ,CAAC;AAAA,MACT,UAAU,CAAC;AAAA,MACX,SAAS,CAAC;AAAA,MACV,UAAU,CAAC;AAAA,IACb;AAAA,EACF,GAAG,OAAO;AAEd,WAAS,YAAYC,OAAM;AACzB,QAAIA,MAAK,OAAO;AACd,aAAO,MAAMA,MAAK,IAAI,EAAE,KAAKA,KAAI;AACjC,aAAO,MAAM,UAAU,EAAE,KAAKA,KAAI;AAAA,IACpC,OAAO;AACL,aAAOA,MAAK,IAAI,EAAEA,MAAK,GAAG,IAAI,OAAO,UAAU,EAAEA,MAAK,GAAG,IAAIA;AAAA,IAC/D;AAAA,EACF;AAEA,OAAK,QAAQ,GAAG,SAAS,UAAU,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACrE,cAAU,KAAK,EAAE,QAAQ,WAAW;AAAA,EACtC;AACA,SAAO;AACT;AAGA,SAAS,SAAS,YAAY;AAC5B,SAAO,KAAK,OAAO,UAAU;AAC/B;AAGA,SAAS,UAAU,SAAS,SAASC,QAAO,YAAY;AACtD,MAAI,WAAW,CAAC;AAChB,MAAI,WAAW,CAAC;AAEhB,MAAI,sBAAsB,MAAM;AAE9B,aAAS,KAAK,UAAU;AAAA,EAE1B,WAAW,MAAM,QAAQ,UAAU,GAAG;AAEpC,eAAW,SAAS,OAAO,UAAU;AAAA,EAEvC,WAAW,eAAe,MAAM,QAAQ,WAAW,QAAQ,KAAK,MAAM,QAAQ,WAAW,QAAQ,IAAI;AAEnG,QAAI,WAAW,SAAU,YAAW,SAAS,OAAO,WAAW,QAAQ;AACvE,QAAI,WAAW,SAAU,YAAW,SAAS,OAAO,WAAW,QAAQ;AAAA,EAEzE,OAAO;AACL,UAAM,IAAI,UAAU,kHAC6C;AAAA,EACnE;AAEA,WAAS,QAAQ,SAAU,QAAQ;AACjC,QAAI,EAAE,kBAAkB,OAAO;AAC7B,YAAM,IAAI,UAAU,oFAAoF;AAAA,IAC1G;AAEA,QAAI,OAAO,YAAY,OAAO,aAAa,UAAU;AACnD,YAAM,IAAI,UAAU,iHAAiH;AAAA,IACvI;AAEA,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,oGAAoG;AAAA,IAC1H;AAAA,EACF,CAAC;AAED,WAAS,QAAQ,SAAU,QAAQ;AACjC,QAAI,EAAE,kBAAkB,OAAO;AAC7B,YAAM,IAAI,UAAU,oFAAoF;AAAA,IAC1G;AAAA,EACF,CAAC;AAED,MAAI,SAAS,OAAO,OAAO,SAAS,SAAS;AAE7C,SAAO,YAAY,KAAK,YAAY,CAAC,GAAG,OAAO,QAAQ;AACvD,SAAO,YAAY,KAAK,YAAY,CAAC,GAAG,OAAO,QAAQ;AAEvD,SAAO,mBAAmB,YAAY,QAAQ,UAAU;AACxD,SAAO,mBAAmB,YAAY,QAAQ,UAAU;AACxD,SAAO,kBAAmB,WAAW,OAAO,kBAAkB,OAAO,gBAAgB;AAErF,SAAO;AACT;AAGA,IAAI,SAAS;AAEb,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO;AAAA,EAAI;AACjE,CAAC;AAED,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO,CAAC;AAAA,EAAG;AACjE,CAAC;AAED,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,WAAW,SAAU,MAAM;AAAE,WAAO,SAAS,OAAO,OAAO,CAAC;AAAA,EAAG;AACjE,CAAC;AAED,IAAI,WAAW,IAAI,OAAO;AAAA,EACxB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAED,SAAS,gBAAgB,MAAM;AAC7B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK;AAEf,SAAQ,QAAQ,KAAK,SAAS,OACtB,QAAQ,MAAM,SAAS,UAAU,SAAS,UAAU,SAAS;AACvE;AAEA,SAAS,oBAAoB;AAC3B,SAAO;AACT;AAEA,SAAS,OAAO,QAAQ;AACtB,SAAO,WAAW;AACpB;AAEA,IAAI,QAAQ,IAAI,KAAK,0BAA0B;AAAA,EAC7C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,WAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,IACxC,OAAW,WAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,EAC1C;AAAA,EACA,cAAc;AAChB,CAAC;AAED,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK;AAEf,SAAQ,QAAQ,MAAM,SAAS,UAAU,SAAS,UAAU,SAAS,WAC7D,QAAQ,MAAM,SAAS,WAAW,SAAS,WAAW,SAAS;AACzE;AAEA,SAAS,qBAAqB,MAAM;AAClC,SAAO,SAAS,UACT,SAAS,UACT,SAAS;AAClB;AAEA,SAAS,UAAU,QAAQ;AACzB,SAAO,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM;AACpD;AAEA,IAAI,OAAO,IAAI,KAAK,0BAA0B;AAAA,EAC5C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,IACjE,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,IACjE,WAAW,SAAU,QAAQ;AAAE,aAAO,SAAS,SAAS;AAAA,IAAS;AAAA,EACnE;AAAA,EACA,cAAc;AAChB,CAAC;AAED,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK,MAC3B,MAAe,KAAO,KAAK,MAC3B,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,UAAU,GAAG;AACpB,SAAS,MAAe,KAAO,KAAK;AACtC;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK,QACX,QAAQ,GACR,YAAY,OACZ;AAEJ,MAAI,CAAC,IAAK,QAAO;AAEjB,OAAK,KAAK,KAAK;AAGf,MAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,SAAK,KAAK,EAAE,KAAK;AAAA,EACnB;AAEA,MAAI,OAAO,KAAK;AAEd,QAAI,QAAQ,MAAM,IAAK,QAAO;AAC9B,SAAK,KAAK,EAAE,KAAK;AAIjB,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,OAAO,OAAO,OAAO,IAAK,QAAO;AACrC,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAGA,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,EAAG,QAAO;AAC/C,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAGA,QAAI,OAAO,KAAK;AAEd;AAEA,aAAO,QAAQ,KAAK,SAAS;AAC3B,aAAK,KAAK,KAAK;AACf,YAAI,OAAO,IAAK;AAChB,YAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,EAAG,QAAO;AAC/C,oBAAY;AAAA,MACd;AACA,aAAO,aAAa,OAAO;AAAA,IAC7B;AAAA,EACF;AAKA,MAAI,OAAO,IAAK,QAAO;AAEvB,SAAO,QAAQ,KAAK,SAAS;AAC3B,SAAK,KAAK,KAAK;AACf,QAAI,OAAO,IAAK;AAChB,QAAI,CAAC,UAAU,KAAK,WAAW,KAAK,CAAC,GAAG;AACtC,aAAO;AAAA,IACT;AACA,gBAAY;AAAA,EACd;AAGA,MAAI,CAAC,aAAa,OAAO,IAAK,QAAO;AAErC,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAM;AAClC,MAAI,QAAQ,MAAM,OAAO,GAAG;AAE5B,MAAI,MAAM,QAAQ,GAAG,MAAM,IAAI;AAC7B,YAAQ,MAAM,QAAQ,MAAM,EAAE;AAAA,EAChC;AAEA,OAAK,MAAM,CAAC;AAEZ,MAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,QAAI,OAAO,IAAK,QAAO;AACvB,YAAQ,MAAM,MAAM,CAAC;AACrB,SAAK,MAAM,CAAC;AAAA,EACd;AAEA,MAAI,UAAU,IAAK,QAAO;AAE1B,MAAI,OAAO,KAAK;AACd,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,CAAC;AAC9D,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,EAAE;AAC/D,QAAI,MAAM,CAAC,MAAM,IAAK,QAAO,OAAO,SAAS,MAAM,MAAM,CAAC,GAAG,CAAC;AAAA,EAChE;AAEA,SAAO,OAAO,SAAS,OAAO,EAAE;AAClC;AAEA,SAAS,UAAU,QAAQ;AACzB,SAAQ,OAAO,UAAU,SAAS,KAAK,MAAM,MAAO,sBAC5C,SAAS,MAAM,KAAK,CAAC,OAAO,eAAe,MAAM;AAC3D;AAEA,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,IACT,QAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAO,IAAI,SAAS,CAAC,IAAI,QAAQ,IAAI,SAAS,CAAC,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,IAC3G,OAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAQ,IAAI,SAAS,CAAC,IAAI,QAAS,IAAI,SAAS,CAAC,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,IAC7G,SAAa,SAAU,KAAK;AAAE,aAAO,IAAI,SAAS,EAAE;AAAA,IAAG;AAAA;AAAA,IAEvD,aAAa,SAAU,KAAK;AAAE,aAAO,OAAO,IAAI,OAAO,IAAI,SAAS,EAAE,EAAE,YAAY,IAAK,QAAQ,IAAI,SAAS,EAAE,EAAE,YAAY,EAAE,MAAM,CAAC;AAAA,IAAG;AAAA,EAC5I;AAAA,EACA,cAAc;AAAA,EACd,cAAc;AAAA,IACZ,QAAa,CAAE,GAAI,KAAM;AAAA,IACzB,OAAa,CAAE,GAAI,KAAM;AAAA,IACzB,SAAa,CAAE,IAAI,KAAM;AAAA,IACzB,aAAa,CAAE,IAAI,KAAM;AAAA,EAC3B;AACF,CAAC;AAED,IAAI,qBAAqB,IAAI;AAAA;AAAA,EAE3B;AAOuB;AAEzB,SAAS,iBAAiB,MAAM;AAC9B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,CAAC,mBAAmB,KAAK,IAAI;AAAA;AAAA,EAG7B,KAAK,KAAK,SAAS,CAAC,MAAM,KAAK;AACjC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,OAAO;AAEX,UAAS,KAAK,QAAQ,MAAM,EAAE,EAAE,YAAY;AAC5C,SAAS,MAAM,CAAC,MAAM,MAAM,KAAK;AAEjC,MAAI,KAAK,QAAQ,MAAM,CAAC,CAAC,KAAK,GAAG;AAC/B,YAAQ,MAAM,MAAM,CAAC;AAAA,EACvB;AAEA,MAAI,UAAU,QAAQ;AACpB,WAAQ,SAAS,IAAK,OAAO,oBAAoB,OAAO;AAAA,EAE1D,WAAW,UAAU,QAAQ;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,OAAO,WAAW,OAAO,EAAE;AACpC;AAGA,IAAI,yBAAyB;AAE7B,SAAS,mBAAmB,QAAQ,OAAO;AACzC,MAAI;AAEJ,MAAI,MAAM,MAAM,GAAG;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,sBAAsB,QAAQ;AAC9C,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,sBAAsB,QAAQ;AAC9C,YAAQ,OAAO;AAAA,MACb,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,MACzB,KAAK;AAAa,eAAO;AAAA,IAC3B;AAAA,EACF,WAAW,OAAO,eAAe,MAAM,GAAG;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,SAAS,EAAE;AAKxB,SAAO,uBAAuB,KAAK,GAAG,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI;AACrE;AAEA,SAAS,QAAQ,QAAQ;AACvB,SAAQ,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM,sBAC3C,SAAS,MAAM,KAAK,OAAO,eAAe,MAAM;AAC1D;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAChB,CAAC;AAED,IAAI,OAAO,SAAS,OAAO;AAAA,EACzB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAED,IAAI,OAAO;AAEX,IAAI,mBAAmB,IAAI;AAAA,EACzB;AAEgB;AAElB,IAAI,wBAAwB,IAAI;AAAA,EAC9B;AASwB;AAE1B,SAAS,qBAAqB,MAAM;AAClC,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,iBAAiB,KAAK,IAAI,MAAM,KAAM,QAAO;AACjD,MAAI,sBAAsB,KAAK,IAAI,MAAM,KAAM,QAAO;AACtD,SAAO;AACT;AAEA,SAAS,uBAAuB,MAAM;AACpC,MAAIJ,QAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,QAAQ,WAAW,GAC1D,QAAQ,MAAM,SAAS,WAAW;AAEtC,EAAAA,SAAQ,iBAAiB,KAAK,IAAI;AAClC,MAAIA,WAAU,KAAM,CAAAA,SAAQ,sBAAsB,KAAK,IAAI;AAE3D,MAAIA,WAAU,KAAM,OAAM,IAAI,MAAM,oBAAoB;AAIxD,SAAO,CAAEA,OAAM,CAAC;AAChB,UAAQ,CAAEA,OAAM,CAAC,IAAK;AACtB,QAAM,CAAEA,OAAM,CAAC;AAEf,MAAI,CAACA,OAAM,CAAC,GAAG;AACb,WAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,EAC5C;AAIA,SAAO,CAAEA,OAAM,CAAC;AAChB,WAAS,CAAEA,OAAM,CAAC;AAClB,WAAS,CAAEA,OAAM,CAAC;AAElB,MAAIA,OAAM,CAAC,GAAG;AACZ,eAAWA,OAAM,CAAC,EAAE,MAAM,GAAG,CAAC;AAC9B,WAAO,SAAS,SAAS,GAAG;AAC1B,kBAAY;AAAA,IACd;AACA,eAAW,CAAC;AAAA,EACd;AAIA,MAAIA,OAAM,CAAC,GAAG;AACZ,cAAU,CAAEA,OAAM,EAAE;AACpB,gBAAY,EAAEA,OAAM,EAAE,KAAK;AAC3B,aAAS,UAAU,KAAK,aAAa;AACrC,QAAIA,OAAM,CAAC,MAAM,IAAK,SAAQ,CAAC;AAAA,EACjC;AAEA,SAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,KAAK,MAAM,QAAQ,QAAQ,QAAQ,CAAC;AAE1E,MAAI,MAAO,MAAK,QAAQ,KAAK,QAAQ,IAAI,KAAK;AAE9C,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAoB;AAClD,SAAO,OAAO,YAAY;AAC5B;AAEA,IAAI,YAAY,IAAI,KAAK,+BAA+B;AAAA,EACtD,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,WAAW;AACb,CAAC;AAED,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,QAAQ,SAAS;AACnC;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AASD,IAAI,aAAa;AAGjB,SAAS,kBAAkB,MAAM;AAC/B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,MAAM,KAAK,SAAS,GAAG,MAAM,KAAK,QAAQC,OAAM;AAGpD,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,WAAOA,KAAI,QAAQ,KAAK,OAAO,GAAG,CAAC;AAGnC,QAAI,OAAO,GAAI;AAGf,QAAI,OAAO,EAAG,QAAO;AAErB,cAAU;AAAA,EACZ;AAGA,SAAQ,SAAS,MAAO;AAC1B;AAEA,SAAS,oBAAoB,MAAM;AACjC,MAAI,KAAK,UACL,QAAQ,KAAK,QAAQ,YAAY,EAAE,GACnC,MAAM,MAAM,QACZA,OAAM,YACN,OAAO,GACP,SAAS,CAAC;AAId,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,QAAK,MAAM,MAAM,KAAM,KAAK;AAC1B,aAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,aAAO,KAAM,QAAQ,IAAK,GAAI;AAC9B,aAAO,KAAK,OAAO,GAAI;AAAA,IACzB;AAEA,WAAQ,QAAQ,IAAKA,KAAI,QAAQ,MAAM,OAAO,GAAG,CAAC;AAAA,EACpD;AAIA,aAAY,MAAM,IAAK;AAEvB,MAAI,aAAa,GAAG;AAClB,WAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAC9B,WAAO,KAAK,OAAO,GAAI;AAAA,EACzB,WAAW,aAAa,IAAI;AAC1B,WAAO,KAAM,QAAQ,KAAM,GAAI;AAC/B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAAA,EAChC,WAAW,aAAa,IAAI;AAC1B,WAAO,KAAM,QAAQ,IAAK,GAAI;AAAA,EAChC;AAEA,SAAO,IAAI,WAAW,MAAM;AAC9B;AAEA,SAAS,oBAAoB,QAAoB;AAC/C,MAAI,SAAS,IAAI,OAAO,GAAG,KAAK,MAC5B,MAAM,OAAO,QACbA,OAAM;AAIV,OAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,QAAK,MAAM,MAAM,KAAM,KAAK;AAC1B,gBAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,gBAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,gBAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,gBAAUA,KAAI,OAAO,EAAI;AAAA,IAC3B;AAEA,YAAQ,QAAQ,KAAK,OAAO,GAAG;AAAA,EACjC;AAIA,SAAO,MAAM;AAEb,MAAI,SAAS,GAAG;AACd,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,OAAO,EAAI;AAAA,EAC3B,WAAW,SAAS,GAAG;AACrB,cAAUA,KAAK,QAAQ,KAAM,EAAI;AACjC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,EAAE;AAAA,EAClB,WAAW,SAAS,GAAG;AACrB,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAK,QAAQ,IAAK,EAAI;AAChC,cAAUA,KAAI,EAAE;AAChB,cAAUA,KAAI,EAAE;AAAA,EAClB;AAEA,SAAO;AACT;AAEA,SAAS,SAAS,KAAK;AACrB,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG,MAAO;AAClD;AAEA,IAAI,SAAS,IAAI,KAAK,4BAA4B;AAAA,EAChD,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AACb,CAAC;AAED,IAAI,oBAAoB,OAAO,UAAU;AACzC,IAAI,cAAoB,OAAO,UAAU;AAEzC,SAAS,gBAAgB,MAAM;AAC7B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,aAAa,CAAC,GAAG,OAAO,QAAQ,MAAM,SAAS,YAC/C,SAAS;AAEb,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AACnB,iBAAa;AAEb,QAAI,YAAY,KAAK,IAAI,MAAM,kBAAmB,QAAO;AAEzD,SAAK,WAAW,MAAM;AACpB,UAAI,kBAAkB,KAAK,MAAM,OAAO,GAAG;AACzC,YAAI,CAAC,WAAY,cAAa;AAAA,YACzB,QAAO;AAAA,MACd;AAAA,IACF;AAEA,QAAI,CAAC,WAAY,QAAO;AAExB,QAAI,WAAW,QAAQ,OAAO,MAAM,GAAI,YAAW,KAAK,OAAO;AAAA,QAC1D,QAAO;AAAA,EACd;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,MAAM;AAC/B,SAAO,SAAS,OAAO,OAAO,CAAC;AACjC;AAEA,IAAI,OAAO,IAAI,KAAK,0BAA0B;AAAA,EAC5C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,cAAc,OAAO,UAAU;AAEnC,SAAS,iBAAiB,MAAM;AAC9B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,OAAO,QAAQ,MAAM,MAAM,QAC3B,SAAS;AAEb,WAAS,IAAI,MAAM,OAAO,MAAM;AAEhC,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AAEnB,QAAI,YAAY,KAAK,IAAI,MAAM,kBAAmB,QAAO;AAEzD,WAAO,OAAO,KAAK,IAAI;AAEvB,QAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,WAAO,KAAK,IAAI,CAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAE;AAAA,EAC3C;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,SAAS,KAAM,QAAO,CAAC;AAE3B,MAAI,OAAO,QAAQ,MAAM,MAAM,QAC3B,SAAS;AAEb,WAAS,IAAI,MAAM,OAAO,MAAM;AAEhC,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,WAAO,OAAO,KAAK;AAEnB,WAAO,OAAO,KAAK,IAAI;AAEvB,WAAO,KAAK,IAAI,CAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAE;AAAA,EAC3C;AAEA,SAAO;AACT;AAEA,IAAI,QAAQ,IAAI,KAAK,2BAA2B;AAAA,EAC9C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,oBAAoB,OAAO,UAAU;AAEzC,SAAS,eAAe,MAAM;AAC5B,MAAI,SAAS,KAAM,QAAO;AAE1B,MAAI,KAAK,SAAS;AAElB,OAAK,OAAO,QAAQ;AAClB,QAAI,kBAAkB,KAAK,QAAQ,GAAG,GAAG;AACvC,UAAI,OAAO,GAAG,MAAM,KAAM,QAAO;AAAA,IACnC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,OAAO,OAAO,CAAC;AACjC;AAEA,IAAI,MAAM,IAAI,KAAK,yBAAyB;AAAA,EAC1C,MAAM;AAAA,EACN,SAAS;AAAA,EACT,WAAW;AACb,CAAC;AAED,IAAI,WAAW,KAAK,OAAO;AAAA,EACzB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAUD,IAAI,oBAAoB,OAAO,UAAU;AAGzC,IAAI,kBAAoB;AACxB,IAAI,mBAAoB;AACxB,IAAI,mBAAoB;AACxB,IAAI,oBAAoB;AAGxB,IAAI,gBAAiB;AACrB,IAAI,iBAAiB;AACrB,IAAI,gBAAiB;AAGrB,IAAI,wBAAgC;AACpC,IAAI,gCAAgC;AACpC,IAAI,0BAAgC;AACpC,IAAI,qBAAgC;AACpC,IAAI,kBAAgC;AAGpC,SAAS,OAAO,KAAK;AAAE,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG;AAAG;AAEnE,SAAS,OAAO,GAAG;AACjB,SAAQ,MAAM,MAAkB,MAAM;AACxC;AAEA,SAAS,eAAe,GAAG;AACzB,SAAQ,MAAM,KAAmB,MAAM;AACzC;AAEA,SAAS,aAAa,GAAG;AACvB,SAAQ,MAAM,KACN,MAAM,MACN,MAAM,MACN,MAAM;AAChB;AAEA,SAAS,kBAAkB,GAAG;AAC5B,SAAO,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM;AACf;AAEA,SAAS,YAAY,GAAG;AACtB,MAAI;AAEJ,MAAK,MAAe,KAAO,KAAK,IAAc;AAC5C,WAAO,IAAI;AAAA,EACb;AAGA,OAAK,IAAI;AAET,MAAK,MAAe,MAAQ,MAAM,KAAc;AAC9C,WAAO,KAAK,KAAO;AAAA,EACrB;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,GAAG;AACxB,MAAI,MAAM,KAAa;AAAE,WAAO;AAAA,EAAG;AACnC,MAAI,MAAM,KAAa;AAAE,WAAO;AAAA,EAAG;AACnC,MAAI,MAAM,IAAa;AAAE,WAAO;AAAA,EAAG;AACnC,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAG;AAC1B,MAAK,MAAe,KAAO,KAAK,IAAc;AAC5C,WAAO,IAAI;AAAA,EACb;AAEA,SAAO;AACT;AAEA,SAAS,qBAAqB,GAAG;AAE/B,SAAQ,MAAM,KAAe,OACtB,MAAM,KAAe,SACrB,MAAM,KAAe,OACrB,MAAM,MAAe,MACrB,MAAM,IAAiB,MACvB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,OACrB,MAAM,MAAe,SACrB,MAAM,KAAmB,MACzB,MAAM,KAAe,MACrB,MAAM,KAAe,MACrB,MAAM,KAAe,OACrB,MAAM,KAAe,SACrB,MAAM,KAAe,SACrB,MAAM,KAAe,WACrB,MAAM,KAAe,WAAW;AACzC;AAEA,SAAS,kBAAkB,GAAG;AAC5B,MAAI,KAAK,OAAQ;AACf,WAAO,OAAO,aAAa,CAAC;AAAA,EAC9B;AAGA,SAAO,OAAO;AAAA,KACV,IAAI,SAAa,MAAM;AAAA,KACvB,IAAI,QAAY,QAAU;AAAA,EAC9B;AACF;AAIA,SAAS,YAAY,QAAQ,KAAK,OAAO;AAEvC,MAAI,QAAQ,aAAa;AACvB,WAAO,eAAe,QAAQ,KAAK;AAAA,MACjC,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAEA,IAAI,oBAAoB,IAAI,MAAM,GAAG;AACrC,IAAI,kBAAkB,IAAI,MAAM,GAAG;AACnC,KAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,oBAAkB,CAAC,IAAI,qBAAqB,CAAC,IAAI,IAAI;AACrD,kBAAgB,CAAC,IAAI,qBAAqB,CAAC;AAC7C;AAHS;AAMT,SAAS,QAAQ,OAAO,SAAS;AAC/B,OAAK,QAAQ;AAEb,OAAK,WAAY,QAAQ,UAAU,KAAM;AACzC,OAAK,SAAY,QAAQ,QAAQ,KAAQ;AACzC,OAAK,YAAY,QAAQ,WAAW,KAAK;AAGzC,OAAK,SAAY,QAAQ,QAAQ,KAAQ;AAEzC,OAAK,OAAY,QAAQ,MAAM,KAAU;AACzC,OAAK,WAAY,QAAQ,UAAU,KAAM;AAEzC,OAAK,gBAAgB,KAAK,OAAO;AACjC,OAAK,UAAgB,KAAK,OAAO;AAEjC,OAAK,SAAa,MAAM;AACxB,OAAK,WAAa;AAClB,OAAK,OAAa;AAClB,OAAK,YAAa;AAClB,OAAK,aAAa;AAIlB,OAAK,iBAAiB;AAEtB,OAAK,YAAY,CAAC;AAYpB;AAGA,SAAS,cAAc,OAAO,SAAS;AACrC,MAAI,OAAO;AAAA,IACT,MAAU,MAAM;AAAA,IAChB,QAAU,MAAM,MAAM,MAAM,GAAG,EAAE;AAAA;AAAA,IACjC,UAAU,MAAM;AAAA,IAChB,MAAU,MAAM;AAAA,IAChB,QAAU,MAAM,WAAW,MAAM;AAAA,EACnC;AAEA,OAAK,UAAU,QAAQ,IAAI;AAE3B,SAAO,IAAI,UAAU,SAAS,IAAI;AACpC;AAEA,SAAS,WAAW,OAAO,SAAS;AAClC,QAAM,cAAc,OAAO,OAAO;AACpC;AAEA,SAAS,aAAa,OAAO,SAAS;AACpC,MAAI,MAAM,WAAW;AACnB,UAAM,UAAU,KAAK,MAAM,cAAc,OAAO,OAAO,CAAC;AAAA,EAC1D;AACF;AAGA,IAAI,oBAAoB;AAAA,EAEtB,MAAM,SAAS,oBAAoB,OAAO,MAAM,MAAM;AAEpD,QAAID,QAAO,OAAO;AAElB,QAAI,MAAM,YAAY,MAAM;AAC1B,iBAAW,OAAO,gCAAgC;AAAA,IACpD;AAEA,QAAI,KAAK,WAAW,GAAG;AACrB,iBAAW,OAAO,6CAA6C;AAAA,IACjE;AAEA,IAAAA,SAAQ,uBAAuB,KAAK,KAAK,CAAC,CAAC;AAE3C,QAAIA,WAAU,MAAM;AAClB,iBAAW,OAAO,2CAA2C;AAAA,IAC/D;AAEA,YAAQ,SAASA,OAAM,CAAC,GAAG,EAAE;AAC7B,YAAQ,SAASA,OAAM,CAAC,GAAG,EAAE;AAE7B,QAAI,UAAU,GAAG;AACf,iBAAW,OAAO,2CAA2C;AAAA,IAC/D;AAEA,UAAM,UAAU,KAAK,CAAC;AACtB,UAAM,kBAAmB,QAAQ;AAEjC,QAAI,UAAU,KAAK,UAAU,GAAG;AAC9B,mBAAa,OAAO,0CAA0C;AAAA,IAChE;AAAA,EACF;AAAA,EAEA,KAAK,SAAS,mBAAmB,OAAO,MAAM,MAAM;AAElD,QAAI,QAAQ;AAEZ,QAAI,KAAK,WAAW,GAAG;AACrB,iBAAW,OAAO,6CAA6C;AAAA,IACjE;AAEA,aAAS,KAAK,CAAC;AACf,aAAS,KAAK,CAAC;AAEf,QAAI,CAAC,mBAAmB,KAAK,MAAM,GAAG;AACpC,iBAAW,OAAO,6DAA6D;AAAA,IACjF;AAEA,QAAI,kBAAkB,KAAK,MAAM,QAAQ,MAAM,GAAG;AAChD,iBAAW,OAAO,gDAAgD,SAAS,cAAc;AAAA,IAC3F;AAEA,QAAI,CAAC,gBAAgB,KAAK,MAAM,GAAG;AACjC,iBAAW,OAAO,8DAA8D;AAAA,IAClF;AAEA,QAAI;AACF,eAAS,mBAAmB,MAAM;AAAA,IACpC,SAAS,KAAK;AACZ,iBAAW,OAAO,8BAA8B,MAAM;AAAA,IACxD;AAEA,UAAM,OAAO,MAAM,IAAI;AAAA,EACzB;AACF;AAGA,SAAS,eAAe,OAAO,OAAO,KAAK,WAAW;AACpD,MAAI,WAAW,SAAS,YAAY;AAEpC,MAAI,QAAQ,KAAK;AACf,cAAU,MAAM,MAAM,MAAM,OAAO,GAAG;AAEtC,QAAI,WAAW;AACb,WAAK,YAAY,GAAG,UAAU,QAAQ,QAAQ,YAAY,SAAS,aAAa,GAAG;AACjF,qBAAa,QAAQ,WAAW,SAAS;AACzC,YAAI,EAAE,eAAe,KACd,MAAQ,cAAc,cAAc,UAAY;AACrD,qBAAW,OAAO,+BAA+B;AAAA,QACnD;AAAA,MACF;AAAA,IACF,WAAW,sBAAsB,KAAK,OAAO,GAAG;AAC9C,iBAAW,OAAO,8CAA8C;AAAA,IAClE;AAEA,UAAM,UAAU;AAAA,EAClB;AACF;AAEA,SAAS,cAAc,OAAO,aAAa,QAAQ,iBAAiB;AAClE,MAAI,YAAY,KAAK,OAAO;AAE5B,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,eAAW,OAAO,mEAAmE;AAAA,EACvF;AAEA,eAAa,OAAO,KAAK,MAAM;AAE/B,OAAK,QAAQ,GAAG,WAAW,WAAW,QAAQ,QAAQ,UAAU,SAAS,GAAG;AAC1E,UAAM,WAAW,KAAK;AAEtB,QAAI,CAAC,kBAAkB,KAAK,aAAa,GAAG,GAAG;AAC7C,kBAAY,aAAa,KAAK,OAAO,GAAG,CAAC;AACzC,sBAAgB,GAAG,IAAI;AAAA,IACzB;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAC1E,WAAW,gBAAgB,UAAU;AAErC,MAAI,OAAO;AAKX,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAU,MAAM,UAAU,MAAM,KAAK,OAAO;AAE5C,SAAK,QAAQ,GAAG,WAAW,QAAQ,QAAQ,QAAQ,UAAU,SAAS,GAAG;AACvE,UAAI,MAAM,QAAQ,QAAQ,KAAK,CAAC,GAAG;AACjC,mBAAW,OAAO,6CAA6C;AAAA,MACjE;AAEA,UAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,KAAK,CAAC,MAAM,mBAAmB;AAC/E,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAKA,MAAI,OAAO,YAAY,YAAY,OAAO,OAAO,MAAM,mBAAmB;AACxE,cAAU;AAAA,EACZ;AAGA,YAAU,OAAO,OAAO;AAExB,MAAI,YAAY,MAAM;AACpB,cAAU,CAAC;AAAA,EACb;AAEA,MAAI,WAAW,2BAA2B;AACxC,QAAI,MAAM,QAAQ,SAAS,GAAG;AAC5B,WAAK,QAAQ,GAAG,WAAW,UAAU,QAAQ,QAAQ,UAAU,SAAS,GAAG;AACzE,sBAAc,OAAO,SAAS,UAAU,KAAK,GAAG,eAAe;AAAA,MACjE;AAAA,IACF,OAAO;AACL,oBAAc,OAAO,SAAS,WAAW,eAAe;AAAA,IAC1D;AAAA,EACF,OAAO;AACL,QAAI,CAAC,MAAM,QACP,CAAC,kBAAkB,KAAK,iBAAiB,OAAO,KAChD,kBAAkB,KAAK,SAAS,OAAO,GAAG;AAC5C,YAAM,OAAO,aAAa,MAAM;AAChC,YAAM,YAAY,kBAAkB,MAAM;AAC1C,YAAM,WAAW,YAAY,MAAM;AACnC,iBAAW,OAAO,wBAAwB;AAAA,IAC5C;AAEA,gBAAY,SAAS,SAAS,SAAS;AACvC,WAAO,gBAAgB,OAAO;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,OAAO;AAC5B,MAAI;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAc;AACvB,UAAM;AAAA,EACR,WAAW,OAAO,IAAc;AAC9B,UAAM;AACN,QAAI,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAc;AAC3D,YAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,eAAW,OAAO,0BAA0B;AAAA,EAC9C;AAEA,QAAM,QAAQ;AACd,QAAM,YAAY,MAAM;AACxB,QAAM,iBAAiB;AACzB;AAEA,SAAS,oBAAoB,OAAO,eAAe,aAAa;AAC9D,MAAI,aAAa,GACb,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE9C,SAAO,OAAO,GAAG;AACf,WAAO,eAAe,EAAE,GAAG;AACzB,UAAI,OAAO,KAAiB,MAAM,mBAAmB,IAAI;AACvD,cAAM,iBAAiB,MAAM;AAAA,MAC/B;AACA,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,QAAI,iBAAiB,OAAO,IAAa;AACvC,SAAG;AACD,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C,SAAS,OAAO,MAAgB,OAAO,MAAgB,OAAO;AAAA,IAChE;AAEA,QAAI,OAAO,EAAE,GAAG;AACd,oBAAc,KAAK;AAEnB,WAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AACA,YAAM,aAAa;AAEnB,aAAO,OAAO,IAAiB;AAC7B,cAAM;AACN,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,MAAI,gBAAgB,MAAM,eAAe,KAAK,MAAM,aAAa,aAAa;AAC5E,iBAAa,OAAO,uBAAuB;AAAA,EAC7C;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,OAAO;AACpC,MAAI,YAAY,MAAM,UAClB;AAEJ,OAAK,MAAM,MAAM,WAAW,SAAS;AAIrC,OAAK,OAAO,MAAe,OAAO,OAC9B,OAAO,MAAM,MAAM,WAAW,YAAY,CAAC,KAC3C,OAAO,MAAM,MAAM,WAAW,YAAY,CAAC,GAAG;AAEhD,iBAAa;AAEb,SAAK,MAAM,MAAM,WAAW,SAAS;AAErC,QAAI,OAAO,KAAK,aAAa,EAAE,GAAG;AAChC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,OAAO;AACtC,MAAI,UAAU,GAAG;AACf,UAAM,UAAU;AAAA,EAClB,WAAW,QAAQ,GAAG;AACpB,UAAM,UAAU,OAAO,OAAO,MAAM,QAAQ,CAAC;AAAA,EAC/C;AACF;AAGA,SAAS,gBAAgB,OAAO,YAAY,sBAAsB;AAChE,MAAI,WACA,WACA,cACA,YACA,mBACA,OACA,YACA,aACA,QAAQ,MAAM,MACd,UAAU,MAAM,QAChB;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,aAAa,EAAE,KACf,kBAAkB,EAAE,KACpB,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,OACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,MAAe,OAAO,IAAa;AAC5C,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,QAAI,aAAa,SAAS,KACtB,wBAAwB,kBAAkB,SAAS,GAAG;AACxD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,iBAAe,aAAa,MAAM;AAClC,sBAAoB;AAEpB,SAAO,OAAO,GAAG;AACf,QAAI,OAAO,IAAa;AACtB,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,KACtB,wBAAwB,kBAAkB,SAAS,GAAG;AACxD;AAAA,MACF;AAAA,IAEF,WAAW,OAAO,IAAa;AAC7B,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,GAAG;AAC3B;AAAA,MACF;AAAA,IAEF,WAAY,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,KAClE,wBAAwB,kBAAkB,EAAE,GAAG;AACxD;AAAA,IAEF,WAAW,OAAO,EAAE,GAAG;AACrB,cAAQ,MAAM;AACd,mBAAa,MAAM;AACnB,oBAAc,MAAM;AACpB,0BAAoB,OAAO,OAAO,EAAE;AAEpC,UAAI,MAAM,cAAc,YAAY;AAClC,4BAAoB;AACpB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AAAA,MACF,OAAO;AACL,cAAM,WAAW;AACjB,cAAM,OAAO;AACb,cAAM,YAAY;AAClB,cAAM,aAAa;AACnB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,mBAAmB;AACrB,qBAAe,OAAO,cAAc,YAAY,KAAK;AACrD,uBAAiB,OAAO,MAAM,OAAO,KAAK;AAC1C,qBAAe,aAAa,MAAM;AAClC,0BAAoB;AAAA,IACtB;AAEA,QAAI,CAAC,eAAe,EAAE,GAAG;AACvB,mBAAa,MAAM,WAAW;AAAA,IAChC;AAEA,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,iBAAe,OAAO,cAAc,YAAY,KAAK;AAErD,MAAI,MAAM,QAAQ;AAChB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,SAAO;AACT;AAEA,SAAS,uBAAuB,OAAO,YAAY;AACjD,MAAI,IACA,cAAc;AAElB,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM;AACN,iBAAe,aAAa,MAAM;AAElC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,QAAI,OAAO,IAAa;AACtB,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,UAAI,OAAO,IAAa;AACtB,uBAAe,MAAM;AACrB,cAAM;AACN,qBAAa,MAAM;AAAA,MACrB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IAEF,WAAW,OAAO,EAAE,GAAG;AACrB,qBAAe,OAAO,cAAc,YAAY,IAAI;AACpD,uBAAiB,OAAO,oBAAoB,OAAO,OAAO,UAAU,CAAC;AACrE,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAC7E,iBAAW,OAAO,8DAA8D;AAAA,IAElF,OAAO;AACL,YAAM;AACN,mBAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAEA,aAAW,OAAO,4DAA4D;AAChF;AAEA,SAAS,uBAAuB,OAAO,YAAY;AACjD,MAAI,cACA,YACA,WACA,WACA,KACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM;AACN,iBAAe,aAAa,MAAM;AAElC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,QAAI,OAAO,IAAa;AACtB,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,YAAM;AACN,aAAO;AAAA,IAET,WAAW,OAAO,IAAa;AAC7B,qBAAe,OAAO,cAAc,MAAM,UAAU,IAAI;AACxD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,UAAI,OAAO,EAAE,GAAG;AACd,4BAAoB,OAAO,OAAO,UAAU;AAAA,MAG9C,WAAW,KAAK,OAAO,kBAAkB,EAAE,GAAG;AAC5C,cAAM,UAAU,gBAAgB,EAAE;AAClC,cAAM;AAAA,MAER,YAAY,MAAM,cAAc,EAAE,KAAK,GAAG;AACxC,oBAAY;AACZ,oBAAY;AAEZ,eAAO,YAAY,GAAG,aAAa;AACjC,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,eAAK,MAAM,YAAY,EAAE,MAAM,GAAG;AAChC,yBAAa,aAAa,KAAK;AAAA,UAEjC,OAAO;AACL,uBAAW,OAAO,gCAAgC;AAAA,UACpD;AAAA,QACF;AAEA,cAAM,UAAU,kBAAkB,SAAS;AAE3C,cAAM;AAAA,MAER,OAAO;AACL,mBAAW,OAAO,yBAAyB;AAAA,MAC7C;AAEA,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,OAAO,EAAE,GAAG;AACrB,qBAAe,OAAO,cAAc,YAAY,IAAI;AACpD,uBAAiB,OAAO,oBAAoB,OAAO,OAAO,UAAU,CAAC;AACrE,qBAAe,aAAa,MAAM;AAAA,IAEpC,WAAW,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAC7E,iBAAW,OAAO,8DAA8D;AAAA,IAElF,OAAO;AACL,YAAM;AACN,mBAAa,MAAM;AAAA,IACrB;AAAA,EACF;AAEA,aAAW,OAAO,4DAA4D;AAChF;AAEA,SAAS,mBAAmB,OAAO,YAAY;AAC7C,MAAI,WAAW,MACX,OACA,YACA,MACA,OAAW,MAAM,KACjB,SACA,UAAW,MAAM,QACjB,WACA,YACA,QACA,gBACA,WACA,kBAAkB,uBAAO,OAAO,IAAI,GACpC,SACA,QACA,WACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,IAAa;AACtB,iBAAa;AACb,gBAAY;AACZ,cAAU,CAAC;AAAA,EACb,WAAW,OAAO,KAAa;AAC7B,iBAAa;AACb,gBAAY;AACZ,cAAU,CAAC;AAAA,EACb,OAAO;AACL,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,SAAO,OAAO,GAAG;AACf,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,OAAO,YAAY;AACrB,YAAM;AACN,YAAM,MAAM;AACZ,YAAM,SAAS;AACf,YAAM,OAAO,YAAY,YAAY;AACrC,YAAM,SAAS;AACf,aAAO;AAAA,IACT,WAAW,CAAC,UAAU;AACpB,iBAAW,OAAO,8CAA8C;AAAA,IAClE,WAAW,OAAO,IAAa;AAE7B,iBAAW,OAAO,0CAA0C;AAAA,IAC9D;AAEA,aAAS,UAAU,YAAY;AAC/B,aAAS,iBAAiB;AAE1B,QAAI,OAAO,IAAa;AACtB,kBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,UAAI,aAAa,SAAS,GAAG;AAC3B,iBAAS,iBAAiB;AAC1B,cAAM;AACN,4BAAoB,OAAO,MAAM,UAAU;AAAA,MAC7C;AAAA,IACF;AAEA,YAAQ,MAAM;AACd,iBAAa,MAAM;AACnB,WAAO,MAAM;AACb,gBAAY,OAAO,YAAY,iBAAiB,OAAO,IAAI;AAC3D,aAAS,MAAM;AACf,cAAU,MAAM;AAChB,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAK,kBAAkB,MAAM,SAAS,UAAU,OAAO,IAAa;AAClE,eAAS;AACT,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,0BAAoB,OAAO,MAAM,UAAU;AAC3C,kBAAY,OAAO,YAAY,iBAAiB,OAAO,IAAI;AAC3D,kBAAY,MAAM;AAAA,IACpB;AAEA,QAAI,WAAW;AACb,uBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAAW,OAAO,YAAY,IAAI;AAAA,IACvG,WAAW,QAAQ;AACjB,cAAQ,KAAK,iBAAiB,OAAO,MAAM,iBAAiB,QAAQ,SAAS,WAAW,OAAO,YAAY,IAAI,CAAC;AAAA,IAClH,OAAO;AACL,cAAQ,KAAK,OAAO;AAAA,IACtB;AAEA,wBAAoB,OAAO,MAAM,UAAU;AAE3C,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,OAAO,IAAa;AACtB,iBAAW;AACX,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,aAAW,OAAO,uDAAuD;AAC3E;AAEA,SAAS,gBAAgB,OAAO,YAAY;AAC1C,MAAI,cACA,SACA,WAAiB,eACjB,iBAAiB,OACjB,iBAAiB,OACjB,aAAiB,YACjB,aAAiB,GACjB,iBAAiB,OACjB,KACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,KAAa;AACtB,cAAU;AAAA,EACZ,WAAW,OAAO,IAAa;AAC7B,cAAU;AAAA,EACZ,OAAO;AACL,WAAO;AAAA,EACT;AAEA,QAAM,OAAO;AACb,QAAM,SAAS;AAEf,SAAO,OAAO,GAAG;AACf,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,QAAI,OAAO,MAAe,OAAO,IAAa;AAC5C,UAAI,kBAAkB,UAAU;AAC9B,mBAAY,OAAO,KAAe,gBAAgB;AAAA,MACpD,OAAO;AACL,mBAAW,OAAO,sCAAsC;AAAA,MAC1D;AAAA,IAEF,YAAY,MAAM,gBAAgB,EAAE,MAAM,GAAG;AAC3C,UAAI,QAAQ,GAAG;AACb,mBAAW,OAAO,8EAA8E;AAAA,MAClG,WAAW,CAAC,gBAAgB;AAC1B,qBAAa,aAAa,MAAM;AAChC,yBAAiB;AAAA,MACnB,OAAO;AACL,mBAAW,OAAO,2CAA2C;AAAA,MAC/D;AAAA,IAEF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,MAAI,eAAe,EAAE,GAAG;AACtB,OAAG;AAAE,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAAG,SAC7C,eAAe,EAAE;AAExB,QAAI,OAAO,IAAa;AACtB,SAAG;AAAE,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAAG,SAC7C,CAAC,OAAO,EAAE,KAAM,OAAO;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,OAAO,GAAG;AACf,kBAAc,KAAK;AACnB,UAAM,aAAa;AAEnB,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,YAAQ,CAAC,kBAAkB,MAAM,aAAa,eACtC,OAAO,IAAkB;AAC/B,YAAM;AACN,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,QAAI,CAAC,kBAAkB,MAAM,aAAa,YAAY;AACpD,mBAAa,MAAM;AAAA,IACrB;AAEA,QAAI,OAAO,EAAE,GAAG;AACd;AACA;AAAA,IACF;AAGA,QAAI,MAAM,aAAa,YAAY;AAGjC,UAAI,aAAa,eAAe;AAC9B,cAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,MAClF,WAAW,aAAa,eAAe;AACrC,YAAI,gBAAgB;AAClB,gBAAM,UAAU;AAAA,QAClB;AAAA,MACF;AAGA;AAAA,IACF;AAGA,QAAI,SAAS;AAGX,UAAI,eAAe,EAAE,GAAG;AACtB,yBAAiB;AAEjB,cAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,MAGlF,WAAW,gBAAgB;AACzB,yBAAiB;AACjB,cAAM,UAAU,OAAO,OAAO,MAAM,aAAa,CAAC;AAAA,MAGpD,WAAW,eAAe,GAAG;AAC3B,YAAI,gBAAgB;AAClB,gBAAM,UAAU;AAAA,QAClB;AAAA,MAGF,OAAO;AACL,cAAM,UAAU,OAAO,OAAO,MAAM,UAAU;AAAA,MAChD;AAAA,IAGF,OAAO;AAEL,YAAM,UAAU,OAAO,OAAO,MAAM,iBAAiB,IAAI,aAAa,UAAU;AAAA,IAClF;AAEA,qBAAiB;AACjB,qBAAiB;AACjB,iBAAa;AACb,mBAAe,MAAM;AAErB,WAAO,CAAC,OAAO,EAAE,KAAM,OAAO,GAAI;AAChC,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,mBAAe,OAAO,cAAc,MAAM,UAAU,KAAK;AAAA,EAC3D;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAO,YAAY;AAC5C,MAAI,OACA,OAAY,MAAM,KAClB,UAAY,MAAM,QAClB,UAAY,CAAC,GACb,WACA,WAAY,OACZ;AAIJ,MAAI,MAAM,mBAAmB,GAAI,QAAO;AAExC,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAO,OAAO,GAAG;AACf,QAAI,MAAM,mBAAmB,IAAI;AAC/B,YAAM,WAAW,MAAM;AACvB,iBAAW,OAAO,gDAAgD;AAAA,IACpE;AAEA,QAAI,OAAO,IAAa;AACtB;AAAA,IACF;AAEA,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AAErD,QAAI,CAAC,aAAa,SAAS,GAAG;AAC5B;AAAA,IACF;AAEA,eAAW;AACX,UAAM;AAEN,QAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,UAAI,MAAM,cAAc,YAAY;AAClC,gBAAQ,KAAK,IAAI;AACjB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1C;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,MAAM;AACd,gBAAY,OAAO,YAAY,kBAAkB,OAAO,IAAI;AAC5D,YAAQ,KAAK,MAAM,MAAM;AACzB,wBAAoB,OAAO,MAAM,EAAE;AAEnC,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAK,MAAM,SAAS,SAAS,MAAM,aAAa,eAAgB,OAAO,GAAI;AACzE,iBAAW,OAAO,qCAAqC;AAAA,IACzD,WAAW,MAAM,aAAa,YAAY;AACxC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,UAAU;AACZ,UAAM,MAAM;AACZ,UAAM,SAAS;AACf,UAAM,OAAO;AACb,UAAM,SAAS;AACf,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,YAAY,YAAY;AACvD,MAAI,WACA,cACA,OACA,UACA,eACA,SACA,OAAgB,MAAM,KACtB,UAAgB,MAAM,QACtB,UAAgB,CAAC,GACjB,kBAAkB,uBAAO,OAAO,IAAI,GACpC,SAAgB,MAChB,UAAgB,MAChB,YAAgB,MAChB,gBAAgB,OAChB,WAAgB,OAChB;AAIJ,MAAI,MAAM,mBAAmB,GAAI,QAAO;AAExC,MAAI,MAAM,WAAW,MAAM;AACzB,UAAM,UAAU,MAAM,MAAM,IAAI;AAAA,EAClC;AAEA,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,SAAO,OAAO,GAAG;AACf,QAAI,CAAC,iBAAiB,MAAM,mBAAmB,IAAI;AACjD,YAAM,WAAW,MAAM;AACvB,iBAAW,OAAO,gDAAgD;AAAA,IACpE;AAEA,gBAAY,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC;AACrD,YAAQ,MAAM;AAMd,SAAK,OAAO,MAAe,OAAO,OAAgB,aAAa,SAAS,GAAG;AAEzE,UAAI,OAAO,IAAa;AACtB,YAAI,eAAe;AACjB,2BAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AACzG,mBAAS,UAAU,YAAY;AAAA,QACjC;AAEA,mBAAW;AACX,wBAAgB;AAChB,uBAAe;AAAA,MAEjB,WAAW,eAAe;AAExB,wBAAgB;AAChB,uBAAe;AAAA,MAEjB,OAAO;AACL,mBAAW,OAAO,mGAAmG;AAAA,MACvH;AAEA,YAAM,YAAY;AAClB,WAAK;AAAA,IAKP,OAAO;AACL,iBAAW,MAAM;AACjB,sBAAgB,MAAM;AACtB,gBAAU,MAAM;AAEhB,UAAI,CAAC,YAAY,OAAO,YAAY,kBAAkB,OAAO,IAAI,GAAG;AAGlE;AAAA,MACF;AAEA,UAAI,MAAM,SAAS,OAAO;AACxB,aAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,eAAO,eAAe,EAAE,GAAG;AACzB,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,QAC9C;AAEA,YAAI,OAAO,IAAa;AACtB,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,cAAI,CAAC,aAAa,EAAE,GAAG;AACrB,uBAAW,OAAO,yFAAyF;AAAA,UAC7G;AAEA,cAAI,eAAe;AACjB,6BAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AACzG,qBAAS,UAAU,YAAY;AAAA,UACjC;AAEA,qBAAW;AACX,0BAAgB;AAChB,yBAAe;AACf,mBAAS,MAAM;AACf,oBAAU,MAAM;AAAA,QAElB,WAAW,UAAU;AACnB,qBAAW,OAAO,0DAA0D;AAAA,QAE9E,OAAO;AACL,gBAAM,MAAM;AACZ,gBAAM,SAAS;AACf,iBAAO;AAAA,QACT;AAAA,MAEF,WAAW,UAAU;AACnB,mBAAW,OAAO,gFAAgF;AAAA,MAEpG,OAAO;AACL,cAAM,MAAM;AACZ,cAAM,SAAS;AACf,eAAO;AAAA,MACT;AAAA,IACF;AAKA,QAAI,MAAM,SAAS,SAAS,MAAM,aAAa,YAAY;AACzD,UAAI,eAAe;AACjB,mBAAW,MAAM;AACjB,wBAAgB,MAAM;AACtB,kBAAU,MAAM;AAAA,MAClB;AAEA,UAAI,YAAY,OAAO,YAAY,mBAAmB,MAAM,YAAY,GAAG;AACzE,YAAI,eAAe;AACjB,oBAAU,MAAM;AAAA,QAClB,OAAO;AACL,sBAAY,MAAM;AAAA,QACpB;AAAA,MACF;AAEA,UAAI,CAAC,eAAe;AAClB,yBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,WAAW,UAAU,eAAe,OAAO;AAC9G,iBAAS,UAAU,YAAY;AAAA,MACjC;AAEA,0BAAoB,OAAO,MAAM,EAAE;AACnC,WAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAAA,IAC5C;AAEA,SAAK,MAAM,SAAS,SAAS,MAAM,aAAa,eAAgB,OAAO,GAAI;AACzE,iBAAW,OAAO,oCAAoC;AAAA,IACxD,WAAW,MAAM,aAAa,YAAY;AACxC;AAAA,IACF;AAAA,EACF;AAOA,MAAI,eAAe;AACjB,qBAAiB,OAAO,SAAS,iBAAiB,QAAQ,SAAS,MAAM,UAAU,eAAe,OAAO;AAAA,EAC3G;AAGA,MAAI,UAAU;AACZ,UAAM,MAAM;AACZ,UAAM,SAAS;AACf,UAAM,OAAO;AACb,UAAM,SAAS;AAAA,EACjB;AAEA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAO;AAC9B,MAAI,WACA,aAAa,OACb,UAAa,OACb,WACA,SACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,MAAI,MAAM,QAAQ,MAAM;AACtB,eAAW,OAAO,+BAA+B;AAAA,EACnD;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAE5C,MAAI,OAAO,IAAa;AACtB,iBAAa;AACb,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAE9C,WAAW,OAAO,IAAa;AAC7B,cAAU;AACV,gBAAY;AACZ,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAE9C,OAAO;AACL,gBAAY;AAAA,EACd;AAEA,cAAY,MAAM;AAElB,MAAI,YAAY;AACd,OAAG;AAAE,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAAG,SAC7C,OAAO,KAAK,OAAO;AAE1B,QAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,gBAAU,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AACrD,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C,OAAO;AACL,iBAAW,OAAO,oDAAoD;AAAA,IACxE;AAAA,EACF,OAAO;AACL,WAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AAEpC,UAAI,OAAO,IAAa;AACtB,YAAI,CAAC,SAAS;AACZ,sBAAY,MAAM,MAAM,MAAM,YAAY,GAAG,MAAM,WAAW,CAAC;AAE/D,cAAI,CAAC,mBAAmB,KAAK,SAAS,GAAG;AACvC,uBAAW,OAAO,iDAAiD;AAAA,UACrE;AAEA,oBAAU;AACV,sBAAY,MAAM,WAAW;AAAA,QAC/B,OAAO;AACL,qBAAW,OAAO,6CAA6C;AAAA,QACjE;AAAA,MACF;AAEA,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,cAAU,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAErD,QAAI,wBAAwB,KAAK,OAAO,GAAG;AACzC,iBAAW,OAAO,qDAAqD;AAAA,IACzE;AAAA,EACF;AAEA,MAAI,WAAW,CAAC,gBAAgB,KAAK,OAAO,GAAG;AAC7C,eAAW,OAAO,8CAA8C,OAAO;AAAA,EACzE;AAEA,MAAI;AACF,cAAU,mBAAmB,OAAO;AAAA,EACtC,SAAS,KAAK;AACZ,eAAW,OAAO,4BAA4B,OAAO;AAAA,EACvD;AAEA,MAAI,YAAY;AACd,UAAM,MAAM;AAAA,EAEd,WAAW,kBAAkB,KAAK,MAAM,QAAQ,SAAS,GAAG;AAC1D,UAAM,MAAM,MAAM,OAAO,SAAS,IAAI;AAAA,EAExC,WAAW,cAAc,KAAK;AAC5B,UAAM,MAAM,MAAM;AAAA,EAEpB,WAAW,cAAc,MAAM;AAC7B,UAAM,MAAM,uBAAuB;AAAA,EAErC,OAAO;AACL,eAAW,OAAO,4BAA4B,YAAY,GAAG;AAAA,EAC/D;AAEA,SAAO;AACT;AAEA,SAAS,mBAAmB,OAAO;AACjC,MAAI,WACA;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,MAAI,MAAM,WAAW,MAAM;AACzB,eAAW,OAAO,mCAAmC;AAAA,EACvD;AAEA,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,cAAY,MAAM;AAElB,SAAO,OAAO,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG;AAC9D,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,MAAI,MAAM,aAAa,WAAW;AAChC,eAAW,OAAO,4DAA4D;AAAA,EAChF;AAEA,QAAM,SAAS,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC1D,SAAO;AACT;AAEA,SAAS,UAAU,OAAO;AACxB,MAAI,WAAW,OACX;AAEJ,OAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,MAAI,OAAO,GAAa,QAAO;AAE/B,OAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,cAAY,MAAM;AAElB,SAAO,OAAO,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG;AAC9D,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,EAC9C;AAEA,MAAI,MAAM,aAAa,WAAW;AAChC,eAAW,OAAO,2DAA2D;AAAA,EAC/E;AAEA,UAAQ,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAEnD,MAAI,CAAC,kBAAkB,KAAK,MAAM,WAAW,KAAK,GAAG;AACnD,eAAW,OAAO,yBAAyB,QAAQ,GAAG;AAAA,EACxD;AAEA,QAAM,SAAS,MAAM,UAAU,KAAK;AACpC,sBAAoB,OAAO,MAAM,EAAE;AACnC,SAAO;AACT;AAEA,SAAS,YAAY,OAAO,cAAc,aAAa,aAAa,cAAc;AAChF,MAAI,kBACA,mBACA,uBACA,eAAe,GACf,YAAa,OACb,aAAa,OACb,WACA,cACA,UACAG,OACA,YACA;AAEJ,MAAI,MAAM,aAAa,MAAM;AAC3B,UAAM,SAAS,QAAQ,KAAK;AAAA,EAC9B;AAEA,QAAM,MAAS;AACf,QAAM,SAAS;AACf,QAAM,OAAS;AACf,QAAM,SAAS;AAEf,qBAAmB,oBAAoB,wBACrC,sBAAsB,eACtB,qBAAsB;AAExB,MAAI,aAAa;AACf,QAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,kBAAY;AAEZ,UAAI,MAAM,aAAa,cAAc;AACnC,uBAAe;AAAA,MACjB,WAAW,MAAM,eAAe,cAAc;AAC5C,uBAAe;AAAA,MACjB,WAAW,MAAM,aAAa,cAAc;AAC1C,uBAAe;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,iBAAiB,GAAG;AACtB,WAAO,gBAAgB,KAAK,KAAK,mBAAmB,KAAK,GAAG;AAC1D,UAAI,oBAAoB,OAAO,MAAM,EAAE,GAAG;AACxC,oBAAY;AACZ,gCAAwB;AAExB,YAAI,MAAM,aAAa,cAAc;AACnC,yBAAe;AAAA,QACjB,WAAW,MAAM,eAAe,cAAc;AAC5C,yBAAe;AAAA,QACjB,WAAW,MAAM,aAAa,cAAc;AAC1C,yBAAe;AAAA,QACjB;AAAA,MACF,OAAO;AACL,gCAAwB;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,MAAI,uBAAuB;AACzB,4BAAwB,aAAa;AAAA,EACvC;AAEA,MAAI,iBAAiB,KAAK,sBAAsB,aAAa;AAC3D,QAAI,oBAAoB,eAAe,qBAAqB,aAAa;AACvE,mBAAa;AAAA,IACf,OAAO;AACL,mBAAa,eAAe;AAAA,IAC9B;AAEA,kBAAc,MAAM,WAAW,MAAM;AAErC,QAAI,iBAAiB,GAAG;AACtB,UAAI,0BACC,kBAAkB,OAAO,WAAW,KACpC,iBAAiB,OAAO,aAAa,UAAU,MAChD,mBAAmB,OAAO,UAAU,GAAG;AACzC,qBAAa;AAAA,MACf,OAAO;AACL,YAAK,qBAAqB,gBAAgB,OAAO,UAAU,KACvD,uBAAuB,OAAO,UAAU,KACxC,uBAAuB,OAAO,UAAU,GAAG;AAC7C,uBAAa;AAAA,QAEf,WAAW,UAAU,KAAK,GAAG;AAC3B,uBAAa;AAEb,cAAI,MAAM,QAAQ,QAAQ,MAAM,WAAW,MAAM;AAC/C,uBAAW,OAAO,2CAA2C;AAAA,UAC/D;AAAA,QAEF,WAAW,gBAAgB,OAAO,YAAY,oBAAoB,WAAW,GAAG;AAC9E,uBAAa;AAEb,cAAI,MAAM,QAAQ,MAAM;AACtB,kBAAM,MAAM;AAAA,UACd;AAAA,QACF;AAEA,YAAI,MAAM,WAAW,MAAM;AACzB,gBAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,QACxC;AAAA,MACF;AAAA,IACF,WAAW,iBAAiB,GAAG;AAG7B,mBAAa,yBAAyB,kBAAkB,OAAO,WAAW;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,MAAM,QAAQ,MAAM;AACtB,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,IACxC;AAAA,EAEF,WAAW,MAAM,QAAQ,KAAK;AAO5B,QAAI,MAAM,WAAW,QAAQ,MAAM,SAAS,UAAU;AACpD,iBAAW,OAAO,sEAAsE,MAAM,OAAO,GAAG;AAAA,IAC1G;AAEA,SAAK,YAAY,GAAG,eAAe,MAAM,cAAc,QAAQ,YAAY,cAAc,aAAa,GAAG;AACvG,MAAAA,QAAO,MAAM,cAAc,SAAS;AAEpC,UAAIA,MAAK,QAAQ,MAAM,MAAM,GAAG;AAC9B,cAAM,SAASA,MAAK,UAAU,MAAM,MAAM;AAC1C,cAAM,MAAMA,MAAK;AACjB,YAAI,MAAM,WAAW,MAAM;AACzB,gBAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,QACxC;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,WAAW,MAAM,QAAQ,KAAK;AAC5B,QAAI,kBAAkB,KAAK,MAAM,QAAQ,MAAM,QAAQ,UAAU,GAAG,MAAM,GAAG,GAAG;AAC9E,MAAAA,QAAO,MAAM,QAAQ,MAAM,QAAQ,UAAU,EAAE,MAAM,GAAG;AAAA,IAC1D,OAAO;AAEL,MAAAA,QAAO;AACP,iBAAW,MAAM,QAAQ,MAAM,MAAM,QAAQ,UAAU;AAEvD,WAAK,YAAY,GAAG,eAAe,SAAS,QAAQ,YAAY,cAAc,aAAa,GAAG;AAC5F,YAAI,MAAM,IAAI,MAAM,GAAG,SAAS,SAAS,EAAE,IAAI,MAAM,MAAM,SAAS,SAAS,EAAE,KAAK;AAClF,UAAAA,QAAO,SAAS,SAAS;AACzB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAACA,OAAM;AACT,iBAAW,OAAO,mBAAmB,MAAM,MAAM,GAAG;AAAA,IACtD;AAEA,QAAI,MAAM,WAAW,QAAQA,MAAK,SAAS,MAAM,MAAM;AACrD,iBAAW,OAAO,kCAAkC,MAAM,MAAM,0BAA0BA,MAAK,OAAO,aAAa,MAAM,OAAO,GAAG;AAAA,IACrI;AAEA,QAAI,CAACA,MAAK,QAAQ,MAAM,QAAQ,MAAM,GAAG,GAAG;AAC1C,iBAAW,OAAO,kCAAkC,MAAM,MAAM,gBAAgB;AAAA,IAClF,OAAO;AACL,YAAM,SAASA,MAAK,UAAU,MAAM,QAAQ,MAAM,GAAG;AACrD,UAAI,MAAM,WAAW,MAAM;AACzB,cAAM,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,aAAa,MAAM;AAC3B,UAAM,SAAS,SAAS,KAAK;AAAA,EAC/B;AACA,SAAO,MAAM,QAAQ,QAAS,MAAM,WAAW,QAAQ;AACzD;AAEA,SAAS,aAAa,OAAO;AAC3B,MAAI,gBAAgB,MAAM,UACtB,WACA,eACA,eACA,gBAAgB,OAChB;AAEJ,QAAM,UAAU;AAChB,QAAM,kBAAkB,MAAM;AAC9B,QAAM,SAAS,uBAAO,OAAO,IAAI;AACjC,QAAM,YAAY,uBAAO,OAAO,IAAI;AAEpC,UAAQ,KAAK,MAAM,MAAM,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC1D,wBAAoB,OAAO,MAAM,EAAE;AAEnC,SAAK,MAAM,MAAM,WAAW,MAAM,QAAQ;AAE1C,QAAI,MAAM,aAAa,KAAK,OAAO,IAAa;AAC9C;AAAA,IACF;AAEA,oBAAgB;AAChB,SAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAC5C,gBAAY,MAAM;AAElB,WAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AACpC,WAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,IAC9C;AAEA,oBAAgB,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ;AAC3D,oBAAgB,CAAC;AAEjB,QAAI,cAAc,SAAS,GAAG;AAC5B,iBAAW,OAAO,8DAA8D;AAAA,IAClF;AAEA,WAAO,OAAO,GAAG;AACf,aAAO,eAAe,EAAE,GAAG;AACzB,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAEA,UAAI,OAAO,IAAa;AACtB,WAAG;AAAE,eAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,QAAG,SAC7C,OAAO,KAAK,CAAC,OAAO,EAAE;AAC7B;AAAA,MACF;AAEA,UAAI,OAAO,EAAE,EAAG;AAEhB,kBAAY,MAAM;AAElB,aAAO,OAAO,KAAK,CAAC,aAAa,EAAE,GAAG;AACpC,aAAK,MAAM,MAAM,WAAW,EAAE,MAAM,QAAQ;AAAA,MAC9C;AAEA,oBAAc,KAAK,MAAM,MAAM,MAAM,WAAW,MAAM,QAAQ,CAAC;AAAA,IACjE;AAEA,QAAI,OAAO,EAAG,eAAc,KAAK;AAEjC,QAAI,kBAAkB,KAAK,mBAAmB,aAAa,GAAG;AAC5D,wBAAkB,aAAa,EAAE,OAAO,eAAe,aAAa;AAAA,IACtE,OAAO;AACL,mBAAa,OAAO,iCAAiC,gBAAgB,GAAG;AAAA,IAC1E;AAAA,EACF;AAEA,sBAAoB,OAAO,MAAM,EAAE;AAEnC,MAAI,MAAM,eAAe,KACrB,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAU,MAC/C,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC,MAAM,MAC/C,MAAM,MAAM,WAAW,MAAM,WAAW,CAAC,MAAM,IAAa;AAC9D,UAAM,YAAY;AAClB,wBAAoB,OAAO,MAAM,EAAE;AAAA,EAErC,WAAW,eAAe;AACxB,eAAW,OAAO,iCAAiC;AAAA,EACrD;AAEA,cAAY,OAAO,MAAM,aAAa,GAAG,mBAAmB,OAAO,IAAI;AACvE,sBAAoB,OAAO,MAAM,EAAE;AAEnC,MAAI,MAAM,mBACN,8BAA8B,KAAK,MAAM,MAAM,MAAM,eAAe,MAAM,QAAQ,CAAC,GAAG;AACxF,iBAAa,OAAO,kDAAkD;AAAA,EACxE;AAEA,QAAM,UAAU,KAAK,MAAM,MAAM;AAEjC,MAAI,MAAM,aAAa,MAAM,aAAa,sBAAsB,KAAK,GAAG;AAEtE,QAAI,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAa;AAC1D,YAAM,YAAY;AAClB,0BAAoB,OAAO,MAAM,EAAE;AAAA,IACrC;AACA;AAAA,EACF;AAEA,MAAI,MAAM,WAAY,MAAM,SAAS,GAAI;AACvC,eAAW,OAAO,uDAAuD;AAAA,EAC3E,OAAO;AACL;AAAA,EACF;AACF;AAGA,SAAS,cAAc,OAAO,SAAS;AACrC,UAAQ,OAAO,KAAK;AACpB,YAAU,WAAW,CAAC;AAEtB,MAAI,MAAM,WAAW,GAAG;AAGtB,QAAI,MAAM,WAAW,MAAM,SAAS,CAAC,MAAM,MACvC,MAAM,WAAW,MAAM,SAAS,CAAC,MAAM,IAAc;AACvD,eAAS;AAAA,IACX;AAGA,QAAI,MAAM,WAAW,CAAC,MAAM,OAAQ;AAClC,cAAQ,MAAM,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,QAAQ,IAAI,QAAQ,OAAO,OAAO;AAEtC,MAAI,UAAU,MAAM,QAAQ,IAAI;AAEhC,MAAI,YAAY,IAAI;AAClB,UAAM,WAAW;AACjB,eAAW,OAAO,mCAAmC;AAAA,EACvD;AAGA,QAAM,SAAS;AAEf,SAAO,MAAM,MAAM,WAAW,MAAM,QAAQ,MAAM,IAAiB;AACjE,UAAM,cAAc;AACpB,UAAM,YAAY;AAAA,EACpB;AAEA,SAAO,MAAM,WAAY,MAAM,SAAS,GAAI;AAC1C,iBAAa,KAAK;AAAA,EACpB;AAEA,SAAO,MAAM;AACf;AAGA,SAAS,UAAU,OAAO,UAAU,SAAS;AAC3C,MAAI,aAAa,QAAQ,OAAO,aAAa,YAAY,OAAO,YAAY,aAAa;AACvF,cAAU;AACV,eAAW;AAAA,EACb;AAEA,MAAI,YAAY,cAAc,OAAO,OAAO;AAE5C,MAAI,OAAO,aAAa,YAAY;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,GAAG,SAAS,UAAU,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,aAAS,UAAU,KAAK,CAAC;AAAA,EAC3B;AACF;AAGA,SAAS,OAAO,OAAO,SAAS;AAC9B,MAAI,YAAY,cAAc,OAAO,OAAO;AAE5C,MAAI,UAAU,WAAW,GAAG;AAE1B,WAAO;AAAA,EACT,WAAW,UAAU,WAAW,GAAG;AACjC,WAAO,UAAU,CAAC;AAAA,EACpB;AACA,QAAM,IAAI,UAAU,0DAA0D;AAChF;AAGA,IAAI,YAAY;AAChB,IAAI,SAAY;AAEhB,IAAI,SAAS;AAAA,EACZ,SAAS;AAAA,EACT,MAAM;AACP;AAQA,IAAI,YAAkB,OAAO,UAAU;AACvC,IAAI,kBAAkB,OAAO,UAAU;AAEvC,IAAI,WAA4B;AAChC,IAAI,WAA4B;AAChC,IAAI,iBAA4B;AAChC,IAAI,uBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,mBAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,eAA4B;AAChC,IAAI,iBAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,gBAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,aAA4B;AAChC,IAAI,cAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,gBAA4B;AAChC,IAAI,qBAA4B;AAChC,IAAI,2BAA4B;AAChC,IAAI,4BAA4B;AAChC,IAAI,oBAA4B;AAChC,IAAI,0BAA4B;AAChC,IAAI,qBAA4B;AAChC,IAAI,2BAA4B;AAEhC,IAAI,mBAAmB,CAAC;AAExB,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,CAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,EAAI,IAAM;AAC3B,iBAAiB,GAAI,IAAM;AAC3B,iBAAiB,GAAI,IAAM;AAC3B,iBAAiB,IAAM,IAAI;AAC3B,iBAAiB,IAAM,IAAI;AAE3B,IAAI,6BAA6B;AAAA,EAC/B;AAAA,EAAK;AAAA,EAAK;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAC3C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAC5C;AAEA,IAAI,2BAA2B;AAE/B,SAAS,gBAAgBD,SAAQD,MAAK;AACpC,MAAI,QAAQ,MAAM,OAAO,QAAQ,KAAK,OAAOE;AAE7C,MAAIF,SAAQ,KAAM,QAAO,CAAC;AAE1B,WAAS,CAAC;AACV,SAAO,OAAO,KAAKA,IAAG;AAEtB,OAAK,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAChE,UAAM,KAAK,KAAK;AAChB,YAAQ,OAAOA,KAAI,GAAG,CAAC;AAEvB,QAAI,IAAI,MAAM,GAAG,CAAC,MAAM,MAAM;AAC5B,YAAM,uBAAuB,IAAI,MAAM,CAAC;AAAA,IAC1C;AACA,IAAAE,QAAOD,QAAO,gBAAgB,UAAU,EAAE,GAAG;AAE7C,QAAIC,SAAQ,gBAAgB,KAAKA,MAAK,cAAc,KAAK,GAAG;AAC1D,cAAQA,MAAK,aAAa,KAAK;AAAA,IACjC;AAEA,WAAO,GAAG,IAAI;AAAA,EAChB;AAEA,SAAO;AACT;AAEA,SAAS,UAAU,WAAW;AAC5B,MAAI,QAAQ,QAAQ;AAEpB,WAAS,UAAU,SAAS,EAAE,EAAE,YAAY;AAE5C,MAAI,aAAa,KAAM;AACrB,aAAS;AACT,aAAS;AAAA,EACX,WAAW,aAAa,OAAQ;AAC9B,aAAS;AACT,aAAS;AAAA,EACX,WAAW,aAAa,YAAY;AAClC,aAAS;AACT,aAAS;AAAA,EACX,OAAO;AACL,UAAM,IAAI,UAAU,+DAA+D;AAAA,EACrF;AAEA,SAAO,OAAO,SAAS,OAAO,OAAO,KAAK,SAAS,OAAO,MAAM,IAAI;AACtE;AAGA,IAAI,sBAAsB;AAA1B,IACI,sBAAsB;AAE1B,SAAS,MAAM,SAAS;AACtB,OAAK,SAAgB,QAAQ,QAAQ,KAAK;AAC1C,OAAK,SAAgB,KAAK,IAAI,GAAI,QAAQ,QAAQ,KAAK,CAAE;AACzD,OAAK,gBAAgB,QAAQ,eAAe,KAAK;AACjD,OAAK,cAAgB,QAAQ,aAAa,KAAK;AAC/C,OAAK,YAAiB,OAAO,UAAU,QAAQ,WAAW,CAAC,IAAI,KAAK,QAAQ,WAAW;AACvF,OAAK,WAAgB,gBAAgB,KAAK,QAAQ,QAAQ,QAAQ,KAAK,IAAI;AAC3E,OAAK,WAAgB,QAAQ,UAAU,KAAK;AAC5C,OAAK,YAAgB,QAAQ,WAAW,KAAK;AAC7C,OAAK,SAAgB,QAAQ,QAAQ,KAAK;AAC1C,OAAK,eAAgB,QAAQ,cAAc,KAAK;AAChD,OAAK,eAAgB,QAAQ,cAAc,KAAK;AAChD,OAAK,cAAgB,QAAQ,aAAa,MAAM,MAAM,sBAAsB;AAC5E,OAAK,cAAgB,QAAQ,aAAa,KAAK;AAC/C,OAAK,WAAgB,OAAO,QAAQ,UAAU,MAAM,aAAa,QAAQ,UAAU,IAAI;AAEvF,OAAK,gBAAgB,KAAK,OAAO;AACjC,OAAK,gBAAgB,KAAK,OAAO;AAEjC,OAAK,MAAM;AACX,OAAK,SAAS;AAEd,OAAK,aAAa,CAAC;AACnB,OAAK,iBAAiB;AACxB;AAGA,SAAS,aAAa,QAAQ,QAAQ;AACpC,MAAI,MAAM,OAAO,OAAO,KAAK,MAAM,GAC/B,WAAW,GACX,OAAO,IACP,SAAS,IACT,MACA,SAAS,OAAO;AAEpB,SAAO,WAAW,QAAQ;AACxB,WAAO,OAAO,QAAQ,MAAM,QAAQ;AACpC,QAAI,SAAS,IAAI;AACf,aAAO,OAAO,MAAM,QAAQ;AAC5B,iBAAW;AAAA,IACb,OAAO;AACL,aAAO,OAAO,MAAM,UAAU,OAAO,CAAC;AACtC,iBAAW,OAAO;AAAA,IACpB;AAEA,QAAI,KAAK,UAAU,SAAS,KAAM,WAAU;AAE5C,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAO,OAAO;AACtC,SAAO,OAAO,OAAO,OAAO,KAAK,MAAM,SAAS,KAAK;AACvD;AAEA,SAAS,sBAAsB,OAAOE,MAAK;AACzC,MAAI,OAAO,QAAQF;AAEnB,OAAK,QAAQ,GAAG,SAAS,MAAM,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAC/E,IAAAA,QAAO,MAAM,cAAc,KAAK;AAEhC,QAAIA,MAAK,QAAQE,IAAG,GAAG;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,aAAa,GAAG;AACvB,SAAO,MAAM,cAAc,MAAM;AACnC;AAMA,SAAS,YAAY,GAAG;AACtB,SAAS,MAAW,KAAK,KAAK,OACrB,OAAW,KAAK,KAAK,SAAa,MAAM,QAAU,MAAM,QACxD,SAAW,KAAK,KAAK,SAAa,MAAM,YACxC,SAAW,KAAK,KAAK;AAChC;AAOA,SAAS,qBAAqB,GAAG;AAC/B,SAAO,YAAY,CAAC,KACf,MAAM,YAEN,MAAM,wBACN,MAAM;AACb;AAWA,SAAS,YAAY,GAAG,MAAM,SAAS;AACrC,MAAI,wBAAwB,qBAAqB,CAAC;AAClD,MAAI,YAAY,yBAAyB,CAAC,aAAa,CAAC;AACxD;AAAA;AAAA,KAEE;AAAA;AAAA,MACE;AAAA,QACE,yBAEG,MAAM,cACN,MAAM,4BACN,MAAM,6BACN,MAAM,2BACN,MAAM,6BAGV,MAAM,cACN,EAAE,SAAS,cAAc,CAAC,cACzB,qBAAqB,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,MAAM,cAC3D,SAAS,cAAc;AAAA;AAC/B;AAGA,SAAS,iBAAiB,GAAG;AAI3B,SAAO,YAAY,CAAC,KAAK,MAAM,YAC1B,CAAC,aAAa,CAAC,KAGf,MAAM,cACN,MAAM,iBACN,MAAM,cACN,MAAM,cACN,MAAM,4BACN,MAAM,6BACN,MAAM,2BACN,MAAM,4BAEN,MAAM,cACN,MAAM,kBACN,MAAM,iBACN,MAAM,oBACN,MAAM,sBACN,MAAM,eACN,MAAM,qBACN,MAAM,qBACN,MAAM,qBAEN,MAAM,gBACN,MAAM,sBACN,MAAM;AACb;AAGA,SAAS,gBAAgB,GAAG;AAE1B,SAAO,CAAC,aAAa,CAAC,KAAK,MAAM;AACnC;AAGA,SAAS,YAAY,QAAQ,KAAK;AAChC,MAAI,QAAQ,OAAO,WAAW,GAAG,GAAG;AACpC,MAAI,SAAS,SAAU,SAAS,SAAU,MAAM,IAAI,OAAO,QAAQ;AACjE,aAAS,OAAO,WAAW,MAAM,CAAC;AAClC,QAAI,UAAU,SAAU,UAAU,OAAQ;AAExC,cAAQ,QAAQ,SAAU,OAAQ,SAAS,QAAS;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,oBAAoB,QAAQ;AACnC,MAAI,iBAAiB;AACrB,SAAO,eAAe,KAAK,MAAM;AACnC;AAEA,IAAI,cAAgB;AAApB,IACI,eAAgB;AADpB,IAEI,gBAAgB;AAFpB,IAGI,eAAgB;AAHpB,IAII,eAAgB;AASpB,SAAS,kBAAkB,QAAQ,gBAAgB,gBAAgB,WACjE,mBAAmB,aAAa,aAAa,SAAS;AAEtD,MAAI;AACJ,MAAI,OAAO;AACX,MAAI,WAAW;AACf,MAAI,eAAe;AACnB,MAAI,kBAAkB;AACtB,MAAI,mBAAmB,cAAc;AACrC,MAAI,oBAAoB;AACxB,MAAI,QAAQ,iBAAiB,YAAY,QAAQ,CAAC,CAAC,KACxC,gBAAgB,YAAY,QAAQ,OAAO,SAAS,CAAC,CAAC;AAEjE,MAAI,kBAAkB,aAAa;AAGjC,SAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AAC7D,aAAO,YAAY,QAAQ,CAAC;AAC5B,UAAI,CAAC,YAAY,IAAI,GAAG;AACtB,eAAO;AAAA,MACT;AACA,cAAQ,SAAS,YAAY,MAAM,UAAU,OAAO;AACpD,iBAAW;AAAA,IACb;AAAA,EACF,OAAO;AAEL,SAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AAC7D,aAAO,YAAY,QAAQ,CAAC;AAC5B,UAAI,SAAS,gBAAgB;AAC3B,uBAAe;AAEf,YAAI,kBAAkB;AACpB,4BAAkB;AAAA,UAEf,IAAI,oBAAoB,IAAI,aAC5B,OAAO,oBAAoB,CAAC,MAAM;AACrC,8BAAoB;AAAA,QACtB;AAAA,MACF,WAAW,CAAC,YAAY,IAAI,GAAG;AAC7B,eAAO;AAAA,MACT;AACA,cAAQ,SAAS,YAAY,MAAM,UAAU,OAAO;AACpD,iBAAW;AAAA,IACb;AAEA,sBAAkB,mBAAoB,qBACnC,IAAI,oBAAoB,IAAI,aAC5B,OAAO,oBAAoB,CAAC,MAAM;AAAA,EACvC;AAIA,MAAI,CAAC,gBAAgB,CAAC,iBAAiB;AAGrC,QAAI,SAAS,CAAC,eAAe,CAAC,kBAAkB,MAAM,GAAG;AACvD,aAAO;AAAA,IACT;AACA,WAAO,gBAAgB,sBAAsB,eAAe;AAAA,EAC9D;AAEA,MAAI,iBAAiB,KAAK,oBAAoB,MAAM,GAAG;AACrD,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,aAAa;AAChB,WAAO,kBAAkB,eAAe;AAAA,EAC1C;AACA,SAAO,gBAAgB,sBAAsB,eAAe;AAC9D;AAQA,SAAS,YAAY,OAAO,QAAQ,OAAO,OAAO,SAAS;AACzD,QAAM,QAAQ,WAAY;AACxB,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,MAAM,gBAAgB,sBAAsB,OAAO;AAAA,IAC5D;AACA,QAAI,CAAC,MAAM,cAAc;AACvB,UAAI,2BAA2B,QAAQ,MAAM,MAAM,MAAM,yBAAyB,KAAK,MAAM,GAAG;AAC9F,eAAO,MAAM,gBAAgB,sBAAuB,MAAM,SAAS,MAAQ,MAAM,SAAS;AAAA,MAC5F;AAAA,IACF;AAEA,QAAI,SAAS,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK;AAQ7C,QAAI,YAAY,MAAM,cAAc,KAChC,KAAK,KAAK,IAAI,KAAK,IAAI,MAAM,WAAW,EAAE,GAAG,MAAM,YAAY,MAAM;AAGzE,QAAI,iBAAiB,SAEf,MAAM,YAAY,MAAM,SAAS,MAAM;AAC7C,aAAS,cAAcC,SAAQ;AAC7B,aAAO,sBAAsB,OAAOA,OAAM;AAAA,IAC5C;AAEA,YAAQ;AAAA,MAAkB;AAAA,MAAQ;AAAA,MAAgB,MAAM;AAAA,MAAQ;AAAA,MAC9D;AAAA,MAAe,MAAM;AAAA,MAAa,MAAM,eAAe,CAAC;AAAA,MAAO;AAAA,IAAO,GAAG;AAAA,MAEzE,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO,MAAM,OAAO,QAAQ,MAAM,IAAI,IAAI;AAAA,MAC5C,KAAK;AACH,eAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,IACzC,kBAAkB,aAAa,QAAQ,MAAM,CAAC;AAAA,MACpD,KAAK;AACH,eAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,IACzC,kBAAkB,aAAa,WAAW,QAAQ,SAAS,GAAG,MAAM,CAAC;AAAA,MAC3E,KAAK;AACH,eAAO,MAAM,aAAa,MAAM,IAAI;AAAA,MACtC;AACE,cAAM,IAAI,UAAU,wCAAwC;AAAA,IAChE;AAAA,EACF,GAAE;AACJ;AAGA,SAAS,YAAY,QAAQ,gBAAgB;AAC3C,MAAI,kBAAkB,oBAAoB,MAAM,IAAI,OAAO,cAAc,IAAI;AAG7E,MAAI,OAAgB,OAAO,OAAO,SAAS,CAAC,MAAM;AAClD,MAAI,OAAO,SAAS,OAAO,OAAO,SAAS,CAAC,MAAM,QAAQ,WAAW;AACrE,MAAI,QAAQ,OAAO,MAAO,OAAO,KAAK;AAEtC,SAAO,kBAAkB,QAAQ;AACnC;AAGA,SAAS,kBAAkB,QAAQ;AACjC,SAAO,OAAO,OAAO,SAAS,CAAC,MAAM,OAAO,OAAO,MAAM,GAAG,EAAE,IAAI;AACpE;AAIA,SAAS,WAAW,QAAQ,OAAO;AAKjC,MAAI,SAAS;AAGb,MAAI,UAAU,WAAY;AACxB,QAAI,SAAS,OAAO,QAAQ,IAAI;AAChC,aAAS,WAAW,KAAK,SAAS,OAAO;AACzC,WAAO,YAAY;AACnB,WAAO,SAAS,OAAO,MAAM,GAAG,MAAM,GAAG,KAAK;AAAA,EAChD,GAAE;AAEF,MAAI,mBAAmB,OAAO,CAAC,MAAM,QAAQ,OAAO,CAAC,MAAM;AAC3D,MAAI;AAGJ,MAAIN;AACJ,SAAQA,SAAQ,OAAO,KAAK,MAAM,GAAI;AACpC,QAAI,SAASA,OAAM,CAAC,GAAG,OAAOA,OAAM,CAAC;AACrC,mBAAgB,KAAK,CAAC,MAAM;AAC5B,cAAU,UACL,CAAC,oBAAoB,CAAC,gBAAgB,SAAS,KAC9C,OAAO,MACT,SAAS,MAAM,KAAK;AACxB,uBAAmB;AAAA,EACrB;AAEA,SAAO;AACT;AAMA,SAAS,SAAS,MAAM,OAAO;AAC7B,MAAI,SAAS,MAAM,KAAK,CAAC,MAAM,IAAK,QAAO;AAG3C,MAAI,UAAU;AACd,MAAIA;AAEJ,MAAI,QAAQ,GAAG,KAAK,OAAO,GAAG,OAAO;AACrC,MAAI,SAAS;AAMb,SAAQA,SAAQ,QAAQ,KAAK,IAAI,GAAI;AACnC,WAAOA,OAAM;AAEb,QAAI,OAAO,QAAQ,OAAO;AACxB,YAAO,OAAO,QAAS,OAAO;AAC9B,gBAAU,OAAO,KAAK,MAAM,OAAO,GAAG;AAEtC,cAAQ,MAAM;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAIA,YAAU;AAEV,MAAI,KAAK,SAAS,QAAQ,SAAS,OAAO,OAAO;AAC/C,cAAU,KAAK,MAAM,OAAO,IAAI,IAAI,OAAO,KAAK,MAAM,OAAO,CAAC;AAAA,EAChE,OAAO;AACL,cAAU,KAAK,MAAM,KAAK;AAAA,EAC5B;AAEA,SAAO,OAAO,MAAM,CAAC;AACvB;AAGA,SAAS,aAAa,QAAQ;AAC5B,MAAI,SAAS;AACb,MAAI,OAAO;AACX,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,QAAQ,QAAU,KAAK,IAAI,KAAK;AACjE,WAAO,YAAY,QAAQ,CAAC;AAC5B,gBAAY,iBAAiB,IAAI;AAEjC,QAAI,CAAC,aAAa,YAAY,IAAI,GAAG;AACnC,gBAAU,OAAO,CAAC;AAClB,UAAI,QAAQ,MAAS,WAAU,OAAO,IAAI,CAAC;AAAA,IAC7C,OAAO;AACL,gBAAU,aAAa,UAAU,IAAI;AAAA,IACvC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAO,OAAO,QAAQ;AAC/C,MAAI,UAAU,IACV,OAAU,MAAM,KAChB,OACA,QACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,YAAQ,OAAO,KAAK;AAEpB,QAAI,MAAM,UAAU;AAClB,cAAQ,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,GAAG,KAAK;AAAA,IAC1D;AAGA,QAAI,UAAU,OAAO,OAAO,OAAO,OAAO,KAAK,KAC1C,OAAO,UAAU,eACjB,UAAU,OAAO,OAAO,MAAM,OAAO,KAAK,GAAI;AAEjD,UAAI,YAAY,GAAI,YAAW,OAAO,CAAC,MAAM,eAAe,MAAM;AAClE,iBAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,MAAM,UAAU;AAC/B;AAEA,SAAS,mBAAmB,OAAO,OAAO,QAAQ,SAAS;AACzD,MAAI,UAAU,IACV,OAAU,MAAM,KAChB,OACA,QACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,YAAQ,OAAO,KAAK;AAEpB,QAAI,MAAM,UAAU;AAClB,cAAQ,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,GAAG,KAAK;AAAA,IAC1D;AAGA,QAAI,UAAU,OAAO,QAAQ,GAAG,OAAO,MAAM,MAAM,OAAO,IAAI,KACzD,OAAO,UAAU,eACjB,UAAU,OAAO,QAAQ,GAAG,MAAM,MAAM,MAAM,OAAO,IAAI,GAAI;AAEhE,UAAI,CAAC,WAAW,YAAY,IAAI;AAC9B,mBAAW,iBAAiB,OAAO,KAAK;AAAA,MAC1C;AAEA,UAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,mBAAW;AAAA,MACb,OAAO;AACL,mBAAW;AAAA,MACb;AAEA,iBAAW,MAAM;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,WAAW;AAC1B;AAEA,SAAS,iBAAiB,OAAO,OAAO,QAAQ;AAC9C,MAAI,UAAgB,IAChB,OAAgB,MAAM,KACtB,gBAAgB,OAAO,KAAK,MAAM,GAClC,OACA,QACA,WACA,aACA;AAEJ,OAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAEzE,iBAAa;AACb,QAAI,YAAY,GAAI,eAAc;AAElC,QAAI,MAAM,aAAc,eAAc;AAEtC,gBAAY,cAAc,KAAK;AAC/B,kBAAc,OAAO,SAAS;AAE9B,QAAI,MAAM,UAAU;AAClB,oBAAc,MAAM,SAAS,KAAK,QAAQ,WAAW,WAAW;AAAA,IAClE;AAEA,QAAI,CAAC,UAAU,OAAO,OAAO,WAAW,OAAO,KAAK,GAAG;AACrD;AAAA,IACF;AAEA,QAAI,MAAM,KAAK,SAAS,KAAM,eAAc;AAE5C,kBAAc,MAAM,QAAQ,MAAM,eAAe,MAAM,MAAM,OAAO,MAAM,eAAe,KAAK;AAE9F,QAAI,CAAC,UAAU,OAAO,OAAO,aAAa,OAAO,KAAK,GAAG;AACvD;AAAA,IACF;AAEA,kBAAc,MAAM;AAGpB,eAAW;AAAA,EACb;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,MAAM,UAAU;AAC/B;AAEA,SAAS,kBAAkB,OAAO,OAAO,QAAQ,SAAS;AACxD,MAAI,UAAgB,IAChB,OAAgB,MAAM,KACtB,gBAAgB,OAAO,KAAK,MAAM,GAClC,OACA,QACA,WACA,aACA,cACA;AAGJ,MAAI,MAAM,aAAa,MAAM;AAE3B,kBAAc,KAAK;AAAA,EACrB,WAAW,OAAO,MAAM,aAAa,YAAY;AAE/C,kBAAc,KAAK,MAAM,QAAQ;AAAA,EACnC,WAAW,MAAM,UAAU;AAEzB,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAChE;AAEA,OAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,iBAAa;AAEb,QAAI,CAAC,WAAW,YAAY,IAAI;AAC9B,oBAAc,iBAAiB,OAAO,KAAK;AAAA,IAC7C;AAEA,gBAAY,cAAc,KAAK;AAC/B,kBAAc,OAAO,SAAS;AAE9B,QAAI,MAAM,UAAU;AAClB,oBAAc,MAAM,SAAS,KAAK,QAAQ,WAAW,WAAW;AAAA,IAClE;AAEA,QAAI,CAAC,UAAU,OAAO,QAAQ,GAAG,WAAW,MAAM,MAAM,IAAI,GAAG;AAC7D;AAAA,IACF;AAEA,mBAAgB,MAAM,QAAQ,QAAQ,MAAM,QAAQ,OACpC,MAAM,QAAQ,MAAM,KAAK,SAAS;AAElD,QAAI,cAAc;AAChB,UAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,sBAAc;AAAA,MAChB,OAAO;AACL,sBAAc;AAAA,MAChB;AAAA,IACF;AAEA,kBAAc,MAAM;AAEpB,QAAI,cAAc;AAChB,oBAAc,iBAAiB,OAAO,KAAK;AAAA,IAC7C;AAEA,QAAI,CAAC,UAAU,OAAO,QAAQ,GAAG,aAAa,MAAM,YAAY,GAAG;AACjE;AAAA,IACF;AAEA,QAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,WAAW,CAAC,GAAG;AAC7D,oBAAc;AAAA,IAChB,OAAO;AACL,oBAAc;AAAA,IAChB;AAEA,kBAAc,MAAM;AAGpB,eAAW;AAAA,EACb;AAEA,QAAM,MAAM;AACZ,QAAM,OAAO,WAAW;AAC1B;AAEA,SAAS,WAAW,OAAO,QAAQ,UAAU;AAC3C,MAAI,SAAS,UAAU,OAAO,QAAQG,OAAM;AAE5C,aAAW,WAAW,MAAM,gBAAgB,MAAM;AAElD,OAAK,QAAQ,GAAG,SAAS,SAAS,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACpE,IAAAA,QAAO,SAAS,KAAK;AAErB,SAAKA,MAAK,cAAeA,MAAK,eACzB,CAACA,MAAK,cAAgB,OAAO,WAAW,YAAc,kBAAkBA,MAAK,gBAC7E,CAACA,MAAK,aAAcA,MAAK,UAAU,MAAM,IAAI;AAEhD,UAAI,UAAU;AACZ,YAAIA,MAAK,SAASA,MAAK,eAAe;AACpC,gBAAM,MAAMA,MAAK,cAAc,MAAM;AAAA,QACvC,OAAO;AACL,gBAAM,MAAMA,MAAK;AAAA,QACnB;AAAA,MACF,OAAO;AACL,cAAM,MAAM;AAAA,MACd;AAEA,UAAIA,MAAK,WAAW;AAClB,gBAAQ,MAAM,SAASA,MAAK,GAAG,KAAKA,MAAK;AAEzC,YAAI,UAAU,KAAKA,MAAK,SAAS,MAAM,qBAAqB;AAC1D,oBAAUA,MAAK,UAAU,QAAQ,KAAK;AAAA,QACxC,WAAW,gBAAgB,KAAKA,MAAK,WAAW,KAAK,GAAG;AACtD,oBAAUA,MAAK,UAAU,KAAK,EAAE,QAAQ,KAAK;AAAA,QAC/C,OAAO;AACL,gBAAM,IAAI,UAAU,OAAOA,MAAK,MAAM,iCAAiC,QAAQ,SAAS;AAAA,QAC1F;AAEA,cAAM,OAAO;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,UAAU,OAAO,OAAO,QAAQ,OAAO,SAAS,OAAO,YAAY;AAC1E,QAAM,MAAM;AACZ,QAAM,OAAO;AAEb,MAAI,CAAC,WAAW,OAAO,QAAQ,KAAK,GAAG;AACrC,eAAW,OAAO,QAAQ,IAAI;AAAA,EAChC;AAEA,MAAIA,QAAO,UAAU,KAAK,MAAM,IAAI;AACpC,MAAI,UAAU;AACd,MAAI;AAEJ,MAAI,OAAO;AACT,YAAS,MAAM,YAAY,KAAK,MAAM,YAAY;AAAA,EACpD;AAEA,MAAI,gBAAgBA,UAAS,qBAAqBA,UAAS,kBACvD,gBACA;AAEJ,MAAI,eAAe;AACjB,qBAAiB,MAAM,WAAW,QAAQ,MAAM;AAChD,gBAAY,mBAAmB;AAAA,EACjC;AAEA,MAAK,MAAM,QAAQ,QAAQ,MAAM,QAAQ,OAAQ,aAAc,MAAM,WAAW,KAAK,QAAQ,GAAI;AAC/F,cAAU;AAAA,EACZ;AAEA,MAAI,aAAa,MAAM,eAAe,cAAc,GAAG;AACrD,UAAM,OAAO,UAAU;AAAA,EACzB,OAAO;AACL,QAAI,iBAAiB,aAAa,CAAC,MAAM,eAAe,cAAc,GAAG;AACvE,YAAM,eAAe,cAAc,IAAI;AAAA,IACzC;AACA,QAAIA,UAAS,mBAAmB;AAC9B,UAAI,SAAU,OAAO,KAAK,MAAM,IAAI,EAAE,WAAW,GAAI;AACnD,0BAAkB,OAAO,OAAO,MAAM,MAAM,OAAO;AACnD,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM;AAAA,QAChD;AAAA,MACF,OAAO;AACL,yBAAiB,OAAO,OAAO,MAAM,IAAI;AACzC,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM,MAAM;AAAA,QACtD;AAAA,MACF;AAAA,IACF,WAAWA,UAAS,kBAAkB;AACpC,UAAI,SAAU,MAAM,KAAK,WAAW,GAAI;AACtC,YAAI,MAAM,iBAAiB,CAAC,cAAc,QAAQ,GAAG;AACnD,6BAAmB,OAAO,QAAQ,GAAG,MAAM,MAAM,OAAO;AAAA,QAC1D,OAAO;AACL,6BAAmB,OAAO,OAAO,MAAM,MAAM,OAAO;AAAA,QACtD;AACA,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM;AAAA,QAChD;AAAA,MACF,OAAO;AACL,0BAAkB,OAAO,OAAO,MAAM,IAAI;AAC1C,YAAI,WAAW;AACb,gBAAM,OAAO,UAAU,iBAAiB,MAAM,MAAM;AAAA,QACtD;AAAA,MACF;AAAA,IACF,WAAWA,UAAS,mBAAmB;AACrC,UAAI,MAAM,QAAQ,KAAK;AACrB,oBAAY,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;AAAA,MACtD;AAAA,IACF,WAAWA,UAAS,sBAAsB;AACxC,aAAO;AAAA,IACT,OAAO;AACL,UAAI,MAAM,YAAa,QAAO;AAC9B,YAAM,IAAI,UAAU,4CAA4CA,KAAI;AAAA,IACtE;AAEA,QAAI,MAAM,QAAQ,QAAQ,MAAM,QAAQ,KAAK;AAc3C,eAAS;AAAA,QACP,MAAM,IAAI,CAAC,MAAM,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,MAAM;AAAA,MACpD,EAAE,QAAQ,MAAM,KAAK;AAErB,UAAI,MAAM,IAAI,CAAC,MAAM,KAAK;AACxB,iBAAS,MAAM;AAAA,MACjB,WAAW,OAAO,MAAM,GAAG,EAAE,MAAM,sBAAsB;AACvD,iBAAS,OAAO,OAAO,MAAM,EAAE;AAAA,MACjC,OAAO;AACL,iBAAS,OAAO,SAAS;AAAA,MAC3B;AAEA,YAAM,OAAO,SAAS,MAAM,MAAM;AAAA,IACpC;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAAQ,OAAO;AAC7C,MAAI,UAAU,CAAC,GACX,oBAAoB,CAAC,GACrB,OACA;AAEJ,cAAY,QAAQ,SAAS,iBAAiB;AAE9C,OAAK,QAAQ,GAAG,SAAS,kBAAkB,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAC7E,UAAM,WAAW,KAAK,QAAQ,kBAAkB,KAAK,CAAC,CAAC;AAAA,EACzD;AACA,QAAM,iBAAiB,IAAI,MAAM,MAAM;AACzC;AAEA,SAAS,YAAY,QAAQ,SAAS,mBAAmB;AACvD,MAAI,eACA,OACA;AAEJ,MAAI,WAAW,QAAQ,OAAO,WAAW,UAAU;AACjD,YAAQ,QAAQ,QAAQ,MAAM;AAC9B,QAAI,UAAU,IAAI;AAChB,UAAI,kBAAkB,QAAQ,KAAK,MAAM,IAAI;AAC3C,0BAAkB,KAAK,KAAK;AAAA,MAC9B;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,MAAM;AAEnB,UAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,aAAK,QAAQ,GAAG,SAAS,OAAO,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AAClE,sBAAY,OAAO,KAAK,GAAG,SAAS,iBAAiB;AAAA,QACvD;AAAA,MACF,OAAO;AACL,wBAAgB,OAAO,KAAK,MAAM;AAElC,aAAK,QAAQ,GAAG,SAAS,cAAc,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACzE,sBAAY,OAAO,cAAc,KAAK,CAAC,GAAG,SAAS,iBAAiB;AAAA,QACtE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,OAAO,OAAO,SAAS;AAC9B,YAAU,WAAW,CAAC;AAEtB,MAAI,QAAQ,IAAI,MAAM,OAAO;AAE7B,MAAI,CAAC,MAAM,OAAQ,wBAAuB,OAAO,KAAK;AAEtD,MAAI,QAAQ;AAEZ,MAAI,MAAM,UAAU;AAClB,YAAQ,MAAM,SAAS,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,KAAK;AAAA,EACtD;AAEA,MAAI,UAAU,OAAO,GAAG,OAAO,MAAM,IAAI,EAAG,QAAO,MAAM,OAAO;AAEhE,SAAO;AACT;AAEA,IAAI,SAAS;AAEb,IAAI,SAAS;AAAA,EACZ,MAAM;AACP;AAEA,SAAS,QAAQ,MAAM,IAAI;AACzB,SAAO,WAAY;AACjB,UAAM,IAAI,MAAM,mBAAmB,OAAO,wCAC1B,KAAK,yCAAyC;AAAA,EAChE;AACF;AASA,IAAI,OAAsB,OAAO;AACjC,IAAI,UAAsB,OAAO;AACjC,IAAI,OAAsB,OAAO;AAqBjC,IAAI,WAAsB,QAAQ,YAAY,MAAM;AACpD,IAAI,cAAsB,QAAQ,eAAe,SAAS;AAC1D,IAAI,WAAsB,QAAQ,YAAY,MAAM;;;AC5vH7C,IAAM,WAAW,CACtB,GACA,GACAI,SACE;AACF,QAAM,KAAK,aAAa,SAAS,WAAW,GAAGA,IAAG,IAAI;AACtD,QAAM,KAAK,aAAa,SAAS,WAAW,GAAGA,IAAG,IAAI;AAEtD,QAAM,IAAI,OAAO,QAAQ,MAAM,QAAQ,MAAM,IAAI,IAAIA,IAAG;AAExD,SACE,KAAK;IACH,OAAO,EAAE,CAAC;IACV,KAAK,EAAE,CAAC;IACR,KAAKA,KAAI,MAAM,GAAG,EAAE,CAAC,CAAC;IACtB,MAAMA,KAAI,MAAM,EAAE,CAAC,IAAI,GAAG,QAAQ,EAAE,CAAC,CAAC;IACtC,MAAMA,KAAI,MAAM,EAAE,CAAC,IAAI,GAAG,MAAM;;AAGtC;AAEA,IAAM,aAAa,CAAC,KAAaA,SAAe;AAC9C,QAAM,IAAIA,KAAI,MAAM,GAAG;AACvB,SAAO,IAAI,EAAE,CAAC,IAAI;AACpB;AAEO,IAAM,QAAQ,CACnB,GACA,GACAA,SACgC;AAChC,MAAI,MACF,KACA,MACA,QAA4B,QAC5B;AACF,MAAIC,MAAKD,KAAI,QAAQ,CAAC;AACtB,MAAIE,MAAKF,KAAI,QAAQ,GAAGC,MAAK,CAAC;AAC9B,MAAI,IAAIA;AAER,MAAIA,OAAM,KAAKC,MAAK,GAAG;AACrB,QAAI,MAAM,GAAG;AACX,aAAO,CAACD,KAAIC,GAAE;IAChB;AACA,WAAO,CAAA;AACP,WAAOF,KAAI;AAEX,WAAO,KAAK,KAAK,CAAC,QAAQ;AACxB,UAAI,MAAMC,KAAI;AACZ,aAAK,KAAK,CAAC;AACX,QAAAA,MAAKD,KAAI,QAAQ,GAAG,IAAI,CAAC;MAC3B,WAAW,KAAK,WAAW,GAAG;AAC5B,cAAM,IAAI,KAAK,IAAG;AAClB,YAAI,MAAM;AAAW,mBAAS,CAAC,GAAGE,GAAE;MACtC,OAAO;AACL,cAAM,KAAK,IAAG;AACd,YAAI,QAAQ,UAAa,MAAM,MAAM;AACnC,iBAAO;AACP,kBAAQA;QACV;AAEA,QAAAA,MAAKF,KAAI,QAAQ,GAAG,IAAI,CAAC;MAC3B;AAEA,UAAIC,MAAKC,OAAMD,OAAM,IAAIA,MAAKC;IAChC;AAEA,QAAI,KAAK,UAAU,UAAU,QAAW;AACtC,eAAS,CAAC,MAAM,KAAK;IACvB;EACF;AAEA,SAAO;AACT;;;ACvEA,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,UAAU,WAAW,KAAK,OAAM,IAAK;AAC3C,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,WAAW,YAAY,KAAK,OAAM,IAAK;AAC7C,IAAM,YAAY,aAAa,KAAK,OAAM,IAAK;AAC/C,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,iBAAiB,IAAI,OAAO,SAAS,GAAG;AAC9C,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,kBAAkB,IAAI,OAAO,UAAU,GAAG;AAChD,IAAM,mBAAmB,IAAI,OAAO,WAAW,GAAG;AAClD,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,eAAe;AACrB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AAEf,IAAM,gBAAgB;AAE7B,SAAS,QAAQC,MAAW;AAC1B,SAAO,CAAC,MAAMA,IAAU,IAAI,SAASA,MAAK,EAAE,IAAIA,KAAI,WAAW,CAAC;AAClE;AAEA,SAAS,aAAaA,MAAW;AAC/B,SAAOA,KACJ,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,aAAa,OAAO,EAC5B,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,cAAc,QAAQ,EAC9B,QAAQ,eAAe,SAAS;AACrC;AAEA,SAAS,eAAeA,MAAW;AACjC,SAAOA,KACJ,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,iBAAiB,GAAG,EAC5B,QAAQ,iBAAiB,GAAG,EAC5B,QAAQ,kBAAkB,GAAG;AAClC;AAOA,SAAS,gBAAgBA,MAAW;AAClC,MAAI,CAACA,MAAK;AACR,WAAO,CAAC,EAAE;EACZ;AAEA,QAAM,QAAkB,CAAA;AACxB,QAAM,IAAI,SAAS,KAAK,KAAKA,IAAG;AAEhC,MAAI,CAAC,GAAG;AACN,WAAOA,KAAI,MAAM,GAAG;EACtB;AAEA,QAAM,EAAE,KAAK,MAAM,KAAI,IAAK;AAC5B,QAAM,IAAI,IAAI,MAAM,GAAG;AAEvB,IAAE,EAAE,SAAS,CAAC,KAAK,MAAM,OAAO;AAChC,QAAM,YAAY,gBAAgB,IAAI;AACtC,MAAI,KAAK,QAAQ;AACf;AAAE,MAAE,EAAE,SAAS,CAAC,KAAgB,UAAU,MAAK;AAC/C,MAAE,KAAK,MAAM,GAAG,SAAS;EAC3B;AAEA,QAAM,KAAK,MAAM,OAAO,CAAC;AAEzB,SAAO;AACT;AAMM,SAAU,OAAOA,MAAa,UAAiC,CAAA,GAAE;AACrE,MAAI,CAACA,MAAK;AACR,WAAO,CAAA;EACT;AAEA,QAAM,EAAE,MAAM,cAAa,IAAK;AAQhC,MAAIA,KAAI,MAAM,GAAG,CAAC,MAAM,MAAM;AAC5B,IAAAA,OAAM,WAAWA,KAAI,MAAM,CAAC;EAC9B;AAEA,SAAO,QAAQ,aAAaA,IAAG,GAAG,KAAK,IAAI,EAAE,IAAI,cAAc;AACjE;AAEA,SAAS,QAAQA,MAAW;AAC1B,SAAO,MAAMA,OAAM;AACrB;AAEA,SAAS,SAAS,IAAU;AAC1B,SAAO,SAAS,KAAK,EAAE;AACzB;AAEA,SAAS,IAAI,GAAW,GAAS;AAC/B,SAAO,KAAK;AACd;AAEA,SAAS,IAAI,GAAW,GAAS;AAC/B,SAAO,KAAK;AACd;AAEA,SAAS,QAAQA,MAAa,KAAa,OAAc;AAEvD,QAAM,aAAuB,CAAA;AAE7B,QAAM,IAAI,SAAS,KAAK,KAAKA,IAAG;AAChC,MAAI,CAAC;AAAG,WAAO,CAACA,IAAG;AAGnB,QAAM,MAAM,EAAE;AACd,QAAM,OAAiB,EAAE,KAAK,SAAS,QAAQ,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC,EAAE;AAExE,MAAI,MAAM,KAAK,EAAE,GAAG,GAAG;AACrB,aAASC,KAAI,GAAGA,KAAI,KAAK,UAAUA,KAAI,KAAKA,MAAK;AAC/C,YAAM,YAAY,MAAM,MAAM,EAAE,OAAO,MAAM,KAAKA,EAAC;AACnD,iBAAW,KAAK,SAAS;IAC3B;EACF,OAAO;AACL,UAAM,oBAAoB,iCAAiC,KAAK,EAAE,IAAI;AACtE,UAAM,kBAAkB,uCAAuC,KAC7D,EAAE,IAAI;AAER,UAAM,aAAa,qBAAqB;AACxC,UAAM,YAAY,EAAE,KAAK,QAAQ,GAAG,KAAK;AACzC,QAAI,CAAC,cAAc,CAAC,WAAW;AAE7B,UAAI,EAAE,KAAK,MAAM,YAAY,GAAG;AAC9B,QAAAD,OAAM,EAAE,MAAM,MAAM,EAAE,OAAO,WAAW,EAAE;AAC1C,eAAO,QAAQA,MAAK,KAAK,IAAI;MAC/B;AACA,aAAO,CAACA,IAAG;IACb;AAEA,QAAIE;AACJ,QAAI,YAAY;AACd,MAAAA,KAAI,EAAE,KAAK,MAAM,MAAM;IACzB,OAAO;AACL,MAAAA,KAAI,gBAAgB,EAAE,IAAI;AAC1B,UAAIA,GAAE,WAAW,KAAKA,GAAE,CAAC,MAAM,QAAW;AAExC,QAAAA,KAAI,QAAQA,GAAE,CAAC,GAAG,KAAK,KAAK,EAAE,IAAI,OAAO;AAGzC,YAAIA,GAAE,WAAW,GAAG;AAClB,iBAAO,KAAK,IAAI,OAAK,EAAE,MAAMA,GAAE,CAAC,IAAI,CAAC;QACvC;MAEF;IACF;AAIA,QAAIC;AAEJ,QAAI,cAAcD,GAAE,CAAC,MAAM,UAAaA,GAAE,CAAC,MAAM,QAAW;AAC1D,YAAME,KAAI,QAAQF,GAAE,CAAC,CAAC;AACtB,YAAM,IAAI,QAAQA,GAAE,CAAC,CAAC;AACtB,YAAM,QAAQ,KAAK,IAAIA,GAAE,CAAC,EAAE,QAAQA,GAAE,CAAC,EAAE,MAAM;AAC/C,UAAI,OACFA,GAAE,WAAW,KAAKA,GAAE,CAAC,MAAM,SACzB,KAAK,IAAI,KAAK,IAAI,QAAQA,GAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IACnC;AACJ,UAAI,OAAO;AACX,YAAM,UAAU,IAAIE;AACpB,UAAI,SAAS;AACX,gBAAQ;AACR,eAAO;MACT;AACA,YAAM,MAAMF,GAAE,KAAK,QAAQ;AAE3B,MAAAC,KAAI,CAAA;AAEJ,eAAS,IAAIC,IAAG,KAAK,GAAG,CAAC,GAAG,KAAK,MAAM;AACrC,YAAI;AACJ,YAAI,iBAAiB;AACnB,cAAI,OAAO,aAAa,CAAC;AACzB,cAAI,MAAM,MAAM;AACd,gBAAI;UACN;QACF,OAAO;AACL,cAAI,OAAO,CAAC;AACZ,cAAI,KAAK;AACP,kBAAM,OAAO,QAAQ,EAAE;AACvB,gBAAI,OAAO,GAAG;AACZ,oBAAM,IAAI,IAAI,MAAM,OAAO,CAAC,EAAE,KAAK,GAAG;AACtC,kBAAI,IAAI,GAAG;AACT,oBAAI,MAAM,IAAI,EAAE,MAAM,CAAC;cACzB,OAAO;AACL,oBAAI,IAAI;cACV;YACF;UACF;QACF;AACA,QAAAD,GAAE,KAAK,CAAC;MACV;IACF,OAAO;AACL,MAAAA,KAAI,CAAA;AAEJ,eAASE,KAAI,GAAGA,KAAIH,GAAE,QAAQG,MAAK;AACjC,QAAAF,GAAE,KAAK,MAAMA,IAAG,QAAQD,GAAEG,EAAC,GAAa,KAAK,KAAK,CAAC;MACrD;IACF;AAEA,aAASA,KAAI,GAAGA,KAAIF,GAAE,QAAQE,MAAK;AACjC,eAASJ,KAAI,GAAGA,KAAI,KAAK,UAAU,WAAW,SAAS,KAAKA,MAAK;AAC/D,cAAM,YAAY,MAAME,GAAEE,EAAC,IAAI,KAAKJ,EAAC;AACrC,YAAI,CAAC,SAAS,cAAc,WAAW;AACrC,qBAAW,KAAK,SAAS;QAC3B;MACF;IACF;EACF;AAEA,SAAO;AACT;;;ACnOA,IAAM,qBAAqB,OAAO;AAC3B,IAAM,qBAAiD,CAC5D,YAC6B;AAC7B,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,IAAI,UAAU,iBAAiB;EACvC;AAEA,MAAI,QAAQ,SAAS,oBAAoB;AACvC,UAAM,IAAI,UAAU,qBAAqB;EAC3C;AACF;;;ACPA,IAAM,eACJ;EACE,aAAa,CAAC,wBAAwB,IAAI;EAC1C,aAAa,CAAC,iBAAiB,IAAI;EACnC,aAAa,CAAC,eAAyB,KAAK;EAC5C,aAAa,CAAC,cAAc,IAAI;EAChC,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,gBAAgB,MAAM,IAAI;EACxC,aAAa,CAAC,WAAW,IAAI;EAC7B,aAAa,CAAC,UAAU,IAAI;EAC5B,aAAa,CAAC,UAAU,IAAI;EAC5B,aAAa,CAAC,yBAAyB,IAAI;EAC3C,aAAa,CAAC,WAAW,IAAI;EAC7B,YAAY,CAAC,+BAA+B,IAAI;EAChD,cAAc,CAAC,aAAa,KAAK;;AAKrC,IAAM,cAAc,CAAC,MAAc,EAAE,QAAQ,aAAa,MAAM;AAEhE,IAAM,eAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAG9C,IAAM,iBAAiB,CAAC,WAA6B,OAAO,KAAK,EAAE;AAe5D,IAAM,aAAa,CACxB,MACA,aACoB;AACpB,QAAM,MAAM;AAEZ,MAAI,KAAK,OAAO,GAAG,MAAM,KAAK;AAC5B,UAAM,IAAI,MAAM,2BAA2B;EAC7C;AAEA,QAAM,SAAmB,CAAA;AACzB,QAAM,OAAiB,CAAA;AAEvB,MAAI,IAAI,MAAM;AACd,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,aAAa;AACjB,QAAO,QAAO,IAAI,KAAK,QAAQ;AAC7B,UAAM,IAAI,KAAK,OAAO,CAAC;AACvB,SAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM,GAAG;AAC7C,eAAS;AACT;AACA;IACF;AAEA,QAAI,MAAM,OAAO,YAAY,CAAC,UAAU;AACtC,eAAS,IAAI;AACb;IACF;AAEA,eAAW;AACX,QAAI,MAAM,MAAM;AACd,UAAI,CAAC,UAAU;AACb,mBAAW;AACX;AACA;MACF;IAEF;AACA,QAAI,MAAM,OAAO,CAAC,UAAU;AAE1B,iBAAW,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,OAAO,QAAQ,YAAY,GAAG;AAChE,YAAI,KAAK,WAAW,KAAK,CAAC,GAAG;AAE3B,cAAI,YAAY;AACd,mBAAO,CAAC,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI;UAC9C;AACA,eAAK,IAAI;AACT,cAAI;AAAK,iBAAK,KAAK,IAAI;;AAClB,mBAAO,KAAK,IAAI;AACrB,kBAAQ,SAAS;AACjB,mBAAS;QACX;MACF;IACF;AAGA,eAAW;AACX,QAAI,YAAY;AAGd,UAAI,IAAI,YAAY;AAClB,eAAO,KAAK,YAAY,UAAU,IAAI,MAAM,YAAY,CAAC,CAAC;MAC5D,WAAW,MAAM,YAAY;AAC3B,eAAO,KAAK,YAAY,CAAC,CAAC;MAC5B;AACA,mBAAa;AACb;AACA;IACF;AAIA,QAAI,KAAK,WAAW,MAAM,IAAI,CAAC,GAAG;AAChC,aAAO,KAAK,YAAY,IAAI,GAAG,CAAC;AAChC,WAAK;AACL;IACF;AACA,QAAI,KAAK,WAAW,KAAK,IAAI,CAAC,GAAG;AAC/B,mBAAa;AACb,WAAK;AACL;IACF;AAGA,WAAO,KAAK,YAAY,CAAC,CAAC;AAC1B;EACF;AAEA,MAAI,SAAS,GAAG;AAGd,WAAO,CAAC,IAAI,OAAO,GAAG,KAAK;EAC7B;AAIA,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,QAAQ;AAClC,WAAO,CAAC,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI;EAC9C;AAMA,MACE,KAAK,WAAW,KAChB,OAAO,WAAW,KAClB,SAAS,KAAK,OAAO,CAAC,CAAC,KACvB,CAAC,QACD;AACA,UAAM,IAAI,OAAO,CAAC,EAAE,WAAW,IAAI,OAAO,CAAC,EAAE,MAAM,EAAE,IAAI,OAAO,CAAC;AACjE,WAAO,CAAC,aAAa,CAAC,GAAG,OAAO,SAAS,KAAK,KAAK;EACrD;AAEA,QAAM,UAAU,OAAO,SAAS,MAAM,MAAM,eAAe,MAAM,IAAI;AACrE,QAAM,QAAQ,OAAO,SAAS,KAAK,OAAO,eAAe,IAAI,IAAI;AACjE,QAAM,OACJ,OAAO,UAAU,KAAK,SAAS,MAAM,UAAU,MAAM,QAAQ,MAC3D,OAAO,SAAS,UAChB;AAEJ,SAAO,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI;AACzC;;;ACrJO,IAAM,WAAW,CACtB,GACA,EACE,uBAAuB,OACvB,gBAAgB,KAAI,IACgD,CAAA,MACpE;AACF,MAAI,eAAe;AACjB,WAAO,uBACH,EAAE,QAAQ,kBAAkB,IAAI,IAChC,EACG,QAAQ,6BAA6B,MAAM,EAC3C,QAAQ,cAAc,IAAI;EACnC;AACA,SAAO,uBACH,EAAE,QAAQ,oBAAoB,IAAI,IAClC,EACG,QAAQ,+BAA+B,MAAM,EAC7C,QAAQ,gBAAgB,IAAI;AACrC;;;;ACGA,IAAM,QAAQ,oBAAI,IAAiB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AAC5D,IAAM,gBAAgB,CAAC,MACrB,MAAM,IAAI,CAAgB;AAC5B,IAAM,eAAe,CAAC,MACpB,cAAc,EAAE,IAAI;AAiDtB,IAAM,cAAc,oBAAI,IAAgC;EACtD,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;EAC1B,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;CACjB;AAID,IAAM,uBAAuB,oBAAI,IAAgC;EAC/D,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,GAAG,CAAC;EACX,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;CACjB;AAGD,IAAM,iBAAiB,oBAAI,IAAgC;EACzD,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;EAChB,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;EAC1B,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;CAC3B;AAMD,IAAM,WAAW,oBAAI,IAA8D;EACjF,CAAC,KAAK,oBAAI,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;EAC3B;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;EAEH;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;EAEH;IACE;IACA,oBAAI,IAAI;MACN,CAAC,KAAK,GAAG;MACT,CAAC,KAAK,GAAG;KACV;;CAEJ;AAMD,IAAM,mBAAmB;AACzB,IAAM,aAAa;AAKnB,IAAM,kBAAkB,oBAAI,IAAI,CAAC,KAAK,GAAG,CAAC;AAE1C,IAAM,WAAW,oBAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AACpC,IAAM,aAAa,IAAI,IAAI,iBAAiB;AAC5C,IAAM,eAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAG9C,IAAM,QAAQ;AAGd,IAAM,OAAO,QAAQ;AAGrB,IAAM,cAAc,QAAQ;AAK5B,IAAI,KAAK;AACH,IAAO,MAAP,MAAU;EACd;EACS;EAET;EACA,SAAkB;EAClB,SAA2B,CAAA;EAC3B;EACA;EACA;EACA,cAAuB;EACvB;EACA;;;EAGA,YAAqB;EACrB,KAAK,EAAE;EAEP,IAAI,QAAK;AACP,YAAQ,KAAK,SAAS,SAAS,MAAM;EACvC;EAEA,CAAC,uBAAO,IAAI,4BAA4B,CAAC,IAAC;AACxC,WAAO;MACL,UAAU;MACV,IAAI,KAAK;MACT,MAAM,KAAK;MACX,MAAM,KAAK,MAAM;MACjB,QAAQ,KAAK,SAAS;MACtB,OAAO,KAAK;MACZ,aAAa,KAAK,OAAO;MACzB,OAAO,KAAK;;EAEhB;EAEA,YACEK,OACA,QACA,UAA4B,CAAA,GAAE;AAE9B,SAAK,OAAOA;AAEZ,QAAIA;AAAM,WAAK,YAAY;AAC3B,SAAK,UAAU;AACf,SAAK,QAAQ,KAAK,UAAU,KAAK,QAAQ,QAAQ;AACjD,SAAK,WAAW,KAAK,UAAU,OAAO,UAAU,KAAK,MAAM;AAC3D,SAAK,QAAQ,KAAK,UAAU,OAAO,CAAA,IAAK,KAAK,MAAM;AACnD,QAAIA,UAAS,OAAO,CAAC,KAAK,MAAM;AAAa,WAAK,MAAM,KAAK,IAAI;AACjE,SAAK,eAAe,KAAK,UAAU,KAAK,QAAQ,OAAO,SAAS;EAClE;EAEA,IAAI,WAAQ;AAEV,QAAI,KAAK,cAAc;AAAW,aAAO,KAAK;AAE9C,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,OAAO,MAAM;AAAU;AAC3B,UAAI,EAAE,QAAQ,EAAE;AAAU,eAAQ,KAAK,YAAY;IACrD;AAEA,WAAO,KAAK;EACd;;EAGA,WAAQ;AACN,QAAI,KAAK,cAAc;AAAW,aAAO,KAAK;AAC9C,QAAI,CAAC,KAAK,MAAM;AACd,aAAQ,KAAK,YAAY,KAAK,OAAO,IAAI,OAAK,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;IAClE,OAAO;AACL,aAAQ,KAAK,YACX,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,OAAK,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAClE;EACF;EAEA,YAAS;AAEP,QAAI,SAAS,KAAK;AAAO,YAAM,IAAI,MAAM,0BAA0B;AACnE,QAAI,KAAK;AAAa,aAAO;AAI7B,SAAK,SAAQ;AACb,SAAK,cAAc;AACnB,QAAIC;AACJ,WAAQA,KAAI,KAAK,MAAM,IAAG,GAAK;AAC7B,UAAIA,GAAE,SAAS;AAAK;AAEpB,UAAI,IAAqBA;AACzB,UAAI,KAAK,EAAE;AACX,aAAO,IAAI;AACT,iBACM,IAAI,EAAE,eAAe,GACzB,CAAC,GAAG,QAAQ,IAAI,GAAG,OAAO,QAC1B,KACA;AACA,qBAAW,QAAQA,GAAE,QAAQ;AAE3B,gBAAI,OAAO,SAAS,UAAU;AAC5B,oBAAM,IAAI,MAAM,8BAA8B;YAChD;AAEA,iBAAK,OAAO,GAAG,OAAO,CAAC,CAAC;UAC1B;QACF;AACA,YAAI;AACJ,aAAK,EAAE;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAQ,OAAuB;AAC7B,eAAW,KAAK,OAAO;AACrB,UAAI,MAAM;AAAI;AAEd,UACE,OAAO,MAAM,YACb,EAAE,aAAa,MAAO,EAAE,YAAY,OACpC;AACA,cAAM,IAAI,MAAM,mBAAmB,CAAC;MACtC;AAEA,WAAK,OAAO,KAAK,CAAC;IACpB;EACF;EAEA,SAAM;AACJ,UAAM,MACJ,KAAK,SAAS,OACZ,KAAK,OACF,MAAK,EACL,IAAI,OAAM,OAAO,MAAM,WAAW,IAAI,EAAE,OAAM,CAAG,IACpD,CAAC,KAAK,MAAM,GAAG,KAAK,OAAO,IAAI,OAAM,EAAU,OAAM,CAAE,CAAC;AAC5D,QAAI,KAAK,QAAO,KAAM,CAAC,KAAK;AAAM,UAAI,QAAQ,CAAA,CAAE;AAChD,QACE,KAAK,MAAK,MACT,SAAS,KAAK,SACZ,KAAK,MAAM,eAAe,KAAK,SAAS,SAAS,MACpD;AACA,UAAI,KAAK,CAAA,CAAE;IACb;AACA,WAAO;EACT;EAEA,UAAO;AACL,QAAI,KAAK,UAAU;AAAM,aAAO;AAEhC,QAAI,CAAC,KAAK,SAAS,QAAO;AAAI,aAAO;AACrC,QAAI,KAAK,iBAAiB;AAAG,aAAO;AAEpC,UAAM,IAAI,KAAK;AACf,aAAS,IAAI,GAAG,IAAI,KAAK,cAAc,KAAK;AAC1C,YAAM,KAAK,EAAE,OAAO,CAAC;AACrB,UAAI,EAAE,cAAc,MAAO,GAAG,SAAS,MAAM;AAC3C,eAAO;MACT;IACF;AACA,WAAO;EACT;EAEA,QAAK;AACH,QAAI,KAAK,UAAU;AAAM,aAAO;AAChC,QAAI,KAAK,SAAS,SAAS;AAAK,aAAO;AACvC,QAAI,CAAC,KAAK,SAAS,MAAK;AAAI,aAAO;AACnC,QAAI,CAAC,KAAK;AAAM,aAAO,KAAK,SAAS,MAAK;AAG1C,UAAM,KAAK,KAAK,UAAU,KAAK,QAAQ,OAAO,SAAS;AAEvD,WAAO,KAAK,iBAAiB,KAAK;EACpC;EAEA,OAAO,MAAkB;AACvB,QAAI,OAAO,SAAS;AAAU,WAAK,KAAK,IAAI;;AACvC,WAAK,KAAK,KAAK,MAAM,IAAI,CAAC;EACjC;EAEA,MAAM,QAAW;AACf,UAAM,IAAI,IAAI,GAAI,KAAK,MAAM,MAAM;AACnC,eAAW,KAAK,KAAK,QAAQ;AAC3B,QAAE,OAAO,CAAC;IACZ;AACA,WAAO;EACT;EAEA,OAAO,UACLC,MACA,KACA,KACA,KACA,UAAgB;AAEhB,UAAM,WAAW,IAAI,uBAAuB;AAC5C,QAAI,WAAW;AACf,QAAI,UAAU;AACd,QAAI,aAAa;AACjB,QAAI,WAAW;AACf,QAAI,IAAI,SAAS,MAAM;AAErB,UAAIC,KAAI;AACR,UAAIC,OAAM;AACV,aAAOD,KAAID,KAAI,QAAQ;AACrB,cAAM,IAAIA,KAAI,OAAOC,IAAG;AAGxB,YAAI,YAAY,MAAM,MAAM;AAC1B,qBAAW,CAAC;AACZ,UAAAC,QAAO;AACP;QACF;AAEA,YAAI,SAAS;AACX,cAAID,OAAM,aAAa,GAAG;AACxB,gBAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,yBAAW;YACb;UACF,WAAW,MAAM,OAAO,EAAEA,OAAM,aAAa,KAAK,WAAW;AAC3D,sBAAU;UACZ;AACA,UAAAC,QAAO;AACP;QACF,WAAW,MAAM,KAAK;AACpB,oBAAU;AACV,uBAAaD;AACb,qBAAW;AACX,UAAAC,QAAO;AACP;QACF;AAIA,cAAM,YACJ,CAAC,IAAI,SACL,cAAc,CAAC,KACfF,KAAI,OAAOC,EAAC,MAAM,OAClB,YAAY;AACd,YAAI,WAAW;AACb,cAAI,KAAKC,IAAG;AACZ,UAAAA,OAAM;AACN,gBAAMC,OAAM,IAAI,GAAI,GAAG,GAAG;AAC1B,UAAAF,KAAI,GAAI,UAAUD,MAAKG,MAAKF,IAAG,KAAK,WAAW,CAAC;AAChD,cAAI,KAAKE,IAAG;AACZ;QACF;AACA,QAAAD,QAAO;MACT;AACA,UAAI,KAAKA,IAAG;AACZ,aAAOD;IACT;AAIA,QAAI,IAAI,MAAM;AACd,QAAI,OAAO,IAAI,GAAI,MAAM,GAAG;AAC5B,UAAM,QAAe,CAAA;AACrB,QAAI,MAAM;AACV,WAAO,IAAID,KAAI,QAAQ;AACrB,YAAM,IAAIA,KAAI,OAAO,GAAG;AAGxB,UAAI,YAAY,MAAM,MAAM;AAC1B,mBAAW,CAAC;AACZ,eAAO;AACP;MACF;AAEA,UAAI,SAAS;AACX,YAAI,MAAM,aAAa,GAAG;AACxB,cAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,uBAAW;UACb;QACF,WAAW,MAAM,OAAO,EAAE,MAAM,aAAa,KAAK,WAAW;AAC3D,oBAAU;QACZ;AACA,eAAO;AACP;MACF,WAAW,MAAM,KAAK;AACpB,kBAAU;AACV,qBAAa;AACb,mBAAW;AACX,eAAO;AACP;MACF;AAEA,YAAM,YACJ,CAAC,IAAI,SACL,cAAc,CAAC,KACfA,KAAI,OAAO,CAAC,MAAM;OAEjB,YAAY,YAAa,OAAO,IAAI,cAAc,CAAC;AAEtD,UAAI,WAAW;AACb,cAAM,WAAW,OAAO,IAAI,cAAc,CAAC,IAAI,IAAI;AACnD,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAMG,OAAM,IAAI,GAAI,GAAG,IAAI;AAC3B,aAAK,KAAKA,IAAG;AACb,YAAI,GAAI,UAAUH,MAAKG,MAAK,GAAG,KAAK,WAAW,QAAQ;AACvD;MACF;AACA,UAAI,MAAM,KAAK;AACb,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAM,KAAK,IAAI;AACf,eAAO,IAAI,GAAI,MAAM,GAAG;AACxB;MACF;AACA,UAAI,MAAM,KAAK;AACb,YAAI,QAAQ,MAAM,IAAI,OAAO,WAAW,GAAG;AACzC,cAAI,YAAY;QAClB;AACA,aAAK,KAAK,GAAG;AACb,cAAM;AACN,YAAI,KAAK,GAAG,OAAO,IAAI;AACvB,eAAO;MACT;AACA,aAAO;IACT;AAKA,QAAI,OAAO;AACX,QAAI,YAAY;AAChB,QAAI,SAAS,CAACH,KAAI,UAAU,MAAM,CAAC,CAAC;AACpC,WAAO;EACT;EAEA,mBAAmB,OAAoB;AAIrC,WAAO,KAAK,UAAU,OAAO,oBAAoB;EACnD;EAEA,UACE,OACAI,OAAuC,aAAW;AAKlD,QACE,CAAC,SACD,OAAO,UAAU,YACjB,MAAM,SAAS,QACf,MAAM,OAAO,WAAW,KACxB,KAAK,SAAS,MACd;AACA,aAAO;IACT;AACA,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,QAAI,CAAC,MAAM,OAAO,OAAO,YAAY,GAAG,SAAS,MAAM;AACrD,aAAO;IACT;AACA,WAAQ,KAAqC,cAC3C,GAAG,MACHA,IAAG;EAEP;EACA,cACE,GACAA,OAAuC,gBAAc;AAErD,WAAO,CAAC,CAACA,KAAI,IAAI,KAAK,IAAmB,GAAG,SAAS,CAAgB;EACvE;EAEA,gBAEE,OAGA,OAAa;AAEb,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,UAAM,QAAQ,IAAI,GAAI,MAAM,IAAI,KAAK,OAAO;AAC5C,UAAM,OAAO,KAAK,EAAE;AACpB,OAAG,KAAK,KAAK;AACb,SAAK,OAAO,OAAO,KAAK;EAC1B;EAEA,OACE,OAGA,OAAa;AAEb,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,SAAK,OAAO,OAAO,OAAO,GAAG,GAAG,GAAG,MAAM;AACzC,eAAW,KAAK,GAAG,QAAQ;AACzB,UAAI,OAAO,MAAM;AAAU,UAAE,UAAU;IACzC;AACA,SAAK,YAAY;EACnB;EAEA,cAAc,GAAS;AACrB,UAAM,IAAI,SAAS,IAAI,KAAK,IAAmB;AAC/C,WAAO,CAAC,CAAE,GAAG,IAAI,CAAgB;EACnC;EAEA,UACE,OAAoB;AAKpB,QACE,CAAC,SACD,OAAO,UAAU,YACjB,MAAM,SAAS,QACf,MAAM,OAAO,WAAW,KACxB,KAAK,SAAS,QACd,KAAK,OAAO,WAAW,GACvB;AACA,aAAO;IACT;AACA,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,QAAI,CAAC,MAAM,OAAO,OAAO,YAAY,GAAG,SAAS,MAAM;AACrD,aAAO;IACT;AACA,WAAQ,KAAqC,cAAc,GAAG,IAAI;EACpE;EAEA,OAA0C,OAA2B;AACnE,UAAM,IAAI,SAAS,IAAI,KAAK,IAAmB;AAC/C,UAAM,KAAK,MAAM,OAAO,CAAC;AACzB,UAAMC,MAAK,GAAG,IAAI,GAAG,IAAI;AAEzB,QAAI,CAACA;AAAI,aAAO;AAEhB,SAAK,SAAS,GAAG;AACjB,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,OAAO,MAAM,UAAU;AACzB,UAAE,UAAU;MACd;IACF;AACA,SAAK,OAAOA;AACZ,SAAK,YAAY;AACjB,SAAK,YAAY;EACnB;EAEA,OAAO,SAAS,SAAiB,UAA4B,CAAA,GAAE;AAC7D,UAAM,MAAM,IAAI,GAAI,MAAM,QAAW,OAAO;AAC5C,OAAI,UAAU,SAAS,KAAK,GAAG,SAAS,CAAC;AACzC,WAAO;EACT;;;EAIA,cAAW;AAGT,QAAI,SAAS,KAAK;AAAO,aAAO,KAAK,MAAM,YAAW;AAEtD,UAAM,OAAO,KAAK,SAAQ;AAC1B,UAAM,CAACC,KAAI,MAAM,UAAU,KAAK,IAAI,KAAK,eAAc;AAIvD,UAAM,WACJ,YACA,KAAK,aACJ,KAAK,SAAS,UACb,CAAC,KAAK,SAAS,mBACf,KAAK,YAAW,MAAO,KAAK,YAAW;AAC3C,QAAI,CAAC,UAAU;AACb,aAAO;IACT;AAEA,UAAM,SAAS,KAAK,SAAS,SAAS,MAAM,OAAO,QAAQ,MAAM;AACjE,WAAO,OAAO,OAAO,IAAI,OAAO,IAAIA,GAAE,KAAK,KAAK,GAAG;MACjD,MAAMA;MACN,OAAO;KACR;EACH;EAEA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAuEA,eACE,UAAkB;AAElB,UAAM,MAAM,YAAY,CAAC,CAAC,KAAK,SAAS;AACxC,QAAI,KAAK,UAAU,MAAM;AACvB,WAAK,SAAQ;AACb,WAAK,UAAS;IAChB;AACA,QAAI,CAAC,aAAa,IAAI,GAAG;AACvB,YAAM,UACJ,KAAK,QAAO,KACZ,KAAK,MAAK,KACV,CAAC,KAAK,OAAO,KAAK,OAAK,OAAO,MAAM,QAAQ;AAC9C,YAAM,MAAM,KAAK,OACd,IAAI,OAAI;AACP,cAAM,CAACA,KAAIC,IAAG,UAAU,KAAK,IAC3B,OAAO,MAAM,WACX,GAAI,WAAW,GAAG,KAAK,WAAW,OAAO,IACzC,EAAE,eAAe,QAAQ;AAC7B,aAAK,YAAY,KAAK,aAAa;AACnC,aAAK,SAAS,KAAK,UAAU;AAC7B,eAAOD;MACT,CAAC,EACA,KAAK,EAAE;AAEV,UAAIE,SAAQ;AACZ,UAAI,KAAK,QAAO,GAAI;AAClB,YAAI,OAAO,KAAK,OAAO,CAAC,MAAM,UAAU;AAMtC,gBAAM,iBACJ,KAAK,OAAO,WAAW,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,CAAC;AACzD,cAAI,CAAC,gBAAgB;AACnB,kBAAM,MAAM;AAGZ,kBAAM;;cAEH,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;cAE5B,IAAI,WAAW,KAAK,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;cAE9C,IAAI,WAAW,QAAQ,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;;AAGpD,kBAAM,YAAY,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC;AAE5D,YAAAA,SACE,aAAa,mBACX,YAAY,aACZ;UACN;QACF;MACF;AAGA,UAAI,MAAM;AACV,UACE,KAAK,MAAK,KACV,KAAK,MAAM,eACX,KAAK,SAAS,SAAS,KACvB;AACA,cAAM;MACR;AACA,YAAMC,SAAQD,SAAQ,MAAM;AAC5B,aAAO;QACLC;QACA,SAAS,GAAG;QACX,KAAK,YAAY,CAAC,CAAC,KAAK;QACzB,KAAK;;IAET;AAMA,UAAM,WAAW,KAAK,SAAS,OAAO,KAAK,SAAS;AAEpD,UAAM,QAAQ,KAAK,SAAS,MAAM,cAAc;AAChD,QAAI,OAAO,KAAK,eAAe,GAAG;AAElC,QAAI,KAAK,QAAO,KAAM,KAAK,MAAK,KAAM,CAAC,QAAQ,KAAK,SAAS,KAAK;AAGhE,YAAM,IAAI,KAAK,SAAQ;AACvB,YAAMC,MAAK;AACX,MAAAA,IAAG,SAAS,CAAC,CAAC;AACd,MAAAA,IAAG,OAAO;AACV,MAAAA,IAAG,YAAY;AACf,aAAO,CAAC,GAAG,SAAS,KAAK,SAAQ,CAAE,GAAG,OAAO,KAAK;IACpD;AAEA,QAAI,iBACF,CAAC,YAAY,YAAY,OAAO,CAAC,aAC/B,KACA,KAAK,eAAe,IAAI;AAC5B,QAAI,mBAAmB,MAAM;AAC3B,uBAAiB;IACnB;AACA,QAAI,gBAAgB;AAClB,aAAO,MAAM,IAAI,OAAO,cAAc;IACxC;AAGA,QAAI,QAAQ;AACZ,QAAI,KAAK,SAAS,OAAO,KAAK,WAAW;AACvC,eAAS,KAAK,QAAO,KAAM,CAAC,MAAM,aAAa,MAAM;IACvD,OAAO;AACL,YAAM,QACJ,KAAK,SAAS;;QAEZ,QACC,KAAK,QAAO,KAAM,CAAC,OAAO,CAAC,WAAW,aAAa,MACpD,OACA;UACA,KAAK,SAAS,MAAM,MACpB,KAAK,SAAS,MAAM,OACpB,KAAK,SAAS,OAAO,iBAAiB,MACtC,KAAK,SAAS,OAAO,iBAAiB,OACtC,IAAI,KAAK,IAAI;AACjB,cAAQ,QAAQ,OAAO;IACzB;AACA,WAAO;MACL;MACA,SAAS,IAAI;MACZ,KAAK,YAAY,CAAC,CAAC,KAAK;MACzB,KAAK;;EAET;EAEA,WAAQ;AACN,QAAI,CAAC,aAAa,IAAI,GAAG;AACvB,iBAAW,KAAK,KAAK,QAAQ;AAC3B,YAAI,OAAO,MAAM,UAAU;AACzB,YAAE,SAAQ;QACZ;MACF;IACF,OAAO;AAEL,UAAI,aAAa;AACjB,UAAI,OAAO;AACX,SAAG;AACD,eAAO;AACP,iBAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AAC3C,gBAAM,IAAI,KAAK,OAAO,CAAC;AACvB,cAAI,OAAO,MAAM,UAAU;AACzB,cAAE,SAAQ;AACV,gBAAI,KAAK,UAAU,CAAC,GAAG;AACrB,qBAAO;AACP,mBAAK,OAAO,GAAG,CAAC;YAClB,WAAW,KAAK,mBAAmB,CAAC,GAAG;AACrC,qBAAO;AACP,mBAAK,gBAAgB,GAAG,CAAC;YAC3B,WAAW,KAAK,UAAU,CAAC,GAAG;AAC5B,qBAAO;AACP,mBAAK,OAAO,CAAC;YACf;UACF;QACF;MACF,SAAS,CAAC,QAAQ,EAAE,aAAa;IACnC;AACA,SAAK,YAAY;EACnB;EAEA,eAAkD,KAAY;AAC5D,WAAO,KAAK,OACT,IAAI,OAAI;AAGP,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,IAAI,MAAM,8BAA8B;MAChD;AAGA,YAAM,CAACJ,KAAIC,IAAG,WAAW,KAAK,IAAI,EAAE,eAAe,GAAG;AACtD,WAAK,SAAS,KAAK,UAAU;AAC7B,aAAOD;IACT,CAAC,EACA,OAAO,OAAK,EAAE,KAAK,QAAO,KAAM,KAAK,MAAK,MAAO,CAAC,CAAC,CAAC,EACpD,KAAK,GAAG;EACb;EAEA,OAAO,WACL,MACA,UACA,UAAmB,OAAK;AAExB,QAAI,WAAW;AACf,QAAIA,MAAK;AACT,QAAI,QAAQ;AAEZ,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,IAAI,KAAK,OAAO,CAAC;AACvB,UAAI,UAAU;AACZ,mBAAW;AACX,QAAAA,QAAO,WAAW,IAAI,CAAC,IAAI,OAAO,MAAM;AACxC;MACF;AACA,UAAI,MAAM,KAAK;AACb,YAAI;AAAQ;AACZ,iBAAS;AACT,QAAAA,OAAM,WAAW,SAAS,KAAK,IAAI,IAAI,cAAc;AACrD,mBAAW;AACX;MACF,OAAO;AACL,iBAAS;MACX;AACA,UAAI,MAAM,MAAM;AACd,YAAI,MAAM,KAAK,SAAS,GAAG;AACzB,UAAAA,OAAM;QACR,OAAO;AACL,qBAAW;QACb;AACA;MACF;AACA,UAAI,MAAM,KAAK;AACb,cAAM,CAAC,KAAK,WAAW,UAAU,KAAK,IAAI,WAAW,MAAM,CAAC;AAC5D,YAAI,UAAU;AACZ,UAAAA,OAAM;AACN,kBAAQ,SAAS;AACjB,eAAK,WAAW;AAChB,qBAAW,YAAY;AACvB;QACF;MACF;AACA,UAAI,MAAM,KAAK;AACb,QAAAA,OAAM;AACN,mBAAW;AACX;MACF;AACA,MAAAA,OAAM,aAAa,CAAC;IACtB;AACA,WAAO,CAACA,KAAI,SAAS,IAAI,GAAG,CAAC,CAAC,UAAU,KAAK;EAC/C;;;;;AC77BK,IAAM,SAAS,CACpB,GACA,EACE,uBAAuB,OACvB,gBAAgB,MAAK,IAC+C,CAAA,MACpE;AAIF,MAAI,eAAe;AACjB,WAAO,uBACH,EAAE,QAAQ,gBAAgB,MAAM,IAChC,EAAE,QAAQ,kBAAkB,MAAM;EACxC;AACA,SAAO,uBACH,EAAE,QAAQ,cAAc,MAAM,IAC9B,EAAE,QAAQ,gBAAgB,MAAM;AACtC;;;ACyFO,IAAM,YAAY,CACvB,GACA,SACA,UAA4B,CAAA,MAC1B;AACF,qBAAmB,OAAO;AAG1B,MAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAO;EACT;AAEA,SAAO,IAAI,UAAU,SAAS,OAAO,EAAE,MAAM,CAAC;AAChD;AAGA,IAAM,eAAe;AACrB,IAAM,iBAAiB,CAACK,SAAgB,CAAC,MACvC,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAASA,IAAG;AACtC,IAAM,oBAAoB,CAACA,SAAgB,CAAC,MAAc,EAAE,SAASA,IAAG;AACxE,IAAM,uBAAuB,CAACA,SAAe;AAC3C,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAC1E;AACA,IAAM,0BAA0B,CAACA,SAAe;AAC9C,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,EAAE,YAAW,EAAG,SAASA,IAAG;AACpD;AACA,IAAM,gBAAgB;AACtB,IAAM,kBAAkB,CAAC,MACvB,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AACtC,IAAM,qBAAqB,CAAC,MAC1B,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC3C,IAAM,YAAY;AAClB,IAAM,cAAc,CAAC,MACnB,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,GAAG;AAC7C,IAAM,SAAS;AACf,IAAM,WAAW,CAAC,MAAc,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,GAAG;AACnE,IAAM,cAAc,CAAC,MACnB,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AACvC,IAAM,WAAW;AACjB,IAAM,mBAAmB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AAC5D,QAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;AAClC,MAAI,CAACA;AAAK,WAAO;AACjB,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAChE;AACA,IAAM,sBAAsB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AAC/D,QAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;AACrC,MAAI,CAACA;AAAK,WAAO;AACjB,EAAAA,OAAMA,KAAI,YAAW;AACrB,SAAO,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,YAAW,EAAG,SAASA,IAAG;AAChE;AACA,IAAM,gBAAgB,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AACzD,QAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;AACrC,SAAO,CAACA,OAAM,QAAQ,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,SAASA,IAAG;AACjE;AACA,IAAM,aAAa,CAAC,CAAC,IAAIA,OAAM,EAAE,MAAuB;AACtD,QAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;AAClC,SAAO,CAACA,OAAM,QAAQ,CAAC,MAAc,MAAM,CAAC,KAAK,EAAE,SAASA,IAAG;AACjE;AACA,IAAM,kBAAkB,CAAC,CAAC,EAAE,MAAuB;AACjD,QAAM,MAAM,GAAG;AACf,SAAO,CAAC,MAAc,EAAE,WAAW,OAAO,CAAC,EAAE,WAAW,GAAG;AAC7D;AACA,IAAM,qBAAqB,CAAC,CAAC,EAAE,MAAuB;AACpD,QAAM,MAAM,GAAG;AACf,SAAO,CAAC,MAAc,EAAE,WAAW,OAAO,MAAM,OAAO,MAAM;AAC/D;AAGA,IAAM,kBACJ,OAAO,YAAY,YAAY,UAC5B,OAAO,QAAQ,QAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACd,QAAQ,WACR;AAIJ,IAAM,OAAsC;EAC1C,OAAO,EAAE,KAAK,KAAI;EAClB,OAAO,EAAE,KAAK,IAAG;;AAIZ,IAAM,MACX,oBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC5D,UAAU,MAAM;AAET,IAAM,WAAW,uBAAO,aAAa;AAC5C,UAAU,WAAW;AAIrB,IAAMC,SAAQ;AAGd,IAAMC,QAAOD,SAAQ;AAKrB,IAAM,aAAa;AAInB,IAAM,eAAe;AAEd,IAAM,SACX,CAAC,SAAiB,UAA4B,CAAA,MAC9C,CAAC,MACC,UAAU,GAAG,SAAS,OAAO;AACjC,UAAU,SAAS;AAEnB,IAAM,MAAM,CAAC,GAAqB,IAAsB,CAAA,MACtD,OAAO,OAAO,CAAA,GAAI,GAAG,CAAC;AAEjB,IAAM,WAAW,CAAC,QAA2C;AAClE,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,CAAC,OAAO,KAAK,GAAG,EAAE,QAAQ;AAC/D,WAAO;EACT;AAEA,QAAM,OAAO;AAEb,QAAM,IAAI,CAAC,GAAW,SAAiB,UAA4B,CAAA,MACjE,KAAK,GAAG,SAAS,IAAI,KAAK,OAAO,CAAC;AAEpC,SAAO,OAAO,OAAO,GAAG;IACtB,WAAW,MAAM,kBAAkB,KAAK,UAAS;MAC/C,YAAY,SAAiB,UAA4B,CAAA,GAAE;AACzD,cAAM,SAAS,IAAI,KAAK,OAAO,CAAC;MAClC;MACA,OAAO,SAAS,SAAyB;AACvC,eAAO,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,EAAE;MAC1C;;IAGF,KAAK,MAAM,YAAY,KAAK,IAAG;;MAE7B,YACEE,OACA,QACA,UAA4B,CAAA,GAAE;AAE9B,cAAMA,OAAM,QAAQ,IAAI,KAAK,OAAO,CAAC;MACvC;;MAGA,OAAO,SAAS,SAAiB,UAA4B,CAAA,GAAE;AAC7D,eAAO,KAAK,IAAI,SAAS,SAAS,IAAI,KAAK,OAAO,CAAC;MACrD;;IAGF,UAAU,CACR,GACA,UAGI,CAAA,MACD,KAAK,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC;IAEvC,QAAQ,CACN,GACA,UAGI,CAAA,MACD,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,CAAC;IAErC,QAAQ,CAAC,SAAiB,UAA4B,CAAA,MACpD,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;IAExC,UAAU,CAAC,YACT,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC;IAEjC,QAAQ,CAAC,SAAiB,UAA4B,CAAA,MACpD,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;IAExC,aAAa,CAAC,SAAiB,UAA4B,CAAA,MACzD,KAAK,YAAY,SAAS,IAAI,KAAK,OAAO,CAAC;IAE7C,OAAO,CACL,MACA,SACA,UAA4B,CAAA,MACzB,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;IAEhD,KAAK,KAAK;IACV;GACD;AACH;AACA,UAAU,WAAW;AAYd,IAAM,cAAc,CACzB,SACA,UAA4B,CAAA,MAC1B;AACF,qBAAmB,OAAO;AAI1B,MAAI,QAAQ,WAAW,CAAC,mBAAmB,KAAK,OAAO,GAAG;AAExD,WAAO,CAAC,OAAO;EACjB;AAEA,SAAO,OAAO,SAAS,EAAE,KAAK,QAAQ,eAAc,CAAE;AACxD;AACA,UAAU,cAAc;AAcjB,IAAM,SAAS,CAAC,SAAiB,UAA4B,CAAA,MAClE,IAAI,UAAU,SAAS,OAAO,EAAE,OAAM;AACxC,UAAU,SAAS;AAEZ,IAAM,QAAQ,CACnB,MACA,SACA,UAA4B,CAAA,MAC1B;AACF,QAAM,KAAK,IAAI,UAAU,SAAS,OAAO;AACzC,SAAO,KAAK,OAAO,OAAK,GAAG,MAAM,CAAC,CAAC;AACnC,MAAI,GAAG,QAAQ,UAAU,CAAC,KAAK,QAAQ;AACrC,SAAK,KAAK,OAAO;EACnB;AACA,SAAO;AACT;AACA,UAAU,QAAQ;AAGlB,IAAM,YAAY;AAClB,IAAMC,gBAAe,CAAC,MACpB,EAAE,QAAQ,4BAA4B,MAAM;AAUxC,IAAO,YAAP,MAAgB;EACpB;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EAEA;EACA,YAAY,SAAiB,UAA4B,CAAA,GAAE;AACzD,uBAAmB,OAAO;AAE1B,cAAU,WAAW,CAAA;AACrB,SAAK,UAAU;AACf,SAAK,uBAAuB,QAAQ,wBAAwB;AAC5D,SAAK,UAAU;AACf,SAAK,WAAW,QAAQ,YAAY;AACpC,SAAK,YAAY,KAAK,aAAa;AAEnC,UAAM,MAAO;AACb,SAAK,uBACH,CAAC,CAAC,QAAQ,wBAAwB,QAAQ,GAAG,MAAM;AACrD,QAAI,KAAK,sBAAsB;AAC7B,WAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG;IAChD;AACA,SAAK,0BAA0B,CAAC,CAAC,QAAQ;AACzC,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,WAAW,CAAC,CAAC,QAAQ;AAC1B,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,UAAU,CAAC,CAAC,QAAQ;AACzB,SAAK,SAAS,CAAC,CAAC,KAAK,QAAQ;AAC7B,SAAK,qBACH,QAAQ,uBAAuB,SAC7B,QAAQ,qBACR,CAAC,EAAE,KAAK,aAAa,KAAK;AAE9B,SAAK,UAAU,CAAA;AACf,SAAK,YAAY,CAAA;AACjB,SAAK,MAAM,CAAA;AAGX,SAAK,KAAI;EACX;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,GAAG;AACrD,aAAO;IACT;AACA,eAAW,WAAW,KAAK,KAAK;AAC9B,iBAAW,QAAQ,SAAS;AAC1B,YAAI,OAAO,SAAS;AAAU,iBAAO;MACvC;IACF;AACA,WAAO;EACT;EAEA,SAASC,IAAQ;EAAG;EAEpB,OAAI;AACF,UAAM,UAAU,KAAK;AACrB,UAAM,UAAU,KAAK;AAGrB,QAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;AACnD,WAAK,UAAU;AACf;IACF;AAEA,QAAI,CAAC,SAAS;AACZ,WAAK,QAAQ;AACb;IACF;AAGA,SAAK,YAAW;AAGhB,SAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC;AAE9C,QAAI,QAAQ,OAAO;AACjB,WAAK,QAAQ,IAAI,SAAgB,QAAQ,MAAM,GAAG,IAAI;IACxD;AAEA,SAAK,MAAM,KAAK,SAAS,KAAK,OAAO;AAWrC,UAAM,eAAe,KAAK,QAAQ,IAAI,OAAK,KAAK,WAAW,CAAC,CAAC;AAC7D,SAAK,YAAY,KAAK,WAAW,YAAY;AAC7C,SAAK,MAAM,KAAK,SAAS,KAAK,SAAS;AAGvC,QAAIC,OAAM,KAAK,UAAU,IAAI,CAAC,GAAGD,IAAG,OAAM;AACxC,UAAI,KAAK,aAAa,KAAK,oBAAoB;AAE7C,cAAM,QACJ,EAAE,CAAC,MAAM,MACT,EAAE,CAAC,MAAM,OACR,EAAE,CAAC,MAAM,OAAO,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC,MACrC,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC;AACtB,cAAM,UAAU,WAAW,KAAK,EAAE,CAAC,CAAC;AACpC,YAAI,OAAO;AACT,iBAAO;YACL,GAAG,EAAE,MAAM,GAAG,CAAC;YACf,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,CAAAE,QAAM,KAAK,MAAMA,GAAE,CAAC;;QAE1C,WAAW,SAAS;AAClB,iBAAO,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,CAAAA,QAAM,KAAK,MAAMA,GAAE,CAAC,CAAC;QACvD;MACF;AACA,aAAO,EAAE,IAAI,CAAAA,QAAM,KAAK,MAAMA,GAAE,CAAC;IACnC,CAAC;AAED,SAAK,MAAM,KAAK,SAASD,IAAG;AAG5B,SAAK,MAAMA,KAAI,OACb,OAAK,EAAE,QAAQ,KAAK,MAAM,EAAE;AAI9B,QAAI,KAAK,WAAW;AAClB,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,cAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YACE,EAAE,CAAC,MAAM,MACT,EAAE,CAAC,MAAM,MACT,KAAK,UAAU,CAAC,EAAE,CAAC,MAAM,OACzB,OAAO,EAAE,CAAC,MAAM,YAChB,YAAY,KAAK,EAAE,CAAC,CAAC,GACrB;AACA,YAAE,CAAC,IAAI;QACT;MACF;IACF;AAEA,SAAK,MAAM,KAAK,SAAS,KAAK,GAAG;EACnC;;;;;;EAOA,WAAW,WAAqB;AAE9B,QAAI,KAAK,QAAQ,YAAY;AAC3B,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,iBAASE,KAAI,GAAGA,KAAI,UAAU,CAAC,EAAE,QAAQA,MAAK;AAC5C,cAAI,UAAU,CAAC,EAAEA,EAAC,MAAM,MAAM;AAC5B,sBAAU,CAAC,EAAEA,EAAC,IAAI;UACpB;QACF;MACF;IACF;AAEA,UAAM,EAAE,oBAAoB,EAAC,IAAK,KAAK;AAEvC,QAAI,qBAAqB,GAAG;AAE1B,kBAAY,KAAK,qBAAqB,SAAS;AAC/C,kBAAY,KAAK,sBAAsB,SAAS;IAClD,WAAW,qBAAqB,GAAG;AAEjC,kBAAY,KAAK,iBAAiB,SAAS;IAC7C,OAAO;AAEL,kBAAY,KAAK,0BAA0B,SAAS;IACtD;AAEA,WAAO;EACT;;EAGA,0BAA0B,WAAqB;AAC7C,WAAO,UAAU,IAAI,WAAQ;AAC3B,UAAIC,MAAa;AACjB,aAAO,QAAQA,MAAK,MAAM,QAAQ,MAAMA,MAAK,CAAC,IAAI;AAChD,YAAI,IAAIA;AACR,eAAO,MAAM,IAAI,CAAC,MAAM,MAAM;AAC5B;QACF;AACA,YAAI,MAAMA,KAAI;AACZ,gBAAM,OAAOA,KAAI,IAAIA,GAAE;QACzB;MACF;AACA,aAAO;IACT,CAAC;EACH;;EAGA,iBAAiB,WAAqB;AACpC,WAAO,UAAU,IAAI,WAAQ;AAC3B,cAAQ,MAAM,OAAO,CAACH,MAAe,SAAQ;AAC3C,cAAM,OAAOA,KAAIA,KAAI,SAAS,CAAC;AAC/B,YAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,iBAAOA;QACT;AACA,YAAI,SAAS,MAAM;AACjB,cAAI,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;AAC1D,YAAAA,KAAI,IAAG;AACP,mBAAOA;UACT;QACF;AACA,QAAAA,KAAI,KAAK,IAAI;AACb,eAAOA;MACT,GAAG,CAAA,CAAE;AACL,aAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;IACrC,CAAC;EACH;EAEA,qBAAqB,OAAwB;AAC3C,QAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,cAAQ,KAAK,WAAW,KAAK;IAC/B;AACA,QAAI,eAAwB;AAC5B,OAAG;AACD,qBAAe;AAEf,UAAI,CAAC,KAAK,yBAAyB;AACjC,iBAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,gBAAM,IAAI,MAAM,CAAC;AAEjB,cAAI,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,MAAM;AAAI;AAC5C,cAAI,MAAM,OAAO,MAAM,IAAI;AACzB,2BAAe;AACf,kBAAM,OAAO,GAAG,CAAC;AACjB;UACF;QACF;AACA,YACE,MAAM,CAAC,MAAM,OACb,MAAM,WAAW,MAChB,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,KAClC;AACA,yBAAe;AACf,gBAAM,IAAG;QACX;MACF;AAGA,UAAI,KAAa;AACjB,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,cAAM,IAAI,MAAM,KAAK,CAAC;AACtB,YAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC9C,yBAAe;AACf,gBAAM,OAAO,KAAK,GAAG,CAAC;AACtB,gBAAM;QACR;MACF;IACF,SAAS;AACT,WAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;EACrC;;;;;;;;;;;;;;;;;;;EAoBA,qBAAqB,WAAqB;AACxC,QAAI,eAAe;AACnB,OAAG;AACD,qBAAe;AAEf,eAAS,SAAS,WAAW;AAC3B,YAAIG,MAAa;AACjB,eAAO,QAAQA,MAAK,MAAM,QAAQ,MAAMA,MAAK,CAAC,IAAI;AAChD,cAAI,MAAcA;AAClB,iBAAO,MAAM,MAAM,CAAC,MAAM,MAAM;AAE9B;UACF;AAGA,cAAI,MAAMA,KAAI;AACZ,kBAAM,OAAOA,MAAK,GAAG,MAAMA,GAAE;UAC/B;AAEA,cAAI,OAAO,MAAMA,MAAK,CAAC;AACvB,gBAAM,IAAI,MAAMA,MAAK,CAAC;AACtB,gBAAM,KAAK,MAAMA,MAAK,CAAC;AACvB,cAAI,SAAS;AAAM;AACnB,cACE,CAAC,KACD,MAAM,OACN,MAAM,QACN,CAAC,MACD,OAAO,OACP,OAAO,MACP;AACA;UACF;AACA,yBAAe;AAEf,gBAAM,OAAOA,KAAI,CAAC;AAClB,gBAAM,QAAQ,MAAM,MAAM,CAAC;AAC3B,gBAAMA,GAAE,IAAI;AACZ,oBAAU,KAAK,KAAK;AACpB,UAAAA;QACF;AAGA,YAAI,CAAC,KAAK,yBAAyB;AACjC,mBAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,kBAAM,IAAI,MAAM,CAAC;AAEjB,gBAAI,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,MAAM;AAAI;AAC5C,gBAAI,MAAM,OAAO,MAAM,IAAI;AACzB,6BAAe;AACf,oBAAM,OAAO,GAAG,CAAC;AACjB;YACF;UACF;AACA,cACE,MAAM,CAAC,MAAM,OACb,MAAM,WAAW,MAChB,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,KAClC;AACA,2BAAe;AACf,kBAAM,IAAG;UACX;QACF;AAGA,YAAI,KAAa;AACjB,eAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,gBAAM,IAAI,MAAM,KAAK,CAAC;AACtB,cAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC9C,2BAAe;AACf,kBAAM,UAAU,OAAO,KAAK,MAAM,KAAK,CAAC,MAAM;AAC9C,kBAAM,QAAQ,UAAU,CAAC,GAAG,IAAI,CAAA;AAChC,kBAAM,OAAO,KAAK,GAAG,GAAG,GAAG,KAAK;AAChC,gBAAI,MAAM,WAAW;AAAG,oBAAM,KAAK,EAAE;AACrC,kBAAM;UACR;QACF;MACF;IACF,SAAS;AAET,WAAO;EACT;;;;;;;;EASA,sBAAsB,WAAqB;AACzC,aAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAC7C,eAASD,KAAI,IAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AAC7C,cAAM,UAAU,KAAK,WACnB,UAAU,CAAC,GACX,UAAUA,EAAC,GACX,CAAC,KAAK,uBAAuB;AAE/B,YAAI,SAAS;AACX,oBAAU,CAAC,IAAI,CAAA;AACf,oBAAUA,EAAC,IAAI;AACf;QACF;MACF;IACF;AACA,WAAO,UAAU,OAAO,CAAAC,QAAMA,IAAG,MAAM;EACzC;EAEA,WACE,GACA,GACA,eAAwB,OAAK;AAE7B,QAAIC,MAAK;AACT,QAAIC,MAAK;AACT,QAAI,SAAmB,CAAA;AACvB,QAAI,QAAgB;AACpB,WAAOD,MAAK,EAAE,UAAUC,MAAK,EAAE,QAAQ;AACrC,UAAI,EAAED,GAAE,MAAM,EAAEC,GAAE,GAAG;AACnB,eAAO,KAAK,UAAU,MAAM,EAAEA,GAAE,IAAI,EAAED,GAAE,CAAC;AACzC,QAAAA;AACA,QAAAC;MACF,WAAW,gBAAgB,EAAED,GAAE,MAAM,QAAQ,EAAEC,GAAE,MAAM,EAAED,MAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAEA,GAAE,CAAC;AACjB,QAAAA;MACF,WAAW,gBAAgB,EAAEC,GAAE,MAAM,QAAQ,EAAED,GAAE,MAAM,EAAEC,MAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAEA,GAAE,CAAC;AACjB,QAAAA;MACF,WACE,EAAED,GAAE,MAAM,OACV,EAAEC,GAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAEA,GAAE,EAAE,WAAW,GAAG,MAC1C,EAAEA,GAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAED,GAAE,CAAC;AACjB,QAAAA;AACA,QAAAC;MACF,WACE,EAAEA,GAAE,MAAM,OACV,EAAED,GAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAEA,GAAE,EAAE,WAAW,GAAG,MAC1C,EAAEA,GAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAEC,GAAE,CAAC;AACjB,QAAAD;AACA,QAAAC;MACF,OAAO;AACL,eAAO;MACT;IACF;AAGA,WAAO,EAAE,WAAW,EAAE,UAAU;EAClC;EAEA,cAAW;AACT,QAAI,KAAK;AAAU;AAEnB,UAAM,UAAU,KAAK;AACrB,QAAI,SAAS;AACb,QAAI,eAAe;AAEnB,aAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,QAAQ,OAAO,CAAC,MAAM,KAAK,KAAK;AACpE,eAAS,CAAC;AACV;IACF;AAEA,QAAI;AAAc,WAAK,UAAU,QAAQ,MAAM,YAAY;AAC3D,SAAK,SAAS;EAChB;;;;;;EAOA,SACE,MACA,SACA,UAAmB,OAAK;AAExB,QAAI,iBAAiB;AACrB,QAAI,oBAAoB;AAKxB,QAAI,KAAK,WAAW;AAClB,YAAM,YACJ,OAAO,KAAK,CAAC,MAAM,YAAY,YAAY,KAAK,KAAK,CAAC,CAAC;AACzD,YAAM,UACJ,CAAC,aACD,KAAK,CAAC,MAAM,MACZ,KAAK,CAAC,MAAM,MACZ,KAAK,CAAC,MAAM,OACZ,YAAY,KAAK,KAAK,CAAC,CAAC;AAE1B,YAAM,eACJ,OAAO,QAAQ,CAAC,MAAM,YAAY,YAAY,KAAK,QAAQ,CAAC,CAAC;AAC/D,YAAM,aACJ,CAAC,gBACD,QAAQ,CAAC,MAAM,MACf,QAAQ,CAAC,MAAM,MACf,QAAQ,CAAC,MAAM,OACf,OAAO,QAAQ,CAAC,MAAM,YACtB,YAAY,KAAK,QAAQ,CAAC,CAAC;AAE7B,YAAM,MACJ,UAAU,IACR,YAAY,IACZ;AACJ,YAAM,MACJ,aAAa,IACX,eAAe,IACf;AACJ,UAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;AACtD,cAAM,CAAC,IAAI,EAAE,IAAsB;UACjC,KAAK,GAAG;UACR,QAAQ,GAAG;;AAGb,YAAI,GAAG,YAAW,MAAO,GAAG,YAAW,GAAI;AACzC,kBAAQ,GAAG,IAAI;AACf,8BAAoB;AACpB,2BAAiB;QACnB;MACF;IACF;AAIA,UAAM,EAAE,oBAAoB,EAAC,IAAK,KAAK;AACvC,QAAI,qBAAqB,GAAG;AAC1B,aAAO,KAAK,qBAAqB,IAAI;IACvC;AAEA,QAAI,QAAQ,SAAS,QAAQ,GAAG;AAC9B,aAAO,KAAK,eACV,MACA,SACA,SACA,gBACA,iBAAiB;IAErB;AAEA,WAAO,KAAK,UACV,MACA,SACA,SACA,gBACA,iBAAiB;EAErB;EAEA,eACE,MACA,SACA,SACA,WACA,cAAoB;AAGpB,UAAM,UAAU,QAAQ,QAAQ,UAAU,YAAY;AACtD,UAAM,SAAS,QAAQ,YAAY,QAAQ;AAK3C,UAAM,CAAC,MAAM,MAAM,IAAI,IAAI,UAAU;MACnC,QAAQ,MAAM,cAAc,OAAO;MACnC,QAAQ,MAAM,UAAU,CAAC;MACzB,CAAA;QACE;MACF,QAAQ,MAAM,cAAc,OAAO;MACnC,QAAQ,MAAM,UAAU,GAAG,MAAM;MACjC,QAAQ,MAAM,SAAS,CAAC;;AAI1B,QAAI,KAAK,QAAQ;AACf,YAAM,WAAW,KAAK,MAAM,WAAW,YAAY,KAAK,MAAM;AAC9D,UAAI,CAAC,KAAK,UAAU,UAAU,MAAM,SAAS,GAAG,CAAC,GAAG;AAClD,eAAO;MACT;AACA,mBAAa,KAAK;AAClB,sBAAgB,KAAK;IACvB;AAKA,QAAI,gBAAwB;AAC5B,QAAI,KAAK,QAAQ;AAEf,UAAI,KAAK,SAAS,YAAY,KAAK;AAAQ,eAAO;AAGlD,UAAI,YAAY,KAAK,SAAS,KAAK;AACnC,UAAI,KAAK,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAAG;AACrD,wBAAgB,KAAK;MACvB,OAAO;AAIL,YACE,KAAK,KAAK,SAAS,CAAC,MAAM,MAC1B,YAAY,KAAK,WAAW,KAAK,QACjC;AACA,iBAAO;QACT;AACA;AACA,YAAI,CAAC,KAAK,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAAG;AACtD,iBAAO;QACT;AACA,wBAAgB,KAAK,SAAS;MAChC;IACF;AAUA,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAI,UAAU,CAAC,CAAC;AAChB,eAASC,KAAI,WAAWA,KAAI,KAAK,SAAS,eAAeA,MAAK;AAC5D,cAAM,IAAI,OAAO,KAAKA,EAAC,CAAC;AACxB,kBAAU;AACV,YACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,iBAAO;QACT;MACF;AAEA,aAAO,WAAW;IACpB;AAQA,UAAM,eAA0C,CAAC,CAAC,CAAA,GAAI,CAAC,CAAC;AACxD,QAAI,cAAuC,aAAa,CAAC;AACzD,QAAI,aAAa;AACjB,UAAM,iBAA2B,CAAC,CAAC;AACnC,eAAW,KAAK,MAAM;AACpB,UAAI,MAAM,UAAU;AAClB,uBAAe,KAAK,UAAU;AAC9B,sBAAc,CAAC,CAAA,GAAI,CAAC;AACpB,qBAAa,KAAK,WAAW;MAC/B,OAAO;AACL,oBAAY,CAAC,EAAE,KAAK,CAAC;AACrB;MACF;IACF;AACA,QAAI,IAAI,aAAa,SAAS;AAC9B,UAAM,aAAa,KAAK,SAAS;AACjC,eAAW,KAAK,cAAc;AAC5B,QAAE,CAAC,IAAI,cAAe,eAAe,GAAG,IAAe,EAAE,CAAC,EAAE;IAC9D;AAEA,WAAO,CAAC,CAAC,KAAK,2BACZ,MACA,cACA,WACA,GACA,SACA,GACA,CAAC,CAAC,aAAa;EAEnB;;;EAIA,2BACE,MAEA,cACA,WACA,WACA,SACA,eACA,SAAgB;AAWhB,UAAMC,MAAK,aAAa,SAAS;AACjC,QAAI,CAACA,KAAI;AAEP,eAAS,IAAI,WAAW,IAAI,KAAK,QAAQ,KAAK;AAC5C,kBAAU;AACV,cAAM,IAAI,KAAK,CAAC;AAChB,YACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,iBAAO;QACT;MACF;AACA,aAAO;IACT;AAGA,UAAM,CAAC,MAAM,KAAK,IAAIA;AACtB,WAAO,aAAa,OAAO;AACzB,YAAM,IAAI,KAAK,UACb,KAAK,MAAM,GAAG,YAAY,KAAK,MAAM,GACrC,MACA,SACA,WACA,CAAC;AAIH,UAAI,KAAK,gBAAgB,KAAK,sBAAsB;AAElD,cAAM,MAAM,KAAK,2BACf,MACA,cACA,YAAY,KAAK,QACjB,YAAY,GACZ,SACA,gBAAgB,GAChB,OAAO;AAET,YAAI,QAAQ,OAAO;AACjB,iBAAO;QACT;MACF;AACA,YAAM,IAAI,KAAK,SAAS;AACxB,UACE,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC;AACA,eAAO;MACT;AAEA;IACF;AAEA,WAAO,WAAW;EACpB;EAEA,UACE,MACA,SACA,SACA,WACA,cAAoB;AAEpB,QAAIC;AACJ,QAAIC;AACJ,QAAI;AACJ,QAAI;AACJ,SACED,MAAK,WACHC,MAAK,cACL,KAAK,KAAK,QACV,KAAK,QAAQ,QACfD,MAAK,MAAMC,MAAK,IAChBD,OAAMC,OACN;AACA,WAAK,MAAM,eAAe;AAC1B,UAAI,IAAI,QAAQA,GAAE;AAClB,UAAI,IAAI,KAAKD,GAAE;AAEf,WAAK,MAAM,SAAS,GAAG,CAAC;AAKxB,UAAI,MAAM,SAAS,MAAM,UAAU;AACjC,eAAO;MACT;AAMA,UAAI;AACJ,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,MAAM;AACZ,aAAK,MAAM,gBAAgB,GAAG,GAAG,GAAG;MACtC,OAAO;AACL,cAAM,EAAE,KAAK,CAAC;AACd,aAAK,MAAM,iBAAiB,GAAG,GAAG,GAAG;MACvC;AAEA,UAAI,CAAC;AAAK,eAAO;IACnB;AAcA,QAAIA,QAAO,MAAMC,QAAO,IAAI;AAG1B,aAAO;IACT,WAAWD,QAAO,IAAI;AAIpB,aAAO;IACT,WAAWC,QAAO,IAAI;AAKpB,aAAOD,QAAO,KAAK,KAAK,KAAKA,GAAE,MAAM;IAGvC,OAAO;AAEL,YAAM,IAAI,MAAM,MAAM;IACxB;EAEF;EAEA,cAAW;AACT,WAAO,YAAY,KAAK,SAAS,KAAK,OAAO;EAC/C;EAEA,MAAM,SAAe;AACnB,uBAAmB,OAAO;AAE1B,UAAM,UAAU,KAAK;AAGrB,QAAI,YAAY;AAAM,aAAO;AAC7B,QAAI,YAAY;AAAI,aAAO;AAI3B,QAAI;AACJ,QAAI,WAA4C;AAChD,QAAK,IAAI,QAAQ,MAAM,MAAM,GAAI;AAC/B,iBAAW,QAAQ,MAAM,cAAc;IACzC,WAAY,IAAI,QAAQ,MAAM,YAAY,GAAI;AAC5C,kBACE,QAAQ,SACN,QAAQ,MACN,0BACA,uBACF,QAAQ,MAAM,oBACd,gBAAgB,EAAE,CAAC,CAAC;IAC1B,WAAY,IAAI,QAAQ,MAAM,QAAQ,GAAI;AACxC,kBACE,QAAQ,SACN,QAAQ,MACN,sBACA,mBACF,QAAQ,MAAM,gBACd,YAAY,CAAC;IACnB,WAAY,IAAI,QAAQ,MAAM,aAAa,GAAI;AAC7C,iBAAW,QAAQ,MAAM,qBAAqB;IAChD,WAAY,IAAI,QAAQ,MAAM,SAAS,GAAI;AACzC,iBAAW;IACb;AAEA,UAAME,MAAK,IAAI,SAAS,SAAS,KAAK,OAAO,EAAE,YAAW;AAC1D,QAAI,YAAY,OAAOA,QAAO,UAAU;AAEtC,cAAQ,eAAeA,KAAI,QAAQ,EAAE,OAAO,SAAQ,CAAE;IACxD;AACA,WAAOA;EACT;EAEA,SAAM;AACJ,QAAI,KAAK,UAAU,KAAK,WAAW;AAAO,aAAO,KAAK;AAQtD,UAAMV,OAAM,KAAK;AAEjB,QAAI,CAACA,KAAI,QAAQ;AACf,WAAK,SAAS;AACd,aAAO,KAAK;IACd;AACA,UAAM,UAAU,KAAK;AAErB,UAAM,UACJ,QAAQ,aAAaJ,QACnB,QAAQ,MAAM,aACd;AACJ,UAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAA,CAAE;AAQjD,QAAIc,MAAKV,KACN,IAAI,aAAU;AACb,YAAM,KAAmC,QAAQ,IAAI,OAAI;AACvD,YAAI,aAAa,QAAQ;AACvB,qBAAW,KAAK,EAAE,MAAM,MAAM,EAAE;AAAG,kBAAM,IAAI,CAAC;QAChD;AACA,eACE,OAAO,MAAM,WAAWF,cAAa,CAAC,IACpC,MAAM,WAAW,WACjB,EAAE;MAER,CAAC;AACD,SAAG,QAAQ,CAAC,GAAG,MAAK;AAClB,cAAM,OAAO,GAAG,IAAI,CAAC;AACrB,cAAM,OAAO,GAAG,IAAI,CAAC;AACrB,YAAI,MAAM,YAAY,SAAS,UAAU;AACvC;QACF;AACA,YAAI,SAAS,QAAW;AACtB,cAAI,SAAS,UAAa,SAAS,UAAU;AAC3C,eAAG,IAAI,CAAC,IAAI,YAAY,UAAU,UAAU;UAC9C,OAAO;AACL,eAAG,CAAC,IAAI;UACV;QACF,WAAW,SAAS,QAAW;AAC7B,aAAG,IAAI,CAAC,IAAI,OAAO,eAAe,UAAU;QAC9C,WAAW,SAAS,UAAU;AAC5B,aAAG,IAAI,CAAC,IAAI,OAAO,eAAe,UAAU,SAAS;AACrD,aAAG,IAAI,CAAC,IAAI;QACd;MACF,CAAC;AACD,YAAM,WAAW,GAAG,OAAO,OAAK,MAAM,QAAQ;AAK9C,UAAI,KAAK,WAAW,SAAS,UAAU,GAAG;AACxC,cAAM,WAAqB,CAAA;AAC3B,iBAAS,IAAI,GAAG,KAAK,SAAS,QAAQ,KAAK;AACzC,mBAAS,KAAK,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;QAC9C;AACA,eAAO,QAAQ,SAAS,KAAK,GAAG,IAAI;MACtC;AAEA,aAAO,SAAS,KAAK,GAAG;IAC1B,CAAC,EACA,KAAK,GAAG;AAIX,UAAM,CAAC,MAAM,KAAK,IAAIE,KAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAG7D,IAAAU,MAAK,MAAM,OAAOA,MAAK,QAAQ;AAG/B,QAAI,KAAK,SAAS;AAChB,MAAAA,MAAK,aAAa,OAAOA,IAAG,MAAM,GAAG,EAAE,IAAI,QAAQ;IACrD;AAGA,QAAI,KAAK;AAAQ,MAAAA,MAAK,SAASA,MAAK;AAEpC,QAAI;AACF,WAAK,SAAS,IAAI,OAAOA,KAAI,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC;IAElD,SAAS,IAAI;AAEX,WAAK,SAAS;IAChB;AAEA,WAAO,KAAK;EACd;EAEA,WAAW,GAAS;AAKlB,QAAI,KAAK,yBAAyB;AAChC,aAAO,EAAE,MAAM,GAAG;IACpB,WAAW,KAAK,aAAa,cAAc,KAAK,CAAC,GAAG;AAElD,aAAO,CAAC,IAAI,GAAG,EAAE,MAAM,KAAK,CAAC;IAC/B,OAAO;AACL,aAAO,EAAE,MAAM,KAAK;IACtB;EACF;EAEA,MAAM,GAAW,UAAU,KAAK,SAAO;AACrC,SAAK,MAAM,SAAS,GAAG,KAAK,OAAO;AAGnC,QAAI,KAAK,SAAS;AAChB,aAAO;IACT;AACA,QAAI,KAAK,OAAO;AACd,aAAO,MAAM;IACf;AAEA,QAAI,MAAM,OAAO,SAAS;AACxB,aAAO;IACT;AAEA,UAAM,UAAU,KAAK;AAGrB,QAAI,KAAK,WAAW;AAClB,UAAI,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG;IAC5B;AAGA,UAAM,KAAK,KAAK,WAAW,CAAC;AAC5B,SAAK,MAAM,KAAK,SAAS,SAAS,EAAE;AAOpC,UAAMV,OAAM,KAAK;AACjB,SAAK,MAAM,KAAK,SAAS,OAAOA,IAAG;AAGnC,QAAI,WAAmB,GAAG,GAAG,SAAS,CAAC;AACvC,QAAI,CAAC,UAAU;AACb,eAAS,IAAI,GAAG,SAAS,GAAG,CAAC,YAAY,KAAK,GAAG,KAAK;AACpD,mBAAW,GAAG,CAAC;MACjB;IACF;AAEA,aAAS,IAAI,GAAG,IAAIA,KAAI,QAAQ,KAAK;AACnC,YAAM,UAAUA,KAAI,CAAC;AACrB,UAAI,OAAO;AACX,UAAI,QAAQ,aAAa,QAAQ,WAAW,GAAG;AAC7C,eAAO,CAAC,QAAQ;MAClB;AACA,YAAM,MAAM,KAAK,SAAS,MAAM,SAAS,OAAO;AAChD,UAAI,KAAK;AACP,YAAI,QAAQ,YAAY;AACtB,iBAAO;QACT;AACA,eAAO,CAAC,KAAK;MACf;IACF;AAIA,QAAI,QAAQ,YAAY;AACtB,aAAO;IACT;AACA,WAAO,KAAK;EACd;EAEA,OAAO,SAAS,KAAqB;AACnC,WAAO,UAAU,SAAS,GAAG,EAAE;EACjC;;AAOF,UAAU,MAAM;AAChB,UAAU,YAAY;AACtB,UAAU,SAAS;AACnB,UAAU,WAAW;;;ATr7CrB,IAAM,gCAAgC;AAAA,EACpC;AAAA,EACA;AACF;AAMA,IAAM,gBAAgB,oBAAI,IAAsB;AAuBzC,SAAS,qBAAqBW,aAAwC;AAC3E,QAAM,gBAAgB,QAAQ,IAAI;AAClC,MAAI,eAAe;AACjB,UAAM,mBAAe,sBAAQA,WAAU;AACvC,UAAM,eAAW,sBAAQ,cAAc,aAAa;AACpD,UAAM,UAAM,uBAAS,cAAc,QAAQ;AAC3C,QAAI,IAAI,WAAW,IAAI,SAAK,sBAAQ,cAAc,GAAG,MAAM,UAAU;AACnE;AAAA,QACE;AAAA,QACA,uBAAuB,aAAa;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AACA,YAAI,uBAAW,QAAQ,GAAG;AACxB,sBAAgB,QAAQ,qDAAqD,QAAQ,EAAE;AACvF,aAAO;AAAA,IACT;AACA;AAAA,MACE;AAAA,MACA,iCAAiC,aAAa,6BAA6B,QAAQ;AAAA,IACrF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,cAAc,+BAA+B;AACtD,UAAM,eAAW,mBAAKA,aAAY,UAAU;AAC5C,YAAI,uBAAW,QAAQ,GAAG;AACxB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,uBAAuBA,aAA8B;AACnE,QAAM,SAAS,cAAc,IAAIA,WAAU;AAC3C,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,qBAAqBA,WAAU;AAClD,MAAI,CAAC,YAAY;AACf,kBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,WAAO,CAAC;AAAA,EACV;AAEA,MAAI;AACF,UAAM,cAAU,yBAAa,YAAY,MAAM;AAC/C,UAAM,SAAS,KAAS,OAAO;AAE/B,QAAI,CAAC,UAAU,CAAC,MAAM,QAAQ,OAAO,cAAc,CAAC,GAAG;AACrD,oBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,WAAW,OAAO,cAAc,EAAE;AAAA,MACtC,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS;AAAA,IAC1D;AAEA,QAAI,SAAS,SAAS,GAAG;AACvB;AAAA,QACE;AAAA,QACA,SAAS,SAAS,MAAM,+BAA+B,UAAU,KAAK,SAAS,KAAK,IAAI,CAAC;AAAA,MAC3F;AAAA,IACF;AAEA,kBAAc,IAAIA,aAAY,QAAQ;AACtC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,wCAAwC,UAAU,KAAK,OAAO,KAAK,CAAC,EAAE;AAC9F,kBAAc,IAAIA,aAAY,CAAC,CAAC;AAChC,WAAO,CAAC;AAAA,EACV;AACF;AAeO,SAAS,iBAAiB,cAAsB,UAA6B;AAClF,QAAM,eAAe,EAAE,KAAK,MAAM,sBAAsB,KAAK;AAE7D,aAAW,OAAO,UAAU;AAE1B,UAAM,UAAU,IAAI,QAAQ,QAAQ,EAAE;AAGtC,QAAI,UAAU,cAAc,SAAS,YAAY,GAAG;AAClD,aAAO;AAAA,IACT;AAIA,QAAI,UAAU,cAAc,GAAG,OAAO,OAAO,YAAY,GAAG;AAC1D,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAUO,SAAS,mBAAmB,eAAyB,UAA8B;AACxF,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,EACT;AACA,SAAO,cAAc,OAAO,OAAK,CAAC,iBAAiB,GAAG,QAAQ,CAAC;AACjE;;;ADxIO,SAAS,kBAAgC;AAC9C,QAAM,iBAAqB,oBAAS;AACpC,QAAM,qBAAyB,gBAAK;AACpC,QAAM,YAAY,eAAe;AACjC,QAAM,eAAe,YAAY,SAAS;AAE1C,SAAO;AAAA,IACL,UAAU;AAAA,IACV,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,gBAAwB;AACtC,SAAO,gBAAgB,EAAE,YAAY,YAAY;AACnD;AASO,SAAS,gBAAwB;AACtC,SAAO,gBAAgB,EAAE,YAAY,YAAY;AACnD;AAOO,SAAS,mBAA2B;AACzC,QAAMC,gBAAe,gBAAgB;AACrC,QAAM,gBAAwBA,cAAa,YAAY,eAAe;AAGtE,QAAM,aAAa,QAAQ,IAAI;AAC/B,MAAI,YAAY;AACd,UAAM,yBAAqB,0BAAQ,mBAAK,YAAY,aAAa,CAAC;AAClE,YAAI,uBAAW,kBAAkB,GAAG;AAClC,sBAAgB,QAAQ,6CAA6C,kBAAkB,EAAE;AACzF,aAAO;AAAA,IACT,OAAO;AACL;AAAA,QACE;AAAA,QACA,0BAA0B,UAAU,8CAA8C,kBAAkB;AAAA,MACtG;AAAA,IAEF;AAAA,EACF;AAGA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,MAAI;AACF,UAAM,oBAAgB,oCAAa,eAAe,CAAC,WAAW,eAAe,GAAG;AAAA,MAC9E,UAAU;AAAA,MACV,SAAS;AAAA;AAAA,MACT,OAAO;AAAA;AAAA,IACT,CAAC;AAOD,QAAI;AACF,YAAM,cAAc,KAAK,MAAM,aAAa;AAE5C,UACE,eACA,OAAO,YAAY,qBAAqB,YACxC,YAAY,kBACZ;AACA,cAAM,8BAA0B,0BAAQ,mBAAK,YAAY,kBAAkB,aAAa,CAAC;AACzF,gBAAI,uBAAW,uBAAuB,GAAG;AACvC;AAAA,YACE;AAAA,YACA,kEAAkE,uBAAuB;AAAA,UAC3F;AACA,iBAAO;AAAA,QACT;AACA;AAAA,UACE;AAAA,UACA,6DAA6D,YAAY,gBAAgB,mCAAmC,uBAAuB;AAAA,QACrJ;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,YAAY;AACnB;AAAA,QACE;AAAA,QACA,0DAA0D,OAAO,UAAU,CAAC,iBAAiB,aAAa;AAAA,MAC5G;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,eAAe,qFAAqF,OAAO,KAAK,CAAC;AACrH,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,SAAS,MAAM,SAAS,UAAU;AACpF,sBAAgB;AAAA,qBAAwB,aAAa;AAAA,IACvD;AACA,oBAAgB,QAAQ,YAAY;AAAA,EACtC;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,2BAA2BC,gBAA+B;AACxE,MAAI,kBAAkB,QAAQ,IAAI,oCAAoC;AAEtE,MAAI,iBAAiB;AACnB;AAAA,MACE;AAAA,MACA,+FAA+F,eAAe;AAAA,IAChH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,CAACA,gBAAe;AAClB;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,MAAI;AACF,0BAAkB;AAAA,MAChBA;AAAA,MACA,CAAC,WAAW,aAAa,uBAAuB;AAAA,MAChD,EAAE,OAAO,OAAO;AAAA;AAAA,IAClB,EACG,SAAS,EACT,KAAK;AACR,QAAI,iBAAiB;AACnB,sBAAgB,QAAQ,0CAA0C,eAAe,EAAE;AAAA,IACrF,OAAO;AACL;AAAA,QACE;AAAA,QACA,2DAA2DA,cAAa;AAAA,MAC1E;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd;AAAA,MACE;AAAA,MACA,oDAAoDA,cAAa,MAAM,OAAO,KAAK,CAAC;AAAA,IACtF;AACA,sBAAkB;AAAA,EACpB;AACA,SAAO;AACT;AAKO,SAAS,8BAAoC;AAClD,UAAQ,IAAI,2CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,6CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,sCAAsC,QAAQ,IAAI;AAC9D,UAAQ,IAAI,0CACV,QAAQ,IAAI;AACd,UAAQ,IAAI,uCAAuC,QAAQ,IAAI;AAC/D,UAAQ,IAAI,iDACV,QAAQ,IAAI;AAChB;AAOO,SAAS,uBAAuB,iBAAiC;AACtE,MAAI,CAAC,gBAAiB,QAAO;AAC7B,QAAMD,gBAAe,gBAAgB;AACrC,QAAM,sBAA8BA,cAAa,YAAY,kBAAkB;AAC/E,aAAO,0BAAQ,mBAAK,iBAAiB,SAAS,mBAAmB,CAAC;AACpE;AAKO,SAAS,4BAAkC;AAChD,MAAI,iBAAiB;AAErB,MAAI,QAAQ,IAAI,oBAAoB;AAClC;AAAA,MACE;AAAA,MACA;AAAA,EACJ,QAAQ,IAAI,kBAAkB;AAAA,IAC5B;AAGA,UAAM,yBAAyB,CAAC,gBAAgB,gBAAgB;AAEhE,qBACE,OACA,QAAQ,IAAI,mBAAmB,MAAM,IAAI,EACtC;AAAA,MACC,UACE,KAAK,WAAW,SAAS,KACzB,CAAC,uBAAuB,KAAK,aAAW,KAAK,SAAS,OAAO,CAAC;AAAA,IAClE,EACC,KAAK,IAAI;AAAA,EAChB;AASA,QAAM,2BAA2B;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,0BAA0B;AAAA,IACxC;AAAA,EACF,EAAE,KAAK,IAAI;AAEX,UAAQ,IAAI,qBAAqB,2BAA2B;AAC5D,UAAQ,IAAI,wBAAwB;AAEpC,UAAQ,IAAI,uBAAuB;AACrC;AAUO,SAAS,8BAA8BE,aAA0B;AACtE,QAAM,WAAW,uBAAuBA,WAAU;AAClD,MAAI,SAAS,WAAW,GAAG;AACzB;AAAA,EACF;AAEA,QAAM,eAAe,SAAS,IAAI,OAAK,WAAW,CAAC,EAAE,EAAE,KAAK,IAAI;AAChE,QAAM,UAAU,QAAQ,IAAI,sBAAsB;AAClD,UAAQ,IAAI,qBAAqB,UAAU,OAAO;AAElD;AAAA,IACE;AAAA,IACA,WAAW,SAAS,MAAM;AAAA,EAC5B;AACF;AAeO,SAAS,4BAA4BA,aAA4C;AACtF,QAAMC,iBAA0B,CAAC;AACjC,QAAMH,gBAAe,gBAAgB;AAGrC,QAAMC,iBAAgB,iBAAiB;AACvC,MAAI,CAACA,gBAAe;AAClB,IAAAE,eAAc;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAGA,MAAI,CAAC,UAAUD,WAAU,GAAG;AAC1B,IAAAC,eAAc,KAAK,2BAA2BD,WAAU,mBAAmB;AAAA,EAC7E;AAGA,QAAM,kBAAkB,2BAA2BD,cAAa;AAChE,MAAI,CAAC,iBAAiB;AACpB,QAAIA,gBAAe;AAEjB,MAAAE,eAAc;AAAA,QACZ;AAAA,MACF;AAAA,IACF,OAAO;AAGL,MAAAA,eAAc;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,iBAAiB;AACnB,YAAQ,IAAI,mCAAmC;AAC/C,gCAA4B;AAAA,EAC9B;AAGA,QAAMC,uBAAsB,kBAAkB,uBAAuB,eAAe,IAAI;AAIxF,SAAO;AAAA,IACL,SAASD,eAAc,WAAW;AAAA,IAClC,eAAAA;AAAA,IACA,eAAAF;AAAA;AAAA,IACA;AAAA;AAAA,IACA,qBAAAG;AAAA,IACA,cAAAJ;AAAA,EACF;AACF;;;AFpWA,SAAS,qBAAqB,eAAmE;AAC/F,QAAM,QAAQ,cAAc,KAAK,EAAE,MAAM,KAAK;AAC9C,QAAM,aAAa,MAAM,CAAC;AAC1B,QAAM,WAAW,MAAM,MAAM,CAAC;AAC9B,SAAO,EAAE,YAAY,SAAS;AAChC;AAQA,SAAS,4BAA4B,SAA0BK,aAA8B;AAC3F,QAAM,0BAAsB,mBAAKA,aAAY,QAAQ,UAAU;AAG/D,QAAM,eAAe,QAAQ,SAC1B,OAAO,cAAQ,0BAAQ,mBAAKA,aAAY,IAAI,CAAC,MAAM,mBAAmB,EACtE,IAAI,cAAQ,uBAAS,IAAI,CAAC;AAE7B,MAAI,aAAa,SAAS,WAAW,GAAG;AAEtC,WAAO,CAAC,WAAW;AAAA,EACrB;AAGA,QAAM,iBAAiB,CAAC,MAAM,OAAO,KAAK;AAC1C,QAAM,kBAAkB,eAAe,OAAO,SAAO,cAAU,mBAAK,qBAAqB,GAAG,CAAC,CAAC;AAE9F,MAAI,gBAAgB,SAAS,GAAG;AAE9B,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,SAAS,GAAG;AAE3B,WAAO;AAAA,EACT;AAGA,SAAO,QAAQ,SAAS,IAAI,cAAQ,uBAAS,yBAAqB,mBAAKA,aAAY,IAAI,CAAC,CAAC;AAC3F;AAqBO,SAAS,iBACd,aACAA,aACA,YACA,UACA,YACA,YACsB;AACtB,MAAI;AACF,UAAM,0BAAsB,sBAAQ,WAAW;AAC/C,QAAI,CAAC,WAAW,mBAAmB,GAAG;AACpC,YAAM,IAAI,MAAM,sBAAsB,mBAAmB,mBAAmB;AAAA,IAC9E;AAGA,UAAM,aAAa,cAAc,YAAY,QAAQ;AACrD,UAAM,cAAc,aAAa,aAAa,UAAU,KAAK;AAG7D,UAAM,qBAAiB,mBAAKA,aAAY,UAAU;AAGlD,UAAM,eAAe,mBAAmB,gBAAgB,YAAY,QAAQ;AAG5E,QAAI,CAAC,cAAc,CAAC,cAAc,CAAC,WAAW,IAAI,UAAU,GAAG;AAC7D,YAAM,IAAI;AAAA,QACR,sBAAsB,UAAU;AAAA,MAClC;AAAA,IACF;AAEA,UAAM,UAAU,WAAW,IAAI,UAAU;AAGzC,WAAO,eAAeA,aAAY,YAAY,YAAY,cAAc,aAAa,OAAQ;AAAA,EAC/F,SAAS,OAAO;AACd,WAAO,EAAE,SAAS,OAAO,SAAS,OAAO,KAAK,EAAE;AAAA,EAClD;AACF;AAcA,SAAS,eACPA,aACA,YACA,YACA,cACA,aACA,SACsB;AACtB,kBAAgB,QAAQ,0BAA0B,UAAU,WAAW,WAAW,KAAK;AAGvF,QAAM,qBAAqB,4BAA4B,SAASA,WAAU;AAE1E,MAAI,mBAAmB,WAAW,GAAG;AACnC,UAAM,IAAI;AAAA,MACR,sBAAsB,UAAU;AAAA,IAClC;AAAA,EACF;AAEA,QAAM,yBAAqB,mBAAKA,aAAY,YAAY,gBAAgB;AAExE,QAAM,cAAc;AAAA,IAClB;AAAA,IACA,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,kBAAgB,QAAQ,kCAAkC,mBAAmB,KAAK,IAAI,CAAC,EAAE;AACzF;AAAA,IACE;AAAA,IACA,6CAA6C,UAAU,eAAe,UAAU,WAAW,KAAK,UAAU,WAAW,CAAC;AAAA,EACxH;AAGA,QAAM,EAAE,YAAY,SAAS,IAAI,qBAAqB,UAAU;AAChE,QAAM,UAAU,CAAC,GAAG,UAAU,GAAG,WAAW;AAE5C,QAAM,aAAS,iCAAU,YAAY,SAAS,YAAY;AAE1D,MAAI,OAAO,OAAO;AAChB,oBAAgB,SAAS,oBAAoB,OAAO,MAAM,OAAO,EAAE;AACnE,UAAM,IAAI,MAAM,iCAAiC,OAAO,MAAM,OAAO,EAAE;AAAA,EACzE;AAGA,MAAI,OAAO,UAAU,OAAO,OAAO,SAAS,GAAG;AAC7C,oBAAgB,QAAQ,sBAAsB,OAAO,OAAO,SAAS,CAAC,EAAE;AAAA,EAC1E;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,oBAAgB,SAAS,kCAAkC,OAAO,MAAM,EAAE;AAC1E;AAAA,MACE;AAAA,MACA,YAAY,UAAU,IAAI,YAAY,IAAI,SAAQ,IAAI,SAAS,GAAG,IAAI,IAAI,GAAG,MAAM,GAAI,EAAE,KAAK,GAAG,CAAC;AAAA,IACpG;AACA,oBAAgB,SAAS,WAAW,OAAO,QAAQ,SAAS,KAAK,WAAW,EAAE;AAC9E,oBAAgB,SAAS,WAAW,OAAO,QAAQ,SAAS,KAAK,WAAW,EAAE;AAC9E,UAAM,IAAI;AAAA,MACR,qCAAqC,UAAU;AAAA;AAAA;AAAA,EAC7C,OAAO,QAAQ,SAAS,KAAK,eAC/B;AAAA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,WAAW,kBAAkB,KAAK,CAAC,UAAU,kBAAkB,GAAG;AACrE,UAAM,IAAI;AAAA,MACR,gBAAgB,UAAU;AAAA,IAC5B;AAAA,EACF;AAGA,MAAI,UAAU,kBAAkB,GAAG;AACjC;AAAA,MACE;AAAA,MACA,oDAAoD,kBAAkB;AAAA,IACxE;AAEA,+BAA2B,kBAAkB;AAAA,EAC/C,OAAO;AACL,oBAAgB,QAAQ,wCAAwC,kBAAkB,EAAE;AAAA,EACtF;AAKA,+BAA6B,kBAAkB;AAE/C,SAAO;AAAA,IACL,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,mBAAmB;AAAA,IACnB,SAAS;AAAA,EACX;AACF;AAWA,SAAS,mBACP,gBACA,YACA,UACkB;AAGlB,QAAM,gBAAgB,eAAe,gBAAG,OAAO,gBAAG;AAClD,QAAM,eAAe;AACrB,QAAM,iBAAiB,WAAW,SAAS,aAAa,KAAK,WAAW,SAAS,YAAY;AAI7F,QAAM,WAAW,gBAAgB,EAAE,aAAa,CAAC;AAEjD,QAAM,eAAiC;AAAA,IACrC,KAAK;AAAA;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK,EAAE,GAAG,QAAQ,IAAI;AAAA,EACxB;AAGA,MAAI,YAAY,CAAC,gBAAgB;AAC/B,UAAM,eAAW,mBAAK,UAAU,cAAc;AAG9C,iBAAa,MAAM;AAAA,MACjB,GAAG,QAAQ;AAAA,MACX,WAAW,GAAG,QAAQ,GAAG,sBAAS,GAAG,QAAQ,IAAI,aAAa,EAAE;AAAA,MAChE,MAAM,OAAG,mBAAK,UAAU,MAAM,CAAC,GAAG,sBAAS,GAAG,QAAQ,IAAI,IAAI;AAAA;AAAA,MAE9D,mBAAmB;AAAA;AAAA,MAEnB,mBAAmB;AAAA;AAAA,MAEnB,UAAU;AAAA,IACZ;AAAA,EACF,WAAW,gBAAgB;AAGzB,UAAM,WAAW,EAAE,GAAG,QAAQ,IAAI;AAClC,WAAO,SAAS;AAChB,WAAO,SAAS;AAChB,WAAO,SAAS;AAChB,WAAO,SAAS;AAEhB,iBAAa,MAAM;AAAA,EACrB;AAEA,SAAO;AACT;;;AavSA,IAAAC,gBAAqB;;;ACArB,IAAAC,aAA6B;AAC7B,IAAAC,eAAiC;AAiB1B,SAAS,4BACdC,kBACgC;AAChC,QAAM,sBAAsB,oBAAI,IAA+B;AAE/D,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,UAAM,cAAiC,CAAC;AAExC,eAAW,QAAQ,QAAQ,kBAAkB;AAE3C,UAAI,KAAK,WAAW,gBAAgB;AAClC;AAAA,MACF;AAGA,YAAMC,oBAAmB,oBAAoB,MAAMD,iBAAgB,aAAa;AAEhF,UAAI,CAACC,kBAAiB,SAAS;AAC7B,oBAAY,KAAK,IAAI;AACrB;AAAA,UACE;AAAA,UACA,QAAQ,KAAK,EAAE,oBAAoBA,kBAAiB,cAAc,IAAIA,kBAAiB,iBAAiB,gCAAgC,KAAK,MAAM;AAAA,QACrJ;AAGA,YAAI,KAAK,WAAW,WAAW;AAC7B;AAAA,YACE;AAAA,YACA,QAAQ,KAAK,EAAE;AAAA,UACjB;AACA,eAAK,SAAS;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,0BAAoB,IAAI,YAAY,WAAW;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,oBAAoB,OAAO,GAAG;AAChC,UAAM,mBAAmB,MAAM,KAAK,oBAAoB,OAAO,CAAC,EAAE;AAAA,MAChE,CAAC,KAAK,UAAU,MAAM,MAAM;AAAA,MAC5B;AAAA,IACF;AACA;AAAA,MACE;AAAA,MACA,cAAc,gBAAgB,mCAAmC,oBAAoB,IAAI;AAAA,IAC3F;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,+BACdD,kBACA,eAC8B;AAC9B,MAAI,kBAAkB;AACtB,MAAI,cAAc;AAClB,MAAI,2BAA2B;AAG/B,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAC3C,YAAMC,oBAAmB,oBAAoB,MAAM,aAAa;AAChE,YAAM,UAAUA,kBAAiB;AAEjC,UAAI,SAAS;AACX,aAAK,SAAS;AACd;AAGA,YAAI,KAAK,WAAW,gBAAgB;AAClC;AAAA,QACF;AAAA,MACF,OAAO;AACL,aAAK,SAAS;AACd;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,EAAAD,iBAAgB,cAAc,yBAAyB;AACvD,EAAAA,iBAAgB,cAAc,qBAAqB;AAGnD,EAAAA,iBAAgB,YAAY,gCAAgC;AAC5D,EAAAA,iBAAgB,YAAY,2BAA2B;AAEvD,SAAO;AAAA,IACL,gBAAgB,kBAAkB;AAAA,IAClC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMO,SAAS,mBAAmB,UAA8C;AAC/E,QAAM,SAAqC;AAAA,IACzC,SAAS;AAAA,IACT;AAAA,IACA,QAAQ;AAAA,EACV;AAGA,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO,QAAQ;AACf,WAAO;AAAA,EACT;AAEA,SAAO,SAAS;AAGhB,MAAI,SAAS,SAAS,WAAW,KAAK,SAAS,SAAS,OAAO,GAAG;AAChE,QAAI;AACF,YAAM,cAAU,yBAAa,UAAU,MAAM;AAG7C,UAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,eAAO,QAAQ;AACf,eAAO;AAAA,MACT;AAGA,YAAM,SAAkB,KAAK,MAAM,OAAO;AAG1C,UAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,eAAO,QAAQ;AACf,eAAO;AAAA,MACT;AAEA,aAAO,eAAe;AACtB,aAAO,UAAU;AAAA,IACnB,SAAS,OAAO;AACd,aAAO,QAAQ,yBAAyB,OAAO,KAAK,CAAC;AACrD,aAAO;AAAA,IACT;AAAA,EACF,OAAO;AAEL,WAAO,UAAU;AAAA,EACnB;AAEA,SAAO;AACT;AAQO,SAAS,oBACd,MACAE,aACsB;AACtB,QAAM,cAA4C,CAAC;AAGnD,QAAM,iBAAiB,KAAK;AAC5B,QAAM,mBAAe,yBAAW,cAAc,IAC1C,qBACA,mBAAKA,aAAY,cAAc;AAEnC,QAAM,aAAa,mBAAmB,YAAY;AAClD,cAAY,KAAK,UAAU;AAE3B,QAAM,iBAAiB,YAAY,OAAO,OAAK,EAAE,OAAO,EAAE;AAC1D,QAAM,oBAAoB;AAC1B,QAAM,UAAU,mBAAmB,qBAAqB,oBAAoB;AAE5E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AChNA,IAAAC,wBAA6B;AAC7B,IAAAC,eAA8C;AAoBvC,SAAS,sBAAsB,UAAkBC,aAA4B;AAElF,MAAI,CAAC,YAAY,OAAO,aAAa,YAAY,CAACA,eAAc,OAAOA,gBAAe,UAAU;AAC9F,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,yBAAqB,sBAAQA,WAAU;AAI7C,UAAM,uBAAmB,yBAAW,QAAQ,QACxC,sBAAQ,QAAQ,QAChB,sBAAQ,oBAAoB,QAAQ;AAGxC,QAAI,qBAAqB,oBAAoB;AAC3C,aAAO;AAAA,IACT;AAEA,UAAM,mBAAe,uBAAS,oBAAoB,gBAAgB;AAIlE,QAAI,aAAa,WAAW,IAAI,GAAG;AACjC,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,QAAQ;AAEN,WAAO;AAAA,EACT;AACF;AAcA,SAAS,cACP,UACA,SACAC,gBACA,UACA,YACA,UACA,WACAD,aACS;AACT,QAAM,gBAAgBA,cAClB,sBAAsB,UAAUA,WAAU,QAC1C,sBAAQ,QAAQ;AAIpB,MAAI,eAAe;AACnB,MAAIA,eAAc,kBAAkB,OAAO,aAAaA,aAAY;AAClE,UAAM,yBAAqB,sBAAQA,WAAU;AAE7C,UAAM,uBAAmB,yBAAW,QAAQ,QACxC,sBAAQ,QAAQ,QAChB,sBAAQ,oBAAoB,QAAQ;AAGxC,QAAI,qBAAqB,oBAAoB;AAC3C,qBAAe,GAAG,OAAO;AAAA;AAAA,uBAA4B,QAAQ;AAAA,IAC/D;AAAA,EACF;AAEA,MAAI;AACF,4CAAaC,gBAAe;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe,QAAQ;AAAA,MACvB,iBAAiB,UAAU;AAAA,MAC3B,cAAc,QAAQ;AAAA,MACtB,sBAAsB,YAAY;AAAA,MAClC,eAAe,aAAa;AAAA,MAC5B;AAAA,MACA,GAAG,QAAQ,IAAI,qCAAqC,EAAE;AAAA,IACxD,CAAC;AACD,oBAAgB,QAAQ,SAAS,QAAQ,mBAAmB,SAAS,KAAK,QAAQ,EAAE;AACpF,WAAO;AAAA,EACT,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,iBAAiB,QAAQ,mBAAmB,SAAS,IAAI,QAAQ,MAAM,OAAO,GAAG,CAAC;AAAA,IACpF;AACA,WAAO;AAAA,EACT;AACF;AAUO,SAAS,wBACd,YACA,cACAA,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AAUO,SAAS,yBACd,aACA,cACAC,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,6BACdA,aACA,cACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,oCACdA,aACA,cACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,8BACdA,aACA,cACAC,gBACS;AAET,QAAM,cAAcD;AACpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AAUO,SAAS,iCACd,UACA,cACAC,gBACAD,aACS;AACT,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;AASO,SAAS,2BACdA,aACA,SACAC,gBACS;AACT,SAAO;AAAA,IACLD;AAAA,IACA;AAAA,IACAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAD;AAAA,EACF;AACF;;;ACzSA,IAAAE,wBAA6B;AAC7B,oBAA2B;AAC3B,IAAAC,aAAmE;AACnE,IAAAC,eAAuC;;;ACHvC,IAAAC,wBAAyB;AASzB,IAAM,yBAAyB,oBAAI,IAAsB;AAQzD,IAAM,aAAa;AAAA,EACjB,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,IAAI,UAAU;AACZ,UAAM,QAAQ,KAAK,OAAO,KAAK;AAC/B,WAAO,QAAQ,KAAM,KAAK,OAAO,QAAS,KAAK,QAAQ,CAAC,IAAI;AAAA,EAC9D;AACF;AAQO,SAAS,0BACd,YACA,cAIA;AAEA,MAAI,eAAe,YAAY,iBAAiB,UAAU;AACxD,WAAO,EAAE,cAAc,KAAK;AAAA,EAC9B;AAEA,QAAM,YAAY,qBAAqB,UAAU;AACjD,QAAM,cAAc,qBAAqB,YAAY;AAErD,MAAI,CAAC,aAAa,CAAC,aAAa;AAC9B,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS;AAAA,IACX;AAAA,EACF;AAIA,QAAM,qBAAqB,UAAU,UAAU,YAAY;AAC3D,QAAM,qBAAqB,UAAU,UAAU,YAAY;AAE3D,MAAI,CAAC,oBAAoB;AACvB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS,oCAAoC,UAAU,oBAAoB,YAAY;AAAA,IACzF;AAAA,EACF;AAEA,MAAI,CAAC,oBAAoB;AACvB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SAAS,sCAAsC,UAAU,oBAAoB,YAAY;AAAA,IAC3F;AAAA,EACF;AAEA,SAAO,EAAE,cAAc,KAAK;AAC9B;AAQO,SAAS,gBAAgB,GAAoB,GAA4B;AAC9E,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAG5C,MAAI,EAAE,cAAc,CAAC,EAAE,WAAY,QAAO;AAC1C,MAAI,CAAC,EAAE,cAAc,EAAE,WAAY,QAAO;AAC1C,MAAI,EAAE,cAAc,EAAE,YAAY;AAChC,WAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,EAChD;AAEA,SAAO;AACT;AAQO,SAAS,yBACd,mBACA,iBACe;AACf,QAAM,iBAAiB,kBACpB,IAAI,CAAAC,OAAK,qBAAqBA,EAAC,CAAC,EAChC,OAAO,CAACA,OAA4BA,OAAM,IAAI;AAEjD,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,EACT;AAGA,QAAM,qBAAqB,eAAe,OAAO,CAAAA,OAAK,eAAeA,IAAG,eAAe,CAAC;AAExF,MAAI,mBAAmB,SAAS,GAAG;AAEjC,uBAAmB,KAAK,CAAC,GAAG,MAAM,gBAAgB,GAAG,CAAC,CAAC;AACvD,WAAO,mBAAmB,CAAC,EAAE;AAAA,EAC/B;AAIA,iBAAe,KAAK,CAAC,GAAG,MAAM,gBAAgB,GAAG,CAAC,CAAC;AACnD,SAAO,eAAe,CAAC,EAAE;AAC3B;AAQO,SAAS,qBAAqB,aAA0C;AAE7E,MAAI,uBAAuB,IAAI,WAAW,GAAG;AAC3C,eAAW;AACX,WAAO,uBAAuB,IAAI,WAAW;AAAA,EAC/C;AAGA,aAAW;AACX,MAAI;AACF,UAAM,aAAS,gCAAS,YAAY,WAAW,oBAAoB;AAAA,MACjE,UAAU;AAAA,MACV,SAAS;AAAA;AAAA,IACX,CAAC;AAED,UAAM,WAAoB,KAAK,MAAM,MAAM;AAC3C,QAAI,eAAyB,CAAC;AAE9B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,qBAAe,SAAS,OAAO,CAACA,OAAmB,OAAOA,OAAM,QAAQ;AAAA,IAC1E,WAAW,OAAO,aAAa,UAAU;AACvC,qBAAe,CAAC,QAAQ;AAAA,IAC1B;AAGA,2BAAuB,IAAI,aAAa,YAAY;AAEpD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,gCAAgC,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE;AAEvF,2BAAuB,IAAI,aAAa,CAAC,CAAC;AAC1C,WAAO,CAAC;AAAA,EACV;AACF;AAyBO,SAAS,qBAAqB,SAAyC;AAC5E,MAAI,YAAY,UAAU;AAExB,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,UAAU;AAAA,IACZ;AAAA,EACF;AAGA,QAAM,eAAe,QAAQ,QAAQ,cAAc,EAAE;AAGrD,QAAM,cAAc;AACpB,QAAMC,SAAQ,aAAa,MAAM,WAAW;AAE5C,MAAI,CAACA,QAAO;AACV,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,OAAO,SAASA,OAAM,CAAC,GAAG,EAAE;AAAA,IAC5B,YAAYA,OAAM,CAAC;AAAA,IACnB,OAAOA,OAAM,CAAC;AAAA,IACd,UAAU;AAAA,EACZ;AACF;AAQA,SAAS,oBAAoB,iBAAyB,kBAAmC;AAEvF,MAAI,oBAAoB,oBAAoB,qBAAqB,UAAU;AACzE,WAAO;AAAA,EACT;AAEA,QAAM,iBAAiB,qBAAqB,eAAe;AAC3D,MAAI,CAAC,gBAAgB;AACnB,WAAO;AAAA,EACT;AAEA,SAAO,eAAe,gBAAgB,gBAAgB;AACxD;AAQO,SAASC,oBACd,YACA,cAQA;AACA,QAAM,cAAc,qBAAqB,UAAU;AACnD,QAAM,gBAAgB,qBAAqB,aAAa;AAExD,QAAM,qBAAqB,yBAAyB,aAAa,UAAU;AAC3E,QAAM,uBAAuB,yBAAyB,eAAe,YAAY;AAGjF,QAAM,gBACJ,uBAAuB,cAAe,eAAe,YAAY,uBAAuB;AAC1F,QAAM,kBACJ,yBAAyB,gBACxB,iBAAiB,YAAY,yBAAyB;AAGzD,QAAM,oBAAoB,qBACtB,oBAAoB,oBAAoB,UAAU,IAClD;AACJ,QAAM,sBAAsB,uBACxB,oBAAoB,sBAAsB,YAAY,IACtD;AAGJ,QAAM,aAAa,CAAC,qBAAqB,CAAC;AAE1C,MAAI;AAOJ,MAAI,sBAAsB,sBAAsB;AAC9C,UAAM,gBAAgB,0BAA0B,oBAAoB,oBAAoB;AAExF,UAAM,oBACJ,cACA,CAAC,iBACD,CAAC,mBACA,cAAc,WAAW,CAAC,cAAc;AAE3C,QAAI,cAAc,WAAW,mBAAmB;AAC9C,gBAAU,cAAc;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,eAAe,SAA0BC,QAAwB;AAC/E,MAAIA,WAAU,UAAU;AACtB,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,qBAAqBA,MAAK;AAC/C,MAAI,CAAC,cAAc;AACjB,WAAO;AAAA,EACT;AAEA,MAAIA,OAAM,WAAW,GAAG,GAAG;AAEzB,WAAO,QAAQ,UAAU,aAAa,SAAS,gBAAgB,SAAS,YAAY,KAAK;AAAA,EAC3F,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WACE,QAAQ,UAAU,aAAa,SAC/B,QAAQ,UAAU,aAAa,SAC/B,gBAAgB,SAAS,YAAY,KAAK;AAAA,EAE9C,WAAWA,OAAM,WAAW,IAAI,GAAG;AAEjC,WAAO,gBAAgB,SAAS,YAAY,KAAK;AAAA,EACnD,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,EAClD,WAAWA,OAAM,WAAW,IAAI,GAAG;AAEjC,WAAO,gBAAgB,SAAS,YAAY,KAAK;AAAA,EACnD,WAAWA,OAAM,WAAW,GAAG,GAAG;AAEhC,WAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,EAClD,OAAO;AAEL,WAAO,gBAAgB,SAAS,YAAY,MAAM;AAAA,EACpD;AACF;;;AD7VA,IAAM,kBAAkB;AASxB,SAAS,4BACP,iBACA,gBACAC,gBACS;AACT,MAAI;AACF,4CAAaA,gBAAe;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,qCAAwC;AAAA,MACxC,sBAAsB,cAAc;AAAA,MACpC,mBAAe,sBAAQ,eAAe,CAAC;AAAA,MACvC;AAAA,MACA,GAAG,QAAQ,IAAI,qCAAqC,EAAE;AAAA,IACxD,CAAC;AACD,oBAAgB,QAAQ,qDAAqD,eAAe,EAAE;AAC9F,WAAO;AAAA,EACT,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,wCAAwC,eAAe,KAAK,OAAO,GAAG,CAAC;AAAA,IACzE;AACA,WAAO;AAAA,EACT;AACF;AAWO,SAAS,iBAAiB,UAAsC;AACrE,MAAI,cAAU,sBAAQ,QAAQ;AAI9B,SAAO,MAAM;AACX,UAAM,gBAAY,mBAAK,SAAS,QAAQ;AACxC,YAAI,uBAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AACA,UAAM,aAAS,sBAAQ,OAAO;AAC9B,QAAI,WAAW,SAAS;AAEtB,aAAO;AAAA,IACT;AACA,cAAU;AAAA,EACZ;AACF;AAWO,SAAS,iBAAiB,UAAkB,YAA0B;AAC3E,QAAM,YAAY,iBAAiB,UAAU;AAC7C,MAAI,CAAC,WAAW;AACd;AAAA,EACF;AAEA,QAAM,WAAO,mBAAK,UAAU,QAAQ;AACpC,MAAI;AACF,iCAAa,WAAW,IAAI;AAC5B,oBAAgB,QAAQ,uBAAuB,SAAS,yBAAyB,QAAQ,GAAG;AAAA,EAC9F,SAAS,KAAK;AACZ;AAAA,MACE;AAAA,MACA,6CAA6C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IAC/F;AAAA,EACF;AACF;AASO,SAAS,yBACdC,kBACAC,aACAF,gBACqB;AAErB,MAAIC,iBAAgB,SAAS,SAAS,GAAG;AACvC,oBAAgB,QAAQ,oDAAoD;AAC5E;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO,oBAAI,IAAoB;AAAA,EACjC;AAGA,QAAM,yBAAyB,oCAAoCA,iBAAgB,QAAQ;AAE3F,MAAI,uBAAuB,WAAW,GAAG;AACvC;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AACA,WAAO,oBAAI,IAAoB;AAAA,EACjC;AAEA;AAAA,IACE;AAAA,IACA,SAAS,uBAAuB,MAAM;AAAA,EACxC;AAGA,aAAW,eAAe,wBAAwB;AAChD,UAAM,EAAE,YAAY,cAAc,MAAM,oBAAoB,sBAAsB,WAAW,IAC3F;AACF,UAAM,mBAAmB,sBAAsB;AAC/C,UAAM,qBAAqB,wBAAwB;AACnD,UAAM,eAAe,aAAa,+BAA+B;AACjE,UAAM,cAAc,YAAY,oBAC5B,sBAAsB,YAAY,iBAAiB,KACnD;AAEJ;AAAA,MACE;AAAA,MACA,0BAA0B,KAAK,UAAU,GAAG,CAAC,CAAC,cAAc,gBAAgB,iBAAiB,kBAAkB,GAAG,WAAW,GAAG,YAAY;AAAA,IAC9I;AAAA,EACF;AAGA,QAAM,mBAAe,mBAAKC,aAAY,eAAe;AACrD;AAAA,IACE;AAAA,IACA,0BAA0B,eAAe,mCAAmC,YAAY;AAAA,EAC1F;AAEA,MAAI,KAAC,uBAAW,YAAY,GAAG;AAC7B,QAAI;AACF,gCAAU,cAAc,EAAE,WAAW,KAAK,CAAC;AAC3C,sBAAgB,QAAQ,4BAA4B,YAAY,EAAE;AAAA,IACpE,SAAS,KAAK;AACZ;AAAA,QACE;AAAA,QACA,qCAAqC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACvF;AACA,sBAAgB,QAAQ,kEAAkE;AAC1F,aAAO,oBAAI,IAAoB;AAAA,IACjC;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,mCAAmC,YAAY,EAAE;AAAA,EAC3E;AAGA,QAAMC,sBAAqB,oBAAI,IAAoB;AACnD,MAAI,0BAA0B;AAG9B,aAAW,eAAe,wBAAwB;AAChD,UAAM,EAAE,YAAY,cAAc,KAAK,IAAI;AAC3C,UAAM,EAAE,oBAAoB,qBAAqB,IAAI;AACrD,UAAM,eAAe,OAAO,IAAI;AAChC,UAAM,eAAW,mBAAK,cAAc,YAAY;AAEhD;AAAA,MACE;AAAA,MACA,qCAAqC,KAAK,UAAU,GAAG,CAAC,CAAC,wBAAwB,YAAY;AAAA,IAC/F;AAGA,QAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,UAAI;AACF,kCAAU,UAAU,EAAE,WAAW,KAAK,CAAC;AACvC,wBAAgB,QAAQ,+BAA+B,YAAY,EAAE;AAAA,MACvE,SAAS,KAAK;AACZ;AAAA,UACE;AAAA,UACA,oDAAoD,KAAK,UAAU,GAAG,CAAC,CAAC,KAAK,YAAY,MACvF,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,QACF;AACA;AAAA,MACF;AAGA,YAAM,mBAAmB,sBAAsB;AAC/C,YAAM,qBAAqB,wBAAwB;AAEnD,YAAM,YAAoC;AAAA,QACxC,YAAY;AAAA,QACZ,eAAe;AAAA,MACjB;AASA,UAAI,YAAY,mBAAmB;AACjC,kBAAU,kBAAkB,IAAI,YAAY;AAC5C;AAAA,UACE;AAAA,UACA,8BAA8B,YAAY,iBAAiB,6BAA6B,KAAK,UAAU,GAAG,CAAC,CAAC;AAAA,QAC9G;AAAA,MACF;AAEA,YAAM,cAAc;AAAA,QAClB,MAAM,uBAAuB,IAAI;AAAA,QACjC,SAAS;AAAA,QACT,SAAS;AAAA,QACT,cAAc;AAAA,MAChB;AAEA,UAAI;AACF,0CAAc,mBAAK,UAAU,cAAc,GAAG,KAAK,UAAU,aAAa,MAAM,CAAC,CAAC;AAClF,wBAAgB,QAAQ,+CAA+C,YAAY,EAAE;AAAA,MACvF,SAAS,KAAK;AACZ;AAAA,UACE;AAAA,UACA,oDAAoD,YAAY,KAC9D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AAGA,UAAM,kBAAkB,MAAM,KAAKF,iBAAgB,SAAS,OAAO,CAAC,EACjE,IAAI,aAAW,QAAQ,UAAU,EACjC,KAAK,gBAAc,kBAAc,2BAAW,mBAAKC,aAAY,YAAY,QAAQ,CAAC,CAAC;AACtF,QAAI,iBAAiB;AACnB,uBAAiB,cAAU,mBAAKA,aAAY,eAAe,CAAC;AAAA,IAC9D;AAIA,UAAM,wBAAwB,MAAM,KAAKD,iBAAgB,SAAS,OAAO,CAAC,EAAE;AAAA,MAC1E,aAAW,QAAQ;AAAA,IACrB,GAAG;AACH,UAAM,kBAAkB,4BACpB,mBAAKC,aAAY,uBAAuB,cAAc,IACtD;AAEJ,UAAM,iBAAiB;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACAF;AAAA,IACF;AAEA,QAAI,CAAC,gBAAgB;AACnB;AAAA,QACE;AAAA,QACA,0CAA0C,KAAK,UAAU,GAAG,CAAC,CAAC,sBAAsB,YAAY;AAAA,MAClG;AACA;AAAA,IACF;AAEA;AAGA,eAAW,CAAC,YAAY,OAAO,KAAK,MAAM,KAAKC,iBAAgB,SAAS,QAAQ,CAAC,GAAG;AAClF,UAAI,CAAC,QAAQ,aAAa;AACxB;AAAA,MACF;AACA,YAAM,eAAe,QAAQ,YAAY,eAAe,UAAU,KAAK;AACvE,YAAM,iBAAiB,QAAQ,YAAY,kBAAkB,aAAa,KAAK;AAC/E,YAAM,sBACJ,QAAQ,YAAY,eAAe,kBAAkB,KACrD,QAAQ,YAAY,kBAAkB,kBAAkB,KACxD;AAGF,YAAM,0BAA0BG,oBAAmB,cAAc,cAAc;AAC/E,YAAM,0BAA0B,wBAAwB,sBAAsB;AAC9E,YAAM,4BACJ,wBAAwB,wBAAwB;AAGlD,YAAM,8BAA8B,YAAY,sBAAsB,YAAY;AAClF,YAAM,gCACJ,YAAY,wBAAwB,YAAY;AAElD,UACE,4BAA4B,+BAC5B,8BAA8B,iCAC9B,wBAAwB,YAAY,mBACpC;AACA,QAAAD,oBAAmB,IAAI,YAAY,QAAQ;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAGA,MAAI,4BAA4B,GAAG;AACjC,oBAAgB,SAAS,gDAAgD;AACzE,QAAI,uBAAuB,SAAS,GAAG;AACrC;AAAA,QACE;AAAA,QACA,OAAO,uBAAuB,MAAM;AAAA,MACtC;AAAA,IACF;AAAA,EACF,WAAW,0BAA0B,uBAAuB,QAAQ;AAClE;AAAA,MACE;AAAA,MACA,0BAA0B,uBAAuB,WAAW,uBAAuB,MAAM;AAAA,IAC3F;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,qDAAqD;AAAA,EAC/E;AAGA,MAAIA,oBAAmB,OAAO,GAAG;AAC/B,oBAAgB,QAAQ,sCAAsC;AAC9D,eAAW,CAAC,YAAY,QAAQ,KAAK,MAAM,KAAKA,oBAAmB,QAAQ,CAAC,GAAG;AAC7E,YAAM,mBAAe,mBAAK,QAAQ,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AACxD,sBAAgB,QAAQ,KAAK,UAAU,WAAM,YAAY,EAAE;AAAA,IAC7D;AAAA,EACF,OAAO;AACL;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,SAAOA;AACT;AAOA,SAAS,oCACP,UAC4B;AAC5B,QAAM,eAAe,oBAAI,IAAsC;AAE/D,aAAW,WAAW,MAAM,KAAK,SAAS,OAAO,CAAC,GAAG;AACnD,QAAI,CAAC,QAAQ,aAAa;AACxB;AAAA,IACF;AAEA,UAAM,aAAa,QAAQ,YAAY,eAAe,UAAU,KAAK;AACrE,UAAM,eAAe,QAAQ,YAAY,kBAAkB,aAAa,KAAK;AAG7E,UAAM,oBACJ,QAAQ,YAAY,eAAe,kBAAkB,KACrD,QAAQ,YAAY,kBAAkB,kBAAkB,KACxD;AAGF;AAAA,MACE;AAAA,MACA,wDAAwD,QAAQ,UAAU,kCAAkC,UAAU,iBAAiB,YAAY;AAAA,IACrJ;AACA,UAAM,mBAAmBC,oBAAmB,YAAY,YAAY;AACpE,UAAM,EAAE,oBAAoB,sBAAsB,GAAG,KAAK,IAAI;AAG9D,QAAI,sBAAsB,sBAAsB;AAC9C,UAAI;AACJ,UAAI,iBAAiB,iBAAiB,iBAAiB,iBAAiB;AACtE,oBAAY;AAAA,MACd,WAAW,CAAC,iBAAiB,YAAY;AACvC,oBAAY;AAAA,MACd,OAAO;AACL,oBAAY;AAAA,MACd;AACA;AAAA,QACE;AAAA,QACA,yBAAyB,kBAAkB,iBAAiB,oBAAoB,GAAG,SAAS;AAAA,MAC9F;AAAA,IACF,OAAO;AACL;AAAA,QACE;AAAA,QACA,gDAAgD,UAAU,iBAAiB,YAAY;AAAA,MACzF;AAAA,IACF;AAGA,UAAM,mBAAmB,sBAAsB;AAC/C,UAAM,qBAAqB,wBAAwB;AACnD,UAAM,YAAY,oBACd,GAAG,gBAAgB,IAAI,kBAAkB,IAAI,iBAAiB,KAC9D,GAAG,gBAAgB,IAAI,kBAAkB;AAC7C,UAAM,WAAO,0BAAW,QAAQ,EAAE,OAAO,SAAS,EAAE,OAAO,KAAK;AAEhE,QAAI,CAAC,aAAa,IAAI,IAAI,GAAG;AAC3B,mBAAa,IAAI,MAAM;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,oBAAoB,sBAAsB;AAAA,QAC1C,sBAAsB,wBAAwB;AAAA,QAC9C,GAAG;AAAA,MACL,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,aAAa,OAAO,CAAC;AACzC;AAWA,SAAS,2BACP,UACA,aACA,cACA,iBACAJ,gBACS;AACT,QAAM,EAAE,oBAAoB,sBAAsB,YAAY,QAAQ,IAAI;AAG1E,QAAM,wBACJ,2BAAW,mBAAK,UAAU,gBAAgB,QAAQ,KAAK,CAAC,SACxD,2BAAW,mBAAK,UAAU,gBAAgB,QAAQ,QAAQ,CAAC;AAE7D,MAAI,mBAAmB;AACrB;AAAA,MACE;AAAA,MACA,0CAA0C,kBAAkB,oBAAoB,oBAAoB,SAAS,YAAY;AAAA,IAC3H;AAGA,QAAI,cAAc,WAAW,mBAAmBA,gBAAe;AAC7D,kCAA4B,iBAAiB,SAASA,cAAa;AAAA,IACrE;AAEA,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,sBAAsB,CAAC,sBAAsB;AAChD,oBAAgB,SAAS,2DAA2D;AACpF,WAAO;AAAA,EACT;AAGA;AAAA,IACE;AAAA,IACA,uBAAuB,kBAAkB,oBAAoB,oBAAoB,wBAAwB,YAAY;AAAA,EACvH;AAEA,MAAI,cAAc,SAAS;AACzB,oBAAgB,QAAQ,OAAO;AAAA,EACjC;AAEA,MAAI;AACF,4CAAa,cAAc,GAAG,CAAC,WAAW,WAAW,cAAc,WAAW,GAAG;AAAA,MAC/E,KAAK;AAAA,MACL,OAAO;AAAA,IACT,CAAC;AAGD,QAAI,cAAc,WAAW,mBAAmBA,gBAAe;AAC7D,kCAA4B,iBAAiB,SAASA,cAAa;AAAA,IACrE;AAEA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,UAAM,eAAe,8DAA8D,QAAQ,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAChJ,oBAAgB,SAAS,YAAY;AACrC,WAAO;AAAA,EACT;AACF;;;AE/fA,IAAAK,wBAA6B;AAC7B,IAAAC,gBAAqB;AAcd,SAAS,gCAAgC,SAA8B;AAE5E,MAAI,QAAQ,aAAa,2BAA2B;AAClD,WAAO;AAAA,EACT;AAQA,QAAM,iBAAiB,QAAQ,iBAAiB;AAAA,IAC9C,UAAQ,KAAK,WAAW,YAAY,CAAC,KAAK,WAAW;AAAA,EACvD;AAEA,SAAO,kBAAkB,QAAQ,gBAAgB;AACnD;AAWO,SAAS,2BACd,SACAC,aACkC;AAClC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,kBAAc,oBAAKA,aAAY,QAAQ,UAAU;AAEvD,QAAM,SAA2C;AAAA,IAC/C,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,UAAU,CAAC;AAAA,IACX,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AAEA,MAAI;AAEF,QAAI,CAAC,QAAQ,aAAa;AACxB,aAAO,QAAQ;AACf,aAAO;AAAA,IACT;AAGA;AAAA,MACE;AAAA,MACA,4CAA4C,QAAQ,UAAU;AAAA,IAChE;AAEA,QAAI;AACF;AAAA,QACE,cAAc;AAAA,QACd,CAAC,WAAW,oBAAoB,WAAW,cAAc,WAAW;AAAA,QACpE;AAAA,UACE,KAAK;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA;AAAA,QACX;AAAA,MACF;AAEA,aAAO,UAAU;AACjB;AAAA,QACE;AAAA,QACA,wDAAwD,QAAQ,UAAU;AAAA,MAC5E;AAAA,IACF,SAAS,WAAW;AAClB,UAAI,qBAAqB,SAAS,YAAY,aAAa,UAAU,WAAW,WAAW;AACzF,eAAO,WAAW;AAClB,eAAO,QAAQ;AAAA,MACjB,OAAO;AACL,eAAO,QAAQ,uBAAuB,OAAO,SAAS,CAAC;AAAA,MACzD;AAGA,aAAO,SAAS;AAAA,QACd,4EAA4E,OAAO,KAAK;AAAA,MAC1F;AACA,sBAAgB,QAAQ,OAAO,SAAS,CAAC,CAAC;AAAA,IAC5C;AAAA,EACF,SAAS,OAAO;AACd,WAAO,QAAQ,wCAAwC,OAAO,KAAK,CAAC;AACpE,oBAAgB,SAAS,OAAO,KAAK;AAAA,EACvC,UAAE;AACA,WAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EACnC;AAEA,SAAO;AACT;;;AL9EA,SAAS,wCACPC,kBACAC,gBACAC,aACM;AACN,aAAW,WAAWF,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAE3C,UAAI,KAAK,WAAW,UAAU;AAI5B,cAAM,sBAAsB,KAAK,WAAW,kBAAkB,CAAC,KAAK;AAEpE,YAAI,qBAAqB;AAGvB,gBAAM,iBAAiB,QAAQ,kBAC3B,oBAAK,QAAQ,YAAY,cAAc,IACvC,QAAQ;AAEZ,gBAAM,YAAY,KAAK,YAAY;AACnC,gBAAM,WAAW,cAAc,IAAI,SAAS;AAC5C,gBAAM,cAAc,KAAK,gBAAgB;AACzC,gBAAM,mBAAmB,GAAG,WAAW;AAAA;AAAA,EAAO,SAAS,QAAQ,QAAQ,oBAAoB,cAAc,IAAI,QAAQ,MAAM;AAE3H,mCAAyB,gBAAgB,kBAAkBC,gBAAeC,WAAU;AAAA,QACtF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,yBACdF,kBACAC,gBACqC;AACrC,QAAM,YAAY,KAAK,IAAI;AAC3B,MAAI,kCAAkC;AACtC,MAAI,gCAAgC;AACpC,MAAI,4BAA4B;AAChC,MAAI,0BAA0B;AAE9B,QAAM,SAA8C;AAAA,IAClD,SAAS;AAAA,IACT,qBAAqB,CAAC;AAAA,IACtB,0BAA0B;AAAA,IAC1B,wBAAwB;AAAA,IACxB,oBAAoB;AAAA,IACpB,8CAA8C,CAAC;AAAA,IAC/C,0CAA0C,CAAC;AAAA,IAC3C,iBAAiB;AAAA,IACjB,kCAAkC;AAAA,IAClC,4BAA4B;AAAA,EAC9B;AAEA,MAAI;AAEF,oBAAgB,QAAQ,sCAAsC;AAC9D,UAAM,sBAAsB,4BAA4BD,gBAAe;AAEvE,QAAI,oBAAoB,SAAS,GAAG;AAClC,sBAAgB,QAAQ,sDAAsD;AAC9E,aAAO;AAAA,IACT;AAGA,WAAO,2BAA2B,MAAM,KAAK,oBAAoB,OAAO,CAAC,EAAE;AAAA,MACzE,CAAC,KAAK,UAAU,MAAM,MAAM;AAAA,MAC5B;AAAA,IACF;AACA,IAAAA,iBAAgB,YAAY,2BAA2B,OAAO;AAG9D,sCAAkC,KAAK,IAAI;AAC3C,eAAW,CAAC,YAAY,WAAW,KAAK,qBAAqB;AAC3D,YAAM,UAAUA,iBAAgB,SAAS,IAAI,UAAU;AACvD,UAAI,CAAC,SAAS;AACZ;AAAA,MACF;AAEA,UAAI,gCAAgC,OAAO,GAAG;AAC5C,YAAI;AACF,gBAAM,gBAAgB,2BAA2B,SAASA,iBAAgB,aAAa;AAGvF,kBAAQ,gBAAgB;AAAA,YACtB,2BAA2B;AAAA,YAC3B,qBAAqB,YAAY;AAAA,YACjC,cAAc;AAAA,YACd,oBAAoB,CAAC;AAAA,UACvB;AAEA,cAAI,cAAc,SAAS;AACzB,oBAAQ,YAAY,4BAA4B;AAChD,mBAAO,6CAA6C,KAAK,UAAU;AACnE,YAAAA,iBAAgB,YAAY,6BAA6B,IAAI,UAAU;AAAA,UACzE,OAAO;AACL,oBAAQ,YAAY,qBAAqB;AAAA,cACvC,GAAI,QAAQ,YAAY,sBAAsB,CAAC;AAAA,cAC/C,cAAc,SAAS;AAAA,YACzB;AACA,mBAAO,yCAAyC,KAAK,UAAU;AAAA,UACjE;AAEA,cAAI,cAAc,SAAS,SAAS,GAAG;AACrC,uBAAW,WAAW,cAAc,UAAU;AAC5C,cAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,gBACnC,OAAO;AAAA,gBACP,SAAS;AAAA,gBACT,WAAW,oBAAI,KAAK;AAAA,gBACpB,SAAS;AAAA,cACX,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF,SAAS,OAAO;AACd,gBAAM,eAAe,mDAAmD,UAAU,KAAK,OAAO,KAAK,CAAC;AACpG,0BAAgB,SAAS,YAAY;AAErC,UAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,YACnC,OAAO;AAAA,YACP,SAAS;AAAA,YACT,WAAW,oBAAI,KAAK;AAAA,UACtB,CAAC;AAED,iBAAO,yCAAyC,KAAK,UAAU;AAAA,QACjE;AAAA,MACF;AAEA,MAAAA,iBAAgB,YAAY,kCAAkC,IAAI,UAAU;AAAA,IAC9E;AAEA,oCAAgC,KAAK,IAAI;AACzC,WAAO,mCACL,gCAAgC;AAGlC,oBAAgB,QAAQ,yCAAyC;AACjE,gCAA4B,KAAK,IAAI;AAErC,eAAW,CAAC,YAAY,WAAW,KAAK,qBAAqB;AAC3D,YAAM,UAAUA,iBAAgB,SAAS,IAAI,UAAU;AACvD,UAAI,CAAC,SAAS;AACZ;AAAA,MACF;AAEA,YAAM,uBAAuB;AAAA,QAC3B;AAAA,QACA;AAAA,QACAA;AAAA,MACF;AAEA,aAAO,oBAAoB,KAAK,UAAU;AAC1C,aAAO,0BAA0B,qBAAqB;AACtD,aAAO,sBAAsB,qBAAqB;AAGlD,UAAI,QAAQ,aAAa;AACvB,gBAAQ,YAAY,eAAe,qBAAqB,aAAa;AAAA,MACvE;AAAA,IACF;AAEA,8BAA0B,KAAK,IAAI;AACnC,WAAO,6BAA6B,0BAA0B;AAG9D,mCAA+BA,kBAAiBA,iBAAgB,aAAa;AAG7E,0CAAsCA,kBAAiB,MAAM;AAG7D;AAAA,MACEA;AAAA,MACAC;AAAA,MACAD,iBAAgB;AAAA,IAClB;AAEA,WAAO,UAAU,OAAO,yBAAyB,KAAK,OAAO,6BAA6B;AAAA,EAC5F,SAAS,OAAO;AACd,UAAM,eAAe,+BAA+B,OAAO,KAAK,CAAC;AACjE,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,IACtB,CAAC;AAED,WAAO,UAAU;AAAA,EACnB,UAAE;AACA,WAAO,kBAAkB,KAAK,IAAI,IAAI;AAAA,EACxC;AAEA,SAAO;AACT;AAWA,SAAS,qBACP,MACA,cACA,YACAA,kBACoB;AACpB,QAAM,YAAY,oBAAI,KAAK;AAC3B,QAAM,YAAY,GAAG,KAAK,EAAE,UAAU,UAAU,QAAQ,CAAC;AAGzD,QAAM,mBAAmB,aAAa;AAEtC,QAAM,UAA8B;AAAA,IAClC,IAAI;AAAA,IACJ,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,QAAQ;AAAA,MACN,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,oBAAoB,KAAK,YAAY,CAAC;AAE5C,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACAA,iBAAgB;AAAA,MAChB;AAAA,MACA;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM,KAAKA,iBAAgB,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,UACnE;AAAA,UACA;AAAA,YACE,UAAU,MAAM;AAAA,YAChB,oBAAoB,MAAM;AAAA,YAC1B,oBAAoB,MAAM;AAAA,YAC1B,YAAY,MAAM;AAAA,YAClB,cAAc,MAAM;AAAA,YACpB,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,UACrB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,KAAK;AAAA,IACP;AAEA,YAAQ,SAAS;AAAA,MACf,GAAG;AAAA,MACH,WAAW;AAAA,IACb;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,QAAQ;AAAA,MACd,SAAS,OAAO,KAAK;AAAA,MACrB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,gCACP,cACA,SACAA,kBAC4B;AAC5B,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAAqC;AAAA,IACzC,YAAY,QAAQ;AAAA,IACpB,cAAc,CAAC;AAAA,IACf,mBAAmB;AAAA,IACnB,eAAe;AAAA,IACf,2BAA2B,QAAQ,QAAQ,aAAa,yBAAyB;AAAA,IACjF,qBAAqB;AAAA,IACrB,aAAa,CAAC;AAAA,EAChB;AAEA;AAAA,IACE;AAAA,IACA,YAAY,aAAa,MAAM,wBAAwB,QAAQ,UAAU,UAAU,OAAO,4BAA4B,SAAS,SAAS;AAAA,EAC1I;AAEA,aAAW,QAAQ,cAAc;AAC/B,QAAI;AAEF,WAAK,YAAY;AAAA,QACf,gBAAgB;AAAA,QAChB,aAAa;AAAA,QACb,2BAA2B,OAAO;AAAA,QAClC,gBAAgB,oBAAI,KAAK;AAAA,MAC3B;AAGA,YAAM,eAAe;AAAA,QACnB;AAAA,QACA,KAAK;AAAA,QACL,QAAQ;AAAA,QACRA;AAAA,MACF;AAEA,WAAK,UAAU,eAAe;AAC9B,WAAK,SAAS,KAAK,YAAY;AAC/B,aAAO,aAAa,KAAK,IAAI;AAE7B,UAAI,aAAa,OAAO,SAAS;AAC/B,aAAK,SAAS;AACd,eAAO;AACP,wBAAgB,QAAQ,6BAA6B,KAAK,EAAE,EAAE;AAAA,MAChE,OAAO;AACL,aAAK,SAAS;AACd,aAAK,eAAe,aAAa,OAAO,WAAW;AACnD,eAAO;AACP,eAAO,YAAY,KAAK,KAAK,YAAY;AACzC,wBAAgB,QAAQ,yBAAyB,KAAK,EAAE,KAAK,KAAK,YAAY,EAAE;AAAA,MAClF;AAAA,IACF,SAAS,OAAO;AACd,YAAM,eAAe,wBAAwB,KAAK,EAAE,KAAK,OAAO,KAAK,CAAC;AACtE,aAAO,YAAY,KAAK,YAAY;AACpC,aAAO;AACP,WAAK,SAAS;AACd,WAAK,eAAe;AACpB,sBAAgB,SAAS,YAAY;AAAA,IACvC;AAAA,EACF;AAEA,SAAO,sBAAsB,KAAK,IAAI,IAAI;AAE1C;AAAA,IACE;AAAA,IACA,yCAAyC,QAAQ,UAAU,KAAK,OAAO,iBAAiB,gBAAgB,OAAO,aAAa;AAAA,EAC9H;AAEA,SAAO;AACT;AAOA,SAAS,sCACPA,kBACA,cACM;AAGN,EAAAA,iBAAgB,YAAY,qBAC1B,aAAa,yBAAyB,aAAa;AACvD;;;AMtYA,SAAS,mBACP,MACA,YACA,UACAG,kBACoB;AACpB,QAAM,YAAY,oBAAI,KAAK;AAC3B,QAAM,YAAY,GAAG,KAAK,EAAE,IAAI,UAAU,QAAQ,CAAC;AAEnD,QAAM,UAA8B;AAAA,IAClC,IAAI;AAAA,IACJ;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,QAAQ;AAAA,MACN,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAI;AAGF,UAAM,oBAAoB,KAAK,YAAY,CAAC;AAE5C,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACAA,iBAAgB;AAAA,MAChB;AAAA,MACA;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM,KAAKA,iBAAgB,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,UACnE;AAAA,UACA;AAAA,YACE,UAAU,MAAM;AAAA,YAChB,oBAAoB,MAAM;AAAA,YAC1B,oBAAoB,MAAM;AAAA,YAC1B,YAAY,MAAM;AAAA,YAClB,cAAc,MAAM;AAAA,YACpB,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,YACnB,mBAAmB,MAAM;AAAA,UAC3B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,KAAK;AAAA,IACP;AAEA,UAAM,UAAU,oBAAI,KAAK;AACzB,YAAQ,SAAS;AAAA,MACf,GAAG;AAAA,MACH,WAAW;AAAA,MACX,YAAY,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,MAClD,aAAa;AAAA,MACb;AAAA,IACF;AAEA,QAAI,kBAAkB,WAAW,kBAAkB,YAAY;AAC7D,MAAAA,iBAAgB,cAAc;AAAA,IAChC;AAAA,EACF,SAAS,OAAO;AACd,UAAM,UAAU,oBAAI,KAAK;AACzB,YAAQ,QAAQ;AAAA,MACd,SAAS,OAAO,KAAK;AAAA,MACrB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD;AACA,YAAQ,OAAO,YAAY;AAC3B,YAAQ,OAAO,aAAa,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,EACpE;AAEA,OAAK,SAAS,KAAK,OAAO;AAC1B,SAAO;AACT;AAKA,SAAS,sBACPC,OACA,aACA,oBACA,YACiB;AAEjB,QAAM,wBAA6C;AAAA,IACjD,YAAY;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,iBAAiB;AAAA,EACnB;AAEA,QAAM,sBAA2C;AAAA,IAC/C,YAAY;AAAA,IACZ,MAAM,CAAC,KAAK;AAAA,IACZ,iBAAiB;AAAA,EACnB;AAEA,SAAO;AAAA,IACL,IAAI,GAAGA,KAAI,IAAI,UAAU,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAAA,IAClF,MAAAA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,CAAC;AAAA,IACX,cAAc,CAAC;AAAA,IACf,gBAAgB;AAAA,IAChB,cAAc;AAAA,EAChB;AACF;AAEA,SAAS,wBACP,YACA,UACmB;AACnB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,sBAAsB;AAAA,MACpB,cAAc;AAAA;AAAA,IAChB;AAAA,IACA,kBAAkB;AAAA,EACpB;AACF;AAKA,SAAS,uBACP,MACA,SACAD,kBACA,gBACM;AACN,OAAK,SAAS;AAEd,QAAM,SAAS,QAAQ;AACvB,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,MAAM,kDAAkD,QAAQ,UAAU,EAAE;AAAA,EACxF;AAEA,QAAM,qBAAqB;AAAA,IACzB;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,IACPA;AAAA,EACF;AAEA,MAAI,mBAAmB,OAAO,SAAS;AACrC,SAAK,SAAS;AACd;AAAA,EACF;AAGA,QAAM,YAAY,mBAAmB,QACjC,IAAI,MAAM,mBAAmB,MAAM,OAAO,IAC1C,IAAI,MAAM,oBAAoB;AAElC,OAAK,SAAS;AACd,OAAK,eAAe,WAAW,WAAW;AAK1C,kBAAgB,SAAS,+BAA+B,KAAK,EAAE,KAAK,KAAK,YAAY,EAAE;AACzF;AAQA,SAAS,wBAAwBA,kBAAqCE,gBAA6B;AACjG,kBAAgB,QAAQ,oDAAoD;AAE5E,EAAAF,iBAAgB,eAAe;AAC/B,QAAM,uBAAuB,oBAAI,KAAK;AAGtC,QAAM,WAAkE,CAAC;AAEzE,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,eAAW,QAAQ,QAAQ,kBAAkB;AAC3C,eAAS,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,IACjC;AAAA,EACF;AAIA,kBAAgB,QAAQ,aAAa,SAAS,MAAM,yBAAyB;AAC7E,aAAW,EAAE,MAAM,QAAQ,KAAK,UAAU;AACxC,QAAI;AACF,6BAAuB,MAAM,SAASA,kBAAiBE,cAAa;AAAA,IACtE,SAAS,OAAO;AACd,YAAM,eAAe,sCAAsC,KAAK,EAAE,KAAK,OAAO,KAAK,CAAC;AACpF,sBAAgB,SAAS,YAAY;AAErC,MAAAF,iBAAgB,OAAO,SAAS,KAAK;AAAA,QACnC,OAAO;AAAA,QACP,SAAS;AAAA,QACT,WAAW,oBAAI,KAAK;AAAA,QACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,MAChD,CAAC;AAED,WAAK,SAAS;AACd,WAAK,eAAe;AACpB,MAAAA,iBAAgB,cAAc;AAAA,IAChC;AAAA,EACF;AAGA,aAAW,WAAWA,iBAAgB,SAAS,OAAO,GAAG;AACvD,UAAM,oBAAoB,QAAQ,iBAAiB;AAAA,MACjD,UAAQ,KAAK,WAAW,aAAa,KAAK,WAAW;AAAA,IACvD;AAEA,QAAI,mBAAmB;AACrB,YAAM,iBAAiB,QAAQ,iBAAiB,KAAK,UAAQ,KAAK,WAAW,QAAQ;AACrF,cAAQ,SAAS,iBAAiB,WAAW;AAC7C,cAAQ,WAAW,uBAAuB,oBAAI,KAAK;AAAA,IACrD;AAAA,EACF;AAEA,QAAM,qBAAqB,oBAAI,KAAK;AACpC,EAAAA,iBAAgB,cAAc,YAAY,wBACxC,mBAAmB,QAAQ,IAAI,qBAAqB,QAAQ;AAE9D;AAAA,IACE;AAAA,IACA,6CAA6CA,iBAAgB,cAAc,sBAAsB,aAAaA,iBAAgB,cAAc,kBAAkB;AAAA,EAChK;AACF;AAeO,SAAS,uBACdA,kBACAG,qBACAD,gBACM;AACN,MAAI;AAEF,yBAAqBF,kBAAiBG,mBAAkB;AACxD,4BAAwBH,kBAAiBE,cAAa;AAGtD,mCAA+BF,kBAAiBA,iBAAgB,aAAa;AAG7E,oBAAgB,QAAQ,uCAAuC;AAC/D,UAAM,eAAe,yBAAyBA,kBAAiBE,cAAa;AAG5E,mCAA+BF,kBAAiBA,iBAAgB,aAAa;AAG7E,QAAI,aAAa,2BAA2B,GAAG;AAC7C;AAAA,QACE;AAAA,QACA,0BAA0B,aAAa,wBAAwB,mBAAmB,aAAa,sBAAsB,gBAAgB,aAAa,kBAAkB;AAAA,MACtK;AAAA,IACF,OAAO;AACL,sBAAgB,QAAQ,gDAAgD;AAAA,IAC1E;AAGA,UAAM,cACJA,iBAAgB,cAAc,qBAAqB,KACnDA,iBAAgB,OAAO,SAAS,SAAS;AAE3C,IAAAA,iBAAgB,cAAc,iBAAiB,CAAC;AAChD,IAAAA,iBAAgB,eAAe,cAAc,WAAW;AAGxD,UAAM,eAAe,qBAAqBA,gBAAe;AACzD,oBAAgB,QAAQ,wDAAwD,YAAY;AAAA,EAC9F,SAAS,OAAO;AACd,UAAM,eAAe,qCAAqC,OAAO,KAAK,CAAC;AACvE,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,MACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD,CAAC;AAED,IAAAA,iBAAgB,eAAe;AAC/B,IAAAA,iBAAgB,cAAc,iBAAiB;AAE/C,UAAM;AAAA,EACR;AACF;AAGA,SAAS,qBACPA,kBACAG,qBACM;AACN,kBAAgB,QAAQ,gDAAgD;AAExE,EAAAH,iBAAgB,eAAe;AAE/B,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,QAAI;AACF,YAAM,WAAWG,oBAAmB,IAAI,UAAU;AAGlD,YAAM,WAAW;AAAA,QACf;AAAA,QACAH,iBAAgB;AAAA,QAChB;AAAA,QACAA;AAAA,MACF;AAGA,YAAM,aAAa,oBAAoB,UAAUA,iBAAgB,aAAa;AAG9E,YAAM,oBAAoB,wBAAwB,YAAY,QAAQ;AAEtE,cAAQ,4BAA4B;AAGpC,YAAM,OAAO;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR;AAAA,MACF;AAGA,WAAK,iBAAiB,SAAS;AAC/B,WAAK,eAAe,SAAS;AAE7B,cAAQ,mBAAmB,CAAC,IAAI;AAEhC,cAAQ,SAAS;AACjB,cAAQ,WAAW,qBAAqB,oBAAI,KAAK;AAEjD;AAAA,QACE;AAAA,QACA,WAAW,QAAQ,iBAAiB,MAAM,oCAAoC,UAAU;AAAA,MAC1F;AAAA,IACF,SAAS,OAAO;AACd,YAAM,eAAe,0CAA0C,UAAU,KAAK,OAAO,KAAK,CAAC;AAC3F,sBAAgB,SAAS,YAAY;AAErC,MAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,QACnC,OAAO;AAAA,QACP,SAAS;AAAA,QACT,WAAW,oBAAI,KAAK;AAAA,QACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,MAChD,CAAC;AAED,cAAQ,SAAS;AAAA,IACnB;AAAA,EACF;AAEA,QAAM,aAAa,MAAM,KAAKA,iBAAgB,SAAS,OAAO,CAAC,EAAE;AAAA,IAC/D,CAAC,KAAK,YAAY,MAAM,QAAQ,iBAAiB;AAAA,IACjD;AAAA,EACF;AAEA,EAAAA,iBAAgB,cAAc,wBAAwB;AAEtD,kBAAgB,QAAQ,gDAAgD,UAAU,EAAE;AACtF;;;ACzYA,IAAAI,gBAAyB;;;ACEzB,IAAAC,wBAA0B;AAC1B,IAAAC,gBAAgC;AAShC,IAAM,yBAAyB;AAG/B,IAAM,sBAAsB;AAyCrB,SAAS,sBAAsB,SAA8B;AAClE,MAAI,CAAC,QAAQ,aAAa;AACxB,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,QAAQ,YAAY,eAAe,mBAAmB,MAAM;AAC3E,QAAM,YAAY,QAAQ,YAAY,kBAAkB,mBAAmB,MAAM;AAEjF,SAAO,UAAU;AACnB;AAcO,SAAS,cACd,SACAC,aACA,UACkB;AAClB,QAAM,qBAAiB,oBAAKA,aAAY,QAAQ,UAAU;AAC1D,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAA2B;AAAA,IAC/B,SAAS;AAAA,IACT,YAAY,QAAQ;AAAA,IACpB,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AAEA,MAAI;AAGF,UAAM,YAAsB,CAAC;AAC7B,QAAI,UAAU;AACZ,gBAAU,SAAK,oBAAK,UAAU,cAAc,CAAC;AAAA,IAC/C;AACA,cAAU,SAAK,oBAAK,gBAAgB,cAAc,CAAC;AAEnD,UAAM,MAA0C;AAAA,MAC9C,GAAG,QAAQ;AAAA,MACX,WAAW,UAAU,KAAK,uBAAS;AAAA,IACrC;AAEA;AAAA,MACE;AAAA,MACA,WAAW,mBAAmB,iBAAiB,QAAQ,UAAU;AAAA,IACnE;AAEA,UAAM,kBAAc,iCAAU,cAAc,GAAG,CAAC,SAAS,mBAAmB,GAAG;AAAA,MAC7E,KAAK;AAAA,MACL;AAAA,MACA,OAAO;AAAA,MACP,SAAS;AAAA,IACX,CAAC;AAED,WAAO,aAAa,KAAK,IAAI,IAAI;AAGjC,QAAI,YAAY,WAAW,aAAa,YAAY,WAAW,WAAW;AACxE,aAAO,WAAW;AAClB,aAAO,QAAQ,GAAG,mBAAmB,oBAAoB,sBAAsB,mBAAmB,QAAQ,UAAU;AACpH,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,QAAI,YAAY,OAAO;AACrB,aAAO,QAAQ,GAAG,mBAAmB,iCAAiC,QAAQ,UAAU,MAAM,OAAO,YAAY,KAAK,CAAC;AACvH,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,QAAI,YAAY,WAAW,GAAG;AAC5B,YAAM,SAAS,YAAY,QAAQ,SAAS,EAAE,KAAK,KAAK;AACxD,YAAM,SAAS,YAAY,QAAQ,SAAS,EAAE,KAAK,KAAK;AACxD,YAAM,SAAS,UAAU,UAAU;AACnC,aAAO,QAAQ,GAAG,mBAAmB,wBAAwB,QAAQ,UAAU,gBAAgB,YAAY,MAAM,MAAM,MAAM;AAC7H,sBAAgB,QAAQ,OAAO,KAAK;AACpC,aAAO;AAAA,IACT;AAGA,WAAO,UAAU;AACjB;AAAA,MACE;AAAA,MACA,oBAAoB,mBAAmB,iBAAiB,QAAQ,UAAU,MAAM,OAAO,UAAU;AAAA,IACnG;AAAA,EACF,SAAS,OAAO;AACd,WAAO,aAAa,KAAK,IAAI,IAAI;AACjC,WAAO,QAAQ,GAAG,mBAAmB,2CAA2C,QAAQ,UAAU,MAAM,OAAO,KAAK,CAAC;AACrH,oBAAgB,SAAS,OAAO,KAAK;AAAA,EACvC;AAEA,SAAO;AACT;AAiBO,SAAS,sBACdC,kBACAD,aACAE,qBACAC,gBACmB;AACnB,QAAM,UAA6B;AAAA,IACjC,eAAeF,iBAAgB,SAAS;AAAA,IACxC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,SAAS,CAAC;AAAA,EACZ;AAEA,aAAW,CAAC,YAAY,OAAO,KAAKA,iBAAgB,SAAS,QAAQ,GAAG;AACtE,QAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC;AAAA,IACF;AAEA,YAAQ;AACR,UAAM,WAAWC,oBAAmB,IAAI,UAAU;AAClD,UAAM,SAAS,cAAc,SAASF,aAAY,QAAQ;AAC1D,YAAQ,QAAQ,KAAK,MAAM;AAE3B,QAAI,OAAO,SAAS;AAClB,cAAQ;AAOR,YAAM,gBAAgB,2BAA2B,SAASA,WAAU;AACpE,UAAI,CAAC,cAAc,SAAS;AAC1B;AAAA,UACE;AAAA,UACA,oDAAoD,UAAU,uCAAuC,cAAc,SAAS,eAAe;AAAA,QAC7I;AAAA,MACF;AAAA,IACF,OAAO;AACL,cAAQ;AAIR,UAAIG,gBAAe;AACjB;AAAA,UACE;AAAA,UACA,OAAO,SAAS,GAAG,mBAAmB,wBAAwB,UAAU;AAAA,UACxEA;AAAA,UACAH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,QAAQ,2BAA2B,GAAG;AACxC;AAAA,MACE;AAAA,MACA,wBAAwB,QAAQ,wBAAwB,iCAAiC,QAAQ,cAAc,eAAe,QAAQ,UAAU;AAAA,IAClJ;AAAA,EACF,OAAO;AACL,oBAAgB,QAAQ,uCAAuC;AAAA,EACjE;AAEA,SAAO;AACT;;;ACnPA,IAAAI,gBAAsD;;;ACAtD,IAAAC,aAAmD;AACnD,IAAAC,gBAAuD;AAoBhD,SAAS,+BACd,eACA,YACU;AACV,MAAI,CAAC,iBAAiB,CAAC,YAAY;AACjC,UAAM,IAAI;AAAA,MACR,kDAAkD,UAAU;AAAA,IAC9D;AAAA,EACF;AAGA,QAAM,uBAAuB,cAAc,QAAQ,WAAW,EAAE;AAChE,QAAM,uBAAuB,WAAW,QAAQ,WAAW,EAAE;AAE7D,MACE,CAAC,qBAAqB,WAAW,oBAAoB,KACrD,yBAAyB,sBACzB;AACA,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,WAAW,OAAK,oBAAK,YAAY,UAAU,GAAG;AAAA,MAClD,OAAO;AAAA,MACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,MACjD,sBAAsB;AAAA,IACxB,CAAC;AAGD,UAAM,gBAAgB,SAAS,IAAI,cAAQ,wBAAS,eAAe,IAAI,CAAC;AAGxE,UAAM,sBAAsB,uBAAuB,aAAa;AAChE,QAAI,oBAAoB,SAAS,GAAG;AAClC,YAAM,WAAW,mBAAmB,eAAe,mBAAmB;AACtE,YAAM,eAAe,cAAc,SAAS,SAAS;AACrD,UAAI,eAAe,GAAG;AACpB;AAAA,UACE;AAAA,UACA,YAAY,YAAY,8DAA0D,wBAAS,eAAe,UAAU,KAAK,GAAG;AAAA,QAC9H;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,oBAAgB,SAAS,8BAA8B,UAAU,KAAK,OAAO,KAAK,CAAC,EAAE;AACrF,WAAO,CAAC;AAAA,EACV;AACF;AASO,SAAS,mCAAmC,eAAiC;AAClF,MAAI,CAAC,iBAAiB,KAAC,uBAAW,aAAa,GAAG;AAChD,UAAM,IAAI,MAAM,0BAA0B,aAAa,mBAAmB;AAAA,EAC5E;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AAGtC,QAAM,mBAAmB,OAAK,oBAAK,eAAe,iBAAiB,GAAG;AAAA,IACpE,OAAO;AAAA,IACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,IACjD,sBAAsB;AAAA,EACxB,CAAC;AAED,QAAM,WAAW,OAAK,oBAAK,eAAe,UAAU,GAAG;AAAA,IACrD,OAAO;AAAA,IACP,QAAQ,CAAC,sBAAsB,kBAAkB;AAAA,IACjD,sBAAsB;AAAA,EACxB,CAAC;AAGD,QAAM,uBAAuB,oBAAI,IAAY;AAG7C,aAAW,mBAAmB,kBAAkB;AAC9C,yBAAqB,QAAI,uBAAQ,eAAe,CAAC;AAAA,EACnD;AAGA,aAAW,WAAW,UAAU;AAC9B,UAAM,aAAS,uBAAQ,OAAO;AAC9B,UAAM,cAAc,2BAA2B,QAAQ,aAAa;AACpE,QAAI,aAAa;AACf,2BAAqB,IAAI,WAAW;AAAA,IACtC,OAAO;AACL,2BAAqB,IAAI,MAAM;AAAA,IACjC;AAAA,EACF;AAGA,aAAW,OAAO,sBAAsB;AACtC,QAAI,mBAAmB,GAAG,GAAG;AAC3B,YAAM,mBAAe,wBAAS,eAAe,GAAG;AAChD,YAAM,aAAa,gBAAgB;AAGnC,UAAI,YAAY;AAChB,YAAM,mBAAmB,MAAM,KAAK,aAAa;AAEjD,iBAAW,mBAAmB,kBAAkB;AAC9C,cAAM,sBAAkB,oBAAK,eAAe,eAAe;AAI3D,YAAI,IAAI,WAAW,kBAAkB,iBAAG,GAAG;AAEzC,gBAAM,4BAAwB,oBAAK,iBAAiB,cAAc;AAClE,gBAAM,oBAAoB,oBAAoB,qBAAqB;AACnE,gBAAM,mBACJ,mBAAmB,cACnB,MAAM,QAAQ,kBAAkB,UAAU,KAC1C,kBAAkB,WAAW,SAAS;AAGxC,cACE,qBACC,sBAAsB,eAAe,KAAK,oBAAoB,eAAe,IAC9E;AAEA,wBAAY;AAAA,UACd,OAAO;AAEL,wBAAY;AAAA,UACd;AACA;AAAA,QACF;AAIA,YAAI,gBAAgB,WAAW,MAAM,iBAAG,GAAG;AACzC,gBAAM,6BAAyB,oBAAK,KAAK,cAAc;AACvD,gBAAM,qBAAqB,oBAAoB,sBAAsB;AACrE,gBAAM,oBACJ,oBAAoB,cACpB,MAAM,QAAQ,mBAAmB,UAAU,KAC3C,mBAAmB,WAAW,SAAS;AAGzC,cAAI,EAAE,qBAAqB,mBAAmB,eAAe,IAAI;AAC/D,0BAAc,OAAO,eAAe;AAAA,UACtC;AAAA,QACF;AAAA,MACF;AAEA,UAAI,WAAW;AACb,sBAAc,IAAI,UAAU;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,aAAa,EAAE,KAAK;AACxC;AAQO,SAAS,kBAAkB,UAA+B;AAC/D,MAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,UAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE;AAAA,EACpD;AAEA,QAAM,cAAU,yBAAa,UAAU,MAAM;AAC7C,QAAM,UAAuB,CAAC;AAK9B,QAAM,aACJ;AAEF,MAAIC;AACJ,UAAQA,SAAQ,WAAW,KAAK,OAAO,OAAO,MAAM;AAClD,UAAMC,QAAOD,OAAM,CAAC;AACpB,YAAQ,KAAK;AAAA,MACX,WAAWA,OAAM,CAAC;AAAA,MAClB,MAAAC;AAAA,MACA,YAAYA,MAAK,WAAW,IAAI,KAAKA,MAAK,WAAW,KAAK;AAAA,MAC1D,UAAU,CAACA,MAAK,WAAW,IAAI,KAAK,CAACA,MAAK,WAAW,KAAK,KAAK,CAACA,MAAK,WAAW,GAAG;AAAA,IACrF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AASA,SAAS,2BAA2B,YAAoB,eAAsC;AAE5F,MAAI,WAAW,SAAS,cAAc,KAAK,WAAW,SAAS,WAAW,GAAG;AAC3E,WAAO;AAAA,EACT;AAEA,MAAI,aAAa;AAGjB,SAAO,WAAW,WAAW,aAAa,GAAG;AAE3C,QAAI,mBAAmB,UAAU,GAAG;AAGlC,YAAM,qBAAiB,wBAAS,UAAU;AAC1C,YAAM,mBAAmB,CAAC,OAAO,MAAM,KAAK,EAAE,SAAS,cAAc;AAErE,UAAI,kBAAkB;AACpB,cAAMC,iBAAY,uBAAQ,UAAU;AAEpC,YACEA,eAAc,cACdA,WAAU,WAAW,aAAa,KAClC,CAACA,WAAU,SAAS,cAAc,KAClC,CAACA,WAAU,SAAS,WAAW,KAC/B,mBAAmBA,UAAS,GAC5B;AAEA,iBAAOA;AAAA,QACT;AAAA,MACF;AAGA,YAAMA,iBAAY,uBAAQ,UAAU;AAEpC,UACEA,eAAc,cACdA,WAAU,WAAW,aAAa,KAClC,CAACA,WAAU,SAAS,cAAc,KAClC,CAACA,WAAU,SAAS,WAAW,GAC/B;AACA,cAAMC,gBACJ,2BAAW,oBAAKD,YAAW,IAAI,CAAC,SAAK,yBAAS,oBAAKA,YAAW,IAAI,CAAC,EAAE,YAAY;AACnF,cAAME,iBACJ,2BAAW,oBAAKF,YAAW,KAAK,CAAC,SAAK,yBAAS,oBAAKA,YAAW,KAAK,CAAC,EAAE,YAAY;AACrF,cAAMG,iBACJ,2BAAW,oBAAKH,YAAW,KAAK,CAAC,SAAK,yBAAS,oBAAKA,YAAW,KAAK,CAAC,EAAE,YAAY;AAGrF,YAAKC,aAAYC,cAAeA,cAAaC,YAAY;AACvD,iBAAOH;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,UAAM,eACJ,2BAAW,oBAAK,YAAY,IAAI,CAAC,SAAK,yBAAS,oBAAK,YAAY,IAAI,CAAC,EAAE,YAAY;AACrF,UAAM,gBACJ,2BAAW,oBAAK,YAAY,KAAK,CAAC,SAAK,yBAAS,oBAAK,YAAY,KAAK,CAAC,EAAE,YAAY;AACvF,UAAM,gBACJ,2BAAW,oBAAK,YAAY,KAAK,CAAC,SAAK,yBAAS,oBAAK,YAAY,KAAK,CAAC,EAAE,YAAY;AAEvF,QAAK,YAAY,aAAe,aAAa,WAAY;AACvD,aAAO;AAAA,IACT;AAGA,UAAM,gBAAY,uBAAQ,UAAU;AACpC,QAAI,cAAc,YAAY;AAE5B;AAAA,IACF;AACA,iBAAa;AAAA,EACf;AAGA,SAAO;AACT;AAUO,SAAS,mBAAmB,KAAsB;AACvD,MAAI;AAEF,QAAI,IAAI,SAAS,cAAc,KAAK,IAAI,SAAS,WAAW,GAAG;AAC7D,aAAO;AAAA,IACT;AAGA,UAAM,4BAA4B,sBAAsB,GAAG;AAC3D,UAAM,oBAAoB,oBAAoB,GAAG;AACjD,UAAM,cAAc,6BAA6B;AAGjD,UAAM,qBAAqB,0BAA0B,GAAG;AAExD,QAAI,oBAAoB;AAEtB,UAAI,CAAC,aAAa;AAChB,eAAO;AAAA,MACT;AAGA,YAAM,sBAAkB,oBAAK,KAAK,cAAc;AAChD,YAAM,cAAc,oBAAoB,eAAe;AAEvD,UACE,aAAa,cACb,MAAM,QAAQ,YAAY,UAAU,KACpC,YAAY,WAAW,SAAS,GAChC;AAEA,YAAI,CAAC,aAAa;AAEhB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,oBAAgB,SAAS,4BAA4B,GAAG,KAAK,OAAO,KAAK,CAAC,EAAE;AAC5E,WAAO;AAAA,EACT;AACF;AAKA,SAAS,sBAAsB,KAAsB;AACnD,QAAM,oBAAoB,KAAC,oBAAK,KAAK,IAAI,OAAG,oBAAK,KAAK,KAAK,OAAG,oBAAK,KAAK,KAAK,CAAC;AAE9E,aAAW,YAAY,mBAAmB;AACxC,YAAI,uBAAW,QAAQ,SAAK,qBAAS,QAAQ,EAAE,YAAY,GAAG;AAE5D,YAAM,WAAW,OAAK,oBAAK,UAAU,UAAU,GAAG;AAAA,QAChD,OAAO;AAAA,QACP,sBAAsB;AAAA,MACxB,CAAC;AACD,UAAI,SAAS,SAAS,GAAG;AACvB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,KAAsB;AACjD,QAAM,iBAAiB,OAAK,oBAAK,KAAK,OAAO,GAAG,EAAE,sBAAsB,KAAK,CAAC;AAC9E,SAAO,eAAe,SAAS;AACjC;AAOO,SAAS,oBAAoB,UAA2C;AAC7E,MAAI,KAAC,uBAAW,QAAQ,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,cAAU,yBAAa,UAAU,MAAM;AAC7C,UAAM,cAAc,KAAK,MAAM,OAAO;AACtC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oBAAgB,QAAQ,iCAAiC,QAAQ,KAAK,OAAO,KAAK,CAAC,EAAE;AACrF,WAAO;AAAA,EACT;AACF;AAiBO,SAAS,2BACd,eACA,SAKmB;AACnB,MAAI,CAAC,QAAQ,YAAY,QAAQ,SAAS,WAAW,GAAG;AACtD,WAAO;AAAA,MACL,oBAAoB,CAAC;AAAA,MACrB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAEA,QAAM,yBAAqB,oBAAK,eAAe,QAAQ,UAAU;AAGjE,QAAM,iBAAiB,CAAC,MAAM,OAAO,KAAK;AAC1C,QAAM,kBAAkB,eAAe,OAAO,aAAO,2BAAW,oBAAK,oBAAoB,GAAG,CAAC,CAAC;AAE9F,MAAI,gBAAgB,SAAS,GAAG;AAE9B,WAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAGA,QAAM,eAAe,QAAQ,SAC1B,OAAO,cAAQ,2BAAQ,oBAAK,eAAe,IAAI,CAAC,MAAM,kBAAkB,EACxE,IAAI,cAAQ,wBAAS,IAAI,CAAC;AAE7B,MAAI,aAAa,SAAS,GAAG;AAE3B,WAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IAC/D;AAAA,EACF;AAGA,QAAM,qBAAqB,QAAQ,SAAS;AAAA,IAAI,cAC9C,wBAAS,wBAAoB,oBAAK,eAAe,IAAI,CAAC;AAAA,EACxD;AAEA,SAAO;AAAA,IACL;AAAA,IACA,wBAAoB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,EAC/D;AACF;AAUO,SAAS,0BAA0B,KAAsB;AAC9D,MAAI;AACF,UAAM,sBAAkB,oBAAK,KAAK,cAAc;AAChD,UAAM,cAAc,oBAAoB,eAAe;AAEvD,QAAI,aAAa;AACf,YAAM,eAAe;AAAA,QACnB,GAAI,YAAY,gBAAgB,CAAC;AAAA,QACjC,GAAI,YAAY,mBAAmB,CAAC;AAAA,MACtC;AAGA,aAAO,CAAC,EAAE,aAAa,UAAU,KAAK,aAAa,aAAa;AAAA,IAClE;AAEA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ADzeA,SAAS,oCAAoC,eAAqD;AAEhG,kBAAgB,QAAQ,2BAA2B;AACnD,QAAM,cAAc,mCAAmC,aAAa;AAEpE,MAAI,YAAY,WAAW,GAAG;AAC5B,oBAAgB,QAAQ,wBAAwB;AAChD,WAAO,oBAAI,IAA6B;AAAA,EAC1C;AAEA,kBAAgB,QAAQ,SAAS,YAAY,MAAM,yCAAyC;AAG5F,QAAM,sBAAsB,uBAAuB,aAAa;AAEhE,QAAM,aAAa,oBAAI,IAA6B;AAGpD,aAAW,cAAc,aAAa;AAEpC,QAAI,oBAAoB,SAAS,KAAK,iBAAiB,YAAY,mBAAmB,GAAG;AACvF,sBAAgB,QAAQ,qBAAqB,UAAU,uCAAkC;AACzF;AAAA,IACF;AAEA,UAAM,yBAAqB,oBAAK,eAAe,UAAU;AACzD,UAAM,WAAW,+BAA+B,eAAe,kBAAkB;AAGjF,QAAI,SAAS,WAAW,GAAG;AACzB;AAAA,QACE;AAAA,QACA,qBAAqB,UAAU;AAAA,MACjC;AACA;AAAA,IACF;AAGA,UAAM,sBAAkB,oBAAK,oBAAoB,cAAc;AAC/D,UAAM,cAAc,oBAAoB,eAAe;AAEvD,eAAW,IAAI,YAAY;AAAA,MACzB;AAAA,MACA;AAAA,MACA,oBAAoB,CAAC;AAAA;AAAA,MACrB,wBAAoB,oBAAK,YAAY,gBAAgB;AAAA,MACrD;AAAA,MACA,cAAc,CAAC;AAAA,MACf,SAAS,oBAAI,IAAyB;AAAA,IACxC,CAAC;AAAA,EACH;AAGA,kBAAgB,QAAQ,gDAAgD;AACxE,aAAW,CAAC,YAAY,OAAO,KAAK,WAAW,QAAQ,GAAG;AAExD,eAAW,oBAAoB,QAAQ,UAAU;AAC/C,YAAM,uBAAmB,oBAAK,eAAe,gBAAgB;AAE7D,UAAI;AACF,cAAM,UAAU,kBAAkB,gBAAgB;AAClD,cAAM,kBAA+B,CAAC;AAGtC,mBAAW,cAAc,SAAS;AAChC,gBAAM,iBAA4B,EAAE,GAAG,WAAW;AAElD,cAAI,WAAW,YAAY;AAEzB,kBAAM,uBAAmB,2BAAQ,uBAAQ,gBAAgB,GAAG,WAAW,IAAI;AAC3E,kBAAM,yBAAyB,iBAAiB,SAAS,MAAM,IAC3D,mBACA,GAAG,gBAAgB;AAGvB,gBAAI;AACF,oBAAM,wBAAoB,uBAAQ,gBAAgB;AAClD,oBAAM,mBAAe,2BAAQ,oBAAK,eAAe,iBAAiB,GAAG,WAAW,IAAI;AACpF,oBAAM,yBAAyB,aAAa,SAAS,MAAM,IACvD,eACA,GAAG,YAAY;AAGnB,kBAAI,uBAAuB,WAAW,aAAa,GAAG;AACpD,+BAAe,eAAe,uBAC3B,UAAU,cAAc,MAAM,EAC9B,QAAQ,UAAU,EAAE;AAAA,cACzB;AAAA,YACF,SAAS,OAAO;AACd;AAAA,gBACE;AAAA,gBACA,qCAAqC,WAAW,IAAI,OAAO,gBAAgB,KAAK,OAAO,KAAK,CAAC;AAAA,cAC/F;AAAA,YACF;AAGA,uBAAW,CAAC,iBAAiB,YAAY,KAAK,WAAW,QAAQ,GAAG;AAClE,kBAAI,oBAAoB,WAAY;AAEpC,oBAAM,8BAA0B,oBAAK,eAAe,eAAe;AAGnE,oBAAM,mBAAmB,aAAa,SAAS,KAAK,eAAa;AAC/D,sBAAM,wBAAoB,oBAAK,eAAe,SAAS;AACvD,uBACE,sBAAsB,0BACtB,uBAAuB,WAAW,0BAA0B,iBAAG;AAAA,cAEnE,CAAC;AAED,kBAAI,kBAAkB;AAEpB,wBAAQ,iBAAiB,CAAC;AAE1B,oBAAI,CAAC,QAAQ,aAAa,SAAS,YAAY,GAAG;AAChD,0BAAQ,aAAa,KAAK,YAAY;AAAA,gBACxC;AAAA,cACF;AAAA,YACF;AAAA,UACF,WAES,WAAW,YAAY,QAAQ,aAAa;AACnD,kBAAM,eAAe;AAAA,cACnB,GAAI,QAAQ,YAAY,gBAAgB,CAAC;AAAA,cACzC,GAAI,QAAQ,YAAY,mBAAmB,CAAC;AAAA,YAC9C;AAGA,kBAAM,aAAa,WAAW,KAAK,MAAM,GAAG,EAAE,CAAC,EAAE,WAAW,GAAG,IAC3D,WAAW,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,IAC/C,WAAW,KAAK,MAAM,GAAG,EAAE,CAAC;AAEhC,gBAAI,aAAa,UAAU,GAAG;AAAA,YAG9B;AAAA,UACF;AAEA,0BAAgB,KAAK,cAAc;AAAA,QACrC;AAGA,gBAAQ,SAAS,IAAI,kBAAkB,eAAe;AAAA,MACxD,SAAS,OAAgB;AACvB;AAAA,UACE;AAAA,UACA,+BAA+B,gBAAgB,KAAK,OAAO,KAAK,CAAC;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,aAAW,CAAC,EAAE,OAAO,KAAK,WAAW,QAAQ,GAAG;AAC9C,QAAI;AACF,YAAM,cAAc,2BAA2B,eAAe,OAAO;AAGrE,cAAQ,qBAAqB,YAAY;AACzC,cAAQ,qBAAqB,YAAY;AAAA,IAC3C,SAAS,OAAO;AACd;AAAA,QACE;AAAA,QACA,kDAAkD,QAAQ,UAAU,KAAK,OAAO,KAAK,CAAC;AAAA,MACxF;AAEA,cAAQ,qBAAqB,QAAQ,SAAS,IAAI,cAAQ,wBAAS,IAAI,CAAC;AACxE,cAAQ,yBAAqB,oBAAK,QAAQ,YAAY,gBAAgB;AAAA,IACxE;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,+BAA+B,eAA2C;AACxF,QAAM,YAAY,oBAAI,KAAK;AAG3B,QAAMI,mBAAsC;AAAA,IAC1C,IAAI,aAAa,KAAK,IAAI,CAAC;AAAA,IAC3B;AAAA,IACA,UAAU,oBAAI,IAAwB;AAAA,IACtC,WAAW;AAAA,MACT,WAAW;AAAA,QACT,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA,aAAa;AAAA,UACX,aAAa,QAAQ;AAAA,UACrB,UAAU,QAAQ;AAAA,UAClB,KAAK,QAAQ,IAAI;AAAA,UACjB,MAAM,QAAQ;AAAA,QAChB;AAAA,MACF;AAAA,MACA,QAAQ;AAAA,QACN,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,6BAA6B;AAAA,QAC7B,eAAe,CAAC;AAAA,QAChB,iBAAiB,CAAC;AAAA,MACpB;AAAA,MACA,UAAU;AAAA,QACR,mBAAmB,CAAC;AAAA,QACpB,iBAAiB;AAAA,QACjB,kBAAkB,CAAC;AAAA,QACnB,kBAAkB;AAAA,MACpB;AAAA,IACF;AAAA,IACA,cAAc;AAAA,IACd,eAAe;AAAA,MACb,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,eAAe;AAAA,MACf,uBAAuB;AAAA,MACvB,wBAAwB;AAAA,MACxB,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,MACpB,gBAAgB,CAAC;AAAA,MACjB,UAAU,CAAC;AAAA,MACX,aAAa;AAAA,QACX,iBAAiB;AAAA,QACjB,mBAAmB;AAAA,QACnB,uBAAuB;AAAA,QACvB,sBAAsB;AAAA,MACxB;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,MACN,kBAAkB;AAAA,MAClB,uBAAuB;AAAA;AAAA,MACvB,qBAAqB;AAAA;AAAA,MACrB,sBAAsB;AAAA;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,MACN,UAAU,CAAC;AAAA,MACX,UAAU,CAAC;AAAA,IACb;AAAA,IACA,aAAa;AAAA,MACX,0BAA0B;AAAA,MAC1B,+BAA+B;AAAA,MAC/B,oBAAoB;AAAA,MACpB,mCAAmC,oBAAI,IAAY;AAAA,MACnD,8BAA8B,oBAAI,IAAY;AAAA,IAChD;AAAA,EACF;AAEA,MAAI;AAEF,UAAM,kBAAkB,oCAAoC,aAAa;AAGzE,eAAW,CAAC,YAAY,YAAY,KAAK,gBAAgB,QAAQ,GAAG;AAClE,YAAM,aAAyB;AAAA,QAC7B,GAAG;AAAA,QACH,IAAI,WAAW,WAAW,QAAQ,iBAAiB,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,QACrE,2BAA2B;AAAA;AAAA,QAC3B,kBAAkB,CAAC;AAAA,QACnB,iBAAiB;AAAA,UACf,sBAAsB,CAAC;AAAA,UACvB,cAAc,CAAC;AAAA,UACf,aAAa,oBAAI,IAAoB;AAAA,QACvC;AAAA,QACA,QAAQ;AAAA,QACR,YAAY;AAAA,UACV,YAAY,oBAAI,KAAK;AAAA,QACvB;AAAA,MACF;AAEA,MAAAA,iBAAgB,SAAS,IAAI,YAAY,UAAU;AAAA,IACrD;AAGA,IAAAA,iBAAgB,cAAc,gBAAgBA,iBAAgB,SAAS;AACvE,IAAAA,iBAAgB,cAAc,gBAAgB,MAAM;AAAA,MAClDA,iBAAgB,SAAS,OAAO;AAAA,IAClC,EAAE,OAAO,CAAC,KAAK,YAAY,MAAM,QAAQ,SAAS,QAAQ,CAAC;AAE3D,IAAAA,iBAAgB,UAAU,OAAO,mBAAmBA,iBAAgB,SAAS;AAC7E,IAAAA,iBAAgB,UAAU,OAAO,gBAAgBA,iBAAgB,cAAc;AAG/E,IAAAA,iBAAgB,eAAe;AAE/B,UAAM,UAAU,oBAAI,KAAK;AACzB,IAAAA,iBAAgB,UAAU,UAAU,UAAU;AAC9C,IAAAA,iBAAgB,UAAU,UAAU,aAAa,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AACvF,IAAAA,iBAAgB,cAAc,YAAY,oBACxCA,iBAAgB,UAAU,UAAU;AAEtC;AAAA,MACE;AAAA,MACA,qCAAqCA,iBAAgB,SAAS,IAAI,iBAAiBA,iBAAgB,cAAc,aAAa;AAAA,IAChI;AAEA,WAAOA;AAAA,EACT,SAAS,OAAO;AACd,UAAM,eAAe,yCAAyC,OAAO,KAAK,CAAC;AAC3E,oBAAgB,SAAS,YAAY;AAErC,IAAAA,iBAAgB,OAAO,SAAS,KAAK;AAAA,MACnC,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW,oBAAI,KAAK;AAAA,MACpB,OAAO,iBAAiB,QAAQ,MAAM,QAAQ;AAAA,IAChD,CAAC;AAED,IAAAA,iBAAgB,eAAe;AAC/B,WAAOA;AAAA,EACT;AACF;;;AEtVA,IAAAC,yBAA4C;AAoBrC,SAAS,uBACdC,aACAC,sBACAC,gBACsC;AACtC;AAAA,IACE;AAAA,IACA;AAAA,UACMD,oBAAmB;AAAA,EAC3B;AAcA,QAAM,aAAmC,kCAAUA,sBAAqB;AAAA,IACtE,KAAKD;AAAA,IACL,KAAK,QAAQ;AAAA,IACb,OAAO;AAAA,IACP,OAAO;AAAA,EACT,CAAC;AAED,MAAI,OAAO,OAAO;AAChB,UAAM,eAAe,uCAAuC,OAAO,MAAM,OAAO;AAChF,QAAIE,gBAAe;AACjB,uCAAiCF,aAAY,cAAcE,gBAAeF,WAAU;AAAA,IACtF;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,eAAe,8CAA8C,OAAO,OAAO,MAAM,CAAC;AACxF,QAAIE,gBAAe;AACjB,uCAAiCF,aAAY,cAAcE,gBAAeF,WAAU;AAAA,IACtF;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,KAAK;AACzB;AAYO,SAAS,kCACdA,aACAC,sBACAC,gBACAC,kBACS;AAET,4BAA0B;AAG1B,gCAA8BH,WAAU;AAGxC,QAAM,iBAAiB,iBAAiBA,WAAU;AAElD,MAAI;AACF,gCAA4B,uBAAuB;AACnD,UAAM,sBAAsB,KAAK,IAAI;AACrC,UAAM,kBAAkB,uBAAuBA,aAAYC,sBAAqBC,cAAa;AAC7F,UAAM,oBAAoB,KAAK,IAAI;AACnC,+BAA2B,uBAAuB;AAGlD,QAAIC,kBAAiB;AACnB,MAAAA,iBAAgB,cAAc,YAAY,uBACxC,oBAAoB;AACtB,MAAAA,iBAAgB,cAAc,YAAY,kBACxCA,iBAAgB,cAAc,YAAY,oBAC1CA,iBAAgB,cAAc,YAAY,wBAC1CA,iBAAgB,cAAc,YAAY;AAAA,IAC9C;AAGA,QAAI,CAAC,gBAAgB,WAAW,gBAAgB,OAAO;AACrD,sBAAgB,SAAS,uCAAuC,gBAAgB,KAAK,EAAE;AAEvF,UAAID,gBAAe;AACjB,YAAI,qBAAqBF;AACzB,YAAIG,oBAAmBA,iBAAgB,SAAS,OAAO,GAAG;AACxD,gBAAM,eAAe,MAAM,KAAKA,iBAAgB,SAAS,OAAO,CAAC,EAAE,CAAC;AACpE,+BAAqB,aAAa,SAAS,CAAC,KAAKH;AAAA,QACnD;AACA;AAAA,UACE;AAAA,UACA,gBAAgB;AAAA,UAChBE;AAAA,UACAF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,UAAE;AAEA,qBAAiB,cAAc;AAAA,EACjC;AACF;AAWO,SAAS,gBACdA,aACAC,sBACAC,gBACA,aACO;AACP,QAAM,UAAU,kCAAkCF,aAAYC,sBAAqBC,cAAa;AAChG,mBAAiB,SAAS,UAAU,cAAc,6BAA6B;AAC/E,UAAQ,IAAI,qEAAqE;AACjF,UAAQ,KAAK,CAAC;AAChB;;;ACnKA,IAAAE,gBAAwB;AAExB,IAAM,gBAAgB;AAatB,SAAS,kBAAkBC,aAA4B;AAErD,MAAI,CAACA,eAAc,OAAOA,gBAAe,UAAU;AACjD,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AAGA,QAAM,qBAAiB,uBAAQA,WAAU;AAGzC,MAAI,CAAC,kBAAkB,mBAAmB,KAAK;AAC7C,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAEA,SAAO;AACT;AAaO,SAAS,kBAAkB,MAMhC;AAEA,MAAI,KAAK,SAAS,GAAG;AACnB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,cAAc;AAAA,IAChB;AAAA,EACF;AAGA,QAAM,gBAAwB,KAAK,CAAC;AAGpC,MAAIA;AACJ,MAAI;AACF,IAAAA,cAAa,kBAAkB,aAAa;AAAA,EAC9C,SAAS,OAAO;AACd,WAAO;AAAA,MACL,SAAS;AAAA,MACT,cAAc,wBAAwB,OAAO,KAAK,CAAC;AAAA,IACrD;AAAA,EACF;AAGA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,cAAc;AAAA,IACd,MAAM;AAAA,MACJ,YAAAA;AAAA,IACF;AAAA,EACF;AACF;;;AjD9CA,IAAM,mBAAmB,kBAAkB,QAAQ,IAAI;AACvD,IAAI,CAAC,iBAAiB,SAAS;AAC7B,UAAQ,KAAK,iBAAiB,YAAY;AAC1C,UAAQ;AAAA,IACN,sDAAsD,iBAAiB,YAAY;AAAA,EACrF;AACA,UAAQ,IAAI,qEAAqE;AACjF,UAAQ,KAAK,CAAC;AAChB;AAEA,IAAM,EAAE,WAAW,IAAI,iBAAiB;AAGxC,uBAAuB,UAAU;AACjC,kBAAkB,UAAU;AAG5B,4BAA4B,mBAAmB;AAC/C,IAAM;AAAA,EACJ,SAAS;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,IAAI,4BAA4B,UAAU;AAC1C,2BAA2B,mBAAmB;AAE9C,IAAI,CAAC,iBAAiB;AACpB,QAAM,YAAY,aAAa,YAAY,eAAe;AAC1D,QAAM,eAAe,IAAI,SAAS,kEAAkE,cAAc,KAAK,IAAI,CAAC;AAC5H,kBAAgB,QAAQ,YAAY;AAEpC,MAAI,eAAe;AACjB,kCAA8B,YAAY,cAAc,aAAa;AAAA,EACvE;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACF,OAAO;AACL,UAAQ,MAAM,UAAU;AAC1B;AAEA;AAAA,EACE;AAAA,EACA,wFAAwF,UAAU;AACpG;AAGA,gBAAgB,QAAQ,0CAA0C;AAClE,IAAI;AAEJ,IAAI;AACF,8BAA4B,wBAAwB;AACpD,oBAAkB,+BAA+B,UAAU;AAC3D,6BAA2B,wBAAwB;AAEnD;AAAA,IACE;AAAA,IACA,GAAG,gBAAgB,SAAS,IAAI,cAAc,gBAAgB,cAAc,aAAa;AAAA,EAC3F;AAGA,MAAI,gBAAgB,SAAS,OAAO,GAAG;AACrC,eAAW,CAAC,YAAY,OAAO,KAAK,gBAAgB,SAAS,QAAQ,GAAG;AACtE;AAAA,QACE;AAAA,QACA,YAAY,UAAU,aAAa,QAAQ,MAAM,gBAAgB,QAAQ,SAAS,MAAM,0BAA0B,QAAQ,mBAAmB,MAAM;AAAA,MACrJ;AAAA,IACF;AAAA,EACF,OAAO;AAEL;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAEA,QAAI;AACF,YAAM,cAAc,MAAM;AAAA,QACxB,oBAAI,IAAI;AAAA,UACN,GAAG,OAAS,oBAAK,YAAY,UAAU,GAAG;AAAA,YACxC,QAAQ,CAAC,sBAAsB,YAAY;AAAA,YAC3C,sBAAsB;AAAA,UACxB,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AACA;AAAA,QACE;AAAA,QACA,uBAAuB,YAAY,MAAM;AAAA,MAC3C;AAEA,UAAI,YAAY,SAAS,GAAG;AAC1B;AAAA,UACE;AAAA,UACA,qBAAqB,YAAY,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,YAAY,SAAS,IAAI,UAAU,EAAE;AAAA,QACjG;AACA;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,WAAW;AAClB,sBAAgB,QAAQ,6CAA6C,OAAO,SAAS,CAAC,EAAE;AAAA,IAC1F;AAEA,UAAM,iBACJ;AACF,QAAI,eAAe;AACjB,iCAA2B,YAAY,gBAAgB,aAAa;AAAA,IACtE;AAEA,qBAAiB,OAAO,qEAAqE;AAC7F;AAAA,MACE;AAAA,MACA,uBAAuB;AAAA,MACvB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF,SAAS,OAAO;AACd,QAAM,eAAe,yCAAyC,OAAO,KAAK,CAAC;AAC3E,kBAAgB,SAAS,YAAY;AAErC,MAAI,eAAe;AACjB,iCAA6B,YAAY,cAAc,aAAa;AAAA,EACtE;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA,uBAAuB;AAAA,IACvB;AAAA,IACA;AAAA,EACF;AACF;AAGA,4BAA4B,yBAAyB;AACrD,IAAM,qBAAqB,yBAAyB,iBAAiB,YAAY,aAAa;AAC9F,2BAA2B,yBAAyB;AAEpD,IAAI,mBAAmB,SAAS,GAAG;AACjC;AAAA,IACE;AAAA,IACA;AAAA,EACF;AAEA,MAAI,gBAAgB,SAAS,OAAO,GAAG;AACrC,UAAM,eAAe,SAAS,gBAAgB,SAAS,IAAI;AAC3D,oBAAgB,SAAS,YAAY;AAErC,QAAI,eAAe;AACjB,0CAAoC,YAAY,cAAc,aAAa;AAAA,IAC7E;AAEA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACF;AAGA,4BAA4B,aAAa;AACzC,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,2BAA2B,aAAa;AAExC,IAAI,kBAAkB,2BAA2B,GAAG;AAClD;AAAA,IACE;AAAA,IACA,GAAG,kBAAkB,cAAc,eAAe,kBAAkB,UAAU;AAAA,EAChF;AACF;AAGA,IAAM,wBAAkC,CAAC;AACzC,WAAW,WAAW,gBAAgB,SAAS,OAAO,GAAG;AACvD,wBAAsB,KAAK,GAAG,QAAQ,QAAQ;AAChD;AAEA;AAAA,EACE;AAAA,EACA,SAAS,sBAAsB,MAAM,qBAAqB,gBAAgB,cAAc,aAAa;AACvG;AAGA,4BAA4B,iBAAiB;AAC7C,IAAI;AACF,yBAAuB,iBAAiB,oBAAoB,aAAa;AAEzE,MAAI,CAAC,gBAAgB,cAAc,gBAAgB;AACjD;AAAA,MACE;AAAA,MACA,wCAAwC,gBAAgB,cAAc,kBAAkB,kBAAkB,gBAAgB,cAAc,qBAAqB;AAAA,IAC/J;AAEA,eAAW,SAAS,gBAAgB,OAAO,UAAU;AACnD,sBAAgB,SAAS,qBAAqB,MAAM,KAAK,KAAK,MAAM,OAAO,EAAE;AAAA,IAC/E;AAAA,EACF;AAEA,6BAA2B,iBAAiB;AAC5C,0BAAwB,2BAA2B;AACrD,SAAS,OAAO;AACd,6BAA2B,iBAAiB;AAC5C,kBAAgB,SAAS,qCAAqC,OAAO,KAAK,CAAC,EAAE;AAE7E,MAAI,sBAAsB,SAAS,GAAG;AACpC;AAAA,MACE,sBAAsB,CAAC;AAAA,MACvB,qCAAqC,OAAO,KAAK,CAAC;AAAA,MAClD;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AAGA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA;AAAA,EACE;AAAA,EACA,oBAAoB,0CAA0C;AAChE;AAEA;AAAA,EACE;AAAA,EACA,6CAA6C,qBAAqB,eAAe;AACnF;AAEA,QAAQ,IAAI,qEAAqE;",
+  "names": ["import_path", "import_node_url", "balanced", "a", "b", "str", "ma", "maybeMatch", "mb", "range", "reg", "m", "begs", "beg", "left", "right", "result", "ai", "bi", "i", "r", "escSlash", "escOpen", "escClose", "escComma", "escPeriod", "escSlashPattern", "escOpenPattern", "escClosePattern", "escCommaPattern", "escPeriodPattern", "slashPattern", "openPattern", "closePattern", "commaPattern", "periodPattern", "EXPANSION_MAX", "numeric", "escapeBraces", "unescapeBraces", "parseCommaParts", "parts", "pre", "body", "post", "p", "postParts", "expand", "options", "max", "expand_", "embrace", "isPadded", "el", "lte", "y", "gte", "isTop", "expansions", "k", "expansion", "isNumericSequence", "isAlphaSequence", "isSequence", "isOptions", "n", "N", "x", "width", "incr", "test", "pad", "c", "need", "z", "j", "assertValidPattern", "pattern", "posixClasses", "braceEscape", "s", "regexpEscape", "rangesToString", "ranges", "parseClass", "glob", "position", "pos", "negs", "sawStart", "uflag", "escaping", "negate", "endPos", "rangeStart", "WHILE", "cls", "unip", "u", "neg", "sranges", "snegs", "unescape", "windowsPathsNoEscape", "magicalBraces", "types", "isExtglobType", "startNoTraversal", "startNoDot", "addPatternStart", "justDots", "reSpecials", "regExpEscape", "qmark", "star", "starNoEmpty", "AST", "_AST", "#root", "#hasMagic", "#uflag", "#parts", "#parent", "#parentIndex", "#negs", "#filledNegs", "#options", "#toString", "#emptyExt", "type", "parent", "#fillNegs", "pp", "part", "ret", "pl", "#parseAST", "ast", "opt", "inBrace", "braceStart", "braceNeg", "acc", "ext", "re", "hasMagic", "flags", "allowDot", "dot", "noEmpty", "src", "_", "#parseGlob", "start", "aps", "needNoTrav", "needNoDot", "end", "repeated", "#partsToRegExp", "bodyDotAllowed", "final", "close", "_hasMagic", "inStar", "needUflag", "consumed", "magic", "escape", "minimatch", "Minimatch", "starDotExtRE", "starDotExtTest", "f", "starDotExtTestDot", "starDotExtTestNocase", "starDotExtTestNocaseDot", "starDotStarRE", "starDotStarTest", "starDotStarTestDot", "dotStarRE", "dotStarTest", "starRE", "starTest", "starTestDot", "qmarksRE", "qmarksTestNocase", "$0", "noext", "qmarksTestNoExt", "qmarksTestNocaseDot", "qmarksTestNoExtDot", "qmarksTestDot", "qmarksTest", "len", "defaultPlatform", "path", "sep", "GLOBSTAR", "twoStarDot", "twoStarNoDot", "filter", "defaults", "def", "orig", "list", "braceExpand", "makeRe", "match", "mm", "globMagic", "awe", "args", "rawGlobParts", "set", "__", "isUNC", "isDrive", "ss", "globParts", "optimizationLevel", "gs", "prev", "didSomething", "dd", "gss", "next", "p2", "other", "splin", "matched", "emptyGSMatch", "which", "negateOffset", "file", "partial", "fileDrive", "fileUNC", "patternDrive", "patternUNC", "fdi", "pdi", "fd", "pd", "fi", "pi", "fl", "fr", "pr", "swallowee", "hit", "fastTest", "twoStar", "filtered", "prefixes", "open", "ff", "filename", "defaultPerf", "warned", "PROCESS", "emitWarning", "msg", "code", "fn", "AC", "AS", "warnACPolyfill", "reason", "printACPolyfillWarning", "shouldWarn", "isPosInt", "getUintArray", "ZeroArray", "size", "Stack", "_Stack", "#constructing", "HeapCls", "LRUCache", "_LRUCache", "#max", "#maxSize", "#dispose", "#onInsert", "#disposeAfter", "#fetchMethod", "#memoMethod", "#perf", "#size", "#calculatedSize", "#keyMap", "#keyList", "#valList", "#next", "#prev", "#head", "#tail", "#free", "#disposed", "#sizes", "#starts", "#ttls", "#autopurgeTimers", "#hasDispose", "#hasFetchMethod", "#hasDisposeAfter", "#hasOnInsert", "#isBackgroundFetch", "index", "context", "#backgroundFetch", "#moveToTail", "#indexes", "#rindexes", "#isStale", "ttl", "ttlResolution", "ttlAutopurge", "updateAgeOnGet", "updateAgeOnHas", "allowStale", "dispose", "onInsert", "disposeAfter", "noDisposeOnSet", "noUpdateTTL", "maxSize", "maxEntrySize", "sizeCalculation", "fetchMethod", "memoMethod", "noDeleteOnFetchRejection", "noDeleteOnStaleGet", "allowStaleOnFetchRejection", "allowStaleOnFetchAbort", "ignoreFetchAbort", "perf", "UintArray", "#initializeSizeTracking", "#initializeTTLTracking", "key", "ttls", "starts", "purgeTimers", "#setItemTTL", "t", "#delete", "#updateItemAge", "#statusTTL", "status", "cachedNow", "getNow", "age", "sizes", "#removeItemSize", "#requireSize", "v", "#addItemSize", "#evict", "_i", "_s", "_st", "_k", "_v", "#isValidIndex", "getOptions", "value", "thisp", "deleted", "entry", "remain", "arr", "setOptions", "oldVal", "oldValue", "dt", "task", "val", "free", "head", "hasOptions", "peekOptions", "ac", "signal", "fetchOpts", "cb", "updateCache", "aborted", "ignoreAbort", "proceed", "fetchFail", "bf", "vl", "eb", "er", "allowStaleAborted", "noDelete", "pcall", "res", "rej", "fmp", "fetchOptions", "forceRefresh", "stale", "isStale", "staleVal", "memoOptions", "vv", "fetching", "#connect", "#clear", "ni", "proc", "isStream", "Minipass", "Stream", "isReadable", "isWritable", "EventEmitter", "EOF", "MAYBE_EMIT_END", "EMITTED_END", "EMITTING_END", "EMITTED_ERROR", "CLOSED", "READ", "FLUSH", "FLUSHCHUNK", "ENCODING", "DECODER", "FLOWING", "PAUSED", "RESUME", "BUFFER", "PIPES", "BUFFERLENGTH", "BUFFERPUSH", "BUFFERSHIFT", "OBJECTMODE", "DESTROYED", "ERROR", "EMITDATA", "EMITEND", "EMITEND2", "ASYNC", "ABORT", "ABORTED", "SIGNAL", "DATALISTENERS", "DISCARDED", "defer", "nodefer", "isEndish", "ev", "isArrayBufferLike", "isArrayBufferView", "Pipe", "dest", "opts", "_er", "PipeProxyErrors", "isObjectModeOptions", "o", "isEncodingOptions", "StringDecoder", "_enc", "_om", "chunk", "encoding", "noDrain", "ended", "handler", "h", "data", "buf", "resolve", "reject", "stopped", "stop", "onerr", "ondata", "onend", "ondestroy", "wc", "realpathSync", "rps", "defaultFS", "lstatSync", "readdirCB", "readdirSync", "readlinkSync", "lstat", "readdir", "readlink", "realpath", "fsFromOption", "fsOption", "actualFS", "uncDriveRegexp", "uncToDrive", "rootPath", "eitherSep", "UNKNOWN", "IFIFO", "IFCHR", "IFDIR", "IFBLK", "IFREG", "IFLNK", "IFSOCK", "IFMT", "IFMT_UNKNOWN", "READDIR_CALLED", "LSTAT_CALLED", "ENOTDIR", "ENOENT", "ENOREADLINK", "ENOREALPATH", "ENOCHILD", "TYPEMASK", "entToType", "normalizeCache", "L", "normalize", "normalizeNocaseCache", "normalizeNocase", "ResolveCache", "ChildrenCache", "setAsCwd", "PathBase", "#fs", "#dev", "#mode", "#nlink", "#uid", "#gid", "#rdev", "#blksize", "#ino", "#blocks", "#atimeMs", "#mtimeMs", "#ctimeMs", "#birthtimeMs", "#atime", "#mtime", "#ctime", "#birthtime", "#matchName", "#depth", "#fullpath", "#fullpathPosix", "#relative", "#relativePosix", "#type", "#children", "#linkTarget", "#realpath", "name", "root", "roots", "nocase", "children", "dirParts", "#resolveParts", "cached", "pathPart", "fullpath", "pchild", "pv", "fp", "pfpp", "fpp", "ifmt", "target", "read", "linkTarget", "#readlinkFail", "#readdirSuccess", "#markENOENT", "#markChildrenENOENT", "#markENOREALPATH", "#markENOTDIR", "#readdirFail", "#lstatFail", "ter", "#readdirAddChild", "e", "#readdirMaybePromoteChild", "#readdirAddNewChild", "child", "#readdirPromoteChild", "#applyStat", "st", "atime", "atimeMs", "birthtime", "birthtimeMs", "blksize", "blocks", "ctime", "ctimeMs", "dev", "gid", "ino", "mode", "mtime", "mtimeMs", "nlink", "rdev", "uid", "#onReaddirCB", "#readdirCBInFlight", "#callOnReaddirCB", "cbs", "allowZalgo", "entries", "#asyncReaddirInFlight", "dirs", "walkFilter", "rp", "oldCwd", "changed", "PathWin32", "_PathWin32", "win32", "compare", "PathScurryWin32", "PathPosix", "_PathPosix", "_rootPath", "PathScurryBase", "#resolveCache", "#resolvePosixCache", "cwd", "pathImpl", "childrenCacheSize", "fs", "fileURLToPath", "cwdPath", "split", "joinSep", "abs", "sawFirst", "l", "paths", "withFileTypes", "follow", "results", "walk", "dir", "queue", "processing", "process", "paused", "onReaddir", "didRealpaths", "promises", "sync", "PathScurryPosix", "posix", "_dir", "PathScurryDarwin", "Path", "PathScurry", "isPatternList", "isGlobList", "gl", "customInspect", "Pattern", "_Pattern", "#patternList", "#globList", "#index", "#platform", "#rest", "#globString", "#isDrive", "#isUNC", "#isAbsolute", "#followGlobstar", "patternList", "globList", "platform", "p0", "p1", "p3", "prest", "g0", "g1", "g2", "g3", "grest", "g", "Ignore", "ignored", "nobrace", "noglobstar", "ign", "parsed", "absolute", "fullpaths", "relative", "relatives", "HasWalkedCache", "_HasWalkedCache", "store", "MatchRecord", "ifDir", "current", "SubWalks", "subs", "Processor", "_Processor", "hasWalkedCache", "patterns", "processingSet", "rest", "rrest", "tp", "ep", "makeIgnore", "ignore", "GlobUtil", "#onResume", "#ignore", "#sep", "#ignored", "#childrenIgnored", "rpc", "mark", "rel", "processor", "tasks", "childrenCached", "GlobWalker", "GlobStream", "Glob", "Scurry", "nocaseMagicOnly", "mmo", "mms", "matchSet", "globStreamSync", "globStream", "globSync", "glob_", "globIterateSync", "globIterate", "streamSync", "stream", "iterateSync", "iterate", "import_fs", "import_path", "import_fs", "sourceRoot", "dependencyGraph", "sourceRoot", "sourceRoot", "dependencyGraph", "sourceRoot", "import_child_process", "import_path", "import_child_process", "import_path", "match", "import_child_process", "import_fs", "import_path", "import_fs", "import_path", "exception", "re", "match", "map", "schema", "type", "extend", "str", "string", "str", "ai", "bi", "str", "k", "n", "N", "x", "j", "type", "n", "str", "i", "acc", "ext", "map", "nt", "re", "_", "start", "final", "me", "ext", "qmark", "star", "type", "regExpEscape", "_", "set", "ss", "j", "gs", "ai", "bi", "i", "bs", "fi", "pi", "re", "sourceRoot", "platformInfo", "codeqlExePath", "sourceRoot", "errorMessages", "autobuildScriptPath", "sourceRoot", "import_path", "import_fs", "import_path", "dependencyGraph", "validationResult", "sourceRoot", "import_child_process", "import_path", "sourceRoot", "codeqlExePath", "import_child_process", "import_fs", "import_path", "import_child_process", "v", "match", "resolveCdsVersions", "range", "codeqlExePath", "dependencyGraph", "sourceRoot", "projectCacheDirMap", "resolveCdsVersions", "import_child_process", "import_path", "sourceRoot", "dependencyGraph", "codeqlExePath", "sourceRoot", "dependencyGraph", "type", "codeqlExePath", "projectCacheDirMap", "import_path", "import_child_process", "import_path", "sourceRoot", "dependencyGraph", "projectCacheDirMap", "codeqlExePath", "import_path", "import_fs", "import_path", "match", "path", "parentDir", "hasDbDir", "hasSrvDir", "hasAppDir", "dependencyGraph", "import_child_process", "sourceRoot", "autobuildScriptPath", "codeqlExePath", "dependencyGraph", "import_path", "sourceRoot"]
 }
diff --git a/extractors/cds/tools/src/cds/compiler/retry.ts b/extractors/cds/tools/src/cds/compiler/retry.ts
index 27aa6b03f..ff60c3384 100644
--- a/extractors/cds/tools/src/cds/compiler/retry.ts
+++ b/extractors/cds/tools/src/cds/compiler/retry.ts
@@ -1,5 +1,7 @@
 /** Main retry orchestration logic for CDS compilation failures. */
 
+import { join } from 'path';
+
 import { compileCdsToJson } from './compile';
 import type {
   CompilationAttempt,
@@ -16,6 +18,15 @@ import type { CdsDependencyGraph, CdsProject } from '../parser';
 
 /**
  * Add diagnostics only for tasks with `status: failed` in the {@link CdsDependencyGraph}.
+ *
+ * Compilation is project-level: a single failed task represents the whole project's
+ * compilation failure, even though the task's `sourceFiles` may list every CDS file
+ * in the project. To avoid spawning the CodeQL CLI once per source file (which can
+ * take tens of minutes for projects with hundreds of `.cds` files), we emit a single
+ * diagnostic per failed task, attached to the project's `package.json` when available
+ * (or the project directory otherwise), and mention the affected file count in the
+ * message body so that information is preserved.
+ *
  * @param dependencyGraph The dependency graph to use as the source of truth for task status
  * @param codeqlExePath Path to CodeQL executable used to add a diagnostic notification
  * @param sourceRoot Source root directory to use for making file paths relative
@@ -35,14 +46,18 @@ function addCompilationDiagnosticsForFailedTasks(
         const shouldAddDiagnostic = task.retryInfo?.hasBeenRetried ?? !task.retryInfo;
 
         if (shouldAddDiagnostic) {
-          for (const sourceFile of task.sourceFiles) {
-            addCompilationDiagnostic(
-              sourceFile,
-              task.errorSummary ?? 'Compilation failed',
-              codeqlExePath,
-              sourceRoot,
-            );
-          }
+          // Attach the diagnostic to the project's package.json when available,
+          // otherwise fall back to the project directory itself.
+          const diagnosticPath = project.packageJson
+            ? join(project.projectDir, 'package.json')
+            : project.projectDir;
+
+          const fileCount = task.sourceFiles.length;
+          const fileWord = fileCount === 1 ? 'file' : 'files';
+          const baseMessage = task.errorSummary ?? 'Compilation failed';
+          const messageWithCount = `${baseMessage}\n\n${fileCount} CDS ${fileWord} in this project ${fileCount === 1 ? 'was' : 'were'} not extracted.`;
+
+          addCompilationDiagnostic(diagnosticPath, messageWithCount, codeqlExePath, sourceRoot);
         }
       }
     }
diff --git a/extractors/cds/tools/src/diagnostics.ts b/extractors/cds/tools/src/diagnostics.ts
index 0d5ae3ae2..72da98007 100644
--- a/extractors/cds/tools/src/diagnostics.ts
+++ b/extractors/cds/tools/src/diagnostics.ts
@@ -148,7 +148,7 @@ export function addCdsIndexerDiagnostic(
 }
 
 /**
- * Add a diagnostic error to the CodeQL database for a failed CDS compilation
+ * Add a diagnostic warning to the CodeQL database for a failed CDS compilation
  * @param cdsFilePath Path to the CDS file that failed to compile
  * @param errorMessage The error message from the compilation
  * @param codeqlExePath Path to the CodeQL executable
@@ -167,7 +167,7 @@ export function addCompilationDiagnostic(
     codeqlExePath,
     'cds/compilation-failure',
     'Failure to compile one or more SAP CAP CDS files',
-    DiagnosticSeverity.Error,
+    DiagnosticSeverity.Warning,
     'source file',
     sourceRoot,
   );
diff --git a/extractors/cds/tools/test/src/cds/compiler/retry.test.ts b/extractors/cds/tools/test/src/cds/compiler/retry.test.ts
index f0ec1692b..8c609cc9f 100644
--- a/extractors/cds/tools/test/src/cds/compiler/retry.test.ts
+++ b/extractors/cds/tools/test/src/cds/compiler/retry.test.ts
@@ -1,5 +1,7 @@
 /** Tests for retry orchestration logic */
 
+import { join } from 'path';
+
 import * as compile from '../../../../src/cds/compiler/compile';
 import { orchestrateRetryAttempts } from '../../../../src/cds/compiler/retry';
 import type { CompilationTask } from '../../../../src/cds/compiler/types';
@@ -453,10 +455,12 @@ describe('retry.ts', () => {
       // Execute
       orchestrateRetryAttempts(mockDependencyGraph, codeqlExePath);
 
-      // Verify diagnostics are added for failed tasks
+      // Verify a single project-level diagnostic is added (attached to the project's
+      // package.json) rather than one per source file.
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledTimes(1);
       expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledWith(
-        '/test/project/db/schema.cds',
-        expect.any(String),
+        join('test-project', 'package.json'),
+        expect.stringContaining('1 CDS file in this project was not extracted.'),
         codeqlExePath,
         '/test',
       );
@@ -482,9 +486,74 @@ describe('retry.ts', () => {
 
       orchestrateRetryAttempts(mockDependencyGraph, codeqlExePath);
 
-      // Verify diagnostics are added for tasks that were never retried (retryInfo is undefined)
+      // Verify a single project-level diagnostic is added for tasks that were never
+      // retried (retryInfo is undefined), rather than one per source file.
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledTimes(1);
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledWith(
+        join('test-project', 'package.json'),
+        expect.stringContaining('1 CDS file in this project was not extracted.'),
+        codeqlExePath,
+        '/test',
+      );
+    });
+
+    it('should emit a single diagnostic per failed task regardless of source file count', () => {
+      // Setup: A single failed task with many source files (simulating a large project).
+      const manyFiles = Array.from({ length: 250 }, (_, i) => `/test/project/db/file${i}.cds`);
+      const failedTask: CompilationTask = {
+        ...mockFailedTask,
+        sourceFiles: manyFiles,
+        retryInfo: { hasBeenRetried: true, retryReason: 'Test retry' },
+        status: 'failed',
+      };
+      mockProject.compilationTasks = [failedTask];
+      mockProject.cdsFiles = manyFiles;
+
+      const tasksRequiringRetry = new Map([['test-project', [failedTask]]]);
+      mockValidator.identifyTasksRequiringRetry.mockReturnValue(tasksRequiringRetry);
+      mockPackageManager.needsFullDependencyInstallation.mockReturnValue(false);
+
+      mockCompile.compileCdsToJson.mockReturnValue({
+        success: false,
+        message: 'Compilation failed',
+        durationMs: 500,
+      });
+
+      orchestrateRetryAttempts(mockDependencyGraph, codeqlExePath);
+
+      // One diagnostic per failed task — not one per source file.
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledTimes(1);
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledWith(
+        join('test-project', 'package.json'),
+        expect.stringContaining('250 CDS files in this project were not extracted.'),
+        codeqlExePath,
+        '/test',
+      );
+    });
+
+    it('should attach the diagnostic to the project directory when no package.json exists', () => {
+      // Setup: A failed task on a project that has no package.json.
+      const failedTask = { ...mockFailedTask };
+      failedTask.retryInfo = { hasBeenRetried: true, retryReason: 'Test retry' };
+      failedTask.status = 'failed';
+      mockProject.compilationTasks = [failedTask];
+      mockProject.packageJson = undefined;
+
+      const tasksRequiringRetry = new Map([['test-project', [failedTask]]]);
+      mockValidator.identifyTasksRequiringRetry.mockReturnValue(tasksRequiringRetry);
+      mockPackageManager.needsFullDependencyInstallation.mockReturnValue(false);
+
+      mockCompile.compileCdsToJson.mockReturnValue({
+        success: false,
+        message: 'Compilation failed',
+        durationMs: 500,
+      });
+
+      orchestrateRetryAttempts(mockDependencyGraph, codeqlExePath);
+
+      expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledTimes(1);
       expect(mockDiagnostics.addCompilationDiagnostic).toHaveBeenCalledWith(
-        '/test/project/db/schema.cds',
+        'test-project',
         expect.any(String),
         codeqlExePath,
         '/test',
diff --git a/extractors/cds/tools/test/src/diagnostics.test.ts b/extractors/cds/tools/test/src/diagnostics.test.ts
index 888a18cce..77f7bb94a 100644
--- a/extractors/cds/tools/test/src/diagnostics.test.ts
+++ b/extractors/cds/tools/test/src/diagnostics.test.ts
@@ -344,7 +344,7 @@ describe('diagnostics', () => {
             '--ready-for-status-page',
             '--source-id=cds/compilation-failure',
             '--source-name=Failure to compile one or more SAP CAP CDS files',
-            '--severity=error',
+            '--severity=warning',
             `--markdown-message=${errorMessage}`,
             `--file-path=${cdsFilePath}`,
             '--',
@@ -375,7 +375,7 @@ describe('diagnostics', () => {
         expect(result).toBe(false);
         expect(console.error).toHaveBeenCalledWith(
           expect.stringContaining(
-            `ERROR: Failed to add error diagnostic for source file=${cdsFilePath}`,
+            `ERROR: Failed to add warning diagnostic for source file=${cdsFilePath}`,
           ),
         );