vlt 0.0.0-0.1730219793883 → 0.0.0-0.1730226262115

package/commands/list.js.map

@@ -1,6 +1,6 @@
 {
   "version": 3,
-  "sources": ["../../../../../node_modules/.pnpm/balanced-match@1.0.2/node_modules/balanced-match/index.js", "../../../../../node_modules/.pnpm/brace-expansion@2.0.1/node_modules/brace-expansion/index.js", "../../../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/windows.js", "../../../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/mode.js", "../../../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/index.js", "../../../../../node_modules/.pnpm/which@2.0.2/node_modules/which/which.js", "../../../../../node_modules/.pnpm/path-key@3.1.1/node_modules/path-key/index.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/resolveCommand.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/escape.js", "../../../../../node_modules/.pnpm/shebang-regex@3.0.0/node_modules/shebang-regex/index.js", "../../../../../node_modules/.pnpm/shebang-command@2.0.0/node_modules/shebang-command/index.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/readShebang.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/parse.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/enoent.js", "../../../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/index.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/unesc.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/getProp.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/ensureObject.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/stripComments.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/index.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/node.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/types.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/container.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/root.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/selector.js", "../../../../../node_modules/.pnpm/cssesc@3.0.0/node_modules/cssesc/cssesc.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/className.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/comment.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/id.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/namespace.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/tag.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/string.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/pseudo.js", "../../../../../node_modules/.pnpm/util-deprecate@1.0.2/node_modules/util-deprecate/node.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/attribute.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/universal.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/combinator.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/nesting.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/sortAscending.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/tokenTypes.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/tokenize.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/parser.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/processor.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/constructors.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/guards.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/index.js", "../../../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/index.js", "../../../../../src/error-cause/src/index.ts", "../../../../../src/spec/src/index.ts", "../../../../../src/fast-split/src/index.ts", "../../../../../src/semver/src/version.ts", "../../../../../src/semver/src/comparator.ts", "../../../../../src/semver/src/range.ts", "../../../../../src/semver/src/index.ts", "../../../../../src/spec/src/browser.ts", "../../../../../src/dep-id/src/index.ts", "../../../../../src/types/src/index.ts", "../../../../../src/package-json/src/index.ts", "../../../../../node_modules/.pnpm/polite-json@5.0.0/node_modules/polite-json/src/index.ts", "../../../../../src/workspaces/src/index.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/index.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/assert-valid-pattern.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/brace-expressions.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/unescape.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/ast.ts", "../../../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/escape.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/glob.ts", "../../../../../node_modules/.pnpm/lru-cache@11.0.0/node_modules/lru-cache/src/index.ts", "../../../../../node_modules/.pnpm/path-scurry@2.0.0/node_modules/path-scurry/src/index.ts", "../../../../../node_modules/.pnpm/minipass@7.1.2/node_modules/minipass/src/index.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/pattern.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/ignore.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/processor.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/walker.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/has-magic.ts", "../../../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/index.ts", "../../../../../node_modules/.pnpm/graph-run@1.0.4/node_modules/graph-run/src/index.ts", "../../../../../src/satisfies/src/index.ts", "../../../../../src/graph/src/edge.ts", "../../../../../src/graph/src/graph.ts", "../../../../../src/graph/src/lockfile/types.ts", "../../../../../src/graph/src/lockfile/save.ts", "../../../../../src/dep-id/src/browser.ts", "../../../../../src/graph/src/stringify-node.ts", "../../../../../src/graph/src/node.ts", "../../../../../src/graph/src/dependencies.ts", "../../../../../src/graph/src/visualization/json-output.ts", "../../../../../src/graph/src/visualization/human-readable-output.ts", "../../../../../src/graph/src/visualization/mermaid-output.ts", "../../../../../src/graph/src/lockfile/load.ts", "../../../../../src/graph/src/lockfile/load-edges.ts", "../../../../../src/graph/src/lockfile/load-nodes.ts", "../../../../../src/graph/src/actual/load.ts", "../../../../../src/rollback-remove/src/index.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/opt-arg.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/path-arg.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/platform.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/fs.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-posix.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/readdir-or-error.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/ignore-enoent.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-windows.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/fix-eperm.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/retry-busy.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-move-remove.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/default-tmp.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-manual.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-native.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/use-native.ts", "../../../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/index.ts", "../../../../../src/rollback-remove/dist/esm/remove.js", "../../../../../src/graph/src/reify/index.ts", "../../../../../node_modules/.pnpm/promise-call-limit@3.0.2/node_modules/promise-call-limit/src/index.ts", "../../../../../src/graph/src/diff.ts", "../../../../../src/graph/src/reify/add-edge.ts", "../../../../../src/pick-manifest/src/index.ts", "../../../../../src/promise-spawn/src/index.ts", "../../../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/index.ts", "../../../../../node_modules/.pnpm/signal-exit@4.1.0/node_modules/signal-exit/src/signals.ts", "../../../../../node_modules/.pnpm/signal-exit@4.1.0/node_modules/signal-exit/src/index.ts", "../../../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/all-signals.ts", "../../../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/watchdog.ts", "../../../../../node_modules/.pnpm/walk-up-path@4.0.0/node_modules/walk-up-path/src/index.ts", "../../../../../src/graph/src/reify/build.ts", "../../../../../src/graph/src/reify/delete-edge.ts", "../../../../../src/graph/src/index.ts", "../../../../../src/query/src/index.ts", "../../../../../src/query/src/types.ts", "../../../../../src/query/src/attribute.ts", "../../../../../src/query/src/class.ts", "../../../../../src/query/src/combinator.ts", "../../../../../src/query/src/id.ts", "../../../../../src/query/src/pseudo.ts", "../../../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/ansi-styles/index.js", "../../../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/supports-color/index.js", "../../../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/utilities.js", "../../../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/index.js", "../../../../../src/vlt/src/commands/list.ts"],
+  "sources": ["../../../node_modules/.pnpm/balanced-match@1.0.2/node_modules/balanced-match/index.js", "../../../node_modules/.pnpm/brace-expansion@2.0.1/node_modules/brace-expansion/index.js", "../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/windows.js", "../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/mode.js", "../../../node_modules/.pnpm/isexe@2.0.0/node_modules/isexe/index.js", "../../../node_modules/.pnpm/which@2.0.2/node_modules/which/which.js", "../../../node_modules/.pnpm/path-key@3.1.1/node_modules/path-key/index.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/resolveCommand.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/escape.js", "../../../node_modules/.pnpm/shebang-regex@3.0.0/node_modules/shebang-regex/index.js", "../../../node_modules/.pnpm/shebang-command@2.0.0/node_modules/shebang-command/index.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/util/readShebang.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/parse.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/lib/enoent.js", "../../../node_modules/.pnpm/cross-spawn@7.0.3/node_modules/cross-spawn/index.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/unesc.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/getProp.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/ensureObject.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/stripComments.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/util/index.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/node.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/types.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/container.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/root.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/selector.js", "../../../node_modules/.pnpm/cssesc@3.0.0/node_modules/cssesc/cssesc.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/className.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/comment.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/id.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/namespace.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/tag.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/string.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/pseudo.js", "../../../node_modules/.pnpm/util-deprecate@1.0.2/node_modules/util-deprecate/node.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/attribute.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/universal.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/combinator.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/nesting.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/sortAscending.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/tokenTypes.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/tokenize.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/parser.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/processor.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/constructors.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/guards.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/selectors/index.js", "../../../node_modules/.pnpm/postcss-selector-parser@6.1.2/node_modules/postcss-selector-parser/dist/index.js", "../../../src/error-cause/src/index.ts", "../../../src/spec/src/index.ts", "../../../src/fast-split/src/index.ts", "../../../src/semver/src/version.ts", "../../../src/semver/src/comparator.ts", "../../../src/semver/src/range.ts", "../../../src/semver/src/index.ts", "../../../src/spec/src/browser.ts", "../../../src/dep-id/src/index.ts", "../../../src/types/src/index.ts", "../../../src/package-json/src/index.ts", "../../../node_modules/.pnpm/polite-json@5.0.0/node_modules/polite-json/src/index.ts", "../../../src/workspaces/src/index.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/index.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/assert-valid-pattern.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/brace-expressions.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/unescape.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/ast.ts", "../../../node_modules/.pnpm/minimatch@10.0.1/node_modules/minimatch/src/escape.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/glob.ts", "../../../node_modules/.pnpm/lru-cache@11.0.0/node_modules/lru-cache/src/index.ts", "../../../node_modules/.pnpm/path-scurry@2.0.0/node_modules/path-scurry/src/index.ts", "../../../node_modules/.pnpm/minipass@7.1.2/node_modules/minipass/src/index.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/pattern.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/ignore.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/processor.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/walker.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/has-magic.ts", "../../../node_modules/.pnpm/glob@11.0.0/node_modules/glob/src/index.ts", "../../../node_modules/.pnpm/graph-run@1.0.4/node_modules/graph-run/src/index.ts", "../../../src/satisfies/src/index.ts", "../../../src/graph/src/edge.ts", "../../../src/graph/src/graph.ts", "../../../src/graph/src/lockfile/types.ts", "../../../src/graph/src/lockfile/save.ts", "../../../src/dep-id/src/browser.ts", "../../../src/graph/src/stringify-node.ts", "../../../src/graph/src/node.ts", "../../../src/graph/src/dependencies.ts", "../../../src/graph/src/visualization/json-output.ts", "../../../src/graph/src/visualization/human-readable-output.ts", "../../../src/graph/src/visualization/mermaid-output.ts", "../../../src/graph/src/lockfile/load.ts", "../../../src/graph/src/lockfile/load-edges.ts", "../../../src/graph/src/lockfile/load-nodes.ts", "../../../src/graph/src/actual/load.ts", "../../../src/rollback-remove/src/index.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/opt-arg.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/path-arg.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/platform.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/fs.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-posix.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/readdir-or-error.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/ignore-enoent.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-windows.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/fix-eperm.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/retry-busy.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-move-remove.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/default-tmp.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-manual.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/rimraf-native.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/use-native.ts", "../../../node_modules/.pnpm/rimraf@6.0.1/node_modules/rimraf/src/index.ts", "../../../src/rollback-remove/dist/esm/remove.js", "../../../src/graph/src/reify/index.ts", "../../../node_modules/.pnpm/promise-call-limit@3.0.2/node_modules/promise-call-limit/src/index.ts", "../../../src/graph/src/diff.ts", "../../../src/graph/src/reify/add-edge.ts", "../../../src/pick-manifest/src/index.ts", "../../../src/promise-spawn/src/index.ts", "../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/index.ts", "../../../node_modules/.pnpm/signal-exit@4.1.0/node_modules/signal-exit/src/signals.ts", "../../../node_modules/.pnpm/signal-exit@4.1.0/node_modules/signal-exit/src/index.ts", "../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/all-signals.ts", "../../../node_modules/.pnpm/foreground-child@3.3.0/node_modules/foreground-child/src/watchdog.ts", "../../../node_modules/.pnpm/walk-up-path@4.0.0/node_modules/walk-up-path/src/index.ts", "../../../src/graph/src/reify/build.ts", "../../../src/graph/src/reify/delete-edge.ts", "../../../src/graph/src/index.ts", "../../../src/query/src/index.ts", "../../../src/query/src/types.ts", "../../../src/query/src/attribute.ts", "../../../src/query/src/class.ts", "../../../src/query/src/combinator.ts", "../../../src/query/src/id.ts", "../../../src/query/src/pseudo.ts", "../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/ansi-styles/index.js", "../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/supports-color/index.js", "../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/utilities.js", "../../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/index.js", "../../../src/vlt/src/commands/list.ts"],
   "sourcesContent": ["'use strict';\nmodule.exports = balanced;\nfunction balanced(a, b, str) {\n  if (a instanceof RegExp) a = maybeMatch(a, str);\n  if (b instanceof RegExp) b = maybeMatch(b, str);\n\n  var r = range(a, b, str);\n\n  return r && {\n    start: r[0],\n    end: r[1],\n    pre: str.slice(0, r[0]),\n    body: str.slice(r[0] + a.length, r[1]),\n    post: str.slice(r[1] + b.length)\n  };\n}\n\nfunction maybeMatch(reg, str) {\n  var m = str.match(reg);\n  return m ? m[0] : null;\n}\n\nbalanced.range = range;\nfunction range(a, b, str) {\n  var begs, beg, left, right, result;\n  var ai = str.indexOf(a);\n  var bi = str.indexOf(b, ai + 1);\n  var 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        result = [ begs.pop(), bi ];\n      } else {\n        beg = begs.pop();\n        if (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) {\n      result = [ left, right ];\n    }\n  }\n\n  return result;\n}\n", "var balanced = require('balanced-match');\n\nmodule.exports = expandTop;\n\nvar escSlash = '\\0SLASH'+Math.random()+'\\0';\nvar escOpen = '\\0OPEN'+Math.random()+'\\0';\nvar escClose = '\\0CLOSE'+Math.random()+'\\0';\nvar escComma = '\\0COMMA'+Math.random()+'\\0';\nvar escPeriod = '\\0PERIOD'+Math.random()+'\\0';\n\nfunction numeric(str) {\n  return parseInt(str, 10) == str\n    ? parseInt(str, 10)\n    : str.charCodeAt(0);\n}\n\nfunction escapeBraces(str) {\n  return str.split('\\\\\\\\').join(escSlash)\n            .split('\\\\{').join(escOpen)\n            .split('\\\\}').join(escClose)\n            .split('\\\\,').join(escComma)\n            .split('\\\\.').join(escPeriod);\n}\n\nfunction unescapeBraces(str) {\n  return str.split(escSlash).join('\\\\')\n            .split(escOpen).join('{')\n            .split(escClose).join('}')\n            .split(escComma).join(',')\n            .split(escPeriod).join('.');\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}\nfunction parseCommaParts(str) {\n  if (!str)\n    return [''];\n\n  var parts = [];\n  var m = balanced('{', '}', str);\n\n  if (!m)\n    return str.split(',');\n\n  var pre = m.pre;\n  var body = m.body;\n  var post = m.post;\n  var p = pre.split(',');\n\n  p[p.length-1] += '{' + body + '}';\n  var postParts = parseCommaParts(post);\n  if (post.length) {\n    p[p.length-1] += postParts.shift();\n    p.push.apply(p, postParts);\n  }\n\n  parts.push.apply(parts, p);\n\n  return parts;\n}\n\nfunction expandTop(str) {\n  if (!str)\n    return [];\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.substr(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.substr(2);\n  }\n\n  return expand(escapeBraces(str), true).map(unescapeBraces);\n}\n\nfunction embrace(str) {\n  return '{' + str + '}';\n}\nfunction isPadded(el) {\n  return /^-?0\\d/.test(el);\n}\n\nfunction lte(i, y) {\n  return i <= y;\n}\nfunction gte(i, y) {\n  return i >= y;\n}\n\nfunction expand(str, isTop) {\n  var expansions = [];\n\n  var 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  var pre = m.pre;\n  var post = m.post.length\n    ? expand(m.post, false)\n    : [''];\n\n  if (/\\$$/.test(m.pre)) {    \n    for (var k = 0; k < post.length; k++) {\n      var expansion = pre+ '{' + m.body + '}' + post[k];\n      expansions.push(expansion);\n    }\n  } else {\n    var isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body);\n    var isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(m.body);\n    var isSequence = isNumericSequence || isAlphaSequence;\n    var 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);\n      }\n      return [str];\n    }\n\n    var n;\n    if (isSequence) {\n      n = m.body.split(/\\.\\./);\n    } else {\n      n = parseCommaParts(m.body);\n      if (n.length === 1) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand(n[0], false).map(embrace);\n        if (n.length === 1) {\n          return post.map(function(p) {\n            return m.pre + n[0] + p;\n          });\n        }\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    var N;\n\n    if (isSequence) {\n      var x = numeric(n[0]);\n      var y = numeric(n[1]);\n      var width = Math.max(n[0].length, n[1].length)\n      var incr = n.length == 3\n        ? Math.abs(numeric(n[2]))\n        : 1;\n      var test = lte;\n      var reverse = y < x;\n      if (reverse) {\n        incr *= -1;\n        test = gte;\n      }\n      var pad = n.some(isPadded);\n\n      N = [];\n\n      for (var i = x; test(i, y); i += incr) {\n        var c;\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i);\n          if (c === '\\\\')\n            c = '';\n        } else {\n          c = String(i);\n          if (pad) {\n            var need = width - c.length;\n            if (need > 0) {\n              var 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.push(c);\n      }\n    } else {\n      N = [];\n\n      for (var j = 0; j < n.length; j++) {\n        N.push.apply(N, expand(n[j], false));\n      }\n    }\n\n    for (var j = 0; j < N.length; j++) {\n      for (var k = 0; k < post.length; k++) {\n        var expansion = pre + N[j] + post[k];\n        if (!isTop || isSequence || expansion)\n          expansions.push(expansion);\n      }\n    }\n  }\n\n  return expansions;\n}\n\n", "module.exports = isexe\nisexe.sync = sync\n\nvar fs = require('fs')\n\nfunction checkPathExt (path, options) {\n  var pathext = options.pathExt !== undefined ?\n    options.pathExt : process.env.PATHEXT\n\n  if (!pathext) {\n    return true\n  }\n\n  pathext = pathext.split(';')\n  if (pathext.indexOf('') !== -1) {\n    return true\n  }\n  for (var i = 0; i < pathext.length; i++) {\n    var p = pathext[i].toLowerCase()\n    if (p && path.substr(-p.length).toLowerCase() === p) {\n      return true\n    }\n  }\n  return false\n}\n\nfunction checkStat (stat, path, options) {\n  if (!stat.isSymbolicLink() && !stat.isFile()) {\n    return false\n  }\n  return checkPathExt(path, options)\n}\n\nfunction isexe (path, options, cb) {\n  fs.stat(path, function (er, stat) {\n    cb(er, er ? false : checkStat(stat, path, options))\n  })\n}\n\nfunction sync (path, options) {\n  return checkStat(fs.statSync(path), path, options)\n}\n", "module.exports = isexe\nisexe.sync = sync\n\nvar fs = require('fs')\n\nfunction isexe (path, options, cb) {\n  fs.stat(path, function (er, stat) {\n    cb(er, er ? false : checkStat(stat, options))\n  })\n}\n\nfunction sync (path, options) {\n  return checkStat(fs.statSync(path), options)\n}\n\nfunction checkStat (stat, options) {\n  return stat.isFile() && checkMode(stat, options)\n}\n\nfunction checkMode (stat, options) {\n  var mod = stat.mode\n  var uid = stat.uid\n  var gid = stat.gid\n\n  var myUid = options.uid !== undefined ?\n    options.uid : process.getuid && process.getuid()\n  var myGid = options.gid !== undefined ?\n    options.gid : process.getgid && process.getgid()\n\n  var u = parseInt('100', 8)\n  var g = parseInt('010', 8)\n  var o = parseInt('001', 8)\n  var ug = u | g\n\n  var ret = (mod & o) ||\n    (mod & g) && gid === myGid ||\n    (mod & u) && uid === myUid ||\n    (mod & ug) && myUid === 0\n\n  return ret\n}\n", "var fs = require('fs')\nvar core\nif (process.platform === 'win32' || global.TESTING_WINDOWS) {\n  core = require('./windows.js')\n} else {\n  core = require('./mode.js')\n}\n\nmodule.exports = isexe\nisexe.sync = sync\n\nfunction isexe (path, options, cb) {\n  if (typeof options === 'function') {\n    cb = options\n    options = {}\n  }\n\n  if (!cb) {\n    if (typeof Promise !== 'function') {\n      throw new TypeError('callback not provided')\n    }\n\n    return new Promise(function (resolve, reject) {\n      isexe(path, options || {}, function (er, is) {\n        if (er) {\n          reject(er)\n        } else {\n          resolve(is)\n        }\n      })\n    })\n  }\n\n  core(path, options || {}, function (er, is) {\n    // ignore EACCES because that just means we aren't allowed to run it\n    if (er) {\n      if (er.code === 'EACCES' || options && options.ignoreErrors) {\n        er = null\n        is = false\n      }\n    }\n    cb(er, is)\n  })\n}\n\nfunction sync (path, options) {\n  // my kingdom for a filtered catch\n  try {\n    return core.sync(path, options || {})\n  } catch (er) {\n    if (options && options.ignoreErrors || er.code === 'EACCES') {\n      return false\n    } else {\n      throw er\n    }\n  }\n}\n", "const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n", "'use strict';\n\nconst pathKey = (options = {}) => {\n\tconst environment = options.env || process.env;\n\tconst platform = options.platform || process.platform;\n\n\tif (platform !== 'win32') {\n\t\treturn 'PATH';\n\t}\n\n\treturn Object.keys(environment).reverse().find(key => key.toUpperCase() === 'PATH') || 'Path';\n};\n\nmodule.exports = pathKey;\n// TODO: Remove this for the next major release\nmodule.exports.default = pathKey;\n", "'use strict';\n\nconst path = require('path');\nconst which = require('which');\nconst getPathKey = require('path-key');\n\nfunction resolveCommandAttempt(parsed, withoutPathExt) {\n    const env = parsed.options.env || process.env;\n    const cwd = process.cwd();\n    const hasCustomCwd = parsed.options.cwd != null;\n    // Worker threads do not have process.chdir()\n    const shouldSwitchCwd = hasCustomCwd && process.chdir !== undefined && !process.chdir.disabled;\n\n    // If a custom `cwd` was specified, we need to change the process cwd\n    // because `which` will do stat calls but does not support a custom cwd\n    if (shouldSwitchCwd) {\n        try {\n            process.chdir(parsed.options.cwd);\n        } catch (err) {\n            /* Empty */\n        }\n    }\n\n    let resolved;\n\n    try {\n        resolved = which.sync(parsed.command, {\n            path: env[getPathKey({ env })],\n            pathExt: withoutPathExt ? path.delimiter : undefined,\n        });\n    } catch (e) {\n        /* Empty */\n    } finally {\n        if (shouldSwitchCwd) {\n            process.chdir(cwd);\n        }\n    }\n\n    // If we successfully resolved, ensure that an absolute path is returned\n    // Note that when a custom `cwd` was used, we need to resolve to an absolute path based on it\n    if (resolved) {\n        resolved = path.resolve(hasCustomCwd ? parsed.options.cwd : '', resolved);\n    }\n\n    return resolved;\n}\n\nfunction resolveCommand(parsed) {\n    return resolveCommandAttempt(parsed) || resolveCommandAttempt(parsed, true);\n}\n\nmodule.exports = resolveCommand;\n", "'use strict';\n\n// See http://www.robvanderwoude.com/escapechars.php\nconst metaCharsRegExp = /([()\\][%!^\"`<>&|;, *?])/g;\n\nfunction escapeCommand(arg) {\n    // Escape meta chars\n    arg = arg.replace(metaCharsRegExp, '^$1');\n\n    return arg;\n}\n\nfunction escapeArgument(arg, doubleEscapeMetaChars) {\n    // Convert to string\n    arg = `${arg}`;\n\n    // Algorithm below is based on https://qntm.org/cmd\n\n    // Sequence of backslashes followed by a double quote:\n    // double up all the backslashes and escape the double quote\n    arg = arg.replace(/(\\\\*)\"/g, '$1$1\\\\\"');\n\n    // Sequence of backslashes followed by the end of the string\n    // (which will become a double quote later):\n    // double up all the backslashes\n    arg = arg.replace(/(\\\\*)$/, '$1$1');\n\n    // All other backslashes occur literally\n\n    // Quote the whole thing:\n    arg = `\"${arg}\"`;\n\n    // Escape meta chars\n    arg = arg.replace(metaCharsRegExp, '^$1');\n\n    // Double escape meta chars if necessary\n    if (doubleEscapeMetaChars) {\n        arg = arg.replace(metaCharsRegExp, '^$1');\n    }\n\n    return arg;\n}\n\nmodule.exports.command = escapeCommand;\nmodule.exports.argument = escapeArgument;\n", "'use strict';\nmodule.exports = /^#!(.*)/;\n", "'use strict';\nconst shebangRegex = require('shebang-regex');\n\nmodule.exports = (string = '') => {\n\tconst match = string.match(shebangRegex);\n\n\tif (!match) {\n\t\treturn null;\n\t}\n\n\tconst [path, argument] = match[0].replace(/#! ?/, '').split(' ');\n\tconst binary = path.split('/').pop();\n\n\tif (binary === 'env') {\n\t\treturn argument;\n\t}\n\n\treturn argument ? `${binary} ${argument}` : binary;\n};\n", "'use strict';\n\nconst fs = require('fs');\nconst shebangCommand = require('shebang-command');\n\nfunction readShebang(command) {\n    // Read the first 150 bytes from the file\n    const size = 150;\n    const buffer = Buffer.alloc(size);\n\n    let fd;\n\n    try {\n        fd = fs.openSync(command, 'r');\n        fs.readSync(fd, buffer, 0, size, 0);\n        fs.closeSync(fd);\n    } catch (e) { /* Empty */ }\n\n    // Attempt to extract shebang (null is returned if not a shebang)\n    return shebangCommand(buffer.toString());\n}\n\nmodule.exports = readShebang;\n", "'use strict';\n\nconst path = require('path');\nconst resolveCommand = require('./util/resolveCommand');\nconst escape = require('./util/escape');\nconst readShebang = require('./util/readShebang');\n\nconst isWin = process.platform === 'win32';\nconst isExecutableRegExp = /\\.(?:com|exe)$/i;\nconst isCmdShimRegExp = /node_modules[\\\\/].bin[\\\\/][^\\\\/]+\\.cmd$/i;\n\nfunction detectShebang(parsed) {\n    parsed.file = resolveCommand(parsed);\n\n    const shebang = parsed.file && readShebang(parsed.file);\n\n    if (shebang) {\n        parsed.args.unshift(parsed.file);\n        parsed.command = shebang;\n\n        return resolveCommand(parsed);\n    }\n\n    return parsed.file;\n}\n\nfunction parseNonShell(parsed) {\n    if (!isWin) {\n        return parsed;\n    }\n\n    // Detect & add support for shebangs\n    const commandFile = detectShebang(parsed);\n\n    // We don't need a shell if the command filename is an executable\n    const needsShell = !isExecutableRegExp.test(commandFile);\n\n    // If a shell is required, use cmd.exe and take care of escaping everything correctly\n    // Note that `forceShell` is an hidden option used only in tests\n    if (parsed.options.forceShell || needsShell) {\n        // Need to double escape meta chars if the command is a cmd-shim located in `node_modules/.bin/`\n        // The cmd-shim simply calls execute the package bin file with NodeJS, proxying any argument\n        // Because the escape of metachars with ^ gets interpreted when the cmd.exe is first called,\n        // we need to double escape them\n        const needsDoubleEscapeMetaChars = isCmdShimRegExp.test(commandFile);\n\n        // Normalize posix paths into OS compatible paths (e.g.: foo/bar -> foo\\bar)\n        // This is necessary otherwise it will always fail with ENOENT in those cases\n        parsed.command = path.normalize(parsed.command);\n\n        // Escape command & arguments\n        parsed.command = escape.command(parsed.command);\n        parsed.args = parsed.args.map((arg) => escape.argument(arg, needsDoubleEscapeMetaChars));\n\n        const shellCommand = [parsed.command].concat(parsed.args).join(' ');\n\n        parsed.args = ['/d', '/s', '/c', `\"${shellCommand}\"`];\n        parsed.command = process.env.comspec || 'cmd.exe';\n        parsed.options.windowsVerbatimArguments = true; // Tell node's spawn that the arguments are already escaped\n    }\n\n    return parsed;\n}\n\nfunction parse(command, args, options) {\n    // Normalize arguments, similar to nodejs\n    if (args && !Array.isArray(args)) {\n        options = args;\n        args = null;\n    }\n\n    args = args ? args.slice(0) : []; // Clone array to avoid changing the original\n    options = Object.assign({}, options); // Clone object to avoid changing the original\n\n    // Build our parsed object\n    const parsed = {\n        command,\n        args,\n        options,\n        file: undefined,\n        original: {\n            command,\n            args,\n        },\n    };\n\n    // Delegate further parsing to shell or non-shell\n    return options.shell ? parsed : parseNonShell(parsed);\n}\n\nmodule.exports = parse;\n", "'use strict';\n\nconst isWin = process.platform === 'win32';\n\nfunction notFoundError(original, syscall) {\n    return Object.assign(new Error(`${syscall} ${original.command} ENOENT`), {\n        code: 'ENOENT',\n        errno: 'ENOENT',\n        syscall: `${syscall} ${original.command}`,\n        path: original.command,\n        spawnargs: original.args,\n    });\n}\n\nfunction hookChildProcess(cp, parsed) {\n    if (!isWin) {\n        return;\n    }\n\n    const originalEmit = cp.emit;\n\n    cp.emit = function (name, arg1) {\n        // If emitting \"exit\" event and exit code is 1, we need to check if\n        // the command exists and emit an \"error\" instead\n        // See https://github.com/IndigoUnited/node-cross-spawn/issues/16\n        if (name === 'exit') {\n            const err = verifyENOENT(arg1, parsed, 'spawn');\n\n            if (err) {\n                return originalEmit.call(cp, 'error', err);\n            }\n        }\n\n        return originalEmit.apply(cp, arguments); // eslint-disable-line prefer-rest-params\n    };\n}\n\nfunction verifyENOENT(status, parsed) {\n    if (isWin && status === 1 && !parsed.file) {\n        return notFoundError(parsed.original, 'spawn');\n    }\n\n    return null;\n}\n\nfunction verifyENOENTSync(status, parsed) {\n    if (isWin && status === 1 && !parsed.file) {\n        return notFoundError(parsed.original, 'spawnSync');\n    }\n\n    return null;\n}\n\nmodule.exports = {\n    hookChildProcess,\n    verifyENOENT,\n    verifyENOENTSync,\n    notFoundError,\n};\n", "'use strict';\n\nconst cp = require('child_process');\nconst parse = require('./lib/parse');\nconst enoent = require('./lib/enoent');\n\nfunction spawn(command, args, options) {\n    // Parse the arguments\n    const parsed = parse(command, args, options);\n\n    // Spawn the child process\n    const spawned = cp.spawn(parsed.command, parsed.args, parsed.options);\n\n    // Hook into child process \"exit\" event to emit an error if the command\n    // does not exists, see: https://github.com/IndigoUnited/node-cross-spawn/issues/16\n    enoent.hookChildProcess(spawned, parsed);\n\n    return spawned;\n}\n\nfunction spawnSync(command, args, options) {\n    // Parse the arguments\n    const parsed = parse(command, args, options);\n\n    // Spawn the child process\n    const result = cp.spawnSync(parsed.command, parsed.args, parsed.options);\n\n    // Analyze if the command does not exist, see: https://github.com/IndigoUnited/node-cross-spawn/issues/16\n    result.error = result.error || enoent.verifyENOENTSync(result.status, parsed);\n\n    return result;\n}\n\nmodule.exports = spawn;\nmodule.exports.spawn = spawn;\nmodule.exports.sync = spawnSync;\n\nmodule.exports._parse = parse;\nmodule.exports._enoent = enoent;\n", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = unesc;\n// Many thanks for this post which made this migration much easier.\n// https://mathiasbynens.be/notes/css-escapes\n\n/**\n * \n * @param {string} str \n * @returns {[string, number]|undefined}\n */\nfunction gobbleHex(str) {\n  var lower = str.toLowerCase();\n  var hex = '';\n  var spaceTerminated = false;\n  for (var i = 0; i < 6 && lower[i] !== undefined; i++) {\n    var code = lower.charCodeAt(i);\n    // check to see if we are dealing with a valid hex char [a-f|0-9]\n    var valid = code >= 97 && code <= 102 || code >= 48 && code <= 57;\n    // https://drafts.csswg.org/css-syntax/#consume-escaped-code-point\n    spaceTerminated = code === 32;\n    if (!valid) {\n      break;\n    }\n    hex += lower[i];\n  }\n  if (hex.length === 0) {\n    return undefined;\n  }\n  var codePoint = parseInt(hex, 16);\n  var isSurrogate = codePoint >= 0xD800 && codePoint <= 0xDFFF;\n  // Add special case for\n  // \"If this number is zero, or is for a surrogate, or is greater than the maximum allowed code point\"\n  // https://drafts.csswg.org/css-syntax/#maximum-allowed-code-point\n  if (isSurrogate || codePoint === 0x0000 || codePoint > 0x10FFFF) {\n    return [\"\\uFFFD\", hex.length + (spaceTerminated ? 1 : 0)];\n  }\n  return [String.fromCodePoint(codePoint), hex.length + (spaceTerminated ? 1 : 0)];\n}\nvar CONTAINS_ESCAPE = /\\\\/;\nfunction unesc(str) {\n  var needToProcess = CONTAINS_ESCAPE.test(str);\n  if (!needToProcess) {\n    return str;\n  }\n  var ret = \"\";\n  for (var i = 0; i < str.length; i++) {\n    if (str[i] === \"\\\\\") {\n      var gobbled = gobbleHex(str.slice(i + 1, i + 7));\n      if (gobbled !== undefined) {\n        ret += gobbled[0];\n        i += gobbled[1];\n        continue;\n      }\n\n      // Retain a pair of \\\\ if double escaped `\\\\\\\\`\n      // https://github.com/postcss/postcss-selector-parser/commit/268c9a7656fb53f543dc620aa5b73a30ec3ff20e\n      if (str[i + 1] === \"\\\\\") {\n        ret += \"\\\\\";\n        i++;\n        continue;\n      }\n\n      // if \\\\ is at the end of the string retain it\n      // https://github.com/postcss/postcss-selector-parser/commit/01a6b346e3612ce1ab20219acc26abdc259ccefb\n      if (str.length === i + 1) {\n        ret += str[i];\n      }\n      continue;\n    }\n    ret += str[i];\n  }\n  return ret;\n}\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = getProp;\nfunction getProp(obj) {\n  for (var _len = arguments.length, props = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    props[_key - 1] = arguments[_key];\n  }\n  while (props.length > 0) {\n    var prop = props.shift();\n    if (!obj[prop]) {\n      return undefined;\n    }\n    obj = obj[prop];\n  }\n  return obj;\n}\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = ensureObject;\nfunction ensureObject(obj) {\n  for (var _len = arguments.length, props = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    props[_key - 1] = arguments[_key];\n  }\n  while (props.length > 0) {\n    var prop = props.shift();\n    if (!obj[prop]) {\n      obj[prop] = {};\n    }\n    obj = obj[prop];\n  }\n}\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = stripComments;\nfunction stripComments(str) {\n  var s = \"\";\n  var commentStart = str.indexOf(\"/*\");\n  var lastEnd = 0;\n  while (commentStart >= 0) {\n    s = s + str.slice(lastEnd, commentStart);\n    var commentEnd = str.indexOf(\"*/\", commentStart + 2);\n    if (commentEnd < 0) {\n      return s;\n    }\n    lastEnd = commentEnd + 2;\n    commentStart = str.indexOf(\"/*\", lastEnd);\n  }\n  s = s + str.slice(lastEnd);\n  return s;\n}\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports.unesc = exports.stripComments = exports.getProp = exports.ensureObject = void 0;\nvar _unesc = _interopRequireDefault(require(\"./unesc\"));\nexports.unesc = _unesc[\"default\"];\nvar _getProp = _interopRequireDefault(require(\"./getProp\"));\nexports.getProp = _getProp[\"default\"];\nvar _ensureObject = _interopRequireDefault(require(\"./ensureObject\"));\nexports.ensureObject = _ensureObject[\"default\"];\nvar _stripComments = _interopRequireDefault(require(\"./stripComments\"));\nexports.stripComments = _stripComments[\"default\"];\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _util = require(\"../util\");\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nvar cloneNode = function cloneNode(obj, parent) {\n  if (typeof obj !== 'object' || obj === null) {\n    return obj;\n  }\n  var cloned = new obj.constructor();\n  for (var i in obj) {\n    if (!obj.hasOwnProperty(i)) {\n      continue;\n    }\n    var value = obj[i];\n    var type = typeof value;\n    if (i === 'parent' && type === 'object') {\n      if (parent) {\n        cloned[i] = parent;\n      }\n    } else if (value instanceof Array) {\n      cloned[i] = value.map(function (j) {\n        return cloneNode(j, cloned);\n      });\n    } else {\n      cloned[i] = cloneNode(value, cloned);\n    }\n  }\n  return cloned;\n};\nvar Node = /*#__PURE__*/function () {\n  function Node(opts) {\n    if (opts === void 0) {\n      opts = {};\n    }\n    Object.assign(this, opts);\n    this.spaces = this.spaces || {};\n    this.spaces.before = this.spaces.before || '';\n    this.spaces.after = this.spaces.after || '';\n  }\n  var _proto = Node.prototype;\n  _proto.remove = function remove() {\n    if (this.parent) {\n      this.parent.removeChild(this);\n    }\n    this.parent = undefined;\n    return this;\n  };\n  _proto.replaceWith = function replaceWith() {\n    if (this.parent) {\n      for (var index in arguments) {\n        this.parent.insertBefore(this, arguments[index]);\n      }\n      this.remove();\n    }\n    return this;\n  };\n  _proto.next = function next() {\n    return this.parent.at(this.parent.index(this) + 1);\n  };\n  _proto.prev = function prev() {\n    return this.parent.at(this.parent.index(this) - 1);\n  };\n  _proto.clone = function clone(overrides) {\n    if (overrides === void 0) {\n      overrides = {};\n    }\n    var cloned = cloneNode(this);\n    for (var name in overrides) {\n      cloned[name] = overrides[name];\n    }\n    return cloned;\n  }\n\n  /**\n   * Some non-standard syntax doesn't follow normal escaping rules for css.\n   * This allows non standard syntax to be appended to an existing property\n   * by specifying the escaped value. By specifying the escaped value,\n   * illegal characters are allowed to be directly inserted into css output.\n   * @param {string} name the property to set\n   * @param {any} value the unescaped value of the property\n   * @param {string} valueEscaped optional. the escaped value of the property.\n   */;\n  _proto.appendToPropertyAndEscape = function appendToPropertyAndEscape(name, value, valueEscaped) {\n    if (!this.raws) {\n      this.raws = {};\n    }\n    var originalValue = this[name];\n    var originalEscaped = this.raws[name];\n    this[name] = originalValue + value; // this may trigger a setter that updates raws, so it has to be set first.\n    if (originalEscaped || valueEscaped !== value) {\n      this.raws[name] = (originalEscaped || originalValue) + valueEscaped;\n    } else {\n      delete this.raws[name]; // delete any escaped value that was created by the setter.\n    }\n  }\n\n  /**\n   * Some non-standard syntax doesn't follow normal escaping rules for css.\n   * This allows the escaped value to be specified directly, allowing illegal\n   * characters to be directly inserted into css output.\n   * @param {string} name the property to set\n   * @param {any} value the unescaped value of the property\n   * @param {string} valueEscaped the escaped value of the property.\n   */;\n  _proto.setPropertyAndEscape = function setPropertyAndEscape(name, value, valueEscaped) {\n    if (!this.raws) {\n      this.raws = {};\n    }\n    this[name] = value; // this may trigger a setter that updates raws, so it has to be set first.\n    this.raws[name] = valueEscaped;\n  }\n\n  /**\n   * When you want a value to passed through to CSS directly. This method\n   * deletes the corresponding raw value causing the stringifier to fallback\n   * to the unescaped value.\n   * @param {string} name the property to set.\n   * @param {any} value The value that is both escaped and unescaped.\n   */;\n  _proto.setPropertyWithoutEscape = function setPropertyWithoutEscape(name, value) {\n    this[name] = value; // this may trigger a setter that updates raws, so it has to be set first.\n    if (this.raws) {\n      delete this.raws[name];\n    }\n  }\n\n  /**\n   *\n   * @param {number} line The number (starting with 1)\n   * @param {number} column The column number (starting with 1)\n   */;\n  _proto.isAtPosition = function isAtPosition(line, column) {\n    if (this.source && this.source.start && this.source.end) {\n      if (this.source.start.line > line) {\n        return false;\n      }\n      if (this.source.end.line < line) {\n        return false;\n      }\n      if (this.source.start.line === line && this.source.start.column > column) {\n        return false;\n      }\n      if (this.source.end.line === line && this.source.end.column < column) {\n        return false;\n      }\n      return true;\n    }\n    return undefined;\n  };\n  _proto.stringifyProperty = function stringifyProperty(name) {\n    return this.raws && this.raws[name] || this[name];\n  };\n  _proto.valueToString = function valueToString() {\n    return String(this.stringifyProperty(\"value\"));\n  };\n  _proto.toString = function toString() {\n    return [this.rawSpaceBefore, this.valueToString(), this.rawSpaceAfter].join('');\n  };\n  _createClass(Node, [{\n    key: \"rawSpaceBefore\",\n    get: function get() {\n      var rawSpace = this.raws && this.raws.spaces && this.raws.spaces.before;\n      if (rawSpace === undefined) {\n        rawSpace = this.spaces && this.spaces.before;\n      }\n      return rawSpace || \"\";\n    },\n    set: function set(raw) {\n      (0, _util.ensureObject)(this, \"raws\", \"spaces\");\n      this.raws.spaces.before = raw;\n    }\n  }, {\n    key: \"rawSpaceAfter\",\n    get: function get() {\n      var rawSpace = this.raws && this.raws.spaces && this.raws.spaces.after;\n      if (rawSpace === undefined) {\n        rawSpace = this.spaces.after;\n      }\n      return rawSpace || \"\";\n    },\n    set: function set(raw) {\n      (0, _util.ensureObject)(this, \"raws\", \"spaces\");\n      this.raws.spaces.after = raw;\n    }\n  }]);\n  return Node;\n}();\nexports[\"default\"] = Node;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports.UNIVERSAL = exports.TAG = exports.STRING = exports.SELECTOR = exports.ROOT = exports.PSEUDO = exports.NESTING = exports.ID = exports.COMMENT = exports.COMBINATOR = exports.CLASS = exports.ATTRIBUTE = void 0;\nvar TAG = 'tag';\nexports.TAG = TAG;\nvar STRING = 'string';\nexports.STRING = STRING;\nvar SELECTOR = 'selector';\nexports.SELECTOR = SELECTOR;\nvar ROOT = 'root';\nexports.ROOT = ROOT;\nvar PSEUDO = 'pseudo';\nexports.PSEUDO = PSEUDO;\nvar NESTING = 'nesting';\nexports.NESTING = NESTING;\nvar ID = 'id';\nexports.ID = ID;\nvar COMMENT = 'comment';\nexports.COMMENT = COMMENT;\nvar COMBINATOR = 'combinator';\nexports.COMBINATOR = COMBINATOR;\nvar CLASS = 'class';\nexports.CLASS = CLASS;\nvar ATTRIBUTE = 'attribute';\nexports.ATTRIBUTE = ATTRIBUTE;\nvar UNIVERSAL = 'universal';\nexports.UNIVERSAL = UNIVERSAL;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar types = _interopRequireWildcard(require(\"./types\"));\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Container = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(Container, _Node);\n  function Container(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    if (!_this.nodes) {\n      _this.nodes = [];\n    }\n    return _this;\n  }\n  var _proto = Container.prototype;\n  _proto.append = function append(selector) {\n    selector.parent = this;\n    this.nodes.push(selector);\n    return this;\n  };\n  _proto.prepend = function prepend(selector) {\n    selector.parent = this;\n    this.nodes.unshift(selector);\n    return this;\n  };\n  _proto.at = function at(index) {\n    return this.nodes[index];\n  };\n  _proto.index = function index(child) {\n    if (typeof child === 'number') {\n      return child;\n    }\n    return this.nodes.indexOf(child);\n  };\n  _proto.removeChild = function removeChild(child) {\n    child = this.index(child);\n    this.at(child).parent = undefined;\n    this.nodes.splice(child, 1);\n    var index;\n    for (var id in this.indexes) {\n      index = this.indexes[id];\n      if (index >= child) {\n        this.indexes[id] = index - 1;\n      }\n    }\n    return this;\n  };\n  _proto.removeAll = function removeAll() {\n    for (var _iterator = _createForOfIteratorHelperLoose(this.nodes), _step; !(_step = _iterator()).done;) {\n      var node = _step.value;\n      node.parent = undefined;\n    }\n    this.nodes = [];\n    return this;\n  };\n  _proto.empty = function empty() {\n    return this.removeAll();\n  };\n  _proto.insertAfter = function insertAfter(oldNode, newNode) {\n    newNode.parent = this;\n    var oldIndex = this.index(oldNode);\n    this.nodes.splice(oldIndex + 1, 0, newNode);\n    newNode.parent = this;\n    var index;\n    for (var id in this.indexes) {\n      index = this.indexes[id];\n      if (oldIndex <= index) {\n        this.indexes[id] = index + 1;\n      }\n    }\n    return this;\n  };\n  _proto.insertBefore = function insertBefore(oldNode, newNode) {\n    newNode.parent = this;\n    var oldIndex = this.index(oldNode);\n    this.nodes.splice(oldIndex, 0, newNode);\n    newNode.parent = this;\n    var index;\n    for (var id in this.indexes) {\n      index = this.indexes[id];\n      if (index <= oldIndex) {\n        this.indexes[id] = index + 1;\n      }\n    }\n    return this;\n  };\n  _proto._findChildAtPosition = function _findChildAtPosition(line, col) {\n    var found = undefined;\n    this.each(function (node) {\n      if (node.atPosition) {\n        var foundChild = node.atPosition(line, col);\n        if (foundChild) {\n          found = foundChild;\n          return false;\n        }\n      } else if (node.isAtPosition(line, col)) {\n        found = node;\n        return false;\n      }\n    });\n    return found;\n  }\n\n  /**\n   * Return the most specific node at the line and column number given.\n   * The source location is based on the original parsed location, locations aren't\n   * updated as selector nodes are mutated.\n   * \n   * Note that this location is relative to the location of the first character\n   * of the selector, and not the location of the selector in the overall document\n   * when used in conjunction with postcss.\n   *\n   * If not found, returns undefined.\n   * @param {number} line The line number of the node to find. (1-based index)\n   * @param {number} col  The column number of the node to find. (1-based index)\n   */;\n  _proto.atPosition = function atPosition(line, col) {\n    if (this.isAtPosition(line, col)) {\n      return this._findChildAtPosition(line, col) || this;\n    } else {\n      return undefined;\n    }\n  };\n  _proto._inferEndPosition = function _inferEndPosition() {\n    if (this.last && this.last.source && this.last.source.end) {\n      this.source = this.source || {};\n      this.source.end = this.source.end || {};\n      Object.assign(this.source.end, this.last.source.end);\n    }\n  };\n  _proto.each = function each(callback) {\n    if (!this.lastEach) {\n      this.lastEach = 0;\n    }\n    if (!this.indexes) {\n      this.indexes = {};\n    }\n    this.lastEach++;\n    var id = this.lastEach;\n    this.indexes[id] = 0;\n    if (!this.length) {\n      return undefined;\n    }\n    var index, result;\n    while (this.indexes[id] < this.length) {\n      index = this.indexes[id];\n      result = callback(this.at(index), index);\n      if (result === false) {\n        break;\n      }\n      this.indexes[id] += 1;\n    }\n    delete this.indexes[id];\n    if (result === false) {\n      return false;\n    }\n  };\n  _proto.walk = function walk(callback) {\n    return this.each(function (node, i) {\n      var result = callback(node, i);\n      if (result !== false && node.length) {\n        result = node.walk(callback);\n      }\n      if (result === false) {\n        return false;\n      }\n    });\n  };\n  _proto.walkAttributes = function walkAttributes(callback) {\n    var _this2 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.ATTRIBUTE) {\n        return callback.call(_this2, selector);\n      }\n    });\n  };\n  _proto.walkClasses = function walkClasses(callback) {\n    var _this3 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.CLASS) {\n        return callback.call(_this3, selector);\n      }\n    });\n  };\n  _proto.walkCombinators = function walkCombinators(callback) {\n    var _this4 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.COMBINATOR) {\n        return callback.call(_this4, selector);\n      }\n    });\n  };\n  _proto.walkComments = function walkComments(callback) {\n    var _this5 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.COMMENT) {\n        return callback.call(_this5, selector);\n      }\n    });\n  };\n  _proto.walkIds = function walkIds(callback) {\n    var _this6 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.ID) {\n        return callback.call(_this6, selector);\n      }\n    });\n  };\n  _proto.walkNesting = function walkNesting(callback) {\n    var _this7 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.NESTING) {\n        return callback.call(_this7, selector);\n      }\n    });\n  };\n  _proto.walkPseudos = function walkPseudos(callback) {\n    var _this8 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.PSEUDO) {\n        return callback.call(_this8, selector);\n      }\n    });\n  };\n  _proto.walkTags = function walkTags(callback) {\n    var _this9 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.TAG) {\n        return callback.call(_this9, selector);\n      }\n    });\n  };\n  _proto.walkUniversals = function walkUniversals(callback) {\n    var _this10 = this;\n    return this.walk(function (selector) {\n      if (selector.type === types.UNIVERSAL) {\n        return callback.call(_this10, selector);\n      }\n    });\n  };\n  _proto.split = function split(callback) {\n    var _this11 = this;\n    var current = [];\n    return this.reduce(function (memo, node, index) {\n      var split = callback.call(_this11, node);\n      current.push(node);\n      if (split) {\n        memo.push(current);\n        current = [];\n      } else if (index === _this11.length - 1) {\n        memo.push(current);\n      }\n      return memo;\n    }, []);\n  };\n  _proto.map = function map(callback) {\n    return this.nodes.map(callback);\n  };\n  _proto.reduce = function reduce(callback, memo) {\n    return this.nodes.reduce(callback, memo);\n  };\n  _proto.every = function every(callback) {\n    return this.nodes.every(callback);\n  };\n  _proto.some = function some(callback) {\n    return this.nodes.some(callback);\n  };\n  _proto.filter = function filter(callback) {\n    return this.nodes.filter(callback);\n  };\n  _proto.sort = function sort(callback) {\n    return this.nodes.sort(callback);\n  };\n  _proto.toString = function toString() {\n    return this.map(String).join('');\n  };\n  _createClass(Container, [{\n    key: \"first\",\n    get: function get() {\n      return this.at(0);\n    }\n  }, {\n    key: \"last\",\n    get: function get() {\n      return this.at(this.length - 1);\n    }\n  }, {\n    key: \"length\",\n    get: function get() {\n      return this.nodes.length;\n    }\n  }]);\n  return Container;\n}(_node[\"default\"]);\nexports[\"default\"] = Container;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _container = _interopRequireDefault(require(\"./container\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Root = /*#__PURE__*/function (_Container) {\n  _inheritsLoose(Root, _Container);\n  function Root(opts) {\n    var _this;\n    _this = _Container.call(this, opts) || this;\n    _this.type = _types.ROOT;\n    return _this;\n  }\n  var _proto = Root.prototype;\n  _proto.toString = function toString() {\n    var str = this.reduce(function (memo, selector) {\n      memo.push(String(selector));\n      return memo;\n    }, []).join(',');\n    return this.trailingComma ? str + ',' : str;\n  };\n  _proto.error = function error(message, options) {\n    if (this._error) {\n      return this._error(message, options);\n    } else {\n      return new Error(message);\n    }\n  };\n  _createClass(Root, [{\n    key: \"errorGenerator\",\n    set: function set(handler) {\n      this._error = handler;\n    }\n  }]);\n  return Root;\n}(_container[\"default\"]);\nexports[\"default\"] = Root;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _container = _interopRequireDefault(require(\"./container\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Selector = /*#__PURE__*/function (_Container) {\n  _inheritsLoose(Selector, _Container);\n  function Selector(opts) {\n    var _this;\n    _this = _Container.call(this, opts) || this;\n    _this.type = _types.SELECTOR;\n    return _this;\n  }\n  return Selector;\n}(_container[\"default\"]);\nexports[\"default\"] = Selector;\nmodule.exports = exports.default;", "/*! https://mths.be/cssesc v3.0.0 by @mathias */\n'use strict';\n\nvar object = {};\nvar hasOwnProperty = object.hasOwnProperty;\nvar merge = function merge(options, defaults) {\n\tif (!options) {\n\t\treturn defaults;\n\t}\n\tvar result = {};\n\tfor (var key in defaults) {\n\t\t// `if (defaults.hasOwnProperty(key) { \u2026 }` is not needed here, since\n\t\t// only recognized option names are used.\n\t\tresult[key] = hasOwnProperty.call(options, key) ? options[key] : defaults[key];\n\t}\n\treturn result;\n};\n\nvar regexAnySingleEscape = /[ -,\\.\\/:-@\\[-\\^`\\{-~]/;\nvar regexSingleEscape = /[ -,\\.\\/:-@\\[\\]\\^`\\{-~]/;\nvar regexAlwaysEscape = /['\"\\\\]/;\nvar regexExcessiveSpaces = /(^|\\\\+)?(\\\\[A-F0-9]{1,6})\\x20(?![a-fA-F0-9\\x20])/g;\n\n// https://mathiasbynens.be/notes/css-escapes#css\nvar cssesc = function cssesc(string, options) {\n\toptions = merge(options, cssesc.options);\n\tif (options.quotes != 'single' && options.quotes != 'double') {\n\t\toptions.quotes = 'single';\n\t}\n\tvar quote = options.quotes == 'double' ? '\"' : '\\'';\n\tvar isIdentifier = options.isIdentifier;\n\n\tvar firstChar = string.charAt(0);\n\tvar output = '';\n\tvar counter = 0;\n\tvar length = string.length;\n\twhile (counter < length) {\n\t\tvar character = string.charAt(counter++);\n\t\tvar codePoint = character.charCodeAt();\n\t\tvar value = void 0;\n\t\t// If it\u2019s not a printable ASCII character\u2026\n\t\tif (codePoint < 0x20 || codePoint > 0x7E) {\n\t\t\tif (codePoint >= 0xD800 && codePoint <= 0xDBFF && counter < length) {\n\t\t\t\t// It\u2019s a high surrogate, and there is a next character.\n\t\t\t\tvar extra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) {\n\t\t\t\t\t// next character is low surrogate\n\t\t\t\t\tcodePoint = ((codePoint & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000;\n\t\t\t\t} else {\n\t\t\t\t\t// It\u2019s an unmatched surrogate; only append this code unit, in case\n\t\t\t\t\t// the next code unit is the high surrogate of a surrogate pair.\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvalue = '\\\\' + codePoint.toString(16).toUpperCase() + ' ';\n\t\t} else {\n\t\t\tif (options.escapeEverything) {\n\t\t\t\tif (regexAnySingleEscape.test(character)) {\n\t\t\t\t\tvalue = '\\\\' + character;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = '\\\\' + codePoint.toString(16).toUpperCase() + ' ';\n\t\t\t\t}\n\t\t\t} else if (/[\\t\\n\\f\\r\\x0B]/.test(character)) {\n\t\t\t\tvalue = '\\\\' + codePoint.toString(16).toUpperCase() + ' ';\n\t\t\t} else if (character == '\\\\' || !isIdentifier && (character == '\"' && quote == character || character == '\\'' && quote == character) || isIdentifier && regexSingleEscape.test(character)) {\n\t\t\t\tvalue = '\\\\' + character;\n\t\t\t} else {\n\t\t\t\tvalue = character;\n\t\t\t}\n\t\t}\n\t\toutput += value;\n\t}\n\n\tif (isIdentifier) {\n\t\tif (/^-[-\\d]/.test(output)) {\n\t\t\toutput = '\\\\-' + output.slice(1);\n\t\t} else if (/\\d/.test(firstChar)) {\n\t\t\toutput = '\\\\3' + firstChar + ' ' + output.slice(1);\n\t\t}\n\t}\n\n\t// Remove spaces after `\\HEX` escapes that are not followed by a hex digit,\n\t// since they\u2019re redundant. Note that this is only possible if the escape\n\t// sequence isn\u2019t preceded by an odd number of backslashes.\n\toutput = output.replace(regexExcessiveSpaces, function ($0, $1, $2) {\n\t\tif ($1 && $1.length % 2) {\n\t\t\t// It\u2019s not safe to remove the space, so don\u2019t.\n\t\t\treturn $0;\n\t\t}\n\t\t// Strip the space.\n\t\treturn ($1 || '') + $2;\n\t});\n\n\tif (!isIdentifier && options.wrap) {\n\t\treturn quote + output + quote;\n\t}\n\treturn output;\n};\n\n// Expose default options (so they can be overridden globally).\ncssesc.options = {\n\t'escapeEverything': false,\n\t'isIdentifier': false,\n\t'quotes': 'single',\n\t'wrap': false\n};\n\ncssesc.version = '3.0.0';\n\nmodule.exports = cssesc;\n", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _cssesc = _interopRequireDefault(require(\"cssesc\"));\nvar _util = require(\"../util\");\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar ClassName = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(ClassName, _Node);\n  function ClassName(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.CLASS;\n    _this._constructed = true;\n    return _this;\n  }\n  var _proto = ClassName.prototype;\n  _proto.valueToString = function valueToString() {\n    return '.' + _Node.prototype.valueToString.call(this);\n  };\n  _createClass(ClassName, [{\n    key: \"value\",\n    get: function get() {\n      return this._value;\n    },\n    set: function set(v) {\n      if (this._constructed) {\n        var escaped = (0, _cssesc[\"default\"])(v, {\n          isIdentifier: true\n        });\n        if (escaped !== v) {\n          (0, _util.ensureObject)(this, \"raws\");\n          this.raws.value = escaped;\n        } else if (this.raws) {\n          delete this.raws.value;\n        }\n      }\n      this._value = v;\n    }\n  }]);\n  return ClassName;\n}(_node[\"default\"]);\nexports[\"default\"] = ClassName;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Comment = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(Comment, _Node);\n  function Comment(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.COMMENT;\n    return _this;\n  }\n  return Comment;\n}(_node[\"default\"]);\nexports[\"default\"] = Comment;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar ID = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(ID, _Node);\n  function ID(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.ID;\n    return _this;\n  }\n  var _proto = ID.prototype;\n  _proto.valueToString = function valueToString() {\n    return '#' + _Node.prototype.valueToString.call(this);\n  };\n  return ID;\n}(_node[\"default\"]);\nexports[\"default\"] = ID;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _cssesc = _interopRequireDefault(require(\"cssesc\"));\nvar _util = require(\"../util\");\nvar _node = _interopRequireDefault(require(\"./node\"));\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Namespace = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(Namespace, _Node);\n  function Namespace() {\n    return _Node.apply(this, arguments) || this;\n  }\n  var _proto = Namespace.prototype;\n  _proto.qualifiedName = function qualifiedName(value) {\n    if (this.namespace) {\n      return this.namespaceString + \"|\" + value;\n    } else {\n      return value;\n    }\n  };\n  _proto.valueToString = function valueToString() {\n    return this.qualifiedName(_Node.prototype.valueToString.call(this));\n  };\n  _createClass(Namespace, [{\n    key: \"namespace\",\n    get: function get() {\n      return this._namespace;\n    },\n    set: function set(namespace) {\n      if (namespace === true || namespace === \"*\" || namespace === \"&\") {\n        this._namespace = namespace;\n        if (this.raws) {\n          delete this.raws.namespace;\n        }\n        return;\n      }\n      var escaped = (0, _cssesc[\"default\"])(namespace, {\n        isIdentifier: true\n      });\n      this._namespace = namespace;\n      if (escaped !== namespace) {\n        (0, _util.ensureObject)(this, \"raws\");\n        this.raws.namespace = escaped;\n      } else if (this.raws) {\n        delete this.raws.namespace;\n      }\n    }\n  }, {\n    key: \"ns\",\n    get: function get() {\n      return this._namespace;\n    },\n    set: function set(namespace) {\n      this.namespace = namespace;\n    }\n  }, {\n    key: \"namespaceString\",\n    get: function get() {\n      if (this.namespace) {\n        var ns = this.stringifyProperty(\"namespace\");\n        if (ns === true) {\n          return '';\n        } else {\n          return ns;\n        }\n      } else {\n        return '';\n      }\n    }\n  }]);\n  return Namespace;\n}(_node[\"default\"]);\nexports[\"default\"] = Namespace;\n;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _namespace = _interopRequireDefault(require(\"./namespace\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Tag = /*#__PURE__*/function (_Namespace) {\n  _inheritsLoose(Tag, _Namespace);\n  function Tag(opts) {\n    var _this;\n    _this = _Namespace.call(this, opts) || this;\n    _this.type = _types.TAG;\n    return _this;\n  }\n  return Tag;\n}(_namespace[\"default\"]);\nexports[\"default\"] = Tag;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar String = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(String, _Node);\n  function String(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.STRING;\n    return _this;\n  }\n  return String;\n}(_node[\"default\"]);\nexports[\"default\"] = String;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _container = _interopRequireDefault(require(\"./container\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Pseudo = /*#__PURE__*/function (_Container) {\n  _inheritsLoose(Pseudo, _Container);\n  function Pseudo(opts) {\n    var _this;\n    _this = _Container.call(this, opts) || this;\n    _this.type = _types.PSEUDO;\n    return _this;\n  }\n  var _proto = Pseudo.prototype;\n  _proto.toString = function toString() {\n    var params = this.length ? '(' + this.map(String).join(',') + ')' : '';\n    return [this.rawSpaceBefore, this.stringifyProperty(\"value\"), params, this.rawSpaceAfter].join('');\n  };\n  return Pseudo;\n}(_container[\"default\"]);\nexports[\"default\"] = Pseudo;\nmodule.exports = exports.default;", "\n/**\n * For Node.js, simply re-export the core `util.deprecate` function.\n */\n\nmodule.exports = require('util').deprecate;\n", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nexports.unescapeValue = unescapeValue;\nvar _cssesc = _interopRequireDefault(require(\"cssesc\"));\nvar _unesc = _interopRequireDefault(require(\"../util/unesc\"));\nvar _namespace = _interopRequireDefault(require(\"./namespace\"));\nvar _types = require(\"./types\");\nvar _CSSESC_QUOTE_OPTIONS;\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar deprecate = require(\"util-deprecate\");\nvar WRAPPED_IN_QUOTES = /^('|\")([^]*)\\1$/;\nvar warnOfDeprecatedValueAssignment = deprecate(function () {}, \"Assigning an attribute a value containing characters that might need to be escaped is deprecated. \" + \"Call attribute.setValue() instead.\");\nvar warnOfDeprecatedQuotedAssignment = deprecate(function () {}, \"Assigning attr.quoted is deprecated and has no effect. Assign to attr.quoteMark instead.\");\nvar warnOfDeprecatedConstructor = deprecate(function () {}, \"Constructing an Attribute selector with a value without specifying quoteMark is deprecated. Note: The value should be unescaped now.\");\nfunction unescapeValue(value) {\n  var deprecatedUsage = false;\n  var quoteMark = null;\n  var unescaped = value;\n  var m = unescaped.match(WRAPPED_IN_QUOTES);\n  if (m) {\n    quoteMark = m[1];\n    unescaped = m[2];\n  }\n  unescaped = (0, _unesc[\"default\"])(unescaped);\n  if (unescaped !== value) {\n    deprecatedUsage = true;\n  }\n  return {\n    deprecatedUsage: deprecatedUsage,\n    unescaped: unescaped,\n    quoteMark: quoteMark\n  };\n}\nfunction handleDeprecatedContructorOpts(opts) {\n  if (opts.quoteMark !== undefined) {\n    return opts;\n  }\n  if (opts.value === undefined) {\n    return opts;\n  }\n  warnOfDeprecatedConstructor();\n  var _unescapeValue = unescapeValue(opts.value),\n    quoteMark = _unescapeValue.quoteMark,\n    unescaped = _unescapeValue.unescaped;\n  if (!opts.raws) {\n    opts.raws = {};\n  }\n  if (opts.raws.value === undefined) {\n    opts.raws.value = opts.value;\n  }\n  opts.value = unescaped;\n  opts.quoteMark = quoteMark;\n  return opts;\n}\nvar Attribute = /*#__PURE__*/function (_Namespace) {\n  _inheritsLoose(Attribute, _Namespace);\n  function Attribute(opts) {\n    var _this;\n    if (opts === void 0) {\n      opts = {};\n    }\n    _this = _Namespace.call(this, handleDeprecatedContructorOpts(opts)) || this;\n    _this.type = _types.ATTRIBUTE;\n    _this.raws = _this.raws || {};\n    Object.defineProperty(_this.raws, 'unquoted', {\n      get: deprecate(function () {\n        return _this.value;\n      }, \"attr.raws.unquoted is deprecated. Call attr.value instead.\"),\n      set: deprecate(function () {\n        return _this.value;\n      }, \"Setting attr.raws.unquoted is deprecated and has no effect. attr.value is unescaped by default now.\")\n    });\n    _this._constructed = true;\n    return _this;\n  }\n\n  /**\n   * Returns the Attribute's value quoted such that it would be legal to use\n   * in the value of a css file. The original value's quotation setting\n   * used for stringification is left unchanged. See `setValue(value, options)`\n   * if you want to control the quote settings of a new value for the attribute.\n   *\n   * You can also change the quotation used for the current value by setting quoteMark.\n   *\n   * Options:\n   *   * quoteMark {'\"' | \"'\" | null} - Use this value to quote the value. If this\n   *     option is not set, the original value for quoteMark will be used. If\n   *     indeterminate, a double quote is used. The legal values are:\n   *     * `null` - the value will be unquoted and characters will be escaped as necessary.\n   *     * `'` - the value will be quoted with a single quote and single quotes are escaped.\n   *     * `\"` - the value will be quoted with a double quote and double quotes are escaped.\n   *   * preferCurrentQuoteMark {boolean} - if true, prefer the source quote mark\n   *     over the quoteMark option value.\n   *   * smart {boolean} - if true, will select a quote mark based on the value\n   *     and the other options specified here. See the `smartQuoteMark()`\n   *     method.\n   **/\n  var _proto = Attribute.prototype;\n  _proto.getQuotedValue = function getQuotedValue(options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var quoteMark = this._determineQuoteMark(options);\n    var cssescopts = CSSESC_QUOTE_OPTIONS[quoteMark];\n    var escaped = (0, _cssesc[\"default\"])(this._value, cssescopts);\n    return escaped;\n  };\n  _proto._determineQuoteMark = function _determineQuoteMark(options) {\n    return options.smart ? this.smartQuoteMark(options) : this.preferredQuoteMark(options);\n  }\n\n  /**\n   * Set the unescaped value with the specified quotation options. The value\n   * provided must not include any wrapping quote marks -- those quotes will\n   * be interpreted as part of the value and escaped accordingly.\n   */;\n  _proto.setValue = function setValue(value, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    this._value = value;\n    this._quoteMark = this._determineQuoteMark(options);\n    this._syncRawValue();\n  }\n\n  /**\n   * Intelligently select a quoteMark value based on the value's contents. If\n   * the value is a legal CSS ident, it will not be quoted. Otherwise a quote\n   * mark will be picked that minimizes the number of escapes.\n   *\n   * If there's no clear winner, the quote mark from these options is used,\n   * then the source quote mark (this is inverted if `preferCurrentQuoteMark` is\n   * true). If the quoteMark is unspecified, a double quote is used.\n   *\n   * @param options This takes the quoteMark and preferCurrentQuoteMark options\n   * from the quoteValue method.\n   */;\n  _proto.smartQuoteMark = function smartQuoteMark(options) {\n    var v = this.value;\n    var numSingleQuotes = v.replace(/[^']/g, '').length;\n    var numDoubleQuotes = v.replace(/[^\"]/g, '').length;\n    if (numSingleQuotes + numDoubleQuotes === 0) {\n      var escaped = (0, _cssesc[\"default\"])(v, {\n        isIdentifier: true\n      });\n      if (escaped === v) {\n        return Attribute.NO_QUOTE;\n      } else {\n        var pref = this.preferredQuoteMark(options);\n        if (pref === Attribute.NO_QUOTE) {\n          // pick a quote mark that isn't none and see if it's smaller\n          var quote = this.quoteMark || options.quoteMark || Attribute.DOUBLE_QUOTE;\n          var opts = CSSESC_QUOTE_OPTIONS[quote];\n          var quoteValue = (0, _cssesc[\"default\"])(v, opts);\n          if (quoteValue.length < escaped.length) {\n            return quote;\n          }\n        }\n        return pref;\n      }\n    } else if (numDoubleQuotes === numSingleQuotes) {\n      return this.preferredQuoteMark(options);\n    } else if (numDoubleQuotes < numSingleQuotes) {\n      return Attribute.DOUBLE_QUOTE;\n    } else {\n      return Attribute.SINGLE_QUOTE;\n    }\n  }\n\n  /**\n   * Selects the preferred quote mark based on the options and the current quote mark value.\n   * If you want the quote mark to depend on the attribute value, call `smartQuoteMark(opts)`\n   * instead.\n   */;\n  _proto.preferredQuoteMark = function preferredQuoteMark(options) {\n    var quoteMark = options.preferCurrentQuoteMark ? this.quoteMark : options.quoteMark;\n    if (quoteMark === undefined) {\n      quoteMark = options.preferCurrentQuoteMark ? options.quoteMark : this.quoteMark;\n    }\n    if (quoteMark === undefined) {\n      quoteMark = Attribute.DOUBLE_QUOTE;\n    }\n    return quoteMark;\n  };\n  _proto._syncRawValue = function _syncRawValue() {\n    var rawValue = (0, _cssesc[\"default\"])(this._value, CSSESC_QUOTE_OPTIONS[this.quoteMark]);\n    if (rawValue === this._value) {\n      if (this.raws) {\n        delete this.raws.value;\n      }\n    } else {\n      this.raws.value = rawValue;\n    }\n  };\n  _proto._handleEscapes = function _handleEscapes(prop, value) {\n    if (this._constructed) {\n      var escaped = (0, _cssesc[\"default\"])(value, {\n        isIdentifier: true\n      });\n      if (escaped !== value) {\n        this.raws[prop] = escaped;\n      } else {\n        delete this.raws[prop];\n      }\n    }\n  };\n  _proto._spacesFor = function _spacesFor(name) {\n    var attrSpaces = {\n      before: '',\n      after: ''\n    };\n    var spaces = this.spaces[name] || {};\n    var rawSpaces = this.raws.spaces && this.raws.spaces[name] || {};\n    return Object.assign(attrSpaces, spaces, rawSpaces);\n  };\n  _proto._stringFor = function _stringFor(name, spaceName, concat) {\n    if (spaceName === void 0) {\n      spaceName = name;\n    }\n    if (concat === void 0) {\n      concat = defaultAttrConcat;\n    }\n    var attrSpaces = this._spacesFor(spaceName);\n    return concat(this.stringifyProperty(name), attrSpaces);\n  }\n\n  /**\n   * returns the offset of the attribute part specified relative to the\n   * start of the node of the output string.\n   *\n   * * \"ns\" - alias for \"namespace\"\n   * * \"namespace\" - the namespace if it exists.\n   * * \"attribute\" - the attribute name\n   * * \"attributeNS\" - the start of the attribute or its namespace\n   * * \"operator\" - the match operator of the attribute\n   * * \"value\" - The value (string or identifier)\n   * * \"insensitive\" - the case insensitivity flag;\n   * @param part One of the possible values inside an attribute.\n   * @returns -1 if the name is invalid or the value doesn't exist in this attribute.\n   */;\n  _proto.offsetOf = function offsetOf(name) {\n    var count = 1;\n    var attributeSpaces = this._spacesFor(\"attribute\");\n    count += attributeSpaces.before.length;\n    if (name === \"namespace\" || name === \"ns\") {\n      return this.namespace ? count : -1;\n    }\n    if (name === \"attributeNS\") {\n      return count;\n    }\n    count += this.namespaceString.length;\n    if (this.namespace) {\n      count += 1;\n    }\n    if (name === \"attribute\") {\n      return count;\n    }\n    count += this.stringifyProperty(\"attribute\").length;\n    count += attributeSpaces.after.length;\n    var operatorSpaces = this._spacesFor(\"operator\");\n    count += operatorSpaces.before.length;\n    var operator = this.stringifyProperty(\"operator\");\n    if (name === \"operator\") {\n      return operator ? count : -1;\n    }\n    count += operator.length;\n    count += operatorSpaces.after.length;\n    var valueSpaces = this._spacesFor(\"value\");\n    count += valueSpaces.before.length;\n    var value = this.stringifyProperty(\"value\");\n    if (name === \"value\") {\n      return value ? count : -1;\n    }\n    count += value.length;\n    count += valueSpaces.after.length;\n    var insensitiveSpaces = this._spacesFor(\"insensitive\");\n    count += insensitiveSpaces.before.length;\n    if (name === \"insensitive\") {\n      return this.insensitive ? count : -1;\n    }\n    return -1;\n  };\n  _proto.toString = function toString() {\n    var _this2 = this;\n    var selector = [this.rawSpaceBefore, '['];\n    selector.push(this._stringFor('qualifiedAttribute', 'attribute'));\n    if (this.operator && (this.value || this.value === '')) {\n      selector.push(this._stringFor('operator'));\n      selector.push(this._stringFor('value'));\n      selector.push(this._stringFor('insensitiveFlag', 'insensitive', function (attrValue, attrSpaces) {\n        if (attrValue.length > 0 && !_this2.quoted && attrSpaces.before.length === 0 && !(_this2.spaces.value && _this2.spaces.value.after)) {\n          attrSpaces.before = \" \";\n        }\n        return defaultAttrConcat(attrValue, attrSpaces);\n      }));\n    }\n    selector.push(']');\n    selector.push(this.rawSpaceAfter);\n    return selector.join('');\n  };\n  _createClass(Attribute, [{\n    key: \"quoted\",\n    get: function get() {\n      var qm = this.quoteMark;\n      return qm === \"'\" || qm === '\"';\n    },\n    set: function set(value) {\n      warnOfDeprecatedQuotedAssignment();\n    }\n\n    /**\n     * returns a single (`'`) or double (`\"`) quote character if the value is quoted.\n     * returns `null` if the value is not quoted.\n     * returns `undefined` if the quotation state is unknown (this can happen when\n     * the attribute is constructed without specifying a quote mark.)\n     */\n  }, {\n    key: \"quoteMark\",\n    get: function get() {\n      return this._quoteMark;\n    }\n\n    /**\n     * Set the quote mark to be used by this attribute's value.\n     * If the quote mark changes, the raw (escaped) value at `attr.raws.value` of the attribute\n     * value is updated accordingly.\n     *\n     * @param {\"'\" | '\"' | null} quoteMark The quote mark or `null` if the value should be unquoted.\n     */,\n    set: function set(quoteMark) {\n      if (!this._constructed) {\n        this._quoteMark = quoteMark;\n        return;\n      }\n      if (this._quoteMark !== quoteMark) {\n        this._quoteMark = quoteMark;\n        this._syncRawValue();\n      }\n    }\n  }, {\n    key: \"qualifiedAttribute\",\n    get: function get() {\n      return this.qualifiedName(this.raws.attribute || this.attribute);\n    }\n  }, {\n    key: \"insensitiveFlag\",\n    get: function get() {\n      return this.insensitive ? 'i' : '';\n    }\n  }, {\n    key: \"value\",\n    get: function get() {\n      return this._value;\n    },\n    set:\n    /**\n     * Before 3.0, the value had to be set to an escaped value including any wrapped\n     * quote marks. In 3.0, the semantics of `Attribute.value` changed so that the value\n     * is unescaped during parsing and any quote marks are removed.\n     *\n     * Because the ambiguity of this semantic change, if you set `attr.value = newValue`,\n     * a deprecation warning is raised when the new value contains any characters that would\n     * require escaping (including if it contains wrapped quotes).\n     *\n     * Instead, you should call `attr.setValue(newValue, opts)` and pass options that describe\n     * how the new value is quoted.\n     */\n    function set(v) {\n      if (this._constructed) {\n        var _unescapeValue2 = unescapeValue(v),\n          deprecatedUsage = _unescapeValue2.deprecatedUsage,\n          unescaped = _unescapeValue2.unescaped,\n          quoteMark = _unescapeValue2.quoteMark;\n        if (deprecatedUsage) {\n          warnOfDeprecatedValueAssignment();\n        }\n        if (unescaped === this._value && quoteMark === this._quoteMark) {\n          return;\n        }\n        this._value = unescaped;\n        this._quoteMark = quoteMark;\n        this._syncRawValue();\n      } else {\n        this._value = v;\n      }\n    }\n  }, {\n    key: \"insensitive\",\n    get: function get() {\n      return this._insensitive;\n    }\n\n    /**\n     * Set the case insensitive flag.\n     * If the case insensitive flag changes, the raw (escaped) value at `attr.raws.insensitiveFlag`\n     * of the attribute is updated accordingly.\n     *\n     * @param {true | false} insensitive true if the attribute should match case-insensitively.\n     */,\n    set: function set(insensitive) {\n      if (!insensitive) {\n        this._insensitive = false;\n\n        // \"i\" and \"I\" can be used in \"this.raws.insensitiveFlag\" to store the original notation.\n        // When setting `attr.insensitive = false` both should be erased to ensure correct serialization.\n        if (this.raws && (this.raws.insensitiveFlag === 'I' || this.raws.insensitiveFlag === 'i')) {\n          this.raws.insensitiveFlag = undefined;\n        }\n      }\n      this._insensitive = insensitive;\n    }\n  }, {\n    key: \"attribute\",\n    get: function get() {\n      return this._attribute;\n    },\n    set: function set(name) {\n      this._handleEscapes(\"attribute\", name);\n      this._attribute = name;\n    }\n  }]);\n  return Attribute;\n}(_namespace[\"default\"]);\nexports[\"default\"] = Attribute;\nAttribute.NO_QUOTE = null;\nAttribute.SINGLE_QUOTE = \"'\";\nAttribute.DOUBLE_QUOTE = '\"';\nvar CSSESC_QUOTE_OPTIONS = (_CSSESC_QUOTE_OPTIONS = {\n  \"'\": {\n    quotes: 'single',\n    wrap: true\n  },\n  '\"': {\n    quotes: 'double',\n    wrap: true\n  }\n}, _CSSESC_QUOTE_OPTIONS[null] = {\n  isIdentifier: true\n}, _CSSESC_QUOTE_OPTIONS);\nfunction defaultAttrConcat(attrValue, attrSpaces) {\n  return \"\" + attrSpaces.before + attrValue + attrSpaces.after;\n}", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _namespace = _interopRequireDefault(require(\"./namespace\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Universal = /*#__PURE__*/function (_Namespace) {\n  _inheritsLoose(Universal, _Namespace);\n  function Universal(opts) {\n    var _this;\n    _this = _Namespace.call(this, opts) || this;\n    _this.type = _types.UNIVERSAL;\n    _this.value = '*';\n    return _this;\n  }\n  return Universal;\n}(_namespace[\"default\"]);\nexports[\"default\"] = Universal;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Combinator = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(Combinator, _Node);\n  function Combinator(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.COMBINATOR;\n    return _this;\n  }\n  return Combinator;\n}(_node[\"default\"]);\nexports[\"default\"] = Combinator;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _node = _interopRequireDefault(require(\"./node\"));\nvar _types = require(\"./types\");\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar Nesting = /*#__PURE__*/function (_Node) {\n  _inheritsLoose(Nesting, _Node);\n  function Nesting(opts) {\n    var _this;\n    _this = _Node.call(this, opts) || this;\n    _this.type = _types.NESTING;\n    _this.value = '&';\n    return _this;\n  }\n  return Nesting;\n}(_node[\"default\"]);\nexports[\"default\"] = Nesting;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = sortAscending;\nfunction sortAscending(list) {\n  return list.sort(function (a, b) {\n    return a - b;\n  });\n}\n;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports.word = exports.tilde = exports.tab = exports.str = exports.space = exports.slash = exports.singleQuote = exports.semicolon = exports.plus = exports.pipe = exports.openSquare = exports.openParenthesis = exports.newline = exports.greaterThan = exports.feed = exports.equals = exports.doubleQuote = exports.dollar = exports.cr = exports.comment = exports.comma = exports.combinator = exports.colon = exports.closeSquare = exports.closeParenthesis = exports.caret = exports.bang = exports.backslash = exports.at = exports.asterisk = exports.ampersand = void 0;\nvar ampersand = 38; // `&`.charCodeAt(0);\nexports.ampersand = ampersand;\nvar asterisk = 42; // `*`.charCodeAt(0);\nexports.asterisk = asterisk;\nvar at = 64; // `@`.charCodeAt(0);\nexports.at = at;\nvar comma = 44; // `,`.charCodeAt(0);\nexports.comma = comma;\nvar colon = 58; // `:`.charCodeAt(0);\nexports.colon = colon;\nvar semicolon = 59; // `;`.charCodeAt(0);\nexports.semicolon = semicolon;\nvar openParenthesis = 40; // `(`.charCodeAt(0);\nexports.openParenthesis = openParenthesis;\nvar closeParenthesis = 41; // `)`.charCodeAt(0);\nexports.closeParenthesis = closeParenthesis;\nvar openSquare = 91; // `[`.charCodeAt(0);\nexports.openSquare = openSquare;\nvar closeSquare = 93; // `]`.charCodeAt(0);\nexports.closeSquare = closeSquare;\nvar dollar = 36; // `$`.charCodeAt(0);\nexports.dollar = dollar;\nvar tilde = 126; // `~`.charCodeAt(0);\nexports.tilde = tilde;\nvar caret = 94; // `^`.charCodeAt(0);\nexports.caret = caret;\nvar plus = 43; // `+`.charCodeAt(0);\nexports.plus = plus;\nvar equals = 61; // `=`.charCodeAt(0);\nexports.equals = equals;\nvar pipe = 124; // `|`.charCodeAt(0);\nexports.pipe = pipe;\nvar greaterThan = 62; // `>`.charCodeAt(0);\nexports.greaterThan = greaterThan;\nvar space = 32; // ` `.charCodeAt(0);\nexports.space = space;\nvar singleQuote = 39; // `'`.charCodeAt(0);\nexports.singleQuote = singleQuote;\nvar doubleQuote = 34; // `\"`.charCodeAt(0);\nexports.doubleQuote = doubleQuote;\nvar slash = 47; // `/`.charCodeAt(0);\nexports.slash = slash;\nvar bang = 33; // `!`.charCodeAt(0);\nexports.bang = bang;\nvar backslash = 92; // '\\\\'.charCodeAt(0);\nexports.backslash = backslash;\nvar cr = 13; // '\\r'.charCodeAt(0);\nexports.cr = cr;\nvar feed = 12; // '\\f'.charCodeAt(0);\nexports.feed = feed;\nvar newline = 10; // '\\n'.charCodeAt(0);\nexports.newline = newline;\nvar tab = 9; // '\\t'.charCodeAt(0);\n\n// Expose aliases primarily for readability.\nexports.tab = tab;\nvar str = singleQuote;\n\n// No good single character representation!\nexports.str = str;\nvar comment = -1;\nexports.comment = comment;\nvar word = -2;\nexports.word = word;\nvar combinator = -3;\nexports.combinator = combinator;", "\"use strict\";\n\nexports.__esModule = true;\nexports.FIELDS = void 0;\nexports[\"default\"] = tokenize;\nvar t = _interopRequireWildcard(require(\"./tokenTypes\"));\nvar _unescapable, _wordDelimiters;\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\nvar unescapable = (_unescapable = {}, _unescapable[t.tab] = true, _unescapable[t.newline] = true, _unescapable[t.cr] = true, _unescapable[t.feed] = true, _unescapable);\nvar wordDelimiters = (_wordDelimiters = {}, _wordDelimiters[t.space] = true, _wordDelimiters[t.tab] = true, _wordDelimiters[t.newline] = true, _wordDelimiters[t.cr] = true, _wordDelimiters[t.feed] = true, _wordDelimiters[t.ampersand] = true, _wordDelimiters[t.asterisk] = true, _wordDelimiters[t.bang] = true, _wordDelimiters[t.comma] = true, _wordDelimiters[t.colon] = true, _wordDelimiters[t.semicolon] = true, _wordDelimiters[t.openParenthesis] = true, _wordDelimiters[t.closeParenthesis] = true, _wordDelimiters[t.openSquare] = true, _wordDelimiters[t.closeSquare] = true, _wordDelimiters[t.singleQuote] = true, _wordDelimiters[t.doubleQuote] = true, _wordDelimiters[t.plus] = true, _wordDelimiters[t.pipe] = true, _wordDelimiters[t.tilde] = true, _wordDelimiters[t.greaterThan] = true, _wordDelimiters[t.equals] = true, _wordDelimiters[t.dollar] = true, _wordDelimiters[t.caret] = true, _wordDelimiters[t.slash] = true, _wordDelimiters);\nvar hex = {};\nvar hexChars = \"0123456789abcdefABCDEF\";\nfor (var i = 0; i < hexChars.length; i++) {\n  hex[hexChars.charCodeAt(i)] = true;\n}\n\n/**\n *  Returns the last index of the bar css word\n * @param {string} css The string in which the word begins\n * @param {number} start The index into the string where word's first letter occurs\n */\nfunction consumeWord(css, start) {\n  var next = start;\n  var code;\n  do {\n    code = css.charCodeAt(next);\n    if (wordDelimiters[code]) {\n      return next - 1;\n    } else if (code === t.backslash) {\n      next = consumeEscape(css, next) + 1;\n    } else {\n      // All other characters are part of the word\n      next++;\n    }\n  } while (next < css.length);\n  return next - 1;\n}\n\n/**\n *  Returns the last index of the escape sequence\n * @param {string} css The string in which the sequence begins\n * @param {number} start The index into the string where escape character (`\\`) occurs.\n */\nfunction consumeEscape(css, start) {\n  var next = start;\n  var code = css.charCodeAt(next + 1);\n  if (unescapable[code]) {\n    // just consume the escape char\n  } else if (hex[code]) {\n    var hexDigits = 0;\n    // consume up to 6 hex chars\n    do {\n      next++;\n      hexDigits++;\n      code = css.charCodeAt(next + 1);\n    } while (hex[code] && hexDigits < 6);\n    // if fewer than 6 hex chars, a trailing space ends the escape\n    if (hexDigits < 6 && code === t.space) {\n      next++;\n    }\n  } else {\n    // the next char is part of the current word\n    next++;\n  }\n  return next;\n}\nvar FIELDS = {\n  TYPE: 0,\n  START_LINE: 1,\n  START_COL: 2,\n  END_LINE: 3,\n  END_COL: 4,\n  START_POS: 5,\n  END_POS: 6\n};\nexports.FIELDS = FIELDS;\nfunction tokenize(input) {\n  var tokens = [];\n  var css = input.css.valueOf();\n  var _css = css,\n    length = _css.length;\n  var offset = -1;\n  var line = 1;\n  var start = 0;\n  var end = 0;\n  var code, content, endColumn, endLine, escaped, escapePos, last, lines, next, nextLine, nextOffset, quote, tokenType;\n  function unclosed(what, fix) {\n    if (input.safe) {\n      // fyi: this is never set to true.\n      css += fix;\n      next = css.length - 1;\n    } else {\n      throw input.error('Unclosed ' + what, line, start - offset, start);\n    }\n  }\n  while (start < length) {\n    code = css.charCodeAt(start);\n    if (code === t.newline) {\n      offset = start;\n      line += 1;\n    }\n    switch (code) {\n      case t.space:\n      case t.tab:\n      case t.newline:\n      case t.cr:\n      case t.feed:\n        next = start;\n        do {\n          next += 1;\n          code = css.charCodeAt(next);\n          if (code === t.newline) {\n            offset = next;\n            line += 1;\n          }\n        } while (code === t.space || code === t.newline || code === t.tab || code === t.cr || code === t.feed);\n        tokenType = t.space;\n        endLine = line;\n        endColumn = next - offset - 1;\n        end = next;\n        break;\n      case t.plus:\n      case t.greaterThan:\n      case t.tilde:\n      case t.pipe:\n        next = start;\n        do {\n          next += 1;\n          code = css.charCodeAt(next);\n        } while (code === t.plus || code === t.greaterThan || code === t.tilde || code === t.pipe);\n        tokenType = t.combinator;\n        endLine = line;\n        endColumn = start - offset;\n        end = next;\n        break;\n\n      // Consume these characters as single tokens.\n      case t.asterisk:\n      case t.ampersand:\n      case t.bang:\n      case t.comma:\n      case t.equals:\n      case t.dollar:\n      case t.caret:\n      case t.openSquare:\n      case t.closeSquare:\n      case t.colon:\n      case t.semicolon:\n      case t.openParenthesis:\n      case t.closeParenthesis:\n        next = start;\n        tokenType = code;\n        endLine = line;\n        endColumn = start - offset;\n        end = next + 1;\n        break;\n      case t.singleQuote:\n      case t.doubleQuote:\n        quote = code === t.singleQuote ? \"'\" : '\"';\n        next = start;\n        do {\n          escaped = false;\n          next = css.indexOf(quote, next + 1);\n          if (next === -1) {\n            unclosed('quote', quote);\n          }\n          escapePos = next;\n          while (css.charCodeAt(escapePos - 1) === t.backslash) {\n            escapePos -= 1;\n            escaped = !escaped;\n          }\n        } while (escaped);\n        tokenType = t.str;\n        endLine = line;\n        endColumn = start - offset;\n        end = next + 1;\n        break;\n      default:\n        if (code === t.slash && css.charCodeAt(start + 1) === t.asterisk) {\n          next = css.indexOf('*/', start + 2) + 1;\n          if (next === 0) {\n            unclosed('comment', '*/');\n          }\n          content = css.slice(start, next + 1);\n          lines = content.split('\\n');\n          last = lines.length - 1;\n          if (last > 0) {\n            nextLine = line + last;\n            nextOffset = next - lines[last].length;\n          } else {\n            nextLine = line;\n            nextOffset = offset;\n          }\n          tokenType = t.comment;\n          line = nextLine;\n          endLine = nextLine;\n          endColumn = next - nextOffset;\n        } else if (code === t.slash) {\n          next = start;\n          tokenType = code;\n          endLine = line;\n          endColumn = start - offset;\n          end = next + 1;\n        } else {\n          next = consumeWord(css, start);\n          tokenType = t.word;\n          endLine = line;\n          endColumn = next - offset;\n        }\n        end = next + 1;\n        break;\n    }\n\n    // Ensure that the token structure remains consistent\n    tokens.push([tokenType,\n    // [0] Token type\n    line,\n    // [1] Starting line\n    start - offset,\n    // [2] Starting column\n    endLine,\n    // [3] Ending line\n    endColumn,\n    // [4] Ending column\n    start,\n    // [5] Start position / Source index\n    end // [6] End position\n    ]);\n\n    // Reset offset for the next token\n    if (nextOffset) {\n      offset = nextOffset;\n      nextOffset = null;\n    }\n    start = end;\n  }\n  return tokens;\n}", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _root = _interopRequireDefault(require(\"./selectors/root\"));\nvar _selector = _interopRequireDefault(require(\"./selectors/selector\"));\nvar _className = _interopRequireDefault(require(\"./selectors/className\"));\nvar _comment = _interopRequireDefault(require(\"./selectors/comment\"));\nvar _id = _interopRequireDefault(require(\"./selectors/id\"));\nvar _tag = _interopRequireDefault(require(\"./selectors/tag\"));\nvar _string = _interopRequireDefault(require(\"./selectors/string\"));\nvar _pseudo = _interopRequireDefault(require(\"./selectors/pseudo\"));\nvar _attribute = _interopRequireWildcard(require(\"./selectors/attribute\"));\nvar _universal = _interopRequireDefault(require(\"./selectors/universal\"));\nvar _combinator = _interopRequireDefault(require(\"./selectors/combinator\"));\nvar _nesting = _interopRequireDefault(require(\"./selectors/nesting\"));\nvar _sortAscending = _interopRequireDefault(require(\"./sortAscending\"));\nvar _tokenize = _interopRequireWildcard(require(\"./tokenize\"));\nvar tokens = _interopRequireWildcard(require(\"./tokenTypes\"));\nvar types = _interopRequireWildcard(require(\"./selectors/types\"));\nvar _util = require(\"./util\");\nvar _WHITESPACE_TOKENS, _Object$assign;\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nvar WHITESPACE_TOKENS = (_WHITESPACE_TOKENS = {}, _WHITESPACE_TOKENS[tokens.space] = true, _WHITESPACE_TOKENS[tokens.cr] = true, _WHITESPACE_TOKENS[tokens.feed] = true, _WHITESPACE_TOKENS[tokens.newline] = true, _WHITESPACE_TOKENS[tokens.tab] = true, _WHITESPACE_TOKENS);\nvar WHITESPACE_EQUIV_TOKENS = Object.assign({}, WHITESPACE_TOKENS, (_Object$assign = {}, _Object$assign[tokens.comment] = true, _Object$assign));\nfunction tokenStart(token) {\n  return {\n    line: token[_tokenize.FIELDS.START_LINE],\n    column: token[_tokenize.FIELDS.START_COL]\n  };\n}\nfunction tokenEnd(token) {\n  return {\n    line: token[_tokenize.FIELDS.END_LINE],\n    column: token[_tokenize.FIELDS.END_COL]\n  };\n}\nfunction getSource(startLine, startColumn, endLine, endColumn) {\n  return {\n    start: {\n      line: startLine,\n      column: startColumn\n    },\n    end: {\n      line: endLine,\n      column: endColumn\n    }\n  };\n}\nfunction getTokenSource(token) {\n  return getSource(token[_tokenize.FIELDS.START_LINE], token[_tokenize.FIELDS.START_COL], token[_tokenize.FIELDS.END_LINE], token[_tokenize.FIELDS.END_COL]);\n}\nfunction getTokenSourceSpan(startToken, endToken) {\n  if (!startToken) {\n    return undefined;\n  }\n  return getSource(startToken[_tokenize.FIELDS.START_LINE], startToken[_tokenize.FIELDS.START_COL], endToken[_tokenize.FIELDS.END_LINE], endToken[_tokenize.FIELDS.END_COL]);\n}\nfunction unescapeProp(node, prop) {\n  var value = node[prop];\n  if (typeof value !== \"string\") {\n    return;\n  }\n  if (value.indexOf(\"\\\\\") !== -1) {\n    (0, _util.ensureObject)(node, 'raws');\n    node[prop] = (0, _util.unesc)(value);\n    if (node.raws[prop] === undefined) {\n      node.raws[prop] = value;\n    }\n  }\n  return node;\n}\nfunction indexesOf(array, item) {\n  var i = -1;\n  var indexes = [];\n  while ((i = array.indexOf(item, i + 1)) !== -1) {\n    indexes.push(i);\n  }\n  return indexes;\n}\nfunction uniqs() {\n  var list = Array.prototype.concat.apply([], arguments);\n  return list.filter(function (item, i) {\n    return i === list.indexOf(item);\n  });\n}\nvar Parser = /*#__PURE__*/function () {\n  function Parser(rule, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    this.rule = rule;\n    this.options = Object.assign({\n      lossy: false,\n      safe: false\n    }, options);\n    this.position = 0;\n    this.css = typeof this.rule === 'string' ? this.rule : this.rule.selector;\n    this.tokens = (0, _tokenize[\"default\"])({\n      css: this.css,\n      error: this._errorGenerator(),\n      safe: this.options.safe\n    });\n    var rootSource = getTokenSourceSpan(this.tokens[0], this.tokens[this.tokens.length - 1]);\n    this.root = new _root[\"default\"]({\n      source: rootSource\n    });\n    this.root.errorGenerator = this._errorGenerator();\n    var selector = new _selector[\"default\"]({\n      source: {\n        start: {\n          line: 1,\n          column: 1\n        }\n      },\n      sourceIndex: 0\n    });\n    this.root.append(selector);\n    this.current = selector;\n    this.loop();\n  }\n  var _proto = Parser.prototype;\n  _proto._errorGenerator = function _errorGenerator() {\n    var _this = this;\n    return function (message, errorOptions) {\n      if (typeof _this.rule === 'string') {\n        return new Error(message);\n      }\n      return _this.rule.error(message, errorOptions);\n    };\n  };\n  _proto.attribute = function attribute() {\n    var attr = [];\n    var startingToken = this.currToken;\n    this.position++;\n    while (this.position < this.tokens.length && this.currToken[_tokenize.FIELDS.TYPE] !== tokens.closeSquare) {\n      attr.push(this.currToken);\n      this.position++;\n    }\n    if (this.currToken[_tokenize.FIELDS.TYPE] !== tokens.closeSquare) {\n      return this.expected('closing square bracket', this.currToken[_tokenize.FIELDS.START_POS]);\n    }\n    var len = attr.length;\n    var node = {\n      source: getSource(startingToken[1], startingToken[2], this.currToken[3], this.currToken[4]),\n      sourceIndex: startingToken[_tokenize.FIELDS.START_POS]\n    };\n    if (len === 1 && !~[tokens.word].indexOf(attr[0][_tokenize.FIELDS.TYPE])) {\n      return this.expected('attribute', attr[0][_tokenize.FIELDS.START_POS]);\n    }\n    var pos = 0;\n    var spaceBefore = '';\n    var commentBefore = '';\n    var lastAdded = null;\n    var spaceAfterMeaningfulToken = false;\n    while (pos < len) {\n      var token = attr[pos];\n      var content = this.content(token);\n      var next = attr[pos + 1];\n      switch (token[_tokenize.FIELDS.TYPE]) {\n        case tokens.space:\n          // if (\n          //     len === 1 ||\n          //     pos === 0 && this.content(next) === '|'\n          // ) {\n          //     return this.expected('attribute', token[TOKEN.START_POS], content);\n          // }\n          spaceAfterMeaningfulToken = true;\n          if (this.options.lossy) {\n            break;\n          }\n          if (lastAdded) {\n            (0, _util.ensureObject)(node, 'spaces', lastAdded);\n            var prevContent = node.spaces[lastAdded].after || '';\n            node.spaces[lastAdded].after = prevContent + content;\n            var existingComment = (0, _util.getProp)(node, 'raws', 'spaces', lastAdded, 'after') || null;\n            if (existingComment) {\n              node.raws.spaces[lastAdded].after = existingComment + content;\n            }\n          } else {\n            spaceBefore = spaceBefore + content;\n            commentBefore = commentBefore + content;\n          }\n          break;\n        case tokens.asterisk:\n          if (next[_tokenize.FIELDS.TYPE] === tokens.equals) {\n            node.operator = content;\n            lastAdded = 'operator';\n          } else if ((!node.namespace || lastAdded === \"namespace\" && !spaceAfterMeaningfulToken) && next) {\n            if (spaceBefore) {\n              (0, _util.ensureObject)(node, 'spaces', 'attribute');\n              node.spaces.attribute.before = spaceBefore;\n              spaceBefore = '';\n            }\n            if (commentBefore) {\n              (0, _util.ensureObject)(node, 'raws', 'spaces', 'attribute');\n              node.raws.spaces.attribute.before = spaceBefore;\n              commentBefore = '';\n            }\n            node.namespace = (node.namespace || \"\") + content;\n            var rawValue = (0, _util.getProp)(node, 'raws', 'namespace') || null;\n            if (rawValue) {\n              node.raws.namespace += content;\n            }\n            lastAdded = 'namespace';\n          }\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.dollar:\n          if (lastAdded === \"value\") {\n            var oldRawValue = (0, _util.getProp)(node, 'raws', 'value');\n            node.value += \"$\";\n            if (oldRawValue) {\n              node.raws.value = oldRawValue + \"$\";\n            }\n            break;\n          }\n        // Falls through\n        case tokens.caret:\n          if (next[_tokenize.FIELDS.TYPE] === tokens.equals) {\n            node.operator = content;\n            lastAdded = 'operator';\n          }\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.combinator:\n          if (content === '~' && next[_tokenize.FIELDS.TYPE] === tokens.equals) {\n            node.operator = content;\n            lastAdded = 'operator';\n          }\n          if (content !== '|') {\n            spaceAfterMeaningfulToken = false;\n            break;\n          }\n          if (next[_tokenize.FIELDS.TYPE] === tokens.equals) {\n            node.operator = content;\n            lastAdded = 'operator';\n          } else if (!node.namespace && !node.attribute) {\n            node.namespace = true;\n          }\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.word:\n          if (next && this.content(next) === '|' && attr[pos + 2] && attr[pos + 2][_tokenize.FIELDS.TYPE] !== tokens.equals &&\n          // this look-ahead probably fails with comment nodes involved.\n          !node.operator && !node.namespace) {\n            node.namespace = content;\n            lastAdded = 'namespace';\n          } else if (!node.attribute || lastAdded === \"attribute\" && !spaceAfterMeaningfulToken) {\n            if (spaceBefore) {\n              (0, _util.ensureObject)(node, 'spaces', 'attribute');\n              node.spaces.attribute.before = spaceBefore;\n              spaceBefore = '';\n            }\n            if (commentBefore) {\n              (0, _util.ensureObject)(node, 'raws', 'spaces', 'attribute');\n              node.raws.spaces.attribute.before = commentBefore;\n              commentBefore = '';\n            }\n            node.attribute = (node.attribute || \"\") + content;\n            var _rawValue = (0, _util.getProp)(node, 'raws', 'attribute') || null;\n            if (_rawValue) {\n              node.raws.attribute += content;\n            }\n            lastAdded = 'attribute';\n          } else if (!node.value && node.value !== \"\" || lastAdded === \"value\" && !(spaceAfterMeaningfulToken || node.quoteMark)) {\n            var _unescaped = (0, _util.unesc)(content);\n            var _oldRawValue = (0, _util.getProp)(node, 'raws', 'value') || '';\n            var oldValue = node.value || '';\n            node.value = oldValue + _unescaped;\n            node.quoteMark = null;\n            if (_unescaped !== content || _oldRawValue) {\n              (0, _util.ensureObject)(node, 'raws');\n              node.raws.value = (_oldRawValue || oldValue) + content;\n            }\n            lastAdded = 'value';\n          } else {\n            var insensitive = content === 'i' || content === \"I\";\n            if ((node.value || node.value === '') && (node.quoteMark || spaceAfterMeaningfulToken)) {\n              node.insensitive = insensitive;\n              if (!insensitive || content === \"I\") {\n                (0, _util.ensureObject)(node, 'raws');\n                node.raws.insensitiveFlag = content;\n              }\n              lastAdded = 'insensitive';\n              if (spaceBefore) {\n                (0, _util.ensureObject)(node, 'spaces', 'insensitive');\n                node.spaces.insensitive.before = spaceBefore;\n                spaceBefore = '';\n              }\n              if (commentBefore) {\n                (0, _util.ensureObject)(node, 'raws', 'spaces', 'insensitive');\n                node.raws.spaces.insensitive.before = commentBefore;\n                commentBefore = '';\n              }\n            } else if (node.value || node.value === '') {\n              lastAdded = 'value';\n              node.value += content;\n              if (node.raws.value) {\n                node.raws.value += content;\n              }\n            }\n          }\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.str:\n          if (!node.attribute || !node.operator) {\n            return this.error(\"Expected an attribute followed by an operator preceding the string.\", {\n              index: token[_tokenize.FIELDS.START_POS]\n            });\n          }\n          var _unescapeValue = (0, _attribute.unescapeValue)(content),\n            unescaped = _unescapeValue.unescaped,\n            quoteMark = _unescapeValue.quoteMark;\n          node.value = unescaped;\n          node.quoteMark = quoteMark;\n          lastAdded = 'value';\n          (0, _util.ensureObject)(node, 'raws');\n          node.raws.value = content;\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.equals:\n          if (!node.attribute) {\n            return this.expected('attribute', token[_tokenize.FIELDS.START_POS], content);\n          }\n          if (node.value) {\n            return this.error('Unexpected \"=\" found; an operator was already defined.', {\n              index: token[_tokenize.FIELDS.START_POS]\n            });\n          }\n          node.operator = node.operator ? node.operator + content : content;\n          lastAdded = 'operator';\n          spaceAfterMeaningfulToken = false;\n          break;\n        case tokens.comment:\n          if (lastAdded) {\n            if (spaceAfterMeaningfulToken || next && next[_tokenize.FIELDS.TYPE] === tokens.space || lastAdded === 'insensitive') {\n              var lastComment = (0, _util.getProp)(node, 'spaces', lastAdded, 'after') || '';\n              var rawLastComment = (0, _util.getProp)(node, 'raws', 'spaces', lastAdded, 'after') || lastComment;\n              (0, _util.ensureObject)(node, 'raws', 'spaces', lastAdded);\n              node.raws.spaces[lastAdded].after = rawLastComment + content;\n            } else {\n              var lastValue = node[lastAdded] || '';\n              var rawLastValue = (0, _util.getProp)(node, 'raws', lastAdded) || lastValue;\n              (0, _util.ensureObject)(node, 'raws');\n              node.raws[lastAdded] = rawLastValue + content;\n            }\n          } else {\n            commentBefore = commentBefore + content;\n          }\n          break;\n        default:\n          return this.error(\"Unexpected \\\"\" + content + \"\\\" found.\", {\n            index: token[_tokenize.FIELDS.START_POS]\n          });\n      }\n      pos++;\n    }\n    unescapeProp(node, \"attribute\");\n    unescapeProp(node, \"namespace\");\n    this.newNode(new _attribute[\"default\"](node));\n    this.position++;\n  }\n\n  /**\n   * return a node containing meaningless garbage up to (but not including) the specified token position.\n   * if the token position is negative, all remaining tokens are consumed.\n   *\n   * This returns an array containing a single string node if all whitespace,\n   * otherwise an array of comment nodes with space before and after.\n   *\n   * These tokens are not added to the current selector, the caller can add them or use them to amend\n   * a previous node's space metadata.\n   *\n   * In lossy mode, this returns only comments.\n   */;\n  _proto.parseWhitespaceEquivalentTokens = function parseWhitespaceEquivalentTokens(stopPosition) {\n    if (stopPosition < 0) {\n      stopPosition = this.tokens.length;\n    }\n    var startPosition = this.position;\n    var nodes = [];\n    var space = \"\";\n    var lastComment = undefined;\n    do {\n      if (WHITESPACE_TOKENS[this.currToken[_tokenize.FIELDS.TYPE]]) {\n        if (!this.options.lossy) {\n          space += this.content();\n        }\n      } else if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.comment) {\n        var spaces = {};\n        if (space) {\n          spaces.before = space;\n          space = \"\";\n        }\n        lastComment = new _comment[\"default\"]({\n          value: this.content(),\n          source: getTokenSource(this.currToken),\n          sourceIndex: this.currToken[_tokenize.FIELDS.START_POS],\n          spaces: spaces\n        });\n        nodes.push(lastComment);\n      }\n    } while (++this.position < stopPosition);\n    if (space) {\n      if (lastComment) {\n        lastComment.spaces.after = space;\n      } else if (!this.options.lossy) {\n        var firstToken = this.tokens[startPosition];\n        var lastToken = this.tokens[this.position - 1];\n        nodes.push(new _string[\"default\"]({\n          value: '',\n          source: getSource(firstToken[_tokenize.FIELDS.START_LINE], firstToken[_tokenize.FIELDS.START_COL], lastToken[_tokenize.FIELDS.END_LINE], lastToken[_tokenize.FIELDS.END_COL]),\n          sourceIndex: firstToken[_tokenize.FIELDS.START_POS],\n          spaces: {\n            before: space,\n            after: ''\n          }\n        }));\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   *\n   * @param {*} nodes\n   */;\n  _proto.convertWhitespaceNodesToSpace = function convertWhitespaceNodesToSpace(nodes, requiredSpace) {\n    var _this2 = this;\n    if (requiredSpace === void 0) {\n      requiredSpace = false;\n    }\n    var space = \"\";\n    var rawSpace = \"\";\n    nodes.forEach(function (n) {\n      var spaceBefore = _this2.lossySpace(n.spaces.before, requiredSpace);\n      var rawSpaceBefore = _this2.lossySpace(n.rawSpaceBefore, requiredSpace);\n      space += spaceBefore + _this2.lossySpace(n.spaces.after, requiredSpace && spaceBefore.length === 0);\n      rawSpace += spaceBefore + n.value + _this2.lossySpace(n.rawSpaceAfter, requiredSpace && rawSpaceBefore.length === 0);\n    });\n    if (rawSpace === space) {\n      rawSpace = undefined;\n    }\n    var result = {\n      space: space,\n      rawSpace: rawSpace\n    };\n    return result;\n  };\n  _proto.isNamedCombinator = function isNamedCombinator(position) {\n    if (position === void 0) {\n      position = this.position;\n    }\n    return this.tokens[position + 0] && this.tokens[position + 0][_tokenize.FIELDS.TYPE] === tokens.slash && this.tokens[position + 1] && this.tokens[position + 1][_tokenize.FIELDS.TYPE] === tokens.word && this.tokens[position + 2] && this.tokens[position + 2][_tokenize.FIELDS.TYPE] === tokens.slash;\n  };\n  _proto.namedCombinator = function namedCombinator() {\n    if (this.isNamedCombinator()) {\n      var nameRaw = this.content(this.tokens[this.position + 1]);\n      var name = (0, _util.unesc)(nameRaw).toLowerCase();\n      var raws = {};\n      if (name !== nameRaw) {\n        raws.value = \"/\" + nameRaw + \"/\";\n      }\n      var node = new _combinator[\"default\"]({\n        value: \"/\" + name + \"/\",\n        source: getSource(this.currToken[_tokenize.FIELDS.START_LINE], this.currToken[_tokenize.FIELDS.START_COL], this.tokens[this.position + 2][_tokenize.FIELDS.END_LINE], this.tokens[this.position + 2][_tokenize.FIELDS.END_COL]),\n        sourceIndex: this.currToken[_tokenize.FIELDS.START_POS],\n        raws: raws\n      });\n      this.position = this.position + 3;\n      return node;\n    } else {\n      this.unexpected();\n    }\n  };\n  _proto.combinator = function combinator() {\n    var _this3 = this;\n    if (this.content() === '|') {\n      return this.namespace();\n    }\n    // We need to decide between a space that's a descendant combinator and meaningless whitespace at the end of a selector.\n    var nextSigTokenPos = this.locateNextMeaningfulToken(this.position);\n    if (nextSigTokenPos < 0 || this.tokens[nextSigTokenPos][_tokenize.FIELDS.TYPE] === tokens.comma || this.tokens[nextSigTokenPos][_tokenize.FIELDS.TYPE] === tokens.closeParenthesis) {\n      var nodes = this.parseWhitespaceEquivalentTokens(nextSigTokenPos);\n      if (nodes.length > 0) {\n        var last = this.current.last;\n        if (last) {\n          var _this$convertWhitespa = this.convertWhitespaceNodesToSpace(nodes),\n            space = _this$convertWhitespa.space,\n            rawSpace = _this$convertWhitespa.rawSpace;\n          if (rawSpace !== undefined) {\n            last.rawSpaceAfter += rawSpace;\n          }\n          last.spaces.after += space;\n        } else {\n          nodes.forEach(function (n) {\n            return _this3.newNode(n);\n          });\n        }\n      }\n      return;\n    }\n    var firstToken = this.currToken;\n    var spaceOrDescendantSelectorNodes = undefined;\n    if (nextSigTokenPos > this.position) {\n      spaceOrDescendantSelectorNodes = this.parseWhitespaceEquivalentTokens(nextSigTokenPos);\n    }\n    var node;\n    if (this.isNamedCombinator()) {\n      node = this.namedCombinator();\n    } else if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.combinator) {\n      node = new _combinator[\"default\"]({\n        value: this.content(),\n        source: getTokenSource(this.currToken),\n        sourceIndex: this.currToken[_tokenize.FIELDS.START_POS]\n      });\n      this.position++;\n    } else if (WHITESPACE_TOKENS[this.currToken[_tokenize.FIELDS.TYPE]]) {\n      // pass\n    } else if (!spaceOrDescendantSelectorNodes) {\n      this.unexpected();\n    }\n    if (node) {\n      if (spaceOrDescendantSelectorNodes) {\n        var _this$convertWhitespa2 = this.convertWhitespaceNodesToSpace(spaceOrDescendantSelectorNodes),\n          _space = _this$convertWhitespa2.space,\n          _rawSpace = _this$convertWhitespa2.rawSpace;\n        node.spaces.before = _space;\n        node.rawSpaceBefore = _rawSpace;\n      }\n    } else {\n      // descendant combinator\n      var _this$convertWhitespa3 = this.convertWhitespaceNodesToSpace(spaceOrDescendantSelectorNodes, true),\n        _space2 = _this$convertWhitespa3.space,\n        _rawSpace2 = _this$convertWhitespa3.rawSpace;\n      if (!_rawSpace2) {\n        _rawSpace2 = _space2;\n      }\n      var spaces = {};\n      var raws = {\n        spaces: {}\n      };\n      if (_space2.endsWith(' ') && _rawSpace2.endsWith(' ')) {\n        spaces.before = _space2.slice(0, _space2.length - 1);\n        raws.spaces.before = _rawSpace2.slice(0, _rawSpace2.length - 1);\n      } else if (_space2.startsWith(' ') && _rawSpace2.startsWith(' ')) {\n        spaces.after = _space2.slice(1);\n        raws.spaces.after = _rawSpace2.slice(1);\n      } else {\n        raws.value = _rawSpace2;\n      }\n      node = new _combinator[\"default\"]({\n        value: ' ',\n        source: getTokenSourceSpan(firstToken, this.tokens[this.position - 1]),\n        sourceIndex: firstToken[_tokenize.FIELDS.START_POS],\n        spaces: spaces,\n        raws: raws\n      });\n    }\n    if (this.currToken && this.currToken[_tokenize.FIELDS.TYPE] === tokens.space) {\n      node.spaces.after = this.optionalSpace(this.content());\n      this.position++;\n    }\n    return this.newNode(node);\n  };\n  _proto.comma = function comma() {\n    if (this.position === this.tokens.length - 1) {\n      this.root.trailingComma = true;\n      this.position++;\n      return;\n    }\n    this.current._inferEndPosition();\n    var selector = new _selector[\"default\"]({\n      source: {\n        start: tokenStart(this.tokens[this.position + 1])\n      },\n      sourceIndex: this.tokens[this.position + 1][_tokenize.FIELDS.START_POS]\n    });\n    this.current.parent.append(selector);\n    this.current = selector;\n    this.position++;\n  };\n  _proto.comment = function comment() {\n    var current = this.currToken;\n    this.newNode(new _comment[\"default\"]({\n      value: this.content(),\n      source: getTokenSource(current),\n      sourceIndex: current[_tokenize.FIELDS.START_POS]\n    }));\n    this.position++;\n  };\n  _proto.error = function error(message, opts) {\n    throw this.root.error(message, opts);\n  };\n  _proto.missingBackslash = function missingBackslash() {\n    return this.error('Expected a backslash preceding the semicolon.', {\n      index: this.currToken[_tokenize.FIELDS.START_POS]\n    });\n  };\n  _proto.missingParenthesis = function missingParenthesis() {\n    return this.expected('opening parenthesis', this.currToken[_tokenize.FIELDS.START_POS]);\n  };\n  _proto.missingSquareBracket = function missingSquareBracket() {\n    return this.expected('opening square bracket', this.currToken[_tokenize.FIELDS.START_POS]);\n  };\n  _proto.unexpected = function unexpected() {\n    return this.error(\"Unexpected '\" + this.content() + \"'. Escaping special characters with \\\\ may help.\", this.currToken[_tokenize.FIELDS.START_POS]);\n  };\n  _proto.unexpectedPipe = function unexpectedPipe() {\n    return this.error(\"Unexpected '|'.\", this.currToken[_tokenize.FIELDS.START_POS]);\n  };\n  _proto.namespace = function namespace() {\n    var before = this.prevToken && this.content(this.prevToken) || true;\n    if (this.nextToken[_tokenize.FIELDS.TYPE] === tokens.word) {\n      this.position++;\n      return this.word(before);\n    } else if (this.nextToken[_tokenize.FIELDS.TYPE] === tokens.asterisk) {\n      this.position++;\n      return this.universal(before);\n    }\n    this.unexpectedPipe();\n  };\n  _proto.nesting = function nesting() {\n    if (this.nextToken) {\n      var nextContent = this.content(this.nextToken);\n      if (nextContent === \"|\") {\n        this.position++;\n        return;\n      }\n    }\n    var current = this.currToken;\n    this.newNode(new _nesting[\"default\"]({\n      value: this.content(),\n      source: getTokenSource(current),\n      sourceIndex: current[_tokenize.FIELDS.START_POS]\n    }));\n    this.position++;\n  };\n  _proto.parentheses = function parentheses() {\n    var last = this.current.last;\n    var unbalanced = 1;\n    this.position++;\n    if (last && last.type === types.PSEUDO) {\n      var selector = new _selector[\"default\"]({\n        source: {\n          start: tokenStart(this.tokens[this.position])\n        },\n        sourceIndex: this.tokens[this.position][_tokenize.FIELDS.START_POS]\n      });\n      var cache = this.current;\n      last.append(selector);\n      this.current = selector;\n      while (this.position < this.tokens.length && unbalanced) {\n        if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.openParenthesis) {\n          unbalanced++;\n        }\n        if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.closeParenthesis) {\n          unbalanced--;\n        }\n        if (unbalanced) {\n          this.parse();\n        } else {\n          this.current.source.end = tokenEnd(this.currToken);\n          this.current.parent.source.end = tokenEnd(this.currToken);\n          this.position++;\n        }\n      }\n      this.current = cache;\n    } else {\n      // I think this case should be an error. It's used to implement a basic parse of media queries\n      // but I don't think it's a good idea.\n      var parenStart = this.currToken;\n      var parenValue = \"(\";\n      var parenEnd;\n      while (this.position < this.tokens.length && unbalanced) {\n        if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.openParenthesis) {\n          unbalanced++;\n        }\n        if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.closeParenthesis) {\n          unbalanced--;\n        }\n        parenEnd = this.currToken;\n        parenValue += this.parseParenthesisToken(this.currToken);\n        this.position++;\n      }\n      if (last) {\n        last.appendToPropertyAndEscape(\"value\", parenValue, parenValue);\n      } else {\n        this.newNode(new _string[\"default\"]({\n          value: parenValue,\n          source: getSource(parenStart[_tokenize.FIELDS.START_LINE], parenStart[_tokenize.FIELDS.START_COL], parenEnd[_tokenize.FIELDS.END_LINE], parenEnd[_tokenize.FIELDS.END_COL]),\n          sourceIndex: parenStart[_tokenize.FIELDS.START_POS]\n        }));\n      }\n    }\n    if (unbalanced) {\n      return this.expected('closing parenthesis', this.currToken[_tokenize.FIELDS.START_POS]);\n    }\n  };\n  _proto.pseudo = function pseudo() {\n    var _this4 = this;\n    var pseudoStr = '';\n    var startingToken = this.currToken;\n    while (this.currToken && this.currToken[_tokenize.FIELDS.TYPE] === tokens.colon) {\n      pseudoStr += this.content();\n      this.position++;\n    }\n    if (!this.currToken) {\n      return this.expected(['pseudo-class', 'pseudo-element'], this.position - 1);\n    }\n    if (this.currToken[_tokenize.FIELDS.TYPE] === tokens.word) {\n      this.splitWord(false, function (first, length) {\n        pseudoStr += first;\n        _this4.newNode(new _pseudo[\"default\"]({\n          value: pseudoStr,\n          source: getTokenSourceSpan(startingToken, _this4.currToken),\n          sourceIndex: startingToken[_tokenize.FIELDS.START_POS]\n        }));\n        if (length > 1 && _this4.nextToken && _this4.nextToken[_tokenize.FIELDS.TYPE] === tokens.openParenthesis) {\n          _this4.error('Misplaced parenthesis.', {\n            index: _this4.nextToken[_tokenize.FIELDS.START_POS]\n          });\n        }\n      });\n    } else {\n      return this.expected(['pseudo-class', 'pseudo-element'], this.currToken[_tokenize.FIELDS.START_POS]);\n    }\n  };\n  _proto.space = function space() {\n    var content = this.content();\n    // Handle space before and after the selector\n    if (this.position === 0 || this.prevToken[_tokenize.FIELDS.TYPE] === tokens.comma || this.prevToken[_tokenize.FIELDS.TYPE] === tokens.openParenthesis || this.current.nodes.every(function (node) {\n      return node.type === 'comment';\n    })) {\n      this.spaces = this.optionalSpace(content);\n      this.position++;\n    } else if (this.position === this.tokens.length - 1 || this.nextToken[_tokenize.FIELDS.TYPE] === tokens.comma || this.nextToken[_tokenize.FIELDS.TYPE] === tokens.closeParenthesis) {\n      this.current.last.spaces.after = this.optionalSpace(content);\n      this.position++;\n    } else {\n      this.combinator();\n    }\n  };\n  _proto.string = function string() {\n    var current = this.currToken;\n    this.newNode(new _string[\"default\"]({\n      value: this.content(),\n      source: getTokenSource(current),\n      sourceIndex: current[_tokenize.FIELDS.START_POS]\n    }));\n    this.position++;\n  };\n  _proto.universal = function universal(namespace) {\n    var nextToken = this.nextToken;\n    if (nextToken && this.content(nextToken) === '|') {\n      this.position++;\n      return this.namespace();\n    }\n    var current = this.currToken;\n    this.newNode(new _universal[\"default\"]({\n      value: this.content(),\n      source: getTokenSource(current),\n      sourceIndex: current[_tokenize.FIELDS.START_POS]\n    }), namespace);\n    this.position++;\n  };\n  _proto.splitWord = function splitWord(namespace, firstCallback) {\n    var _this5 = this;\n    var nextToken = this.nextToken;\n    var word = this.content();\n    while (nextToken && ~[tokens.dollar, tokens.caret, tokens.equals, tokens.word].indexOf(nextToken[_tokenize.FIELDS.TYPE])) {\n      this.position++;\n      var current = this.content();\n      word += current;\n      if (current.lastIndexOf('\\\\') === current.length - 1) {\n        var next = this.nextToken;\n        if (next && next[_tokenize.FIELDS.TYPE] === tokens.space) {\n          word += this.requiredSpace(this.content(next));\n          this.position++;\n        }\n      }\n      nextToken = this.nextToken;\n    }\n    var hasClass = indexesOf(word, '.').filter(function (i) {\n      // Allow escaped dot within class name\n      var escapedDot = word[i - 1] === '\\\\';\n      // Allow decimal numbers percent in @keyframes\n      var isKeyframesPercent = /^\\d+\\.\\d+%$/.test(word);\n      return !escapedDot && !isKeyframesPercent;\n    });\n    var hasId = indexesOf(word, '#').filter(function (i) {\n      return word[i - 1] !== '\\\\';\n    });\n    // Eliminate Sass interpolations from the list of id indexes\n    var interpolations = indexesOf(word, '#{');\n    if (interpolations.length) {\n      hasId = hasId.filter(function (hashIndex) {\n        return !~interpolations.indexOf(hashIndex);\n      });\n    }\n    var indices = (0, _sortAscending[\"default\"])(uniqs([0].concat(hasClass, hasId)));\n    indices.forEach(function (ind, i) {\n      var index = indices[i + 1] || word.length;\n      var value = word.slice(ind, index);\n      if (i === 0 && firstCallback) {\n        return firstCallback.call(_this5, value, indices.length);\n      }\n      var node;\n      var current = _this5.currToken;\n      var sourceIndex = current[_tokenize.FIELDS.START_POS] + indices[i];\n      var source = getSource(current[1], current[2] + ind, current[3], current[2] + (index - 1));\n      if (~hasClass.indexOf(ind)) {\n        var classNameOpts = {\n          value: value.slice(1),\n          source: source,\n          sourceIndex: sourceIndex\n        };\n        node = new _className[\"default\"](unescapeProp(classNameOpts, \"value\"));\n      } else if (~hasId.indexOf(ind)) {\n        var idOpts = {\n          value: value.slice(1),\n          source: source,\n          sourceIndex: sourceIndex\n        };\n        node = new _id[\"default\"](unescapeProp(idOpts, \"value\"));\n      } else {\n        var tagOpts = {\n          value: value,\n          source: source,\n          sourceIndex: sourceIndex\n        };\n        unescapeProp(tagOpts, \"value\");\n        node = new _tag[\"default\"](tagOpts);\n      }\n      _this5.newNode(node, namespace);\n      // Ensure that the namespace is used only once\n      namespace = null;\n    });\n    this.position++;\n  };\n  _proto.word = function word(namespace) {\n    var nextToken = this.nextToken;\n    if (nextToken && this.content(nextToken) === '|') {\n      this.position++;\n      return this.namespace();\n    }\n    return this.splitWord(namespace);\n  };\n  _proto.loop = function loop() {\n    while (this.position < this.tokens.length) {\n      this.parse(true);\n    }\n    this.current._inferEndPosition();\n    return this.root;\n  };\n  _proto.parse = function parse(throwOnParenthesis) {\n    switch (this.currToken[_tokenize.FIELDS.TYPE]) {\n      case tokens.space:\n        this.space();\n        break;\n      case tokens.comment:\n        this.comment();\n        break;\n      case tokens.openParenthesis:\n        this.parentheses();\n        break;\n      case tokens.closeParenthesis:\n        if (throwOnParenthesis) {\n          this.missingParenthesis();\n        }\n        break;\n      case tokens.openSquare:\n        this.attribute();\n        break;\n      case tokens.dollar:\n      case tokens.caret:\n      case tokens.equals:\n      case tokens.word:\n        this.word();\n        break;\n      case tokens.colon:\n        this.pseudo();\n        break;\n      case tokens.comma:\n        this.comma();\n        break;\n      case tokens.asterisk:\n        this.universal();\n        break;\n      case tokens.ampersand:\n        this.nesting();\n        break;\n      case tokens.slash:\n      case tokens.combinator:\n        this.combinator();\n        break;\n      case tokens.str:\n        this.string();\n        break;\n      // These cases throw; no break needed.\n      case tokens.closeSquare:\n        this.missingSquareBracket();\n      case tokens.semicolon:\n        this.missingBackslash();\n      default:\n        this.unexpected();\n    }\n  }\n\n  /**\n   * Helpers\n   */;\n  _proto.expected = function expected(description, index, found) {\n    if (Array.isArray(description)) {\n      var last = description.pop();\n      description = description.join(', ') + \" or \" + last;\n    }\n    var an = /^[aeiou]/.test(description[0]) ? 'an' : 'a';\n    if (!found) {\n      return this.error(\"Expected \" + an + \" \" + description + \".\", {\n        index: index\n      });\n    }\n    return this.error(\"Expected \" + an + \" \" + description + \", found \\\"\" + found + \"\\\" instead.\", {\n      index: index\n    });\n  };\n  _proto.requiredSpace = function requiredSpace(space) {\n    return this.options.lossy ? ' ' : space;\n  };\n  _proto.optionalSpace = function optionalSpace(space) {\n    return this.options.lossy ? '' : space;\n  };\n  _proto.lossySpace = function lossySpace(space, required) {\n    if (this.options.lossy) {\n      return required ? ' ' : '';\n    } else {\n      return space;\n    }\n  };\n  _proto.parseParenthesisToken = function parseParenthesisToken(token) {\n    var content = this.content(token);\n    if (token[_tokenize.FIELDS.TYPE] === tokens.space) {\n      return this.requiredSpace(content);\n    } else {\n      return content;\n    }\n  };\n  _proto.newNode = function newNode(node, namespace) {\n    if (namespace) {\n      if (/^ +$/.test(namespace)) {\n        if (!this.options.lossy) {\n          this.spaces = (this.spaces || '') + namespace;\n        }\n        namespace = true;\n      }\n      node.namespace = namespace;\n      unescapeProp(node, \"namespace\");\n    }\n    if (this.spaces) {\n      node.spaces.before = this.spaces;\n      this.spaces = '';\n    }\n    return this.current.append(node);\n  };\n  _proto.content = function content(token) {\n    if (token === void 0) {\n      token = this.currToken;\n    }\n    return this.css.slice(token[_tokenize.FIELDS.START_POS], token[_tokenize.FIELDS.END_POS]);\n  };\n  /**\n   * returns the index of the next non-whitespace, non-comment token.\n   * returns -1 if no meaningful token is found.\n   */\n  _proto.locateNextMeaningfulToken = function locateNextMeaningfulToken(startPosition) {\n    if (startPosition === void 0) {\n      startPosition = this.position + 1;\n    }\n    var searchPosition = startPosition;\n    while (searchPosition < this.tokens.length) {\n      if (WHITESPACE_EQUIV_TOKENS[this.tokens[searchPosition][_tokenize.FIELDS.TYPE]]) {\n        searchPosition++;\n        continue;\n      } else {\n        return searchPosition;\n      }\n    }\n    return -1;\n  };\n  _createClass(Parser, [{\n    key: \"currToken\",\n    get: function get() {\n      return this.tokens[this.position];\n    }\n  }, {\n    key: \"nextToken\",\n    get: function get() {\n      return this.tokens[this.position + 1];\n    }\n  }, {\n    key: \"prevToken\",\n    get: function get() {\n      return this.tokens[this.position - 1];\n    }\n  }]);\n  return Parser;\n}();\nexports[\"default\"] = Parser;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _parser = _interopRequireDefault(require(\"./parser\"));\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nvar Processor = /*#__PURE__*/function () {\n  function Processor(func, options) {\n    this.func = func || function noop() {};\n    this.funcRes = null;\n    this.options = options;\n  }\n  var _proto = Processor.prototype;\n  _proto._shouldUpdateSelector = function _shouldUpdateSelector(rule, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var merged = Object.assign({}, this.options, options);\n    if (merged.updateSelector === false) {\n      return false;\n    } else {\n      return typeof rule !== \"string\";\n    }\n  };\n  _proto._isLossy = function _isLossy(options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var merged = Object.assign({}, this.options, options);\n    if (merged.lossless === false) {\n      return true;\n    } else {\n      return false;\n    }\n  };\n  _proto._root = function _root(rule, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var parser = new _parser[\"default\"](rule, this._parseOptions(options));\n    return parser.root;\n  };\n  _proto._parseOptions = function _parseOptions(options) {\n    return {\n      lossy: this._isLossy(options)\n    };\n  };\n  _proto._run = function _run(rule, options) {\n    var _this = this;\n    if (options === void 0) {\n      options = {};\n    }\n    return new Promise(function (resolve, reject) {\n      try {\n        var root = _this._root(rule, options);\n        Promise.resolve(_this.func(root)).then(function (transform) {\n          var string = undefined;\n          if (_this._shouldUpdateSelector(rule, options)) {\n            string = root.toString();\n            rule.selector = string;\n          }\n          return {\n            transform: transform,\n            root: root,\n            string: string\n          };\n        }).then(resolve, reject);\n      } catch (e) {\n        reject(e);\n        return;\n      }\n    });\n  };\n  _proto._runSync = function _runSync(rule, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var root = this._root(rule, options);\n    var transform = this.func(root);\n    if (transform && typeof transform.then === \"function\") {\n      throw new Error(\"Selector processor returned a promise to a synchronous call.\");\n    }\n    var string = undefined;\n    if (options.updateSelector && typeof rule !== \"string\") {\n      string = root.toString();\n      rule.selector = string;\n    }\n    return {\n      transform: transform,\n      root: root,\n      string: string\n    };\n  }\n\n  /**\n   * Process rule into a selector AST.\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {Promise<parser.Root>} The AST of the selector after processing it.\n   */;\n  _proto.ast = function ast(rule, options) {\n    return this._run(rule, options).then(function (result) {\n      return result.root;\n    });\n  }\n\n  /**\n   * Process rule into a selector AST synchronously.\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {parser.Root} The AST of the selector after processing it.\n   */;\n  _proto.astSync = function astSync(rule, options) {\n    return this._runSync(rule, options).root;\n  }\n\n  /**\n   * Process a selector into a transformed value asynchronously\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {Promise<any>} The value returned by the processor.\n   */;\n  _proto.transform = function transform(rule, options) {\n    return this._run(rule, options).then(function (result) {\n      return result.transform;\n    });\n  }\n\n  /**\n   * Process a selector into a transformed value synchronously.\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {any} The value returned by the processor.\n   */;\n  _proto.transformSync = function transformSync(rule, options) {\n    return this._runSync(rule, options).transform;\n  }\n\n  /**\n   * Process a selector into a new selector string asynchronously.\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {string} the selector after processing.\n   */;\n  _proto.process = function process(rule, options) {\n    return this._run(rule, options).then(function (result) {\n      return result.string || result.root.toString();\n    });\n  }\n\n  /**\n   * Process a selector into a new selector string synchronously.\n   *\n   * @param rule {postcss.Rule | string} The css selector to be processed\n   * @param options The options for processing\n   * @returns {string} the selector after processing.\n   */;\n  _proto.processSync = function processSync(rule, options) {\n    var result = this._runSync(rule, options);\n    return result.string || result.root.toString();\n  };\n  return Processor;\n}();\nexports[\"default\"] = Processor;\nmodule.exports = exports.default;", "\"use strict\";\n\nexports.__esModule = true;\nexports.universal = exports.tag = exports.string = exports.selector = exports.root = exports.pseudo = exports.nesting = exports.id = exports.comment = exports.combinator = exports.className = exports.attribute = void 0;\nvar _attribute = _interopRequireDefault(require(\"./attribute\"));\nvar _className = _interopRequireDefault(require(\"./className\"));\nvar _combinator = _interopRequireDefault(require(\"./combinator\"));\nvar _comment = _interopRequireDefault(require(\"./comment\"));\nvar _id = _interopRequireDefault(require(\"./id\"));\nvar _nesting = _interopRequireDefault(require(\"./nesting\"));\nvar _pseudo = _interopRequireDefault(require(\"./pseudo\"));\nvar _root = _interopRequireDefault(require(\"./root\"));\nvar _selector = _interopRequireDefault(require(\"./selector\"));\nvar _string = _interopRequireDefault(require(\"./string\"));\nvar _tag = _interopRequireDefault(require(\"./tag\"));\nvar _universal = _interopRequireDefault(require(\"./universal\"));\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nvar attribute = function attribute(opts) {\n  return new _attribute[\"default\"](opts);\n};\nexports.attribute = attribute;\nvar className = function className(opts) {\n  return new _className[\"default\"](opts);\n};\nexports.className = className;\nvar combinator = function combinator(opts) {\n  return new _combinator[\"default\"](opts);\n};\nexports.combinator = combinator;\nvar comment = function comment(opts) {\n  return new _comment[\"default\"](opts);\n};\nexports.comment = comment;\nvar id = function id(opts) {\n  return new _id[\"default\"](opts);\n};\nexports.id = id;\nvar nesting = function nesting(opts) {\n  return new _nesting[\"default\"](opts);\n};\nexports.nesting = nesting;\nvar pseudo = function pseudo(opts) {\n  return new _pseudo[\"default\"](opts);\n};\nexports.pseudo = pseudo;\nvar root = function root(opts) {\n  return new _root[\"default\"](opts);\n};\nexports.root = root;\nvar selector = function selector(opts) {\n  return new _selector[\"default\"](opts);\n};\nexports.selector = selector;\nvar string = function string(opts) {\n  return new _string[\"default\"](opts);\n};\nexports.string = string;\nvar tag = function tag(opts) {\n  return new _tag[\"default\"](opts);\n};\nexports.tag = tag;\nvar universal = function universal(opts) {\n  return new _universal[\"default\"](opts);\n};\nexports.universal = universal;", "\"use strict\";\n\nexports.__esModule = true;\nexports.isComment = exports.isCombinator = exports.isClassName = exports.isAttribute = void 0;\nexports.isContainer = isContainer;\nexports.isIdentifier = void 0;\nexports.isNamespace = isNamespace;\nexports.isNesting = void 0;\nexports.isNode = isNode;\nexports.isPseudo = void 0;\nexports.isPseudoClass = isPseudoClass;\nexports.isPseudoElement = isPseudoElement;\nexports.isUniversal = exports.isTag = exports.isString = exports.isSelector = exports.isRoot = void 0;\nvar _types = require(\"./types\");\nvar _IS_TYPE;\nvar IS_TYPE = (_IS_TYPE = {}, _IS_TYPE[_types.ATTRIBUTE] = true, _IS_TYPE[_types.CLASS] = true, _IS_TYPE[_types.COMBINATOR] = true, _IS_TYPE[_types.COMMENT] = true, _IS_TYPE[_types.ID] = true, _IS_TYPE[_types.NESTING] = true, _IS_TYPE[_types.PSEUDO] = true, _IS_TYPE[_types.ROOT] = true, _IS_TYPE[_types.SELECTOR] = true, _IS_TYPE[_types.STRING] = true, _IS_TYPE[_types.TAG] = true, _IS_TYPE[_types.UNIVERSAL] = true, _IS_TYPE);\nfunction isNode(node) {\n  return typeof node === \"object\" && IS_TYPE[node.type];\n}\nfunction isNodeType(type, node) {\n  return isNode(node) && node.type === type;\n}\nvar isAttribute = isNodeType.bind(null, _types.ATTRIBUTE);\nexports.isAttribute = isAttribute;\nvar isClassName = isNodeType.bind(null, _types.CLASS);\nexports.isClassName = isClassName;\nvar isCombinator = isNodeType.bind(null, _types.COMBINATOR);\nexports.isCombinator = isCombinator;\nvar isComment = isNodeType.bind(null, _types.COMMENT);\nexports.isComment = isComment;\nvar isIdentifier = isNodeType.bind(null, _types.ID);\nexports.isIdentifier = isIdentifier;\nvar isNesting = isNodeType.bind(null, _types.NESTING);\nexports.isNesting = isNesting;\nvar isPseudo = isNodeType.bind(null, _types.PSEUDO);\nexports.isPseudo = isPseudo;\nvar isRoot = isNodeType.bind(null, _types.ROOT);\nexports.isRoot = isRoot;\nvar isSelector = isNodeType.bind(null, _types.SELECTOR);\nexports.isSelector = isSelector;\nvar isString = isNodeType.bind(null, _types.STRING);\nexports.isString = isString;\nvar isTag = isNodeType.bind(null, _types.TAG);\nexports.isTag = isTag;\nvar isUniversal = isNodeType.bind(null, _types.UNIVERSAL);\nexports.isUniversal = isUniversal;\nfunction isPseudoElement(node) {\n  return isPseudo(node) && node.value && (node.value.startsWith(\"::\") || node.value.toLowerCase() === \":before\" || node.value.toLowerCase() === \":after\" || node.value.toLowerCase() === \":first-letter\" || node.value.toLowerCase() === \":first-line\");\n}\nfunction isPseudoClass(node) {\n  return isPseudo(node) && !isPseudoElement(node);\n}\nfunction isContainer(node) {\n  return !!(isNode(node) && node.walk);\n}\nfunction isNamespace(node) {\n  return isAttribute(node) || isTag(node);\n}", "\"use strict\";\n\nexports.__esModule = true;\nvar _types = require(\"./types\");\nObject.keys(_types).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _types[key]) return;\n  exports[key] = _types[key];\n});\nvar _constructors = require(\"./constructors\");\nObject.keys(_constructors).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _constructors[key]) return;\n  exports[key] = _constructors[key];\n});\nvar _guards = require(\"./guards\");\nObject.keys(_guards).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _guards[key]) return;\n  exports[key] = _guards[key];\n});", "\"use strict\";\n\nexports.__esModule = true;\nexports[\"default\"] = void 0;\nvar _processor = _interopRequireDefault(require(\"./processor\"));\nvar selectors = _interopRequireWildcard(require(\"./selectors\"));\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { \"default\": obj }; }\nvar parser = function parser(processor) {\n  return new _processor[\"default\"](processor);\n};\nObject.assign(parser, selectors);\ndelete parser.__esModule;\nvar _default = parser;\nexports[\"default\"] = _default;\nmodule.exports = exports.default;", "import type { IncomingMessage } from 'http'\n\n/**\n * Codification of vlt's Error.cause conventions\n *\n * Add new properties to this list as needed.\n *\n * Several of these types are just very basic duck-typing, because referencing\n * internal types directly would create a workspace dependency cycle.\n */\nexport type ErrorCauseObject = {\n  /**\n   * The `cause` field within a `cause` object should\n   * always be an `Error` object that was previously thrown. Note\n   * that the `cause` on an Error itself might _also_ be a\n   * previously thrown error, if no additional information could be\n   * usefully added beyond improving the message.\n   */\n  cause?: ErrorCause\n\n  /** the name of something */\n  name?: string\n\n  /** byte offset in a Buffer or file */\n  offset?: number\n\n  /**\n   * This should only be a string code that we set. See {@link Codes} for\n   * the supported options. Lower-level system codes like `ENOENT` should\n   * remain on the errors that generated them.\n   */\n  code?: Codes\n\n  /** target of a file system operation */\n  path?: string\n\n  /**\n   * file path origin of a resolution that failed, for example in the case\n   * of `file://` specifiers.\n   */\n  from?: string\n\n  /** path on disk that is being written, linked, or extracted to */\n  target?: string\n\n  /** Spec object/string relevant to an operation that failed */\n  spec?:\n    | string\n    | {\n        type: 'file' | 'git' | 'registry' | 'remote' | 'workspace'\n        spec: string\n        [k: number | string | symbol]: any\n      }\n\n  /** exit code of a process, or HTTP response status code */\n  status?: number | null\n\n  /** null or a signal that a process received */\n  signal?: NodeJS.Signals | null\n\n  /** the root of a project */\n  projectRoot?: string\n\n  /** the current working directory of a process */\n  cwd?: string\n\n  /** a command being run in a child process */\n  command?: string\n\n  /** the arguments passed to a process */\n  args?: string[]\n\n  /** standard output from a process */\n  stdout?: Buffer | string | null\n\n  /** standard error from a process */\n  stderr?: Buffer | string | null\n\n  /**\n   * Array of valid options when something is not a valid option.\n   * (For use in `did you mean X?` output.)\n   */\n  validOptions?: any[]\n\n  /**\n   * message indicating what bit of work this might be a part of, what feature\n   * needs to be implemented, etc. Eg, `{ todo: 'nested workspace support' }`.\n   */\n  todo?: string\n\n  /**\n   * A desired value that was not found, or a regular expression or other\n   * pattern describing it.\n   */\n  wanted?: any\n\n  /** actual value, which was not wanted */\n  found?: any\n\n  /** HTTP message, fetch.Response, or `@vltpkg/registry-client.CacheEntry` */\n  response?:\n    | IncomingMessage\n    | Response\n    | {\n        statusCode: number\n        headers: Buffer[] | Record<string, string[] | string>\n        text: () => string\n        [k: number | string | symbol]: any\n      }\n\n  /** string or URL object */\n  url?: URL | string\n\n  /** git repository remote or path */\n  repository?: string\n\n  /** string or `@vltpkg/semver.Version` object */\n  version?:\n    | string\n    | {\n        raw: string\n        major: number\n        minor: number\n        patch: number\n        [k: number | string | symbol]: any\n      }\n\n  /** string or `@vltpkg/semver.Range` object */\n  range?:\n    | string\n    | {\n        raw: string\n        isAny: boolean\n        includePrerelease: boolean\n        [k: number | string | symbol]: any\n      }\n\n  /** a package manifest, either from `package.json` or a registry */\n  manifest?: DuckTypeManifest\n\n  /** registry top-level package document */\n  packument?: {\n    name: string\n    'dist-tags': Record<string, string>\n    versions: Record<string, DuckTypeManifest>\n    time?: Record<string, string>\n  }\n\n  /** maximum value, which was exceeded */\n  max?: any\n\n  /** minimum value, which was not met */\n  min?: any\n}\n\nexport type DuckTypeManifest = Record<string, any> & {\n  name?: string\n  version?: string\n  deprecated?: string\n  engines?: Record<string, string>\n  os?: string[] | string\n  arch?: string[] | string\n  dist?: {\n    integrity?: string\n    shasum?: string\n    tarball?: string\n    fileCount?: number\n    unpackedSize?: number\n    signatures?: {\n      keyid: string\n      sig: string\n    }[]\n  }\n}\n\nexport type ErrorCause = Error | ErrorCauseObject\n\n/**\n * Valid properties for the 'code' field in an Error cause.\n * Add new options to this list as needed.\n */\nexport type Codes =\n  | 'EEXIST'\n  | 'EINTEGRITY'\n  | 'EINVAL'\n  | 'ELIFECYCLE'\n  | 'EMAXREDIRECT'\n  | 'ENEEDAUTH'\n  | 'ENOENT'\n  | 'ENOGIT'\n  | 'ERESOLVE'\n  | 'EUNKNOWN'\n\nconst create = (\n  cls: typeof Error,\n  defaultFrom: ((...a: any[]) => any) | (new (...a: any[]) => any),\n  message: string,\n  cause?: ErrorCause,\n  from:\n    | ((...a: any[]) => any)\n    | (new (...a: any[]) => any) = defaultFrom,\n) => {\n  const er = new cls(message, cause ? { cause } : undefined)\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n  Error.captureStackTrace?.(er, from)\n  return er\n}\n\nexport const error = (\n  message: string,\n  cause?: ErrorCause,\n  from?: ((...a: any[]) => any) | (new (...a: any[]) => any),\n) => create(Error, error, message, cause, from)\n\nexport const typeError = (\n  message: string,\n  cause?: ErrorCause,\n  from?: ((...a: any[]) => any) | (new (...a: any[]) => any),\n) => create(TypeError, typeError, message, cause, from)\n\nexport const syntaxError = (\n  message: string,\n  cause?: ErrorCause,\n  from?: ((...a: any[]) => any) | (new (...a: any[]) => any),\n) => create(SyntaxError, syntaxError, message, cause, from)\n", "import { homedir } from 'node:os'\nimport {\n  isAbsolute,\n  join,\n  resolve,\n  win32 as winPath,\n} from 'node:path'\nimport { inspect, InspectOptions } from 'node:util'\nimport {\n  defaultRegistry,\n  defaultRegistries,\n  defaultGitHosts,\n  defaultGitHostArchives,\n  defaultScopeRegistries,\n  getOptions,\n  gitHostWebsites,\n  kCustomInspect,\n  Spec as BrowserSpec,\n  SpecLike,\n} from './browser.js'\n\nexport {\n  defaultRegistry,\n  defaultRegistries,\n  defaultGitHosts,\n  defaultGitHostArchives,\n  defaultScopeRegistries,\n  getOptions,\n  gitHostWebsites,\n  kCustomInspect,\n}\nexport * from './types.js'\n\nexport class Spec extends BrowserSpec implements SpecLike<Spec> {\n  [kCustomInspect](\n    _depth?: number,\n    options?: InspectOptions,\n  ): string {\n    const str = inspect(\n      Object.fromEntries(\n        Object.entries(this).filter(([k, v]) => {\n          return k !== 'options' && v !== undefined\n        }),\n      ),\n      options,\n    )\n    return `@vltpkg/spec.Spec ${str}`\n  }\n}\n\nSpec.nodejsDependencies = {\n  homedir,\n  isAbsolute,\n  join,\n  resolve,\n  winPath,\n}\n", "/** utility types to turn a null/undefined/void return into string */\nexport type NullToString<T> = VoidReplace<T>\n\n/** Utility type to replace null/undefined with a given type */\nexport type NullReplace<T, R = string> =\n  T extends NonNullable<T> ? T : NonNullable<T> | R\n\n/** Utility type to replace void with a given type */\nexport type VoidReplace<T, R = string> =\n  undefined extends T ? NullReplace<Exclude<T, void>, R> | R\n  : NullReplace<T, R>\n\n/**\n * Split a string by a string delimiter, optionally limiting the number\n * of parts parsed, and/or transforming the string parts into some other\n * type of value.\n *\n * Pass `-1` as the `limit` parameter to get all parts (useful if an `onPart`\n * method is provided)\n *\n * If an `onPart` method is provided, and returns `undefined`, then the\n * original string part is included in the result set.\n *\n * ```ts\n * import { fastSplit } from '@vltpkg/fast-split'\n *\n * // say we want to split a string on '.' characters\n * const str = getSomeStringSomehow()\n *\n * // basic usage, just like str.split('.'), gives us an array\n * const parts = fastSplit(str, '.')\n *\n * // get just the first two parts, leave the rest intact\n * // Note: unlike str.split('.', 3), the 'rest' here will\n * // include the entire rest of the string.\n * // If you do `str.split('.', 3)`, then the last item in the\n * // returned array is truncated at the next delimiter\n * const [first, second, rest] = fastSplit(str, '.', 3)\n *\n * // If you need to transform it, say if it's an IPv4 address\n * // that you want to turn into numbers, you can do that by\n * // providing the onPart method, which will be slightly faster\n * // than getting an array and subsequently looping over it\n * // pass `-1` as the limit to give us all parts\n * const nums = fastSplit(str, '.', -1, (part, parts, index) => Number(s))\n * ```\n */\nexport function fastSplit<T = string>(\n  str: string,\n  delim: string,\n  limit: number,\n  onPart: (part: string, parts: NullToString<T>[], i: number) => T,\n): NullToString<T>[]\nexport function fastSplit(\n  str: string,\n  delim: string,\n  limit?: number,\n): string[]\nexport function fastSplit<T = string>(\n  str: string,\n  delim: string,\n  limit = -1,\n  onPart?: (\n    part: string,\n    parts: NullToString<T>[],\n    i: number,\n  ) => T | undefined,\n): NullToString<T>[] {\n  let i = 0\n  let p = 0\n  const l = delim.length\n  const parts: NullToString<T>[] = []\n  while (i !== -1) {\n    i = str.indexOf(delim, p)\n    const part =\n      i === -1 || parts.length === limit - 1 ?\n        str.substring(p)\n      : str.substring(p, i)\n    parts.push((onPart?.(part, parts, i) ?? part) as NullToString<T>)\n    if (parts.length === limit) {\n      // push the rest into the last part\n      return parts\n    }\n    p = i + l\n  }\n  return parts\n}\n", "import { syntaxError, typeError } from '@vltpkg/error-cause'\nimport { fastSplit } from '@vltpkg/fast-split'\nimport { type Range } from './range.js'\n\nconst maybeNumber = (s: string): number | string => {\n  if (!/^[0-9]+$/.test(s)) return s\n  const n = Number(s)\n  return n <= Number.MAX_SAFE_INTEGER ? n : s\n}\n\nconst safeNumber = (\n  s: string,\n  version: string,\n  field: string,\n): number => {\n  const n = Number(s)\n  if (n > Number.MAX_SAFE_INTEGER) {\n    throw invalidVersion(\n      version,\n      `invalid ${field}, must be <= ${Number.MAX_SAFE_INTEGER}`,\n    )\n  }\n  return n\n}\n\nconst re = {\n  prefix: /^[ v=]+/,\n  main: /^(0|[1-9]\\d*)\\.(0|[1-9]\\d*)\\.(0|[1-9]\\d*)/,\n  prerelease: /-([0-9a-zA-Z_.-]+)(?:$|\\+)/,\n  build: /\\+([0-9a-zA-Z_.-]+)$/,\n  full: /^[ v=]*(0|[1-9]\\d*)\\.(0|[1-9]\\d*)\\.(0|[1-9]\\d*)(?:-([0-9a-zA-Z_.-]+))?(?:\\+([0-9a-zA-Z_.-]+))?$/,\n} as const\n\nconst invalidVersion = (\n  version: string,\n  message: string,\n): SyntaxError => {\n  const er = syntaxError(\n    `invalid version: ${message}`,\n    { version },\n    Version,\n  )\n  return er\n}\n\n/**\n * Types of incrementing supported by {@link Version#inc}\n */\nexport type IncrementType =\n  | 'major'\n  | 'minor'\n  | 'patch'\n  | 'pre'\n  | 'premajor'\n  | 'preminor'\n  | 'prepatch'\n  | 'prerelease'\n\n/**\n * A parsed object representation of a SemVer version string\n *\n * This is a bit less forgiving than node-semver, in that prerelease versions\n * MUST start with '-'. Otherwise, the allowed syntax is identical.\n */\nexport class Version {\n  /** raw string provided to create this Version */\n  raw: string\n\n  /**  major version number */\n  major: number\n  /** minor version number */\n  minor: number\n  /** patch version number */\n  patch: number\n  /**\n   * List of `'.'`-separated strings and numbers indicating that this\n   * version is a prerelease.\n   *\n   * This is undefined if the version does not have a prerelease section.\n   */\n  prerelease?: (number | string)[]\n  /**\n   * List of `'.'`-separated strings in the `build` section.\n   *\n   * This is undefined if the version does not have a build.\n   */\n  build?: string[]\n\n  /** Canonical strict form of this version */\n  toString() {\n    return `${this.major}.${this.minor}.${this.patch}${\n      this.prerelease ? '-' + this.prerelease.join('.') : ''\n    }${this.build ? '+' + this.build.join('.') : ''}`\n  }\n\n  /** Generate a `Version` object from a SemVer string */\n  static parse(version: string) {\n    version = version.replace(re.prefix, '').trim()\n    if (version.length > 256) {\n      throw invalidVersion(\n        version,\n        'must be less than 256 characters',\n      )\n    }\n\n    const parsed = version.match(re.full)\n    if (!parsed) {\n      const main = version.match(re.main)\n      if (!main) {\n        throw invalidVersion(\n          version,\n          'no Major.minor.patch tuple present',\n        )\n      } else {\n        throw invalidVersion(\n          version,\n          'invalid build or patch section',\n        )\n      }\n    }\n    const [_, major_, minor_, patch_, prerelease, build] = parsed as [\n      string,\n      string,\n      string,\n      string,\n      string | undefined,\n      string | undefined,\n    ]\n    const major = safeNumber(major_, version, 'major')\n    const minor = safeNumber(minor_, version, 'minor')\n    const patch = safeNumber(patch_, version, 'patch')\n\n    return new Version(\n      version,\n      major,\n      minor,\n      patch,\n      prerelease,\n      build,\n    )\n  }\n\n  constructor(\n    version: string,\n    major: number,\n    minor: number,\n    patch: number,\n    prerelease: string | undefined,\n    build: string | undefined,\n  ) {\n    this.raw = version\n    this.major = major\n    this.minor = minor\n    this.patch = patch\n\n    // has prerelease and/or build\n    if (prerelease) {\n      this.prerelease = fastSplit(prerelease, '.', -1, c => {\n        if (!c) {\n          throw invalidVersion(\n            version,\n            'invalid prerelease, empty identifiers not allowed',\n          )\n        }\n        return maybeNumber(c)\n      })\n    }\n    if (build) {\n      this.build = fastSplit(build, '.', -1, c => {\n        if (!c) {\n          throw invalidVersion(\n            version,\n            'invalid build metadata, empty identifiers not allowed',\n          )\n        }\n      })\n    }\n  }\n\n  /**\n   * Return 1 if this is > the provided version, -1 if we're less, or 0 if\n   * they are equal.\n   *\n   * No special handling for prerelease versions, this is just a precedence\n   * comparison.\n   *\n   * This can be used to sort a list of versions by precedence:\n   *\n   * ```ts\n   * const versions: Version[] = getVersionsSomehow()\n   * const sorted = versions.sort((a, b) => a.compare(b))\n   * ```\n   */\n  compare(v: Version): -1 | 0 | 1 {\n    if (this.major > v.major) return 1\n    if (this.major < v.major) return -1\n    if (this.minor > v.minor) return 1\n    if (this.minor < v.minor) return -1\n    if (this.patch > v.patch) return 1\n    if (this.patch < v.patch) return -1\n    // main tuple is equal now\n    // if the version has no pr, we're definitely less than or equal to\n    if (!v.prerelease?.length)\n      return !this.prerelease?.length ? 0 : -1\n    // v has a pr. if we don't, we're > it\n    if (!this.prerelease?.length) return 1\n    // we both have prereleases\n    const len = Math.max(this.prerelease.length, v.prerelease.length)\n    const me = this.prerelease\n    const thee = v.prerelease\n    for (let i = 0; i < len; i++) {\n      const m = me[i]\n      const t = thee[i]\n      if (m === t) continue\n      // having a field is > not having it\n      if (t === undefined) return 1\n      if (m === undefined) return -1\n      // string parts are higher precedence than\n      if (typeof m !== typeof t) {\n        return typeof m === 'string' ? 1 : -1\n      }\n      return m > t ? 1 : -1\n    }\n    return 0\n  }\n\n  /**\n   * The inverse of compare, for sorting version lists in reverse order\n   */\n  rcompare(v: Version) {\n    return -1 * this.compare(v)\n  }\n\n  /** true if this version is > the argument */\n  greaterThan(v: Version) {\n    return this.compare(v) === 1\n  }\n\n  /** true if this version is >= the argument */\n  greaterThanEqual(v: Version) {\n    return this.compare(v) > -1\n  }\n\n  /** true if this version is < the argument */\n  lessThan(v: Version) {\n    return this.compare(v) === -1\n  }\n\n  /** true if this version is <= the argument */\n  lessThanEqual(v: Version) {\n    return this.compare(v) < 1\n  }\n\n  /** true if these two versions have equal SemVer precedence */\n  equals(v: Version) {\n    return this.compare(v) === 0\n  }\n\n  /** just compare the M.m.p parts of the version */\n  tupleEquals(v: Version) {\n    return (\n      this.major === v.major &&\n      this.minor === v.minor &&\n      this.patch === v.patch\n    )\n  }\n\n  /** true if this version satisfies the range */\n  satisfies(r: Range) {\n    return r.test(this)\n  }\n\n  /**\n   * Increment the version in place, in the manner specified.\n   *\n   * See {@link index.inc} for full description.\n   */\n  inc(part: IncrementType, prereleaseIdentifier?: string) {\n    switch (part) {\n      case 'premajor':\n        this.prerelease = undefined\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', prereleaseIdentifier)\n        break\n\n      case 'preminor':\n        this.prerelease = undefined\n        this.patch = 0\n        this.minor++\n        this.inc('pre', prereleaseIdentifier)\n        break\n\n      case 'prepatch':\n        this.prerelease = undefined\n        this.inc('patch')\n        this.inc('pre', prereleaseIdentifier)\n        break\n\n      case 'prerelease':\n        if (!this.prerelease?.length)\n          this.inc('patch', prereleaseIdentifier)\n        this.inc('pre', prereleaseIdentifier)\n        break\n\n      case 'pre': {\n        // this is a bit different than node-semver's logic, but simpler\n        // always do zero-based incrementing, and either bump the existing\n        // numeric pr value, or add a `.0` after the identifier.\n        if (!prereleaseIdentifier) {\n          if (!this.prerelease?.length) {\n            this.prerelease = [0]\n            break\n          }\n          const last = this.prerelease[this.prerelease.length - 1]\n          if (typeof last === 'number') {\n            this.prerelease[this.prerelease.length - 1] = last + 1\n          } else {\n            this.prerelease.push(0)\n          }\n          break\n        }\n        if (!this.prerelease?.length) {\n          this.prerelease = [prereleaseIdentifier]\n          break\n        }\n        const i = this.prerelease.indexOf(\n          maybeNumber(prereleaseIdentifier),\n        )\n        if (i === -1) {\n          this.prerelease = [prereleaseIdentifier]\n          break\n        }\n        const baseValue = this.prerelease[i + 1]\n        if (typeof baseValue === 'number') {\n          this.prerelease[i + 1] = baseValue + 1\n          break\n        }\n        if (i === this.prerelease.length - 1) {\n          this.prerelease.push(0)\n          break\n        }\n        this.prerelease.splice(i + 1, 0, 0)\n        break\n      }\n\n      case 'major':\n        if (!this.prerelease?.length || this.minor || this.patch)\n          this.major++\n        this.prerelease = undefined\n        this.patch = 0\n        this.minor = 0\n        break\n\n      case 'minor':\n        if (!this.prerelease?.length || this.patch) this.minor++\n        this.prerelease = undefined\n        this.patch = 0\n        break\n\n      case 'patch':\n        if (!this.prerelease?.length) this.patch++\n        this.prerelease = undefined\n        break\n\n      default:\n        throw typeError(\n          'Invalid increment identifier',\n          {\n            version: this,\n            found: part,\n            validOptions: [\n              'major',\n              'minor',\n              'patch',\n              'premajor',\n              'preminor',\n              'prepatch',\n              'prerelease',\n              'pre',\n            ],\n          },\n          this.inc,\n        )\n    }\n\n    this.raw = this.toString()\n    return this\n  }\n}\n", "// TODO: it might be faster to not have Version objects in the\n// comparator tuples, and instead just keep the parsed number arrays?\nimport { syntaxError } from '@vltpkg/error-cause'\nimport { fastSplit } from '@vltpkg/fast-split'\nimport { Version } from './version.js'\n\n/** all comparators are expressed in terms of these operators */\nexport type SimpleOperator = '' | '<' | '<=' | '>' | '>='\n/** operators that are expanded to simpler forms */\nexport type ComplexOperator = '^' | '~' | '~>'\n\nconst isOperator = (\n  o?: string,\n): o is ComplexOperator | SimpleOperator =>\n  !!o &&\n  (o === '>' ||\n    o === '<' ||\n    o === '>=' ||\n    o === '<=' ||\n    o === '' ||\n    o === '~' ||\n    o === '^' ||\n    o === '~>')\n\n/** comparator expressed as a [operator,version] tuple */\nexport type OVTuple = [SimpleOperator, Version]\n\nconst preJunk = new Set('=v \\t')\n\nconst invalidComp = (c: string, message: string): SyntaxError =>\n  syntaxError(\n    `invalid comparator: '${c}' ${message}`,\n    { found: c },\n    Comparator,\n  )\n\nconst assertNumber = (value: string, c: string, field: string) => {\n  const n = Number(value)\n  if (n !== n) {\n    throw invalidComp(\n      c,\n      `${field} must be numeric or 'x', got: '${value}'`,\n    )\n  }\n  return n\n}\n\nconst assertVersion = (v: string, comp: string) => {\n  if (!v) {\n    throw invalidComp(comp, 'no value provided for operator')\n  }\n}\n\nconst assertMissing = (\n  value: string | undefined,\n  c: string,\n  field: string,\n) => {\n  if (value && !isX(value)) {\n    throw invalidComp(\n      c,\n      `cannot omit '${field}' and include subsequent fields`,\n    )\n  }\n}\n\nconst MAJOR = 0\nconst MINOR = 1\nconst PATCH = 2\n\nconst isX = (c?: string) => !c || c === 'X' || c === 'x' || c === '*'\n\n/**\n * The result of parsing a version value that might be either a full\n * version like `1.2.3` or an X-Range like `1.2.x`\n */\nexport type ParsedXRange =\n  | ParsedXMajor\n  | ParsedXMinor\n  | ParsedXPatch\n  | ParsedXVersion\n/**\n * a {@link ParsedXRange} that is just a `*`\n */\nexport type ParsedXMajor = []\n/**\n * a {@link ParsedXRange} that is just a major version\n */\nexport type ParsedXMinor = [number]\n/**\n * a {@link ParsedXRange} that is just a major and minor version\n */\nexport type ParsedXPatch = [number, number]\n/**\n * a {@link ParsedXRange} that is a full version\n */\nexport type ParsedXVersion = [\n  M: number,\n  m: number,\n  p: number,\n  pr?: string | undefined,\n  b?: string | undefined,\n]\n\nconst isFullVersion = (\n  parsed: ParsedXRange,\n): parsed is ParsedXVersion => undefined !== parsed[PATCH]\nconst isXPatch = (parsed: ParsedXRange): parsed is ParsedXPatch =>\n  undefined !== parsed[MINOR] && undefined === parsed[PATCH]\nconst isXMinor = (parsed: ParsedXRange): parsed is ParsedXMinor =>\n  undefined !== parsed[MAJOR] && undefined === parsed[MINOR]\nconst isXMajor = (parsed: ParsedXRange): parsed is ParsedXMajor =>\n  undefined === parsed[MAJOR]\n\n/**\n * Class used to parse the `||` separated portions\n * of a range, and evaluate versions against it.\n *\n * This does most of the heavy lifting of range testing, and provides\n * little affordance for improperly formatted strings. It should be\n * considered an internal class, and usually not accessed directly.\n */\nexport class Comparator {\n  /**\n   * does this range include prereleases, even when they do not\n   * match the tuple in the comparator?\n   */\n  includePrerelease: boolean\n  /** raw string used to create this comparator */\n  raw: string\n  /** tokens extracted from the raw string input */\n  tokens: string[]\n  /**\n   * Either the `any` comparator, the `none` comparator, or an operator\n   * and a {@link ParsedXRange}\n   */\n  tuples: (Comparator | OVTuple)[] = []\n  /** true if this comparator can not match anything */\n  isNone = false\n  /**\n   * true if this comparator is a `'*'` type of range.\n   *\n   * Note that it still will not match versions with a prerelease value,\n   * unless the tuple in the version matches the tuple provided to the\n   * comparator, and the comparator version also has a prerelease value,\n   * unless `includePrerelease` is set.\n   */\n  isAny = false\n\n  /** the canonical strict simplified parsed form of this constructor */\n  toString() {\n    return (\n      this.isNone ? '<0.0.0-0'\n      : this.isAny ? '*'\n      : /* c8 ignore next */\n        this.tuples.map(c => (isAny(c) ? '*' : c.join(''))).join(' ')\n    )\n  }\n\n  constructor(comp: string, includePrerelease = false) {\n    this.includePrerelease = includePrerelease\n    comp = comp.trim()\n    this.raw = comp\n    let hyphen = false\n    const rawComps = fastSplit(comp, ' ', -1, (part, parts, i) => {\n      if (part === '-') {\n        if (hyphen) {\n          throw invalidComp(\n            comp,\n            'multiple hyphen ranges not allowed',\n          )\n        }\n        if (parts.length !== 1 || i === -1) {\n          throw invalidComp(\n            comp,\n            'hyphen must be between two versions',\n          )\n        }\n        hyphen = true\n      } else if (hyphen && parts.length !== 2) {\n        throw invalidComp(comp, 'hyphen range must be alone')\n      }\n    })\n\n    // remove excess spaces, `> 1   2` => `>1 2`\n    const comps: string[] = []\n    let followingOperator = false\n\n    let l = 0\n    for (const c of rawComps) {\n      if (c === '') continue\n      if (!followingOperator) {\n        followingOperator = isOperator(c)\n        comps.push(c)\n        l++\n        continue\n      }\n      // we know this is not undefined since followingOperator guards that\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      comps[l - 1]! += c\n      followingOperator = false\n    }\n\n    // TS mistakenly thinks hyphen is always false here\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    if (hyphen) {\n      const [min, _, max] = comps\n      /* c8 ignore start - defense in depth for TS, already guaranteed */\n      if (!min || !max) {\n        throw invalidComp(comp, 'hyphen must be between two versions')\n      }\n      /* c8 ignore stop */\n      this.#parseHyphenRange(min, max)\n    } else if (\n      !comps.length ||\n      (comps.length === 1 && isX(comps[0]))\n    ) {\n      this.tuples.push(this.#getComparatorAny())\n    } else {\n      for (const c of comps) {\n        this.#parse(c)\n        if (this.isNone) break\n      }\n    }\n    this.tokens = comps\n    this.isAny = true\n    for (const c of this.tuples) {\n      if (Array.isArray(c) || !c.isAny) {\n        this.isAny = false\n        break\n      }\n    }\n  }\n\n  // inclusive min\n  #xInclusiveMin(raw: string): Comparator | OVTuple {\n    const z = this.includePrerelease ? '0' : undefined\n    const [M, m = 0, p = 0, pr = z, build] = this.#parseX(raw)\n    return M === undefined ?\n        this.#getComparatorAny()\n      : ['>=', new Version(raw, M, m, p, pr, build)]\n  }\n\n  // exclusive min\n  #xExclusiveMin(raw: string): Comparator | OVTuple {\n    const parsed = this.#parseX(raw)\n    if (isFullVersion(parsed)) {\n      return ['>', new Version(raw, ...parsed)]\n    }\n    const z = this.includePrerelease ? '0' : undefined\n    if (isXPatch(parsed)) {\n      // >1.2 => >=1.3.0\n      return [\n        '>=',\n        new Version(\n          raw,\n          parsed[MAJOR],\n          parsed[MINOR] + 1,\n          0,\n          z,\n          undefined,\n        ),\n      ]\n    }\n    if (isXMinor(parsed)) {\n      // >1 => >=2.0.0\n      return [\n        '>=',\n        new Version(raw, parsed[MAJOR] + 1, 0, 0, z, undefined),\n      ]\n    }\n    this.isNone = true\n    this.tuples.length = 0\n    return comparatorNone\n  }\n\n  #xInclusiveMax(raw: string): Comparator | OVTuple {\n    const parsed = this.#parseX(raw)\n    return (\n      isFullVersion(parsed) ? ['<=', new Version(raw, ...parsed)]\n      : isXPatch(parsed) ?\n        [\n          '<',\n          new Version(\n            raw,\n            parsed[MAJOR],\n            parsed[MINOR] + 1,\n            0,\n            '0',\n            undefined,\n          ),\n        ]\n      : isXMinor(parsed) ?\n        [\n          '<',\n          new Version(raw, parsed[MAJOR] + 1, 0, 0, '0', undefined),\n        ]\n      : this.#getComparatorAny()\n    )\n  }\n\n  #xExclusiveMax(raw: string): Comparator | OVTuple {\n    const z = this.includePrerelease ? '0' : undefined\n    const [M = 0, m = 0, p = 0, pr = z, build] = this.#parseX(raw)\n    if (M === 0 && m === 0 && p === 0 && pr === '0') {\n      this.isNone = true\n      this.tuples.length = 0\n      return comparatorNone\n    }\n    return ['<', new Version(raw, M, m, p, pr, build)]\n  }\n\n  #validXM(raw: string, m?: string, p?: string): ParsedXMajor {\n    assertMissing(m, raw, 'major')\n    assertMissing(p, raw, 'major')\n    if (m === '' || p === '') {\n      throw invalidComp(raw, `(Did you mean '*'?)`)\n    }\n    return []\n  }\n  #validXm(\n    raw: string,\n    M: string,\n    m?: string,\n    p?: string,\n  ): ParsedXMinor {\n    assertMissing(p, raw, 'major')\n    if (m === '' || p === '') {\n      throw invalidComp(raw, `(Did you mean '${M}'?)`)\n    }\n    return [assertNumber(M, raw, 'major')]\n  }\n  #validXp(\n    raw: string,\n    M: string,\n    m: string,\n    p?: string,\n  ): ParsedXPatch {\n    if (p === '') {\n      throw invalidComp(raw, `(Did you mean '${M}.${m}'?)`)\n    }\n    return [\n      assertNumber(M, raw, 'major'),\n      assertNumber(m, raw, 'minor'),\n    ]\n  }\n  #validTuple(\n    raw: string,\n    M: string,\n    m: string,\n    p: string,\n  ): ParsedXVersion {\n    return [\n      assertNumber(M, raw, 'major'),\n      assertNumber(m, raw, 'minor'),\n      assertNumber(p, raw, 'patch'),\n    ]\n  }\n  #validXbuild(\n    raw: string,\n    M: string,\n    m: string,\n    p: string,\n    pl: number,\n  ): ParsedXVersion {\n    // build, no prerelease\n    const patch = p.substring(0, pl)\n    const build = p.substring(pl + 1)\n    if (!patch) {\n      throw invalidComp(raw, 'cannot specify build without patch')\n    }\n    if (!build) {\n      throw invalidComp(raw, `encountered '+', but no build value`)\n    }\n    return [\n      assertNumber(M, raw, 'major'),\n      assertNumber(m, raw, 'minor'),\n      assertNumber(patch, raw, 'patch'),\n      undefined,\n      build,\n    ]\n  }\n\n  #validXpr(\n    raw: string,\n    M: string,\n    m: string,\n    p: string,\n    hy: number,\n  ): ParsedXVersion {\n    {\n      // prerelease, no build\n      const patch = p.substring(0, hy)\n      const pr = p.substring(hy + 1)\n      if (!patch) {\n        throw invalidComp(\n          raw,\n          'cannot specify prerelease without patch',\n        )\n      }\n      if (!pr) {\n        throw invalidComp(\n          raw,\n          `encountered '-', but no prerelease value`,\n        )\n      }\n      return [\n        assertNumber(M, raw, 'major'),\n        assertNumber(m, raw, 'minor'),\n        assertNumber(patch, raw, 'patch'),\n        pr,\n        undefined,\n      ]\n    }\n  }\n  #validXprbuild(\n    raw: string,\n    M: string,\n    m: string,\n    p: string,\n    hy: number,\n    pl: number,\n  ): ParsedXVersion {\n    // both prerelease and build\n    const patch = p.substring(0, hy)\n    const pr = p.substring(hy + 1, pl)\n    const build = p.substring(pl + 1)\n    if (!patch) {\n      throw invalidComp(\n        raw,\n        'cannot specify prerelease without patch',\n      )\n    }\n    if (!pr) {\n      throw invalidComp(\n        raw,\n        `encountered '-', but no prerelease value`,\n      )\n    }\n    if (!build) {\n      throw invalidComp(raw, `encountered '+', but no build value`)\n    }\n    return [\n      assertNumber(M, raw, 'major'),\n      assertNumber(m, raw, 'minor'),\n      assertNumber(patch, raw, 'patch'),\n      pr,\n      build,\n    ]\n  }\n\n  // pull the relevant values out of an X-range or version\n  // return the fields for creating a Version object.\n  // only call once operator is stripped off\n  #parseX(raw: string): ParsedXRange {\n    let [M, m, p] = fastSplit(raw, '.', 3)\n    let prune = 0\n    while (M && preJunk.has(M.charAt(prune))) prune++\n    if (M !== undefined && prune !== 0) M = M.substring(prune)\n    // the `|| !M` is so TS knows we've handled undefined\n    if (!M || isX(M)) return this.#validXM(raw, m, p)\n    if (!m || isX(m)) return this.#validXm(raw, M, m, p)\n    if (!p || isX(p)) return this.#validXp(raw, M, m, p)\n\n    const hy = p.indexOf('-')\n    const pl = p.indexOf('+')\n    if (pl === -1 && hy === -1) return this.#validTuple(raw, M, m, p)\n    if (pl === -1) return this.#validXpr(raw, M, m, p, hy)\n    if (hy === -1) return this.#validXbuild(raw, M, m, p, pl)\n    return this.#validXprbuild(raw, M, m, p, hy, pl)\n  }\n\n  #parseHyphenRange(min: string, max: string) {\n    const minv = this.#xInclusiveMin(min)\n    const maxv = this.#xInclusiveMax(max)\n    const minAny = isAny(minv)\n    const maxAny = isAny(maxv)\n    if (minAny && maxAny) this.tuples.push(this.#getComparatorAny())\n    else if (minAny) this.tuples.push(maxv)\n    else if (maxAny) this.tuples.push(minv)\n    else this.tuples.push(minv, maxv)\n  }\n\n  #parse(comp: string) {\n    const first = comp.charAt(0)\n    const first2 = comp.substring(0, 2)\n    const v1 = comp.substring(1)\n    const v2 = comp.substring(2)\n    switch (first2) {\n      case '~>':\n        assertVersion(v2, comp)\n        return this.#parseTilde(v2)\n      case '>=':\n        assertVersion(v2, comp)\n        return this.tuples.push(this.#xInclusiveMin(v2))\n      case '<=':\n        assertVersion(v2, comp)\n        return this.tuples.push(this.#xInclusiveMax(v2))\n    }\n    switch (first) {\n      case '~':\n        assertVersion(v1, comp)\n        return this.#parseTilde(v1)\n      case '^':\n        assertVersion(v1, comp)\n        return this.#parseCaret(v1)\n      case '>':\n        assertVersion(v1, comp)\n        return this.tuples.push(this.#xExclusiveMin(v1))\n      case '<':\n        assertVersion(v1, comp)\n        return this.tuples.push(this.#xExclusiveMax(v1))\n    }\n    return this.#parseEq(comp)\n  }\n\n  #parseTilde(comp: string) {\n    const parsed = this.#parseX(comp)\n    if (isXMajor(parsed)) {\n      this.tuples.push(this.#getComparatorAny())\n      return\n    }\n    const z = this.includePrerelease ? '0' : undefined\n    if (isXMinor(parsed)) {\n      const [M] = parsed\n      this.tuples.push(\n        ['>=', new Version(comp, M, 0, 0, z, undefined)],\n        ['<', new Version(comp, M + 1, 0, 0, '0', undefined)],\n      )\n      return\n    }\n    if (isXPatch(parsed)) {\n      const [M, m] = parsed\n      const z = this.includePrerelease ? '0' : undefined\n      this.tuples.push(\n        ['>=', new Version(comp, M, m, 0, z, undefined)],\n        ['<', new Version(comp, M, m + 1, 0, '0', undefined)],\n      )\n      return\n    }\n    const [M, m, p, pr = z, build] = parsed\n    this.tuples.push(\n      ['>=', new Version(comp, M, m, p, pr, build)],\n      ['<', new Version(comp, M, m + 1, 0, '0', build)],\n    )\n  }\n\n  #parseCaret(comp: string) {\n    const min = this.#xInclusiveMin(comp)\n    if (isAny(min)) {\n      this.tuples.push(min)\n      return\n    }\n    const minv = min[1]\n    if (minv.major !== 0) {\n      this.tuples.push(min, [\n        '<',\n        new Version(comp, minv.major + 1, 0, 0, '0', undefined),\n      ])\n    } else if (minv.minor !== 0) {\n      this.tuples.push(min, [\n        '<',\n        new Version(\n          comp,\n          minv.major,\n          minv.minor + 1,\n          0,\n          '0',\n          undefined,\n        ),\n      ])\n    } else if (!minv.prerelease?.length) {\n      this.tuples.push(['', minv])\n    } else {\n      this.tuples.push(min, [\n        '<',\n        new Version(\n          comp,\n          minv.major,\n          minv.minor,\n          minv.patch + 1,\n          '0',\n          undefined,\n        ),\n      ])\n    }\n  }\n\n  #parseEq(comp: string) {\n    const parsed = this.#parseX(comp)\n    const z = this.includePrerelease ? '0' : undefined\n    if (isFullVersion(parsed)) {\n      this.tuples.push(['', new Version(comp, ...parsed)])\n    } else if (isXMajor(parsed)) {\n      this.tuples.push(this.#getComparatorAny())\n    } else if (isXMinor(parsed)) {\n      this.tuples.push([\n        '>=',\n        new Version(comp, parsed[MAJOR], 0, 0, z, undefined),\n      ])\n      this.tuples.push([\n        '<',\n        new Version(comp, parsed[MAJOR] + 1, 0, 0, '0', undefined),\n      ])\n    } else if (isXPatch(parsed)) {\n      this.tuples.push(\n        [\n          '>=',\n          new Version(\n            comp,\n            parsed[MAJOR],\n            parsed[MINOR],\n            0,\n            z,\n            undefined,\n          ),\n        ],\n        [\n          '<',\n          new Version(\n            comp,\n            parsed[MAJOR],\n            parsed[MINOR] + 1,\n            0,\n            '0',\n            undefined,\n          ),\n        ],\n      )\n    }\n  }\n\n  /** return true if the version is a match for this comparator */\n  test(v: Version) {\n    if (this.isNone) return false\n    const ip = this.includePrerelease\n    const hasPR = !!v.prerelease?.length\n    let prOK = ip || !hasPR\n    for (const c of this.tuples) {\n      if (isAny(c)) {\n        continue\n      }\n      const [op, cv] = c\n      prOK ||= !!cv.prerelease?.length && v.tupleEquals(cv)\n      switch (op) {\n        case '':\n          if (!v.equals(cv)) return false\n          continue\n        case '>':\n          if (!v.greaterThan(cv)) return false\n          continue\n        case '>=':\n          if (!v.greaterThanEqual(cv)) return false\n          continue\n        case '<':\n          if (!v.lessThan(cv)) return false\n          continue\n        case '<=':\n          if (!v.lessThanEqual(cv)) return false\n          continue\n      }\n    }\n    // they all passed, so it can only fail for having a prerelease\n    // if we allow prereleases, or saw a matching tuple, that's ok.\n    return prOK\n  }\n\n  #getComparatorAny() {\n    return this.includePrerelease ? comparatorAnyPR : comparatorAny\n  }\n}\n\nconst isAny = (c: Comparator | OVTuple): c is Comparator =>\n  c === comparatorAny || c === comparatorAnyPR\nconst comparatorAny = {\n  isAny: true,\n  toString: () => '*',\n  includePrerelease: false,\n  test: (v: Version) => !v.prerelease?.length,\n} as Comparator\nconst comparatorAnyPR = {\n  isAny: true,\n  toString: () => '*',\n  includePrerelease: true,\n  test: (_: Version) => true,\n} as Comparator\nconst comparatorNone = {\n  isNone: true,\n  toString: () => '<0.0.0-0',\n  includePrerelease: false,\n  test: (_: Version) => false,\n} as unknown as Comparator\n", "import { fastSplit } from '@vltpkg/fast-split'\nimport { Comparator } from './comparator.js'\nimport { Version } from './version.js'\n\n/**\n * A representation of a semver range, used to test versions.\n *\n * Includes a set of comparators representing the `||`-separated\n * sections of the range string\n */\nexport class Range {\n  /** raw string used to create this Range */\n  raw: string\n\n  /** true if the range is `*` */\n  isAny: boolean\n\n  /** true if the range is a single semver version */\n  isSingle: boolean\n\n  /** true if the range cannot match anything */\n\n  /**\n   * set of {@link Comparator} objects representing the `||`-separated sections\n   * of the range. If at least one of these matches, then the version is a\n   * match.\n   */\n  set: Comparator[] = []\n\n  /** true if all prerelease versions should be included */\n  includePrerelease: boolean\n\n  /** cached toString */\n  #toString?: string\n\n  constructor(range: string, includePrerelease = false) {\n    this.raw = range\n    this.includePrerelease = includePrerelease\n    this.isAny = false\n    let isFirst = true\n    this.isSingle = false\n    fastSplit(range, '||', -1, part => {\n      if (this.isAny) return\n      const cmp = new Comparator(part, this.includePrerelease)\n      if (cmp.isAny) {\n        this.set = [cmp]\n        this.isAny = true\n        return\n      }\n      this.set.push(cmp)\n      if (!isFirst) this.isSingle = false\n      else if (\n        Array.isArray(cmp.tuples) &&\n        cmp.tuples.length === 1 &&\n        Array.isArray(cmp.tuples[0]) &&\n        cmp.tuples[0][0] === ''\n      ) {\n        this.isSingle = true\n      }\n      isFirst = false\n    })\n  }\n\n  /**\n   * test a {@link Version} against the range\n   */\n  test(v: Version) {\n    return this.set.some(c => c.test(v))\n  }\n\n  /** return the simplified canonical form of this range */\n  toString() {\n    if (this.#toString) return this.#toString\n    if (this.isSingle) {\n      this.#toString = String(this.set[0])\n      return this.#toString\n    }\n    this.#toString = this.set.map(c => String(c)).join(' || ')\n    return this.#toString\n  }\n}\n", "import { Range } from './range.js'\nimport { IncrementType, Version } from './version.js'\nimport { syntaxError } from '@vltpkg/error-cause'\n\nexport * from './comparator.js'\nexport * from './range.js'\nexport * from './version.js'\n\n/** Return the parsed version string, or `undefined` if invalid */\nexport const parse = (version: Version | string) => {\n  if (version instanceof Version) return version\n  try {\n    return Version.parse(String(version))\n  } catch {\n    return undefined\n  }\n}\n\n/** Return the parsed version range, or `undefined` if invalid */\nexport const parseRange = (\n  range: Range | string,\n  includePrerelease = false,\n) => {\n  if (typeof range === 'object') {\n    if (range.includePrerelease === includePrerelease) return range\n    range = range.raw\n  }\n  try {\n    return new Range(range, includePrerelease)\n  } catch {\n    return undefined\n  }\n}\n\n/**\n * return true if the version is valid\n *\n * Note: do not use this if you intend to immediately parse the version if it's\n * valid. Just use {@link parse}, and guard the possible undefined value, or\n * use `Version.parse(..)` to throw on invalid values.\n */\nexport const valid = (version: Version | string) => !!parse(version)\n\n/**\n * return true if the range is valid\n *\n * Note: do not use this if you intend to immediately parse the range if it's\n * valid. Just use {@link parseRange}, and guard the possible undefined value,\n * or use `new Range(..)` to throw on invalid values.\n */\nexport const validRange = (range: Range | string) =>\n  !!parseRange(range)\n\n/**\n * Return true if the version satisfies the range.\n */\nexport const satisfies = (\n  version: Version | string,\n  range: Range | string,\n  includePrerelease = false,\n) => {\n  if (typeof version === 'string') {\n    const parsed = parse(version)\n    if (!parsed) return false\n    version = parsed\n  }\n  if (typeof range === 'string') {\n    const parsed = parseRange(range, includePrerelease)\n    if (!parsed) return false\n    range = parsed\n  }\n  return version.satisfies(range)\n}\n\n/**\n * Increment the specified part of the version, and return the resulting\n * object. If a Version object is provided, it will be modified in-place.\n *\n * Part behaviors:\n *\n * - `'major'` If the version is a `M.0.0-...` version with a prerelease, then\n * simply drop the prerelease. Otherwise, set the minor and patch to 0, and\n * increment the major. So `1.0.0-beta` becomes `1.0.0`, and `1.2.3` becomes\n * `2.0.0`\n *\n * - `'minor'` If the version is a `M.m.0-...` version with a prerelease, then\n * simply drop the prerelease. Otherwise, set the patch to 0, and increment the\n * minor. So `1.2.0-beta` becomes `1.2.0`, and `1.2.3` becomes `1.3.0`.\n *\n * - `'patch'` If the version has a prerelease, then simply drop the\n * prerelease. Otherwise, increment the patch value. So `1.2.3-beta` becomes\n * `1.2.3` and `1.2.3` becomes `1.2.4`.\n *\n * - `'premajor'` Set the patch and minor versions to `0`, increment the major\n * version, and add a prerelease, using the optional identifier.\n *\n * - `'preminor'` Set the patch version to `0`, increment the minor version,\n * and add a prerelease, using the optional identifier.\n *\n * - `'prepatch'` If a prerelease is already present, increment the patch\n * version, otherwise leave it untouched, and add a prerelease, using the\n * optional identifier.\n *\n * - `'prerelease'` If a prerelease version is present, then behave the same as\n * `'prepatch'`. Otherwise, add a prerelease, using the optional identifier.\n *\n * - `'pre'` This is mostly for use by the other prerelease incrementers.\n *\n *     - If a prerelease identifier is provided:\n *\n *        Update that named portion of the prerelease. For example,\n *        `inc('1.2.3-beta.4', 'pre', 'beta')` would result in `1.2.3-beta.5`.\n *\n *        If there is no prerelease identifier by that name, then replace the\n *        prerelease with `[name]`. So `inc('1.2.3-alpha.4', 'pre', 'beta')`\n *        would result in `1.2.3-beta`.\n *\n *        If the prerelease identifer is present, but has no numeric value\n *        following it, then add `0`. So `inc('1.2.3-beta', 'pre', 'beta')`\n *        would result in `1.2.3-beta.0`.\n *\n *     - If no prerelease identifier is provided:\n *\n *       If there is no current prerelease, then set the prerelease to `0`. So,\n *       `inc('1.2.3', 'pre')` becomes `1.2.3-0`.\n *\n *       If the last item in the prerelease is numeric, then increment it. So,\n *       `inc('1.2.3-beta.3', 'pre')` becomes `1.2.3-beta.4`.\n */\nexport const inc = (\n  version: Version | string,\n  part: IncrementType,\n  prereleaseIdentifier?: string,\n) =>\n  (typeof version === 'string' ?\n    Version.parse(version)\n  : version\n  ).inc(part, prereleaseIdentifier)\n\n/**\n * The method used by {@link sort}, exported for passing directly to\n * `Array.sort`.\n *\n * Usage:\n *\n * ```ts\n * import { sortMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.sort(sortMethod))\n * // ['1.2.3', '2.3.4', '5.2.3']\n * ```\n */\nexport const sortMethod = (\n  a: Version | string,\n  b: Version | string,\n) => {\n  const pa = parse(a)\n  const pb = parse(b)\n  /* c8 ignore start - nondeterministic */\n  if (!pa && !pb) return String(a).localeCompare(String(b), 'en')\n  if (!pa) return 1\n  if (!pb) return -1\n  /* c8 ignore stop */\n  return pa.compare(pb)\n}\n\n/**\n * Sort an array of version strings or objects in ascending SemVer precedence\n * order (ie, lowest versions first).\n *\n * Invalid version strings are sorted to the end of the array in ascending\n * alphabetical order.\n *\n * Note: when using this method, the list is cloned prior to sorting, to\n * prevent surprising mutation. To sort the list in place, see\n * {@link sortMethod}.\n */\nexport const sort = <T extends Version | string = Version | string>(\n  list: T[],\n): T[] => list.slice().sort(sortMethod)\n\n/**\n * Sort an array of version strings or objects in descending SemVer\n * precedence order (ie, highest versions first).\n *\n * Invalid version strings are sorted to the end of the array in ascending\n * alphabetical order.\n *\n * Note: when using this method, the list is cloned prior to sorting, to\n * prevent surprising mutation. To sort the list in place, see\n * {@link rsortMethod}.\n */\nexport const rsort = <T extends Version | string = Version | string>(\n  list: T[],\n): T[] => list.slice().sort(rsortMethod)\n\n/**\n * The method used by {@link rsort}, exported for passing directly to\n * `Array.sort`.\n *\n * Usage:\n *\n * ```ts\n * import { rsortMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.sort(rsortMethod))\n * // ['5.2.3', '2.3.4', '1.2.3']\n * ```\n */\nexport const rsortMethod = (\n  a: Version | string,\n  b: Version | string,\n) => {\n  const pa = parse(a)\n  const pb = parse(b)\n  /* c8 ignore start - nondeterministic */\n  if (!pa && !pb) return String(a).localeCompare(String(b), 'en')\n  if (!pa) return 1\n  if (!pb) return -1\n  /* c8 ignore stop */\n  return pa.rcompare(pb)\n}\n\n/**\n * Method used by {@link filter}, for use in `Array.filter` directly.\n *\n * Usage:\n *\n * ```ts\n * import { filterMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.filter(filterMethod('>=2.x')))\n * // ['5.2.3', '2.3.4']\n * ```\n */\nexport const filterMethod = (\n  range: Range | string,\n  includePrerelease = false,\n): ((version: Version | string) => boolean) => {\n  const r = parseRange(range, includePrerelease)\n  return !r ?\n      () => false\n    : version => satisfies(version, r, r.includePrerelease)\n}\n\n/**\n * Filter a list of versions to find all that match a given range.\n */\nexport const filter = <T extends Version | string = Version | string>(\n  list: T[],\n  range: Range | string,\n  includePrerelease = false,\n): T[] => list.filter(filterMethod(range, includePrerelease))\n\n/**\n * Find the highest-precedence match for a range within a list of versions\n *\n * Returns `undefined` if no match was found.\n */\nexport const highest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  let max: Version | undefined = undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    if (!max) max = version\n    else if (version.greaterThan(max)) max = version\n  }\n  return max\n}\n\n/**\n * Faster form of {@link highest}, for use when the list is sorted\n * in precedence order (lower-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const sortedHighest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  for (let i = list.length - 1; i >= 0; i--) {\n    const v = list[i]\n    /* c8 ignore next */\n    if (!v) continue\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    return version\n  }\n}\n\n/**\n * Faster form of {@link highest}, for use when the list is sorted\n * in reverse precedence order (higher-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const rsortedHighest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    return version\n  }\n}\n\n/**\n * Find the lowest-precedence match for a range within a list of versions\n *\n * Returns `undefined` if no match was found.\n */\nexport const lowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  let min: Version | undefined = undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    if (!min) min = version\n    else if (version.lessThan(min)) min = version\n  }\n  return min\n}\n\n/**\n * Faster form of {@link lowest}, for use when the list is sorted\n * in precedence order (lower-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const sortedLowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined =>\n  rsortedHighest(list, range, includePrerelease)\n\n/**\n * Faster form of {@link lowest}, for use when the list is sorted\n * in reverse precedence order (higher-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const rsortedLowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined =>\n  sortedHighest(list, range, includePrerelease)\n\n/**\n * Same as {@link sortMethod}, but throws if either version is not valid.\n * 1 if versionA is higher precedence than versionB\n * -1 if versionA is lower precedence than versionB\n * 0 if they have equal precedence\n */\nexport const compare = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => {\n  const a = parse(versionA)\n  if (!a) {\n    throw syntaxError('invalid version', { found: versionA })\n  }\n  const b = parse(versionB)\n  if (!b) {\n    throw syntaxError('invalid version', { found: versionB })\n  }\n  return a.compare(b)\n}\n\n/**\n * Inverse of {@link compare}\n *\n * Same as {@link rsortMethod}, but throws if either version is not valid.\n *\n * -1 if versionA is higher precedence than versionB\n * 1 if versionA is lower precedence than versionB\n * 0 if they have equal precedence\n */\nexport const rcompare = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionB, versionA)\n\n/** true if versionA is > versionB. throws on invalid values */\nexport const gt = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) > 0\n/** true if versionA is >= versionB. throws on invalid values */\nexport const gte = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) >= 0\n/** true if versionA is < versionB. throws on invalid values */\nexport const lt = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) < 0\n/** true if versionA is <= versionB. throws on invalid values */\nexport const lte = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) <= 0\n/** true if versionA is not equal to versionB. throws on invalid values */\nexport const neq = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) !== 0\n/** true if versionA is equal to versionB. throws on invalid values */\nexport const eq = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) === 0\n\n/** extract the major version number, or undefined if invalid */\nexport const major = (version: Version | string) =>\n  parse(version)?.major\n/** extract the minor version number, or undefined if invalid */\nexport const minor = (version: Version | string) =>\n  parse(version)?.minor\n/** extract the patch version number, or undefined if invalid */\nexport const patch = (version: Version | string) =>\n  parse(version)?.patch\n/**\n * extract the list of prerelease identifiers, or undefined if the version\n * is invalid. If no prerelease identifiers are present, returns `[]`.\n */\nexport const prerelease = (version: Version | string) => {\n  const p = parse(version)\n  if (!p) return undefined\n  return p.prerelease ?? []\n}\n/**\n * extract the list of build identifiers, or undefined if the version\n * is invalid. If no build identifiers are present, returns `[]`.\n */\nexport const build = (version: Version | string) => {\n  const p = parse(version)\n  if (!p) return undefined\n  return p.build ?? []\n}\n\n/** return all versions that do not have any prerelease identifiers */\nexport const stable = <T extends Version | string = Version | string>(\n  versions: T[],\n): T[] =>\n  versions.filter(v => {\n    const p = parse(v)\n    if (!p) return false\n    return !p.prerelease?.length\n  })\n", "import {\n  error,\n  ErrorCauseObject,\n  typeError,\n} from '@vltpkg/error-cause'\nimport { parseRange, type Range } from '@vltpkg/semver'\nexport * from './types.js'\nimport type {\n  GitSelectorParsed,\n  Scope,\n  SpecLike,\n  SpecOptions,\n  SpecOptionsFilled,\n} from './types.js'\n\nexport const kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nexport const defaultRegistry = 'https://registry.npmjs.org/'\n\nexport const defaultRegistries = {\n  npm: 'https://registry.npmjs.org/',\n}\n\nexport const defaultGitHosts = {\n  github: 'git+ssh://git@github.com:$1/$2.git',\n  bitbucket: 'git+ssh://git@bitbucket.org:$1/$2.git',\n  gitlab: 'git+ssh://git@gitlab.com:$1/$2.git',\n  gist: 'git+ssh://git@gist.github.com/$1.git',\n}\n\nexport const defaultGitHostArchives = {\n  github: 'https://codeload.github.com/$1/$2/tar.gz/$committish',\n  bitbucket: 'https://bitbucket.org/$1/$2/get/$committish.tar.gz',\n  gist: 'https://codeload.github.com/gist/$1/tar.gz/$committish',\n  gitlab:\n    'https://gitlab.com/$1/$2/repository/archive.tar.gz?ref=$committish',\n}\n\n/**\n * These are just for legacy support of urls that are supported by npm\n * and observed in the wild.\n *\n * Not configurable, because no more will be added. If you wish to define\n * custom git hosts, use it with the `'git-hosts'` and `'git-host-archives'`\n * options.\n */\nexport const gitHostWebsites = {\n  github: 'https://github.com/',\n  bitbucket: 'https://bitbucket.org/',\n  gist: 'https://gist.github.com/',\n  gitlab: 'https://gitlab.com/',\n}\n\nexport const defaultScopeRegistries = {}\n\nexport const getOptions = (\n  options?: SpecOptions,\n): SpecOptionsFilled => ({\n  ...options,\n  registry: options?.registry ?? defaultRegistry,\n  'scope-registries': options?.['scope-registries'] ?? {},\n  'git-hosts':\n    options?.['git-hosts'] ?\n      {\n        ...defaultGitHosts,\n        ...options['git-hosts'],\n      }\n    : defaultGitHosts,\n  registries:\n    options?.registries ?\n      {\n        ...defaultRegistries,\n        ...options.registries,\n      }\n    : defaultRegistries,\n  'git-host-archives':\n    options?.['git-host-archives'] ?\n      {\n        ...defaultGitHostArchives,\n        ...options['git-host-archives'],\n      }\n    : defaultGitHostArchives,\n})\n\n/**\n * Various nameless scenarios that are handled in the\n * standard spec parsing and should return an unknown name.\n *\n * Returns `true` if the name can not be inferred, `false` otherwise.\n */\nconst startsWithSpecIdentifier = (\n  spec: string,\n  options: SpecOptionsFilled,\n): boolean =>\n  spec.startsWith('/') ||\n  spec.startsWith('./') ||\n  spec.startsWith('../') ||\n  spec.startsWith('file:') ||\n  spec.startsWith('http:') ||\n  spec.startsWith('https:') ||\n  spec.startsWith('workspace:') ||\n  spec.startsWith('git@') ||\n  spec.startsWith('git://') ||\n  spec.startsWith('git+ssh://') ||\n  spec.startsWith('git+http://') ||\n  spec.startsWith('git+https://') ||\n  spec.startsWith('git+file://') ||\n  spec.startsWith('git@github.com') ||\n  spec.startsWith('registry:') ||\n  // anything that starts with a known git host key, or a\n  // custom registered registry protocol e.g: `github:`, `custom:`\n  [\n    ...Object.keys(options['git-hosts']),\n    ...Object.keys(options.registries),\n  ].some(key => spec.startsWith(`${key}:`))\n\n/**\n * Returns the location in which the first `@` value is found in a given\n * string, also takes into account that a string starting with @ is\n * using a scoped-name.\n */\nconst findFirstAt = (spec: string, hasScope: boolean) =>\n  spec.indexOf('@', hasScope ? 1 : 0)\n\n/**\n * Return `true` if a given spec string is likely to be a git spec.\n */\nconst findGitIdentifier = (spec: string): boolean =>\n  spec.indexOf('#') > 2\n\n/**\n * Return `true` if a given spec string is likely to be a file spec.\n */\nconst findFileIdentifier = (spec: string): boolean =>\n  spec.includes('/')\n\n/**\n * Injects the Node.js dependencies into the Spec class.\n */\nexport type NodeJSDependenciesOptions = {\n  homedir: typeof import('os').homedir\n  isAbsolute: typeof import('node:path').isAbsolute\n  join: typeof import('node:path').join\n  resolve: typeof import('node:path').resolve\n  winPath: typeof import('node:path').win32\n}\n\n/**\n * The base, isomorphic Spec implementation.\n */\nexport class Spec implements SpecLike<Spec> {\n  /**\n   * Create a Spec object from a full spec, name+bareSpec, or Spec object\n   *\n   * Note: If a Spec object is provided, it is returned as-is, without\n   * investigating whether the options match.\n   */\n  static parse(\n    name: string,\n    bareSpec: string,\n    options?: SpecOptions,\n  ): Spec\n  static parse(spec: string, options?: SpecOptions): Spec\n  static parse(spec: Spec, options?: SpecOptions): Spec\n  static parse(\n    spec: Spec | string,\n    bareOrOptions?: SpecOptions | string,\n    options?: SpecOptions,\n  ): Spec {\n    return typeof spec === 'object' ? spec : (\n        new this(spec, bareOrOptions, options)\n      )\n  }\n\n  static parseArgs(specOrBareSpec: string, opts?: SpecOptions): Spec {\n    const options = getOptions(opts ?? {})\n\n    if (startsWithSpecIdentifier(specOrBareSpec, options)) {\n      const parsed = this.parse('(unknown)', specOrBareSpec, options)\n      // try to look into a potential parsed subspec for a name\n      if (parsed.subspec) {\n        parsed.name = parsed.subspec.name\n        parsed.spec = `${parsed.name}@${parsed.bareSpec}`\n      }\n      return parsed\n    } else {\n      const hasScope = specOrBareSpec.startsWith('@')\n      const at = findFirstAt(specOrBareSpec, hasScope)\n      if (at > -1) {\n        return this.parse(\n          specOrBareSpec.substring(0, at),\n          specOrBareSpec.substring(at + 1),\n          options,\n        )\n      } else if (\n        findGitIdentifier(specOrBareSpec) ||\n        (!hasScope && findFileIdentifier(specOrBareSpec))\n      ) {\n        return this.parse('(unknown)', specOrBareSpec, options)\n      } else {\n        // doesn't have an @, so it's just a name with no version\n        return this.parse(`${specOrBareSpec}@`, options)\n      }\n    }\n  }\n\n  static nodejsDependencies?: NodeJSDependenciesOptions\n\n  type: 'file' | 'git' | 'registry' | 'remote' | 'workspace'\n  spec: string\n  options: SpecOptionsFilled\n  name: string\n  scope?: Scope\n  scopeRegistry?: string\n  bareSpec: string\n  gitRemote?: string\n  gitSelector?: string\n  gitSelectorParsed?: GitSelectorParsed\n  gitCommittish?: string\n  namedGitHost?: string\n  namedGitHostPath?: string\n  workspaceSpec?: string\n  workspace?: string\n  namedRegistry?: string\n  registry?: string\n  registrySpec?: string\n  conventionalRegistryTarball?: string\n  semver?: string\n  range?: Range\n  distTag?: string\n  remoteURL?: string\n  file?: string\n  subspec?: Spec\n  #final?: Spec\n  #toString?: string\n\n  /**\n   * Return the final entry in the chain of subspecs\n   * When deciding which thing to actually fetch, spec.final is the thing\n   * to look at.\n   */\n  get final(): Spec {\n    if (this.#final) return this.#final\n    return (this.#final = this.subspec ? this.subspec.final : this)\n  }\n\n  /**\n   * Normally, the string value of a Spec is just the string passed in to\n   * be parsed. However, in the case of a chain of subspecs, like\n   * `foo@npm:bar@npm:baz@npm:quux@latest`, this simplifies out the middle\n   * parts of the chain, returning just `foo@npm:quux@latest`\n   */\n  toString() {\n    if (this.#toString !== undefined) return this.#toString\n    let sub: Spec = this\n    // we want the SECOND from the last in the chain\n    while (sub.subspec?.subspec) sub = sub.subspec\n    if (sub.subspec && sub.subspec.type !== 'registry')\n      sub = sub.subspec\n    return (this.#toString = this.name + '@' + sub.bareSpec)\n  }\n\n  declare ['constructor']: typeof Spec\n\n  constructor(name: string, bareSpec: string, options?: SpecOptions)\n  constructor(spec: string, options?: SpecOptions)\n  constructor(\n    spec: Spec | string,\n    bareOrOptions?: SpecOptions | string,\n    options?: SpecOptions,\n  )\n  constructor(\n    spec: string,\n    bareOrOptions?: SpecOptions | string,\n    options: SpecOptions = {},\n  ) {\n    if (bareOrOptions && typeof bareOrOptions === 'object') {\n      options = bareOrOptions\n      bareOrOptions = undefined\n    }\n    this.options = getOptions(options)\n\n    if (typeof bareOrOptions === 'string') {\n      this.name = spec\n      this.#parseScope(spec)\n      this.bareSpec = bareOrOptions\n      this.spec = `${this.name}@${bareOrOptions}`\n    } else {\n      this.spec = spec\n      const hasScope = spec.startsWith('@')\n      let at = findFirstAt(spec, hasScope)\n      if (at === -1) {\n        // assume that an unadorned spec is just a name at the default\n        // registry\n        at = spec.length\n        spec += '@'\n      }\n      this.name = spec.substring(0, at)\n      if (hasScope) this.#parseScope(this.name)\n      this.bareSpec = spec.substring(at + 1)\n    }\n\n    // legacy affordance: allow project urls like\n    // 'https://github.com/user/project#commitish' because npm suports it and\n    // this pattern is observed in the wild.\n    if (this.bareSpec.startsWith('https://')) {\n      for (const [name, origin] of Object.entries(gitHostWebsites)) {\n        if (this.bareSpec.startsWith(origin)) {\n          const parsed = new URL(this.bareSpec)\n          const [user, project] = parsed.pathname\n            .replace(/\\.git$/, '')\n            .replace(/\\/+/g, ' ')\n            .trim()\n            .split(' ')\n          if (user && project) {\n            this.bareSpec = `${name}:${user}/${project}${parsed.hash}`\n            this.spec = `${this.name}@${this.bareSpec}`\n            break\n          }\n        }\n      }\n    }\n\n    if (this.bareSpec.startsWith('workspace:')) {\n      this.type = 'workspace'\n      const ws = this.bareSpec.substring('workspace:'.length).trim()\n      const w = ws.lastIndexOf('@')\n      if (w === -1) {\n        this.workspace = this.name\n      } else {\n        const wsName = ws.substring(0, w)\n        if (\n          !wsName ||\n          wsName === '*' ||\n          wsName === '~' ||\n          wsName === '^' ||\n          (wsName.startsWith('@') ?\n            wsName.split('/').length !== 2 ||\n            wsName.substring(1).includes('@')\n          : wsName.includes('@'))\n        ) {\n          throw this.#error(\n            'workspace: name must be a path or valid package name',\n            { found: wsName },\n          )\n        }\n        this.workspace = wsName\n      }\n      // workspace: is the same as workspace:*\n      const wss = w === -1 ? ws : ws.substring(w + 1) || '*'\n      const range = wss === '*' ? undefined : parseRange(wss)\n      if (wss !== '*' && wss !== '~' && wss !== '^' && !range) {\n        throw this.#error(\n          'workspace: spec must be one of *, ~, or ^, or a valid semver range',\n          {\n            found: wss,\n            wanted: `'*'|'~'|'^'|SemverRange`,\n          },\n        )\n      }\n      this.workspaceSpec = wss\n      if (range) {\n        this.semver = wss\n        this.range = range\n      }\n      return\n    }\n\n    if (\n      this.bareSpec.startsWith('git://') ||\n      this.bareSpec.startsWith('git+ssh://') ||\n      this.bareSpec.startsWith('git+http://') ||\n      this.bareSpec.startsWith('git+https://') ||\n      this.bareSpec.startsWith('git+file://') ||\n      // legacy affordance\n      this.bareSpec.startsWith('git@github.com')\n    ) {\n      if (this.bareSpec.startsWith('git@')) {\n        this.bareSpec = `git+ssh://${this.bareSpec}`\n        this.spec = `${this.name}@${this.bareSpec}`\n      }\n      this.type = 'git'\n      // see if it's one of the known named hosts, and if so, prefer\n      // the shorter syntax.\n      for (const [name, host] of Object.entries(\n        this.options['git-hosts'],\n      )) {\n        const s = host.indexOf('$')\n        if (s > 0 && this.bareSpec.startsWith(host.substring(0, s))) {\n          const p = this.bareSpec\n            .substring(s)\n            .replace(/\\.git(#.*)?$/, '$1')\n          this.bareSpec = `${name}:${p}`\n          this.spec = `${this.name}@${this.bareSpec}`\n          this.#parseHostedGit(name, host)\n          this.type = 'git'\n          return\n        }\n      }\n      this.#parseGitSelector(this.bareSpec)\n      return\n    }\n\n    // spooky\n    const ghosts = Object.entries(this.options['git-hosts'])\n    for (const [name, template] of ghosts) {\n      if (this.#parseHostedGit(name, template)) {\n        this.type = 'git'\n        return\n      }\n    }\n\n    if (this.bareSpec.startsWith('registry:')) {\n      const reg = this.bareSpec.substring('registry:'.length)\n      const h = reg.indexOf('#')\n      if (h === -1) {\n        throw this.#error('registry: must include name/version')\n      }\n      this.type = 'registry'\n      let url = reg.substring(0, h)\n      if (!url.endsWith('/')) url += '/'\n      const regSpec = reg.substring(h + 1)\n      for (let [name, u] of Object.entries(this.options.registries)) {\n        if (!u.endsWith('/')) {\n          u += '/'\n          this.options.registries[name] = u\n        }\n        if (u === url) this.namedRegistry = name\n      }\n      this.#parseRegistrySpec(regSpec, url)\n      this.#guessRegistryTarball()\n      return\n    }\n\n    const regs = Object.entries(this.options.registries)\n    for (const [host, url] of regs) {\n      const h = `${host}:`\n      if (this.bareSpec.startsWith(h)) {\n        this.type = 'registry'\n        this.namedRegistry = host\n        this.#parseRegistrySpec(\n          this.bareSpec.substring(h.length),\n          url,\n        ).namedRegistry ??= host\n        this.#guessRegistryTarball()\n        return\n      }\n    }\n\n    if (\n      this.bareSpec.startsWith('https://') ||\n      this.bareSpec.startsWith('http://')\n    ) {\n      this.remoteURL = this.bareSpec\n      this.type = 'remote'\n      return\n    }\n\n    // explicit file: url\n    if (this.bareSpec.startsWith('file:')) {\n      this.type = 'file'\n      const [path, uri] = getNormalizeFile(\n        this.constructor.nodejsDependencies,\n      )(this.bareSpec, this)\n      this.file = path\n      this.bareSpec = uri.replace(/\\/+$/, '')\n      this.spec = `${this.name}@${this.bareSpec}`\n      return\n    }\n\n    // legacy! once upon a time, `user/project` was a shorthand for pulling\n    // packages from github, instead of the more verbose and explicit\n    // `github:user/project`.\n    if (\n      !this.bareSpec.startsWith('./') &&\n      !this.bareSpec.startsWith('../') &&\n      this.options['git-hosts'].github\n    ) {\n      const hash = this.bareSpec.indexOf('#')\n      const up =\n        hash === -1 ? this.bareSpec : this.bareSpec.substring(0, hash)\n      if (up.split('/').length === 2) {\n        this.bareSpec = `github:${this.bareSpec}`\n        this.spec = `${this.name}@${this.bareSpec}`\n        this.#parseHostedGit(\n          'github',\n          this.options['git-hosts'].github,\n        )\n        this.type = 'git'\n        return\n      }\n    }\n\n    // if it contains a / and isn't picked up in the github shorthand,\n    // then convert to file: specifier\n    if (\n      this.bareSpec.includes('/') ||\n      this.bareSpec === '.' ||\n      this.bareSpec === '..'\n    ) {\n      this.type = 'file'\n      const [file, uri] = getNormalizeFile(\n        this.constructor.nodejsDependencies,\n      )(`file:${this.bareSpec}`, this)\n      this.bareSpec = uri\n      this.spec = `${this.name}@${this.bareSpec}`\n      this.file = file\n      return\n    }\n\n    // at this point, must be either semver range or dist-tag\n    this.type = 'registry'\n    const range = parseRange(this.bareSpec)\n    if (range) {\n      this.semver = this.bareSpec.trim()\n      this.range = range\n    } else {\n      this.distTag = this.bareSpec\n    }\n    this.registrySpec = this.bareSpec\n    const { 'scope-registries': scopeRegs, registry } = this.options\n    const scopeReg = this.scope && scopeRegs[this.scope]\n    this.registry = scopeReg ?? registry\n    this.#guessRegistryTarball()\n  }\n\n  #parseScope(name: string) {\n    if (!name.startsWith('@')) return\n    const s = name.indexOf('/')\n    if (s > 1 && s < name.length - 1) {\n      const scope = name.substring(0, s) as Scope\n      this.registry = this.scopeRegistry =\n        this.options['scope-registries'][scope]\n      this.scope = scope\n    }\n  }\n\n  #parseHostedGit(name: string, template: string) {\n    if (this.bareSpec.startsWith(`${name}:`)) {\n      const h = this.bareSpec.indexOf('#')\n      const bare =\n        h === -1 ? this.bareSpec : this.bareSpec.substring(0, h)\n      const hash = h === -1 ? '' : this.bareSpec.substring(h)\n      const hostPath = bare.substring(name.length + 1)\n      if (!hostPath) {\n        throw error('invalid named git host specifier', {\n          spec: this,\n        })\n      }\n      const split = hostPath.split('/')\n      let t = template\n      for (let i = 0; i < split.length; i++) {\n        t = t.split(`$${i + 1}`).join(split[i])\n      }\n      t += hash\n      this.namedGitHost = name\n      this.namedGitHostPath = hostPath\n      this.#parseGitSelector(t)\n      if (this.gitCommittish && !this.gitSelectorParsed?.path) {\n        const archiveHost = this.options['git-host-archives'][name]\n        if (archiveHost) {\n          this.type = 'remote'\n          let t = archiveHost\n          t = t.split('$committish').join(this.gitCommittish)\n          for (let i = 0; i < split.length; i++) {\n            t = t.split(`$${i + 1}`).join(split[i])\n          }\n          this.remoteURL = t\n        }\n      }\n      return true\n    }\n    return false\n  }\n\n  /* c8 ignore start */\n  [kCustomInspect](): string {\n    return `@vltpkg/spec.Spec ${String(this)}`\n  }\n  /* c8 ignore stop */\n\n  #guessRegistryTarball() {\n    // only try to guess if it's a single comparator for a single version\n    const { name, registry, range } = this.final\n    if (!registry || !range?.isSingle) return\n    const stripScope = /^@[^/]+\\//\n    this.conventionalRegistryTarball = String(\n      new URL(\n        `/${name}/-/${name.replace(stripScope, '')}-${range}.tgz`,\n        registry,\n      ),\n    )\n  }\n\n  #parseRegistrySpec(s: string, url: string) {\n    // note: this takes priority over the scoped registry, if set\n    this.registry = url\n    this.subspec = this.constructor.parse(s, {\n      ...this.options,\n      registry: url,\n    })\n    return this.subspec\n  }\n\n  #error(message: string, extra: ErrorCauseObject = {}) {\n    return error(message, { spec: this.spec, ...extra }, this.#error)\n  }\n\n  #parseGitSelector(s: string) {\n    const h = s.indexOf('#')\n    if (h === -1) {\n      this.gitRemote = s\n      return\n    }\n    this.gitRemote = s.substring(0, h)\n    this.gitSelector = s.substring(h + 1)\n    const [selectorParsed, committish, range] =\n      this.constructor.parseGitSelector(this.gitSelector, this)\n    this.range = range\n    this.gitCommittish = committish\n    this.gitSelectorParsed = selectorParsed\n  }\n\n  /**\n   * Should only ever be called with the bit that comes AFTER the #\n   * in the git remote url.\n   */\n  static parseGitSelector(\n    selector: string,\n    spec?: Spec,\n  ): [parsed: GitSelectorParsed, committish?: string, range?: Range] {\n    if (!selector) return [{}]\n    const split = selector.split('::')\n    const first = split[0]\n    let committish: string | undefined = undefined\n    let range: Range | undefined = undefined\n    const parsed: GitSelectorParsed = {}\n\n    /* c8 ignore start - for TS's benefit */\n    if (typeof first !== 'string') {\n      throw typeError('impossible', {\n        found: first,\n        wanted: String,\n      })\n    }\n    /* c8 ignore stop */\n    if (!first.includes(':')) {\n      committish = first\n      split.shift()\n    }\n    for (const kv of split) {\n      const c = kv.indexOf(':')\n      /* c8 ignore next */\n      if (c === -1) continue\n      const k = kv.substring(0, c)\n      const v = kv.substring(c + 1)\n      if (k === 'semver') {\n        if (committish) {\n          throw error(\n            'Cannot specify a semver range and committish value',\n            { spec },\n          )\n        }\n        range = parseRange(v)\n        if (!range) {\n          throw error(`Invalid git tag semver range: ${v}`, { spec })\n        }\n      }\n      if (k === 'semver' || k === 'path') {\n        if (k === 'path') {\n          if (\n            /* c8 ignore next */ this.nodejsDependencies?.isAbsolute(\n              v,\n            ) ||\n            /(^|\\/|\\\\)\\.\\.($|\\\\|\\/)/.test(v)\n          ) {\n            throw error('Invalid path in git selector', { spec })\n          }\n          // normalize\n          /* c8 ignore start */\n          parsed.path = (\n            this.nodejsDependencies ?\n              this.nodejsDependencies.join('/', v).substring(1)\n            : v).replace(/\\\\/g, '/')\n          /* c8 ignore stop */\n        } else {\n          parsed[k] = v\n        }\n      }\n    }\n    return [parsed, committish, range]\n  }\n}\n\n// normalize our kinda-sorta spec compliant `file:` specifiers\n//\n// For historical reasons, we need to support a lot of non-spec-compliant\n// behaviors, but this massages the result into a *slightly* less offensive\n// shape.\n//\n// The result will be either a fully compliant `file://` with an absolute path,\n// or a `file:` with a relative path starting with `~`, `./`, or `../`.\nexport const getNormalizeFile =\n  (opts?: NodeJSDependenciesOptions) =>\n  (bareSpec: string, spec: Spec): [path: string, uri: string] => {\n    const slashes = bareSpec.substring(\n      'file:'.length,\n      'file://'.length,\n    )\n    const pref = `file:${slashes === '//' ? slashes : ''}`\n    const rest = bareSpec.substring(pref.length)\n\n    // default to '/' because eol == '/' for parsing purposes\n    const [a = '', b = '/', c = '/', d = '/'] = rest.split('', 4)\n\n    if (!a) {\n      // file:// => file:.\n      // file: => file:.\n      return ['.', 'file:.']\n    }\n\n    if (\n      (a === '/' && b === '~' && c !== '/') ||\n      (a === '~' && b !== '/')\n    ) {\n      throw error(\n        `invalid file: specifier. '~username' not supported`,\n        { spec },\n      )\n    }\n\n    if (a === '~') {\n      // file://~ => file:~\n      // file://~/x => file:~/x\n      return /* c8 ignore start */ opts ?\n          [\n            opts.resolve(opts.homedir(), rest.substring(2)),\n            `file:${rest}`,\n          ]\n        : [rest, `file:${rest}`]\n    }\n\n    if (a === '/' && b === '~') {\n      // file:///~ => file:~\n      // file:/~/x => file:~/x\n      /* c8 ignore start - tested in test/index.ts */\n      return opts ?\n          [\n            opts.resolve(opts.homedir(), rest.substring(3)),\n            `file:${rest.substring(1)}`,\n          ]\n        : /* c8 ignore stop */\n          [rest.substring(1), `file:${rest.substring(1)}`]\n    }\n\n    if (\n      a === '/' &&\n      b === '.' &&\n      (c === '/' || (c === '.' && d === '/'))\n    ) {\n      // file:/./x => file:./x\n      // file:///./x => file:./x\n      // file:/../x => file:../x\n      // file://../x => file:../x\n      return [rest.substring(1), `file:${rest.substring(1)}`]\n    }\n\n    if (a === '.' && (b === '/' || (b === '.' && c === '/'))) {\n      // file://. => file:.\n      // file://./x => file:./x\n      // file://../x => file:../x\n      return [rest, `file:${rest}`]\n    }\n\n    if (slashes === '//') {\n      // must be valid URI, since we ruled out relative and homedir above\n\n      // not relative, but note that file://host/share is\n      // windows-specific and does not work on darwin, so disallow it.\n      try {\n        const parsed = new URL(bareSpec)\n        if (parsed.host) {\n          if (parsed.host !== 'localhost') {\n            throw error(\n              `invalid file:// specifier. host must be empty or 'localhost'`,\n              {\n                spec,\n                found: parsed.host,\n                validOptions: ['', 'localhost'],\n              },\n            )\n          }\n        }\n        // normalize blank authority\n        // file://X:/foo => file:///X:/foo\n        // file://localhost/x => file:///x\n        // interpret a `file:///D:/x` as `D:/x` though\n        return [\n          parsed.pathname.replace(/^\\/([a-zA-Z]:\\/)/, '$1'),\n          `file://${parsed.pathname}`,\n        ]\n      } catch (er) {\n        // invalid URI for other reasons, eg file://x\\u0000y/z\n        throw error('invalid file:// specifier', {\n          spec,\n          cause: er as Error,\n        })\n      }\n    }\n\n    // no //, no authority, be ungovernable\n\n    /* c8 ignore start */\n    if (opts?.winPath.isAbsolute(rest)) {\n      // file:/absolute => file:///absolute\n      // file:/D:/foo => file:///D:/foo\n      return [rest, `file://${rest}`]\n    }\n    /* c8 ignore stop */\n\n    // file:x => file:./x\n    return [`./${rest}`, `file:./${rest}`]\n  }\n", "import { error } from '@vltpkg/error-cause'\nimport { Spec, SpecOptions } from '@vltpkg/spec'\nimport { Manifest } from '@vltpkg/types'\n\nexport const delimiter: Delimiter = '·'\nexport type Delimiter = '·'\n\n/**\n * Dependency IDs are a URI-encoded set of strings, separated\n * by the {@link Delimiter} character (`'·'`).\n *\n * The first entry is always the specifier type. The rest depend on the\n * type. `git`, `registry`, and `workspace` entries have 3 fields, the rest\n * have 2.\n *\n * - `registry`: `'registry·<registry>·name@specifier'`\n *   The `<registry>` portion can be a known named registry name, or a\n *   url to a registry. If empty, it is the default registry.\n *   Examples:\n *   - `··some-package@2.0.1`\n *   - `·npm·whatever@1.2.3'\n *   - `·http%3A%2F%2Fvlt.sh%2F·x@1.2.3`\n * - `git`: `'git·<git remote>·<git selector>`. For example:\n *   - `git·github:user/project·branchname`\n *   - `git·git%2Bssh%3A%2F%2Fuser%40host%3Aproject.git·semver:1.x`\n * - `workspace`: `'workspace·<path>`. For example:\n *   - `workspace·src/mything`\n * - `remote`: `'remote·<url>'`\n * - `file`: `'file·<path>`\n *\n * Lastly, the final portion can contain arbitrary string data, and is\n * used to store peer dep resolutions to maintain the peerDep contract.\n */\nexport type DepID =\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}${Delimiter}${string}`\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}`\n\n/**\n * A {@link DepID}, split apart and URI-decoded\n */\nexport type DepIDTuple =\n  | [\n      type: 'git',\n      gitRemote: string,\n      gitSelector: string,\n      extra?: string,\n    ]\n  | [\n      type: 'registry',\n      registry: string,\n      registrySpec: string,\n      extra?: string,\n    ]\n  | [type: 'file', path: string, extra?: string]\n  | [type: 'remote', url: string, extra?: string]\n  | [type: 'workspace', workspace: string, extra?: string]\n\nconst depIDRegExp = new RegExp(\n  `^((git)?${delimiter}[^${delimiter}]*${delimiter}[^${delimiter}]*(${\n    delimiter\n  }[^${delimiter}]*)?$` +\n    `|` +\n    `^(file|remote|workspace)${delimiter}[^${\n      delimiter\n    }]*)(${delimiter}[^${delimiter}]*)?$`,\n)\n\nexport const isDepID = (str: unknown): str is DepID =>\n  typeof str === 'string' && depIDRegExp.test(str)\n\nexport const asDepID = (str: string): DepID => {\n  if (!isDepID(str)) {\n    throw error('Expected dep id', {\n      found: str,\n    })\n  }\n  return str\n}\n\n/**\n * turn a {@link DepIDTuple} into a {@link DepID}\n */\nexport const joinDepIDTuple = (list: DepIDTuple): DepID => {\n  const [type, first, second, extra] = list\n  const f = encode(first)\n  switch (type) {\n    case 'registry':\n      return `${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    case 'git':\n      return `${type}${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    default:\n      return `${type}${delimiter}${f}${second ? `${delimiter}${encode(second)}` : ''}`\n  }\n}\n\n// allow @, but otherwise, escape everything urls do\nconst encode = (s: string): string =>\n  encodeURIComponent(s).replaceAll('%40', '@')\n\n/**\n * turn a {@link DepID} into a {@link DepIDTuple}\n */\nexport const splitDepID = (id: string): DepIDTuple => {\n  const [type, first = '', second, extra] = id.split(delimiter, 4)\n  const f = decodeURIComponent(first)\n  switch (type) {\n    case 'git':\n    case '': {\n      if (second === undefined) {\n        throw error(`invalid ${type} id`, { found: id })\n      }\n      const t: DepIDTuple = [\n        type || 'registry',\n        f,\n        decodeURIComponent(second),\n      ]\n      if (extra) t.push(decodeURIComponent(extra))\n      return t\n    }\n    case 'file':\n    case 'remote':\n    case 'workspace': {\n      const t: DepIDTuple = [type, f]\n      if (second) t.push(decodeURIComponent(second))\n      return t\n    }\n    default: {\n      throw error('invalid DepID type', {\n        found: type,\n        validOptions: ['git', 'file', 'workspace', 'remote', ''],\n      })\n    }\n  }\n}\n\n/**\n * Turn a {@link DepID} into a {@link Spec} object\n */\nexport const hydrate = (\n  id: DepID,\n  name?: string,\n  options: SpecOptions = {},\n): Spec => hydrateTuple(splitDepID(id), name, options)\n\n/**\n * Turn a {@link DepIDTuple} into a {@link Spec} object\n */\nexport const hydrateTuple = (\n  tuple: DepIDTuple,\n  name?: string,\n  options: SpecOptions = {},\n) => {\n  const [type, first, second] = tuple\n  switch (type) {\n    case 'remote': {\n      if (!first)\n        throw error('no remoteURL found on remote id', {\n          found: tuple,\n        })\n      return Spec.parse(name ?? '(unknown)', first)\n    }\n    case 'file': {\n      if (!first) {\n        throw error('no file path found on remote id', {\n          found: tuple,\n        })\n      }\n      return Spec.parse(name ?? '(unknown)', `file:${first}`, options)\n    }\n    case 'registry': {\n      if (typeof first !== 'string') {\n        throw error('no registry url or name in registry ID', {\n          found: tuple,\n        })\n      }\n      if (!second) {\n        throw error('no name/specifier in registry ID', {\n          found: tuple,\n        })\n      }\n      if (!first) {\n        // just a normal name@version on the default registry\n        const s = Spec.parse(second)\n        if (name && s.name !== name) {\n          return Spec.parse(`${name}@npm:${second}`)\n        } else {\n          return s\n        }\n      }\n      if (!/^https?:\\/\\//.test(first)) {\n        const reg = options.registries?.[first]\n        if (first !== 'npm' && !reg) {\n          throw error('named registry not found in options', {\n            name: first,\n            found: tuple,\n          })\n        }\n        return Spec.parse(\n          name ?? '(unknown)',\n          `${first}:${second}`,\n          options,\n        )\n      }\n      const s = Spec.parse(\n        name ?? '(unknown)',\n        `registry:${first}#${second}`,\n        options,\n      )\n      return name && s.final.name !== name ?\n          Spec.parse(s.final.name + '@' + s.bareSpec)\n        : s\n    }\n    case 'git': {\n      if (!first) {\n        throw error('no git remote in git ID', {\n          found: tuple,\n        })\n      }\n      return Spec.parse(\n        name ?? '(unknown)',\n        first + '#' + second,\n        options,\n      )\n    }\n    case 'workspace': {\n      if (!first) {\n        throw error('no name/path on workspace id', { found: tuple })\n      }\n      return name && name !== first ?\n          Spec.parse(name, `workspace:${first}@*`, options)\n        : Spec.parse(first, `workspace:*`, options)\n    }\n  }\n}\n\n// Strip out the default registry, there's no need to store that\nconst omitDefReg = (s?: string): string =>\n  (\n    !s ||\n    s === 'https://registry.npmjs.org' ||\n    s === 'https://registry.npmjs.org/'\n  ) ?\n    ''\n  : s\n\n/**\n * Get the {@link DepIDTuple} for a given {@link Spec} and {@link Manifest}.\n * The Manifest is used to get the name and version, if possible. If not found\n * in the manifest, registry ID types will use the name or bareSpec from the\n * specifier, so at least there's something to use later.\n */\nexport const getTuple = (spec: Spec, mani: Manifest): DepIDTuple => {\n  const f = spec.final\n  switch (f.type) {\n    case 'registry': {\n      // try to shorten to a known name if we can.\n      const reg = omitDefReg(f.registry)\n      if (!f.namedRegistry && reg) {\n        for (const [alias, host] of Object.entries(\n          spec.options.registries,\n        )) {\n          if (reg === host) {\n            f.namedRegistry = alias\n            break\n          }\n        }\n      }\n      return [\n        f.type,\n        f.namedRegistry ?? reg,\n        `${mani.name ?? spec.name}@${mani.version ?? spec.bareSpec}`,\n      ]\n    }\n    case 'git': {\n      const {\n        namedGitHost,\n        namedGitHostPath,\n        gitRemote,\n        gitSelector = '',\n      } = f\n      if (!gitRemote)\n        throw error('no host on git specifier', { spec })\n      if (namedGitHost) {\n        if (!namedGitHostPath) {\n          throw error('named git host without path portion', {\n            spec,\n          })\n        }\n        return [\n          f.type,\n          `${namedGitHost}:${namedGitHostPath}`,\n          gitSelector,\n        ]\n      } else {\n        return [f.type, gitRemote, gitSelector]\n      }\n    }\n    case 'remote': {\n      const { remoteURL } = f\n      if (!remoteURL)\n        throw error('no URL on remote specifier', { spec })\n      return [f.type, remoteURL]\n    }\n    case 'file':\n    case 'workspace':\n      throw error('Path-based dep ids are not supported', { spec })\n  }\n}\n\n/**\n * Get the {@link DepID} for a given {@link Spec} and {@link Manifest}. The\n * Manifest is used to get the name and version, if possible. If not found in\n * the manifest, registry ID types will use the name or bareSpec from the\n * specifier, so at least there's something to use later.\n */\nexport const getId = (spec: Spec, mani: Manifest): DepID =>\n  joinDepIDTuple(getTuple(spec, mani))\n", "import { error } from '@vltpkg/error-cause'\n\n/** anything that can be encoded in JSON */\nexport type JSONField =\n  | JSONField[]\n  | boolean\n  | number\n  | string\n  | { [k: string]: JSONField }\n  | null\n\n/** sha512 SRI string */\nexport type Integrity = `sha512-${string}`\n\n/** SHA256 key identifier */\nexport type KeyID = `SHA256:${string}`\n\n/** The Manifest['dist'] field present in registry manifests */\nexport type Dist = {\n  integrity?: Integrity\n  shasum?: string\n  tarball?: string\n  fileCount?: number\n  unpackedSize?: number\n  signatures?: {\n    keyid: KeyID\n    sig: string\n  }[]\n}\n\n/** An object used to mark some peerDeps as optional */\nexport type PeerDependenciesMetaValue = {\n  optional?: boolean\n}\n\n// Don't use Record here since TS cant do circular references with that\n// https://github.com/microsoft/TypeScript/issues/41164#issuecomment-1427073368\nexport type ConditionalValueObject = {\n  [k: string]: ConditionalValue\n}\n\nexport type ConditionalValue =\n  | ConditionalValue[]\n  | ConditionalValueObject\n  | string\n  | null\n\nexport type ExportsSubpaths = {\n  [path in '.' | `./${string}`]?: ConditionalValue\n}\n\nexport type Exports =\n  | Exclude<ConditionalValue, null>\n  | ExportsSubpaths\n\nexport type Imports = Record<`#${string}`, ConditionalValue>\n\nexport type FundingEntry = string | { url: string }\nexport type Funding = FundingEntry | FundingEntry[]\n\nexport type Person =\n  | string\n  | {\n      name: string\n      url?: string\n      email?: string\n    }\n\nexport type Repository =\n  | string\n  | {\n      type: string\n      url: string\n    }\n\nexport type Bugs =\n  | string\n  | {\n      url?: string\n      email?: string\n    }\n\nexport type Manifest = {\n  /** The name of the package. optional because {} is a valid package.json */\n  name?: string\n  /** The version of the package. optional because {} is a valid package.json */\n  version?: string\n  /** production dependencies, name:specifier */\n  dependencies?: Record<string, string>\n  /** development dependencies, name:specifier */\n  devDependencies?: Record<string, string>\n  /** optional dependencies, name:specifier */\n  optionalDependencies?: Record<string, string>\n  /** peer dependencies, name:specifier */\n  peerDependencies?: Record<string, string>\n  /** peer dependencies marked as optional */\n  peerDependenciesMeta?: Record<string, PeerDependenciesMetaValue>\n  /** dependency ranges that are acceptable, but not forced */\n  acceptDependencies?: Record<string, string>\n  /** names of dependencies included in the package tarball */\n  bundleDependencies?: string[]\n  /** a message indicating that this is not to be used */\n  deprecated?: string\n  /** executable built and linked by this package */\n  bin?: Record<string, string> | string\n  /** run-script actions for this package */\n  scripts?: Record<string, string>\n  /** supported run-time platforms this package can run on */\n  engines?: Record<string, string>\n  /** supported operating systems this package can run on */\n  os?: string[] | string\n  /** supported CPU architectures this package can run on */\n  cpu?: string[] | string\n  /** URLs that can be visited to fund this project */\n  funding?: Funding\n  /**\n   * Only present in Manifests served by a registry. Contains information\n   * about the artifact served for this package release.\n   */\n  dist?: Dist\n  /** a short description of the package */\n  description?: string\n  /** search keywords */\n  keywords?: string[]\n  /** where to go to file issues */\n  bugs?: Bugs\n  /** where the development happens */\n  repository?: Repository\n  /** the main module, if exports['.'] is not set */\n  main?: string\n  /** named subpath exports */\n  exports?: Exports\n  /** named #identifier imports */\n  imports?: Imports\n  /**\n   * the HEAD of the git repo this was published from\n   * only present in published packages\n   */\n  gitHead?: string\n  /** whether the package is private */\n  private?: boolean\n  /** whether this is ESM or CommonJS by default */\n  type?: 'commonjs' | 'module'\n  /** npm puts this on published manifests */\n  gypfile?: boolean\n}\n\nexport type ManifestRegistry = Manifest &\n  Required<Pick<Manifest, 'name' | 'version' | 'dist'>>\n\nexport type Packument = {\n  name: string\n  'dist-tags': Record<string, string>\n  versions: Record<string, Manifest>\n  modified?: string\n  time?: Record<string, string>\n  readme?: string\n}\n\nexport type RefType = 'branch' | 'head' | 'other' | 'pull' | 'tag'\n\n/**\n * A representation of a given remote ref in a {@link RevDoc} object.\n */\nexport type RevDocEntry = Omit<Manifest, 'type'> &\n  Required<Pick<Manifest, 'version'>> & {\n    /** sha this references */\n    sha: string\n    /** ref as passed git locally */\n    ref: string\n    /** canonical full ref, like `refs/tags/blahblah` */\n    rawRef: string\n    /** what type of ref this is: 'branch', 'tag', etc. */\n    type: RefType\n  }\n\n/**\n * An object kind of resembling a packument, but about a git repo.\n */\nexport type RevDoc = Omit<Packument, 'versions'> & {\n  /** all semver-looking tags go in this record */\n  versions: Record<string, RevDocEntry>\n  /** all named things that can be cloned down remotely */\n  refs: Record<string, RevDocEntry>\n  /** all named shas referenced above */\n  shas: Record<string, string[]>\n}\n\nconst integrityRE = /^sha512-[a-zA-Z0-9/+]{86}==$/\nexport const isIntegrity = (i: unknown): i is Integrity =>\n  typeof i === 'string' && integrityRE.test(i)\n\nexport const asIntegrity = (i: unknown): Integrity => {\n  if (!isIntegrity(i)) {\n    throw error(\n      'invalid integrity',\n      {\n        found: i,\n        wanted: integrityRE,\n      },\n      asIntegrity,\n    )\n  }\n  return i\n}\n\nexport const assertIntegrity: (\n  i: unknown,\n) => asserts i is Integrity = i => {\n  asIntegrity(i)\n}\n\nconst keyIDRE = /^SHA256:[a-zA-Z0-9/+]{43}$/\nexport const isKeyID = (k: unknown): k is KeyID =>\n  typeof k === 'string' && keyIDRE.test(k)\n\nexport const asKeyID = (k: unknown): KeyID => {\n  if (!isKeyID(k)) {\n    throw error(\n      'invalid key ID',\n      {\n        found: k,\n        wanted: keyIDRE,\n      },\n      asKeyID,\n    )\n  }\n  return k\n}\n\nexport const assertKeyID: (k: unknown) => asserts k is KeyID = k => {\n  asKeyID(k)\n}\n\nconst maybeRecordStringString = (\n  o: unknown,\n): o is Record<string, string> | undefined =>\n  o === undefined || isRecordStringString(o)\n\nconst isRecordStringString = (\n  o: unknown,\n): o is Record<string, string> =>\n  isRecordStringT<string>(o, s => typeof s === 'string')\n\nconst isRecordStringT = <T>(\n  o: unknown,\n  check: (o: unknown) => boolean,\n): o is Record<string, T> =>\n  !!o &&\n  typeof o === 'object' &&\n  Object.entries(o).every(\n    ([k, v]) => typeof k === 'string' && check(v),\n  )\n\nconst isRecordStringManifest = (\n  o: unknown,\n): o is Record<string, Manifest> =>\n  isRecordStringT<Manifest>(o, v => isManifest(v))\n\nconst maybePeerDependenciesMetaSet = (\n  o: unknown,\n): o is Record<string, PeerDependenciesMetaValue> | undefined =>\n  o === undefined ||\n  isRecordStringT<PeerDependenciesMetaValue>(o, v =>\n    isPeerDependenciesMetaValue(v),\n  )\n\nconst maybeBoolean = (o: unknown): o is boolean =>\n  o === undefined || typeof o === 'boolean'\n\nconst isPeerDependenciesMetaValue = (\n  o: any,\n): o is PeerDependenciesMetaValue =>\n  !!o && typeof o === 'object' && maybeBoolean(o.optional)\n\nconst maybeString = (a: unknown): a is string | undefined =>\n  a === undefined || typeof a === 'string'\n\nconst maybeDist = (a: any): a is Manifest['dist'] =>\n  a === undefined ||\n  (!!a && typeof a === 'object' && maybeString(a.tarball))\n\nexport const isManifest = (m: any): m is Manifest =>\n  !!m &&\n  typeof m === 'object' &&\n  !Array.isArray(m) &&\n  maybeString(m.name) &&\n  maybeString(m.version) &&\n  maybeRecordStringString(m.dependencies) &&\n  maybeRecordStringString(m.devDependencies) &&\n  maybeRecordStringString(m.optionalDependencies) &&\n  maybeRecordStringString(m.peerDependencies) &&\n  maybeRecordStringString(m.acceptDependencies) &&\n  maybePeerDependenciesMetaSet(m.peerDependenciesMeta) &&\n  maybeDist(m.dist)\n\nexport const isManifestRegistry = (\n  m: unknown,\n): m is ManifestRegistry =>\n  isManifest(m) && !!m.dist && !!m.name && !!m.version\n\nexport const asManifest = (\n  m: unknown,\n  from?: (...a: any[]) => any,\n): Manifest => {\n  if (!isManifest(m)) {\n    throw error('invalid manifest', { found: m }, from ?? asManifest)\n  }\n  return m\n}\n\nexport const asManifestRegistry = (\n  m: unknown,\n  from?: (...a: any[]) => any,\n): ManifestRegistry => {\n  if (!isManifestRegistry(m)) {\n    throw error(\n      'invalid registry manifest',\n      { found: m },\n      from ?? asManifestRegistry,\n    )\n  }\n  return m\n}\n\nexport const assertManifest: (\n  m: unknown,\n) => asserts m is Manifest = m => {\n  asManifest(m, assertManifest)\n}\nexport const assertManifestRegistry: (\n  m: unknown,\n) => asserts m is ManifestRegistry = m => {\n  asManifestRegistry(m, assertManifestRegistry)\n}\n\nexport const isPackument = (p: any): p is Packument =>\n  !!p &&\n  typeof p === 'object' &&\n  typeof p.name === 'string' &&\n  isRecordStringString(p['dist-tags']) &&\n  isRecordStringManifest(p.versions) &&\n  maybeRecordStringString(p.time) &&\n  Object.values(p['dist-tags']).every(\n    v => !!p.versions[v] && p.versions[v].name == p.name,\n  )\n\nexport const asPackument = (\n  p: unknown,\n  from?: (...a: unknown[]) => any,\n): Packument => {\n  if (!isPackument(p)) {\n    throw error(\n      'invalid packument',\n      { found: p },\n      from ?? asPackument,\n    )\n  }\n  return p\n}\n\nexport const assertPackument: (\n  m: unknown,\n) => asserts m is Packument = m => {\n  asPackument(m)\n}\n", "import { error, ErrorCauseObject } from '@vltpkg/error-cause'\nimport { asManifest, Manifest } from '@vltpkg/types'\nimport { readFileSync, writeFileSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { parse, stringify } from 'polite-json'\n\nexport class PackageJson {\n  /**\n   * cache of `package.json` loads\n   */\n  #cache = new Map<string, Manifest>()\n\n  /**\n   * cache of `package.json` paths by manifest\n   */\n  #pathCache = new Map<Manifest, string>()\n\n  /**\n   * cache of load errors\n   */\n  #errCache = new Map<string, ErrorCauseObject>()\n\n  /**\n   * Reads and parses contents of a `package.json` file at a directory `dir`.\n   * `reload` will optionally skip reading from the cache when set to `true`.\n   */\n  read(dir: string, { reload }: { reload?: boolean } = {}): Manifest {\n    const cachedPackageJson = !reload && this.#cache.get(dir)\n    if (cachedPackageJson) {\n      return cachedPackageJson\n    }\n\n    const filename = resolve(dir, 'package.json')\n\n    const fail = (err: ErrorCauseObject) =>\n      error('Could not read package.json file', err, this.read)\n\n    const cachedError = !reload && this.#errCache.get(dir)\n    if (cachedError) {\n      throw fail(cachedError)\n    }\n\n    try {\n      const res: Manifest = asManifest(\n        parse(readFileSync(filename, { encoding: 'utf8' })),\n      )\n      this.#cache.set(dir, res)\n      this.#pathCache.set(res, dir)\n      return res\n    } catch (err) {\n      const ec: ErrorCauseObject = {\n        path: filename,\n        cause: err as Error,\n      }\n      this.#errCache.set(dir, ec)\n      throw fail(ec)\n    }\n  }\n\n  write(dir: string, manifest: Manifest): void {\n    const filename = resolve(dir, 'package.json')\n\n    try {\n      // This assumes kIndent and kNewline are already present on the manifest because we would\n      // only write a package.json after reading it which will set those properties.\n      writeFileSync(filename, stringify(manifest))\n      this.#cache.set(dir, manifest)\n      this.#pathCache.set(manifest, dir)\n    } catch (err) {\n      // If there was an error writing to this package.json then also delete it from our cache\n      // just in case a future read would get stale data.\n      this.#cache.delete(dir)\n      this.#pathCache.delete(manifest)\n      throw error(\n        'Could not write package.json file',\n        {\n          path: filename,\n          cause: err as Error,\n        },\n        this.write,\n      )\n    }\n  }\n\n  save(manifest: Manifest): void {\n    const dir = this.#pathCache.get(manifest)\n    if (!dir) {\n      throw error(\n        'Could not save manifest',\n        {\n          manifest,\n        },\n        this.save,\n      )\n    }\n    this.write(dir, manifest)\n  }\n}\n", "/**\n * Copyright 2017 Kat Marchán\n * Copyright npm, Inc.\n * Copyright 2023 Isaac Z. Schlueter\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\n * ---\n *\n * 'polite-json' is a fork of 'json-parse-even-better-errors',\n * extended and distributed under the terms of the MIT license\n * above.\n *\n * 'json-parse-even-better-errors' is a fork of\n * 'json-parse-better-errors' by Kat Marchán, extended and\n * distributed under the terms of the MIT license above.\n */\n\n// version specific\n/* c8 ignore start */\nconst hexify = (s: string) =>\n  Array.from(s)\n    .map(\n      c => '0x' + c.charCodeAt(0).toString(16).toUpperCase().padStart(2, '0')\n    )\n    .join('')\n/* c8 ignore stop */\n\ntype ParseErrorMeta = {\n  message: string\n  position: number\n}\nconst parseError = (e: Error, txt: string, context: number): ParseErrorMeta => {\n  if (!txt) {\n    return {\n      message: e.message + ' while parsing empty string',\n      position: 0,\n    }\n  }\n  const badToken = e.message.match(/^Unexpected (?:token (.*?))?/i)\n  const atPos = e.message.match(/at positions? (\\d+)/)\n\n  // version specific\n  /* c8 ignore start */\n  const errIdx = /^Unexpected end of JSON|Unterminated string in JSON/i.test(\n    e.message\n  )\n    ? txt.length - 1\n    : atPos && atPos[1]\n    ? +atPos[1]\n    : /is not valid JSON$/.test(e.message)\n    ? 0\n    : null\n\n  const msg =\n    badToken && badToken[1]\n      ? e.message.replace(\n          /^Unexpected token ./,\n          `Unexpected token ${JSON.stringify(badToken[1])} (${hexify(\n            badToken[1]\n          )})`\n        )\n      : e.message\n  /* c8 ignore stop */\n\n  if (errIdx !== null && errIdx !== undefined) {\n    const start = errIdx <= context ? 0 : errIdx - context\n\n    const end = errIdx + context >= txt.length ? txt.length : errIdx + context\n\n    const slice =\n      (start === 0 ? '' : '...') +\n      txt.slice(start, end) +\n      (end === txt.length ? '' : '...')\n\n    const near = txt === slice ? '' : 'near '\n\n    return {\n      message: msg + ` while parsing ${near}${JSON.stringify(slice)}`,\n      position: errIdx,\n    }\n  } else {\n    return {\n      message: msg + ` while parsing '${txt.slice(0, context * 2)}'`,\n      position: 0,\n    }\n  }\n}\n\nexport class JSONParseError extends SyntaxError {\n  code: 'EJSONPARSE'\n  cause: Error\n  position: number\n  constructor(\n    er: Error,\n    txt: string,\n    context: number = 20,\n    caller?: Function | ((...a: any[]) => any)\n  ) {\n    const { message, position } = parseError(er, txt, context)\n    super(message)\n    this.cause = er\n    this.position = position\n    this.code = 'EJSONPARSE'\n    Error.captureStackTrace(this, caller || this.constructor)\n  }\n  get name() {\n    return this.constructor.name\n  }\n  set name(_) {}\n  get [Symbol.toStringTag]() {\n    return this.constructor.name\n  }\n}\n\nexport const kIndent = Symbol.for('indent')\nexport const kNewline = Symbol.for('newline')\n// only respect indentation if we got a line break, otherwise squash it\n// things other than objects and arrays aren't indented, so ignore those\n// Important: in both of these regexps, the $1 capture group is the newline\n// or undefined, and the $2 capture group is the indent, or undefined.\nconst formatRE = /^\\s*[{\\[]((?:\\r?\\n)+)([\\s\\t]*)/\nconst emptyRE = /^(?:\\{\\}|\\[\\])((?:\\r?\\n)+)?$/\n\nexport type Reviver = (this: any, key: string, value: any) => any\nexport type Replacer =\n  | ((this: any, key: string, value: any) => any)\n  | (string | number)[]\n  | null\nexport type Scalar = string | number | null\nexport type JSONResult =\n  | {\n      [k: string]: JSONResult\n      [kIndent]?: string\n      [kNewline]?: string\n    }\n  | (JSONResult[] & { [kIndent]?: string; [kNewline]?: string })\n  | Scalar\n\nexport const parse = (\n  txt: string | Buffer,\n  reviver?: Reviver | null,\n  context?: number\n): JSONResult => {\n  const parseText = stripBOM(String(txt))\n  if (!reviver) reviver = undefined\n  context = context || 20\n  try {\n    // get the indentation so that we can save it back nicely\n    // if the file starts with {\" then we have an indent of '', ie, none\n    // otherwise, pick the indentation of the next line after the first \\n\n    // If the pattern doesn't match, then it means no indentation.\n    // JSON.stringify ignores symbols, so this is reasonably safe.\n    // if the string is '{}' or '[]', then use the default 2-space indent.\n    const [, newline = '\\n', indent = '  '] = parseText.match(emptyRE) ||\n      parseText.match(formatRE) || [, '', '']\n\n    const result = JSON.parse(parseText, reviver)\n    if (result && typeof result === 'object') {\n      result[kNewline] = newline\n      result[kIndent] = indent\n    }\n    return result\n  } catch (e) {\n    if (typeof txt !== 'string' && !Buffer.isBuffer(txt)) {\n      const isEmptyArray =\n        Array.isArray(txt) && (txt as Array<any>).length === 0\n      throw Object.assign(\n        new TypeError(\n          `Cannot parse ${isEmptyArray ? 'an empty array' : String(txt)}`\n        ),\n        {\n          code: 'EJSONPARSE',\n          systemError: e,\n        }\n      )\n    }\n\n    throw new JSONParseError(e as Error, parseText, context, parse)\n  }\n}\n\nexport const parseNoExceptions = (txt: string | Buffer, reviver?: Reviver) => {\n  try {\n    return JSON.parse(stripBOM(String(txt)), reviver)\n  } catch (e) {}\n}\n\n// Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)\n// because the buffer-to-string conversion in `fs.readFileSync()`\n// translates it to FEFF, the UTF-16 BOM.\nconst stripBOM = (txt: string) => String(txt).replace(/^\\uFEFF/, '')\n\nexport const stringify = (\n  obj: any,\n  replacer?: Replacer,\n  indent?: string | number\n) => {\n  const space = indent === undefined ? obj[kIndent] : indent\n  // TS is so weird with parameter overloads\n  const res =\n    /* c8 ignore start */\n    typeof replacer === 'function'\n      ? JSON.stringify(obj, replacer, space)\n      : JSON.stringify(obj, replacer, space)\n  /* c8 ignore stop */\n  const nl = obj[kNewline] || '\\n'\n  return space ? (nl === '\\n' ? res : res.split('\\n').join(nl)) + nl : res\n}\n", "import { DepID, joinDepIDTuple } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { PackageJson } from '@vltpkg/package-json'\nimport { Manifest } from '@vltpkg/types'\nimport { readFileSync, statSync } from 'fs'\nimport { GlobOptionsWithFileTypesFalse, globSync } from 'glob'\nimport { DepResults, graphRun, graphRunSync } from 'graph-run'\nimport { basename, resolve, posix } from 'path'\nimport { Path, PathScurry } from 'path-scurry'\nimport { parse } from 'polite-json'\nimport { minimatch } from 'minimatch'\n\nexport type WorkspacesLoadedConfig = {\n  workspace?: string[]\n  'workspace-group'?: string[]\n}\n\n/**\n * The object passed to the constructor or {@link Monorepo#load} to limit which\n * {@link Workspace Workspaces} get loaded.\n */\nexport type LoadQuery = {\n  /**\n   * A glob pattern string, or an array of them. Only workspaces found\n   * in paths matched will be loaded.\n   */\n  paths?: string[] | string\n  /**\n   * A string, or an array of strings. If set, only workspaces in the\n   * specified groups named will be included, if set.\n   */\n  groups?: string[] | string\n}\n\n/**\n * Canonical form of the {@link WorkspaceConfig}, used\n * internally for consistency.\n */\nexport type WorkspaceConfigObject = Record<string, string[]>\n\n/**\n * Allowed datatype in the `vlt-workspaces.json` file.\n */\nexport type WorkspaceConfig =\n  | string[]\n  | WorkspaceConfigObject\n  | string\n\n/**\n * Turn a {@link WorkspaceConfig} into a\n * {@link WorkspaceConfigObject}, or throw if it's not valid.\n */\nexport const asWSConfig = (\n  conf: unknown,\n  path?: string,\n): WorkspaceConfigObject => {\n  assertWSConfig(conf, path)\n  return (\n    typeof conf === 'string' ? { packages: [conf] }\n    : Array.isArray(conf) ? { packages: conf }\n    : conf\n  )\n}\n\n/**\n * Throw if the provided value is not a valid {@link WorkspaceConfig}\n */\nexport const assertWSConfig: (\n  conf: unknown,\n  path?: string,\n) => asserts conf is WorkspaceConfig = (\n  conf: unknown,\n  path?: string,\n) => {\n  if (typeof conf === 'string') return conf\n\n  if (Array.isArray(conf)) {\n    for (const c of conf) {\n      if (typeof c !== 'string') {\n        throw error('Invalid workspace definition', {\n          path,\n          found: c,\n          wanted: 'string',\n        })\n      }\n    }\n    return\n  }\n\n  if (conf && typeof conf === 'object') {\n    for (const [group, value] of Object.entries(conf)) {\n      if (typeof value === 'string') continue\n      if (Array.isArray(value)) {\n        for (const c of value) {\n          if (typeof c !== 'string') {\n            throw error('Invalid workspace definition', {\n              path,\n              name: group,\n              found: c,\n              wanted: 'string',\n            })\n          }\n        }\n        continue\n      }\n      throw error('Invalid workspace definition', {\n        path,\n        name: group,\n        found: value,\n        wanted: 'string | string[]',\n      })\n    }\n    return\n  }\n\n  throw error('Invalid workspace definition', {\n    path,\n    found: conf,\n    wanted:\n      'string | string[] | { [group: string]: string | string[] }',\n  })\n}\n\nexport type MonorepoOptions = {\n  /**\n   * A {@link PackageJson} object, for sharing manifest caches\n   */\n  packageJson?: PackageJson\n  /**\n   * A {@link PathScurry} object, for use in globs\n   */\n  scurry?: PathScurry\n  /** Parsed normalized contents of a `vlt-workspaces.json` file */\n  config?: WorkspaceConfigObject\n  /**\n   * If set, then {@link Monorepo#load} will be called immediately with\n   * this argument.\n   */\n  load?: LoadQuery\n}\n\n/**\n * Class representing a Monorepo containing multiple workspaces.\n *\n * Does not automatically look up the root, but that can be provided by\n * running `Config.load()`, since it stops seeking the route when a\n * `vlt-workspaces.json` file is encountered.\n */\nexport class Monorepo {\n  /** The project root where vlt-workspaces.json is found */\n  projectRoot: string\n  /** Scurry object to cache all filesystem calls (mostly globs) */\n  scurry: PathScurry\n\n  // maps both name and path to the workspace objects\n  #workspaces = new Map<string, Workspace>()\n  #groups = new Map<string, Set<Workspace>>()\n  #config?: WorkspaceConfigObject\n  packageJson: PackageJson\n\n  /**\n   * Number of {@link Workspace} objects loaded in this Monorepo\n   */\n  get size(): number {\n    return [...this.values()].length\n  }\n\n  constructor(projectRoot: string, options: MonorepoOptions = {}) {\n    this.projectRoot = resolve(projectRoot)\n    this.scurry = options.scurry ?? new PathScurry(projectRoot)\n    this.packageJson = options.packageJson ?? new PackageJson()\n    this.#config = options.config\n    if (options.load) this.load(options.load)\n  }\n\n  /**\n   * Load the workspace definitions from vlt-workspaces.json,\n   * canonicalizing the result into the effective `{[group:string]:string[]}`\n   * form.\n   *\n   * Eg:\n   * - `\"src/*\"` => `{packages:[\"src/*\"]}`\n   * - `{\"apps\": \"src/*\"}` => `{apps: [\"src/*\"]}`\n   */\n  get config(): WorkspaceConfigObject {\n    if (this.#config) return this.#config\n    const file = resolve(this.projectRoot, 'vlt-workspaces.json')\n    let confData: string\n    try {\n      confData = readFileSync(file, 'utf8')\n    } catch (er) {\n      throw error('Not in a monorepo, no vlt-workspaces.json found', {\n        path: this.projectRoot,\n        cause: er as Error,\n      })\n    }\n    let parsed: unknown\n    try {\n      parsed = parse(confData)\n    } catch (er) {\n      throw error('Invalid vlt-workspaces.json file', {\n        path: this.projectRoot,\n        cause: er as Error,\n      })\n    }\n    this.#config = asWSConfig(parsed, file)\n    return this.#config\n  }\n\n  /**\n   * Iterating the Monorepo object yields the workspace objects, in as close to\n   * topological dependency order as possible.\n   */\n  *[Symbol.iterator](): Generator<Workspace, void, void> {\n    const [ws] = [...this.values()]\n    if (!ws) return\n    // leverage the fact that graphRun returns results in\n    // as close to topological order as possible.\n    for (const workspace of this.runSync(() => {}).keys()) {\n      yield workspace\n    }\n  }\n\n  /**\n   * Iterating the Monorepo object yields the workspace objects, in as close to\n   * topological dependency order as possible.\n   */\n  async *[Symbol.asyncIterator](): AsyncGenerator<\n    Workspace,\n    void,\n    void\n  > {\n    const [ws] = [...this.values()]\n    if (!ws) return\n    for (const workspace of (await this.run(() => {})).keys()) {\n      yield workspace\n    }\n  }\n\n  /**\n   * By default, loads all workspaces reachable in the Monorepo.\n   *\n   * If provided with one (`string`)or more (`string[]`) group names in\n   * the {@link LoadQuery#groups} field, then only Workspaces in the named\n   * group(s) will be considered. Note that group names are unique string\n   * matches, not globs.\n   *\n   * If provided with a set of arbitrary path arguments, then only paths\n   * patching the provided pattern(s) will be included.\n   *\n   * These two options intersect, so\n   * `load({groups:'foo', paths:'./foo/[xy]*'})` will only load the workspaces\n   * in the group `foo` that match the paths glob.\n   */\n  load(query: LoadQuery = {}): this {\n    const paths = new Set(\n      typeof query.paths === 'string' ?\n        [query.paths]\n      : (query.paths ?? []),\n    )\n    const groups = new Set(\n      typeof query.groups === 'string' ?\n        [query.groups]\n      : (query.groups ?? []),\n    )\n\n    const groupsExpanded: Record<string, Set<string>> = {}\n    for (const [group, pattern] of Object.entries(this.config)) {\n      if (groups.size && !groups.has(group)) continue\n      groupsExpanded[group] = this.#glob(pattern)\n    }\n    const filter = paths.size ? this.#glob([...paths]) : paths\n\n    // if we specified paths, but none matched, nothing to do\n    if (paths.size && !filter.size) return this\n\n    for (const [group, matches] of Object.entries(groupsExpanded)) {\n      for (const path of matches) {\n        if (filter.size && !filter.has(path)) continue\n        this.#loadWS(path, group)\n      }\n    }\n\n    return this\n  }\n\n  // Either load a workspace from disk, or from our internal set,\n  // and assign it to the named group\n  #loadWS(path: string, group?: string): Workspace {\n    const fullpath = resolve(this.projectRoot, path)\n    const loaded = this.#workspaces.get(fullpath)\n    if (loaded) return loaded\n    const fromCache = workspaceCache.get(fullpath)\n    const manifest =\n      fromCache?.manifest ?? this.packageJson.read(fullpath)\n    const ws = fromCache ?? new Workspace(path, manifest, fullpath)\n    if (group) ws.groups.push(group)\n    this.#workspaces.set(ws.fullpath, ws)\n    this.#workspaces.set(ws.path, ws)\n    this.#workspaces.set(ws.name, ws)\n    for (const name of ws.groups) {\n      const group = this.#groups.get(name) ?? new Set()\n      group.add(ws)\n      this.#groups.set(name, group)\n    }\n    return ws\n  }\n\n  // can't be cached, because it's dependent on the matches set\n  // but still worthwhile to have it defined in one place\n  #globOptions(matches: Set<string>): GlobOptionsWithFileTypesFalse {\n    // if the entry or any of its parent dirs are already matched,\n    // then we should not explore further down that directory tree.\n    // if we hit the projectRoot then stop searching.\n    const inMatches = (p?: Path): boolean => {\n      return (\n        !!p?.relativePosix() &&\n        (matches.has(p.relativePosix()) || inMatches(p.parent))\n      )\n    }\n\n    return {\n      root: this.projectRoot,\n      cwd: this.projectRoot,\n      posix: true,\n      scurry: this.scurry,\n      withFileTypes: false,\n      ignore: {\n        childrenIgnored: p =>\n          basename(p.relativePosix()) === 'node_modules' ||\n          inMatches(p),\n        // ignore if fails to load package.json\n        ignored: p => {\n          p.lstatSync()\n          const rel = p.relativePosix()\n          if (!rel) return true\n          const maybeDelete: string[] = []\n          for (const m of matches) {\n            if (rel.startsWith(m + '/')) return true\n            if (m.startsWith(rel + '/')) {\n              maybeDelete.push(m)\n            }\n          }\n          if (!p.isDirectory()) return true\n          const pj = p.resolve('package.json').lstatSync()\n          if (!pj?.isFile()) return true\n          try {\n            this.packageJson.read(p.fullpath())\n          } catch {\n            return true\n          }\n          for (const m of maybeDelete) {\n            matches.delete(m)\n          }\n          matches.add(rel)\n          return false\n        },\n      },\n    }\n  }\n\n  #glob(pattern: string[] | string) {\n    const matches = new Set<string>()\n    globSync(pattern, this.#globOptions(matches))\n    return matches\n  }\n\n  /**\n   * Return the array of workspace dependencies that are found in\n   * the loaded set, for use in calculating dependency graph order for\n   * build operations.\n   *\n   * This does *not* get the full set of dependencies, or expand any\n   * `workspace:` dependencies that are not loaded.\n   *\n   * Call with the `forceLoad` param set to `true` to attempt a full\n   * load if any deps are not currently loaded.\n   */\n  getDeps(ws: Workspace, forceLoad = false): Workspace[] {\n    // load manifest and find workspace: deps\n    // filter by those loaded\n    const { manifest } = ws\n    const depWorkspaces: Workspace[] = []\n    let didForceLoad = false\n    for (const depType of [\n      'dependencies',\n      'devDependencies',\n      'optionalDependencies',\n      'peerDependencies',\n    ] as const) {\n      const deps = manifest[depType]\n      if (!deps) continue\n      for (const [dep, spec] of Object.entries(deps)) {\n        if (spec.startsWith('workspace:')) {\n          let depWS = this.#workspaces.get(dep)\n          if (!depWS) {\n            if (!forceLoad) continue\n            if (didForceLoad) continue\n            didForceLoad = true\n            this.load()\n            depWS = this.#workspaces.get(dep)\n            if (!depWS) continue\n          }\n          depWorkspaces.push(depWS)\n        }\n      }\n    }\n    return depWorkspaces\n  }\n\n  onCycle(\n    _ws: Workspace,\n    _cycle: Workspace[],\n    _depPath: Workspace[],\n  ) {\n    // XXX - process logging? Need to say something like:\n    // Cyclical workspace dependency warning!\n    // When evaluating dependency ${ws.name} via ${\n    //   path.map(ws => ws.name).join(' -> ')\n    // }, a dependency cycle was detected: ${\n    //   cycle.map(ws => ws.name).join(' -> ')\n    // }. Operation will continue, but dependency order not guaranteed.`\n  }\n\n  /**\n   * Return the set of workspaces in the named group.\n   * If the group is not one we know about, then undefined is returned.\n   */\n  group(group: string) {\n    return this.#groups.get(group)\n  }\n\n  /**\n   * Get a loaded workspace by path or name.\n   *\n   * Note that this can only return workspaces that were ingested via a\n   * previous call to {@link Monorepo#load}.\n   */\n  get(nameOrPath: string) {\n    return this.#workspaces.get(nameOrPath)\n  }\n\n  /**\n   * get the list of all loaded workspace names used as keys\n   */\n  *names() {\n    for (const [key, ws] of this.#workspaces) {\n      if (key === ws.name) yield key\n    }\n  }\n\n  /**\n   * get the list of all loaded workspace paths used as keys\n   */\n  *paths() {\n    for (const [key, ws] of this.#workspaces) {\n      if (key === ws.path) yield key\n    }\n  }\n\n  /**\n   * get the workspace objects in no particular order.\n   * this is ever so slightly faster than iterating, because it doesn't\n   * explore the graph to yield results in topological dependency order,\n   * and should be used instead when order doesn't matter.\n   */\n  *values() {\n    const seen = new Set<string>()\n    for (const ws of this.#workspaces.values()) {\n      if (seen.has(ws.fullpath)) continue\n      seen.add(ws.fullpath)\n      yield ws\n    }\n  }\n\n  /**\n   * Get all the keys (package names and paths) for loaded workspaces.\n   * Union of {@link Monorepo#names} and {@link Monorepo#paths}\n   */\n  *keys() {\n    for (const ws of this.values()) {\n      yield ws.path\n      if (ws.name !== ws.path) yield ws.name\n    }\n  }\n\n  /**\n   * Filter the monorepo object yielding the workspace objects that matches\n   * either of the {@link WorkspacesLoadedConfig} options provided, in as close\n   * to topological dependency order as possible.\n   */\n  *filter({\n    workspace: namesOrPaths,\n    'workspace-group': groupName,\n  }: WorkspacesLoadedConfig) {\n    const globPatternChecks = namesOrPaths?.map(glob =>\n      minimatch.filter(posix.join(glob)),\n    )\n    for (const ws of this) {\n      // check if any group has any of the provided group names\n      if (groupName?.some(i => ws.groups.includes(i))) {\n        yield ws\n        continue\n      }\n      // check if any workspace-provided name directly matches any of the\n      // configured workspaces by either name or file path\n      if (\n        namesOrPaths\n          ?.map(i => posix.join(i))\n          .some(i => ws.keys.includes(i))\n      ) {\n        yield ws\n        continue\n      }\n      // check if one of the workspace values are matching glob patterns\n      if (\n        ws.keys.some(key => globPatternChecks?.some(fn => fn(key)))\n      ) {\n        yield ws\n      }\n    }\n  }\n\n  /**\n   * Run an operation asynchronously over all loaded workspaces\n   *\n   * If the `forceLoad` param is true, then it will attempt to do a full load\n   * when encountering a `workspace:` dependency that isn't loaded.\n   *\n   * Note that because the return type appears in the parameters of the\n   * operation function, it must be set explicitly either in the operation\n   * function signature or by calling `run<MyType>` or it'll fall back to\n   * `unknown`, similar to `Array.reduce()`, and for the same reason.\n   */\n  async run<R>(\n    operation: (\n      s: Workspace,\n      signal: AbortSignal,\n      depResults: DepResults<Workspace, R>,\n    ) => Promise<R> | R,\n    forceLoad = false,\n  ) {\n    const [ws, ...rest] = [...this.#workspaces.values()]\n    if (!ws) {\n      throw error('No workspaces loaded', undefined, this.run)\n    }\n\n    return graphRun<Workspace, R>({\n      graph: [ws, ...rest],\n      getDeps: ws => this.getDeps(ws, forceLoad),\n      visit: async (ws, signal, _, depResults) =>\n        await operation(ws, signal, depResults),\n      onCycle: (ws, cycle, path) => this.onCycle(ws, cycle, path),\n    })\n  }\n\n  /**\n   * Run an operation synchronously over all loaded workspaces\n   *\n   * If the `forceLoad` param is true, then it will attempt to do a full load\n   * when encountering a `workspace:` dependency that isn't loaded.\n   *\n   * Note that because the return type appears in the parameters of the\n   * operation function, it must be set explicitly either in the operation\n   * function signature or by calling `runSync<MyType>` or it'll fall back to\n   * `unknown`, similar to `Array.reduce()`, and for the same reason.\n   */\n  runSync<R>(\n    operation: (\n      s: Workspace,\n      signal: AbortSignal,\n      depResults: DepResults<Workspace, R>,\n    ) => R,\n    forceLoad = false,\n  ) {\n    const [ws, ...rest] = [...this.#workspaces.values()]\n    if (!ws) {\n      throw error('No workspaces loaded', undefined, this.run)\n    }\n\n    return graphRunSync<Workspace, R>({\n      graph: [ws, ...rest],\n      getDeps: ws => this.getDeps(ws, forceLoad),\n      visit: (ws, signal, _, depResults) =>\n        operation(ws, signal, depResults),\n      onCycle: (ws, cycle, path) => this.onCycle(ws, cycle, path),\n    })\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Returns undefined if the project is not a monorepo workspaces\n   * root, otherwise returns the loaded Monorepo.\n   */\n  static maybeLoad(\n    projectRoot: string,\n    options: MonorepoOptions = { load: {} },\n  ) {\n    try {\n      if (\n        !statSync(\n          resolve(projectRoot, 'vlt-workspaces.json'),\n        ).isFile()\n      ) {\n        return\n      }\n    } catch {\n      return\n    }\n    const { load = {} } = options\n    return new Monorepo(projectRoot, { ...options, load })\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Throws if called on a directory that is not a workspaces root.\n   */\n  static load(\n    projectRoot: string,\n    options: MonorepoOptions = { load: {} },\n  ) {\n    const { load = {} } = options\n    return new Monorepo(projectRoot, { ...options, load })\n  }\n}\n\nexport const workspaceCache = new Map<string, Workspace>()\n\n/**\n * Class representing a single Workspace in a {@link Monorepo}\n */\nexport class Workspace {\n  id: DepID\n  path: string\n  fullpath: string\n  manifest: Manifest\n  groups: string[] = []\n  name: string\n  #keys?: string[]\n\n  constructor(path: string, manifest: Manifest, fullpath: string) {\n    this.id = joinDepIDTuple(['workspace', path])\n    workspaceCache.set(fullpath, this)\n    this.path = path\n    this.fullpath = fullpath\n    this.manifest = manifest\n    this.name = manifest.name ?? path\n  }\n\n  get keys(): string[] {\n    if (this.#keys) {\n      return this.#keys\n    }\n    this.#keys = [this.name, this.path, this.fullpath]\n    return this.#keys\n  }\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\ntype 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  nobrace?: boolean\n  nocomment?: boolean\n  nonegate?: boolean\n  debug?: boolean\n  noglobstar?: boolean\n  noext?: boolean\n  nonull?: boolean\n  windowsPathsNoEscape?: boolean\n  allowWindowsEscape?: boolean\n  partial?: boolean\n  dot?: boolean\n  nocase?: boolean\n  nocaseMagicOnly?: boolean\n  magicalBraces?: boolean\n  matchBase?: boolean\n  flipNegate?: boolean\n  preserveMultipleSlashes?: boolean\n  optimizationLevel?: number\n  platform?: Platform\n  windowsNoMagicRoot?: boolean\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) => !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) => f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) => 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'\n) as Platform\ntype Sep = '\\\\' | '/'\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep = 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<MinimatchOptions, 'windowsPathsNoEscape'> = {}\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<MinimatchOptions, 'windowsPathsNoEscape'> = {}\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) => 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: (list: string[], pattern: string, 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)\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    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options.allowWindowsEscape === 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 [...s.slice(0, 4), ...s.slice(4).map(ss => this.parse(ss))]\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 all ** 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(file: string[], pattern: ParseReturn[], partial: boolean = false) {\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 = 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 = fileUNC ? 3 : fileDrive ? 0 : undefined\n      const pdi = patternUNC ? 3 : patternDrive ? 0 : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [file[fdi], pattern[pdi] as string]\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    // dont' 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\n          ? starDotExtTestDot\n          : starDotExtTest\n      )(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase\n          ? options.dot\n            ? qmarksTestNocaseDot\n            : qmarksTestNocase\n          : options.dot\n          ? qmarksTestDot\n          : qmarksTest\n      )(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 = options.noglobstar\n      ? star\n      : options.dot\n      ? 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 typeof p === 'string'\n            ? regExpEscape(p)\n            : p === GLOBSTAR\n            ? GLOBSTAR\n            : p._src\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        return pp.filter(p => p !== GLOBSTAR).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    // 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", "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  '[: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\n      ? '(' + sranges + '|' + snegs + ')'\n      : ranges.length\n      ? sranges\n      : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link windowsPathsNoEscape} option is used, then square-brace\n * escapes are removed, but not backslash escapes.  For example, it will turn\n * the string `'[*]'` into `*`, but it will not turn `'\\\\*'` into `'*'`,\n * becuase `\\` is a path separator in `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both brace escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n */\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape'> = {}\n) => {\n  return windowsPathsNoEscape\n    ? s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n    : s.replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2').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 (typeof p !== 'string' && !(p instanceof AST && p.#parent === this)) {\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.slice().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 = this.isStart() && this.isEnd()\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 = needNoTrav ? startNoTraversal : needNoDot ? startNoDot : ''\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          ? ')'\n          : this.type === '?'\n          ? ')?'\n          : this.type === '+' && bodyDotAllowed\n          ? ')'\n          : this.type === '*' && bodyDotAllowed\n          ? `)?`\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    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 (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        if (noEmpty && glob === '*') re += starNoEmpty\n        else re += star\n        hasMagic = true\n        continue\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 * Escape all magic characters in a glob pattern.\n *\n * If the {@link windowsPathsNoEscape | GlobOptions.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 */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape'> = {}\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  return windowsPathsNoEscape\n    ? s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\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 `ignore` and `ignoreChildren`\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\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      // default nocase based on platform\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\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\ntype Perf = { now: () => number }\nconst perf: Perf =\n  typeof performance === 'object' &&\n  performance &&\n  typeof performance.now === 'function'\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 ? 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)\n    ? null\n    : max <= Math.pow(2, 8)\n    ? Uint8Array\n    : max <= Math.pow(2, 16)\n    ? Uint16Array\n    : max <= Math.pow(2, 32)\n    ? Uint32Array\n    : max <= Number.MAX_SAFE_INTEGER\n    ? 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(\n    max: number,\n    HeapCls: { new (n: number): NumberArray }\n  ) {\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   * 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 MemoerOptions.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     * 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  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  implements Map<K, V>\n{\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 #disposeAfter?: LRUCache.Disposer<K, V>\n  readonly #fetchMethod?: LRUCache.Fetcher<K, V, FC>\n  readonly #memoMethod?: LRUCache.Memoizer<K, V, FC>\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\n  #hasDispose: boolean\n  #hasFetchMethod: boolean\n  #hasDisposeAfter: 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      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 =>\n        c.#moveToTail(index as Index),\n      indexes: (options?: { allowStale: boolean }) =>\n        c.#indexes(options),\n      rindexes: (options?: { allowStale: boolean }) =>\n        c.#rindexes(options),\n      isStale: (index: number | undefined) =>\n        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.disposeAfter} (read-only)\n   */\n  get disposeAfter() {\n    return this.#disposeAfter\n  }\n\n  constructor(\n    options: LRUCache.Options<K, V, FC> | LRUCache<K, V, FC>\n  ) {\n    const {\n      max = 0,\n      ttl,\n      ttlResolution = 1,\n      ttlAutopurge,\n      updateAgeOnGet,\n      updateAgeOnHas,\n      allowStale,\n      dispose,\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    } = options\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 (\n      memoMethod !== undefined &&\n      typeof memoMethod !== 'function'\n    ) {\n      throw new TypeError('memoMethod must be a function if defined')\n    }\n    this.#memoMethod = memoMethod\n\n    if (\n      fetchMethod !== undefined &&\n      typeof fetchMethod !== 'function'\n    ) {\n      throw new TypeError(\n        'fetchMethod must be a function if specified'\n      )\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 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.#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\n        ? ttlResolution\n        : 1\n    this.ttlAutopurge = !!ttlAutopurge\n    this.ttl = ttl || 0\n    if (this.ttl) {\n      if (!isPosInt(this.ttl)) {\n        throw new TypeError(\n          'ttl must be a positive integer if specified'\n        )\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\n    this.#setItemTTL = (index, ttl, start = perf.now()) => {\n      starts[index] = ttl !== 0 ? start : 0\n      ttls[index] = ttl\n      if (ttl !== 0 && this.ttlAutopurge) {\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      }\n    }\n\n    this.#updateItemAge = index => {\n      starts[index] = ttls[index] !== 0 ? 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 = perf.now()\n      if (this.ttlResolution > 0) {\n        cachedNow = n\n        const t = setTimeout(\n          () => (cachedNow = 0),\n          this.ttlResolution\n        )\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    () => {}\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 (\n        k !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\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 (\n        k !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\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 (\n        v !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\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 (\n        v !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\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)\n        ? v.__staleWhileFetching\n        : 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)\n        ? v.__staleWhileFetching\n        : 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)\n        ? v.__staleWhileFetching\n        : 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    const value: V | undefined = this.#isBackgroundFetch(v)\n      ? v.__staleWhileFetching\n      : v\n    if (value === undefined) return undefined\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 - (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 LRLUCache#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 = this.#isBackgroundFetch(v)\n        ? v.__staleWhileFetching\n        : 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 = 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 = 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\n          ? this.#tail\n          : this.#free.length !== 0\n          ? this.#free.pop()\n          : this.#size === this.#max\n          ? this.#evict(false)\n          : this.#size\n      ) 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    } 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 (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 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 } =\n      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 (\n      index === undefined ||\n      (!allowStale && this.#isStale(index))\n    ) {\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 = (\n      v: V | undefined,\n      updateCache = false\n    ): V | undefined => {\n      const { aborted } = ac.signal\n      const ignoreAbort = options.ignoreFetchAbort && 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)\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 (this.#valList[index as Index] === p) {\n        if (v === undefined) {\n          if (bf.__staleWhileFetching) {\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      return fetchFail(er)\n    }\n\n    const fetchFail = (er: any): V | undefined => {\n      const { aborted } = ac.signal\n      const allowStaleAborted =\n        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 || 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 (\n          !options.ignoreFetchAbort ||\n          options.allowStaleOnFetchAbort\n        ) {\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\n      ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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\n      ? K\n      : FC extends undefined | void\n      ? K\n      : never,\n    fetchOptions?: unknown extends FC\n      ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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 =\n          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 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\n      ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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\n      ? K\n      : FC extends undefined | void\n      ? K\n      : never,\n    fetchOptions?: unknown extends FC\n      ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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\n        ? LRUCache.FetchOptions<K, V, FC>\n        : FC extends undefined | void\n        ? 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\n      ? LRUCache.MemoOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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\n      ? K\n      : FC extends undefined | void\n      ? K\n      : never,\n    memoOptions?: unknown extends FC\n      ? LRUCache.MemoOptions<K, V, FC>\n      : FC extends undefined | void\n      ? 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        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    }\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 Map<string, string>()\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 Map<string, string>()\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  /**\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\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 => 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    }\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    }\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\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  /**\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 { setMaxListeners } from 'node:events'\n\n/**\n * Options that define the graph and how to traverse it\n */\nexport interface RunnerOptions<Node, Result = void> {\n  /** Array of one or more entry nodes. */\n  graph: [node: Node, ...rest: Node[]]\n\n  /** get the dependencies of a given node */\n  getDeps: (node: Node) => Node[] | Promise<Node[]>\n\n  /** action to take on each node */\n  visit: (\n    node: Node,\n    signal: AbortSignal,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) => Result | Promise<Result>\n\n  /**\n   * Called when a cycle is encountered.\n   * Throw in this method to enforce a DAG graph.\n   * If left undefined, then cycles are silently ignored and skipped.\n   *\n   * `node` parameter is the dependency that is being skipped.\n   *\n   * `cycle` is the route from the dependent back to itself via\n   * the parent.\n   *\n   * `path` is the path to the dependent who wanted this dep to be\n   * loaded.\n   */\n  onCycle?: (\n    node: Node,\n    cycle: Node[],\n    path: Node[],\n  ) => void | Promise<void>\n\n  /**\n   * Set to `false` to continue operations even if errors occur.\n   * If set to false, then an AggregateError will be raised on failure\n   * containing all failures (even if only one). If true, then a normal\n   * Error will be raised on failure.\n   *\n   * @default true\n   */\n  failFast?: boolean\n\n  /** a signal that will trigger the graph traversal to end prematurely */\n  signal?: AbortSignal\n}\n\nexport type DepResults<Node, Result> = Map<Node, Result | undefined>\n\n/**\n * Options that can define a synchronous graph traversal.\n *\n * Note that if the visit() method is async, then the *promises themselves*\n * will be used as the `Result` type, which is likely not what you want!\n */\nexport interface RunnerOptionsSync<Node, Result = void>\n  extends RunnerOptions<Node, Result> {\n  /** Get a set of dependency nodes synchronously */\n  getDeps: (node: Node) => Node[]\n\n  /** Visit a node synchronously */\n  visit: (\n    node: Node,\n    signal: AbortSignal,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) => Result\n\n  /** Handle cycles synchronously */\n  onCycle?: (node: Node, cycle: Node[], path: Node[]) => void\n}\n\n/**  A map of nodes to their PromiseSettledResult value */\nexport type SettledMap<Node, Result = void> = Map<\n  Node,\n  PromiseSettledResult<Result>\n>\n\n/** Any function or class. Used for Error.captureStackTrace */\nexport type Callable =\n  | Function\n  | ((...a: unknown[]) => unknown)\n  | {\n      new (...a: unknown[]): unknown\n    }\n\n/** Base class of Runner and RunnerSync */\nexport abstract class RunnerBase<\n  /** The type of thing to be found in this graph */\n  Node,\n  /** Type returned by the visit() method */\n  Result = void,\n  Sync extends boolean = false,\n  O extends Sync extends true ? RunnerOptionsSync<Node, Result>\n  : RunnerOptions<Node, Result> = Sync extends true ?\n    RunnerOptionsSync<Node, Result>\n  : RunnerOptions<Node, Result>,\n> {\n  /** The map of traversal results */\n  readonly results: Map<Node, Result> = new Map()\n\n  /** The map of PromiseSettledResult objects */\n  readonly settled: SettledMap<Node, Result> = new Map()\n\n  /** Set of dependents (direct & transitive) on each node */\n  readonly dependents: Map<Node, Set<Node>> = new Map()\n\n  /** Set of direct dependents on each node */\n  readonly directDependents: Map<Node, Set<Node>> = new Map()\n\n  /** Options provided to constructor */\n  readonly options: O\n\n  /**\n   * AbortController used internally to abort the process.\n   *\n   * This is internal only, and triggering it at the wrong time may cause\n   * undefined and unsupported behavior. Do not use!\n   *\n   * Instead, if you want to be able to abort the walk at any time, provide\n   * your own AbortSignal in the opions.\n   *\n   * @internal\n   */\n  readonly abortController: AbortController\n\n  /** True if we are in failFast mode */\n  readonly failFast: boolean\n\n  /** Rejections and Errors encountered in the traversal */\n  readonly errors: unknown[] = []\n\n  /**\n   * Function defining the callsite where the traversal was initiated,\n   * used for Error.captureStackTrace.\n   */\n  readonly from: Callable\n\n  constructor(options: O, from?: Callable) {\n    const ac = new AbortController()\n    this.from = from ?? this.constructor\n    this.abortController = ac\n    setMaxListeners(Infinity, ac.signal)\n    this.options = options\n    if (!options.graph.length) {\n      const er = new Error('no nodes provided to graph traversal', {\n        cause: {\n          found: options.graph,\n          wanted: '[first: Node, ...rest: Node[]]',\n        },\n      })\n      Error.captureStackTrace(er, from)\n      throw er\n    }\n    this.failFast = options.failFast !== false\n    const { signal } = options\n    if (signal !== undefined) {\n      signal.addEventListener('abort', reason => ac.abort(reason), {\n        once: true,\n        signal: ac.signal,\n      })\n    }\n  }\n\n  /** Initiate the graph traversal, resolving/returning when complete */\n  abstract run(): Sync extends true ? void : Promise<void>\n\n  /** Get the dependencies of a given node */\n  abstract getDeps(\n    n: Node,\n  ): Sync extends true ? Node[] : Promise<Node[]>\n\n  /** Visit a node. Calls `options.visit()` */\n  abstract visit(\n    n: Node,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ): Sync extends true ? Result : Promise<Result>\n\n  /**\n   * Calls the `options.onCycle()` method when a cycle is detected.\n   */\n  abstract onCycle(\n    n: Node,\n    cycle: Node[],\n    path: Node[],\n  ): Sync extends true ? void : void | Promise<void>\n\n  /**\n   * For a Node `n` that depends directly or transitively on Node `d`, find the\n   * shortest known dependency path from `n` to `d`. This is done by walking\n   * backwards breadth-first up the dependency relations from `d` until `n` is\n   * found.\n   *\n   * If no known path can be found, then `undefined` is returned. Otherwise,\n   * a path array is returned that starts with `n` and ends with `d`.\n   *\n   * Note that self-referential links are never considered, since they're\n   * by definition cyclical.\n   */\n  route(n: Node, d: Node): undefined | [n: Node, ...path: Node[]] {\n    const dependents = this.dependents.get(d)\n    if (!dependents?.has(n)) return undefined\n    const directDependents = this.directDependents.get(d)\n    /* c8 ignore next */\n    if (!directDependents) return undefined\n    if (directDependents.has(n)) {\n      return [n, d]\n    }\n    const queue: [n: Node, ...r: Node[]][] = [\n      ...directDependents,\n    ].map(dd => [dd, d])\n    let step: undefined | [n: Node, ...r: Node[]] = undefined\n    while (undefined !== (step = queue.shift())) {\n      /* c8 ignore next */\n      if (!dependents.has(step[0])) continue\n      if (step[0] === n) {\n        return step\n      }\n      const ddd = this.directDependents.get(step[0])\n      if (ddd) {\n        for (const d of ddd) {\n          queue.push([d, ...step])\n        }\n      }\n    }\n  }\n\n  /**\n   * If the dependency from `n -> d` at the specified path would\n   * cause a cycle, then call the onCycle method and return true.\n   * Oherwise, assign the appropriate entries in the dependency\n   * tracking sets, and return false.\n   *\n   * @internal\n   */\n  cycleCheck(n: Node, path: Node[], d: Node) {\n    /* c8 ignore next */\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n    const isCycle = dependents.has(d)\n    if (isCycle) {\n      const cycle = this.route(d, n)\n      /* c8 ignore start - impossible */\n      if (!cycle) {\n        throw new Error('cycle detected, but cycle route not found')\n      }\n      /* c8 ignore stop */\n      cycle.unshift(n)\n      this.onCycle(d, cycle, path)\n      return true\n    }\n\n    const depDD = this.directDependents.get(d) ?? new Set()\n    this.directDependents.set(d, depDD)\n    depDD.add(n)\n\n    const depDependents = this.dependents.get(d) ?? new Set()\n    this.dependents.set(d, depDependents)\n    for (const n of dependents) {\n      depDependents.add(n)\n    }\n    depDependents.add(n)\n    return false\n  }\n\n  /**\n   * Method that handles errors raised by visits.\n   *\n   * @internal\n   */\n  handleError(er: unknown, n: Node, path: Node[]) {\n    this.errors.push(er)\n    this.settled.set(n, {\n      status: 'rejected',\n      reason: er,\n    })\n    if (this.failFast) {\n      this.abortController.abort(er)\n      const e = new Error('failed graph traversal', {\n        cause: {\n          node: n,\n          path,\n          cause: er as Error,\n        },\n      })\n      Error.captureStackTrace(e, this.from)\n      throw e\n    }\n  }\n\n  /**\n   * Method that handles successful visit results\n   *\n   * @internal\n   */\n  handleValue(value: Result, n: Node) {\n    this.results.set(n, value)\n    this.settled.set(n, {\n      status: 'fulfilled',\n      value,\n    })\n  }\n}\n\n/** Asynchronous graph runner */\nexport class Runner<Node, Result> extends RunnerBase<\n  Node,\n  Result,\n  false,\n  RunnerOptions<Node, Result>\n> {\n  /** Map of nodes currently awaiting completion */\n  readonly running = new Map<Node, Promise<void>>()\n\n  async getDeps(n: Node) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return []\n    const deps = await this.options.getDeps(n);\n    for (const d of deps) {\n      const dependents = this.dependents.get(d) ?? new Set()\n      this.dependents.set(d, dependents)\n      dependents.add(n)\n      const depDD = this.directDependents.get(d) ?? new Set()\n      this.directDependents.set(d, depDD)\n      depDD.add(n)\n    }\n    return deps\n  }\n\n  async visit(\n    n: Node,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) {\n    const { signal } = this.abortController\n    return this.options.visit(n, signal, path, depResults)\n  }\n\n  async onCycle(n: Node, cycle: Node[], path: Node[]) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    await this.options.onCycle?.(n, cycle, path)\n  }\n\n  async #walk(n: Node, path: Node[]) {\n    const r = this.running.get(n)\n    /* c8 ignore next */\n    if (r) return r\n    /* c8 ignore start */\n    if (this.settled.get(n)) return\n    /* c8 ignore stop */\n    const p = this.#step(n, path).then(\n      () => {\n        this.running.delete(n)\n      },\n      /* c8 ignore start - handled deeper in the chain */\n      er => {\n        this.running.delete(n)\n        throw er\n      },\n      /* c8 ignore stop */\n    )\n    this.running.set(n, p)\n    return p\n  }\n\n  async #step(n: Node, path: Node[]) {\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n\n    const deps = await this.getDeps(n)\n    const awaiting: Promise<void>[] = []\n    const depPath = [...path, n]\n\n    for (const d of deps) {\n      /* c8 ignore next */\n      if (this.abortController.signal.aborted) return\n      // self-link, skip\n      if (d === n) continue\n      if (this.cycleCheck(n, depPath, d)) continue\n      /* c8 ignore next */\n      if (this.settled.get(d)) continue\n      awaiting.push(this.running.get(d) ?? this.#walk(d, depPath))\n    }\n\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    await Promise.all(awaiting)\n    if (this.abortController.signal.aborted) return\n    const depRes = new Map<Node, Result | undefined>(\n      deps.map(d => [d, this.results.get(d)]),\n    )\n    try {\n      this.handleValue(await this.visit(n, path, depRes), n)\n    } catch (er) {\n      this.handleError(er, n, path)\n    }\n  }\n\n  async run(): Promise<void> {\n    const promises: Promise<void>[] = []\n    for (const n of this.options.graph) {\n      promises.push(this.#walk(n, []))\n    }\n    await Promise.all(promises)\n  }\n}\n\n/** Synchronous graph runner */\nexport class RunnerSync<Node, Result> extends RunnerBase<\n  Node,\n  Result,\n  true,\n  RunnerOptionsSync<Node, Result>\n> {\n  getDeps(n: Node) {\n    if (this.abortController.signal.aborted) return []\n    return this.options.getDeps(n)\n  }\n\n  visit(n: Node, path: Node[], depResults: DepResults<Node, Result>) {\n    const { signal } = this.abortController\n    return this.options.visit(n, signal, path, depResults)\n  }\n\n  onCycle(n: Node, cycle: Node[], path: Node[]) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    this.options.onCycle?.(n, cycle, path)\n  }\n\n  #walk(n: Node, path: Node[]) {\n    /* c8 ignore start */\n    if (this.settled.get(n)) return\n    /* c8 ignore stop */\n    this.#step(n, path)\n  }\n\n  #step(n: Node, path: Node[]) {\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n\n    const deps = this.getDeps(n)\n    const depPath = [...path, n]\n    for (const d of deps) {\n      if (this.abortController.signal.aborted) return\n      /* c8 ignore next */\n      if (d === n) continue\n      if (this.cycleCheck(n, depPath, d)) continue\n      if (!this.settled.get(d)) this.#walk(d, depPath)\n    }\n\n    if (this.abortController.signal.aborted) return\n    const depRes = new Map<Node, Result | undefined>(\n      deps.map(d => [d, this.results.get(d)]),\n    )\n    try {\n      this.handleValue(this.visit(n, path, depRes), n)\n    } catch (er) {\n      this.handleError(er, n, path)\n    }\n  }\n\n  run(): Map<Node, Result> {\n    for (const n of this.options.graph) {\n      this.#walk(n, [])\n    }\n    return this.results\n  }\n}\n\n/**\n * Asynchronous graph traversal method\n *\n * If `failFast:false` is set in the options, then an AggregateError\n * will be raised if there were any failures. Otherwise, a normal Error\n * is raised on failure.\n */\nexport const graphRun = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Map<Node, Result>> => {\n  const runner = new Runner(options, graphRun)\n  await runner.run()\n  if (runner.errors.length) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, graphRun)\n    throw e\n  }\n  return runner.results\n}\n\n/**\n * Synchronous graph traversal method\n *\n * If `failFast:false` is set in the options, then an AggregateError\n * will be thrown if there were any failures. Otherwise, a normal Error\n * is thrown on failure.\n */\nexport const graphRunSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Map<Node, Result> => {\n  const runner = new RunnerSync(options, graphRunSync)\n  runner.run()\n  if (runner.errors.length) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, graphRunSync)\n    throw e\n  }\n  return runner.results\n}\n\n/**\n * Asynchronous graph traversal, capturing all error/result\n * statuses.\n */\nexport const allSettled = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<SettledMap<Node, Result>> => {\n  const runner = new Runner(\n    { ...options, failFast: false },\n    allSettled,\n  )\n  await runner.run()\n  return runner.settled\n}\n\n/**\n * Synchronous graph traversal, capturing all error/result\n * statuses.\n */\nexport const allSettledSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): SettledMap<Node, Result> => {\n  const runner = new RunnerSync(\n    { ...options, failFast: false },\n    allSettledSync,\n  )\n  runner.run()\n  return runner.settled\n}\n\n/**\n * Asynchronous graph traversal, returning the first successful visit.\n * If all visits fail, then an AggregateError is raised with all errors\n * encountered.\n */\nexport const any = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Result> => {\n  const ac = new AbortController()\n  let result!: Result\n  let found: boolean = false\n  const runner = new Runner<Node, Result>(\n    {\n      ...options,\n      failFast: false,\n      signal: ac.signal,\n      visit: async (node, signal, path, depResults) => {\n        try {\n          result = await options.visit(node, signal, path, depResults)\n          found = true\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    any,\n  )\n  await runner.run()\n  if (!found) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, any)\n    throw e\n  }\n  return result\n}\n\n/**\n * Synchronous graph traversal, returning the first successful visit.\n * If all visits fail, then an AggregateError is thrown with all errors\n * encountered.\n */\nexport const anySync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Result => {\n  const ac = new AbortController()\n  let result!: Result\n  let found: boolean = false\n  const runner = new RunnerSync<Node, Result>(\n    {\n      ...options,\n      failFast: false,\n      signal: ac.signal,\n      visit: (node, signal, path, depResults) => {\n        try {\n          result = options.visit(node, signal, path, depResults)\n          found = true\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    anySync,\n  )\n  runner.run()\n  if (!found) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, anySync)\n    throw e\n  }\n  return result\n}\n\n/**\n * Asynchronous graph traversal, resolving or rejecting when the first visit\n * resolves or rejects.\n */\nexport const race = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Result> => {\n  const ac = new AbortController()\n  let result!: Result\n  const runner = new Runner<Node, Result>(\n    {\n      ...options,\n      failFast: true,\n      signal: ac.signal,\n      visit: async (node, signal, path, depResults) => {\n        try {\n          result = await options.visit(node, signal, path, depResults)\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    race,\n  )\n  await runner.run()\n  return result\n}\n\n/**\n * Synchronous graph traversal, returning or throwing when the first visit\n * is completed.\n */\nexport const raceSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Result => {\n  const ac = new AbortController()\n  let result!: Result\n  const runner = new RunnerSync<Node, Result>(\n    {\n      ...options,\n      failFast: true,\n      signal: ac.signal,\n      visit: (node, signal, path, depResults) => {\n        try {\n          result = options.visit(node, signal, path, depResults)\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    race,\n  )\n  runner.run()\n  return result\n}\n", "import { DepID, DepIDTuple, splitDepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { parse, Version } from '@vltpkg/semver'\nimport { GitSelectorParsed, Spec } from '@vltpkg/spec'\nimport { Monorepo } from '@vltpkg/workspaces'\nimport { relative, resolve } from 'path'\n\n/**\n * Return true if the node referenced by this DepID would satisfy the\n * supplied Spec object.\n */\nexport const satisfies = (\n  id: DepID | undefined,\n  spec: Spec,\n  fromLocation = process.cwd(),\n  projectRoot = process.cwd(),\n  monorepo?: Monorepo,\n): boolean =>\n  !!id &&\n  satisfiesTuple(\n    splitDepID(id),\n    spec,\n    fromLocation,\n    projectRoot,\n    monorepo,\n  )\n\nexport const satisfiesTuple = (\n  tuple: DepIDTuple,\n  spec: Spec,\n  fromLocation = process.cwd(),\n  projectRoot = process.cwd(),\n  monorepo?: Monorepo,\n): boolean => {\n  const { options } = spec\n  spec = spec.final\n  const [type, first, second] = tuple\n  if (spec.type !== type) return false\n\n  switch (spec.type) {\n    case 'registry': {\n      if (!first) {\n        // must be from the default registry\n        if (spec.registry !== options.registry) {\n          return false\n        }\n      } else {\n        const namedRegistry = options.registries[first]\n        if (namedRegistry && namedRegistry !== spec.registry) {\n          // we know the name, and it's not the registry being used\n          return false\n        } else if (!namedRegistry && first !== spec.registry) {\n          // an explicit registry URL, but does not match\n          return false\n        }\n      }\n      /* c8 ignore next */\n      if (!second) throw error('Invalid DepID', { found: tuple })\n      const [name, version] = parseNameVer(second)\n      return (\n        // mismatched name always invalid\n        name !== spec.name || !version ? false\n          // if just a dist-tag, assume valid\n        : !spec.range ? true\n        : spec.range.test(Version.parse(version))\n      )\n    }\n\n    case 'file': {\n      /* c8 ignore next - should be impossible */\n      if (spec.file === undefined) return false\n      const resolvedSpec = resolve(\n        projectRoot,\n        fromLocation,\n        spec.file,\n      )\n      const resolvedId = resolve(projectRoot, first)\n      // valid if the relative path is '', refers to the same path\n      return !relative(resolvedSpec, resolvedId)\n    }\n\n    case 'workspace': {\n      monorepo ??= Monorepo.load(projectRoot)\n      /* c8 ignore next */\n      if (!spec.workspace) return false\n      const fromID = monorepo.get(first)\n      const fromSpec = monorepo.get(spec.workspace)\n      if (fromID !== fromSpec || !fromSpec || !fromID) return false\n      if (!spec.range) return true\n      const v = parse(fromID.manifest.version ?? '')\n      return !!v && spec.range.test(v)\n    }\n\n    case 'remote': {\n      return spec.remoteURL === first\n    }\n\n    case 'git': {\n      const {\n        gitRemote,\n        gitSelectorParsed = {},\n        gitSelector,\n        gitCommittish,\n        namedGitHost,\n        namedGitHostPath,\n      } = spec\n      if (gitRemote !== first) {\n        if (namedGitHost && namedGitHostPath) {\n          const ngh = `${namedGitHost}:`\n          if (first.startsWith(ngh)) {\n            if (first !== ngh + namedGitHostPath) return false\n          } else return false\n        } else return false\n      }\n      if (gitSelector && !second) return false\n      /* c8 ignore next - always set to something, even if empty */\n      const [parsed, committish] = Spec.parseGitSelector(second ?? '')\n      if (gitCommittish && committish)\n        return !!committish.startsWith(gitCommittish)\n      for (const [k, v] of Object.entries(gitSelectorParsed)) {\n        if (parsed[k as keyof GitSelectorParsed] !== v) return false\n      }\n      return true\n    }\n\n    /* c8 ignore start */\n    default: {\n      throw error('Invalid spec type', { spec })\n    }\n  }\n  /* c8 ignore stop */\n}\n\nconst parseNameVer = (nv: string): [string, string] => {\n  const at = nv.lastIndexOf('@')\n  // if it's 0, means @scoped without a version\n  return at <= 0 ?\n      [nv, '']\n    : [nv.substring(0, at), nv.substring(at + 1)]\n}\n", "import { satisfies } from '@vltpkg/satisfies'\nimport { Spec } from '@vltpkg/spec'\nimport { inspect, InspectOptions } from 'util'\nimport { DependencyTypeShort } from './dependencies.js'\nimport { Node } from './node.js'\nimport { EdgeLike } from './types.js'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nexport class Edge implements EdgeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Edge'\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const str = inspect(\n      {\n        from: this.from.id,\n        type: this.type,\n        spec: String(this.spec),\n        to: this.to?.id,\n      },\n      options,\n    )\n    return `${this[Symbol.toStringTag]} ${str}`\n  }\n\n  /**\n   * The Node this Edge is connecting from, this is usually the dependent.\n   */\n  from: Node\n\n  /**\n   * The node this Edge is connecting to, this is usually a direct dependency.\n   */\n  to?: Node\n\n  /**\n   * What type of dependency relationship `from` and `to` nodes have.\n   */\n  type: DependencyTypeShort\n\n  /**\n   * The defined spec value for `to` as parsed from the dependent metadata.\n   */\n  spec: Spec\n\n  constructor(\n    type: DependencyTypeShort,\n    spec: Spec,\n    from: Node,\n    to?: Node,\n  ) {\n    this.from = from\n    this.to = to\n    this.type = type\n    this.spec = spec\n  }\n\n  /**\n   * The name of the dependency `to` as defined in the dependent metadata.\n   */\n  get name() {\n    return this.spec.name\n  }\n\n  /**\n   * This edge was defined as part of a `devDependencies` in `package.json`\n   */\n  get dev(): boolean {\n    return this.type === 'dev'\n  }\n\n  get optional(): boolean {\n    return this.type === 'peerOptional' || this.type === 'optional'\n  }\n\n  get peer(): boolean {\n    return this.type === 'peer' || this.type === 'peerOptional'\n  }\n\n  get peerOptional(): boolean {\n    return this.type === 'peerOptional'\n  }\n\n  valid(): boolean {\n    return !this.to ?\n        this.optional\n      : satisfies(\n          this.to.id,\n          this.spec,\n          this.from.location,\n          this.from.projectRoot,\n        )\n  }\n}\n", "import { getId, joinDepIDTuple, type DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { Spec, type SpecOptions } from '@vltpkg/spec'\nimport { type Manifest } from '@vltpkg/types'\nimport { Monorepo } from '@vltpkg/workspaces'\nimport { inspect, InspectOptions } from 'util'\nimport { DependencyTypeShort } from './dependencies.js'\nimport { type Edge } from './edge.js'\nimport { lockfileData } from './lockfile/save.js'\nimport { Node, NodeOptions } from './node.js'\nimport { GraphLike, NodeLike } from './types.js'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\n// this is always the same, but we don't hard code it as a string,\n// in case the DepID module needs to change its delimiter again ever.\nconst mainDepID = joinDepIDTuple(['file', '.'])\n\nexport type ManifestInventory = Map<DepID, Manifest>\n\nexport type GraphOptions = SpecOptions & {\n  /**\n   * The main importer manifest info.\n   */\n  mainManifest: Manifest\n  /**\n   * An inventory of seen manifests.\n   */\n  manifests?: ManifestInventory\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * Root of the project this graph represents\n   */\n  projectRoot: string\n}\n\nexport class Graph implements GraphLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Graph'\n  }\n\n  #options: GraphOptions\n\n  #nodeOptions: NodeOptions\n\n  /**\n   * A {@link Monorepo} instance, used for managing workspaces.\n   */\n  monorepo?: Monorepo\n\n  /**\n   * An inventory with all manifests related to an install.\n   */\n  manifests: ManifestInventory\n\n  /**\n   * A set of all edges in this graph.\n   */\n  edges = new Set<Edge>()\n\n  /**\n   * Map registered dep ids to the node that represent them in the graph.\n   */\n  nodes = new Map<DepID, Node>()\n\n  /**\n   * Map of nodes by their name\n   */\n  nodesByName = new Map<string, Set<Node>>()\n\n  /**\n   * Cached resolutions for spec lookups\n   */\n  resolutions = new Map<string, Node>()\n\n  /**\n   * Reverse map of resolutions\n   */\n  resolutionsReverse = new Map<Node, Set<string>>()\n\n  /**\n   * A set of importer nodes in this graph.\n   */\n  importers = new Set<Node>()\n\n  /**\n   * The {@link Node} that represents the project root `package.json`.\n   */\n  mainImporter: Node\n\n  /**\n   * A set of extraneous dependencies found when building the graph.\n   */\n  extraneousDependencies = new Set<Edge>()\n\n  /**\n   * The root of the project this graph represents\n   */\n  projectRoot: string\n\n  constructor(options: GraphOptions) {\n    const { mainManifest, manifests, monorepo, projectRoot } = options\n    this.#options = options\n    this.manifests = manifests ?? new Map()\n    this.projectRoot = projectRoot\n    this.#nodeOptions = {\n      ...this.#options,\n      graph: this,\n    }\n\n    // add the project root node\n    const mainImporterLocation = '.'\n    const mainImporterSpec = Spec.parse(\n      mainManifest.name || '(root)',\n      mainImporterLocation,\n    )\n    const mainImporter = this.addNode(\n      mainDepID,\n      mainManifest,\n      mainImporterSpec,\n    )\n    mainImporter.setImporterLocation(mainImporterLocation)\n    mainImporter.mainImporter = true\n    this.mainImporter = mainImporter\n    this.importers.add(mainImporter)\n    this.manifests.set(mainImporter.id, mainManifest)\n\n    // uses the monorepo instance in order to retrieve info on\n    // workspaces and create importer nodes for each of them\n    this.monorepo = monorepo\n    if (this.monorepo) {\n      for (const ws of this.monorepo) {\n        const wsNode = this.addNode(\n          ws.id,\n          ws.manifest,\n          undefined,\n          ws.name,\n        )\n        wsNode.setImporterLocation(`./${ws.path}`)\n        if (wsNode.manifest) {\n          this.manifests.set(wsNode.id, wsNode.manifest)\n        }\n        this.importers.add(wsNode)\n      }\n    }\n  }\n\n  /**\n   * Delete all nodes that are unreachable from the importers.\n   * The collection of deleted nodes is returned.\n   *\n   * NOTE: This can be extremely slow for large graphs, and is almost always\n   * unnecessary! Only call when it is known that some unreachable nodes may\n   * have been created, for example when deleting the unneeded subgraph when an\n   * optional node fails to resolve/install.\n   */\n  gc() {\n    const { nodes } = this\n    this.nodes = new Map()\n    const marked = new Set(this.importers)\n    for (const imp of marked) {\n      // don't delete the importer!\n      nodes.delete(imp.id)\n      this.nodes.set(imp.id, imp)\n      for (const { to } of imp.edgesOut.values()) {\n        if (!to || marked.has(to)) continue\n        marked.add(to)\n        nodes.delete(to.id)\n        this.nodes.set(to.id, to)\n      }\n    }\n    for (const node of nodes.values()) {\n      this.removeNode(node)\n    }\n    return nodes\n  }\n\n  /**\n   * Create a new edge between two nodes of the graph in case both exist,\n   * in case the destination node does not exists, then a dangling edge,\n   * pointing to nothing will be created to represent that missing dependency.\n   */\n  addEdge(\n    type: DependencyTypeShort,\n    spec: Spec,\n    from: NodeLike,\n    to?: NodeLike,\n  ) {\n    // fix any nameless spec\n    if (spec.name === '(unknown)') {\n      if (to) {\n        spec.name = to.name /* c8 ignore next */ || '(unknown)'\n        spec.spec = `${to.name}@${spec.bareSpec}`\n      } else {\n        throw error(\n          'Impossible to place a missing, nameless dependency',\n          { spec },\n        )\n      }\n    }\n    const existing = from.edgesOut.get(spec.name)\n    if (existing) {\n      const edge = existing as Edge\n      if (\n        edge.type === type &&\n        edge.spec.bareSpec === spec.bareSpec\n      ) {\n        if (to && to !== edge.to) {\n          edge.to = to as Node\n          edge.to.edgesIn.add(edge)\n        }\n        return edge\n      }\n      this.edges.delete(edge)\n    }\n    const f = from as Node\n    const edgeOut = f.addEdgesTo(type, spec, to as Node | undefined)\n    this.edges.add(edgeOut)\n    return edgeOut\n  }\n\n  /**\n   * Find an existing node to satisfy a dependency\n   */\n  findResolution(spec: Spec, fromNode: Node) {\n    const f = spec.final\n    // if it's a file: dep, then the fromNode location matters\n    const fromPref =\n      f.type === 'file' ? fromNode.location + ' : ' : ''\n    const sf = fromPref + String(f)\n    const cached = this.resolutions.get(sf)\n    if (cached) return cached\n    const nbn = this.nodesByName.get(f.name)\n    if (!nbn) return undefined\n    for (const node of nbn) {\n      if (\n        satisfies(\n          node.id,\n          f,\n          fromNode.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        this.resolutions.set(sf, node)\n        // always set by now, because the node was added at some point\n        this.resolutionsReverse.get(node)?.add(sf)\n        return node\n      }\n    }\n  }\n\n  /**\n   * Create a new node in the graph.\n   */\n  addNode(\n    id?: DepID,\n    manifest?: Manifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    const node = new Node(\n      this.#nodeOptions,\n      id,\n      manifest,\n      spec,\n      name,\n      version,\n    )\n    this.nodes.set(node.id, node)\n    const nbn = this.nodesByName.get(node.name) ?? new Set()\n    nbn.add(node)\n    this.nodesByName.set(node.name, nbn)\n    if (spec) {\n      const f = String(spec.final)\n      // if it's a file: type, then that is fromNode-specific,\n      // so we can't shortcut add it here.\n      if (spec.final.type !== 'file') {\n        this.resolutions.set(f, node)\n        const rrev = this.resolutionsReverse.get(node) ?? new Set()\n        rrev.add(f)\n        this.resolutionsReverse.set(node, rrev)\n      }\n    }\n    if (manifest) {\n      this.manifests.set(node.id, manifest)\n    }\n    return node\n  }\n\n  /**\n   * Place a new package into the graph representation, creating the new\n   * edges and possibly new nodes that are to be expected when traversing\n   * the graph in a top-down direction, e.g: from importers to leafs.\n   *\n   * For different uses that are not a direct top-down traversal of the graph\n   * consider using `addNode()` and `addEdge()` instead.\n   */\n  placePackage(\n    fromNode: Node,\n    depType: DependencyTypeShort,\n    spec: Spec,\n    manifest?: Manifest,\n    id?: DepID,\n  ) {\n    // if no manifest is available, then create an edge that has no\n    // reference to any other node, representing a missing dependency\n    if (!manifest && !id) {\n      this.addEdge(depType, spec, fromNode)\n      return\n    }\n\n    // flags set on the node we're about to create or find.\n    const flags = {\n      dev: fromNode.dev || depType === 'dev',\n      optional:\n        fromNode.optional ||\n        depType === 'optional' ||\n        depType === 'peerOptional',\n    }\n\n    const depId = id || (manifest && getId(spec, manifest))\n\n    /* c8 ignore start - should not be possible */\n    if (!depId) {\n      throw error('Could not find dep id when placing package', {\n        spec,\n        manifest,\n      })\n    }\n    /* c8 ignore stop */\n\n    // if a node for this package is already represented by a node\n    // in the graph, then just creates a new edge to that node\n    const toFoundNode = this.nodes.get(depId)\n    if (toFoundNode) {\n      this.addEdge(depType, spec, fromNode, toFoundNode)\n      // the current only stays dev/optional if this dep lets it remain so\n      // if it's not already, we don't make it dev or optional.\n      toFoundNode.dev &&= flags.dev\n      toFoundNode.optional &&= flags.optional\n      return toFoundNode\n    }\n\n    // creates a new node and edges to its parent\n    const toNode = this.addNode(depId, manifest)\n    toNode.registry = spec.registry\n    toNode.dev = flags.dev\n    toNode.optional = flags.optional\n    this.addEdge(depType, spec, fromNode, toNode)\n    return toNode\n  }\n\n  /**\n   * Removes a node and its relevant edges from the graph.\n   *\n   * If a replacement is provided, then any edges that were previously\n   * pointing to the removed node will be directed to the replacement,\n   * if it is valid to do so.\n   */\n  removeNode(node: Node, replacement?: Node) {\n    this.nodes.delete(node.id)\n    const nbn = this.nodesByName.get(node.name)\n    // if it's the last one, just remove the set\n    if (nbn?.size === 1) this.nodesByName.delete(node.name)\n    else nbn?.delete(node)\n    for (const r of this.resolutionsReverse.get(node) ?? new Set()) {\n      this.resolutions.delete(r)\n    }\n    this.resolutionsReverse.delete(node)\n    this.manifests.delete(node.id)\n    for (const edge of node.edgesOut.values()) {\n      this.edges.delete(edge)\n    }\n    for (const edge of node.edgesIn) {\n      if (\n        replacement &&\n        satisfies(\n          replacement.id,\n          edge.spec,\n          edge.from.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        edge.to = replacement\n      } else {\n        edge.to = undefined\n      }\n    }\n  }\n\n  toJSON() {\n    return lockfileData({\n      ...this.#options,\n      graph: this,\n      saveManifests: true,\n    })\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const data = this.toJSON()\n    return `${this[Symbol.toStringTag]} ${inspect(data, options)}`\n  }\n}\n", "import type { DepID } from '@vltpkg/dep-id'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type { Integrity, Manifest } from '@vltpkg/types'\nimport type { DependencyTypeShort } from '../dependencies.js'\n\n/**\n * This is the main type definition for the contents of the\n * `vlt-lock.json` file.\n *\n * The nodes and edges information from the lockfile are used to reconstruct\n * a {@link Graph} representing a previous install.\n */\nexport type LockfileData = {\n  options: SpecOptions\n  nodes: Record<DepID, LockfileNode>\n  edges: LockfileEdges\n}\n\nexport const getFlagNumFromNode = (node: {\n  optional?: boolean\n  dev?: boolean\n}) =>\n  node.optional && node.dev ? LockfileNodeFlagDevOptional\n  : node.optional ? LockfileNodeFlagOptional\n  : node.dev ? LockfileNodeFlagDev\n  : LockfileNodeFlagNone\n\nexport const getBooleanFlagsFromNum = (flags: LockfileNodeFlags) => ({\n  dev: !!(flags & LockfileNodeFlagDev),\n  optional: !!(flags & LockfileNodeFlagOptional),\n})\n\nexport const LockfileNodeFlagNone = 0\nexport const LockfileNodeFlagOptional = 1\nexport const LockfileNodeFlagDev = 2\nexport const LockfileNodeFlagDevOptional = 3\n\n/**\n * Bit flags indicating whether a node is optional and/or dev.\n */\nexport type LockfileNodeFlags = 0 | 1 | 2 | 3\n\n/**\n * Lockfile representation of a node from the install graph.\n */\nexport type LockfileNode = [\n  flags: LockfileNodeFlags,\n  name?: string | null,\n  integrity?: Integrity | null,\n  resolved?: string | null,\n  location?: string | null,\n  manifest?: Manifest | null,\n]\n\n/**\n * Lockfile edges are stored as a record object where the key\n * is `${from.id} ${spec.name}` and the value is\n * `${type} ${spec.bareSpec} ${to.id | 'MISSING'}`\n *\n * Storing them in a record like this means that we are guaranteed to\n * never end up with duplicates, and a standard `JSON.stringify()`\n * will nicely print them out one line per edge.\n */\nexport type LockfileEdges = {\n  [key: LockfileEdgeKey]: LockfileEdgeValue\n}\n\n/** `${from} ${dep name}` */\nexport type LockfileEdgeKey = `${DepID} ${string}`\n\n/** `${type} ${spec} ${to}` */\nexport type LockfileEdgeValue =\n  `${DependencyTypeShort} ${Spec['bareSpec']} ${DepID | 'MISSING'}`\n", "import { DepID } from '@vltpkg/dep-id'\nimport {\n  defaultRegistry,\n  defaultRegistries,\n  defaultGitHosts,\n  defaultGitHostArchives,\n  defaultScopeRegistries,\n  SpecOptions,\n} from '@vltpkg/spec'\nimport { mkdirSync, writeFileSync } from 'node:fs'\nimport { dirname, resolve } from 'node:path'\nimport { type Edge } from '../edge.js'\nimport { type Graph } from '../graph.js'\nimport { type Node } from '../node.js'\nimport {\n  getFlagNumFromNode,\n  LockfileData,\n  LockfileEdgeKey,\n  LockfileEdges,\n  LockfileEdgeValue,\n  LockfileNode,\n} from './types.js'\n\nexport type SaveOptions = SpecOptions & {\n  /**\n   * The graph to be stored in the lockfile.\n   */\n  graph: Graph\n  /**\n   * Should it save manifest data in the lockfile?\n   */\n  saveManifests?: boolean\n}\n\nconst formatNodes = (\n  nodes: Iterable<Node>,\n  saveManifests?: boolean,\n  registry?: string,\n) => {\n  // we do not store importers in the lockfile, though we do store\n  // their edges. when we load, we always read workspaces/main fresh.\n  const arr: Node[] = [...nodes].filter(node => !node.importer)\n  // nodes are sorted in order to have a deterministic result\n  const orderedNodes: Node[] = arr.sort((a, b) =>\n    a.id.localeCompare(b.id, 'en'),\n  )\n\n  const res: Record<DepID, LockfileNode> = {}\n  for (const node of orderedNodes) {\n    const customRegistry =\n      node.resolved && registry && !node.resolved.startsWith(registry)\n    const resolved = customRegistry ? node.resolved : undefined\n    // if it's in a location other than the default, stash that\n    const location =\n      (\n        node.id.startsWith('file') ||\n        node.location.endsWith(\n          '/node_modules/.vlt/' +\n            node.id +\n            '/node_modules/' +\n            node.name,\n        )\n      ) ?\n        undefined\n      : node.location\n\n    const flags = getFlagNumFromNode(node)\n    const lockfileNode: LockfileNode = [flags, node.name]\n\n    if (node.integrity) {\n      lockfileNode[2] = node.integrity\n    }\n\n    if (resolved) {\n      lockfileNode[3] = resolved\n    }\n\n    if (location) {\n      lockfileNode[4] = location\n    }\n\n    if (saveManifests) {\n      lockfileNode[5] = node.manifest\n    }\n\n    res[node.id] = lockfileNode\n  }\n  return res\n}\n\nconst formatEdges = (edges: Set<Edge>): LockfileEdges =>\n  Object.fromEntries(\n    [...edges]\n      .sort(\n        (a, b) =>\n          /* c8 ignore start - nondeterminstic and annoying to test */\n          // sort importers to the top, then alphabetically by\n          // id, type, target\n          Number(b.from.importer) - Number(a.from.importer) ||\n          a.from.id.localeCompare(b.from.id, 'en') ||\n          a.type.localeCompare(b.type, 'en') ||\n          (a.to?.id ?? '').localeCompare(b.to?.id ?? ''),\n        /* c8 ignore stop */\n      )\n      .map((edge): [LockfileEdgeKey, LockfileEdgeValue] => [\n        `${edge.from.id} ${edge.spec.name}`,\n        `${edge.type} ${edge.spec.bareSpec || '*'} ${edge.to?.id ?? 'MISSING'}`,\n      ]),\n  )\n\nconst isRecordStringString = (\n  registries: unknown,\n): registries is Record<string, string> =>\n  !(!registries || typeof registries === 'string')\n\nconst removeDefaultItems = (\n  defaultItems: Record<string, string>,\n  items: Record<string, string>,\n) => {\n  const res: Record<string, string> = {}\n  for (const [key, value] of Object.entries(items)) {\n    if (!defaultItems[key] || defaultItems[key] !== value) {\n      res[key] = value\n    }\n  }\n  return res\n}\n\nexport const lockfileData = ({\n  graph,\n  'git-hosts': gitHosts,\n  'git-host-archives': gitHostArchives,\n  registry,\n  registries,\n  saveManifests,\n  'scope-registries': scopeRegistries,\n}: SaveOptions): LockfileData => {\n  const cleanGitHosts =\n    isRecordStringString(gitHosts) ?\n      removeDefaultItems(defaultGitHosts, gitHosts)\n    : undefined\n  const cleanGitHostArchives =\n    isRecordStringString(gitHostArchives) ?\n      removeDefaultItems(defaultGitHostArchives, gitHostArchives)\n    : undefined\n  const cleanRegistries =\n    isRecordStringString(registries) ?\n      removeDefaultItems(defaultRegistries, registries)\n    : undefined\n  const cleanScopeRegistries =\n    isRecordStringString(scopeRegistries) ?\n      removeDefaultItems(defaultScopeRegistries, scopeRegistries)\n    : undefined\n  const hasItems = (clean: Record<string, string> | undefined) =>\n    clean && Object.keys(clean).length\n  return {\n    options: {\n      ...(hasItems(cleanScopeRegistries) ?\n        { 'scope-registries': cleanScopeRegistries }\n      : undefined),\n      ...(registry !== undefined && registry !== defaultRegistry ?\n        { registry }\n      : undefined),\n      ...(hasItems(registries) ?\n        { registries: cleanRegistries }\n      : undefined),\n      ...(hasItems(cleanGitHosts) ?\n        { 'git-hosts': cleanGitHosts }\n      : undefined),\n      ...(hasItems(cleanGitHostArchives) ?\n        { 'git-host-archives': cleanGitHostArchives }\n      : undefined),\n    },\n    nodes: formatNodes(graph.nodes.values(), saveManifests, registry),\n    edges: formatEdges(graph.edges),\n  }\n}\n\n// renders each node / edge as a single line entry\nconst extraFormat = (jsonString: string) => {\n  const str = `${jsonString}\\n`\n  const [init, ...parts] = str.split('  \"nodes\": {')\n  const res = [init]\n  for (const part of parts) {\n    res.push(\n      part.replaceAll('\\n      ', '').replaceAll('\\n    ]', ']'),\n    )\n  }\n  return res.join('  \"nodes\": {')\n}\n\nexport const saveData = (\n  data: LockfileData,\n  fileName: string,\n  saveManifests = false,\n) => {\n  const json = JSON.stringify(data, null, 2)\n  const content = saveManifests ? json : extraFormat(json)\n  writeFileSync(fileName, content)\n}\n\nexport const save = (options: SaveOptions) => {\n  const { graph } = options\n  const data = lockfileData({ ...options, saveManifests: false })\n  const fileName = resolve(graph.projectRoot, 'vlt-lock.json')\n  return saveData(data, fileName, false)\n}\n\nexport const saveHidden = (options: SaveOptions) => {\n  const { graph } = options\n  const data = lockfileData({ ...options, saveManifests: true })\n  const fileName = resolve(\n    graph.projectRoot,\n    'node_modules/.vlt-lock.json',\n  )\n  mkdirSync(dirname(fileName), { recursive: true })\n  return saveData(data, fileName, true)\n}\n", "import { error } from '@vltpkg/error-cause'\n\nexport const delimiter: Delimiter = '·'\nexport type Delimiter = '·'\n\n/**\n * Dependency IDs are a URI-encoded set of strings, separated\n * by the {@link Delimiter} character (`'·'`).\n *\n * The first entry is always the specifier type. The rest depend on the\n * type. `git`, `registry`, and `workspace` entries have 3 fields, the rest\n * have 2.\n *\n * - `registry`: `'registry·<registry>·name@specifier'`\n *   The `<registry>` portion can be a known named registry name, or a\n *   url to a registry. If empty, it is the default registry.\n *   Examples:\n *   - `··some-package@2.0.1`\n *   - `·npm·whatever@1.2.3'\n *   - `·http%3A%2F%2Fvlt.sh%2F·x@1.2.3`\n * - `git`: `'git·<git remote>·<git selector>`. For example:\n *   - `git·github:user/project·branchname`\n *   - `git·git%2Bssh%3A%2F%2Fuser%40host%3Aproject.git·semver:1.x`\n * - `workspace`: `'workspace·<path>`. For example:\n *   - `workspace·src/mything`\n * - `remote`: `'remote·<url>'`\n * - `file`: `'file·<path>`\n *\n * Lastly, the final portion can contain arbitrary string data, and is\n * used to store peer dep resolutions to maintain the peerDep contract.\n */\nexport type DepID =\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}${Delimiter}${string}`\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}`\n\n/**\n * A {@link DepID}, split apart and URI-decoded\n */\nexport type DepIDTuple =\n  | [\n      type: 'git',\n      gitRemote: string,\n      gitSelector: string,\n      extra?: string,\n    ]\n  | [\n      type: 'registry',\n      registry: string,\n      registrySpec: string,\n      extra?: string,\n    ]\n  | [type: 'file', path: string, extra?: string]\n  | [type: 'remote', url: string, extra?: string]\n  | [type: 'workspace', workspace: string, extra?: string]\n\nconst depIDRegExp = new RegExp(\n  `^((git)?${delimiter}[^${delimiter}]*${delimiter}[^${delimiter}]*(${\n    delimiter\n  }[^${delimiter}]*)?$` +\n    `|` +\n    `^(file|remote|workspace)${delimiter}[^${\n      delimiter\n    }]*)(${delimiter}[^${delimiter}]*)?$`,\n)\n\nexport const isDepID = (str: unknown): str is DepID =>\n  typeof str === 'string' && depIDRegExp.test(str)\n\nexport const asDepID = (str: string): DepID => {\n  if (!isDepID(str)) {\n    throw error('Expected dep id', {\n      found: str,\n    })\n  }\n  return str\n}\n\n/**\n * turn a {@link DepIDTuple} into a {@link DepID}\n */\nexport const joinDepIDTuple = (list: DepIDTuple): DepID => {\n  const [type, first, second, extra] = list\n  const f = encode(first)\n  switch (type) {\n    case 'registry':\n      return `${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    case 'git':\n      return `${type}${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    default:\n      return `${type}${delimiter}${f}${second ? `${delimiter}${encode(second)}` : ''}`\n  }\n}\n\n// allow @, but otherwise, escape everything urls do\nconst encode = (s: string): string =>\n  encodeURIComponent(s).replaceAll('%40', '@')\n\n/**\n * turn a {@link DepID} into a {@link DepIDTuple}\n */\nexport const splitDepID = (id: string): DepIDTuple => {\n  const [type, first = '', second, extra] = id.split(delimiter, 4)\n  const f = decodeURIComponent(first)\n  switch (type) {\n    case 'git':\n    case '': {\n      if (second === undefined) {\n        throw error(`invalid ${type} id`, { found: id })\n      }\n      const t: DepIDTuple = [\n        type || 'registry',\n        f,\n        decodeURIComponent(second),\n      ]\n      if (extra) t.push(decodeURIComponent(extra))\n      return t\n    }\n    case 'file':\n    case 'remote':\n    case 'workspace': {\n      const t: DepIDTuple = [type, f]\n      if (second) t.push(decodeURIComponent(second))\n      return t\n    }\n    default: {\n      throw error('invalid DepID type', {\n        found: type,\n        validOptions: ['git', 'file', 'workspace', 'remote', ''],\n      })\n    }\n  }\n}\n", "import { splitDepID } from '@vltpkg/dep-id/browser'\nimport { NodeLike } from './types.js'\n\nexport const stringifyNode = (node?: NodeLike) => {\n  if (!node) return ''\n  const version = node.version ? `@${node.version}` : ''\n  const [type, ref, nameVersion] = splitDepID(node.id)\n\n  if (type === 'registry') {\n    const prefix = ref ? `${ref}:` : 'npm:'\n    return `${prefix}${nameVersion}`\n  } else if (type === 'workspace') {\n    return `workspace:${node.name}`\n  } else if (type === 'file' && node.mainImporter) {\n    return `root:${node.name}`\n  } else {\n    // node.name getter will return the id if the package has no name\n    // property so here we check for that in order to return `type(ref)` only\n    const nameVersion =\n      node.name !== node.id ? `:${node.name}${version}` : ''\n    return `${type}(${ref})${nameVersion}`\n  }\n}\n", "import {\n  DepID,\n  DepIDTuple,\n  getId,\n  hydrateTuple,\n  splitDepID,\n} from '@vltpkg/dep-id'\nimport { typeError } from '@vltpkg/error-cause'\nimport { Spec, SpecOptions } from '@vltpkg/spec'\nimport { Integrity, Manifest } from '@vltpkg/types'\nimport { DependencyTypeShort } from './dependencies.js'\nimport { Edge } from './edge.js'\nimport { GraphLike, NodeLike } from './types.js'\nimport { stringifyNode } from './stringify-node.js'\n\nexport type NodeOptions = SpecOptions & {\n  projectRoot: string\n  graph: GraphLike\n}\n\nexport class Node implements NodeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Node'\n  }\n\n  #options: SpecOptions\n  #location?: string\n\n  #optional = false\n  /**\n   * True if a node is only reachable via optional or peerOptional edges from\n   * any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any optional-flagged non-optional dependencies.\n   */\n  get optional() {\n    return this.#optional\n  }\n  set optional(optional: boolean) {\n    const before = this.#optional\n    this.#optional = optional\n    if (before && !optional) {\n      // unset for all deps, as well\n      for (const { to, optional } of this.edgesOut.values()) {\n        if (!optional && to?.optional) to.optional = false\n      }\n    }\n  }\n\n  isOptional(): this is Node & { optional: true } {\n    return this.#optional\n  }\n\n  #dev = false\n  /**\n   * True if a node is only reachable via dev edges from any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any dev-flagged non-dev dependencies.\n   */\n  get dev() {\n    return this.#dev\n  }\n  set dev(dev: boolean) {\n    const before = this.#dev\n    this.#dev = dev\n    if (before && !dev) {\n      // unset for all deps, as well\n      for (const { to, dev } of this.edgesOut.values()) {\n        if (!dev && to?.dev) to.dev = false\n      }\n    }\n  }\n\n  isDev(): this is Node & { dev: true } {\n    return this.#dev\n  }\n\n  /**\n   * List of edges coming into this node.\n   */\n  edgesIn = new Set<Edge>()\n\n  /**\n   * List of edges from this node into other nodes. This usually represents\n   * that the connected node is a direct dependency of this node.\n   */\n  edgesOut = new Map<string, Edge>()\n\n  /**\n   * A reference to the {@link DepID} this node represents in the graph.\n   */\n  id: DepID\n\n  /**\n   * True if this node is an importer node.\n   */\n  importer = false\n\n  /**\n   * True if this node is the project root node.\n   */\n  mainImporter = false\n\n  /**\n   * A reference to the graph this node is a part of.\n   */\n  graph: GraphLike\n\n  /**\n   * The manifest integrity value.\n   */\n  integrity?: Integrity\n\n  /**\n   * The manifest this node represents in the graph.\n   */\n  manifest?: Manifest\n\n  /**\n   * Project where this node resides\n   */\n  projectRoot: string\n\n  /**\n   * For registry nodes, this is the registry we fetched them from.\n   * Needed because their un-prefixed dependencies need to come from\n   * the same registry, if it's not the default.\n   */\n  registry?: string\n\n  /**\n   * The name of the package represented by this node, this is usually\n   * equivalent to `manifest.name` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package names instead.\n   */\n  #name?: string\n  get name() {\n    if (this.#name) return this.#name\n    this.#name = this.id\n    return this.#name\n  }\n\n  /**\n   * The location of the node_modules folder where this node's edgesOut\n   * should be linked into. For nodes in the store, this is the parent\n   * directory, since they're extracted into a node_modules folder\n   * side by side with links to their deps. For nodes outside of the store\n   * (ie, importers and arbitrary link deps) this is the node_modules folder\n   * directly inside the node's directory.\n   */\n  get nodeModules() {\n    const loc = this.location\n    return this.inVltStore() ?\n        loc.substring(0, loc.length - this.name.length - 1)\n      : loc + '/node_modules'\n  }\n\n  /**\n   * The version of the package represented by this node, this is usually\n   * equivalent to `manifest.version` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package versions instead.\n   */\n  version?: string\n\n  /**\n   * An address {@link PackageInfoClient} may use to extract this package.\n   */\n  resolved?: string\n\n  /**\n   * The file system location for this node.\n   */\n  get location(): string {\n    if (this.#location) {\n      return this.#location\n    }\n    this.#location = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n    // if using the default location, it is in the store\n    this.inVltStore = () => true\n    return this.#location\n  }\n\n  set location(location: string) {\n    this.#location = location\n    // reset memoization, since it might be elsewhere now\n    if (this.inVltStore !== Node.prototype.inVltStore) {\n      this.inVltStore = Node.prototype.inVltStore\n    }\n  }\n\n  constructor(\n    options: NodeOptions,\n    id?: DepID,\n    manifest?: Manifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    this.#options = options\n    this.projectRoot = options.projectRoot\n    if (id) {\n      this.id = id\n    } else {\n      if (!manifest || !spec) {\n        throw typeError(\n          'A new Node needs either a manifest & spec or an id parameter',\n          {\n            manifest,\n          },\n        )\n      }\n      this.id = getId(spec, manifest)\n    }\n    this.graph = options.graph\n    this.manifest = manifest\n    this.#name = name || this.manifest?.name\n    this.version = version || this.manifest?.version\n  }\n\n  /**\n   * return true if this node is located in the vlt store\n   * memoized the first time it's called, since the store location\n   * doesn't change within the context of a single operation.\n   */\n  inVltStore(): boolean {\n    // technically this just means it's in *a* vlt store, but we can safely\n    // assume that a user won't construct a path like this by accident,\n    // and there's only ever one store in any given project.\n    const inStore = this.location.endsWith(\n      `.vlt/${this.id}/node_modules/${this.name}`,\n    )\n    this.inVltStore = () => inStore\n    return inStore\n  }\n\n  #registryNodeResolved(tuple: DepIDTuple) {\n    const spec = hydrateTuple(tuple, this.#name, this.#options)\n    this.resolved =\n      this.manifest?.dist?.tarball || spec.conventionalRegistryTarball\n    this.integrity ??= this.manifest?.dist?.integrity\n  }\n\n  equals(other: Node) {\n    return this.id === other.id && this.location === other.location\n  }\n\n  /**\n   * Sets the node as an importer along with its location.\n   */\n  setImporterLocation(location: string) {\n    this.#location = location\n    this.importer = true\n  }\n\n  /**\n   * Sets the appropriate resolve / integrity value for this node.\n   * Note that other places might also set these values, like for\n   * example the lockfile that might have already have this info.\n   */\n  setResolved() {\n    // file | remote | workspace type of ids all points to a URI that\n    // can be used as the `resolved` value, so we split the dep id\n    // for these cases.\n    const tuple = splitDepID(this.id)\n    const [type, resolved] = tuple\n    switch (type) {\n      case 'registry':\n        this.#registryNodeResolved(tuple)\n        break\n      default:\n        this.resolved = resolved\n        break\n    }\n  }\n\n  setDefaultLocation() {\n    const def = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n\n    // only relocate if the location is in node_modules already\n    if (\n      !this.importer &&\n      (!this.#location ||\n        (this.#location !== def &&\n          /^(?:\\.\\/)?node_modules\\//.test(this.#location)))\n    ) {\n      this.#location = def\n    }\n  }\n\n  /**\n   * Add an edge from this node connecting it to a direct dependency.\n   */\n  addEdgesTo(type: DependencyTypeShort, spec: Spec, node?: Node) {\n    const edge = new Edge(type, spec, this, node)\n    node?.edgesIn.add(edge)\n    this.edgesOut.set(spec.name, edge)\n    return edge\n  }\n\n  toJSON() {\n    return {\n      id: this.id,\n      name: this.name,\n      version: this.version,\n      location: this.location,\n      importer: this.importer,\n      manifest: this.manifest,\n      projectRoot: this.projectRoot,\n      integrity: this.integrity,\n      resolved: this.resolved,\n      dev: this.dev,\n      optional: this.optional,\n    }\n  }\n\n  toString() {\n    return stringifyNode(this)\n  }\n}\n", "import type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { type Spec } from '@vltpkg/spec'\nimport { type Manifest } from '@vltpkg/types'\n\n/**\n * Name of the package.json keys used to define different types of dependencies.\n */\nexport type DependencyTypeLong =\n  | 'dependencies'\n  | 'devDependencies'\n  | 'optionalDependencies'\n  | 'peerDependencies'\n\n/**\n * Unique keys that define different types of dependencies relationship.\n */\nexport type DependencyTypeShort =\n  | 'dev'\n  | 'optional'\n  | 'peer'\n  | 'peerOptional'\n  | 'prod'\n\nexport const isDependencyTypeShort = (\n  obj: any,\n): obj is DependencyTypeShort => shortDependencyTypes.has(obj)\n\nexport const asDependencyTypeShort = (\n  obj: any,\n): DependencyTypeShort => {\n  if (!isDependencyTypeShort(obj)) {\n    throw error('Invalid dependency type', {\n      found: obj,\n      validOptions: [...shortDependencyTypes],\n    })\n  }\n  return obj\n}\n\n/**\n * Dependency entries info as defined in a package.json file.\n */\nexport type RawDependency = {\n  name: string\n  bareSpec: string\n  type: DependencyTypeLong\n  registry?: string\n}\n\n/**\n * Parsed dependency entries info.\n */\nexport type Dependency = {\n  /**\n   * The parsed {@link Spec} object describing the dependency requirements.\n   */\n  spec: Spec\n  /**\n   * The {@link DependencyTypeShort}, describing the type of dependency.\n   */\n  type: DependencyTypeShort\n}\n\n/**\n * A `Map` in which keys are {@link DepID} linking to another `Map` in which\n * keys are the dependency names and values are {@link Dependency}. This\n * structure represents dependencies that need to be added to the importer\n * represented by {@link DepID}.\n */\nexport type AddImportersDependenciesMap = Map<\n  DepID,\n  Map<string, Dependency>\n>\n\n/**\n * A `Map` object representing nodes to be removed from the ideal graph.\n * Each {@link DepID} key represents an importer node and the `Set` of\n * dependency names to be removed from its dependency list.\n */\nexport type RemoveImportersDependenciesMap = Map<DepID, Set<string>>\n\nexport const isDependency = (obj: any): obj is Dependency =>\n  // TODO: it would be nice to have a @vltpkg/spec.isSpec method\n  obj?.spec?.type && obj?.type && isDependencyTypeShort(obj?.type)\n\nexport const asDependency = (obj: any): Dependency => {\n  if (!isDependency(obj)) {\n    throw error('Invalid dependency', { found: obj })\n  }\n  return obj\n}\n\n/**\n * A set of the possible long dependency type names,\n * as used in `package.json` files.\n */\nexport const longDependencyTypes = new Set<DependencyTypeLong>([\n  'dependencies',\n  'devDependencies',\n  'peerDependencies',\n  'optionalDependencies',\n])\n\n/**\n * A set of the short type keys used to represent dependency relationships.\n */\nexport const shortDependencyTypes = new Set<DependencyTypeShort>([\n  'prod',\n  'dev',\n  'peer',\n  'optional',\n  'peerOptional',\n])\n\n/**\n * Maps between long form names usually used in `package.json` files\n * to a corresponding short form name, used in lockfiles.\n */\nexport const dependencyTypes = new Map<\n  DependencyTypeLong,\n  DependencyTypeShort\n>([\n  ['dependencies', 'prod'],\n  ['devDependencies', 'dev'],\n  ['peerDependencies', 'peer'],\n  ['optionalDependencies', 'optional'],\n])\n\n/**\n * Get the {@link DependencyTypeShort} from a {@link DependencyTypeLong}.\n */\nexport const shorten = (\n  typeLong: DependencyTypeLong,\n  name?: string,\n  manifest?: Manifest,\n): DependencyTypeShort => {\n  const shortName = dependencyTypes.get(typeLong)\n  if (!shortName) {\n    throw error('Invalid dependency type name', {\n      found: typeLong,\n      validOptions: [...longDependencyTypes],\n    })\n  }\n  if (shortName !== 'peer') {\n    return shortName\n  }\n  if (\n    name &&\n    manifest?.peerDependenciesMeta?.[name]?.optional === true\n  ) {\n    return 'peerOptional'\n  }\n  return 'peer'\n}\n", "import { DepID } from '@vltpkg/dep-id'\nimport { EdgeLike, NodeLike } from '../types.js'\n\n/**\n * A JSON output item describes a package that is present in the install\n * graph. It represents an edge plus it's linking Node.\n */\nexport type JSONOutputItem = {\n  /**\n   * The name of the package.\n   */\n  name: string\n  /**\n   * A reference to the id of the Node that this package is linked from.\n   */\n  fromID?: DepID\n  /**\n   * The dependency spec definition for this package.\n   */\n  spec?: string\n  /**\n   * The package type.\n   */\n  type?: EdgeLike['type']\n  /**\n   * A representation of the package object that fulfills this dependency.\n   */\n  to?: NodeLike\n}\n\nexport type JSONOutputOptions = {\n  edges: EdgeLike[]\n  nodes: NodeLike[]\n}\n\n/**\n * Returns a JSON string representation of the graph.\n */\nexport function jsonOutput({ edges, nodes }: JSONOutputOptions) {\n  const res: JSONOutputItem[] = []\n\n  // Collects importer nodes as edgeless json output items\n  for (const node of nodes) {\n    if (node.importer) {\n      res.push({\n        /* c8 ignore next - name can't be missing but ts won't know */\n        name: node.name || node.id,\n        to: node,\n      })\n    }\n  }\n\n  // Collects edge & it's linked nodes as json output items\n  for (const edge of edges) {\n    res.push({\n      name: edge.name,\n      fromID: edge.from.id,\n      spec: String(edge.spec),\n      type: edge.type,\n      to: edge.to,\n    })\n  }\n\n  return JSON.stringify(res, null, 2)\n}\n", "import { splitDepID } from '@vltpkg/dep-id'\nimport { EdgeLike, NodeLike } from '../types.js'\nimport type { ChalkInstance } from 'chalk'\n\nconst chars = new Map(\n  Object.entries({\n    connection: '─',\n    down: '│',\n    'last-child': '└',\n    'middle-child': '├',\n    t: '┬',\n  }),\n)\n\nexport type TreeItem = {\n  name?: string | null\n  edge: EdgeLike | undefined\n  node: NodeLike | undefined\n  prefix: string\n  padding: string\n  hasSibling: boolean\n  deduped: boolean\n  include: boolean\n  parent: TreeItem | undefined\n}\n\nexport type HumanReadableOutputOptions = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n  colors?: ChalkInstance\n  highlightSelection: boolean\n}\n\nconst isSelected = (\n  options: HumanReadableOutputOptions,\n  edge?: EdgeLike,\n  node?: NodeLike,\n) =>\n  !!(\n    (!node || options.nodes.includes(node)) &&\n    (!edge || options.edges.includes(edge))\n  )\n\n/**\n * Returns a map of tree items to be printed.\n */\nconst getTreeItems = (\n  initialItems: Set<TreeItem>,\n  options: HumanReadableOutputOptions,\n) => {\n  const seenNodes = new Set<NodeLike>()\n  const treeItems = new Map<\n    EdgeLike | undefined,\n    Map<NodeLike | undefined, TreeItem>\n  >()\n  const traverse = new Set<TreeItem>(initialItems)\n  for (const item of traverse) {\n    if (item.node) {\n      if (seenNodes.has(item.node)) {\n        item.deduped = true\n        continue\n      }\n      seenNodes.add(item.node)\n      const edges = [...item.node.edgesOut.values()].sort(i =>\n        Number(i.to?.importer),\n      )\n      for (const edge of edges) {\n        const toItems = treeItems.get(edge) ?? new Map()\n        const nextItem: TreeItem = {\n          edge,\n          node: edge.to,\n          hasSibling: false,\n          padding: '',\n          prefix: '',\n          deduped: false,\n          include: isSelected(options, edge, edge.to),\n          parent: item,\n        }\n        toItems.set(edge.to, nextItem)\n        treeItems.set(edge, toItems)\n        traverse.add(nextItem)\n      }\n    }\n  }\n  for (const item of [...traverse].reverse()) {\n    if (item.include && item.parent) {\n      item.parent.include = true\n    }\n  }\n  return treeItems\n}\n\n/**\n * Returns a human-readable output of the graph.\n */\nexport function humanReadableOutput(\n  options: HumanReadableOutputOptions,\n) {\n  const { colors, importers } = options\n  const noop = (s?: string | null) => s\n  const {\n    dim = noop,\n    red = noop,\n    reset = noop,\n    yellow = noop,\n  } = colors ?? {}\n  const initialItems = new Set<TreeItem>()\n  for (const importer of importers) {\n    initialItems.add({\n      name: importer.name,\n      edge: undefined,\n      node: importer,\n      prefix: '',\n      padding: '',\n      hasSibling: false,\n      deduped: false,\n      include: isSelected(options, undefined, importer),\n      parent: undefined,\n    })\n  }\n  const treeItems = getTreeItems(initialItems, options)\n\n  let res = ''\n  const traverse = (item: TreeItem) => {\n    let header = ''\n    let content = ''\n\n    const depIdTuple = item.node?.id && splitDepID(item.node.id)\n    const hasCustomReg =\n      depIdTuple?.[0] === 'registry' && depIdTuple[1]\n    const name =\n      hasCustomReg ? `${depIdTuple[1]}:${item.name}` : item.name\n    const decoratedName =\n      (\n        options.highlightSelection &&\n        isSelected(options, item.edge, item.node)\n      ) ?\n        yellow(name)\n      : name\n    if (!item.node && item.include) {\n      const missing =\n        item.edge?.type.endsWith('ptional') ?\n          dim('(missing optional)')\n        : red('(missing)')\n      return `${item.padding}${item.prefix}${decoratedName} ${missing}\\n`\n    }\n\n    const deduped = item.deduped ? ` ${dim('(deduped)')}` : ''\n    header += `${item.padding}${item.prefix}${decoratedName}${deduped}\\n`\n\n    // deduped items need not to be printed or traversed\n    if (!item.deduped) {\n      const edges = item.node ? [...item.node.edgesOut.values()] : []\n      const nextItems = edges.map(i => treeItems.get(i)?.get(i.to))\n      const includedItems = nextItems.filter(i => i?.include)\n\n      for (const nextItem of nextItems) {\n        /* c8 ignore next -- impossible but TS doesn't know that */\n        if (!nextItem) continue\n\n        const parent = item\n        const isLast =\n          includedItems.indexOf(nextItem) === includedItems.length - 1\n        const toName =\n          nextItem.node?.version ?\n            `${nextItem.node.name}@${nextItem.node.version}`\n          : nextItem.node?.name\n        const nextChar = isLast ? 'last-child' : 'middle-child'\n\n        nextItem.name =\n          (\n            nextItem.node?.name &&\n            nextItem.edge?.name !== nextItem.edge?.to?.name\n          ) ?\n            `${nextItem.edge?.name} (${toName})`\n          : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`\n        nextItem.padding =\n          parent.prefix.length ?\n            `${parent.padding}${parent.hasSibling ? chars.get('down') : ' '} `\n          : ''\n        nextItem.prefix = `${chars.get(nextChar)}${chars.get('connection')}${chars.get('connection')} `\n        nextItem.hasSibling = !isLast\n\n        content += traverse(nextItem)\n      }\n    }\n\n    const regularConnection = `${chars.get('connection')} `\n    const parentConnection = `${chars.get('t')} `\n    return item.include ?\n        `${content ? header.replace(regularConnection, parentConnection) : header}${content}`\n      : ''\n  }\n\n  for (const item of initialItems) {\n    res += traverse(item)\n  }\n  return reset(res)\n}\n", "import { DepID } from '@vltpkg/dep-id'\nimport { Edge } from '../edge.js'\nimport { Node } from '../node.js'\nimport { EdgeLike, NodeLike } from '../types.js'\n\nexport type MermaidOutputOptions = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n}\n\ntype TraverseItem = {\n  self: EdgeLike | NodeLike\n  parent: EdgeLike | NodeLike | undefined\n}\n\nlet missingCount = 0\n\nconst nodeLabel = (node: NodeLike) =>\n  `\"${String(node).replaceAll('@', '#64;')}\"`\n\nfunction parseNode(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  node: NodeLike,\n) {\n  if (seenNodes.has(node.id) || !includedItems.get(node)) {\n    return ''\n  }\n  seenNodes.add(node.id)\n  const edges: string = [...node.edgesOut.values()]\n    .map(e => parseEdge(seenNodes, includedItems, e))\n    .filter(Boolean)\n    .join('\\n')\n  return `${encodeURIComponent(node.id)}(${nodeLabel(node)})${edges.length ? '\\n' : ''}${edges}`\n}\n\nfunction parseEdge(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  edge: EdgeLike,\n) {\n  if (!includedItems.get(edge)) {\n    return ''\n  }\n\n  const edgeResult =\n    `${encodeURIComponent(edge.from.id)}(${nodeLabel(edge.from)})` +\n    ` -->|\"${String(edge.spec).replaceAll('@', '#64;')} (${edge.type})\"| `\n\n  const missingLabel =\n    edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing'\n  if (!edge.to) {\n    return edgeResult + `missing-${missingCount++}(${missingLabel})\\n`\n  }\n\n  return (\n    edgeResult +\n    `${encodeURIComponent(edge.to.id)}(${nodeLabel(edge.to)})\\n` +\n    parseNode(seenNodes, includedItems, edge.to)\n  )\n}\n\n/**\n * Returns a mermaid string representation of the graph.\n */\nexport function mermaidOutput({\n  edges,\n  importers,\n  nodes,\n}: MermaidOutputOptions) {\n  const seen = new Set<EdgeLike | NodeLike>()\n  const includedItems = new Map<EdgeLike | NodeLike, boolean>()\n  const traverse = new Set<TraverseItem>(\n    [...importers].map(i => ({ self: i, parent: undefined })),\n  )\n\n  for (const item of traverse) {\n    if (seen.has(item.self)) continue\n    seen.add(item.self)\n\n    if (item.self instanceof Edge) {\n      if (edges.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      if (item.self.to) {\n        traverse.add({ self: item.self.to, parent: item.self })\n      }\n    }\n\n    if (item.self instanceof Node) {\n      if (nodes.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      for (const edge of item.self.edgesOut.values()) {\n        traverse.add({ self: edge, parent: item.self })\n      }\n    }\n  }\n\n  for (const item of [...traverse].reverse()) {\n    if (includedItems.has(item.self) && item.parent) {\n      includedItems.set(item.parent, true)\n    }\n  }\n\n  return (\n    'flowchart TD\\n' +\n    [...importers]\n      .map(i => parseNode(new Set<DepID>(), includedItems, i))\n      .join('\\n')\n  )\n}\n", "import { PackageJson } from '@vltpkg/package-json'\nimport { Manifest } from '@vltpkg/types'\nimport { Monorepo } from '@vltpkg/workspaces'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport { readFileSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { PathScurry } from 'path-scurry'\nimport { loadEdges } from './load-edges.js'\nimport { loadNodes } from './load-nodes.js'\nimport { Graph } from '../graph.js'\nimport type { LockfileData } from './types.js'\n\nexport type LoadOptions = SpecOptions & {\n  /**\n   * The project root dirname.\n   */\n  projectRoot: string\n  /**\n   * The project root manifest.\n   */\n  mainManifest: Manifest\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * A {@link PackageJson} object, for sharing manifest caches\n   */\n  packageJson?: PackageJson\n  /**\n   * A {@link PathScurry} object, for use in globs\n   */\n  scurry?: PathScurry\n}\n\nexport const load = (options: LoadOptions): Graph => {\n  const { projectRoot } = options\n  return loadObject(\n    options,\n    JSON.parse(\n      readFileSync(resolve(projectRoot, 'vlt-lock.json'), {\n        encoding: 'utf8',\n      }),\n    ),\n  )\n}\n\nexport const loadHidden = (options: LoadOptions): Graph => {\n  const { projectRoot } = options\n  return loadObject(\n    options,\n    JSON.parse(\n      readFileSync(\n        resolve(projectRoot, 'node_modules/.vlt-lock.json'),\n        { encoding: 'utf8' },\n      ),\n    ),\n  )\n}\n\nexport const loadObject = (\n  options: LoadOptions,\n  lockfileData: LockfileData,\n) => {\n  const { mainManifest, scurry } = options\n  const packageJson = options.packageJson ?? new PackageJson()\n  const monorepo =\n    options.monorepo ??\n    Monorepo.maybeLoad(options.projectRoot, { packageJson, scurry })\n  const {\n    'scope-registries': scopeRegistries,\n    registry,\n    registries,\n    'git-hosts': gitHosts,\n    'git-host-archives': gitHostArchives,\n  } = lockfileData.options\n  const mergedOptions = {\n    ...options,\n    'scope-registries': {\n      ...options['scope-registries'],\n      ...scopeRegistries,\n    },\n    registry: registry ?? options.registry,\n    registries: {\n      ...options.registries,\n      ...registries,\n    },\n    'git-hosts': {\n      ...options['git-hosts'],\n      ...gitHosts,\n    },\n    'git-host-archives': {\n      ...options['git-host-archives'],\n      ...gitHostArchives,\n    },\n  }\n  const graph = new Graph({\n    ...mergedOptions,\n    mainManifest,\n    monorepo,\n  })\n\n  loadNodes(graph, lockfileData.nodes)\n  loadEdges(graph, lockfileData.edges, mergedOptions)\n\n  return graph\n}\n", "import { asDepID } from '@vltpkg/dep-id/browser'\nimport { error } from '@vltpkg/error-cause'\nimport { fastSplit } from '@vltpkg/fast-split'\nimport { Spec, type SpecOptions } from '@vltpkg/spec/browser'\nimport {\n  isDependencyTypeShort,\n  longDependencyTypes,\n} from '../dependencies.js'\nimport type { GraphLike } from '../types.js'\nimport {\n  LockfileData,\n  LockfileEdgeKey,\n  LockfileEdgeValue,\n} from './types.js'\n\nexport const loadEdges = (\n  graph: GraphLike,\n  edges: LockfileData['edges'],\n  options: SpecOptions,\n) => {\n  const entries = Object.entries(edges) as [\n    LockfileEdgeKey,\n    LockfileEdgeValue,\n  ][]\n  for (const [key, value] of entries) {\n    const [fromId, specName] = fastSplit(key, ' ', 2)\n    const [depType, valRest] = fastSplit(value, ' ', 2)\n    const vrSplit = valRest?.lastIndexOf(' ') ?? -1\n    // not a valid edge record\n    /* c8 ignore start */\n    if (!valRest || !depType || !fromId || !specName || vrSplit < 1) {\n      continue\n    }\n    /* c8 ignore stop */\n    const spec = Spec.parse(\n      specName,\n      valRest.substring(0, vrSplit),\n      options,\n    )\n    const toId = valRest.substring(vrSplit + 1)\n    const from = graph.nodes.get(asDepID(fromId))\n    if (!from) {\n      throw error('Edge info missing its `from` node', {\n        found: {\n          nodes: [...graph.nodes].map(([id]) => id),\n          from,\n          fromId,\n          edge: { [key]: value },\n        },\n      })\n    }\n    const to =\n      toId === 'MISSING' ? undefined : graph.nodes.get(asDepID(toId))\n    if (!isDependencyTypeShort(depType)) {\n      throw error('Found unsupported dependency type in lockfile', {\n        validOptions: [...longDependencyTypes],\n      })\n    }\n    graph.addEdge(depType, spec, from, to)\n  }\n}\n", "import { splitDepID } from '@vltpkg/dep-id/browser'\nimport {\n  type LockfileData,\n  getBooleanFlagsFromNum,\n  type LockfileNode,\n} from './types.js'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { GraphLike } from '../types.js'\n\nexport const loadNodes = (\n  graph: GraphLike,\n  nodes: LockfileData['nodes'],\n) => {\n  const entries = Object.entries(nodes) as [DepID, LockfileNode][]\n  for (const [id, lockfileNode] of entries) {\n    // workspace nodes and the project root node are already part of the\n    // graph and it should not create new nodes if an existing one is there\n    if (graph.nodes.has(id)) continue\n\n    const [flags, name, integrity, resolved, location, manifest] =\n      lockfileNode\n    const [type, , spec] = splitDepID(id)\n\n    // if the lockfile has manifest data then it should just use that\n    // otherwise tries to infer name / version value from the lockfile node\n    const node =\n      manifest ?\n        graph.addNode(id, manifest)\n      : graph.addNode(\n          id,\n          undefined,\n          undefined,\n          name ?? undefined,\n          type === 'registry' && spec.indexOf('@') > 0 ?\n            spec.split('@').slice(-1)[0]\n          : undefined,\n        )\n\n    const { dev, optional } = getBooleanFlagsFromNum(flags)\n    node.dev = dev\n    node.optional = optional\n    node.integrity = integrity ?? undefined\n    node.resolved = resolved ?? undefined\n    if (location) node.location = location\n  }\n}\n", "import {\n  asDepID,\n  DepID,\n  hydrate,\n  joinDepIDTuple,\n} from '@vltpkg/dep-id'\nimport { PackageJson } from '@vltpkg/package-json'\nimport { Spec, SpecOptions } from '@vltpkg/spec'\nimport { Manifest } from '@vltpkg/types'\nimport { Monorepo } from '@vltpkg/workspaces'\nimport { Path, PathScurry } from 'path-scurry'\nimport {\n  longDependencyTypes,\n  RawDependency,\n  shorten,\n} from '../dependencies.js'\nimport { Graph } from '../graph.js'\nimport { loadHidden } from '../lockfile/load.js'\nimport { Node } from '../node.js'\n\nexport type LoadOptions = SpecOptions & {\n  /**\n   * The project root dirname.\n   */\n  projectRoot: string\n  /**\n   * The project root manifest.\n   */\n  mainManifest?: Manifest\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * A {@link PackageJson} object, for sharing manifest caches\n   */\n  packageJson: PackageJson\n  /**\n   * A {@link PathScurry} object, for use in globs\n   */\n  scurry: PathScurry\n  /**\n   * If set to `false`, `actual.load` will not load any `package.json`\n   * files while traversing the file system.\n   *\n   * The resulting {@link Graph} from loading with `loadManifests=false`\n   * has no information on dependency types or the specs defined and\n   * no information on missing and extraneous dependencies.\n   */\n  loadManifests?: boolean\n  /**\n   * If set to `true`, then do not shortcut the process by reading the\n   * hidden lockfile at `node_modules/.vlt-lock.json`\n   */\n  skipHiddenLockfile?: boolean\n}\n\nexport type ReadEntry = {\n  alias: string\n  name: string\n  realpath: Path\n}\n\nconst pathBasedType = new Set(['file', 'workspace'])\nconst isPathBasedType = (\n  type: string,\n): type is 'file' | 'workspace' => pathBasedType.has(type)\nconst getPathBasedId = (\n  spec: Spec,\n  path: string,\n): DepID | undefined =>\n  isPathBasedType(spec.type) ?\n    joinDepIDTuple([spec.type, path])\n  : undefined\n\n/**\n * Retrieve the {@link DepID} for a given package from its location.\n */\nconst findDepID = ({ parent, name }: Path): DepID | undefined =>\n  parent?.name === '.vlt' ? asDepID(name)\n  : parent?.isCWD === false ? findDepID(parent)\n  : undefined\n\n/**\n * Retrieves the closest `node_modules` parent {@link Path} found.\n */\nconst findNodeModules = ({\n  parent,\n  name,\n  isCWD,\n}: Path): Path | undefined =>\n  parent?.name === 'node_modules' ? parent\n  : parent && name !== '.vlt' && !isCWD ? findNodeModules(parent)\n  : undefined\n\n/**\n * Retrieves the scoped-normalized package name from its {@link Path}.\n */\nconst findName = ({ parent, name }: Path): string =>\n  parent?.name.startsWith('@') ? `${parent.name}/${name}` : name\n\nconst isStringArray = (a: unknown): a is string[] =>\n  Array.isArray(a) && !a.some(b => typeof b !== 'string')\n\n/*\n * Retrieves a map of all dependencies, of all types, that can be iterated\n * on and consulted when parsing the directory contents of the current node.\n */\nconst getDeps = (node: Node) => {\n  const dependencies = new Map<string, RawDependency>()\n  const bundleDeps: unknown = node.manifest?.bundleDependencies ?? []\n  // if it's an importer, bundleDeps are just normal. if it's a dep,\n  // then they're ignored entirely.\n  const bundled =\n    (\n      !node.importer &&\n      !node.id.startsWith('git') &&\n      isStringArray(bundleDeps)\n    ) ?\n      new Set(bundleDeps)\n    : new Set<string>()\n  for (const depType of longDependencyTypes) {\n    const obj: Record<string, string> | undefined =\n      node.manifest?.[depType]\n    // only care about devDeps for importers and git or symlink deps\n    // technically this will also include devDeps for tarball file: specs,\n    // but that is likely rare enough to not worry about too much.\n    if (\n      depType === 'devDependencies' &&\n      !node.importer &&\n      !node.id.startsWith('git') &&\n      !node.id.startsWith('file')\n    ) {\n      continue\n    }\n    if (obj) {\n      for (const [name, bareSpec] of Object.entries(obj)) {\n        // if it's a bundled dependency, we just ignore it entirely.\n        if (bundled.has(name)) continue\n        dependencies.set(name, {\n          name,\n          type: depType,\n          bareSpec,\n          registry: node.registry,\n        })\n      }\n    }\n  }\n  return dependencies\n}\n\n/**\n * Reads the current directory defined at `currDir` and looks for folder\n * names and their realpath resolution, normalizing scoped package names\n * and removing any invalid symlinks from the list of items that should\n * be parsed through in order to build the graph.\n */\nconst readDir = (\n  scurry: PathScurry,\n  currDir: Path,\n  fromNodeName?: string,\n) => {\n  const res = new Set<ReadEntry>()\n  for (const entry of scurry.readdirSync(currDir)) {\n    // ignore any hidden files / folders\n    if (entry.name.startsWith('.')) continue\n\n    // scope folder found, it will need to be read and iterated over\n    // in order to find any scoped packages inside\n    if (entry.name.startsWith('@')) {\n      const scopedItems = readDir(scurry, entry, fromNodeName)\n      for (const scopedItem of scopedItems) {\n        res.add(scopedItem)\n      }\n      continue\n    }\n\n    // skip anything that isn't a symlink, it's not an edge\n    if (!entry.isSymbolicLink()) continue\n\n    // we'll need to learn what is the real path for this entry in order\n    // to retrieve the `location` and `id` properties for the node, if a\n    // realpath is not found just move on to the next element\n    const realpath = entry.realpathSync()\n    if (!realpath) {\n      continue\n    }\n\n    // infer both the alias and proper package names, including scopes\n    const alias = findName(entry)\n    const name = findName(realpath)\n    res.add({\n      alias,\n      name,\n      realpath,\n    })\n  }\n  return res\n}\n\n/**\n * Parses the files located at `currDir` and place packages found inside\n * as dependencies of `fromNode`, building the instantiated `graph`.\n */\nconst parseDir = (\n  options: LoadOptions,\n  scurry: PathScurry,\n  packageJson: PackageJson,\n  depsFound: Map<Node, Path>,\n  graph: Graph,\n  fromNode: Node,\n  currDir: Path,\n) => {\n  const { loadManifests } = options\n  const dependencies = getDeps(fromNode)\n  const seenDeps = new Set<string>()\n  const readItems: Set<ReadEntry> = readDir(\n    scurry,\n    currDir,\n    fromNode.name,\n  )\n\n  for (const { alias, name, realpath } of readItems) {\n    let node\n\n    // tracks what dependencies have been seen\n    // so that we can mark missing dependencies\n    seenDeps.add(alias)\n\n    // places the package in the graph reading\n    // its manifest only if necessary\n    if (!loadManifests) {\n      const depId = findDepID(realpath)\n\n      if (depId) {\n        const h = hydrate(depId, alias, {\n          ...options,\n          registry: fromNode.registry,\n        })\n\n        // graphs build with no manifest have no notion of\n        // dependency types and or spec definitions since those\n        // would have to be parsed from a manifest\n        node = graph.placePackage(\n          fromNode,\n          'prod', // defaults to prod deps\n          h, // uses spec from hydrated id\n          {\n            name,\n            ...(h.registrySpec ?\n              { version: h.registrySpec } // adds version if available\n            : null),\n          },\n          depId,\n        )\n      }\n    }\n\n    // retrieve references to the current folder name found in `fromNode`\n    // manifest listed dependencies, removing it from the map will leave\n    // a list of missing dependencies at the end of the iteration\n    const deps = dependencies.get(alias)\n\n    // in case this graph is skipping manifests, this next block might\n    // still need to execute, thus actually loading a manifest file, for\n    // edge-cases such as loading a linked node that is not going to have\n    // DepID info available in its realpath or extraneous nodes\n    if (!node) {\n      const mani = packageJson.read(realpath.fullpath())\n      // declares fallback default values for both depType and bareSpec\n      // in order to support loadManifests=false fallback for link nodes\n      const type = deps?.type || 'dependencies'\n      const bareSpec = deps?.bareSpec || '*'\n\n      const depType = shorten(type, alias, fromNode.manifest)\n      const spec = Spec.parse(alias, bareSpec, {\n        ...options,\n        registry: fromNode.registry,\n      })\n      const maybeId = getPathBasedId(spec, realpath.relativePosix())\n      node = graph.placePackage(\n        fromNode,\n        depType,\n        spec,\n        mani,\n        maybeId,\n      )\n    }\n\n    if (node) {\n      // If a found dependency is not declared in any of the original\n      // node dependencies, then add an edge to the graph pointing to it\n      // and mark it as extraneous.\n      //\n      // This only makes sense if full manifests are being loaded\n      // so that we have reference to dependencies info.\n      if (loadManifests && !deps) {\n        const [edge] = node.edgesIn\n        if (edge) {\n          graph.extraneousDependencies.add(edge)\n        }\n      }\n\n      // for a succesfully created node, add its location\n      // property and queue up to read its dependencies\n      node.location = `./${realpath.relativePosix()}`\n      const node_modules = findNodeModules(realpath)\n\n      // queue items up to continue parsing dirs in case a node was succesfully\n      // placed in the graph and its node_modules folder was correctly found\n      if (node_modules) {\n        depsFound.set(node, node_modules)\n      }\n    }\n  }\n\n  // any remaining dependencies that have not been found\n  // when reading the directory should be marked as missing\n  for (const { name, type, bareSpec } of dependencies.values()) {\n    if (!seenDeps.has(name)) {\n      const depType = shorten(type, name, fromNode.manifest)\n      const spec = Spec.parse(name, bareSpec, {\n        ...options,\n        registry: fromNode.registry,\n      })\n      graph.placePackage(fromNode, depType, spec)\n    }\n  }\n}\n\n/**\n * Read the file system looking for `node_modules` folders and\n * returns a new {@link Graph} that represents the relationship\n * between the dependencies found.\n */\nexport const load = (options: LoadOptions): Graph => {\n  // TODO: once hidden lockfile is more reliable, default to false here\n  const {\n    skipHiddenLockfile = true,\n    projectRoot,\n    packageJson,\n    scurry,\n    monorepo,\n  } = options\n  const mainManifest =\n    options.mainManifest ?? packageJson.read(projectRoot)\n\n  if (!skipHiddenLockfile) {\n    try {\n      const graph = loadHidden({\n        projectRoot,\n        mainManifest,\n        packageJson,\n        monorepo,\n        scurry,\n      })\n      // TODO: check mtime of lockfile vs .vlt folder\n      return graph\n    } catch {}\n  }\n\n  const graph = new Graph({ ...options, mainManifest })\n  const depsFound = new Map<Node, Path>()\n\n  // starts the list of initial folders to parse using the importer nodes\n  for (const importer of graph.importers) {\n    depsFound.set(\n      importer,\n      scurry.cwd.resolve(`${importer.location}/node_modules`),\n    )\n  }\n\n  // breadth-first traversal of the file system tree reading deps found\n  // starting from the node_modules folder of every importer in order to\n  // find the actual installed dependencies at each location\n  for (const [node, path] of depsFound.entries()) {\n    parseDir(\n      options,\n      scurry,\n      packageJson,\n      depsFound,\n      graph,\n      node,\n      path,\n    )\n  }\n\n  return graph\n}\n", "import { spawn } from 'child_process'\nimport { rename } from 'fs/promises'\nimport { basename, dirname } from 'path'\nimport { rimraf } from 'rimraf'\nimport { __CODE_SPLIT_SCRIPT_NAME } from './remove.js'\n\nexport class RollbackRemove {\n  #key = String(Math.random()).substring(2)\n  #paths = new Map<string, string>()\n\n  async rm(path: string) {\n    const target = `${dirname(path)}/.VLT.DELETE.${this.#key}.${basename(path)}`\n    this.#paths.set(path, target)\n    await rename(path, target).catch((e: unknown) => {\n      if (e instanceof Error && 'code' in e && e.code === 'ENOENT') {\n        this.#paths.delete(path)\n        return\n      }\n      /* c8 ignore next */\n      throw e\n    })\n  }\n\n  confirm() {\n    // nothing to confirm!\n    if (!this.#paths.size) return\n\n    const child = spawn(\n      process.execPath,\n      [__CODE_SPLIT_SCRIPT_NAME],\n      {\n        stdio: ['pipe', 'ignore', 'ignore'],\n        detached: true,\n      },\n    )\n    child.unref()\n    for (const path of this.#paths.values()) {\n      child.stdin.write(path + '\\u0000')\n    }\n    child.stdin.end()\n    this.#paths.clear()\n  }\n\n  async rollback() {\n    const promises: Promise<unknown>[] = []\n    for (const [original, moved] of this.#paths) {\n      promises.push(\n        rimraf(original)\n          /* c8 ignore next */\n          .catch(() => {})\n          .then(() => rename(moved, original)),\n      )\n    }\n    await Promise.all(promises)\n    this.#paths.clear()\n  }\n}\n", "import { Dirent, Stats } from 'fs'\nimport { GlobOptions } from 'glob'\n\nconst typeOrUndef = (val: any, t: string) =>\n  typeof val === 'undefined' || typeof val === t\n\nexport const isRimrafOptions = (o: any): o is RimrafOptions =>\n  !!o &&\n  typeof o === 'object' &&\n  typeOrUndef(o.preserveRoot, 'boolean') &&\n  typeOrUndef(o.tmp, 'string') &&\n  typeOrUndef(o.maxRetries, 'number') &&\n  typeOrUndef(o.retryDelay, 'number') &&\n  typeOrUndef(o.backoff, 'number') &&\n  typeOrUndef(o.maxBackoff, 'number') &&\n  (typeOrUndef(o.glob, 'boolean') || (o.glob && typeof o.glob === 'object')) &&\n  typeOrUndef(o.filter, 'function')\n\nexport const assertRimrafOptions: (o: any) => void = (\n  o: any,\n): asserts o is RimrafOptions => {\n  if (!isRimrafOptions(o)) {\n    throw new Error('invalid rimraf options')\n  }\n}\n\nexport interface RimrafAsyncOptions {\n  preserveRoot?: boolean\n  tmp?: string\n  maxRetries?: number\n  retryDelay?: number\n  backoff?: number\n  maxBackoff?: number\n  signal?: AbortSignal\n  glob?: boolean | GlobOptions\n  filter?:\n    | ((path: string, ent: Dirent | Stats) => boolean)\n    | ((path: string, ent: Dirent | Stats) => Promise<boolean>)\n}\n\nexport interface RimrafSyncOptions extends RimrafAsyncOptions {\n  filter?: (path: string, ent: Dirent | Stats) => boolean\n}\n\nexport type RimrafOptions = RimrafSyncOptions | RimrafAsyncOptions\n\nconst optArgT = <T extends RimrafOptions>(\n  opt: T,\n):\n  | (T & {\n      glob: GlobOptions & { withFileTypes: false }\n    })\n  | (T & { glob: undefined }) => {\n  assertRimrafOptions(opt)\n  const { glob, ...options } = opt\n  if (!glob) {\n    return options as T & { glob: undefined }\n  }\n  const globOpt =\n    glob === true ?\n      opt.signal ?\n        { signal: opt.signal }\n      : {}\n    : opt.signal ?\n      {\n        signal: opt.signal,\n        ...glob,\n      }\n    : glob\n  return {\n    ...options,\n    glob: {\n      ...globOpt,\n      // always get absolute paths from glob, to ensure\n      // that we are referencing the correct thing.\n      absolute: true,\n      withFileTypes: false,\n    },\n  } as T & { glob: GlobOptions & { withFileTypes: false } }\n}\n\nexport const optArg = (opt: RimrafAsyncOptions = {}) => optArgT(opt)\nexport const optArgSync = (opt: RimrafSyncOptions = {}) => optArgT(opt)\n", "import { parse, resolve } from 'path'\nimport { inspect } from 'util'\nimport { RimrafAsyncOptions } from './index.js'\nimport platform from './platform.js'\n\nconst pathArg = (path: string, opt: RimrafAsyncOptions = {}) => {\n  const type = typeof path\n  if (type !== 'string') {\n    const ctor = path && type === 'object' && path.constructor\n    const received =\n      ctor && ctor.name ? `an instance of ${ctor.name}`\n      : type === 'object' ? inspect(path)\n      : `type ${type} ${path}`\n    const msg =\n      'The \"path\" argument must be of type string. ' + `Received ${received}`\n    throw Object.assign(new TypeError(msg), {\n      path,\n      code: 'ERR_INVALID_ARG_TYPE',\n    })\n  }\n\n  if (/\\0/.test(path)) {\n    // simulate same failure that node raises\n    const msg = 'path must be a string without null bytes'\n    throw Object.assign(new TypeError(msg), {\n      path,\n      code: 'ERR_INVALID_ARG_VALUE',\n    })\n  }\n\n  path = resolve(path)\n  const { root } = parse(path)\n\n  if (path === root && opt.preserveRoot !== false) {\n    const msg = 'refusing to remove root directory without preserveRoot:false'\n    throw Object.assign(new Error(msg), {\n      path,\n      code: 'ERR_PRESERVE_ROOT',\n    })\n  }\n\n  if (platform === 'win32') {\n    const badWinChars = /[*|\"<>?:]/\n    const { root } = parse(path)\n    if (badWinChars.test(path.substring(root.length))) {\n      throw Object.assign(new Error('Illegal characters in path.'), {\n        path,\n        code: 'EINVAL',\n      })\n    }\n  }\n\n  return path\n}\n\nexport default pathArg\n", "export default process.env.__TESTING_RIMRAF_PLATFORM__ || process.platform\n", "// promisify ourselves, because older nodes don't have fs.promises\n\nimport fs, { Dirent } from 'fs'\n\n// sync ones just take the sync version from node\nexport {\n  chmodSync,\n  mkdirSync,\n  renameSync,\n  rmdirSync,\n  rmSync,\n  statSync,\n  lstatSync,\n  unlinkSync,\n} from 'fs'\n\nimport { readdirSync as rdSync } from 'fs'\nexport const readdirSync = (path: fs.PathLike): Dirent[] =>\n  rdSync(path, { withFileTypes: true })\n\n// unrolled for better inlining, this seems to get better performance\n// than something like:\n// const makeCb = (res, rej) => (er, ...d) => er ? rej(er) : res(...d)\n// which would be a bit cleaner.\n\nconst chmod = (path: fs.PathLike, mode: fs.Mode): Promise<void> =>\n  new Promise((res, rej) =>\n    fs.chmod(path, mode, (er, ...d: any[]) => (er ? rej(er) : res(...d))),\n  )\n\nconst mkdir = (\n  path: fs.PathLike,\n  options?:\n    | fs.Mode\n    | (fs.MakeDirectoryOptions & { recursive?: boolean | null })\n    | undefined\n    | null,\n): Promise<string | undefined> =>\n  new Promise((res, rej) =>\n    fs.mkdir(path, options, (er, made) => (er ? rej(er) : res(made))),\n  )\n\nconst readdir = (path: fs.PathLike): Promise<Dirent[]> =>\n  new Promise<Dirent[]>((res, rej) =>\n    fs.readdir(path, { withFileTypes: true }, (er, data) =>\n      er ? rej(er) : res(data),\n    ),\n  )\n\nconst rename = (oldPath: fs.PathLike, newPath: fs.PathLike): Promise<void> =>\n  new Promise((res, rej) =>\n    fs.rename(oldPath, newPath, (er, ...d: any[]) =>\n      er ? rej(er) : res(...d),\n    ),\n  )\n\nconst rm = (path: fs.PathLike, options: fs.RmOptions): Promise<void> =>\n  new Promise((res, rej) =>\n    fs.rm(path, options, (er, ...d: any[]) => (er ? rej(er) : res(...d))),\n  )\n\nconst rmdir = (path: fs.PathLike): Promise<void> =>\n  new Promise((res, rej) =>\n    fs.rmdir(path, (er, ...d: any[]) => (er ? rej(er) : res(...d))),\n  )\n\nconst stat = (path: fs.PathLike): Promise<fs.Stats> =>\n  new Promise((res, rej) =>\n    fs.stat(path, (er, data) => (er ? rej(er) : res(data))),\n  )\n\nconst lstat = (path: fs.PathLike): Promise<fs.Stats> =>\n  new Promise((res, rej) =>\n    fs.lstat(path, (er, data) => (er ? rej(er) : res(data))),\n  )\n\nconst unlink = (path: fs.PathLike): Promise<void> =>\n  new Promise((res, rej) =>\n    fs.unlink(path, (er, ...d: any[]) => (er ? rej(er) : res(...d))),\n  )\n\nexport const promises = {\n  chmod,\n  mkdir,\n  readdir,\n  rename,\n  rm,\n  rmdir,\n  stat,\n  lstat,\n  unlink,\n}\n", "// the simple recursive removal, where unlink and rmdir are atomic\n// Note that this approach does NOT work on Windows!\n// We stat first and only unlink if the Dirent isn't a directory,\n// because sunos will let root unlink a directory, and some\n// SUPER weird breakage happens as a result.\n\nimport { lstatSync, promises, rmdirSync, unlinkSync } from './fs.js'\nconst { lstat, rmdir, unlink } = promises\n\nimport { parse, resolve } from 'path'\n\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\n\nimport { Dirent, Stats } from 'fs'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\n\nexport const rimrafPosix = async (path: string, opt: RimrafAsyncOptions) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return await rimrafPosixDir(path, opt, await lstat(path))\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nexport const rimrafPosixSync = (path: string, opt: RimrafSyncOptions) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return rimrafPosixDirSync(path, opt, lstatSync(path))\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nconst rimrafPosixDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n): Promise<boolean> => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(unlink(path))\n    return true\n  }\n\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent => rimrafPosixDir(resolve(path, ent.name), opt, ent)),\n    )\n  ).reduce((a, b) => a && b, true)\n\n  if (!removedAll) {\n    return false\n  }\n\n  // we don't ever ACTUALLY try to unlink /, because that can never work\n  // but when preserveRoot is false, we could be operating on it.\n  // No need to check if preserveRoot is not false.\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n\n  if (opt.filter && !(await opt.filter(path, ent))) {\n    return false\n  }\n\n  await ignoreENOENT(rmdir(path))\n  return true\n}\n\nconst rimrafPosixDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n): boolean => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() => unlinkSync(path))\n    return true\n  }\n  let removedAll: boolean = true\n  for (const ent of entries) {\n    const p = resolve(path, ent.name)\n    removedAll = rimrafPosixDirSync(p, opt, ent) && removedAll\n  }\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n\n  if (!removedAll) {\n    return false\n  }\n\n  if (opt.filter && !opt.filter(path, ent)) {\n    return false\n  }\n\n  ignoreENOENTSync(() => rmdirSync(path))\n  return true\n}\n", "// returns an array of entries if readdir() works,\n// or the error that readdir() raised if not.\nimport { promises, readdirSync } from './fs.js'\nconst { readdir } = promises\nexport const readdirOrError = (path: string) =>\n  readdir(path).catch(er => er as NodeJS.ErrnoException)\nexport const readdirOrErrorSync = (path: string) => {\n  try {\n    return readdirSync(path)\n  } catch (er) {\n    return er as NodeJS.ErrnoException\n  }\n}\n", "export const ignoreENOENT = async (p: Promise<any>) =>\n  p.catch(er => {\n    if (er.code !== 'ENOENT') {\n      throw er\n    }\n  })\n\nexport const ignoreENOENTSync = (fn: () => any) => {\n  try {\n    return fn()\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code !== 'ENOENT') {\n      throw er\n    }\n  }\n}\n", "// This is the same as rimrafPosix, with the following changes:\n//\n// 1. EBUSY, ENFILE, EMFILE trigger retries and/or exponential backoff\n// 2. All non-directories are removed first and then all directories are\n//    removed in a second sweep.\n// 3. If we hit ENOTEMPTY in the second sweep, fall back to move-remove on\n//    the that folder.\n//\n// Note: \"move then remove\" is 2-10 times slower, and just as unreliable.\n\nimport { Dirent, Stats } from 'fs'\nimport { parse, resolve } from 'path'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { fixEPERM, fixEPERMSync } from './fix-eperm.js'\nimport { lstatSync, promises, rmdirSync, unlinkSync } from './fs.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\nimport { retryBusy, retryBusySync } from './retry-busy.js'\nimport { rimrafMoveRemove, rimrafMoveRemoveSync } from './rimraf-move-remove.js'\nconst { unlink, rmdir, lstat } = promises\n\nconst rimrafWindowsFile = retryBusy(fixEPERM(unlink))\nconst rimrafWindowsFileSync = retryBusySync(fixEPERMSync(unlinkSync))\nconst rimrafWindowsDirRetry = retryBusy(fixEPERM(rmdir))\nconst rimrafWindowsDirRetrySync = retryBusySync(fixEPERMSync(rmdirSync))\n\nconst rimrafWindowsDirMoveRemoveFallback = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n): Promise<boolean> => {\n  /* c8 ignore start */\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  /* c8 ignore stop */\n  // already filtered, remove from options so we don't call unnecessarily\n  const { filter, ...options } = opt\n  try {\n    return await rimrafWindowsDirRetry(path, options)\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOTEMPTY') {\n      return await rimrafMoveRemove(path, options)\n    }\n    throw er\n  }\n}\n\nconst rimrafWindowsDirMoveRemoveFallbackSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n): boolean => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  // already filtered, remove from options so we don't call unnecessarily\n  const { filter, ...options } = opt\n  try {\n    return rimrafWindowsDirRetrySync(path, options)\n  } catch (er) {\n    const fer = er as NodeJS.ErrnoException\n    if (fer?.code === 'ENOTEMPTY') {\n      return rimrafMoveRemoveSync(path, options)\n    }\n    throw er\n  }\n}\n\nconst START = Symbol('start')\nconst CHILD = Symbol('child')\nconst FINISH = Symbol('finish')\n\nexport const rimrafWindows = async (path: string, opt: RimrafAsyncOptions) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return await rimrafWindowsDir(path, opt, await lstat(path), START)\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nexport const rimrafWindowsSync = (path: string, opt: RimrafSyncOptions) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return rimrafWindowsDirSync(path, opt, lstatSync(path), START)\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nconst rimrafWindowsDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n  state = START,\n): Promise<boolean> => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    // is a file\n    await ignoreENOENT(rimrafWindowsFile(path, opt))\n    return true\n  }\n\n  const s = state === START ? CHILD : state\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent =>\n        rimrafWindowsDir(resolve(path, ent.name), opt, ent, s),\n      ),\n    )\n  ).reduce((a, b) => a && b, true)\n\n  if (state === START) {\n    return rimrafWindowsDir(path, opt, ent, FINISH)\n  } else if (state === FINISH) {\n    if (opt.preserveRoot === false && path === parse(path).root) {\n      return false\n    }\n    if (!removedAll) {\n      return false\n    }\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(rimrafWindowsDirMoveRemoveFallback(path, opt))\n  }\n  return true\n}\n\nconst rimrafWindowsDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n  state = START,\n): boolean => {\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    // is a file\n    ignoreENOENTSync(() => rimrafWindowsFileSync(path, opt))\n    return true\n  }\n\n  let removedAll = true\n  for (const ent of entries) {\n    const s = state === START ? CHILD : state\n    const p = resolve(path, ent.name)\n    removedAll = rimrafWindowsDirSync(p, opt, ent, s) && removedAll\n  }\n\n  if (state === START) {\n    return rimrafWindowsDirSync(path, opt, ent, FINISH)\n  } else if (state === FINISH) {\n    if (opt.preserveRoot === false && path === parse(path).root) {\n      return false\n    }\n    if (!removedAll) {\n      return false\n    }\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() => {\n      rimrafWindowsDirMoveRemoveFallbackSync(path, opt)\n    })\n  }\n  return true\n}\n", "import { chmodSync, promises } from './fs.js'\nconst { chmod } = promises\n\nexport const fixEPERM =\n  (fn: (path: string) => Promise<any>) => async (path: string) => {\n    try {\n      return await fn(path)\n    } catch (er) {\n      const fer = er as NodeJS.ErrnoException\n      if (fer?.code === 'ENOENT') {\n        return\n      }\n      if (fer?.code === 'EPERM') {\n        try {\n          await chmod(path, 0o666)\n        } catch (er2) {\n          const fer2 = er2 as NodeJS.ErrnoException\n          if (fer2?.code === 'ENOENT') {\n            return\n          }\n          throw er\n        }\n        return await fn(path)\n      }\n      throw er\n    }\n  }\n\nexport const fixEPERMSync = (fn: (path: string) => any) => (path: string) => {\n  try {\n    return fn(path)\n  } catch (er) {\n    const fer = er as NodeJS.ErrnoException\n    if (fer?.code === 'ENOENT') {\n      return\n    }\n    if (fer?.code === 'EPERM') {\n      try {\n        chmodSync(path, 0o666)\n      } catch (er2) {\n        const fer2 = er2 as NodeJS.ErrnoException\n        if (fer2?.code === 'ENOENT') {\n          return\n        }\n        throw er\n      }\n      return fn(path)\n    }\n    throw er\n  }\n}\n", "// note: max backoff is the maximum that any *single* backoff will do\n\nimport { RimrafAsyncOptions, RimrafOptions } from './index.js'\n\nexport const MAXBACKOFF = 200\nexport const RATE = 1.2\nexport const MAXRETRIES = 10\nexport const codes = new Set(['EMFILE', 'ENFILE', 'EBUSY'])\n\nexport const retryBusy = (fn: (path: string) => Promise<any>) => {\n  const method = async (\n    path: string,\n    opt: RimrafAsyncOptions,\n    backoff = 1,\n    total = 0,\n  ) => {\n    const mbo = opt.maxBackoff || MAXBACKOFF\n    const rate = opt.backoff || RATE\n    const max = opt.maxRetries || MAXRETRIES\n    let retries = 0\n    while (true) {\n      try {\n        return await fn(path)\n      } catch (er) {\n        const fer = er as NodeJS.ErrnoException\n        if (fer?.path === path && fer?.code && codes.has(fer.code)) {\n          backoff = Math.ceil(backoff * rate)\n          total = backoff + total\n          if (total < mbo) {\n            return new Promise((res, rej) => {\n              setTimeout(() => {\n                method(path, opt, backoff, total).then(res, rej)\n              }, backoff)\n            })\n          }\n          if (retries < max) {\n            retries++\n            continue\n          }\n        }\n        throw er\n      }\n    }\n  }\n\n  return method\n}\n\n// just retries, no async so no backoff\nexport const retryBusySync = (fn: (path: string) => any) => {\n  const method = (path: string, opt: RimrafOptions) => {\n    const max = opt.maxRetries || MAXRETRIES\n    let retries = 0\n    while (true) {\n      try {\n        return fn(path)\n      } catch (er) {\n        const fer = er as NodeJS.ErrnoException\n        if (\n          fer?.path === path &&\n          fer?.code &&\n          codes.has(fer.code) &&\n          retries < max\n        ) {\n          retries++\n          continue\n        }\n        throw er\n      }\n    }\n  }\n  return method\n}\n", "// https://youtu.be/uhRWMGBjlO8?t=537\n//\n// 1. readdir\n// 2. for each entry\n//   a. if a non-empty directory, recurse\n//   b. if an empty directory, move to random hidden file name in $TEMP\n//   c. unlink/rmdir $TEMP\n//\n// This works around the fact that unlink/rmdir is non-atomic and takes\n// a non-deterministic amount of time to complete.\n//\n// However, it is HELLA SLOW, like 2-10x slower than a naive recursive rm.\n\nimport { basename, parse, resolve } from 'path'\nimport { defaultTmp, defaultTmpSync } from './default-tmp.js'\n\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\n\nimport {\n  chmodSync,\n  lstatSync,\n  promises as fsPromises,\n  renameSync,\n  rmdirSync,\n  unlinkSync,\n} from './fs.js'\nconst { lstat, rename, unlink, rmdir, chmod } = fsPromises\n\nimport { Dirent, Stats } from 'fs'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\n\n// crypto.randomBytes is much slower, and Math.random() is enough here\nconst uniqueFilename = (path: string) => `.${basename(path)}.${Math.random()}`\n\nconst unlinkFixEPERM = async (path: string) =>\n  unlink(path).catch((er: Error & { code?: string }) => {\n    if (er.code === 'EPERM') {\n      return chmod(path, 0o666).then(\n        () => unlink(path),\n        er2 => {\n          if (er2.code === 'ENOENT') {\n            return\n          }\n          throw er\n        },\n      )\n    } else if (er.code === 'ENOENT') {\n      return\n    }\n    throw er\n  })\n\nconst unlinkFixEPERMSync = (path: string) => {\n  try {\n    unlinkSync(path)\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'EPERM') {\n      try {\n        return chmodSync(path, 0o666)\n      } catch (er2) {\n        if ((er2 as NodeJS.ErrnoException)?.code === 'ENOENT') {\n          return\n        }\n        throw er\n      }\n    } else if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') {\n      return\n    }\n    throw er\n  }\n}\n\nexport const rimrafMoveRemove = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return await rimrafMoveRemoveDir(path, opt, await lstat(path))\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nconst rimrafMoveRemoveDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n): Promise<boolean> => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  if (!opt.tmp) {\n    return rimrafMoveRemoveDir(\n      path,\n      { ...opt, tmp: await defaultTmp(path) },\n      ent,\n    )\n  }\n  if (path === opt.tmp && parse(path).root !== path) {\n    throw new Error('cannot delete temp directory used for deletion')\n  }\n\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(tmpUnlink(path, opt.tmp, unlinkFixEPERM))\n    return true\n  }\n\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent =>\n        rimrafMoveRemoveDir(resolve(path, ent.name), opt, ent),\n      ),\n    )\n  ).reduce((a, b) => a && b, true)\n  if (!removedAll) {\n    return false\n  }\n\n  // we don't ever ACTUALLY try to unlink /, because that can never work\n  // but when preserveRoot is false, we could be operating on it.\n  // No need to check if preserveRoot is not false.\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n  if (opt.filter && !(await opt.filter(path, ent))) {\n    return false\n  }\n  await ignoreENOENT(tmpUnlink(path, opt.tmp, rmdir))\n  return true\n}\n\nconst tmpUnlink = async (\n  path: string,\n  tmp: string,\n  rm: (p: string) => Promise<any>,\n) => {\n  const tmpFile = resolve(tmp, uniqueFilename(path))\n  await rename(path, tmpFile)\n  return await rm(tmpFile)\n}\n\nexport const rimrafMoveRemoveSync = (path: string, opt: RimrafSyncOptions) => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  try {\n    return rimrafMoveRemoveDirSync(path, opt, lstatSync(path))\n  } catch (er) {\n    if ((er as NodeJS.ErrnoException)?.code === 'ENOENT') return true\n    throw er\n  }\n}\n\nconst rimrafMoveRemoveDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n): boolean => {\n  if (opt?.signal?.aborted) {\n    throw opt.signal.reason\n  }\n  if (!opt.tmp) {\n    return rimrafMoveRemoveDirSync(\n      path,\n      { ...opt, tmp: defaultTmpSync(path) },\n      ent,\n    )\n  }\n  const tmp: string = opt.tmp\n\n  if (path === opt.tmp && parse(path).root !== path) {\n    throw new Error('cannot delete temp directory used for deletion')\n  }\n\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (entries.code === 'ENOENT') {\n        return true\n      }\n      if (entries.code !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() => tmpUnlinkSync(path, tmp, unlinkFixEPERMSync))\n    return true\n  }\n\n  let removedAll = true\n  for (const ent of entries) {\n    const p = resolve(path, ent.name)\n    removedAll = rimrafMoveRemoveDirSync(p, opt, ent) && removedAll\n  }\n  if (!removedAll) {\n    return false\n  }\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n  if (opt.filter && !opt.filter(path, ent)) {\n    return false\n  }\n  ignoreENOENTSync(() => tmpUnlinkSync(path, tmp, rmdirSync))\n  return true\n}\n\nconst tmpUnlinkSync = (\n  path: string,\n  tmp: string,\n  rmSync: (p: string) => void,\n) => {\n  const tmpFile = resolve(tmp, uniqueFilename(path))\n  renameSync(path, tmpFile)\n  return rmSync(tmpFile)\n}\n", "// The default temporary folder location for use in the windows algorithm.\n// It's TEMPting to use dirname(path), since that's guaranteed to be on the\n// same device.  However, this means that:\n// rimraf(path).then(() => rimraf(dirname(path)))\n// will often fail with EBUSY, because the parent dir contains\n// marked-for-deletion directory entries (which do not show up in readdir).\n// The approach here is to use os.tmpdir() if it's on the same drive letter,\n// or resolve(path, '\\\\temp') if it exists, or the root of the drive if not.\n// On Posix (not that you'd be likely to use the windows algorithm there),\n// it uses os.tmpdir() always.\nimport { tmpdir } from 'os'\nimport { parse, resolve } from 'path'\nimport { promises, statSync } from './fs.js'\nimport platform from './platform.js'\nconst { stat } = promises\n\nconst isDirSync = (path: string) => {\n  try {\n    return statSync(path).isDirectory()\n  } catch (er) {\n    return false\n  }\n}\n\nconst isDir = (path: string) =>\n  stat(path).then(\n    st => st.isDirectory(),\n    () => false,\n  )\n\nconst win32DefaultTmp = async (path: string) => {\n  const { root } = parse(path)\n  const tmp = tmpdir()\n  const { root: tmpRoot } = parse(tmp)\n  if (root.toLowerCase() === tmpRoot.toLowerCase()) {\n    return tmp\n  }\n\n  const driveTmp = resolve(root, '/temp')\n  if (await isDir(driveTmp)) {\n    return driveTmp\n  }\n\n  return root\n}\n\nconst win32DefaultTmpSync = (path: string) => {\n  const { root } = parse(path)\n  const tmp = tmpdir()\n  const { root: tmpRoot } = parse(tmp)\n  if (root.toLowerCase() === tmpRoot.toLowerCase()) {\n    return tmp\n  }\n\n  const driveTmp = resolve(root, '/temp')\n  if (isDirSync(driveTmp)) {\n    return driveTmp\n  }\n\n  return root\n}\n\nconst posixDefaultTmp = async () => tmpdir()\nconst posixDefaultTmpSync = () => tmpdir()\n\nexport const defaultTmp =\n  platform === 'win32' ? win32DefaultTmp : posixDefaultTmp\nexport const defaultTmpSync =\n  platform === 'win32' ? win32DefaultTmpSync : posixDefaultTmpSync\n", "import platform from './platform.js'\n\nimport { rimrafPosix, rimrafPosixSync } from './rimraf-posix.js'\nimport { rimrafWindows, rimrafWindowsSync } from './rimraf-windows.js'\n\nexport const rimrafManual = platform === 'win32' ? rimrafWindows : rimrafPosix\nexport const rimrafManualSync =\n  platform === 'win32' ? rimrafWindowsSync : rimrafPosixSync\n", "import { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { promises, rmSync } from './fs.js'\nconst { rm } = promises\n\nexport const rimrafNative = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n): Promise<boolean> => {\n  await rm(path, {\n    ...opt,\n    force: true,\n    recursive: true,\n  })\n  return true\n}\n\nexport const rimrafNativeSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n): boolean => {\n  rmSync(path, {\n    ...opt,\n    force: true,\n    recursive: true,\n  })\n  return true\n}\n", "import { RimrafAsyncOptions, RimrafOptions } from './index.js'\nimport platform from './platform.js'\n\nconst version = process.env.__TESTING_RIMRAF_NODE_VERSION__ || process.version\nconst versArr = version.replace(/^v/, '').split('.')\n\n/* c8 ignore start */\nconst [major = 0, minor = 0] = versArr.map(v => parseInt(v, 10))\n/* c8 ignore stop */\nconst hasNative = major > 14 || (major === 14 && minor >= 14)\n\n// we do NOT use native by default on Windows, because Node's native\n// rm implementation is less advanced.  Change this code if that changes.\nexport const useNative: (opt?: RimrafAsyncOptions) => boolean =\n  !hasNative || platform === 'win32' ?\n    () => false\n  : opt => !opt?.signal && !opt?.filter\nexport const useNativeSync: (opt?: RimrafOptions) => boolean =\n  !hasNative || platform === 'win32' ?\n    () => false\n  : opt => !opt?.signal && !opt?.filter\n", "import { glob, globSync } from 'glob'\nimport {\n  optArg,\n  optArgSync,\n  RimrafAsyncOptions,\n  RimrafSyncOptions,\n} from './opt-arg.js'\nimport pathArg from './path-arg.js'\nimport { rimrafManual, rimrafManualSync } from './rimraf-manual.js'\nimport { rimrafMoveRemove, rimrafMoveRemoveSync } from './rimraf-move-remove.js'\nimport { rimrafNative, rimrafNativeSync } from './rimraf-native.js'\nimport { rimrafPosix, rimrafPosixSync } from './rimraf-posix.js'\nimport { rimrafWindows, rimrafWindowsSync } from './rimraf-windows.js'\nimport { useNative, useNativeSync } from './use-native.js'\n\nexport {\n  assertRimrafOptions,\n  isRimrafOptions,\n  type RimrafAsyncOptions,\n  type RimrafOptions,\n  type RimrafSyncOptions,\n} from './opt-arg.js'\n\nconst wrap =\n  (fn: (p: string, o: RimrafAsyncOptions) => Promise<boolean>) =>\n  async (\n    path: string | string[],\n    opt?: RimrafAsyncOptions,\n  ): Promise<boolean> => {\n    const options = optArg(opt)\n    if (options.glob) {\n      path = await glob(path, options.glob)\n    }\n    if (Array.isArray(path)) {\n      return !!(\n        await Promise.all(path.map(p => fn(pathArg(p, options), options)))\n      ).reduce((a, b) => a && b, true)\n    } else {\n      return !!(await fn(pathArg(path, options), options))\n    }\n  }\n\nconst wrapSync =\n  (fn: (p: string, o: RimrafSyncOptions) => boolean) =>\n  (path: string | string[], opt?: RimrafSyncOptions): boolean => {\n    const options = optArgSync(opt)\n    if (options.glob) {\n      path = globSync(path, options.glob)\n    }\n    if (Array.isArray(path)) {\n      return !!path\n        .map(p => fn(pathArg(p, options), options))\n        .reduce((a, b) => a && b, true)\n    } else {\n      return !!fn(pathArg(path, options), options)\n    }\n  }\n\nexport const nativeSync = wrapSync(rimrafNativeSync)\nexport const native = Object.assign(wrap(rimrafNative), { sync: nativeSync })\n\nexport const manualSync = wrapSync(rimrafManualSync)\nexport const manual = Object.assign(wrap(rimrafManual), { sync: manualSync })\n\nexport const windowsSync = wrapSync(rimrafWindowsSync)\nexport const windows = Object.assign(wrap(rimrafWindows), { sync: windowsSync })\n\nexport const posixSync = wrapSync(rimrafPosixSync)\nexport const posix = Object.assign(wrap(rimrafPosix), { sync: posixSync })\n\nexport const moveRemoveSync = wrapSync(rimrafMoveRemoveSync)\nexport const moveRemove = Object.assign(wrap(rimrafMoveRemove), {\n  sync: moveRemoveSync,\n})\n\nexport const rimrafSync = wrapSync((path, opt) =>\n  useNativeSync(opt) ?\n    rimrafNativeSync(path, opt)\n  : rimrafManualSync(path, opt),\n)\nexport const sync = rimrafSync\n\nconst rimraf_ = wrap((path, opt) =>\n  useNative(opt) ? rimrafNative(path, opt) : rimrafManual(path, opt),\n)\nexport const rimraf = Object.assign(rimraf_, {\n  rimraf: rimraf_,\n  sync: rimrafSync,\n  rimrafSync: rimrafSync,\n  manual,\n  manualSync,\n  native,\n  nativeSync,\n  posix,\n  posixSync,\n  windows,\n  windowsSync,\n  moveRemove,\n  moveRemoveSync,\n})\nrimraf.rimraf = rimraf\n", "import { resolve } from 'node:path'\nexport const __CODE_SPLIT_SCRIPT_NAME = resolve(\n  import.meta.dirname,\n  'rollback-remove/remove.js',\n)\n", "import { PackageInfoClient } from '@vltpkg/package-info'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport { load as loadActual, LoadOptions } from '../actual/load.js'\nimport {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.js'\nimport { Diff } from '../diff.js'\nimport { Graph } from '../graph.js'\nimport { lockfile } from '../index.js'\nimport {\n  lockfileData,\n  saveData,\n  saveHidden,\n} from '../lockfile/save.js'\nimport { addEdges } from './add-edges.js'\nimport { addNodes } from './add-nodes.js'\nimport { build } from './build.js'\nimport { deleteEdges } from './delete-edges.js'\nimport { deleteNodes } from './delete-nodes.js'\nimport { rollback } from './rollback.js'\nimport { updatePackageJson } from './update-importers-package-json.js'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (options: ReifyOptions) => {\n  const { graph, scurry } = options\n\n  const actual =\n    options.actual ??\n    loadActual({\n      ...options,\n      loadManifests: true,\n    })\n\n  const diff = new Diff(actual, graph)\n  const remover = new RollbackRemove()\n  let success = false\n  try {\n    await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n  } finally {\n    /* c8 ignore start */\n    if (!success) {\n      await rollback(remover, diff, scurry).catch(() => {})\n    }\n    /* c8 ignore stop */\n  }\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n) => {\n  const { packageInfo, packageJson, scurry } = options\n  const saveImportersPackageJson = updatePackageJson({\n    add: options.add,\n    remove: options.remove,\n    graph: options.graph,\n    packageJson,\n  })\n\n  // before anything else happens, grab the ideal tree as it was resolved\n  // so that we can store it in the lockfile. We do this here so that\n  // any failed/removed optional deps are not reflected in the lockfile\n  // data as it is saved.\n  const lfData = lockfileData(options)\n  const actions: (() => Promise<unknown>)[] = addNodes(\n    diff,\n    scurry,\n    remover,\n    options,\n    packageInfo,\n  ).concat(deleteEdges(diff, scurry, remover))\n\n  // need to wait, so that the nodes exist to link to\n  if (actions.length) await callLimit(actions, { limit })\n\n  // create all node_modules symlinks, and link bins to nm/.bin\n  const edgeActions: Promise<unknown>[] = addEdges(\n    diff,\n    packageJson,\n    scurry,\n    remover,\n  )\n  if (edgeActions.length) await Promise.all(edgeActions)\n\n  // run lifecycles and chmod bins\n  await build(diff, packageJson, scurry)\n\n  // save the lockfile\n  lockfile.save(options)\n\n  // if we had to change the actual graph along the way,\n  // make sure we do not leave behind any unreachable nodes\n  if (diff.hadOptionalFailures) {\n    for (const node of options.graph.gc().values()) {\n      diff.nodes.add.delete(node)\n      diff.nodes.delete.add(node)\n    }\n  }\n  saveHidden(options)\n\n  // delete garbage from the store.\n  const rmActions: Promise<unknown>[] = deleteNodes(\n    diff,\n    remover,\n    scurry,\n  )\n  if (rmActions.length) await Promise.all(rmActions)\n\n  // updates package.json files if anything was added / removed\n  saveImportersPackageJson()\n\n  // write the ideal graph data to the lockfile\n  saveData(lfData, scurry.resolve('vlt-lock.json'), false)\n}\n", "import * as os from 'node:os'\n// availableParallelism available only since node v19, for older versions use\n// cpus() cpus() can return an empty list if /proc is not mounted, use 1 in\n// this case\n\n/* c8 ignore start */\nconst defLimit =\n  'availableParallelism' in os ?\n    Math.max(1, os.availableParallelism() - 1)\n  : Math.max(1, (os as typeof import('node:os')).cpus().length - 1)\n/* c8 ignore stop */\n\nexport type Step<T> = () => Promise<T>\n\nexport type Options = {\n  limit?: number\n  rejectLate?: boolean\n}\n\nexport const callLimit = <T extends any>(\n  queue: Step<T>[],\n  { limit = defLimit, rejectLate }: Options = {},\n) =>\n  new Promise((res, rej) => {\n    let active = 0\n    let current = 0\n    const results: (T | void | Promise<void | T>)[] = []\n\n    // Whether or not we rejected, distinct from the rejection just in case the rejection itself is falsey\n    let rejected = false\n    let rejection: unknown\n    const reject = (er?: unknown) => {\n      if (rejected) return\n      rejected = true\n      rejection ??= er\n      if (!rejectLate) rej(rejection)\n    }\n\n    let resolved = false\n    const resolve = () => {\n      if (resolved || active > 0) return\n      resolved = true\n      res(results)\n    }\n\n    const run = () => {\n      const c = current++\n      if (c >= queue.length) return rejected ? reject() : resolve()\n\n      active++\n      const step = queue[c]\n      /* c8 ignore start */\n      if (!step) throw new Error('walked off queue')\n      /* c8 ignore stop */\n\n      results[c] = step()\n        .then(\n          result => {\n            active--\n            results[c] = result\n            return result\n          },\n          er => {\n            active--\n            reject(er)\n          },\n        )\n        .then(result => {\n          if (rejected && active === 0) return rej(rejection)\n          run()\n          return result\n        })\n    }\n\n    for (let i = 0; i < limit; i++) run()\n  })\n", "import { error } from '@vltpkg/error-cause'\nimport { InspectOptions } from 'node:util'\nimport { Edge } from './edge.js'\nimport { Graph } from './graph.js'\nimport { Node } from './node.js'\n\n// XXX should file deps *always* be considered changed?\n// unless the thing containing it wasn't possibly changed because it's inside\n// a dep that didn't change?\n// Same with remote deps\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * A Diff object is a representation of a set of changes from one\n * graph to another, typically from the actual graph as it is reified\n * on disk, to an intended ideal graph.\n *\n * The naming convention can get a bit confusing here, because it's a\n * set of directed changes from one set of directed objects to another.\n *\n * Within the context the Diff object, `from` is the Graph we're coming from,\n * and `to` is the Graph we're trying to create.\n */\nexport class Diff {\n  from: Graph\n  to: Graph\n\n  projectRoot: string\n\n  /**\n   * If changes need to be made later for failures of optional nodes,\n   * set this flag so that we know to call graph.gc() at the appropriate time.\n   */\n  hadOptionalFailures = false\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  nodes = {\n    /** Nodes in the `to` graph that are not in the `from` graph */\n    add: new Set<Node>(),\n    /** Nodes in the `from` graph that are not in the `to` graph */\n    delete: new Set<Node>(),\n  }\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  edges = {\n    /** Edges in the `to` graph that are not found in the `from` graph */\n    add: new Set<Edge>(),\n    /** Edges in the `from` graph that are not found in the `to` graph */\n    delete: new Set<Edge>(),\n  }\n\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Diff'\n  }\n\n  constructor(from: Graph, to: Graph) {\n    this.from = from\n    this.to = to\n    this.projectRoot = from.projectRoot\n    if (to.projectRoot !== from.projectRoot) {\n      throw error('projectRoot mismatch in Graph diff', {\n        wanted: from.projectRoot,\n        found: to.projectRoot,\n      })\n    }\n\n    for (const [id, node] of this.from.nodes) {\n      if (!this.to.nodes.get(id)?.equals(node)) {\n        this.nodes.delete.add(node)\n      }\n    }\n\n    for (const [id, node] of this.to.nodes) {\n      if (!this.from.nodes.get(id)?.equals(node)) {\n        this.nodes.add.add(node)\n      }\n    }\n\n    for (const edge of this.to.edges) {\n      // the node with this dep, in the from  graph\n      const fromNode = this.from.nodes.get(edge.from.id)\n      const fromEdge = fromNode?.edgesOut.get(edge.spec.name)\n      if (fromEdge?.to?.id === edge.to?.id) continue\n      if (fromEdge?.to) this.edges.delete.add(fromEdge)\n      if (edge.to) this.edges.add.add(edge)\n    }\n    for (const edge of this.from.edges) {\n      // the node with this dep, in the to graph\n      const toNode = this.to.nodes.get(edge.from.id)\n      const toEdge = toNode?.edgesOut.get(edge.spec.name)\n      if (toEdge?.to?.id === edge.to?.id) continue\n      if (edge.to) this.edges.delete.add(edge)\n      if (toEdge?.to) this.edges.add.add(toEdge)\n    }\n  }\n\n  [kCustomInspect](_: number, options?: InspectOptions): string {\n    const red: [string, string] =\n      options?.colors ? ['\\x1b[31m', '\\x1b[m'] : ['', '']\n    const green: [string, string] =\n      options?.colors ? ['\\x1b[32m', '\\x1b[m'] : ['', '']\n    const lines: string[] = []\n    for (const node of this.nodes.add) {\n      lines.push(`+ ${node.id}`)\n    }\n    for (const node of this.nodes.delete) {\n      lines.push(`- ${node.id}`)\n    }\n    for (const edge of this.edges.add) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `+ ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    for (const edge of this.edges.delete) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `- ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    const wrap = (s: string, c: [string, string]) => c.join(s)\n    const color =\n      options?.colors ?\n        (s: string) => wrap(s, s.startsWith('+') ? green : red)\n      : (s: string) => s\n\n    return `${this[Symbol.toStringTag]} {\n${lines\n  .sort((a, b) => a.substring(1).localeCompare(b.substring(1), 'en'))\n  .map(s => '  ' + color(s))\n  .join('\\n')}\n}`\n  }\n}\n", "import { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { Manifest } from '@vltpkg/types'\nimport { mkdir, symlink } from 'fs/promises'\nimport { dirname, relative } from 'path'\nimport { PathScurry } from 'path-scurry'\nimport { Edge } from '../edge.js'\nimport { binPaths } from './bin-paths.js'\n\nconst clobberSymlink = async (\n  target: string,\n  link: string,\n  remover: RollbackRemove,\n  type = 'file',\n) => {\n  await mkdir(dirname(link), { recursive: true })\n  try {\n    await symlink(target, link, type)\n  } catch (e) {\n    const er = e as NodeJS.ErrnoException\n    if (er.code === 'EEXIST') {\n      return remover.rm(link).then(() => symlink(target, link))\n      /* c8 ignore start */\n    } else {\n      throw er\n    }\n  }\n  /* c8 ignore stop */\n}\n\n/**\n * reify an edge into a node_modules folder, with bins linked\n * this does NOT chmod the bins to 0o777, because they might not exist\n * until scripts are run, in the case of non-store deps like workspaces\n */\nexport const addEdge = async (\n  edge: Edge,\n  manifest: Manifest,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n) => {\n  if (!edge.to) return\n  const binRoot = scurry.resolve(edge.from.nodeModules, '.bin')\n  const path = scurry.resolve(edge.from.nodeModules, edge.spec.name)\n  const promises: Promise<unknown>[] = []\n  const target = relative(\n    dirname(path),\n    scurry.resolve(edge.to.location),\n  )\n  promises.push(clobberSymlink(target, path, remover, 'dir'))\n  const bp = binPaths(manifest)\n  for (const [key, val] of Object.entries(bp)) {\n    const link = scurry.resolve(binRoot, key)\n    const target = relative(binRoot, scurry.resolve(path, val))\n    // TODO: bash/cmd/pwsh shims on Windows\n    promises.push(clobberSymlink(target, link, remover))\n  }\n  await Promise.all(promises)\n}\n", "import { error } from '@vltpkg/error-cause'\nimport { parse, Range, satisfies, Version } from '@vltpkg/semver'\nimport { Spec } from '@vltpkg/spec'\nimport {\n  Manifest,\n  Packument,\n  RevDoc,\n  RevDocEntry,\n} from '@vltpkg/types'\n\nconst parsedNodeVersion = Version.parse(process.version)\n\nexport type PickManifestOptions = {\n  tag?: string\n  before?: Date | number | string\n  'node-version'?: string\n  os?: NodeJS.Platform\n  arch?: NodeJS.Architecture\n}\n\nexport type Manifestish = Manifest | RevDocEntry\nexport type Packumentish = Packument | RevDoc\nexport type PickManifestish<T extends Packumentish> =\n  T extends RevDoc ? RevDocEntry : Manifest\nexport type ManiCheck<T extends Packumentish> = {\n  version: Version\n  deprecated: boolean\n  platform: boolean\n  prerelease: boolean\n  mani: PickManifestish<T>\n}\n\nconst isBefore = (\n  version: string,\n  before?: number,\n  verTimes?: Record<string, string>,\n): boolean => {\n  if (!verTimes || !version || !before) return true\n  const time = version && verTimes[version]\n  return !!time && Date.parse(time) <= before\n}\n\nconst checkList = (value: string, list?: string[] | string) => {\n  if (typeof list === 'string') {\n    list = [list]\n  }\n  // invalid list is equivalent to 'any'\n  if (!Array.isArray(list)) return true\n  if (list.length === 1 && list[0] === 'any') {\n    return true\n  }\n  // match none of the negated values, and at least one of the\n  // non-negated values, if any are present.\n  let negated = 0\n  let match = false\n  for (const entry of list) {\n    const negate = entry.startsWith('!')\n    const test = negate ? entry.slice(1) : entry\n    if (negate) {\n      negated++\n      if (value === test) {\n        return false\n      }\n    } else {\n      match = match || value === test\n    }\n  }\n  return match || negated === list.length\n}\n\n/**\n * Call with a manifest and the node version and process platform/arch\n * to check whether a version is suitable for the current platform.\n */\nexport const platformCheck = (\n  mani: Manifestish,\n  nodeVersion: Version | string,\n  wantOs?: NodeJS.Process['platform'],\n  wantArch?: NodeJS.Process['arch'],\n): boolean => {\n  const { engines, os, cpu } = mani\n  if (engines) {\n    const { node } = engines\n    if (node && !satisfies(nodeVersion, node, true)) {\n      return false\n    }\n  }\n  if (wantOs && !checkList(wantOs, os)) return false\n  if (wantArch && !checkList(wantArch, cpu)) return false\n  return true\n}\n\nconst versionOk = (\n  packument: Packumentish,\n  version: string,\n  nodeVersion: Version,\n  os: NodeJS.Process['platform'],\n  arch: NodeJS.Process['arch'],\n  before?: number,\n) => {\n  const mani = packument.versions[version]\n  /* c8 ignore next */\n  if (!mani) return false\n  const { time } = packument\n  return (\n    isBefore(version, before, time) &&\n    platformCheck(mani, nodeVersion, os, arch)\n  )\n}\n\n/**\n * Choose the most appropriate manifest from a packument.\n *\n * If `before` is set in the options, then the packument MUST\n * be a full non-minified Packument object. Otherwise, a minified packument\n * is fine.\n */\nexport function pickManifest<T extends Packumentish>(\n  packument: T,\n  wanted: Range | Spec | string,\n  opts: PickManifestOptions = {},\n): PickManifestish<T> | undefined {\n  const {\n    tag = 'latest',\n    before,\n    'node-version': nodeVersion,\n    os = process.platform,\n    arch = process.arch,\n  } = opts\n  const nv =\n    !nodeVersion ? parsedNodeVersion : Version.parse(nodeVersion)\n\n  // cast since 'time' might not be present on minified packuments\n  const {\n    name,\n    time: verTimes,\n    versions = {},\n    'dist-tags': distTags = {},\n  } = packument\n\n  const time = before && verTimes ? +new Date(before) : Infinity\n  let range: Range | undefined = undefined\n  let spec: Spec | undefined = undefined\n  if (typeof wanted === 'object') {\n    if (wanted instanceof Spec) {\n      const f = wanted.final\n      range = f.range\n      spec = f\n    } else {\n      range = wanted\n    }\n  } else {\n    spec = Spec.parse(`${name}@${wanted}`).final\n    range = spec.range\n  }\n\n  if (!range) {\n    if (!spec?.distTag) {\n      throw error(\n        'Only dist-tag or semver range specs are supported',\n        { spec },\n      )\n    }\n    // if there is an explicit dist tag, we must get that version.\n    const ver = distTags[spec.distTag]\n    if (!ver) return undefined\n    // if the version in the dist-tags is before the before date, then\n    // we use that.  Otherwise, we get the highest precedence version\n    // prior to the dist-tag.\n    const mani = versions[ver]\n    if (mani && versionOk(packument, ver, nv, os, arch, time)) {\n      return mani as PickManifestish<T>\n    } else {\n      range = new Range(`<=${ver}`)\n    }\n  }\n\n  if (range.isAny) range = new Range('*', true)\n\n  // if the range is *, then we prefer the 'latest' if available\n  // but skip this if it should be avoided, in that case we have\n  // to try a little harder.\n  const defaultVer = distTags[tag]\n  const defTagVersion =\n    defaultVer ? Version.parse(defaultVer) : undefined\n  if (\n    defaultVer &&\n    (range.isAny || defTagVersion?.satisfies(range)) &&\n    versionOk(packument, defaultVer, nv, os, arch, time)\n  ) {\n    return versions[defaultVer] as PickManifestish<T>\n  }\n\n  // ok, actually have to scan the list\n  const entries = Object.entries(versions)\n\n  if (!entries.length) {\n    return undefined\n  }\n\n  let found: ManiCheck<T> | undefined = undefined\n  let foundIsDefTag = false\n\n  for (const [ver, mani] of entries) {\n    if (time && verTimes && !isBefore(ver, time, verTimes)) {\n      continue\n    }\n    const version = parse(ver)\n    if (!version?.satisfies(range)) {\n      continue\n    }\n    const mc = {\n      version,\n      deprecated: !!mani.deprecated,\n      platform: platformCheck(mani, nv, os, arch),\n      prerelease: !!version.prerelease?.length,\n      mani,\n    }\n    if (!found) {\n      found = mc\n      if (defTagVersion?.equals(found.version)) {\n        foundIsDefTag = true\n      }\n      continue\n    }\n\n    const mok = !mc.deprecated && mc.platform\n    const fok = !found.deprecated && found.platform\n\n    if (mok !== fok) {\n      if (mok) {\n        found = mc\n        foundIsDefTag = !!defTagVersion?.equals(mc.version)\n      }\n    } else if (mc.platform !== found.platform) {\n      if (mc.platform) {\n        found = mc\n        foundIsDefTag = !!defTagVersion?.equals(mc.version)\n      }\n    } else if (mc.deprecated !== found.deprecated) {\n      if (!mc.deprecated) {\n        found = mc\n        /* c8 ignore next */\n        foundIsDefTag = !!defTagVersion?.equals(mc.version)\n      }\n    } else if (found.prerelease !== mc.prerelease) {\n      if (!mc.prerelease) {\n        found = mc\n        /* c8 ignore next */\n        foundIsDefTag = !!defTagVersion?.equals(mc.version)\n      }\n    } else if (defTagVersion?.equals(mc.version)) {\n      found = mc\n      foundIsDefTag = true\n    } else if (\n      mc.version.greaterThan(found.version) &&\n      !foundIsDefTag\n    ) {\n      found = mc\n    }\n  }\n  return found?.mani\n}\n", "import { error } from '@vltpkg/error-cause'\nimport {\n  ChildProcess,\n  IOType,\n  spawn,\n  SpawnOptions,\n  StdioOptions,\n} from 'child_process'\n\nconst isPipe = (\n  stdio:\n    | Exclude<StdioOptions, IOType>[number]\n    | StdioOptions = 'pipe',\n  fd: number,\n): stdio is IOTypePipe =>\n  stdio === 'pipe' || stdio === 'overlapped' || stdio === null ? true\n  : Array.isArray(stdio) ? isPipe(stdio[fd], fd)\n  : false\n\nexport type IOTypeNoPipe = Exclude<IOType, IOTypePipe>\nexport type IOTypePipe = 'overlapped' | 'pipe' | null | undefined\nexport type PromiseSpawnOptions = SpawnOptions & {\n  stdioString?: boolean\n  acceptFail?: boolean\n}\nexport type PromiseSpawnOptionsString = PromiseSpawnOptions & {\n  stdioString?: true\n}\nexport type PromiseSpawnOptionsBuffer = PromiseSpawnOptions & {\n  stdioString: false\n}\nexport type PromiseSpawnOptionsStdin = PromiseSpawnOptions & {\n  stdio?:\n    | Exclude<IOTypePipe, null>\n    | [\n        stdin?: IOTypePipe,\n        stdout?: Exclude<StdioOptions, IOType>[number],\n        stderr?: Exclude<StdioOptions, IOType>[number],\n      ]\n}\nexport type PromiseSpawnOptionsNoStdin = PromiseSpawnOptions & {\n  stdio:\n    | IOTypeNoPipe\n    | IOTypeNoPipe[]\n    | [\n        stdin: IOTypeNoPipe | number,\n        stdout?: Exclude<StdioOptions, IOType>[number],\n        stderr?: Exclude<StdioOptions, IOType>[number],\n      ]\n}\nexport type PromiseSpawnOptionsStdout = PromiseSpawnOptions & {\n  stdio?:\n    | Exclude<IOTypePipe, null>\n    | [\n        stdin: Exclude<StdioOptions, IOType>[number] | undefined,\n        stdout?: IOTypePipe,\n        stderr?: Exclude<StdioOptions, IOType>[number],\n      ]\n}\nexport type PromiseSpawnOptionsStdoutString =\n  PromiseSpawnOptionsStdout & {\n    stdioString?: true\n  }\nexport type PromiseSpawnOptionsStdoutBuffer =\n  PromiseSpawnOptionsStdout & {\n    stdioString: false\n  }\nexport type PromiseSpawnOptionsNoStdout = PromiseSpawnOptions & {\n  stdio:\n    | IOTypeNoPipe\n    | IOTypeNoPipe[]\n    | [\n        stdin: Exclude<StdioOptions, IOType>[number] | undefined,\n        stdout?: IOTypeNoPipe,\n        stderr?: Exclude<StdioOptions, IOType>[number],\n      ]\n}\n/* c8 ignore start - weird windows coverage bug */\nexport type PromiseSpawnOptionsStderr = PromiseSpawnOptions & {\n  stdio?:\n    | Exclude<IOTypePipe, null>\n    | [\n        stdin: Exclude<StdioOptions, IOType>[number] | undefined,\n        stdout: Exclude<StdioOptions, IOType>[number] | undefined,\n        stderr?: IOTypePipe,\n      ]\n}\n/* c8 ignore stop */\nexport type PromiseSpawnOptionsStderrString =\n  PromiseSpawnOptionsStderr & {\n    stdioString?: true\n  }\nexport type PromiseSpawnOptionsStderrBuffer =\n  PromiseSpawnOptionsStderr & {\n    stdioString: false\n  }\nexport type PromiseSpawnOptionsNoStderr = PromiseSpawnOptions & {\n  stdio:\n    | IOTypeNoPipe\n    | IOTypeNoPipe[]\n    | [\n        stdin: Exclude<StdioOptions, IOType>[number] | undefined,\n        stdout: Exclude<StdioOptions, IOType>[number] | undefined,\n        stderr: IOTypeNoPipe,\n      ]\n}\n\nfunction stdioResult<O extends PromiseSpawnOptions>(\n  stdout: Buffer[],\n  stderr: Buffer[],\n  o: O,\n): {\n  stdout: SpawnResultByOptions<O>['stdout']\n  stderr: SpawnResultByOptions<O>['stderr']\n} {\n  return {\n    stdout: (!isPipe(o.stdio, 1) ? null\n    : o.stdioString !== false ?\n      Buffer.concat(stdout).toString().trim()\n    : Buffer.concat(stdout)) as SpawnResultByOptions<O>['stdout'],\n    stderr: (!isPipe(o.stdio, 2) ? null\n    : o.stdioString !== false ?\n      Buffer.concat(stderr).toString().trim()\n    : Buffer.concat(stderr)) as SpawnResultByOptions<O>['stderr'],\n  }\n}\n\nexport type SpawnResult = {\n  command: string\n  args: string[]\n  cwd: string\n  status: number | null\n  signal: NodeJS.Signals | null\n  stdout: Buffer | string | null\n  stderr: Buffer | string | null\n}\nexport type SpawnResultString = SpawnResult & {\n  stdout: string | null\n  stderr: string | null\n}\nexport type SpawnResultBuffer = SpawnResult & {\n  stdout: Buffer | null\n  stderr: Buffer | null\n}\nexport type SpawnResultStdout = SpawnResult & {\n  stdout: Buffer | string\n}\nexport type SpawnResultStdoutString = SpawnResultString & {\n  stdout: string\n}\nexport type SpawnResultStdoutBuffer = SpawnResultBuffer & {\n  stdout: Buffer\n}\nexport type SpawnResultNoStdout = SpawnResult & {\n  stdout: null\n}\nexport type SpawnResultStderr = SpawnResult & {\n  stderr: Buffer | string\n}\nexport type SpawnResultStderrString = SpawnResultString & {\n  stderr: string\n}\nexport type SpawnResultStderrBuffer = SpawnResultBuffer & {\n  stderr: Buffer\n}\nexport type SpawnResultNoStderr = SpawnResult & {\n  stderr: null\n}\n\nexport type SpawnResultNoStdio = SpawnResult & {\n  stderr: null\n  stdout: null\n}\nexport type SpawnResultStdioStrings = SpawnResult & {\n  stdout: string\n  stderr: string\n}\nexport type SpawnResultStdioBuffers = SpawnResult & {\n  stdout: Buffer\n  stderr: Buffer\n}\n\nexport type SpawnResultByOptions<T extends PromiseSpawnOptions> =\n  SpawnResult & {\n    stdout: T extends PromiseSpawnOptionsNoStdout ? null\n    : T extends PromiseSpawnOptionsStdoutBuffer ? Buffer\n    : T extends PromiseSpawnOptionsStdoutString ? string\n    : T extends PromiseSpawnOptionsBuffer ? Buffer | null\n    : T extends PromiseSpawnOptionsString ? string | null\n    : Buffer | string | null\n    stderr: T extends PromiseSpawnOptionsNoStderr ? null\n    : T extends PromiseSpawnOptionsStderrBuffer ? Buffer\n    : T extends PromiseSpawnOptionsStderrString ? string\n    : T extends PromiseSpawnOptionsBuffer ? Buffer | null\n    : T extends PromiseSpawnOptionsString ? string | null\n    : Buffer | string | null\n  }\n\nexport type ChildProcessByOptions<T extends PromiseSpawnOptions> =\n  ChildProcess & {\n    stdin: T extends PromiseSpawnOptionsNoStdin ? null\n    : Exclude<ChildProcess['stdin'], null>\n    stdout: T extends PromiseSpawnOptionsNoStdout ? null\n    : Exclude<ChildProcess['stdout'], null>\n    stderr: T extends PromiseSpawnOptionsNoStderr ? null\n    : Exclude<ChildProcess['stderr'], null>\n  }\n\n/**\n * Subtype of Promise returned by {@link spawnPromise}.\n *\n * Resolution value is inferred from the provided options.\n */\nexport class SpawnPromise<\n  O extends PromiseSpawnOptions,\n  T extends object = object,\n> extends Promise<SpawnResultByOptions<O> & T> {\n  [Symbol.toStringTag] = 'SpawnPromise'\n\n  /** The spawned process this promise references */\n  process!: ChildProcessByOptions<O>\n\n  /** Expose the child process stdin, if available */\n  stdin!: ChildProcessByOptions<O>['stdin']\n\n  /**\n   * Set static `Symbol.species` back to the base Promise class so that\n   * v8 doesn't get confused by the changed constructor signature.\n   */\n  static get [Symbol.species]() {\n    return Promise\n  }\n\n  constructor(\n    command: string,\n    args: string[],\n    opts: O,\n    extra: T = {} as T,\n  ) {\n    let proc!: ChildProcessByOptions<O>\n    super((res, rej) => {\n      proc = spawn(command, args, opts) as ChildProcessByOptions<O>\n      const stdout: Buffer[] = []\n      const stderr: Buffer[] = []\n      const reject = (er: Error) =>\n        rej(\n          error('command failed', {\n            command,\n            args,\n            cwd: opts.cwd ?? process.cwd(),\n            ...stdioResult(stdout, stderr, opts),\n            ...extra,\n            cause: er,\n          }),\n        )\n      proc.on('error', reject)\n      if (proc.stdout) {\n        proc.stdout\n          .on('data', c => stdout.push(c))\n          .on('error', er => reject(er))\n      }\n      if (proc.stderr) {\n        proc.stderr\n          .on('data', c => stderr.push(c))\n          .on('error', er => reject(er))\n      }\n      proc.on('close', (status, signal) => {\n        const result = {\n          command,\n          args,\n          cwd: opts.cwd ?? process.cwd(),\n          /* c8 ignore next 2 - because windows */\n          status: status ?? null,\n          signal: signal ?? null,\n          ...stdioResult(stdout, stderr, opts),\n          ...extra,\n        } as SpawnResultByOptions<O> & T\n        if ((status || signal) && !opts.acceptFail)\n          rej(error('command failed', result))\n        else res(result)\n      })\n    })\n    this.process = proc\n    this.stdin = proc.stdin\n  }\n}\n\n/**\n * Spawn the specified command, and return a promise that resolves when\n * the process closes or has an error.\n */\nexport function promiseSpawn<\n  O extends PromiseSpawnOptions = PromiseSpawnOptionsStderrString &\n    PromiseSpawnOptionsStdoutString,\n  E extends object = object,\n>(command: string, args: string[], opts = {} as O, extra = {} as E) {\n  return new SpawnPromise<O, E>(command, args, opts, extra)\n}\n", "import {\n  ChildProcessByStdio,\n  SendHandle,\n  Serializable,\n  spawn as nodeSpawn,\n  SpawnOptions,\n  ChildProcess,\n} from 'child_process'\nimport crossSpawn from 'cross-spawn'\nimport { onExit } from 'signal-exit'\nimport { proxySignals } from './proxy-signals.js'\nimport { watchdog } from './watchdog.js'\n\n/* c8 ignore start */\nconst spawn = process?.platform === 'win32' ? crossSpawn : nodeSpawn\n/* c8 ignore stop */\n\n/**\n * The signature for the cleanup method.\n *\n * Arguments indicate the exit status of the child process.\n *\n * If a Promise is returned, then the process is not terminated\n * until it resolves, and the resolution value is treated as the\n * exit status (if a number) or signal exit (if a signal string).\n *\n * If `undefined` is returned, then no change is made, and the parent\n * exits in the same way that the child exited.\n *\n * If boolean `false` is returned, then the parent's exit is canceled.\n *\n * If a number is returned, then the parent process exits with the number\n * as its exitCode.\n *\n * If a signal string is returned, then the parent process is killed with\n * the same signal that caused the child to exit.\n */\nexport type Cleanup = (\n  code: number | null,\n  signal: null | NodeJS.Signals,\n  processInfo: {\n    watchdogPid?: ChildProcess['pid']\n  },\n) =>\n  | void\n  | undefined\n  | number\n  | NodeJS.Signals\n  | false\n  | Promise<void | undefined | number | NodeJS.Signals | false>\n\nexport type FgArgs =\n  | [program: string | [cmd: string, ...args: string[]], cleanup?: Cleanup]\n  | [\n      program: [cmd: string, ...args: string[]],\n      opts?: SpawnOptions,\n      cleanup?: Cleanup,\n    ]\n  | [program: string, cleanup?: Cleanup]\n  | [program: string, opts?: SpawnOptions, cleanup?: Cleanup]\n  | [program: string, args?: string[], cleanup?: Cleanup]\n  | [\n      program: string,\n      args?: string[],\n      opts?: SpawnOptions,\n      cleanup?: Cleanup,\n    ]\n\n/**\n * Normalizes the arguments passed to `foregroundChild`.\n *\n * Exposed for testing.\n *\n * @internal\n */\nexport const normalizeFgArgs = (\n  fgArgs: FgArgs,\n): [\n  program: string,\n  args: string[],\n  spawnOpts: SpawnOptions,\n  cleanup: Cleanup,\n] => {\n  let [program, args = [], spawnOpts = {}, cleanup = () => {}] = fgArgs\n  if (typeof args === 'function') {\n    cleanup = args\n    spawnOpts = {}\n    args = []\n  } else if (!!args && typeof args === 'object' && !Array.isArray(args)) {\n    if (typeof spawnOpts === 'function') cleanup = spawnOpts\n    spawnOpts = args\n    args = []\n  } else if (typeof spawnOpts === 'function') {\n    cleanup = spawnOpts\n    spawnOpts = {}\n  }\n  if (Array.isArray(program)) {\n    const [pp, ...pa] = program\n    program = pp\n    args = pa\n  }\n  return [program, args, { ...spawnOpts }, cleanup]\n}\n\n/**\n * Spawn the specified program as a \"foreground\" process, or at least as\n * close as is possible given node's lack of exec-without-fork.\n *\n * Cleanup method may be used to modify or ignore the result of the child's\n * exit code or signal. If cleanup returns undefined (or a Promise that\n * resolves to undefined), then the parent will exit in the same way that\n * the child did.\n *\n * Return boolean `false` to prevent the parent's exit entirely.\n */\nexport function foregroundChild(\n  cmd: string | [cmd: string, ...args: string[]],\n  cleanup?: Cleanup,\n): ChildProcessByStdio<null, null, null>\nexport function foregroundChild(\n  program: string,\n  args?: string[],\n  cleanup?: Cleanup,\n): ChildProcessByStdio<null, null, null>\nexport function foregroundChild(\n  program: string,\n  spawnOpts?: SpawnOptions,\n  cleanup?: Cleanup,\n): ChildProcessByStdio<null, null, null>\nexport function foregroundChild(\n  program: string,\n  args?: string[],\n  spawnOpts?: SpawnOptions,\n  cleanup?: Cleanup,\n): ChildProcessByStdio<null, null, null>\nexport function foregroundChild(\n  ...fgArgs: FgArgs\n): ChildProcessByStdio<null, null, null> {\n  const [program, args, spawnOpts, cleanup] = normalizeFgArgs(fgArgs)\n\n  spawnOpts.stdio = [0, 1, 2]\n  if (process.send) {\n    spawnOpts.stdio.push('ipc')\n  }\n\n  const child = spawn(program, args, spawnOpts) as ChildProcessByStdio<\n    null,\n    null,\n    null\n  >\n\n  const childHangup = () => {\n    try {\n      child.kill('SIGHUP')\n\n      /* c8 ignore start */\n    } catch (_) {\n      // SIGHUP is weird on windows\n      child.kill('SIGTERM')\n    }\n    /* c8 ignore stop */\n  }\n  const removeOnExit = onExit(childHangup)\n\n  proxySignals(child)\n  const dog = watchdog(child)\n\n  let done = false\n  child.on('close', async (code, signal) => {\n    /* c8 ignore start */\n    if (done) return\n    /* c8 ignore stop */\n    done = true\n    const result = cleanup(code, signal, {\n      watchdogPid: dog.pid,\n    })\n    const res = isPromise(result) ? await result : result\n    removeOnExit()\n\n    if (res === false) return\n    else if (typeof res === 'string') {\n      signal = res\n      code = null\n    } else if (typeof res === 'number') {\n      code = res\n      signal = null\n    }\n\n    if (signal) {\n      // If there is nothing else keeping the event loop alive,\n      // then there's a race between a graceful exit and getting\n      // the signal to this process.  Put this timeout here to\n      // make sure we're still alive to get the signal, and thus\n      // exit with the intended signal code.\n      /* istanbul ignore next */\n      setTimeout(() => {}, 2000)\n      try {\n        process.kill(process.pid, signal)\n        /* c8 ignore start */\n      } catch (_) {\n        process.kill(process.pid, 'SIGTERM')\n      }\n      /* c8 ignore stop */\n    } else {\n      process.exit(code || 0)\n    }\n  })\n\n  if (process.send) {\n    process.removeAllListeners('message')\n\n    child.on('message', (message, sendHandle) => {\n      process.send?.(message, sendHandle)\n    })\n\n    process.on('message', (message, sendHandle) => {\n      child.send(\n        message as Serializable,\n        sendHandle as SendHandle | undefined,\n      )\n    })\n  }\n\n  return child\n}\n\nconst isPromise = (o: any): o is Promise<any> =>\n  !!o && typeof o === 'object' && typeof o.then === 'function'\n", "/**\n * This is not the set of all possible signals.\n *\n * It IS, however, the set of all signals that trigger\n * an exit on either Linux or BSD systems.  Linux is a\n * superset of the signal names supported on BSD, and\n * the unknown signals just fail to register, so we can\n * catch that easily enough.\n *\n * Windows signals are a different set, since there are\n * signals that terminate Windows processes, but don't\n * terminate (or don't even exist) on Posix systems.\n *\n * Don't bother with SIGKILL.  It's uncatchable, which\n * means that we can't fire any callbacks anyway.\n *\n * If a user does happen to register a handler on a non-\n * fatal signal like SIGWINCH or something, and then\n * exit, it'll end up firing `process.emit('exit')`, so\n * the handler will be fired anyway.\n *\n * SIGBUS, SIGFPE, SIGSEGV and SIGILL, when not raised\n * artificially, inherently leave the process in a\n * state from which it is not safe to try and enter JS\n * listeners.\n */\nexport const signals: NodeJS.Signals[] = []\nsignals.push('SIGHUP', 'SIGINT', 'SIGTERM')\n\nif (process.platform !== 'win32') {\n  signals.push(\n    'SIGALRM',\n    'SIGABRT',\n    'SIGVTALRM',\n    'SIGXCPU',\n    'SIGXFSZ',\n    'SIGUSR2',\n    'SIGTRAP',\n    'SIGSYS',\n    'SIGQUIT',\n    'SIGIOT'\n    // should detect profiler and enable/disable accordingly.\n    // see #21\n    // 'SIGPROF'\n  )\n}\n\nif (process.platform === 'linux') {\n  signals.push('SIGIO', 'SIGPOLL', 'SIGPWR', 'SIGSTKFLT')\n}\n", "// Note: since nyc uses this module to output coverage, any lines\n// that are in the direct sync flow of nyc's outputCoverage are\n// ignored, since we can never get coverage for them.\n// grab a reference to node's real process object right away\nimport { signals } from './signals.js'\nexport { signals }\n\n// just a loosened process type so we can do some evil things\ntype ProcessRE = NodeJS.Process & {\n  reallyExit: (code?: number | undefined | null) => any\n  emit: (ev: string, ...a: any[]) => any\n}\n\nconst processOk = (process: any): process is ProcessRE =>\n  !!process &&\n  typeof process === 'object' &&\n  typeof process.removeListener === 'function' &&\n  typeof process.emit === 'function' &&\n  typeof process.reallyExit === 'function' &&\n  typeof process.listeners === 'function' &&\n  typeof process.kill === 'function' &&\n  typeof process.pid === 'number' &&\n  typeof process.on === 'function'\n\nconst kExitEmitter = Symbol.for('signal-exit emitter')\nconst global: typeof globalThis & { [kExitEmitter]?: Emitter } = globalThis\nconst ObjectDefineProperty = Object.defineProperty.bind(Object)\n\n/**\n * A function that takes an exit code and signal as arguments\n *\n * In the case of signal exits *only*, a return value of true\n * will indicate that the signal is being handled, and we should\n * not synthetically exit with the signal we received. Regardless\n * of the handler return value, the handler is unloaded when an\n * otherwise fatal signal is received, so you get exactly 1 shot\n * at it, unless you add another onExit handler at that point.\n *\n * In the case of numeric code exits, we may already have committed\n * to exiting the process, for example via a fatal exception or\n * unhandled promise rejection, so it is impossible to stop safely.\n */\nexport type Handler = (\n  code: number | null | undefined,\n  signal: NodeJS.Signals | null\n) => true | void\ntype ExitEvent = 'afterExit' | 'exit'\ntype Emitted = { [k in ExitEvent]: boolean }\ntype Listeners = { [k in ExitEvent]: Handler[] }\n\n// teeny special purpose ee\nclass Emitter {\n  emitted: Emitted = {\n    afterExit: false,\n    exit: false,\n  }\n\n  listeners: Listeners = {\n    afterExit: [],\n    exit: [],\n  }\n\n  count: number = 0\n  id: number = Math.random()\n\n  constructor() {\n    if (global[kExitEmitter]) {\n      return global[kExitEmitter]\n    }\n    ObjectDefineProperty(global, kExitEmitter, {\n      value: this,\n      writable: false,\n      enumerable: false,\n      configurable: false,\n    })\n  }\n\n  on(ev: ExitEvent, fn: Handler) {\n    this.listeners[ev].push(fn)\n  }\n\n  removeListener(ev: ExitEvent, fn: Handler) {\n    const list = this.listeners[ev]\n    const i = list.indexOf(fn)\n    /* c8 ignore start */\n    if (i === -1) {\n      return\n    }\n    /* c8 ignore stop */\n    if (i === 0 && list.length === 1) {\n      list.length = 0\n    } else {\n      list.splice(i, 1)\n    }\n  }\n\n  emit(\n    ev: ExitEvent,\n    code: number | null | undefined,\n    signal: NodeJS.Signals | null\n  ): boolean {\n    if (this.emitted[ev]) {\n      return false\n    }\n    this.emitted[ev] = true\n    let ret: boolean = false\n    for (const fn of this.listeners[ev]) {\n      ret = fn(code, signal) === true || ret\n    }\n    if (ev === 'exit') {\n      ret = this.emit('afterExit', code, signal) || ret\n    }\n    return ret\n  }\n}\n\nabstract class SignalExitBase {\n  abstract onExit(cb: Handler, opts?: { alwaysLast?: boolean }): () => void\n  abstract load(): void\n  abstract unload(): void\n}\n\nconst signalExitWrap = <T extends SignalExitBase>(handler: T) => {\n  return {\n    onExit(cb: Handler, opts?: { alwaysLast?: boolean }) {\n      return handler.onExit(cb, opts)\n    },\n    load() {\n      return handler.load()\n    },\n    unload() {\n      return handler.unload()\n    },\n  }\n}\n\nclass SignalExitFallback extends SignalExitBase {\n  onExit() {\n    return () => {}\n  }\n  load() {}\n  unload() {}\n}\n\nclass SignalExit extends SignalExitBase {\n  // \"SIGHUP\" throws an `ENOSYS` error on Windows,\n  // so use a supported signal instead\n  /* c8 ignore start */\n  #hupSig = process.platform === 'win32' ? 'SIGINT' : 'SIGHUP'\n  /* c8 ignore stop */\n  #emitter = new Emitter()\n  #process: ProcessRE\n  #originalProcessEmit: ProcessRE['emit']\n  #originalProcessReallyExit: ProcessRE['reallyExit']\n\n  #sigListeners: { [k in NodeJS.Signals]?: () => void } = {}\n  #loaded: boolean = false\n\n  constructor(process: ProcessRE) {\n    super()\n    this.#process = process\n    // { <signal>: <listener fn>, ... }\n    this.#sigListeners = {}\n    for (const sig of signals) {\n      this.#sigListeners[sig] = () => {\n        // If there are no other listeners, an exit is coming!\n        // Simplest way: remove us and then re-send the signal.\n        // We know that this will kill the process, so we can\n        // safely emit now.\n        const listeners = this.#process.listeners(sig)\n        let { count } = this.#emitter\n        // This is a workaround for the fact that signal-exit v3 and signal\n        // exit v4 are not aware of each other, and each will attempt to let\n        // the other handle it, so neither of them do. To correct this, we\n        // detect if we're the only handler *except* for previous versions\n        // of signal-exit, and increment by the count of listeners it has\n        // created.\n        /* c8 ignore start */\n        const p = process as unknown as {\n          __signal_exit_emitter__?: { count: number }\n        }\n        if (\n          typeof p.__signal_exit_emitter__ === 'object' &&\n          typeof p.__signal_exit_emitter__.count === 'number'\n        ) {\n          count += p.__signal_exit_emitter__.count\n        }\n        /* c8 ignore stop */\n        if (listeners.length === count) {\n          this.unload()\n          const ret = this.#emitter.emit('exit', null, sig)\n          /* c8 ignore start */\n          const s = sig === 'SIGHUP' ? this.#hupSig : sig\n          if (!ret) process.kill(process.pid, s)\n          /* c8 ignore stop */\n        }\n      }\n    }\n\n    this.#originalProcessReallyExit = process.reallyExit\n    this.#originalProcessEmit = process.emit\n  }\n\n  onExit(cb: Handler, opts?: { alwaysLast?: boolean }) {\n    /* c8 ignore start */\n    if (!processOk(this.#process)) {\n      return () => {}\n    }\n    /* c8 ignore stop */\n\n    if (this.#loaded === false) {\n      this.load()\n    }\n\n    const ev = opts?.alwaysLast ? 'afterExit' : 'exit'\n    this.#emitter.on(ev, cb)\n    return () => {\n      this.#emitter.removeListener(ev, cb)\n      if (\n        this.#emitter.listeners['exit'].length === 0 &&\n        this.#emitter.listeners['afterExit'].length === 0\n      ) {\n        this.unload()\n      }\n    }\n  }\n\n  load() {\n    if (this.#loaded) {\n      return\n    }\n    this.#loaded = true\n\n    // This is the number of onSignalExit's that are in play.\n    // It's important so that we can count the correct number of\n    // listeners on signals, and don't wait for the other one to\n    // handle it instead of us.\n    this.#emitter.count += 1\n\n    for (const sig of signals) {\n      try {\n        const fn = this.#sigListeners[sig]\n        if (fn) this.#process.on(sig, fn)\n      } catch (_) {}\n    }\n\n    this.#process.emit = (ev: string, ...a: any[]) => {\n      return this.#processEmit(ev, ...a)\n    }\n    this.#process.reallyExit = (code?: number | null | undefined) => {\n      return this.#processReallyExit(code)\n    }\n  }\n\n  unload() {\n    if (!this.#loaded) {\n      return\n    }\n    this.#loaded = false\n\n    signals.forEach(sig => {\n      const listener = this.#sigListeners[sig]\n      /* c8 ignore start */\n      if (!listener) {\n        throw new Error('Listener not defined for signal: ' + sig)\n      }\n      /* c8 ignore stop */\n      try {\n        this.#process.removeListener(sig, listener)\n        /* c8 ignore start */\n      } catch (_) {}\n      /* c8 ignore stop */\n    })\n    this.#process.emit = this.#originalProcessEmit\n    this.#process.reallyExit = this.#originalProcessReallyExit\n    this.#emitter.count -= 1\n  }\n\n  #processReallyExit(code?: number | null | undefined) {\n    /* c8 ignore start */\n    if (!processOk(this.#process)) {\n      return 0\n    }\n    this.#process.exitCode = code || 0\n    /* c8 ignore stop */\n\n    this.#emitter.emit('exit', this.#process.exitCode, null)\n    return this.#originalProcessReallyExit.call(\n      this.#process,\n      this.#process.exitCode\n    )\n  }\n\n  #processEmit(ev: string, ...args: any[]): any {\n    const og = this.#originalProcessEmit\n    if (ev === 'exit' && processOk(this.#process)) {\n      if (typeof args[0] === 'number') {\n        this.#process.exitCode = args[0]\n        /* c8 ignore start */\n      }\n      /* c8 ignore start */\n      const ret = og.call(this.#process, ev, ...args)\n      /* c8 ignore start */\n      this.#emitter.emit('exit', this.#process.exitCode, null)\n      /* c8 ignore stop */\n      return ret\n    } else {\n      return og.call(this.#process, ev, ...args)\n    }\n  }\n}\n\nconst process = globalThis.process\n// wrap so that we call the method on the actual handler, without\n// exporting it directly.\nexport const {\n  /**\n   * Called when the process is exiting, whether via signal, explicit\n   * exit, or running out of stuff to do.\n   *\n   * If the global process object is not suitable for instrumentation,\n   * then this will be a no-op.\n   *\n   * Returns a function that may be used to unload signal-exit.\n   */\n  onExit,\n\n  /**\n   * Load the listeners.  Likely you never need to call this, unless\n   * doing a rather deep integration with signal-exit functionality.\n   * Mostly exposed for the benefit of testing.\n   *\n   * @internal\n   */\n  load,\n\n  /**\n   * Unload the listeners.  Likely you never need to call this, unless\n   * doing a rather deep integration with signal-exit functionality.\n   * Mostly exposed for the benefit of testing.\n   *\n   * @internal\n   */\n  unload,\n} = signalExitWrap(\n  processOk(process) ? new SignalExit(process) : new SignalExitFallback()\n)\n", "import constants from 'node:constants'\nexport const allSignals =\n  // this is the full list of signals that Node will let us do anything with\n  Object.keys(constants).filter(\n    k =>\n      k.startsWith('SIG') &&\n      // https://github.com/tapjs/signal-exit/issues/21\n      k !== 'SIGPROF' &&\n      // no sense trying to listen for SIGKILL, it's impossible\n      k !== 'SIGKILL',\n  ) as NodeJS.Signals[]\n\n// These are some obscure signals that are reported by kill -l\n// on macOS, Linux, or Windows, but which don't have any mapping\n// in Node.js. No sense trying if they're just going to throw\n// every time on every platform.\n//\n// 'SIGEMT',\n// 'SIGLOST',\n// 'SIGPOLL',\n// 'SIGRTMAX',\n// 'SIGRTMAX-1',\n// 'SIGRTMAX-10',\n// 'SIGRTMAX-11',\n// 'SIGRTMAX-12',\n// 'SIGRTMAX-13',\n// 'SIGRTMAX-14',\n// 'SIGRTMAX-15',\n// 'SIGRTMAX-2',\n// 'SIGRTMAX-3',\n// 'SIGRTMAX-4',\n// 'SIGRTMAX-5',\n// 'SIGRTMAX-6',\n// 'SIGRTMAX-7',\n// 'SIGRTMAX-8',\n// 'SIGRTMAX-9',\n// 'SIGRTMIN',\n// 'SIGRTMIN+1',\n// 'SIGRTMIN+10',\n// 'SIGRTMIN+11',\n// 'SIGRTMIN+12',\n// 'SIGRTMIN+13',\n// 'SIGRTMIN+14',\n// 'SIGRTMIN+15',\n// 'SIGRTMIN+16',\n// 'SIGRTMIN+2',\n// 'SIGRTMIN+3',\n// 'SIGRTMIN+4',\n// 'SIGRTMIN+5',\n// 'SIGRTMIN+6',\n// 'SIGRTMIN+7',\n// 'SIGRTMIN+8',\n// 'SIGRTMIN+9',\n// 'SIGSTKFLT',\n// 'SIGUNUSED',\n", "// this spawns a child process that listens for SIGHUP when the\n// parent process exits, and after 200ms, sends a SIGKILL to the\n// child, in case it did not terminate.\n\nimport { ChildProcess, spawn } from 'child_process'\n\nconst watchdogCode = String.raw`\nconst pid = parseInt(process.argv[1], 10)\nprocess.title = 'node (foreground-child watchdog pid=' + pid + ')'\nif (!isNaN(pid)) {\n  let barked = false\n  // keepalive\n  const interval = setInterval(() => {}, 60000)\n  const bark = () => {\n    clearInterval(interval)\n    if (barked) return\n    barked = true\n    process.removeListener('SIGHUP', bark)\n    setTimeout(() => {\n      try {\n        process.kill(pid, 'SIGKILL')\n        setTimeout(() => process.exit(), 200)\n      } catch (_) {}\n    }, 500)\n  })\n  process.on('SIGHUP', bark)\n}\n`\n\n/**\n * Pass in a ChildProcess, and this will spawn a watchdog process that\n * will make sure it exits if the parent does, thus preventing any\n * dangling detached zombie processes.\n *\n * If the child ends before the parent, then the watchdog will terminate.\n */\nexport const watchdog = (child: ChildProcess) => {\n  let dogExited = false\n  const dog = spawn(\n    process.execPath,\n    ['-e', watchdogCode, String(child.pid)],\n    {\n      stdio: 'ignore',\n    },\n  )\n  dog.on('exit', () => (dogExited = true))\n  child.on('exit', () => {\n    if (!dogExited) dog.kill('SIGKILL')\n  })\n  return dog\n}\n", "import { dirname, resolve } from 'path'\nexport const walkUp = function* (path: string) {\n  for (path = resolve(path); path;) {\n    yield path\n    const pp = dirname(path)\n    if (pp === path) {\n      break\n    } else {\n      path = pp\n    }\n  }\n}\n", "// walk the graph of added nodes, building and chmoding their bins\n// at the end, we get back to the importers, and run their prepare\n// script as well as install script.\n\nimport { PackageJson } from '@vltpkg/package-json'\nimport { run } from '@vltpkg/run'\nimport { statSync } from 'fs'\nimport { chmod } from 'fs/promises'\nimport { graphRun } from 'graph-run'\nimport { PathScurry } from 'path-scurry'\nimport { Diff } from '../diff.js'\nimport { Node } from '../node.js'\nimport { nonEmptyList } from '../non-empty-list.js'\nimport { binPaths } from './bin-paths.js'\nimport { optionalFail } from './optional-fail.js'\n\nexport const build = async (\n  diff: Diff,\n  packageJson: PackageJson,\n  scurry: PathScurry,\n) => {\n  const graph = diff.to\n  const nodes = nonEmptyList([...graph.importers])\n  /* c8 ignore next - all graphs have at least one importer */\n  if (!nodes) return\n\n  await graphRun<Node, unknown>({\n    graph: nodes,\n    visit: async (node: Node, signal, path) => {\n      // if it's not an importer or an added node, nothing to do.\n      // TODO: only build importers if it has changed deps, there's never\n      // been a previous build, or it contains something newer than the\n      // most recent build.\n      // For now, just always build all importers, because we don't\n      // track all that other stuff.\n      if (!node.importer && !diff.nodes.add.has(node)) return\n\n      await visit(packageJson, scurry, node, signal, path).then(\n        x => x,\n        optionalFail(diff, node),\n      )\n    },\n\n    getDeps: node => {\n      const deps: Node[] = []\n      for (const { to } of node.edgesOut.values()) {\n        /* c8 ignore next - vanishingly unlikely in practice */\n        if (to) deps.push(to)\n      }\n      return deps\n    },\n  })\n}\n\nconst visit = async (\n  packageJson: PackageJson,\n  scurry: PathScurry,\n  node: Node,\n  signal: AbortSignal,\n  _path: Node[],\n): Promise<void> => {\n  node.manifest ??= packageJson.read(scurry.resolve(node.location))\n  const { manifest } = node\n  const { scripts = {} } = manifest\n\n  const {\n    install,\n    preinstall,\n    postinstall,\n    prepare,\n    preprepare,\n    postprepare,\n  } = scripts\n\n  // if it has install script, run it\n  const runInstall = !!(install || preinstall || postinstall)\n  if (runInstall) {\n    await run({\n      signal,\n      arg0: 'install',\n      ignoreMissing: true,\n      packageJson,\n      cwd: node.location,\n      projectRoot: node.projectRoot,\n      manifest,\n    })\n  }\n\n  // if it's an importer or git, run prepare\n  const prepable =\n    node.id.startsWith('git') || node.importer || !node.inVltStore()\n  const runPrepare =\n    !!(prepare || preprepare || postprepare) && prepable\n\n  if (runPrepare) {\n    await run({\n      signal,\n      arg0: 'prepare',\n      ignoreMissing: true,\n      packageJson,\n      cwd: node.location,\n      projectRoot: node.projectRoot,\n      manifest,\n    })\n  }\n\n  const chmods: Promise<unknown>[] = []\n  for (const bin of Object.values(binPaths(manifest))) {\n    const path = scurry.resolve(node.location, bin)\n    chmods.push(makeExecutable(path))\n  }\n  await Promise.all(chmods)\n}\n\n// 0 is \"not yet set\"\n// This is defined by doing `0o111 | <mode>` so that systems\n// that create files group-writable result in 0o775 instead of 0o755\nlet execMode = 0\nconst makeExecutable = async (path: string) => {\n  if (!execMode) {\n    execMode = (statSync(path).mode & 0o777) | 0o111\n  }\n  await chmod(path, execMode)\n}\n", "import { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { PathScurry } from 'path-scurry'\nimport { Edge } from '../edge.js'\nimport { binPaths } from './bin-paths.js'\n\nconst rmBinPosix = (remover: RollbackRemove, bin: string) => {\n  return [remover.rm(bin)]\n}\n\nconst rmBinWin32 = (remover: RollbackRemove, bin: string) => {\n  return [\n    remover.rm(bin),\n    remover.rm(bin + '.cmd'),\n    remover.rm(bin + '.pwsh'),\n  ]\n}\n\nconst rmBin = process.platform === 'win32' ? rmBinWin32 : rmBinPosix\n\nexport const deleteEdge = async (\n  edge: Edge,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n) => {\n  const {\n    spec: { name },\n    to,\n  } = edge\n  const nm = edge.from.nodeModules\n  const path = scurry.resolve(nm, name)\n  const binRoot = scurry.cwd.resolve(`${nm}/.bin`)\n  const promises: Promise<unknown>[] = []\n  promises.push(remover.rm(path))\n  const manifest = to?.manifest\n  if (manifest) {\n    for (const key of Object.keys(binPaths(manifest))) {\n      const bin = binRoot.resolve(key).fullpath()\n      promises.push(...rmBin(remover, bin))\n    }\n  }\n  await Promise.all(promises)\n}\n", "export * from './edge.js'\nexport * from './graph.js'\nexport * from './node.js'\nexport * from './dependencies.js'\nexport * from './lockfile/types.js'\nexport * from './visualization/json-output.js'\nexport * from './visualization/human-readable-output.js'\nexport * from './visualization/mermaid-output.js'\nexport * from './stringify-node.js'\nexport * from './types.js'\n\nimport { load as actualLoad } from './actual/load.js'\nexport const actual = { load: actualLoad }\n\nimport { load as lockfileLoad } from './lockfile/load.js'\nimport { loadEdges } from './lockfile/load-edges.js'\nimport { loadNodes } from './lockfile/load-nodes.js'\nimport { save } from './lockfile/save.js'\nexport const lockfile = {\n  load: lockfileLoad,\n  loadEdges,\n  loadNodes,\n  save,\n}\n\nimport type { LoadOptions as ActualLoadOptions } from './actual/load.js'\nimport type { LoadOptions as LockfileLoadOptions } from './lockfile/load.js'\nexport type { ActualLoadOptions, LockfileLoadOptions }\nexport type { SaveOptions } from './lockfile/save.js'\n\nimport { BuildIdealOptions, build } from './ideal/build.js'\nexport type { BuildIdealOptions }\nexport const ideal = { build }\nexport { reify } from './reify/index.js'\nexport type { ReifyOptions } from './reify/index.js'\n", "import { error } from '@vltpkg/error-cause'\nimport type { EdgeLike, GraphLike, NodeLike } from '@vltpkg/graph'\nimport postcssSelectorParser from 'postcss-selector-parser'\nimport { attribute } from './attribute.js'\nimport { classFn } from './class.js'\nimport { combinator } from './combinator.js'\nimport { id } from './id.js'\nimport { pseudo } from './pseudo.js'\nimport {\n  type PostcssNodeWithChildren,\n  type ParserState,\n  type ParserFn,\n  isPostcssNodeWithChildren,\n  asPostcssNodeWithChildren,\n  isSelectorNode,\n  QueryResponse,\n} from './types.js'\n\nexport * from './types.js'\n\nconst noopFn = async (state: ParserState) => state\n\nconst selectors = {\n  attribute,\n  class: classFn,\n  combinator,\n  comment: noopFn,\n  id,\n  nesting: noopFn,\n  pseudo,\n  root: noopFn,\n  selector: async (state: ParserState) => {\n    state.partial.nodes = new Set(state.initial.nodes)\n    state.partial.edges = new Set(state.initial.edges)\n    return state\n  },\n  string: async (state: ParserState) => {\n    throw error('Unsupported selector', { found: state.current })\n  },\n  tag: async (state: ParserState) => {\n    if (state.current.value !== '{' && state.current.value !== '}') {\n      throw error('Unsupported selector', { found: state.current })\n    }\n    return state\n  },\n  universal: noopFn,\n}\nconst selectorsMap = new Map<string, ParserFn>(\n  Object.entries(selectors),\n)\n\nexport const walk = async (\n  state: ParserState,\n): Promise<ParserState> => {\n  const parserFn = selectorsMap.get(state.current.type)\n\n  if (!parserFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(\n      `Missing parser for query node: ${state.current.type}`,\n    )\n  }\n  state = await parserFn(state)\n\n  // pseudo selectors handle their own sub selectors\n  if (\n    isPostcssNodeWithChildren(state.current) &&\n    state.current.type !== 'pseudo'\n  ) {\n    const node: PostcssNodeWithChildren = asPostcssNodeWithChildren(\n      state.current,\n    )\n\n    if (node.nodes.length) {\n      for (let i = 0; i < node.nodes.length; i++) {\n        const current = node.nodes[i]\n        /* c8 ignore next -- impossible but TS doesn't know that */\n        if (!current) continue\n\n        const childState: ParserState = {\n          ...state,\n          current,\n          next: node.nodes[i + 1],\n          prev: node.nodes[i - 1],\n        }\n        state = await walk(childState)\n      }\n    }\n\n    if (isSelectorNode(node)) {\n      for (const edge of state.partial.edges) {\n        state.collect.edges.add(edge)\n      }\n      for (const node of state.partial.nodes) {\n        state.collect.nodes.add(node)\n      }\n    }\n  }\n  return state\n}\n\nexport type QueryOptions = {\n  graph: GraphLike\n}\n\nexport class Query {\n  #cache: Map<string, QueryResponse>\n  #graph: GraphLike\n\n  constructor({ graph }: QueryOptions) {\n    this.#cache = new Map()\n    this.#graph = graph\n  }\n\n  async search(query: string): Promise<QueryResponse> {\n    if (typeof query !== 'string') {\n      throw new TypeError(\n        'Query search argument needs to be a string',\n      )\n    }\n\n    if (!query) return { edges: [], nodes: [] }\n\n    const cachedResult = this.#cache.get(query)\n    if (cachedResult) {\n      return cachedResult\n    }\n\n    const nodes = new Set<NodeLike>(\n      Array.from(this.#graph.nodes.values()),\n    )\n    const edges = new Set<EdgeLike>(Array.from(this.#graph.edges))\n\n    // builds initial state and walks over it,\n    // retrieving the collected result\n    const { collect } = await walk({\n      current: postcssSelectorParser().astSync(query),\n      initial: {\n        nodes: new Set(nodes),\n        edges: new Set(edges),\n      },\n      collect: {\n        nodes: new Set<NodeLike>(),\n        edges: new Set<EdgeLike>(),\n      },\n      partial: { nodes, edges },\n      walk,\n    })\n\n    const res: QueryResponse = {\n      edges: Array.from(collect.edges),\n      nodes: Array.from(collect.nodes),\n    }\n    this.#cache.set(query, res)\n    return res\n  }\n}\n", "import { error } from '@vltpkg/error-cause'\nimport type { EdgeLike, NodeLike } from '@vltpkg/graph'\nimport type {\n  Tag,\n  String,\n  Selector,\n  Root,\n  Pseudo,\n  Nesting,\n  Identifier,\n  Comment,\n  Combinator,\n  ClassName,\n  Attribute,\n  Universal,\n} from 'postcss-selector-parser'\n\nexport type PostcssNode =\n  | Tag\n  | String\n  | Selector\n  | Root\n  | Pseudo\n  | Nesting\n  | Identifier\n  | Comment\n  | Combinator\n  | ClassName\n  | Attribute\n  | Universal\n\nexport type PostcssNodeWithChildren = Selector | Root | Pseudo\n\nexport type GraphSelectionState = {\n  nodes: Set<NodeLike>\n  edges: Set<EdgeLike>\n}\n\nexport type ParserState = {\n  collect: GraphSelectionState\n  current: PostcssNode\n  initial: GraphSelectionState\n  loose?: boolean\n  next?: PostcssNode\n  prev?: PostcssNode\n  result?: NodeLike[]\n  walk: ParserFn\n  partial: GraphSelectionState\n}\n\nexport type QueryResponse = {\n  edges: EdgeLike[]\n  nodes: NodeLike[]\n}\n\nexport type ParserFn = (opt: ParserState) => Promise<ParserState>\n\nexport const isPostcssNodeWithChildren = (\n  node: any,\n): node is PostcssNodeWithChildren =>\n  'type' in node && 'nodes' in node\n\nexport const asPostcssNodeWithChildren = (\n  node?: PostcssNode,\n): PostcssNodeWithChildren => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isPostcssNodeWithChildren(node)) {\n    throw error('Not a query selector node with children', {\n      found: node,\n    })\n  }\n  return node\n}\n\nexport const isAttributeNode = (node: any): node is Attribute =>\n  node.attribute && node.type === 'attribute'\n\nexport const asAttributeNode = (node?: PostcssNode): Attribute => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isAttributeNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'attribute',\n      found: node.type,\n    })\n  }\n  return node\n}\n\nexport const isClassNode = (node: any): node is ClassName =>\n  node.value && node.type === 'class'\n\nexport const asClassNode = (node?: PostcssNode): ClassName => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isClassNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'class',\n      found: node.type,\n    })\n  }\n  return node\n}\n\nexport const isCombinatorNode = (node: any): node is Combinator =>\n  node.value && node.type === 'combinator'\n\nexport const asCombinatorNode = (node?: PostcssNode): Combinator => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isCombinatorNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'combinator',\n      found: node.type,\n    })\n  }\n  return node\n}\n\nexport const isIdentifierNode = (node: any): node is Identifier =>\n  node.value && node.type === 'id'\n\nexport const asIdentifierNode = (node?: PostcssNode): Identifier => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isIdentifierNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'id',\n      found: node.type,\n    })\n  }\n  return node\n}\n\nexport const isSelectorNode = (node: any): node is Selector =>\n  isPostcssNodeWithChildren(node) && node.type === 'selector'\n\nexport const isPseudoNode = (node: any): node is Pseudo =>\n  node.value && node.type === 'pseudo'\n\nexport const asPseudoNode = (node?: PostcssNode): Pseudo => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isPseudoNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'pseudo',\n      found: node.type,\n    })\n  }\n  return node\n}\n\nexport const isTagNode = (node: any): node is Tag =>\n  node.value && node.type === 'tag'\n\nexport const asTagNode = (node?: PostcssNode): Tag => {\n  if (!node) {\n    throw error('Expected a query node')\n  }\n\n  if (!isTagNode(node)) {\n    throw error('Mismatching query node', {\n      wanted: 'tag',\n      found: node.type,\n    })\n  }\n\n  return node\n}\n", "import { error } from '@vltpkg/error-cause'\nimport type { NodeLike } from '@vltpkg/graph'\nimport type { JSONField } from '@vltpkg/types'\nimport { asAttributeNode, ParserState } from './types.js'\n\nexport type ComparatorFn = (attr: string, value?: string) => boolean\n\n/**\n * Retrieve the {@link Manifest} values found at the given `properties`\n * location for a given {@link Node}.\n */\nexport const getManifestPropertyValues = (\n  node: NodeLike,\n  properties: string[],\n  attribute: string,\n): string[] | undefined => {\n  if (!node.manifest) return\n\n  const traverse = new Set<JSONField>([node.manifest as JSONField])\n  const props = new Set<JSONField>()\n  for (const key of properties) {\n    for (const prop of traverse) {\n      /* c8 ignore start - should be impossible */\n      if (!prop) {\n        throw error('failed to find nested property in :attr', {\n          found: properties,\n        })\n      }\n      /* c8 ignore stop */\n\n      // expand the result list to include nested array values\n      if (Array.isArray(prop)) {\n        for (const p of prop) {\n          traverse.add(p)\n        }\n        continue\n      }\n\n      // guard for inspecting keys of objects next\n      if (\n        typeof prop === 'string' ||\n        typeof prop === 'number' ||\n        typeof prop === 'boolean'\n      ) {\n        continue\n      }\n\n      // assign next value when found\n      if (key in prop) {\n        const nextValue = prop[key]\n        if (nextValue) {\n          if (key === attribute) {\n            props.add(nextValue)\n          } else {\n            traverse.delete(prop)\n            traverse.add(nextValue)\n          }\n        }\n      }\n    }\n  }\n  // if no value was found after trying a given key\n  // then there's nothing to be collected\n  if (!props.size) return\n\n  // expand the result to include array values\n  const collect = new Set<string>()\n  for (const prop of props) {\n    if (Array.isArray(prop)) {\n      for (const p of prop) {\n        collect.add(p ? String(p) : '')\n      }\n    } else {\n      collect.add(String(prop))\n    }\n  }\n\n  return [...collect]\n}\n\n// decorator style of function that will filter `ParserState` results\n// based on a provided `comparator` function\nexport const filterAttributes = (\n  state: ParserState,\n  comparator: ComparatorFn | undefined,\n  value: string,\n  propertyName: string,\n  insensitive: boolean,\n  prefixProperties: string[] = [],\n): ParserState => {\n  const check = (attr: JSONField) =>\n    comparator?.(\n      insensitive ? String(attr).toLowerCase() : String(attr),\n      insensitive ? value.toLowerCase() : value,\n    )\n  const deleteNode = (node: NodeLike) => {\n    for (const edge of node.edgesIn) {\n      state.partial.edges.delete(edge)\n    }\n    state.partial.nodes.delete(node)\n  }\n\n  for (const node of state.partial.nodes) {\n    const prefixes =\n      prefixProperties.length ? prefixProperties : [propertyName]\n    const attrs = getManifestPropertyValues(\n      node,\n      prefixes,\n      propertyName,\n    )\n\n    // if no attribute value was found, that means the attribute won't match\n    if (!attrs?.length) {\n      deleteNode(node)\n      continue\n    }\n\n    // if the node attribute value won't match, then remove the node\n    if (comparator && !attrs.some(check)) {\n      deleteNode(node)\n    }\n  }\n\n  for (const edge of state.partial.edges) {\n    // edge.name is a special case in order\n    // to be able to match missing nodes by name\n    if (propertyName === 'name' && check(edge.name)) {\n      continue\n    }\n    // remove any remaining dangling edge\n    if (!edge.to) {\n      state.partial.edges.delete(edge)\n    }\n  }\n  return state\n}\n\n// ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Attribute_selectors\nconst attributeSelectors: Record<string, ComparatorFn> = {\n  '=': (attr: string, value = '') => attr === value,\n  '^=': (attr: string, value = '') => attr.startsWith(value),\n  '$=': (attr: string, value = '') => attr.endsWith(value),\n  '~=': (attr: string, value = '') =>\n    new Set<string>(attr.match(/\\w+/g)).has(value),\n  '*=': (attr: string, value = '') => attr.includes(value),\n  '|=': (attr: string, value = '') =>\n    attr === value || attr.startsWith(`${value}-`),\n  undefined: (attr: string) => !!attr,\n}\nexport const attributeSelectorsMap = new Map<string, ComparatorFn>(\n  Object.entries(attributeSelectors),\n)\n\n/**\n * Parse attributes selectors, e.g: `[name]`, `[name=value]`, etc\n */\nexport const attribute = async (\n  state: ParserState,\n): Promise<ParserState> => {\n  const curr = asAttributeNode(state.current)\n  const operatorFn = attributeSelectorsMap.get(String(curr.operator))\n  if (!operatorFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(\n      `Unsupported attribute operator: ${curr.operator}`,\n    )\n  }\n\n  const value = curr.value || ''\n  const propertyName = curr.attribute\n  const insensitive = !!curr.insensitive\n  return filterAttributes(\n    state,\n    operatorFn,\n    value,\n    propertyName,\n    insensitive,\n  )\n}\n", "import { ParserFn, asClassNode, type ParserState } from './types.js'\n\nconst classSelectors: Record<string, ParserFn> = {\n  prod: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'prod' || edge.from.dev) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  dev: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'dev' && !edge.from.dev) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  optional: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'optional' && !edge.from.optional) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  peer: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'peer') {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      for (const e of node.edgesIn) {\n        if (!state.partial.edges.has(e)) {\n          state.partial.nodes.delete(node)\n        }\n      }\n    }\n    return state\n  },\n  workspace: async (state: ParserState) => {\n    for (const node of state.partial.nodes) {\n      if (!node.importer || node.mainImporter) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    for (const edge of state.partial.edges) {\n      // workspaces can't be missing\n      if (!edge.to) {\n        state.partial.edges.delete(edge)\n        // keep only edges that are linking to preivously kept nodes\n      } else if (!state.partial.nodes.has(edge.to)) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    return state\n  },\n  // TBD: all things bundled\n  // bundled: () => false,\n}\n\nconst classSelectorsMap = new Map<string, ParserFn>(\n  Object.entries(classSelectors),\n)\n\n/**\n * Parse classes, e.g: `.prod`, `.dev`, `.optional`, etc\n */\nexport const classFn = async (state: ParserState) => {\n  const curr = asClassNode(state.current)\n  const comparatorFn = curr.value && classSelectorsMap.get(curr.value)\n  if (!comparatorFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(`Unsupported class: ${state.current.value}`)\n  }\n  return comparatorFn(state)\n}\n", "import type { EdgeLike, NodeLike } from '@vltpkg/graph'\nimport {\n  type ParserState,\n  type ParserFn,\n  asCombinatorNode,\n} from './types.js'\n\n/**\n * Returns a new set of nodes, containing all direct dependencies\n * of the current list of nodes used.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Child_combinator\n */\nconst childCombinator = async (state: ParserState) => {\n  const traverse = new Set(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // visit direct children of the current list of nodes\n  // collecting refs to these children and the edges that\n  // connected them.\n  for (const node of traverse) {\n    for (const edge of node.edgesOut.values()) {\n      if (edge.to) {\n        state.partial.edges.add(edge)\n        state.partial.nodes.add(edge.to)\n      }\n    }\n  }\n\n  return state\n}\n\n/**\n * Returns a new set of nodes, containing nodes that are also children\n * of all parent nodes to the current list of nodes used.\n *\n * Note: The subsequent-sibling comparator has a behavior that is\n * somehow approximative of that of its css counterpart, given that\n * in the context of dependency graphs the order of appearance is\n * not necessarily controlled by the end user. The approach for\n * this comparator is to match all siblings of a node.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Subsequent-sibling_combinator\n */\nconst subsequentSiblingCombinator = async (state: ParserState) => {\n  const traverse = new Set(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // visits direct parents of the current list of node and then\n  // visit their children, collecting refs to all children and edges\n  // that are not in the original list of nodes.\n  for (const node of traverse) {\n    for (const edge of node.edgesIn) {\n      const parents: IterableIterator<EdgeLike> =\n        edge.from.edgesOut.values()\n      for (const edge of parents) {\n        if (edge.to && edge.to !== node) {\n          state.partial.edges.add(edge)\n          state.partial.nodes.add(edge.to)\n        }\n      }\n    }\n  }\n\n  return state\n}\n\n/**\n * Returns a new set of nodes containing all nodes that are descendents\n * to items in the current list of nodes.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Descendant_combinator\n */\nconst descendentCombinator = async (state: ParserState) => {\n  // spaces between tags selectors are a noop\n  if (state.prev?.type === 'tag' || state.next?.type === 'tag') {\n    return state\n  }\n\n  const traverse = new Set<NodeLike>(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // breadth-first traversal of the graph, starting from the current\n  // list of nodes, collecting all nodes and edges along the way\n  for (const node of traverse) {\n    const children = new Set<NodeLike>()\n    for (const edge of node.edgesOut.values()) {\n      if (edge.to) {\n        children.add(edge.to)\n        state.partial.edges.add(edge)\n        state.partial.nodes.add(edge.to)\n      }\n    }\n    for (const child of children) {\n      traverse.add(child)\n    }\n  }\n\n  return state\n}\n\nconst combinatorSelectors = {\n  '>': childCombinator,\n  '~': subsequentSiblingCombinator,\n  ' ': descendentCombinator,\n}\n\nconst combinatorSelectorsMap = new Map<string, ParserFn>(\n  Object.entries(combinatorSelectors),\n)\n\n/**\n * Parse css-style combinators, e.g: `>`, `~` and ` `\n */\nexport const combinator = async (state: ParserState) => {\n  const curr = asCombinatorNode(state.current)\n  const parserFn =\n    curr.value && combinatorSelectorsMap.get(curr.value)\n  if (!parserFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(`Unsupported combinator: ${state.current.value}`)\n  }\n  return parserFn(state)\n}\n", "import { error } from '@vltpkg/error-cause'\nimport { asIdentifierNode, type ParserState } from './types.js'\nimport {\n  attributeSelectorsMap,\n  filterAttributes,\n} from './attribute.js'\n\n/**\n * Parse ids, e.g: `#foo`\n */\nexport const id = async (state: ParserState) => {\n  const { value } = asIdentifierNode(state.current)\n  const comparator = attributeSelectorsMap.get('=')\n\n  /* c8 ignore start - should not be possible */\n  if (!value) {\n    throw error('Missing identifier name')\n  }\n  if (!comparator) {\n    throw error('Could not find attribute selector comparator')\n  }\n  /* c8 ignore stop */\n\n  return filterAttributes(state, comparator, value, 'name', true)\n}\n", "import { splitDepID } from '@vltpkg/dep-id/browser'\nimport { error } from '@vltpkg/error-cause'\nimport type { EdgeLike, NodeLike } from '@vltpkg/graph'\nimport { asManifest } from '@vltpkg/types'\nimport {\n  attributeSelectorsMap,\n  filterAttributes,\n} from './attribute.js'\nimport {\n  asAttributeNode,\n  asPostcssNodeWithChildren,\n  asPseudoNode,\n  asTagNode,\n  isSelectorNode,\n  ParserFn,\n  ParserState,\n  PostcssNode,\n} from './types.js'\n\nexport type AttrInternals = {\n  attribute: string\n  insensitive: boolean\n  operator?: string\n  value?: string\n  properties: string[]\n}\n\nconst removeNode = (state: ParserState, node: NodeLike) => {\n  for (const edge of node.edgesIn) {\n    state.partial.edges.delete(edge)\n  }\n  state.partial.nodes.delete(node)\n}\n\nconst removeDanglingEdges = (state: ParserState) => {\n  for (const edge of state.partial.edges) {\n    if (!edge.to) {\n      state.partial.edges.delete(edge)\n    }\n  }\n}\n\n/**\n * Parses the internal / nested selectors of a `:attr` selector.\n */\nconst parseAttrInternals = (nodes: PostcssNode[]): AttrInternals => {\n  // the last part is the attribute selector\n  const attributeSelector = asAttributeNode(\n    asPostcssNodeWithChildren(nodes.pop()).nodes[0],\n  )\n  // all preppending selectors are naming nested properties\n  const properties: string[] = []\n  for (const selector of nodes) {\n    properties.push(\n      asTagNode(asPostcssNodeWithChildren(selector).nodes[0]).value,\n    )\n  }\n  // include the attribute selector as the last part of the property lookup\n  properties.push(attributeSelector.attribute)\n\n  return {\n    attribute: attributeSelector.attribute,\n    insensitive: attributeSelector.insensitive || false,\n    operator: attributeSelector.operator,\n    value: attributeSelector.value,\n    properties,\n  }\n}\n\n/**\n * :attr Pseudo-Selector, allows for retrieving nodes based on nested\n * properties of the `package.json` metadata.\n */\nconst attr = async (state: ParserState) => {\n  // Parses and retrieves the values for the nested selectors\n  let internals\n  try {\n    internals = parseAttrInternals(\n      asPostcssNodeWithChildren(state.current).nodes,\n    )\n  } catch (err) {\n    throw error('Failed to parse :attr selector', {\n      cause: err as Error,\n    })\n  }\n\n  // reuses the attribute selector logic to filter the nodes\n  const comparator =\n    internals.operator ?\n      attributeSelectorsMap.get(internals.operator)\n    : undefined\n  const value = internals.value || ''\n  const propertyName = internals.attribute\n  const insensitive = internals.insensitive\n  const prefixProperties = internals.properties\n  return filterAttributes(\n    state,\n    comparator,\n    value,\n    propertyName,\n    insensitive,\n    prefixProperties,\n  )\n}\n/**\n * :empty Pseudo-Selector, matches only nodes that have no children.\n */\nconst empty = async (state: ParserState) => {\n  for (const node of state.partial.nodes) {\n    if (node.edgesOut.size > 0) {\n      removeNode(state, node)\n    }\n  }\n  return state\n}\n\n/**\n * :has Pseudo-Selector, matches only nodes that have valid results\n * for its nested selector expressions.\n */\nconst has = async (state: ParserState) => {\n  const top = asPostcssNodeWithChildren(state.current)\n  const collectNodes = new Set<NodeLike>()\n  const collectEdges = new Set<EdgeLike>()\n\n  for (const node of top.nodes) {\n    if (isSelectorNode(node)) {\n      const nestedState = await state.walk({\n        initial: {\n          edges: new Set(state.initial.edges),\n          nodes: new Set(state.initial.nodes),\n        },\n        current: node,\n        walk: state.walk,\n        collect: {\n          edges: new Set(),\n          nodes: new Set(),\n        },\n        partial: {\n          edges: new Set(state.partial.edges),\n          nodes: new Set(state.partial.nodes),\n        },\n      })\n      for (const n of nestedState.collect.nodes) {\n        collectNodes.add(n)\n      }\n      for (const e of nestedState.partial.edges) {\n        collectEdges.add(e)\n      }\n    }\n  }\n\n  // if the nested selector did not match anything, that means\n  // no current node has any matches\n  if (collectNodes.size === 0) {\n    state.partial.edges.clear()\n    state.partial.nodes.clear()\n    return state\n  }\n\n  // handles transitive dependencies\n  // compareNodes collects a list of all ancestor nodes\n  // from the resulting nodes of the nested selector\n  const compareNodes = new Set<NodeLike>()\n  const traverse = new Set(collectNodes)\n  for (const node of traverse) {\n    for (const edge of node.edgesIn) {\n      compareNodes.add(edge.from)\n      if (edge.from.edgesIn.size) {\n        traverse.add(edge.from)\n      }\n    }\n  }\n\n  // for each node in the current list checks to see if\n  // it has a node in the resulting nested state that is\n  // a transitive dependency / children.\n  nodesLoop: for (const node of state.partial.nodes) {\n    if (node.edgesOut.size === 0 || !compareNodes.has(node)) {\n      removeNode(state, node)\n      continue\n    }\n\n    for (const edge of node.edgesOut.values()) {\n      if (collectEdges.has(edge)) {\n        continue nodesLoop\n      }\n    }\n    removeNode(state, node)\n  }\n\n  removeDanglingEdges(state)\n\n  return state\n}\n\n/**\n * :is Pseudo-selector, acts as a shortcut for writing more compact expressions\n * by allowing multiple nested selectors to match on the previous results.\n *\n * It also enables the loose parsing mode, skipping instead of erroring usage\n * of non-existing classes, identifiers, pseudo-classes, etc.\n */\nconst is = async (state: ParserState) => {\n  const top = asPostcssNodeWithChildren(state.current)\n  const collect = new Set()\n  for (const node of top.nodes) {\n    if (isSelectorNode(node)) {\n      const nestedState = await state.walk({\n        collect: {\n          edges: new Set(),\n          nodes: new Set(),\n        },\n        current: node,\n        initial: state.initial,\n        loose: true,\n        partial: {\n          nodes: new Set(state.partial.nodes),\n          edges: new Set(state.partial.edges),\n        },\n        walk: state.walk,\n      })\n      for (const n of nestedState.collect.nodes) {\n        collect.add(n)\n      }\n    }\n  }\n  for (const node of state.partial.nodes) {\n    if (!collect.has(node)) {\n      removeNode(state, node)\n    }\n  }\n  return state\n}\n\n/**\n * :missing Pseudo-Selector, matches only\n * edges that are not linked to any node.\n */\nconst missing = async (state: ParserState) => {\n  for (const edge of state.partial.edges) {\n    if (edge.to) {\n      state.partial.edges.delete(edge)\n    }\n  }\n  state.partial.nodes.clear()\n  return state\n}\n\n/**\n * :not Pseudo-class, serves to create negate expressions, anything that\n * matches selectors declared inside the `:not()` expression is going to be\n * filtered out in the final result.\n */\nconst not = async (state: ParserState) => {\n  const top = asPostcssNodeWithChildren(state.current)\n  const collect = new Set()\n  for (const node of top.nodes) {\n    if (isSelectorNode(node)) {\n      const nestedState = await state.walk({\n        collect: {\n          edges: new Set(),\n          nodes: new Set(),\n        },\n        current: node,\n        initial: state.initial,\n        partial: {\n          nodes: new Set(state.partial.nodes),\n          edges: new Set(state.partial.edges),\n        },\n        walk: state.walk,\n      })\n      for (const n of nestedState.collect.nodes) {\n        collect.add(n)\n      }\n      /* c8 ignore start - should be impossible */\n    } else {\n      throw error('Error parsing :not() selectors', {\n        wanted: { type: 'selector' },\n        found: node,\n      })\n    }\n    /* c8 ignore stop */\n  }\n  for (const node of state.partial.nodes) {\n    if (collect.has(node)) {\n      removeNode(state, node)\n    }\n  }\n  return state\n}\n\n/**\n * :private Pseudo-Selector will only match packages that have\n * a `private: true` key set in their `package.json` metadata.\n */\nconst privateFn = async (state: ParserState) => {\n  for (const node of state.partial.nodes) {\n    if (!node.manifest || !asManifest(node.manifest).private) {\n      removeNode(state, node)\n    }\n  }\n\n  removeDanglingEdges(state)\n\n  return state\n}\n\n/**\n * :root Pseudo-Element will return the project root node for the graph.\n */\nconst root = async (state: ParserState) => {\n  const [anyNode] = state.initial.nodes.values()\n  const mainImporter = anyNode?.graph.mainImporter\n  if (!mainImporter) {\n    throw error(':root pseudo-element works on local graphs only')\n  }\n  for (const edge of state.partial.edges) {\n    if (edge.to !== mainImporter) {\n      state.partial.edges.delete(edge)\n    }\n  }\n  state.partial.nodes.clear()\n  state.partial.nodes.add(mainImporter)\n  return state\n}\n\n/**\n * :project Pseudo-Element, returns all graph importers (e.g: the\n * root node along with any configured workspace)\n */\nconst project = async (state: ParserState) => {\n  const [anyNode] = state.initial.nodes.values()\n  const importers = anyNode?.graph.importers\n  if (!importers?.size) {\n    throw error(':project pseudo-element works on local graphs only')\n  }\n\n  // make a list of all edges that are coming from importers\n  // so that we can filter out any edges that are not direct\n  // dependencies of the importers\n  const importersEdgesIn = new Set<EdgeLike>()\n  for (const importer of importers) {\n    for (const edge of importer.edgesIn) {\n      importersEdgesIn.add(edge)\n    }\n  }\n\n  for (const edge of state.partial.edges) {\n    if (!edge.to || !importersEdgesIn.has(edge)) {\n      state.partial.edges.delete(edge)\n    }\n  }\n  state.partial.nodes.clear()\n  for (const importer of importers) {\n    state.partial.nodes.add(importer)\n  }\n  return state\n}\n\n/**\n * :scope Pseudo-Element, returns the original scope of items\n * at the start of a given selector.\n */\nconst scope = async (state: ParserState) => {\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n  for (const edge of state.initial.edges) {\n    state.partial.edges.add(edge)\n  }\n  for (const node of state.initial.nodes) {\n    state.partial.nodes.add(node)\n  }\n  return state\n}\n\n/**\n * :type(str) Pseudo-Element will match only nodes that are of\n * the same type as the value used\n */\nconst typeFn = async (state: ParserState) => {\n  const type = asPostcssNodeWithChildren(state.current)\n  const selector = asPostcssNodeWithChildren(type.nodes[0])\n  const name = asTagNode(selector.nodes[0]).value\n  for (const node of state.partial.nodes) {\n    const nodeType = splitDepID(node.id)[0]\n    if (nodeType !== name) {\n      removeNode(state, node)\n    }\n  }\n  return state\n}\n\nconst pseudoSelectors = new Map<string, ParserFn>(\n  Object.entries({\n    attr,\n    empty,\n    has,\n    is,\n    // TODO: link\n    missing,\n    not,\n    // TODO: overridden\n    private: privateFn,\n    project,\n    root,\n    scope,\n    type: typeFn,\n    // TODO: semver\n    // TODO: outdated\n  }),\n)\n\n/**\n * Parsers the `pseudo` node types.\n */\nexport const pseudo = async (state: ParserState) => {\n  const curr = asPseudoNode(state.current)\n  const parserFn =\n    curr.value && pseudoSelectors.get(curr.value.slice(1))\n\n  if (!parserFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(\n      `Unsupported pseudo-class: ${state.current.value}`,\n    )\n  }\n  return parserFn(state)\n}\n", "const ANSI_BACKGROUND_OFFSET = 10;\n\nconst wrapAnsi16 = (offset = 0) => code => `\\u001B[${code + offset}m`;\n\nconst wrapAnsi256 = (offset = 0) => code => `\\u001B[${38 + offset};5;${code}m`;\n\nconst wrapAnsi16m = (offset = 0) => (red, green, blue) => `\\u001B[${38 + offset};2;${red};${green};${blue}m`;\n\nconst styles = {\n\tmodifier: {\n\t\treset: [0, 0],\n\t\t// 21 isn't widely supported and 22 does the same thing\n\t\tbold: [1, 22],\n\t\tdim: [2, 22],\n\t\titalic: [3, 23],\n\t\tunderline: [4, 24],\n\t\toverline: [53, 55],\n\t\tinverse: [7, 27],\n\t\thidden: [8, 28],\n\t\tstrikethrough: [9, 29],\n\t},\n\tcolor: {\n\t\tblack: [30, 39],\n\t\tred: [31, 39],\n\t\tgreen: [32, 39],\n\t\tyellow: [33, 39],\n\t\tblue: [34, 39],\n\t\tmagenta: [35, 39],\n\t\tcyan: [36, 39],\n\t\twhite: [37, 39],\n\n\t\t// Bright color\n\t\tblackBright: [90, 39],\n\t\tgray: [90, 39], // Alias of `blackBright`\n\t\tgrey: [90, 39], // Alias of `blackBright`\n\t\tredBright: [91, 39],\n\t\tgreenBright: [92, 39],\n\t\tyellowBright: [93, 39],\n\t\tblueBright: [94, 39],\n\t\tmagentaBright: [95, 39],\n\t\tcyanBright: [96, 39],\n\t\twhiteBright: [97, 39],\n\t},\n\tbgColor: {\n\t\tbgBlack: [40, 49],\n\t\tbgRed: [41, 49],\n\t\tbgGreen: [42, 49],\n\t\tbgYellow: [43, 49],\n\t\tbgBlue: [44, 49],\n\t\tbgMagenta: [45, 49],\n\t\tbgCyan: [46, 49],\n\t\tbgWhite: [47, 49],\n\n\t\t// Bright color\n\t\tbgBlackBright: [100, 49],\n\t\tbgGray: [100, 49], // Alias of `bgBlackBright`\n\t\tbgGrey: [100, 49], // Alias of `bgBlackBright`\n\t\tbgRedBright: [101, 49],\n\t\tbgGreenBright: [102, 49],\n\t\tbgYellowBright: [103, 49],\n\t\tbgBlueBright: [104, 49],\n\t\tbgMagentaBright: [105, 49],\n\t\tbgCyanBright: [106, 49],\n\t\tbgWhiteBright: [107, 49],\n\t},\n};\n\nexport const modifierNames = Object.keys(styles.modifier);\nexport const foregroundColorNames = Object.keys(styles.color);\nexport const backgroundColorNames = Object.keys(styles.bgColor);\nexport const colorNames = [...foregroundColorNames, ...backgroundColorNames];\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`,\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false,\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false,\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tstyles.color.ansi = wrapAnsi16();\n\tstyles.color.ansi256 = wrapAnsi256();\n\tstyles.color.ansi16m = wrapAnsi16m();\n\tstyles.bgColor.ansi = wrapAnsi16(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);\n\n\t// From https://github.com/Qix-/color-convert/blob/3f0e0d4e92e235796ccb17f6e85c72094a651f49/conversions.js\n\tObject.defineProperties(styles, {\n\t\trgbToAnsi256: {\n\t\t\tvalue(red, green, blue) {\n\t\t\t\t// We use the extended greyscale palette here, with the exception of\n\t\t\t\t// black and white. normal palette only has 4 greyscale shades.\n\t\t\t\tif (red === green && green === blue) {\n\t\t\t\t\tif (red < 8) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (red > 248) {\n\t\t\t\t\t\treturn 231;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn Math.round(((red - 8) / 247) * 24) + 232;\n\t\t\t\t}\n\n\t\t\t\treturn 16\n\t\t\t\t\t+ (36 * Math.round(red / 255 * 5))\n\t\t\t\t\t+ (6 * Math.round(green / 255 * 5))\n\t\t\t\t\t+ Math.round(blue / 255 * 5);\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToRgb: {\n\t\t\tvalue(hex) {\n\t\t\t\tconst matches = /[a-f\\d]{6}|[a-f\\d]{3}/i.exec(hex.toString(16));\n\t\t\t\tif (!matches) {\n\t\t\t\t\treturn [0, 0, 0];\n\t\t\t\t}\n\n\t\t\t\tlet [colorString] = matches;\n\n\t\t\t\tif (colorString.length === 3) {\n\t\t\t\t\tcolorString = [...colorString].map(character => character + character).join('');\n\t\t\t\t}\n\n\t\t\t\tconst integer = Number.parseInt(colorString, 16);\n\n\t\t\t\treturn [\n\t\t\t\t\t/* eslint-disable no-bitwise */\n\t\t\t\t\t(integer >> 16) & 0xFF,\n\t\t\t\t\t(integer >> 8) & 0xFF,\n\t\t\t\t\tinteger & 0xFF,\n\t\t\t\t\t/* eslint-enable no-bitwise */\n\t\t\t\t];\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToAnsi256: {\n\t\t\tvalue: hex => styles.rgbToAnsi256(...styles.hexToRgb(hex)),\n\t\t\tenumerable: false,\n\t\t},\n\t\tansi256ToAnsi: {\n\t\t\tvalue(code) {\n\t\t\t\tif (code < 8) {\n\t\t\t\t\treturn 30 + code;\n\t\t\t\t}\n\n\t\t\t\tif (code < 16) {\n\t\t\t\t\treturn 90 + (code - 8);\n\t\t\t\t}\n\n\t\t\t\tlet red;\n\t\t\t\tlet green;\n\t\t\t\tlet blue;\n\n\t\t\t\tif (code >= 232) {\n\t\t\t\t\tred = (((code - 232) * 10) + 8) / 255;\n\t\t\t\t\tgreen = red;\n\t\t\t\t\tblue = red;\n\t\t\t\t} else {\n\t\t\t\t\tcode -= 16;\n\n\t\t\t\t\tconst remainder = code % 36;\n\n\t\t\t\t\tred = Math.floor(code / 36) / 5;\n\t\t\t\t\tgreen = Math.floor(remainder / 6) / 5;\n\t\t\t\t\tblue = (remainder % 6) / 5;\n\t\t\t\t}\n\n\t\t\t\tconst value = Math.max(red, green, blue) * 2;\n\n\t\t\t\tif (value === 0) {\n\t\t\t\t\treturn 30;\n\t\t\t\t}\n\n\t\t\t\t// eslint-disable-next-line no-bitwise\n\t\t\t\tlet result = 30 + ((Math.round(blue) << 2) | (Math.round(green) << 1) | Math.round(red));\n\n\t\t\t\tif (value === 2) {\n\t\t\t\t\tresult += 60;\n\t\t\t\t}\n\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\trgbToAnsi: {\n\t\t\tvalue: (red, green, blue) => styles.ansi256ToAnsi(styles.rgbToAnsi256(red, green, blue)),\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToAnsi: {\n\t\t\tvalue: hex => styles.ansi256ToAnsi(styles.hexToAnsi256(hex)),\n\t\t\tenumerable: false,\n\t\t},\n\t});\n\n\treturn styles;\n}\n\nconst ansiStyles = assembleStyles();\n\nexport default ansiStyles;\n", "import process from 'node:process';\nimport os from 'node:os';\nimport tty from 'node:tty';\n\n// From: https://github.com/sindresorhus/has-flag/blob/main/index.js\n/// function hasFlag(flag, argv = globalThis.Deno?.args ?? process.argv) {\nfunction hasFlag(flag, argv = globalThis.Deno ? globalThis.Deno.args : process.argv) {\n\tconst prefix = flag.startsWith('-') ? '' : (flag.length === 1 ? '-' : '--');\n\tconst position = argv.indexOf(prefix + flag);\n\tconst terminatorPosition = argv.indexOf('--');\n\treturn position !== -1 && (terminatorPosition === -1 || position < terminatorPosition);\n}\n\nconst {env} = process;\n\nlet flagForceColor;\nif (\n\thasFlag('no-color')\n\t|| hasFlag('no-colors')\n\t|| hasFlag('color=false')\n\t|| hasFlag('color=never')\n) {\n\tflagForceColor = 0;\n} else if (\n\thasFlag('color')\n\t|| hasFlag('colors')\n\t|| hasFlag('color=true')\n\t|| hasFlag('color=always')\n) {\n\tflagForceColor = 1;\n}\n\nfunction envForceColor() {\n\tif ('FORCE_COLOR' in env) {\n\t\tif (env.FORCE_COLOR === 'true') {\n\t\t\treturn 1;\n\t\t}\n\n\t\tif (env.FORCE_COLOR === 'false') {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn env.FORCE_COLOR.length === 0 ? 1 : Math.min(Number.parseInt(env.FORCE_COLOR, 10), 3);\n\t}\n}\n\nfunction translateLevel(level) {\n\tif (level === 0) {\n\t\treturn false;\n\t}\n\n\treturn {\n\t\tlevel,\n\t\thasBasic: true,\n\t\thas256: level >= 2,\n\t\thas16m: level >= 3,\n\t};\n}\n\nfunction _supportsColor(haveStream, {streamIsTTY, sniffFlags = true} = {}) {\n\tconst noFlagForceColor = envForceColor();\n\tif (noFlagForceColor !== undefined) {\n\t\tflagForceColor = noFlagForceColor;\n\t}\n\n\tconst forceColor = sniffFlags ? flagForceColor : noFlagForceColor;\n\n\tif (forceColor === 0) {\n\t\treturn 0;\n\t}\n\n\tif (sniffFlags) {\n\t\tif (hasFlag('color=16m')\n\t\t\t|| hasFlag('color=full')\n\t\t\t|| hasFlag('color=truecolor')) {\n\t\t\treturn 3;\n\t\t}\n\n\t\tif (hasFlag('color=256')) {\n\t\t\treturn 2;\n\t\t}\n\t}\n\n\t// Check for Azure DevOps pipelines.\n\t// Has to be above the `!streamIsTTY` check.\n\tif ('TF_BUILD' in env && 'AGENT_NAME' in env) {\n\t\treturn 1;\n\t}\n\n\tif (haveStream && !streamIsTTY && forceColor === undefined) {\n\t\treturn 0;\n\t}\n\n\tconst min = forceColor || 0;\n\n\tif (env.TERM === 'dumb') {\n\t\treturn min;\n\t}\n\n\tif (process.platform === 'win32') {\n\t\t// Windows 10 build 10586 is the first Windows release that supports 256 colors.\n\t\t// Windows 10 build 14931 is the first release that supports 16m/TrueColor.\n\t\tconst osRelease = os.release().split('.');\n\t\tif (\n\t\t\tNumber(osRelease[0]) >= 10\n\t\t\t&& Number(osRelease[2]) >= 10_586\n\t\t) {\n\t\t\treturn Number(osRelease[2]) >= 14_931 ? 3 : 2;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif ('CI' in env) {\n\t\tif ('GITHUB_ACTIONS' in env || 'GITEA_ACTIONS' in env) {\n\t\t\treturn 3;\n\t\t}\n\n\t\tif (['TRAVIS', 'CIRCLECI', 'APPVEYOR', 'GITLAB_CI', 'BUILDKITE', 'DRONE'].some(sign => sign in env) || env.CI_NAME === 'codeship') {\n\t\t\treturn 1;\n\t\t}\n\n\t\treturn min;\n\t}\n\n\tif ('TEAMCITY_VERSION' in env) {\n\t\treturn /^(9\\.(0*[1-9]\\d*)\\.|\\d{2,}\\.)/.test(env.TEAMCITY_VERSION) ? 1 : 0;\n\t}\n\n\tif (env.COLORTERM === 'truecolor') {\n\t\treturn 3;\n\t}\n\n\tif (env.TERM === 'xterm-kitty') {\n\t\treturn 3;\n\t}\n\n\tif ('TERM_PROGRAM' in env) {\n\t\tconst version = Number.parseInt((env.TERM_PROGRAM_VERSION || '').split('.')[0], 10);\n\n\t\tswitch (env.TERM_PROGRAM) {\n\t\t\tcase 'iTerm.app': {\n\t\t\t\treturn version >= 3 ? 3 : 2;\n\t\t\t}\n\n\t\t\tcase 'Apple_Terminal': {\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\t// No default\n\t\t}\n\t}\n\n\tif (/-256(color)?$/i.test(env.TERM)) {\n\t\treturn 2;\n\t}\n\n\tif (/^screen|^xterm|^vt100|^vt220|^rxvt|color|ansi|cygwin|linux/i.test(env.TERM)) {\n\t\treturn 1;\n\t}\n\n\tif ('COLORTERM' in env) {\n\t\treturn 1;\n\t}\n\n\treturn min;\n}\n\nexport function createSupportsColor(stream, options = {}) {\n\tconst level = _supportsColor(stream, {\n\t\tstreamIsTTY: stream && stream.isTTY,\n\t\t...options,\n\t});\n\n\treturn translateLevel(level);\n}\n\nconst supportsColor = {\n\tstdout: createSupportsColor({isTTY: tty.isatty(1)}),\n\tstderr: createSupportsColor({isTTY: tty.isatty(2)}),\n};\n\nexport default supportsColor;\n", "// TODO: When targeting Node.js 16, use `String.prototype.replaceAll`.\nexport function stringReplaceAll(string, substring, replacer) {\n\tlet index = string.indexOf(substring);\n\tif (index === -1) {\n\t\treturn string;\n\t}\n\n\tconst substringLength = substring.length;\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\treturnValue += string.slice(endIndex, index) + substring + replacer;\n\t\tendIndex = index + substringLength;\n\t\tindex = string.indexOf(substring, endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.slice(endIndex);\n\treturn returnValue;\n}\n\nexport function stringEncaseCRLFWithFirstIndex(string, prefix, postfix, index) {\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\tconst gotCR = string[index - 1] === '\\r';\n\t\treturnValue += string.slice(endIndex, (gotCR ? index - 1 : index)) + prefix + (gotCR ? '\\r\\n' : '\\n') + postfix;\n\t\tendIndex = index + 1;\n\t\tindex = string.indexOf('\\n', endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.slice(endIndex);\n\treturn returnValue;\n}\n", "import ansiStyles from '#ansi-styles';\nimport supportsColor from '#supports-color';\nimport { // eslint-disable-line import/order\n\tstringReplaceAll,\n\tstringEncaseCRLFWithFirstIndex,\n} from './utilities.js';\n\nconst {stdout: stdoutColor, stderr: stderrColor} = supportsColor;\n\nconst GENERATOR = Symbol('GENERATOR');\nconst STYLER = Symbol('STYLER');\nconst IS_EMPTY = Symbol('IS_EMPTY');\n\n// `supportsColor.level` \u2192 `ansiStyles.color[name]` mapping\nconst levelMapping = [\n\t'ansi',\n\t'ansi',\n\t'ansi256',\n\t'ansi16m',\n];\n\nconst styles = Object.create(null);\n\nconst applyOptions = (object, options = {}) => {\n\tif (options.level && !(Number.isInteger(options.level) && options.level >= 0 && options.level <= 3)) {\n\t\tthrow new Error('The `level` option should be an integer from 0 to 3');\n\t}\n\n\t// Detect level if not set manually\n\tconst colorLevel = stdoutColor ? stdoutColor.level : 0;\n\tobject.level = options.level === undefined ? colorLevel : options.level;\n};\n\nexport class Chalk {\n\tconstructor(options) {\n\t\t// eslint-disable-next-line no-constructor-return\n\t\treturn chalkFactory(options);\n\t}\n}\n\nconst chalkFactory = options => {\n\tconst chalk = (...strings) => strings.join(' ');\n\tapplyOptions(chalk, options);\n\n\tObject.setPrototypeOf(chalk, createChalk.prototype);\n\n\treturn chalk;\n};\n\nfunction createChalk(options) {\n\treturn chalkFactory(options);\n}\n\nObject.setPrototypeOf(createChalk.prototype, Function.prototype);\n\nfor (const [styleName, style] of Object.entries(ansiStyles)) {\n\tstyles[styleName] = {\n\t\tget() {\n\t\t\tconst builder = createBuilder(this, createStyler(style.open, style.close, this[STYLER]), this[IS_EMPTY]);\n\t\t\tObject.defineProperty(this, styleName, {value: builder});\n\t\t\treturn builder;\n\t\t},\n\t};\n}\n\nstyles.visible = {\n\tget() {\n\t\tconst builder = createBuilder(this, this[STYLER], true);\n\t\tObject.defineProperty(this, 'visible', {value: builder});\n\t\treturn builder;\n\t},\n};\n\nconst getModelAnsi = (model, level, type, ...arguments_) => {\n\tif (model === 'rgb') {\n\t\tif (level === 'ansi16m') {\n\t\t\treturn ansiStyles[type].ansi16m(...arguments_);\n\t\t}\n\n\t\tif (level === 'ansi256') {\n\t\t\treturn ansiStyles[type].ansi256(ansiStyles.rgbToAnsi256(...arguments_));\n\t\t}\n\n\t\treturn ansiStyles[type].ansi(ansiStyles.rgbToAnsi(...arguments_));\n\t}\n\n\tif (model === 'hex') {\n\t\treturn getModelAnsi('rgb', level, type, ...ansiStyles.hexToRgb(...arguments_));\n\t}\n\n\treturn ansiStyles[type][model](...arguments_);\n};\n\nconst usedModels = ['rgb', 'hex', 'ansi256'];\n\nfor (const model of usedModels) {\n\tstyles[model] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(getModelAnsi(model, levelMapping[level], 'color', ...arguments_), ansiStyles.color.close, this[STYLER]);\n\t\t\t\treturn createBuilder(this, styler, this[IS_EMPTY]);\n\t\t\t};\n\t\t},\n\t};\n\n\tconst bgModel = 'bg' + model[0].toUpperCase() + model.slice(1);\n\tstyles[bgModel] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(getModelAnsi(model, levelMapping[level], 'bgColor', ...arguments_), ansiStyles.bgColor.close, this[STYLER]);\n\t\t\t\treturn createBuilder(this, styler, this[IS_EMPTY]);\n\t\t\t};\n\t\t},\n\t};\n}\n\nconst proto = Object.defineProperties(() => {}, {\n\t...styles,\n\tlevel: {\n\t\tenumerable: true,\n\t\tget() {\n\t\t\treturn this[GENERATOR].level;\n\t\t},\n\t\tset(level) {\n\t\t\tthis[GENERATOR].level = level;\n\t\t},\n\t},\n});\n\nconst createStyler = (open, close, parent) => {\n\tlet openAll;\n\tlet closeAll;\n\tif (parent === undefined) {\n\t\topenAll = open;\n\t\tcloseAll = close;\n\t} else {\n\t\topenAll = parent.openAll + open;\n\t\tcloseAll = close + parent.closeAll;\n\t}\n\n\treturn {\n\t\topen,\n\t\tclose,\n\t\topenAll,\n\t\tcloseAll,\n\t\tparent,\n\t};\n};\n\nconst createBuilder = (self, _styler, _isEmpty) => {\n\t// Single argument is hot path, implicit coercion is faster than anything\n\t// eslint-disable-next-line no-implicit-coercion\n\tconst builder = (...arguments_) => applyStyle(builder, (arguments_.length === 1) ? ('' + arguments_[0]) : arguments_.join(' '));\n\n\t// We alter the prototype because we must return a function, but there is\n\t// no way to create a function with a different prototype\n\tObject.setPrototypeOf(builder, proto);\n\n\tbuilder[GENERATOR] = self;\n\tbuilder[STYLER] = _styler;\n\tbuilder[IS_EMPTY] = _isEmpty;\n\n\treturn builder;\n};\n\nconst applyStyle = (self, string) => {\n\tif (self.level <= 0 || !string) {\n\t\treturn self[IS_EMPTY] ? '' : string;\n\t}\n\n\tlet styler = self[STYLER];\n\n\tif (styler === undefined) {\n\t\treturn string;\n\t}\n\n\tconst {openAll, closeAll} = styler;\n\tif (string.includes('\\u001B')) {\n\t\twhile (styler !== undefined) {\n\t\t\t// Replace any instances already present with a re-opening code\n\t\t\t// otherwise only the part of the string until said closing code\n\t\t\t// will be colored, and the rest will simply be 'plain'.\n\t\t\tstring = stringReplaceAll(string, styler.close, styler.open);\n\n\t\t\tstyler = styler.parent;\n\t\t}\n\t}\n\n\t// We can move both next actions out of loop, because remaining actions in loop won't have\n\t// any/visible effect on parts we add here. Close the styling before a linebreak and reopen\n\t// after next line to fix a bleed issue on macOS: https://github.com/chalk/chalk/pull/92\n\tconst lfIndex = string.indexOf('\\n');\n\tif (lfIndex !== -1) {\n\t\tstring = stringEncaseCRLFWithFirstIndex(string, closeAll, openAll, lfIndex);\n\t}\n\n\treturn openAll + string + closeAll;\n};\n\nObject.defineProperties(createChalk.prototype, styles);\n\nconst chalk = createChalk();\nexport const chalkStderr = createChalk({level: stderrColor ? stderrColor.level : 0});\n\nexport {\n\tmodifierNames,\n\tforegroundColorNames,\n\tbackgroundColorNames,\n\tcolorNames,\n\n\t// TODO: Remove these aliases in the next major version\n\tmodifierNames as modifiers,\n\tforegroundColorNames as foregroundColors,\n\tbackgroundColorNames as backgroundColors,\n\tcolorNames as colors,\n} from './vendor/ansi-styles/index.js';\n\nexport {\n\tstdoutColor as supportsColor,\n\tstderrColor as supportsColorStderr,\n};\n\nexport default chalk;\n", "import {\n  actual,\n  humanReadableOutput,\n  jsonOutput,\n  mermaidOutput,\n  Node,\n} from '@vltpkg/graph'\nimport { LoadedConfig } from '../config/index.js'\nimport { Query } from '@vltpkg/query'\nimport chalk from 'chalk'\n\nexport const usage = `Usage:\n  vlt ls\n  vlt ls <query> --view=[human | json | mermaid]\n\nList installed dependencies matching the provided query.\nDefaults to listing direct dependencies of a project and\nany configured workspace.\n\nExamples:\n\n  vlt ls\n          List direct dependencies of the current project / workspace\n  vlt ls *\n          List all dependencies for the current project / workspace\n  vlt ls '[name=\"@scoped/package\"] > *'\n          Lists direct dependencies of a specific package\n  vlt ls '*.workspace > *.peer'\n          List all peer dependencies of all workspaces\n\nOptions:\n\n  --view=[human | json | mermaid]\n          Output format. Defaults to human-readable or json if no tty.\n`\n\nexport const command = async (conf: LoadedConfig) => {\n  const monorepo = conf.options.monorepo\n  const mainManifest = conf.options.packageJson.read(\n    conf.options.projectRoot,\n  )\n  const graph = actual.load({\n    ...conf.options,\n    mainManifest,\n    monorepo,\n    loadManifests: true,\n  })\n\n  const queryString = conf.positionals[0]\n  const query = new Query({ graph })\n  const projectQueryString = ':project, :project > *'\n  const selectImporters: string[] = []\n\n  const importers = new Set<Node>()\n  if (monorepo) {\n    for (const workspace of monorepo.filter(conf.values)) {\n      const w: Node | undefined = graph.nodes.get(workspace.id)\n      if (w) {\n        importers.add(w)\n        selectImporters.push(`[name=\"${w.name}\"]`)\n        selectImporters.push(`[name=\"${w.name}\"] > *`)\n      }\n    }\n  }\n  if (importers.size === 0) {\n    for (const importer of graph.importers) {\n      importers.add(importer)\n    }\n  }\n\n  const selectImportersQueryString = selectImporters.join(', ')\n  const defaultQueryString =\n    (\n      selectImporters.length &&\n      selectImporters.length < graph.importers.size\n    ) ?\n      selectImportersQueryString\n    : projectQueryString\n  const { edges, nodes } = await query.search(\n    queryString || defaultQueryString,\n  )\n  const colors = conf.values.color ? chalk : undefined\n\n  const result =\n    (\n      conf.values.view === 'json' ||\n      /* c8 ignore next */\n      (!conf.values.view && !process.stdout.isTTY)\n    ) ?\n      jsonOutput({ edges, nodes })\n    : conf.values.view === 'mermaid' ?\n      mermaidOutput({ importers, edges, nodes })\n    : humanReadableOutput({\n        colors,\n        importers,\n        edges,\n        nodes,\n        highlightSelection: !!queryString,\n      })\n\n  console.log(result)\n}\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AACA,WAAO,UAAU;AACjB,aAAS,SAAS,GAAG,GAAG,KAAK;AAC3B,UAAI,aAAa,OAAQ,KAAI,WAAW,GAAG,GAAG;AAC9C,UAAI,aAAa,OAAQ,KAAI,WAAW,GAAG,GAAG;AAE9C,UAAI,IAAI,MAAM,GAAG,GAAG,GAAG;AAEvB,aAAO,KAAK;AAAA,QACV,OAAO,EAAE,CAAC;AAAA,QACV,KAAK,EAAE,CAAC;AAAA,QACR,KAAK,IAAI,MAAM,GAAG,EAAE,CAAC,CAAC;AAAA,QACtB,MAAM,IAAI,MAAM,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAAA,QACrC,MAAM,IAAI,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM;AAAA,MACjC;AAAA,IACF;AAEA,aAAS,WAAW,KAAK,KAAK;AAC5B,UAAI,IAAI,IAAI,MAAM,GAAG;AACrB,aAAO,IAAI,EAAE,CAAC,IAAI;AAAA,IACpB;AAEA,aAAS,QAAQ;AACjB,aAAS,MAAM,GAAG,GAAG,KAAK;AACxB,UAAI,MAAM,KAAK,MAAM,OAAO;AAC5B,UAAI,KAAK,IAAI,QAAQ,CAAC;AACtB,UAAI,KAAK,IAAI,QAAQ,GAAG,KAAK,CAAC;AAC9B,UAAI,IAAI;AAER,UAAI,MAAM,KAAK,KAAK,GAAG;AACrB,YAAG,MAAI,GAAG;AACR,iBAAO,CAAC,IAAI,EAAE;AAAA,QAChB;AACA,eAAO,CAAC;AACR,eAAO,IAAI;AAEX,eAAO,KAAK,KAAK,CAAC,QAAQ;AACxB,cAAI,KAAK,IAAI;AACX,iBAAK,KAAK,CAAC;AACX,iBAAK,IAAI,QAAQ,GAAG,IAAI,CAAC;AAAA,UAC3B,WAAW,KAAK,UAAU,GAAG;AAC3B,qBAAS,CAAE,KAAK,IAAI,GAAG,EAAG;AAAA,UAC5B,OAAO;AACL,kBAAM,KAAK,IAAI;AACf,gBAAI,MAAM,MAAM;AACd,qBAAO;AACP,sBAAQ;AAAA,YACV;AAEA,iBAAK,IAAI,QAAQ,GAAG,IAAI,CAAC;AAAA,UAC3B;AAEA,cAAI,KAAK,MAAM,MAAM,IAAI,KAAK;AAAA,QAChC;AAEA,YAAI,KAAK,QAAQ;AACf,mBAAS,CAAE,MAAM,KAAM;AAAA,QACzB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AC7DA;AAAA;AAAA,QAAI,WAAW;AAEf,WAAO,UAAU;AAEjB,QAAI,WAAW,YAAU,KAAK,OAAO,IAAE;AACvC,QAAI,UAAU,WAAS,KAAK,OAAO,IAAE;AACrC,QAAI,WAAW,YAAU,KAAK,OAAO,IAAE;AACvC,QAAI,WAAW,YAAU,KAAK,OAAO,IAAE;AACvC,QAAI,YAAY,aAAW,KAAK,OAAO,IAAE;AAEzC,aAAS,QAAQ,KAAK;AACpB,aAAO,SAAS,KAAK,EAAE,KAAK,MACxB,SAAS,KAAK,EAAE,IAChB,IAAI,WAAW,CAAC;AAAA,IACtB;AAEA,aAAS,aAAa,KAAK;AACzB,aAAO,IAAI,MAAM,MAAM,EAAE,KAAK,QAAQ,EAC3B,MAAM,KAAK,EAAE,KAAK,OAAO,EACzB,MAAM,KAAK,EAAE,KAAK,QAAQ,EAC1B,MAAM,KAAK,EAAE,KAAK,QAAQ,EAC1B,MAAM,KAAK,EAAE,KAAK,SAAS;AAAA,IACxC;AAEA,aAAS,eAAe,KAAK;AAC3B,aAAO,IAAI,MAAM,QAAQ,EAAE,KAAK,IAAI,EACzB,MAAM,OAAO,EAAE,KAAK,GAAG,EACvB,MAAM,QAAQ,EAAE,KAAK,GAAG,EACxB,MAAM,QAAQ,EAAE,KAAK,GAAG,EACxB,MAAM,SAAS,EAAE,KAAK,GAAG;AAAA,IACtC;AAMA,aAAS,gBAAgB,KAAK;AAC5B,UAAI,CAAC;AACH,eAAO,CAAC,EAAE;AAEZ,UAAI,QAAQ,CAAC;AACb,UAAI,IAAI,SAAS,KAAK,KAAK,GAAG;AAE9B,UAAI,CAAC;AACH,eAAO,IAAI,MAAM,GAAG;AAEtB,UAAI,MAAM,EAAE;AACZ,UAAI,OAAO,EAAE;AACb,UAAI,OAAO,EAAE;AACb,UAAI,IAAI,IAAI,MAAM,GAAG;AAErB,QAAE,EAAE,SAAO,CAAC,KAAK,MAAM,OAAO;AAC9B,UAAI,YAAY,gBAAgB,IAAI;AACpC,UAAI,KAAK,QAAQ;AACf,UAAE,EAAE,SAAO,CAAC,KAAK,UAAU,MAAM;AACjC,UAAE,KAAK,MAAM,GAAG,SAAS;AAAA,MAC3B;AAEA,YAAM,KAAK,MAAM,OAAO,CAAC;AAEzB,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,KAAK;AACtB,UAAI,CAAC;AACH,eAAO,CAAC;AAQV,UAAI,IAAI,OAAO,GAAG,CAAC,MAAM,MAAM;AAC7B,cAAM,WAAW,IAAI,OAAO,CAAC;AAAA,MAC/B;AAEA,aAAOA,QAAO,aAAa,GAAG,GAAG,IAAI,EAAE,IAAI,cAAc;AAAA,IAC3D;AAEA,aAAS,QAAQ,KAAK;AACpB,aAAO,MAAM,MAAM;AAAA,IACrB;AACA,aAAS,SAAS,IAAI;AACpB,aAAO,SAAS,KAAK,EAAE;AAAA,IACzB;AAEA,aAAS,IAAI,GAAG,GAAG;AACjB,aAAO,KAAK;AAAA,IACd;AACA,aAAS,IAAI,GAAG,GAAG;AACjB,aAAO,KAAK;AAAA,IACd;AAEA,aAASA,QAAO,KAAK,OAAO;AAC1B,UAAI,aAAa,CAAC;AAElB,UAAI,IAAI,SAAS,KAAK,KAAK,GAAG;AAC9B,UAAI,CAAC,EAAG,QAAO,CAAC,GAAG;AAGnB,UAAI,MAAM,EAAE;AACZ,UAAI,OAAO,EAAE,KAAK,SACdA,QAAO,EAAE,MAAM,KAAK,IACpB,CAAC,EAAE;AAEP,UAAI,MAAM,KAAK,EAAE,GAAG,GAAG;AACrB,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAI,YAAY,MAAK,MAAM,EAAE,OAAO,MAAM,KAAK,CAAC;AAChD,qBAAW,KAAK,SAAS;AAAA,QAC3B;AAAA,MACF,OAAO;AACL,YAAI,oBAAoB,iCAAiC,KAAK,EAAE,IAAI;AACpE,YAAI,kBAAkB,uCAAuC,KAAK,EAAE,IAAI;AACxE,YAAI,aAAa,qBAAqB;AACtC,YAAI,YAAY,EAAE,KAAK,QAAQ,GAAG,KAAK;AACvC,YAAI,CAAC,cAAc,CAAC,WAAW;AAE7B,cAAI,EAAE,KAAK,MAAM,OAAO,GAAG;AACzB,kBAAM,EAAE,MAAM,MAAM,EAAE,OAAO,WAAW,EAAE;AAC1C,mBAAOA,QAAO,GAAG;AAAA,UACnB;AACA,iBAAO,CAAC,GAAG;AAAA,QACb;AAEA,YAAI;AACJ,YAAI,YAAY;AACd,cAAI,EAAE,KAAK,MAAM,MAAM;AAAA,QACzB,OAAO;AACL,cAAI,gBAAgB,EAAE,IAAI;AAC1B,cAAI,EAAE,WAAW,GAAG;AAElB,gBAAIA,QAAO,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,OAAO;AACnC,gBAAI,EAAE,WAAW,GAAG;AAClB,qBAAO,KAAK,IAAI,SAAS,GAAG;AAC1B,uBAAO,EAAE,MAAM,EAAE,CAAC,IAAI;AAAA,cACxB,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF;AAIA,YAAI;AAEJ,YAAI,YAAY;AACd,cAAI,IAAI,QAAQ,EAAE,CAAC,CAAC;AACpB,cAAI,IAAI,QAAQ,EAAE,CAAC,CAAC;AACpB,cAAI,QAAQ,KAAK,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM;AAC7C,cAAI,OAAO,EAAE,UAAU,IACnB,KAAK,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC,IACtB;AACJ,cAAI,OAAO;AACX,cAAI,UAAU,IAAI;AAClB,cAAI,SAAS;AACX,oBAAQ;AACR,mBAAO;AAAA,UACT;AACA,cAAI,MAAM,EAAE,KAAK,QAAQ;AAEzB,cAAI,CAAC;AAEL,mBAAS,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,MAAM;AACrC,gBAAI;AACJ,gBAAI,iBAAiB;AACnB,kBAAI,OAAO,aAAa,CAAC;AACzB,kBAAI,MAAM;AACR,oBAAI;AAAA,YACR,OAAO;AACL,kBAAI,OAAO,CAAC;AACZ,kBAAI,KAAK;AACP,oBAAI,OAAO,QAAQ,EAAE;AACrB,oBAAI,OAAO,GAAG;AACZ,sBAAI,IAAI,IAAI,MAAM,OAAO,CAAC,EAAE,KAAK,GAAG;AACpC,sBAAI,IAAI;AACN,wBAAI,MAAM,IAAI,EAAE,MAAM,CAAC;AAAA;AAEvB,wBAAI,IAAI;AAAA,gBACZ;AAAA,cACF;AAAA,YACF;AACA,cAAE,KAAK,CAAC;AAAA,UACV;AAAA,QACF,OAAO;AACL,cAAI,CAAC;AAEL,mBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAE,KAAK,MAAM,GAAGA,QAAO,EAAE,CAAC,GAAG,KAAK,CAAC;AAAA,UACrC;AAAA,QACF;AAEA,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,gBAAI,YAAY,MAAM,EAAE,CAAC,IAAI,KAAK,CAAC;AACnC,gBAAI,CAAC,SAAS,cAAc;AAC1B,yBAAW,KAAK,SAAS;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACzMA;AAAA;AAAA,WAAO,UAAU;AACjB,UAAM,OAAOC;AAEb,QAAIC,MAAK,UAAQ,SAAI;AAErB,aAAS,aAAcC,OAAM,SAAS;AACpC,UAAI,UAAU,QAAQ,YAAY,SAChC,QAAQ,UAAU,QAAQ,IAAI;AAEhC,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AAEA,gBAAU,QAAQ,MAAM,GAAG;AAC3B,UAAI,QAAQ,QAAQ,EAAE,MAAM,IAAI;AAC9B,eAAO;AAAA,MACT;AACA,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAI,IAAI,QAAQ,CAAC,EAAE,YAAY;AAC/B,YAAI,KAAKA,MAAK,OAAO,CAAC,EAAE,MAAM,EAAE,YAAY,MAAM,GAAG;AACnD,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,UAAWC,OAAMD,OAAM,SAAS;AACvC,UAAI,CAACC,MAAK,eAAe,KAAK,CAACA,MAAK,OAAO,GAAG;AAC5C,eAAO;AAAA,MACT;AACA,aAAO,aAAaD,OAAM,OAAO;AAAA,IACnC;AAEA,aAAS,MAAOA,OAAM,SAAS,IAAI;AACjC,MAAAD,IAAG,KAAKC,OAAM,SAAU,IAAIC,OAAM;AAChC,WAAG,IAAI,KAAK,QAAQ,UAAUA,OAAMD,OAAM,OAAO,CAAC;AAAA,MACpD,CAAC;AAAA,IACH;AAEA,aAASF,MAAME,OAAM,SAAS;AAC5B,aAAO,UAAUD,IAAG,SAASC,KAAI,GAAGA,OAAM,OAAO;AAAA,IACnD;AAAA;AAAA;;;ACzCA;AAAA;AAAA,WAAO,UAAU;AACjB,UAAM,OAAOE;AAEb,QAAIC,MAAK,UAAQ,SAAI;AAErB,aAAS,MAAOC,OAAM,SAAS,IAAI;AACjC,MAAAD,IAAG,KAAKC,OAAM,SAAU,IAAIC,OAAM;AAChC,WAAG,IAAI,KAAK,QAAQ,UAAUA,OAAM,OAAO,CAAC;AAAA,MAC9C,CAAC;AAAA,IACH;AAEA,aAASH,MAAME,OAAM,SAAS;AAC5B,aAAO,UAAUD,IAAG,SAASC,KAAI,GAAG,OAAO;AAAA,IAC7C;AAEA,aAAS,UAAWC,OAAM,SAAS;AACjC,aAAOA,MAAK,OAAO,KAAK,UAAUA,OAAM,OAAO;AAAA,IACjD;AAEA,aAAS,UAAWA,OAAM,SAAS;AACjC,UAAI,MAAMA,MAAK;AACf,UAAI,MAAMA,MAAK;AACf,UAAI,MAAMA,MAAK;AAEf,UAAI,QAAQ,QAAQ,QAAQ,SAC1B,QAAQ,MAAM,QAAQ,UAAU,QAAQ,OAAO;AACjD,UAAI,QAAQ,QAAQ,QAAQ,SAC1B,QAAQ,MAAM,QAAQ,UAAU,QAAQ,OAAO;AAEjD,UAAI,IAAI,SAAS,OAAO,CAAC;AACzB,UAAI,IAAI,SAAS,OAAO,CAAC;AACzB,UAAI,IAAI,SAAS,OAAO,CAAC;AACzB,UAAI,KAAK,IAAI;AAEb,UAAI,MAAO,MAAM,KACd,MAAM,KAAM,QAAQ,SACpB,MAAM,KAAM,QAAQ,SACpB,MAAM,MAAO,UAAU;AAE1B,aAAO;AAAA,IACT;AAAA;AAAA;;;ACxCA;AAAA;AAAA,QAAIC,MAAK,UAAQ,SAAI;AACrB,QAAI;AACJ,QAAI,QAAQ,aAAa,WAAW,OAAO,iBAAiB;AAC1D,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAEA,WAAO,UAAU;AACjB,UAAM,OAAOC;AAEb,aAAS,MAAOC,OAAM,SAAS,IAAI;AACjC,UAAI,OAAO,YAAY,YAAY;AACjC,aAAK;AACL,kBAAU,CAAC;AAAA,MACb;AAEA,UAAI,CAAC,IAAI;AACP,YAAI,OAAO,YAAY,YAAY;AACjC,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAEA,eAAO,IAAI,QAAQ,SAAUC,WAAS,QAAQ;AAC5C,gBAAMD,OAAM,WAAW,CAAC,GAAG,SAAU,IAAIE,KAAI;AAC3C,gBAAI,IAAI;AACN,qBAAO,EAAE;AAAA,YACX,OAAO;AACL,cAAAD,UAAQC,GAAE;AAAA,YACZ;AAAA,UACF,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AAEA,WAAKF,OAAM,WAAW,CAAC,GAAG,SAAU,IAAIE,KAAI;AAE1C,YAAI,IAAI;AACN,cAAI,GAAG,SAAS,YAAY,WAAW,QAAQ,cAAc;AAC3D,iBAAK;AACL,YAAAA,MAAK;AAAA,UACP;AAAA,QACF;AACA,WAAG,IAAIA,GAAE;AAAA,MACX,CAAC;AAAA,IACH;AAEA,aAASH,MAAMC,OAAM,SAAS;AAE5B,UAAI;AACF,eAAO,KAAK,KAAKA,OAAM,WAAW,CAAC,CAAC;AAAA,MACtC,SAAS,IAAI;AACX,YAAI,WAAW,QAAQ,gBAAgB,GAAG,SAAS,UAAU;AAC3D,iBAAO;AAAA,QACT,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;ACxDA;AAAA;AAAA,QAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,QAAMG,QAAO,UAAQ,WAAM;AAC3B,QAAM,QAAQ,YAAY,MAAM;AAChC,QAAM,QAAQ;AAEd,QAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,MAAM,SAAS,CAAC;AAElE,QAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,YAAM,QAAQ,IAAI,SAAS;AAI3B,YAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,QAEE,GAAI,YAAY,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC;AAAA,QACnC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,QACe,IAAI,MAAM,KAAK;AAAA,MAC5D;AAEJ,YAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,YAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,UAAI,WAAW;AACb,YAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,kBAAQ,QAAQ,EAAE;AAAA,MACtB;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,QAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,UAAI,OAAO,QAAQ,YAAY;AAC7B,aAAK;AACL,cAAM,CAAC;AAAA,MACT;AACA,UAAI,CAAC;AACH,cAAM,CAAC;AAET,YAAM,EAAE,SAAS,SAAS,WAAW,IAAI,YAAY,KAAK,GAAG;AAC7D,YAAM,QAAQ,CAAC;AAEf,YAAM,OAAO,OAAK,IAAI,QAAQ,CAACC,WAAS,WAAW;AACjD,YAAI,MAAM,QAAQ;AAChB,iBAAO,IAAI,OAAO,MAAM,SAASA,UAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,cAAM,QAAQ,QAAQ,CAAC;AACvB,cAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,cAAM,OAAOD,MAAK,KAAK,UAAU,GAAG;AACpC,cAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,QAAAC,UAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,MAC1B,CAAC;AAED,YAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAACA,WAAS,WAAW;AAC7D,YAAI,OAAO,QAAQ;AACjB,iBAAOA,UAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,cAAMC,OAAM,QAAQ,EAAE;AACtB,cAAM,IAAIA,MAAK,EAAE,SAAS,WAAW,GAAG,CAAC,IAAIC,QAAO;AAClD,cAAI,CAAC,MAAMA,KAAI;AACb,gBAAI,IAAI;AACN,oBAAM,KAAK,IAAID,IAAG;AAAA;AAElB,qBAAOD,UAAQ,IAAIC,IAAG;AAAA,UAC1B;AACA,iBAAOD,UAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,QACtC,CAAC;AAAA,MACH,CAAC;AAED,aAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAAA,IAC7D;AAEA,QAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,YAAM,OAAO,CAAC;AAEd,YAAM,EAAE,SAAS,SAAS,WAAW,IAAI,YAAY,KAAK,GAAG;AAC7D,YAAM,QAAQ,CAAC;AAEf,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,cAAM,QAAQ,QAAQ,CAAC;AACvB,cAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,cAAM,OAAOD,MAAK,KAAK,UAAU,GAAG;AACpC,cAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,iBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,gBAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,cAAI;AACF,kBAAMG,MAAK,MAAM,KAAK,KAAK,EAAE,SAAS,WAAW,CAAC;AAClD,gBAAIA,KAAI;AACN,kBAAI,IAAI;AACN,sBAAM,KAAK,GAAG;AAAA;AAEd,uBAAO;AAAA,YACX;AAAA,UACF,SAAS,IAAI;AAAA,UAAC;AAAA,QAChB;AAAA,MACF;AAEA,UAAI,IAAI,OAAO,MAAM;AACnB,eAAO;AAET,UAAI,IAAI;AACN,eAAO;AAET,YAAM,iBAAiB,GAAG;AAAA,IAC5B;AAEA,WAAO,UAAU;AACjB,UAAM,OAAO;AAAA;AAAA;;;AC5Hb;AAAA;AAAA;AAEA,QAAM,UAAU,CAAC,UAAU,CAAC,MAAM;AACjC,YAAM,cAAc,QAAQ,OAAO,QAAQ;AAC3C,YAAM,WAAW,QAAQ,YAAY,QAAQ;AAE7C,UAAI,aAAa,SAAS;AACzB,eAAO;AAAA,MACR;AAEA,aAAO,OAAO,KAAK,WAAW,EAAE,QAAQ,EAAE,KAAK,SAAO,IAAI,YAAY,MAAM,MAAM,KAAK;AAAA,IACxF;AAEA,WAAO,UAAU;AAEjB,WAAO,QAAQ,UAAU;AAAA;AAAA;;;ACfzB;AAAA;AAAA;AAEA,QAAMC,QAAO,UAAQ,WAAM;AAC3B,QAAM,QAAQ;AACd,QAAM,aAAa;AAEnB,aAAS,sBAAsB,QAAQ,gBAAgB;AACnD,YAAMC,OAAM,OAAO,QAAQ,OAAO,QAAQ;AAC1C,YAAM,MAAM,QAAQ,IAAI;AACxB,YAAM,eAAe,OAAO,QAAQ,OAAO;AAE3C,YAAM,kBAAkB,gBAAgB,QAAQ,UAAU,UAAa,CAAC,QAAQ,MAAM;AAItF,UAAI,iBAAiB;AACjB,YAAI;AACA,kBAAQ,MAAM,OAAO,QAAQ,GAAG;AAAA,QACpC,SAAS,KAAK;AAAA,QAEd;AAAA,MACJ;AAEA,UAAI;AAEJ,UAAI;AACA,mBAAW,MAAM,KAAK,OAAO,SAAS;AAAA,UAClC,MAAMA,KAAI,WAAW,EAAE,KAAAA,KAAI,CAAC,CAAC;AAAA,UAC7B,SAAS,iBAAiBD,MAAK,YAAY;AAAA,QAC/C,CAAC;AAAA,MACL,SAAS,GAAG;AAAA,MAEZ,UAAE;AACE,YAAI,iBAAiB;AACjB,kBAAQ,MAAM,GAAG;AAAA,QACrB;AAAA,MACJ;AAIA,UAAI,UAAU;AACV,mBAAWA,MAAK,QAAQ,eAAe,OAAO,QAAQ,MAAM,IAAI,QAAQ;AAAA,MAC5E;AAEA,aAAO;AAAA,IACX;AAEA,aAAS,eAAe,QAAQ;AAC5B,aAAO,sBAAsB,MAAM,KAAK,sBAAsB,QAAQ,IAAI;AAAA,IAC9E;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACnDjB;AAAA;AAAA;AAGA,QAAM,kBAAkB;AAExB,aAAS,cAAc,KAAK;AAExB,YAAM,IAAI,QAAQ,iBAAiB,KAAK;AAExC,aAAO;AAAA,IACX;AAEA,aAAS,eAAe,KAAK,uBAAuB;AAEhD,YAAM,GAAG,GAAG;AAMZ,YAAM,IAAI,QAAQ,WAAW,SAAS;AAKtC,YAAM,IAAI,QAAQ,UAAU,MAAM;AAKlC,YAAM,IAAI,GAAG;AAGb,YAAM,IAAI,QAAQ,iBAAiB,KAAK;AAGxC,UAAI,uBAAuB;AACvB,cAAM,IAAI,QAAQ,iBAAiB,KAAK;AAAA,MAC5C;AAEA,aAAO;AAAA,IACX;AAEA,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,WAAW;AAAA;AAAA;;;AC5C1B;AAAA;AAAA;AACA,WAAO,UAAU;AAAA;AAAA;;;ACDjB;AAAA;AAAA;AACA,QAAM,eAAe;AAErB,WAAO,UAAU,CAAC,SAAS,OAAO;AACjC,YAAME,SAAQ,OAAO,MAAM,YAAY;AAEvC,UAAI,CAACA,QAAO;AACX,eAAO;AAAA,MACR;AAEA,YAAM,CAACC,OAAM,QAAQ,IAAID,OAAM,CAAC,EAAE,QAAQ,QAAQ,EAAE,EAAE,MAAM,GAAG;AAC/D,YAAM,SAASC,MAAK,MAAM,GAAG,EAAE,IAAI;AAEnC,UAAI,WAAW,OAAO;AACrB,eAAO;AAAA,MACR;AAEA,aAAO,WAAW,GAAG,MAAM,IAAI,QAAQ,KAAK;AAAA,IAC7C;AAAA;AAAA;;;AClBA;AAAA;AAAA;AAEA,QAAMC,MAAK,UAAQ,SAAI;AACvB,QAAM,iBAAiB;AAEvB,aAAS,YAAYC,UAAS;AAE1B,YAAM,OAAO;AACb,YAAM,SAAS,OAAO,MAAM,IAAI;AAEhC,UAAI;AAEJ,UAAI;AACA,aAAKD,IAAG,SAASC,UAAS,GAAG;AAC7B,QAAAD,IAAG,SAAS,IAAI,QAAQ,GAAG,MAAM,CAAC;AAClC,QAAAA,IAAG,UAAU,EAAE;AAAA,MACnB,SAAS,GAAG;AAAA,MAAc;AAG1B,aAAO,eAAe,OAAO,SAAS,CAAC;AAAA,IAC3C;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACtBjB;AAAA;AAAA;AAEA,QAAME,QAAO,UAAQ,WAAM;AAC3B,QAAM,iBAAiB;AACvB,QAAMC,UAAS;AACf,QAAM,cAAc;AAEpB,QAAM,QAAQ,QAAQ,aAAa;AACnC,QAAM,qBAAqB;AAC3B,QAAM,kBAAkB;AAExB,aAAS,cAAc,QAAQ;AAC3B,aAAO,OAAO,eAAe,MAAM;AAEnC,YAAM,UAAU,OAAO,QAAQ,YAAY,OAAO,IAAI;AAEtD,UAAI,SAAS;AACT,eAAO,KAAK,QAAQ,OAAO,IAAI;AAC/B,eAAO,UAAU;AAEjB,eAAO,eAAe,MAAM;AAAA,MAChC;AAEA,aAAO,OAAO;AAAA,IAClB;AAEA,aAAS,cAAc,QAAQ;AAC3B,UAAI,CAAC,OAAO;AACR,eAAO;AAAA,MACX;AAGA,YAAM,cAAc,cAAc,MAAM;AAGxC,YAAM,aAAa,CAAC,mBAAmB,KAAK,WAAW;AAIvD,UAAI,OAAO,QAAQ,cAAc,YAAY;AAKzC,cAAM,6BAA6B,gBAAgB,KAAK,WAAW;AAInE,eAAO,UAAUD,MAAK,UAAU,OAAO,OAAO;AAG9C,eAAO,UAAUC,QAAO,QAAQ,OAAO,OAAO;AAC9C,eAAO,OAAO,OAAO,KAAK,IAAI,CAAC,QAAQA,QAAO,SAAS,KAAK,0BAA0B,CAAC;AAEvF,cAAM,eAAe,CAAC,OAAO,OAAO,EAAE,OAAO,OAAO,IAAI,EAAE,KAAK,GAAG;AAElE,eAAO,OAAO,CAAC,MAAM,MAAM,MAAM,IAAI,YAAY,GAAG;AACpD,eAAO,UAAU,QAAQ,IAAI,WAAW;AACxC,eAAO,QAAQ,2BAA2B;AAAA,MAC9C;AAEA,aAAO;AAAA,IACX;AAEA,aAASC,OAAMC,UAAS,MAAM,SAAS;AAEnC,UAAI,QAAQ,CAAC,MAAM,QAAQ,IAAI,GAAG;AAC9B,kBAAU;AACV,eAAO;AAAA,MACX;AAEA,aAAO,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC;AAC/B,gBAAU,OAAO,OAAO,CAAC,GAAG,OAAO;AAGnC,YAAM,SAAS;AAAA,QACX,SAAAA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,UACN,SAAAA;AAAA,UACA;AAAA,QACJ;AAAA,MACJ;AAGA,aAAO,QAAQ,QAAQ,SAAS,cAAc,MAAM;AAAA,IACxD;AAEA,WAAO,UAAUD;AAAA;AAAA;;;AC1FjB;AAAA;AAAA;AAEA,QAAM,QAAQ,QAAQ,aAAa;AAEnC,aAAS,cAAc,UAAU,SAAS;AACtC,aAAO,OAAO,OAAO,IAAI,MAAM,GAAG,OAAO,IAAI,SAAS,OAAO,SAAS,GAAG;AAAA,QACrE,MAAM;AAAA,QACN,OAAO;AAAA,QACP,SAAS,GAAG,OAAO,IAAI,SAAS,OAAO;AAAA,QACvC,MAAM,SAAS;AAAA,QACf,WAAW,SAAS;AAAA,MACxB,CAAC;AAAA,IACL;AAEA,aAAS,iBAAiB,IAAI,QAAQ;AAClC,UAAI,CAAC,OAAO;AACR;AAAA,MACJ;AAEA,YAAM,eAAe,GAAG;AAExB,SAAG,OAAO,SAAU,MAAM,MAAM;AAI5B,YAAI,SAAS,QAAQ;AACjB,gBAAM,MAAM,aAAa,MAAM,QAAQ,OAAO;AAE9C,cAAI,KAAK;AACL,mBAAO,aAAa,KAAK,IAAI,SAAS,GAAG;AAAA,UAC7C;AAAA,QACJ;AAEA,eAAO,aAAa,MAAM,IAAI,SAAS;AAAA,MAC3C;AAAA,IACJ;AAEA,aAAS,aAAa,QAAQ,QAAQ;AAClC,UAAI,SAAS,WAAW,KAAK,CAAC,OAAO,MAAM;AACvC,eAAO,cAAc,OAAO,UAAU,OAAO;AAAA,MACjD;AAEA,aAAO;AAAA,IACX;AAEA,aAAS,iBAAiB,QAAQ,QAAQ;AACtC,UAAI,SAAS,WAAW,KAAK,CAAC,OAAO,MAAM;AACvC,eAAO,cAAc,OAAO,UAAU,WAAW;AAAA,MACrD;AAEA,aAAO;AAAA,IACX;AAEA,WAAO,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA;AAAA;;;AC1DA;AAAA;AAAA;AAEA,QAAM,KAAK,UAAQ,oBAAe;AAClC,QAAME,SAAQ;AACd,QAAM,SAAS;AAEf,aAASC,OAAMC,UAAS,MAAM,SAAS;AAEnC,YAAM,SAASF,OAAME,UAAS,MAAM,OAAO;AAG3C,YAAM,UAAU,GAAG,MAAM,OAAO,SAAS,OAAO,MAAM,OAAO,OAAO;AAIpE,aAAO,iBAAiB,SAAS,MAAM;AAEvC,aAAO;AAAA,IACX;AAEA,aAAS,UAAUA,UAAS,MAAM,SAAS;AAEvC,YAAM,SAASF,OAAME,UAAS,MAAM,OAAO;AAG3C,YAAM,SAAS,GAAG,UAAU,OAAO,SAAS,OAAO,MAAM,OAAO,OAAO;AAGvE,aAAO,QAAQ,OAAO,SAAS,OAAO,iBAAiB,OAAO,QAAQ,MAAM;AAE5E,aAAO;AAAA,IACX;AAEA,WAAO,UAAUD;AACjB,WAAO,QAAQ,QAAQA;AACvB,WAAO,QAAQ,OAAO;AAEtB,WAAO,QAAQ,SAASD;AACxB,WAAO,QAAQ,UAAU;AAAA;AAAA;;;ACtCzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AASrB,aAAS,UAAU,KAAK;AACtB,UAAI,QAAQ,IAAI,YAAY;AAC5B,UAAI,MAAM;AACV,UAAI,kBAAkB;AACtB,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,CAAC,MAAM,QAAW,KAAK;AACpD,YAAI,OAAO,MAAM,WAAW,CAAC;AAE7B,YAAI,QAAQ,QAAQ,MAAM,QAAQ,OAAO,QAAQ,MAAM,QAAQ;AAE/D,0BAAkB,SAAS;AAC3B,YAAI,CAAC,OAAO;AACV;AAAA,QACF;AACA,eAAO,MAAM,CAAC;AAAA,MAChB;AACA,UAAI,IAAI,WAAW,GAAG;AACpB,eAAO;AAAA,MACT;AACA,UAAI,YAAY,SAAS,KAAK,EAAE;AAChC,UAAI,cAAc,aAAa,SAAU,aAAa;AAItD,UAAI,eAAe,cAAc,KAAU,YAAY,SAAU;AAC/D,eAAO,CAAC,UAAU,IAAI,UAAU,kBAAkB,IAAI,EAAE;AAAA,MAC1D;AACA,aAAO,CAAC,OAAO,cAAc,SAAS,GAAG,IAAI,UAAU,kBAAkB,IAAI,EAAE;AAAA,IACjF;AACA,QAAI,kBAAkB;AACtB,aAAS,MAAM,KAAK;AAClB,UAAI,gBAAgB,gBAAgB,KAAK,GAAG;AAC5C,UAAI,CAAC,eAAe;AAClB,eAAO;AAAA,MACT;AACA,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,CAAC,MAAM,MAAM;AACnB,cAAI,UAAU,UAAU,IAAI,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC;AAC/C,cAAI,YAAY,QAAW;AACzB,mBAAO,QAAQ,CAAC;AAChB,iBAAK,QAAQ,CAAC;AACd;AAAA,UACF;AAIA,cAAI,IAAI,IAAI,CAAC,MAAM,MAAM;AACvB,mBAAO;AACP;AACA;AAAA,UACF;AAIA,cAAI,IAAI,WAAW,IAAI,GAAG;AACxB,mBAAO,IAAI,CAAC;AAAA,UACd;AACA;AAAA,QACF;AACA,eAAO,IAAI,CAAC;AAAA,MACd;AACA,aAAO;AAAA,IACT;AACA,WAAO,UAAU,QAAQ;AAAA;AAAA;;;AC3EzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,aAAS,QAAQ,KAAK;AACpB,eAAS,OAAO,UAAU,QAAQ,QAAQ,IAAI,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC3G,cAAM,OAAO,CAAC,IAAI,UAAU,IAAI;AAAA,MAClC;AACA,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,MAAM;AACvB,YAAI,CAAC,IAAI,IAAI,GAAG;AACd,iBAAO;AAAA,QACT;AACA,cAAM,IAAI,IAAI;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AACA,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACjBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,aAAS,aAAa,KAAK;AACzB,eAAS,OAAO,UAAU,QAAQ,QAAQ,IAAI,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC3G,cAAM,OAAO,CAAC,IAAI,UAAU,IAAI;AAAA,MAClC;AACA,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,MAAM;AACvB,YAAI,CAAC,IAAI,IAAI,GAAG;AACd,cAAI,IAAI,IAAI,CAAC;AAAA,QACf;AACA,cAAM,IAAI,IAAI;AAAA,MAChB;AAAA,IACF;AACA,WAAO,UAAU,QAAQ;AAAA;AAAA;;;AChBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,aAAS,cAAc,KAAK;AAC1B,UAAI,IAAI;AACR,UAAI,eAAe,IAAI,QAAQ,IAAI;AACnC,UAAI,UAAU;AACd,aAAO,gBAAgB,GAAG;AACxB,YAAI,IAAI,IAAI,MAAM,SAAS,YAAY;AACvC,YAAI,aAAa,IAAI,QAAQ,MAAM,eAAe,CAAC;AACnD,YAAI,aAAa,GAAG;AAClB,iBAAO;AAAA,QACT;AACA,kBAAU,aAAa;AACvB,uBAAe,IAAI,QAAQ,MAAM,OAAO;AAAA,MAC1C;AACA,UAAI,IAAI,IAAI,MAAM,OAAO;AACzB,aAAO;AAAA,IACT;AACA,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,QAAQ,QAAQ,gBAAgB,QAAQ,UAAU,QAAQ,eAAe;AACjF,QAAI,SAAS,uBAAuB,eAAkB;AACtD,YAAQ,QAAQ,OAAO,SAAS;AAChC,QAAI,WAAW,uBAAuB,iBAAoB;AAC1D,YAAQ,UAAU,SAAS,SAAS;AACpC,QAAI,gBAAgB,uBAAuB,sBAAyB;AACpE,YAAQ,eAAe,cAAc,SAAS;AAC9C,QAAI,iBAAiB,uBAAuB,uBAA0B;AACtE,YAAQ,gBAAgB,eAAe,SAAS;AAChD,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAAA;AAAA;;;ACZhG;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ;AACZ,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,QAAI,YAAY,SAASG,WAAU,KAAK,QAAQ;AAC9C,UAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;AAC3C,eAAO;AAAA,MACT;AACA,UAAI,SAAS,IAAI,IAAI,YAAY;AACjC,eAAS,KAAK,KAAK;AACjB,YAAI,CAAC,IAAI,eAAe,CAAC,GAAG;AAC1B;AAAA,QACF;AACA,YAAI,QAAQ,IAAI,CAAC;AACjB,YAAI,OAAO,OAAO;AAClB,YAAI,MAAM,YAAY,SAAS,UAAU;AACvC,cAAI,QAAQ;AACV,mBAAO,CAAC,IAAI;AAAA,UACd;AAAA,QACF,WAAW,iBAAiB,OAAO;AACjC,iBAAO,CAAC,IAAI,MAAM,IAAI,SAAU,GAAG;AACjC,mBAAOA,WAAU,GAAG,MAAM;AAAA,UAC5B,CAAC;AAAA,QACH,OAAO;AACL,iBAAO,CAAC,IAAIA,WAAU,OAAO,MAAM;AAAA,QACrC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAIC,QAAoB,2BAAY;AAClC,eAASA,MAAK,MAAM;AAClB,YAAI,SAAS,QAAQ;AACnB,iBAAO,CAAC;AAAA,QACV;AACA,eAAO,OAAO,MAAM,IAAI;AACxB,aAAK,SAAS,KAAK,UAAU,CAAC;AAC9B,aAAK,OAAO,SAAS,KAAK,OAAO,UAAU;AAC3C,aAAK,OAAO,QAAQ,KAAK,OAAO,SAAS;AAAA,MAC3C;AACA,UAAI,SAASA,MAAK;AAClB,aAAO,SAAS,SAAS,SAAS;AAChC,YAAI,KAAK,QAAQ;AACf,eAAK,OAAO,YAAY,IAAI;AAAA,QAC9B;AACA,aAAK,SAAS;AACd,eAAO;AAAA,MACT;AACA,aAAO,cAAc,SAAS,cAAc;AAC1C,YAAI,KAAK,QAAQ;AACf,mBAAS,SAAS,WAAW;AAC3B,iBAAK,OAAO,aAAa,MAAM,UAAU,KAAK,CAAC;AAAA,UACjD;AACA,eAAK,OAAO;AAAA,QACd;AACA,eAAO;AAAA,MACT;AACA,aAAO,OAAO,SAAS,OAAO;AAC5B,eAAO,KAAK,OAAO,GAAG,KAAK,OAAO,MAAM,IAAI,IAAI,CAAC;AAAA,MACnD;AACA,aAAO,OAAO,SAAS,OAAO;AAC5B,eAAO,KAAK,OAAO,GAAG,KAAK,OAAO,MAAM,IAAI,IAAI,CAAC;AAAA,MACnD;AACA,aAAO,QAAQ,SAAS,MAAM,WAAW;AACvC,YAAI,cAAc,QAAQ;AACxB,sBAAY,CAAC;AAAA,QACf;AACA,YAAI,SAAS,UAAU,IAAI;AAC3B,iBAAS,QAAQ,WAAW;AAC1B,iBAAO,IAAI,IAAI,UAAU,IAAI;AAAA,QAC/B;AACA,eAAO;AAAA,MACT;AAWA,aAAO,4BAA4B,SAAS,0BAA0B,MAAM,OAAO,cAAc;AAC/F,YAAI,CAAC,KAAK,MAAM;AACd,eAAK,OAAO,CAAC;AAAA,QACf;AACA,YAAI,gBAAgB,KAAK,IAAI;AAC7B,YAAI,kBAAkB,KAAK,KAAK,IAAI;AACpC,aAAK,IAAI,IAAI,gBAAgB;AAC7B,YAAI,mBAAmB,iBAAiB,OAAO;AAC7C,eAAK,KAAK,IAAI,KAAK,mBAAmB,iBAAiB;AAAA,QACzD,OAAO;AACL,iBAAO,KAAK,KAAK,IAAI;AAAA,QACvB;AAAA,MACF;AAUA,aAAO,uBAAuB,SAAS,qBAAqB,MAAM,OAAO,cAAc;AACrF,YAAI,CAAC,KAAK,MAAM;AACd,eAAK,OAAO,CAAC;AAAA,QACf;AACA,aAAK,IAAI,IAAI;AACb,aAAK,KAAK,IAAI,IAAI;AAAA,MACpB;AASA,aAAO,2BAA2B,SAAS,yBAAyB,MAAM,OAAO;AAC/E,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,MAAM;AACb,iBAAO,KAAK,KAAK,IAAI;AAAA,QACvB;AAAA,MACF;AAOA,aAAO,eAAe,SAAS,aAAa,MAAM,QAAQ;AACxD,YAAI,KAAK,UAAU,KAAK,OAAO,SAAS,KAAK,OAAO,KAAK;AACvD,cAAI,KAAK,OAAO,MAAM,OAAO,MAAM;AACjC,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,OAAO,IAAI,OAAO,MAAM;AAC/B,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,OAAO,MAAM,SAAS,QAAQ,KAAK,OAAO,MAAM,SAAS,QAAQ;AACxE,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,OAAO,IAAI,SAAS,QAAQ,KAAK,OAAO,IAAI,SAAS,QAAQ;AACpE,mBAAO;AAAA,UACT;AACA,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AACA,aAAO,oBAAoB,SAAS,kBAAkB,MAAM;AAC1D,eAAO,KAAK,QAAQ,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI;AAAA,MAClD;AACA,aAAO,gBAAgB,SAAS,gBAAgB;AAC9C,eAAO,OAAO,KAAK,kBAAkB,OAAO,CAAC;AAAA,MAC/C;AACA,aAAO,WAAW,SAAS,WAAW;AACpC,eAAO,CAAC,KAAK,gBAAgB,KAAK,cAAc,GAAG,KAAK,aAAa,EAAE,KAAK,EAAE;AAAA,MAChF;AACA,mBAAaA,OAAM,CAAC;AAAA,QAClB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,cAAI,WAAW,KAAK,QAAQ,KAAK,KAAK,UAAU,KAAK,KAAK,OAAO;AACjE,cAAI,aAAa,QAAW;AAC1B,uBAAW,KAAK,UAAU,KAAK,OAAO;AAAA,UACxC;AACA,iBAAO,YAAY;AAAA,QACrB;AAAA,QACA,KAAK,SAAS,IAAI,KAAK;AACrB,WAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,QAAQ;AAC9C,eAAK,KAAK,OAAO,SAAS;AAAA,QAC5B;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,cAAI,WAAW,KAAK,QAAQ,KAAK,KAAK,UAAU,KAAK,KAAK,OAAO;AACjE,cAAI,aAAa,QAAW;AAC1B,uBAAW,KAAK,OAAO;AAAA,UACzB;AACA,iBAAO,YAAY;AAAA,QACrB;AAAA,QACA,KAAK,SAAS,IAAI,KAAK;AACrB,WAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,QAAQ;AAC9C,eAAK,KAAK,OAAO,QAAQ;AAAA,QAC3B;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE;AACF,YAAQ,SAAS,IAAIA;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;AC/LzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,YAAY,QAAQ,MAAM,QAAQ,SAAS,QAAQ,WAAW,QAAQ,OAAO,QAAQ,SAAS,QAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAQ,aAAa,QAAQ,QAAQ,QAAQ,YAAY;AAChN,QAAI,MAAM;AACV,YAAQ,MAAM;AACd,QAAI,SAAS;AACb,YAAQ,SAAS;AACjB,QAAI,WAAW;AACf,YAAQ,WAAW;AACnB,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAI,SAAS;AACb,YAAQ,SAAS;AACjB,QAAI,UAAU;AACd,YAAQ,UAAU;AAClB,QAAI,KAAK;AACT,YAAQ,KAAK;AACb,QAAI,UAAU;AACd,YAAQ,UAAU;AAClB,QAAI,aAAa;AACjB,YAAQ,aAAa;AACrB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,YAAY;AAChB,YAAQ,YAAY;AACpB,QAAI,YAAY;AAChB,YAAQ,YAAY;AAAA;AAAA;;;AC3BpB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAIC,SAAQ,wBAAwB,eAAkB;AACtD,aAAS,yBAAyB,aAAa;AAAE,UAAI,OAAO,YAAY,WAAY,QAAO;AAAM,UAAI,oBAAoB,oBAAI,QAAQ;AAAG,UAAI,mBAAmB,oBAAI,QAAQ;AAAG,cAAQ,2BAA2B,SAASC,0BAAyBC,cAAa;AAAE,eAAOA,eAAc,mBAAmB;AAAA,MAAmB,GAAG,WAAW;AAAA,IAAG;AAC9U,aAAS,wBAAwB,KAAK,aAAa;AAAE,UAAI,CAAC,eAAe,OAAO,IAAI,YAAY;AAAE,eAAO;AAAA,MAAK;AAAE,UAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY;AAAE,eAAO,EAAE,WAAW,IAAI;AAAA,MAAG;AAAE,UAAI,QAAQ,yBAAyB,WAAW;AAAG,UAAI,SAAS,MAAM,IAAI,GAAG,GAAG;AAAE,eAAO,MAAM,IAAI,GAAG;AAAA,MAAG;AAAE,UAAI,SAAS,CAAC;AAAG,UAAI,wBAAwB,OAAO,kBAAkB,OAAO;AAA0B,eAAS,OAAO,KAAK;AAAE,YAAI,QAAQ,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAAE,cAAI,OAAO,wBAAwB,OAAO,yBAAyB,KAAK,GAAG,IAAI;AAAM,cAAI,SAAS,KAAK,OAAO,KAAK,MAAM;AAAE,mBAAO,eAAe,QAAQ,KAAK,IAAI;AAAA,UAAG,OAAO;AAAE,mBAAO,GAAG,IAAI,IAAI,GAAG;AAAA,UAAG;AAAA,QAAE;AAAA,MAAE;AAAE,aAAO,SAAS,IAAI;AAAK,UAAI,OAAO;AAAE,cAAM,IAAI,KAAK,MAAM;AAAA,MAAG;AAAE,aAAO;AAAA,IAAQ;AACxyB,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,gCAAgC,GAAG,gBAAgB;AAAE,UAAI,KAAK,OAAO,WAAW,eAAe,EAAE,OAAO,QAAQ,KAAK,EAAE,YAAY;AAAG,UAAI,GAAI,SAAQ,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,KAAK,EAAE;AAAG,UAAI,MAAM,QAAQ,CAAC,MAAM,KAAK,4BAA4B,CAAC,MAAM,kBAAkB,KAAK,OAAO,EAAE,WAAW,UAAU;AAAE,YAAI,GAAI,KAAI;AAAI,YAAI,IAAI;AAAG,eAAO,WAAY;AAAE,cAAI,KAAK,EAAE,OAAQ,QAAO,EAAE,MAAM,KAAK;AAAG,iBAAO,EAAE,MAAM,OAAO,OAAO,EAAE,GAAG,EAAE;AAAA,QAAG;AAAA,MAAG;AAAE,YAAM,IAAI,UAAU,uIAAuI;AAAA,IAAG;AAC3lB,aAAS,4BAA4B,GAAG,QAAQ;AAAE,UAAI,CAAC,EAAG;AAAQ,UAAI,OAAO,MAAM,SAAU,QAAO,kBAAkB,GAAG,MAAM;AAAG,UAAI,IAAI,OAAO,UAAU,SAAS,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE;AAAG,UAAI,MAAM,YAAY,EAAE,YAAa,KAAI,EAAE,YAAY;AAAM,UAAI,MAAM,SAAS,MAAM,MAAO,QAAO,MAAM,KAAK,CAAC;AAAG,UAAI,MAAM,eAAe,2CAA2C,KAAK,CAAC,EAAG,QAAO,kBAAkB,GAAG,MAAM;AAAA,IAAG;AAC/Z,aAAS,kBAAkB,KAAK,KAAK;AAAE,UAAI,OAAO,QAAQ,MAAM,IAAI,OAAQ,OAAM,IAAI;AAAQ,eAAS,IAAI,GAAG,OAAO,IAAI,MAAM,GAAG,GAAG,IAAI,KAAK,KAAK;AAAE,aAAK,CAAC,IAAI,IAAI,CAAC;AAAA,MAAG;AAAE,aAAO;AAAA,IAAM;AACtL,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,YAAyB,yBAAU,OAAO;AAC5C,qBAAeE,YAAW,KAAK;AAC/B,eAASA,WAAU,MAAM;AACvB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,YAAI,CAAC,MAAM,OAAO;AAChB,gBAAM,QAAQ,CAAC;AAAA,QACjB;AACA,eAAO;AAAA,MACT;AACA,UAAI,SAASA,WAAU;AACvB,aAAO,SAAS,SAAS,OAAO,UAAU;AACxC,iBAAS,SAAS;AAClB,aAAK,MAAM,KAAK,QAAQ;AACxB,eAAO;AAAA,MACT;AACA,aAAO,UAAU,SAAS,QAAQ,UAAU;AAC1C,iBAAS,SAAS;AAClB,aAAK,MAAM,QAAQ,QAAQ;AAC3B,eAAO;AAAA,MACT;AACA,aAAO,KAAK,SAAS,GAAG,OAAO;AAC7B,eAAO,KAAK,MAAM,KAAK;AAAA,MACzB;AACA,aAAO,QAAQ,SAAS,MAAM,OAAO;AACnC,YAAI,OAAO,UAAU,UAAU;AAC7B,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,MAAM,QAAQ,KAAK;AAAA,MACjC;AACA,aAAO,cAAc,SAAS,YAAY,OAAO;AAC/C,gBAAQ,KAAK,MAAM,KAAK;AACxB,aAAK,GAAG,KAAK,EAAE,SAAS;AACxB,aAAK,MAAM,OAAO,OAAO,CAAC;AAC1B,YAAI;AACJ,iBAASC,OAAM,KAAK,SAAS;AAC3B,kBAAQ,KAAK,QAAQA,GAAE;AACvB,cAAI,SAAS,OAAO;AAClB,iBAAK,QAAQA,GAAE,IAAI,QAAQ;AAAA,UAC7B;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,aAAO,YAAY,SAAS,YAAY;AACtC,iBAAS,YAAY,gCAAgC,KAAK,KAAK,GAAG,OAAO,EAAE,QAAQ,UAAU,GAAG,QAAO;AACrG,cAAI,OAAO,MAAM;AACjB,eAAK,SAAS;AAAA,QAChB;AACA,aAAK,QAAQ,CAAC;AACd,eAAO;AAAA,MACT;AACA,aAAO,QAAQ,SAASC,SAAQ;AAC9B,eAAO,KAAK,UAAU;AAAA,MACxB;AACA,aAAO,cAAc,SAAS,YAAY,SAAS,SAAS;AAC1D,gBAAQ,SAAS;AACjB,YAAI,WAAW,KAAK,MAAM,OAAO;AACjC,aAAK,MAAM,OAAO,WAAW,GAAG,GAAG,OAAO;AAC1C,gBAAQ,SAAS;AACjB,YAAI;AACJ,iBAASD,OAAM,KAAK,SAAS;AAC3B,kBAAQ,KAAK,QAAQA,GAAE;AACvB,cAAI,YAAY,OAAO;AACrB,iBAAK,QAAQA,GAAE,IAAI,QAAQ;AAAA,UAC7B;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,aAAO,eAAe,SAAS,aAAa,SAAS,SAAS;AAC5D,gBAAQ,SAAS;AACjB,YAAI,WAAW,KAAK,MAAM,OAAO;AACjC,aAAK,MAAM,OAAO,UAAU,GAAG,OAAO;AACtC,gBAAQ,SAAS;AACjB,YAAI;AACJ,iBAASA,OAAM,KAAK,SAAS;AAC3B,kBAAQ,KAAK,QAAQA,GAAE;AACvB,cAAI,SAAS,UAAU;AACrB,iBAAK,QAAQA,GAAE,IAAI,QAAQ;AAAA,UAC7B;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,aAAO,uBAAuB,SAAS,qBAAqB,MAAM,KAAK;AACrE,YAAI,QAAQ;AACZ,aAAK,KAAK,SAAU,MAAM;AACxB,cAAI,KAAK,YAAY;AACnB,gBAAI,aAAa,KAAK,WAAW,MAAM,GAAG;AAC1C,gBAAI,YAAY;AACd,sBAAQ;AACR,qBAAO;AAAA,YACT;AAAA,UACF,WAAW,KAAK,aAAa,MAAM,GAAG,GAAG;AACvC,oBAAQ;AACR,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AACD,eAAO;AAAA,MACT;AAeA,aAAO,aAAa,SAAS,WAAW,MAAM,KAAK;AACjD,YAAI,KAAK,aAAa,MAAM,GAAG,GAAG;AAChC,iBAAO,KAAK,qBAAqB,MAAM,GAAG,KAAK;AAAA,QACjD,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,oBAAoB,SAAS,oBAAoB;AACtD,YAAI,KAAK,QAAQ,KAAK,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;AACzD,eAAK,SAAS,KAAK,UAAU,CAAC;AAC9B,eAAK,OAAO,MAAM,KAAK,OAAO,OAAO,CAAC;AACtC,iBAAO,OAAO,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO,GAAG;AAAA,QACrD;AAAA,MACF;AACA,aAAO,OAAO,SAAS,KAAK,UAAU;AACpC,YAAI,CAAC,KAAK,UAAU;AAClB,eAAK,WAAW;AAAA,QAClB;AACA,YAAI,CAAC,KAAK,SAAS;AACjB,eAAK,UAAU,CAAC;AAAA,QAClB;AACA,aAAK;AACL,YAAIA,MAAK,KAAK;AACd,aAAK,QAAQA,GAAE,IAAI;AACnB,YAAI,CAAC,KAAK,QAAQ;AAChB,iBAAO;AAAA,QACT;AACA,YAAI,OAAO;AACX,eAAO,KAAK,QAAQA,GAAE,IAAI,KAAK,QAAQ;AACrC,kBAAQ,KAAK,QAAQA,GAAE;AACvB,mBAAS,SAAS,KAAK,GAAG,KAAK,GAAG,KAAK;AACvC,cAAI,WAAW,OAAO;AACpB;AAAA,UACF;AACA,eAAK,QAAQA,GAAE,KAAK;AAAA,QACtB;AACA,eAAO,KAAK,QAAQA,GAAE;AACtB,YAAI,WAAW,OAAO;AACpB,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,OAAO,SAASE,MAAK,UAAU;AACpC,eAAO,KAAK,KAAK,SAAU,MAAM,GAAG;AAClC,cAAI,SAAS,SAAS,MAAM,CAAC;AAC7B,cAAI,WAAW,SAAS,KAAK,QAAQ;AACnC,qBAAS,KAAK,KAAK,QAAQ;AAAA,UAC7B;AACA,cAAI,WAAW,OAAO;AACpB,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,iBAAiB,SAAS,eAAe,UAAU;AACxD,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAAST,OAAM,WAAW;AACrC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,cAAc,SAAS,YAAY,UAAU;AAClD,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,OAAO;AACjC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,kBAAkB,SAAS,gBAAgB,UAAU;AAC1D,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,YAAY;AACtC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,eAAe,SAAS,aAAa,UAAU;AACpD,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,SAAS;AACnC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,UAAU,SAAS,QAAQ,UAAU;AAC1C,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,IAAI;AAC9B,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,cAAc,SAAS,YAAY,UAAU;AAClD,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,SAAS;AACnC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,cAAc,SAAS,YAAY,UAAU;AAClD,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,QAAQ;AAClC,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,WAAW,SAAS,SAAS,UAAU;AAC5C,YAAI,SAAS;AACb,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,KAAK;AAC/B,mBAAO,SAAS,KAAK,QAAQ,QAAQ;AAAA,UACvC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,iBAAiB,SAAS,eAAe,UAAU;AACxD,YAAI,UAAU;AACd,eAAO,KAAK,KAAK,SAAU,UAAU;AACnC,cAAI,SAAS,SAASA,OAAM,WAAW;AACrC,mBAAO,SAAS,KAAK,SAAS,QAAQ;AAAA,UACxC;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,QAAQ,SAAS,MAAM,UAAU;AACtC,YAAI,UAAU;AACd,YAAI,UAAU,CAAC;AACf,eAAO,KAAK,OAAO,SAAU,MAAM,MAAM,OAAO;AAC9C,cAAIU,SAAQ,SAAS,KAAK,SAAS,IAAI;AACvC,kBAAQ,KAAK,IAAI;AACjB,cAAIA,QAAO;AACT,iBAAK,KAAK,OAAO;AACjB,sBAAU,CAAC;AAAA,UACb,WAAW,UAAU,QAAQ,SAAS,GAAG;AACvC,iBAAK,KAAK,OAAO;AAAA,UACnB;AACA,iBAAO;AAAA,QACT,GAAG,CAAC,CAAC;AAAA,MACP;AACA,aAAO,MAAM,SAAS,IAAI,UAAU;AAClC,eAAO,KAAK,MAAM,IAAI,QAAQ;AAAA,MAChC;AACA,aAAO,SAAS,SAAS,OAAO,UAAU,MAAM;AAC9C,eAAO,KAAK,MAAM,OAAO,UAAU,IAAI;AAAA,MACzC;AACA,aAAO,QAAQ,SAAS,MAAM,UAAU;AACtC,eAAO,KAAK,MAAM,MAAM,QAAQ;AAAA,MAClC;AACA,aAAO,OAAO,SAAS,KAAK,UAAU;AACpC,eAAO,KAAK,MAAM,KAAK,QAAQ;AAAA,MACjC;AACA,aAAO,SAAS,SAASC,QAAO,UAAU;AACxC,eAAO,KAAK,MAAM,OAAO,QAAQ;AAAA,MACnC;AACA,aAAO,OAAO,SAAS,KAAK,UAAU;AACpC,eAAO,KAAK,MAAM,KAAK,QAAQ;AAAA,MACjC;AACA,aAAO,WAAW,SAAS,WAAW;AACpC,eAAO,KAAK,IAAI,MAAM,EAAE,KAAK,EAAE;AAAA,MACjC;AACA,mBAAaL,YAAW,CAAC;AAAA,QACvB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,GAAG,CAAC;AAAA,QAClB;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,GAAG,KAAK,SAAS,CAAC;AAAA,QAChC;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,MAAM;AAAA,QACpB;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACnTzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASM,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,OAAoB,yBAAU,YAAY;AAC5C,qBAAeE,OAAM,UAAU;AAC/B,eAASA,MAAK,MAAM;AAClB,YAAI;AACJ,gBAAQ,WAAW,KAAK,MAAM,IAAI,KAAK;AACvC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,UAAI,SAASA,MAAK;AAClB,aAAO,WAAW,SAAS,WAAW;AACpC,YAAI,MAAM,KAAK,OAAO,SAAU,MAAM,UAAU;AAC9C,eAAK,KAAK,OAAO,QAAQ,CAAC;AAC1B,iBAAO;AAAA,QACT,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG;AACf,eAAO,KAAK,gBAAgB,MAAM,MAAM;AAAA,MAC1C;AACA,aAAO,QAAQ,SAASC,OAAM,SAAS,SAAS;AAC9C,YAAI,KAAK,QAAQ;AACf,iBAAO,KAAK,OAAO,SAAS,OAAO;AAAA,QACrC,OAAO;AACL,iBAAO,IAAI,MAAM,OAAO;AAAA,QAC1B;AAAA,MACF;AACA,mBAAaD,OAAM,CAAC;AAAA,QAClB,KAAK;AAAA,QACL,KAAK,SAAS,IAAI,SAAS;AACzB,eAAK,SAAS;AAAA,QAChB;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;AC3CzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASE,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,WAAwB,yBAAU,YAAY;AAChD,qBAAeE,WAAU,UAAU;AACnC,eAASA,UAAS,MAAM;AACtB,YAAI;AACJ,gBAAQ,WAAW,KAAK,MAAM,IAAI,KAAK;AACvC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAGA,QAAI,SAAS,CAAC;AACd,QAAI,iBAAiB,OAAO;AAC5B,QAAI,QAAQ,SAASC,OAAM,SAASC,WAAU;AAC7C,UAAI,CAAC,SAAS;AACb,eAAOA;AAAA,MACR;AACA,UAAI,SAAS,CAAC;AACd,eAAS,OAAOA,WAAU;AAGzB,eAAO,GAAG,IAAI,eAAe,KAAK,SAAS,GAAG,IAAI,QAAQ,GAAG,IAAIA,UAAS,GAAG;AAAA,MAC9E;AACA,aAAO;AAAA,IACR;AAEA,QAAI,uBAAuB;AAC3B,QAAI,oBAAoB;AAExB,QAAI,uBAAuB;AAG3B,QAAI,SAAS,SAASC,QAAO,QAAQ,SAAS;AAC7C,gBAAU,MAAM,SAASA,QAAO,OAAO;AACvC,UAAI,QAAQ,UAAU,YAAY,QAAQ,UAAU,UAAU;AAC7D,gBAAQ,SAAS;AAAA,MAClB;AACA,UAAI,QAAQ,QAAQ,UAAU,WAAW,MAAM;AAC/C,UAAI,eAAe,QAAQ;AAE3B,UAAI,YAAY,OAAO,OAAO,CAAC;AAC/B,UAAI,SAAS;AACb,UAAI,UAAU;AACd,UAAI,SAAS,OAAO;AACpB,aAAO,UAAU,QAAQ;AACxB,YAAI,YAAY,OAAO,OAAO,SAAS;AACvC,YAAI,YAAY,UAAU,WAAW;AACrC,YAAI,QAAQ;AAEZ,YAAI,YAAY,MAAQ,YAAY,KAAM;AACzC,cAAI,aAAa,SAAU,aAAa,SAAU,UAAU,QAAQ;AAEnE,gBAAI,QAAQ,OAAO,WAAW,SAAS;AACvC,iBAAK,QAAQ,UAAW,OAAQ;AAE/B,4BAAc,YAAY,SAAU,OAAO,QAAQ,QAAS;AAAA,YAC7D,OAAO;AAGN;AAAA,YACD;AAAA,UACD;AACA,kBAAQ,OAAO,UAAU,SAAS,EAAE,EAAE,YAAY,IAAI;AAAA,QACvD,OAAO;AACN,cAAI,QAAQ,kBAAkB;AAC7B,gBAAI,qBAAqB,KAAK,SAAS,GAAG;AACzC,sBAAQ,OAAO;AAAA,YAChB,OAAO;AACN,sBAAQ,OAAO,UAAU,SAAS,EAAE,EAAE,YAAY,IAAI;AAAA,YACvD;AAAA,UACD,WAAW,iBAAiB,KAAK,SAAS,GAAG;AAC5C,oBAAQ,OAAO,UAAU,SAAS,EAAE,EAAE,YAAY,IAAI;AAAA,UACvD,WAAW,aAAa,QAAQ,CAAC,iBAAiB,aAAa,OAAO,SAAS,aAAa,aAAa,OAAQ,SAAS,cAAc,gBAAgB,kBAAkB,KAAK,SAAS,GAAG;AAC1L,oBAAQ,OAAO;AAAA,UAChB,OAAO;AACN,oBAAQ;AAAA,UACT;AAAA,QACD;AACA,kBAAU;AAAA,MACX;AAEA,UAAI,cAAc;AACjB,YAAI,UAAU,KAAK,MAAM,GAAG;AAC3B,mBAAS,QAAQ,OAAO,MAAM,CAAC;AAAA,QAChC,WAAW,KAAK,KAAK,SAAS,GAAG;AAChC,mBAAS,QAAQ,YAAY,MAAM,OAAO,MAAM,CAAC;AAAA,QAClD;AAAA,MACD;AAKA,eAAS,OAAO,QAAQ,sBAAsB,SAAU,IAAI,IAAI,IAAI;AACnE,YAAI,MAAM,GAAG,SAAS,GAAG;AAExB,iBAAO;AAAA,QACR;AAEA,gBAAQ,MAAM,MAAM;AAAA,MACrB,CAAC;AAED,UAAI,CAAC,gBAAgB,QAAQ,MAAM;AAClC,eAAO,QAAQ,SAAS;AAAA,MACzB;AACA,aAAO;AAAA,IACR;AAGA,WAAO,UAAU;AAAA,MAChB,oBAAoB;AAAA,MACpB,gBAAgB;AAAA,MAChB,UAAU;AAAA,MACV,QAAQ;AAAA,IACT;AAEA,WAAO,UAAU;AAEjB,WAAO,UAAU;AAAA;AAAA;;;AC7GjB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,UAAU,uBAAuB,gBAAiB;AACtD,QAAI,QAAQ;AACZ,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,YAAyB,yBAAU,OAAO;AAC5C,qBAAeE,YAAW,KAAK;AAC/B,eAASA,WAAU,MAAM;AACvB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,cAAM,eAAe;AACrB,eAAO;AAAA,MACT;AACA,UAAI,SAASA,WAAU;AACvB,aAAO,gBAAgB,SAAS,gBAAgB;AAC9C,eAAO,MAAM,MAAM,UAAU,cAAc,KAAK,IAAI;AAAA,MACtD;AACA,mBAAaA,YAAW,CAAC;AAAA,QACvB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,KAAK,SAAS,IAAI,GAAG;AACnB,cAAI,KAAK,cAAc;AACrB,gBAAI,WAAW,GAAG,QAAQ,SAAS,GAAG,GAAG;AAAA,cACvC,cAAc;AAAA,YAChB,CAAC;AACD,gBAAI,YAAY,GAAG;AACjB,eAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,mBAAK,KAAK,QAAQ;AAAA,YACpB,WAAW,KAAK,MAAM;AACpB,qBAAO,KAAK,KAAK;AAAA,YACnB;AAAA,UACF;AACA,eAAK,SAAS;AAAA,QAChB;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACjDzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,UAAuB,yBAAU,OAAO;AAC1C,qBAAeE,UAAS,KAAK;AAC7B,eAASA,SAAQ,MAAM;AACrB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,KAAkB,yBAAU,OAAO;AACrC,qBAAeE,KAAI,KAAK;AACxB,eAASA,IAAG,MAAM;AAChB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,UAAI,SAASA,IAAG;AAChB,aAAO,gBAAgB,SAAS,gBAAgB;AAC9C,eAAO,MAAM,MAAM,UAAU,cAAc,KAAK,IAAI;AAAA,MACtD;AACA,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACxBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,UAAU,uBAAuB,gBAAiB;AACtD,QAAI,QAAQ;AACZ,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,YAAyB,yBAAU,OAAO;AAC5C,qBAAeE,YAAW,KAAK;AAC/B,eAASA,aAAY;AACnB,eAAO,MAAM,MAAM,MAAM,SAAS,KAAK;AAAA,MACzC;AACA,UAAI,SAASA,WAAU;AACvB,aAAO,gBAAgB,SAAS,cAAc,OAAO;AACnD,YAAI,KAAK,WAAW;AAClB,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,gBAAgB,SAAS,gBAAgB;AAC9C,eAAO,KAAK,cAAc,MAAM,UAAU,cAAc,KAAK,IAAI,CAAC;AAAA,MACpE;AACA,mBAAaA,YAAW,CAAC;AAAA,QACvB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,KAAK,SAAS,IAAI,WAAW;AAC3B,cAAI,cAAc,QAAQ,cAAc,OAAO,cAAc,KAAK;AAChE,iBAAK,aAAa;AAClB,gBAAI,KAAK,MAAM;AACb,qBAAO,KAAK,KAAK;AAAA,YACnB;AACA;AAAA,UACF;AACA,cAAI,WAAW,GAAG,QAAQ,SAAS,GAAG,WAAW;AAAA,YAC/C,cAAc;AAAA,UAChB,CAAC;AACD,eAAK,aAAa;AAClB,cAAI,YAAY,WAAW;AACzB,aAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,iBAAK,KAAK,YAAY;AAAA,UACxB,WAAW,KAAK,MAAM;AACpB,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,KAAK,SAAS,IAAI,WAAW;AAC3B,eAAK,YAAY;AAAA,QACnB;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,cAAI,KAAK,WAAW;AAClB,gBAAI,KAAK,KAAK,kBAAkB,WAAW;AAC3C,gBAAI,OAAO,MAAM;AACf,qBAAO;AAAA,YACT,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AAErB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;AC/EzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,MAAmB,yBAAU,YAAY;AAC3C,qBAAeE,MAAK,UAAU;AAC9B,eAASA,KAAI,MAAM;AACjB,YAAI;AACJ,gBAAQ,WAAW,KAAK,MAAM,IAAI,KAAK;AACvC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAIE,UAAsB,yBAAU,OAAO;AACzC,qBAAeA,SAAQ,KAAK;AAC5B,eAASA,QAAO,MAAM;AACpB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAIA;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,SAAsB,yBAAU,YAAY;AAC9C,qBAAeE,SAAQ,UAAU;AACjC,eAASA,QAAO,MAAM;AACpB,YAAI;AACJ,gBAAQ,WAAW,KAAK,MAAM,IAAI,KAAK;AACvC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,UAAI,SAASA,QAAO;AACpB,aAAO,WAAW,SAAS,WAAW;AACpC,YAAI,SAAS,KAAK,SAAS,MAAM,KAAK,IAAI,MAAM,EAAE,KAAK,GAAG,IAAI,MAAM;AACpE,eAAO,CAAC,KAAK,gBAAgB,KAAK,kBAAkB,OAAO,GAAG,QAAQ,KAAK,aAAa,EAAE,KAAK,EAAE;AAAA,MACnG;AACA,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACzBzB,IAAAC,gBAAA;AAAA;AAKA,WAAO,UAAU,UAAQ,WAAM,EAAE;AAAA;AAAA;;;ACLjC;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,YAAQ,gBAAgB;AACxB,QAAI,UAAU,uBAAuB,gBAAiB;AACtD,QAAI,SAAS,uBAAuB,eAAwB;AAC5D,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,QAAI;AACJ,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,YAAY;AAChB,QAAI,oBAAoB;AACxB,QAAI,kCAAkC,UAAU,WAAY;AAAA,IAAC,GAAG,sIAA2I;AAC3M,QAAI,mCAAmC,UAAU,WAAY;AAAA,IAAC,GAAG,0FAA0F;AAC3J,QAAI,8BAA8B,UAAU,WAAY;AAAA,IAAC,GAAG,sIAAsI;AAClM,aAAS,cAAc,OAAO;AAC5B,UAAI,kBAAkB;AACtB,UAAI,YAAY;AAChB,UAAI,YAAY;AAChB,UAAI,IAAI,UAAU,MAAM,iBAAiB;AACzC,UAAI,GAAG;AACL,oBAAY,EAAE,CAAC;AACf,oBAAY,EAAE,CAAC;AAAA,MACjB;AACA,mBAAa,GAAG,OAAO,SAAS,GAAG,SAAS;AAC5C,UAAI,cAAc,OAAO;AACvB,0BAAkB;AAAA,MACpB;AACA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,aAAS,+BAA+B,MAAM;AAC5C,UAAI,KAAK,cAAc,QAAW;AAChC,eAAO;AAAA,MACT;AACA,UAAI,KAAK,UAAU,QAAW;AAC5B,eAAO;AAAA,MACT;AACA,kCAA4B;AAC5B,UAAI,iBAAiB,cAAc,KAAK,KAAK,GAC3C,YAAY,eAAe,WAC3B,YAAY,eAAe;AAC7B,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO,CAAC;AAAA,MACf;AACA,UAAI,KAAK,KAAK,UAAU,QAAW;AACjC,aAAK,KAAK,QAAQ,KAAK;AAAA,MACzB;AACA,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,aAAO;AAAA,IACT;AACA,QAAI,YAAyB,yBAAU,YAAY;AACjD,qBAAeE,YAAW,UAAU;AACpC,eAASA,WAAU,MAAM;AACvB,YAAI;AACJ,YAAI,SAAS,QAAQ;AACnB,iBAAO,CAAC;AAAA,QACV;AACA,gBAAQ,WAAW,KAAK,MAAM,+BAA+B,IAAI,CAAC,KAAK;AACvE,cAAM,OAAO,OAAO;AACpB,cAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,eAAO,eAAe,MAAM,MAAM,YAAY;AAAA,UAC5C,KAAK,UAAU,WAAY;AACzB,mBAAO,MAAM;AAAA,UACf,GAAG,4DAA4D;AAAA,UAC/D,KAAK,UAAU,WAAY;AACzB,mBAAO,MAAM;AAAA,UACf,GAAG,qGAAqG;AAAA,QAC1G,CAAC;AACD,cAAM,eAAe;AACrB,eAAO;AAAA,MACT;AAuBA,UAAI,SAASA,WAAU;AACvB,aAAO,iBAAiB,SAAS,eAAe,SAAS;AACvD,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,YAAI,YAAY,KAAK,oBAAoB,OAAO;AAChD,YAAI,aAAa,qBAAqB,SAAS;AAC/C,YAAI,WAAW,GAAG,QAAQ,SAAS,GAAG,KAAK,QAAQ,UAAU;AAC7D,eAAO;AAAA,MACT;AACA,aAAO,sBAAsB,SAAS,oBAAoB,SAAS;AACjE,eAAO,QAAQ,QAAQ,KAAK,eAAe,OAAO,IAAI,KAAK,mBAAmB,OAAO;AAAA,MACvF;AAOA,aAAO,WAAW,SAAS,SAAS,OAAO,SAAS;AAClD,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,aAAK,SAAS;AACd,aAAK,aAAa,KAAK,oBAAoB,OAAO;AAClD,aAAK,cAAc;AAAA,MACrB;AAcA,aAAO,iBAAiB,SAAS,eAAe,SAAS;AACvD,YAAI,IAAI,KAAK;AACb,YAAI,kBAAkB,EAAE,QAAQ,SAAS,EAAE,EAAE;AAC7C,YAAI,kBAAkB,EAAE,QAAQ,SAAS,EAAE,EAAE;AAC7C,YAAI,kBAAkB,oBAAoB,GAAG;AAC3C,cAAI,WAAW,GAAG,QAAQ,SAAS,GAAG,GAAG;AAAA,YACvC,cAAc;AAAA,UAChB,CAAC;AACD,cAAI,YAAY,GAAG;AACjB,mBAAOA,WAAU;AAAA,UACnB,OAAO;AACL,gBAAI,OAAO,KAAK,mBAAmB,OAAO;AAC1C,gBAAI,SAASA,WAAU,UAAU;AAE/B,kBAAI,QAAQ,KAAK,aAAa,QAAQ,aAAaA,WAAU;AAC7D,kBAAI,OAAO,qBAAqB,KAAK;AACrC,kBAAI,cAAc,GAAG,QAAQ,SAAS,GAAG,GAAG,IAAI;AAChD,kBAAI,WAAW,SAAS,QAAQ,QAAQ;AACtC,uBAAO;AAAA,cACT;AAAA,YACF;AACA,mBAAO;AAAA,UACT;AAAA,QACF,WAAW,oBAAoB,iBAAiB;AAC9C,iBAAO,KAAK,mBAAmB,OAAO;AAAA,QACxC,WAAW,kBAAkB,iBAAiB;AAC5C,iBAAOA,WAAU;AAAA,QACnB,OAAO;AACL,iBAAOA,WAAU;AAAA,QACnB;AAAA,MACF;AAOA,aAAO,qBAAqB,SAAS,mBAAmB,SAAS;AAC/D,YAAI,YAAY,QAAQ,yBAAyB,KAAK,YAAY,QAAQ;AAC1E,YAAI,cAAc,QAAW;AAC3B,sBAAY,QAAQ,yBAAyB,QAAQ,YAAY,KAAK;AAAA,QACxE;AACA,YAAI,cAAc,QAAW;AAC3B,sBAAYA,WAAU;AAAA,QACxB;AACA,eAAO;AAAA,MACT;AACA,aAAO,gBAAgB,SAAS,gBAAgB;AAC9C,YAAI,YAAY,GAAG,QAAQ,SAAS,GAAG,KAAK,QAAQ,qBAAqB,KAAK,SAAS,CAAC;AACxF,YAAI,aAAa,KAAK,QAAQ;AAC5B,cAAI,KAAK,MAAM;AACb,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF,OAAO;AACL,eAAK,KAAK,QAAQ;AAAA,QACpB;AAAA,MACF;AACA,aAAO,iBAAiB,SAAS,eAAe,MAAM,OAAO;AAC3D,YAAI,KAAK,cAAc;AACrB,cAAI,WAAW,GAAG,QAAQ,SAAS,GAAG,OAAO;AAAA,YAC3C,cAAc;AAAA,UAChB,CAAC;AACD,cAAI,YAAY,OAAO;AACrB,iBAAK,KAAK,IAAI,IAAI;AAAA,UACpB,OAAO;AACL,mBAAO,KAAK,KAAK,IAAI;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AACA,aAAO,aAAa,SAAS,WAAW,MAAM;AAC5C,YAAI,aAAa;AAAA,UACf,QAAQ;AAAA,UACR,OAAO;AAAA,QACT;AACA,YAAI,SAAS,KAAK,OAAO,IAAI,KAAK,CAAC;AACnC,YAAI,YAAY,KAAK,KAAK,UAAU,KAAK,KAAK,OAAO,IAAI,KAAK,CAAC;AAC/D,eAAO,OAAO,OAAO,YAAY,QAAQ,SAAS;AAAA,MACpD;AACA,aAAO,aAAa,SAAS,WAAW,MAAM,WAAW,QAAQ;AAC/D,YAAI,cAAc,QAAQ;AACxB,sBAAY;AAAA,QACd;AACA,YAAI,WAAW,QAAQ;AACrB,mBAAS;AAAA,QACX;AACA,YAAI,aAAa,KAAK,WAAW,SAAS;AAC1C,eAAO,OAAO,KAAK,kBAAkB,IAAI,GAAG,UAAU;AAAA,MACxD;AAgBA,aAAO,WAAW,SAAS,SAAS,MAAM;AACxC,YAAI,QAAQ;AACZ,YAAI,kBAAkB,KAAK,WAAW,WAAW;AACjD,iBAAS,gBAAgB,OAAO;AAChC,YAAI,SAAS,eAAe,SAAS,MAAM;AACzC,iBAAO,KAAK,YAAY,QAAQ;AAAA,QAClC;AACA,YAAI,SAAS,eAAe;AAC1B,iBAAO;AAAA,QACT;AACA,iBAAS,KAAK,gBAAgB;AAC9B,YAAI,KAAK,WAAW;AAClB,mBAAS;AAAA,QACX;AACA,YAAI,SAAS,aAAa;AACxB,iBAAO;AAAA,QACT;AACA,iBAAS,KAAK,kBAAkB,WAAW,EAAE;AAC7C,iBAAS,gBAAgB,MAAM;AAC/B,YAAI,iBAAiB,KAAK,WAAW,UAAU;AAC/C,iBAAS,eAAe,OAAO;AAC/B,YAAI,WAAW,KAAK,kBAAkB,UAAU;AAChD,YAAI,SAAS,YAAY;AACvB,iBAAO,WAAW,QAAQ;AAAA,QAC5B;AACA,iBAAS,SAAS;AAClB,iBAAS,eAAe,MAAM;AAC9B,YAAI,cAAc,KAAK,WAAW,OAAO;AACzC,iBAAS,YAAY,OAAO;AAC5B,YAAI,QAAQ,KAAK,kBAAkB,OAAO;AAC1C,YAAI,SAAS,SAAS;AACpB,iBAAO,QAAQ,QAAQ;AAAA,QACzB;AACA,iBAAS,MAAM;AACf,iBAAS,YAAY,MAAM;AAC3B,YAAI,oBAAoB,KAAK,WAAW,aAAa;AACrD,iBAAS,kBAAkB,OAAO;AAClC,YAAI,SAAS,eAAe;AAC1B,iBAAO,KAAK,cAAc,QAAQ;AAAA,QACpC;AACA,eAAO;AAAA,MACT;AACA,aAAO,WAAW,SAAS,WAAW;AACpC,YAAI,SAAS;AACb,YAAI,WAAW,CAAC,KAAK,gBAAgB,GAAG;AACxC,iBAAS,KAAK,KAAK,WAAW,sBAAsB,WAAW,CAAC;AAChE,YAAI,KAAK,aAAa,KAAK,SAAS,KAAK,UAAU,KAAK;AACtD,mBAAS,KAAK,KAAK,WAAW,UAAU,CAAC;AACzC,mBAAS,KAAK,KAAK,WAAW,OAAO,CAAC;AACtC,mBAAS,KAAK,KAAK,WAAW,mBAAmB,eAAe,SAAU,WAAW,YAAY;AAC/F,gBAAI,UAAU,SAAS,KAAK,CAAC,OAAO,UAAU,WAAW,OAAO,WAAW,KAAK,EAAE,OAAO,OAAO,SAAS,OAAO,OAAO,MAAM,QAAQ;AACnI,yBAAW,SAAS;AAAA,YACtB;AACA,mBAAO,kBAAkB,WAAW,UAAU;AAAA,UAChD,CAAC,CAAC;AAAA,QACJ;AACA,iBAAS,KAAK,GAAG;AACjB,iBAAS,KAAK,KAAK,aAAa;AAChC,eAAO,SAAS,KAAK,EAAE;AAAA,MACzB;AACA,mBAAaA,YAAW,CAAC;AAAA,QACvB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,cAAI,KAAK,KAAK;AACd,iBAAO,OAAO,OAAO,OAAO;AAAA,QAC9B;AAAA,QACA,KAAK,SAAS,IAAI,OAAO;AACvB,2CAAiC;AAAA,QACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QASA,KAAK,SAAS,IAAI,WAAW;AAC3B,cAAI,CAAC,KAAK,cAAc;AACtB,iBAAK,aAAa;AAClB;AAAA,UACF;AACA,cAAI,KAAK,eAAe,WAAW;AACjC,iBAAK,aAAa;AAClB,iBAAK,cAAc;AAAA,UACrB;AAAA,QACF;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,cAAc,KAAK,KAAK,aAAa,KAAK,SAAS;AAAA,QACjE;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,cAAc,MAAM;AAAA,QAClC;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAaA,SAAS,IAAI,GAAG;AACd,gBAAI,KAAK,cAAc;AACrB,kBAAI,kBAAkB,cAAc,CAAC,GACnC,kBAAkB,gBAAgB,iBAClC,YAAY,gBAAgB,WAC5B,YAAY,gBAAgB;AAC9B,kBAAI,iBAAiB;AACnB,gDAAgC;AAAA,cAClC;AACA,kBAAI,cAAc,KAAK,UAAU,cAAc,KAAK,YAAY;AAC9D;AAAA,cACF;AACA,mBAAK,SAAS;AACd,mBAAK,aAAa;AAClB,mBAAK,cAAc;AAAA,YACrB,OAAO;AACL,mBAAK,SAAS;AAAA,YAChB;AAAA,UACF;AAAA;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QASA,KAAK,SAAS,IAAI,aAAa;AAC7B,cAAI,CAAC,aAAa;AAChB,iBAAK,eAAe;AAIpB,gBAAI,KAAK,SAAS,KAAK,KAAK,oBAAoB,OAAO,KAAK,KAAK,oBAAoB,MAAM;AACzF,mBAAK,KAAK,kBAAkB;AAAA,YAC9B;AAAA,UACF;AACA,eAAK,eAAe;AAAA,QACtB;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,KAAK,SAAS,IAAI,MAAM;AACtB,eAAK,eAAe,aAAa,IAAI;AACrC,eAAK,aAAa;AAAA,QACpB;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,cAAU,WAAW;AACrB,cAAU,eAAe;AACzB,cAAU,eAAe;AACzB,QAAI,wBAAwB,wBAAwB;AAAA,MAClD,KAAK;AAAA,QACH,QAAQ;AAAA,QACR,MAAM;AAAA,MACR;AAAA,MACA,KAAK;AAAA,QACH,QAAQ;AAAA,QACR,MAAM;AAAA,MACR;AAAA,IACF,GAAG,sBAAsB,IAAI,IAAI;AAAA,MAC/B,cAAc;AAAA,IAChB,GAAG;AACH,aAAS,kBAAkB,WAAW,YAAY;AAChD,aAAO,KAAK,WAAW,SAAS,YAAY,WAAW;AAAA,IACzD;AAAA;AAAA;;;AC/bA;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,YAAyB,yBAAU,YAAY;AACjD,qBAAeE,YAAW,UAAU;AACpC,eAASA,WAAU,MAAM;AACvB,YAAI;AACJ,gBAAQ,WAAW,KAAK,MAAM,IAAI,KAAK;AACvC,cAAM,OAAO,OAAO;AACpB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,WAAW,SAAS,CAAC;AACvB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACrBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,aAA0B,yBAAU,OAAO;AAC7C,qBAAeE,aAAY,KAAK;AAChC,eAASA,YAAW,MAAM;AACxB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACpBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,SAAS;AACb,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,eAAe,UAAU,YAAY;AAAE,eAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,eAAS,UAAU,cAAc;AAAU,sBAAgB,UAAU,UAAU;AAAA,IAAG;AAC5L,aAAS,gBAAgB,GAAG,GAAG;AAAE,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASC,iBAAgBC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAG,eAAOD;AAAA,MAAG;AAAG,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAAG;AACvM,QAAI,UAAuB,yBAAU,OAAO;AAC1C,qBAAeE,UAAS,KAAK;AAC7B,eAASA,SAAQ,MAAM;AACrB,YAAI;AACJ,gBAAQ,MAAM,KAAK,MAAM,IAAI,KAAK;AAClC,cAAM,OAAO,OAAO;AACpB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,aAAOA;AAAA,IACT,EAAE,MAAM,SAAS,CAAC;AAClB,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACrBzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,aAAS,cAAc,MAAM;AAC3B,aAAO,KAAK,KAAK,SAAU,GAAG,GAAG;AAC/B,eAAO,IAAI;AAAA,MACb,CAAC;AAAA,IACH;AAEA,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACVzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,OAAO,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,cAAc,QAAQ,YAAY,QAAQ,OAAO,QAAQ,OAAO,QAAQ,aAAa,QAAQ,kBAAkB,QAAQ,UAAU,QAAQ,cAAc,QAAQ,OAAO,QAAQ,SAAS,QAAQ,cAAc,QAAQ,SAAS,QAAQ,KAAK,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,aAAa,QAAQ,QAAQ,QAAQ,cAAc,QAAQ,mBAAmB,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,YAAY,QAAQ,KAAK,QAAQ,WAAW,QAAQ,YAAY;AAC7iB,QAAI,YAAY;AAChB,YAAQ,YAAY;AACpB,QAAI,WAAW;AACf,YAAQ,WAAW;AACnB,QAAI,KAAK;AACT,YAAQ,KAAK;AACb,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,YAAY;AAChB,YAAQ,YAAY;AACpB,QAAI,kBAAkB;AACtB,YAAQ,kBAAkB;AAC1B,QAAI,mBAAmB;AACvB,YAAQ,mBAAmB;AAC3B,QAAI,aAAa;AACjB,YAAQ,aAAa;AACrB,QAAI,cAAc;AAClB,YAAQ,cAAc;AACtB,QAAI,SAAS;AACb,YAAQ,SAAS;AACjB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAI,SAAS;AACb,YAAQ,SAAS;AACjB,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAI,cAAc;AAClB,YAAQ,cAAc;AACtB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,cAAc;AAClB,YAAQ,cAAc;AACtB,QAAI,cAAc;AAClB,YAAQ,cAAc;AACtB,QAAI,QAAQ;AACZ,YAAQ,QAAQ;AAChB,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAI,YAAY;AAChB,YAAQ,YAAY;AACpB,QAAI,KAAK;AACT,YAAQ,KAAK;AACb,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAI,UAAU;AACd,YAAQ,UAAU;AAClB,QAAI,MAAM;AAGV,YAAQ,MAAM;AACd,QAAI,MAAM;AAGV,YAAQ,MAAM;AACd,QAAI,UAAU;AACd,YAAQ,UAAU;AAClB,QAAI,OAAO;AACX,YAAQ,OAAO;AACf,QAAIC,cAAa;AACjB,YAAQ,aAAaA;AAAA;AAAA;;;ACrErB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS;AACjB,YAAQ,SAAS,IAAI;AACrB,QAAI,IAAI,wBAAwB,oBAAuB;AACvD,QAAI;AAAJ,QAAkB;AAClB,aAAS,yBAAyB,aAAa;AAAE,UAAI,OAAO,YAAY,WAAY,QAAO;AAAM,UAAI,oBAAoB,oBAAI,QAAQ;AAAG,UAAI,mBAAmB,oBAAI,QAAQ;AAAG,cAAQ,2BAA2B,SAASC,0BAAyBC,cAAa;AAAE,eAAOA,eAAc,mBAAmB;AAAA,MAAmB,GAAG,WAAW;AAAA,IAAG;AAC9U,aAAS,wBAAwB,KAAK,aAAa;AAAE,UAAI,CAAC,eAAe,OAAO,IAAI,YAAY;AAAE,eAAO;AAAA,MAAK;AAAE,UAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY;AAAE,eAAO,EAAE,WAAW,IAAI;AAAA,MAAG;AAAE,UAAI,QAAQ,yBAAyB,WAAW;AAAG,UAAI,SAAS,MAAM,IAAI,GAAG,GAAG;AAAE,eAAO,MAAM,IAAI,GAAG;AAAA,MAAG;AAAE,UAAI,SAAS,CAAC;AAAG,UAAI,wBAAwB,OAAO,kBAAkB,OAAO;AAA0B,eAAS,OAAO,KAAK;AAAE,YAAI,QAAQ,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAAE,cAAI,OAAO,wBAAwB,OAAO,yBAAyB,KAAK,GAAG,IAAI;AAAM,cAAI,SAAS,KAAK,OAAO,KAAK,MAAM;AAAE,mBAAO,eAAe,QAAQ,KAAK,IAAI;AAAA,UAAG,OAAO;AAAE,mBAAO,GAAG,IAAI,IAAI,GAAG;AAAA,UAAG;AAAA,QAAE;AAAA,MAAE;AAAE,aAAO,SAAS,IAAI;AAAK,UAAI,OAAO;AAAE,cAAM,IAAI,KAAK,MAAM;AAAA,MAAG;AAAE,aAAO;AAAA,IAAQ;AACxyB,QAAI,eAAe,eAAe,CAAC,GAAG,aAAa,EAAE,GAAG,IAAI,MAAM,aAAa,EAAE,OAAO,IAAI,MAAM,aAAa,EAAE,EAAE,IAAI,MAAM,aAAa,EAAE,IAAI,IAAI,MAAM;AAC1J,QAAI,kBAAkB,kBAAkB,CAAC,GAAG,gBAAgB,EAAE,KAAK,IAAI,MAAM,gBAAgB,EAAE,GAAG,IAAI,MAAM,gBAAgB,EAAE,OAAO,IAAI,MAAM,gBAAgB,EAAE,EAAE,IAAI,MAAM,gBAAgB,EAAE,IAAI,IAAI,MAAM,gBAAgB,EAAE,SAAS,IAAI,MAAM,gBAAgB,EAAE,QAAQ,IAAI,MAAM,gBAAgB,EAAE,IAAI,IAAI,MAAM,gBAAgB,EAAE,KAAK,IAAI,MAAM,gBAAgB,EAAE,KAAK,IAAI,MAAM,gBAAgB,EAAE,SAAS,IAAI,MAAM,gBAAgB,EAAE,eAAe,IAAI,MAAM,gBAAgB,EAAE,gBAAgB,IAAI,MAAM,gBAAgB,EAAE,UAAU,IAAI,MAAM,gBAAgB,EAAE,WAAW,IAAI,MAAM,gBAAgB,EAAE,WAAW,IAAI,MAAM,gBAAgB,EAAE,WAAW,IAAI,MAAM,gBAAgB,EAAE,IAAI,IAAI,MAAM,gBAAgB,EAAE,IAAI,IAAI,MAAM,gBAAgB,EAAE,KAAK,IAAI,MAAM,gBAAgB,EAAE,WAAW,IAAI,MAAM,gBAAgB,EAAE,MAAM,IAAI,MAAM,gBAAgB,EAAE,MAAM,IAAI,MAAM,gBAAgB,EAAE,KAAK,IAAI,MAAM,gBAAgB,EAAE,KAAK,IAAI,MAAM;AAC75B,QAAI,MAAM,CAAC;AACX,QAAI,WAAW;AACf,SAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAI,SAAS,WAAW,CAAC,CAAC,IAAI;AAAA,IAChC;AAFS;AAST,aAAS,YAAY,KAAK,OAAO;AAC/B,UAAI,OAAO;AACX,UAAI;AACJ,SAAG;AACD,eAAO,IAAI,WAAW,IAAI;AAC1B,YAAI,eAAe,IAAI,GAAG;AACxB,iBAAO,OAAO;AAAA,QAChB,WAAW,SAAS,EAAE,WAAW;AAC/B,iBAAO,cAAc,KAAK,IAAI,IAAI;AAAA,QACpC,OAAO;AAEL;AAAA,QACF;AAAA,MACF,SAAS,OAAO,IAAI;AACpB,aAAO,OAAO;AAAA,IAChB;AAOA,aAAS,cAAc,KAAK,OAAO;AACjC,UAAI,OAAO;AACX,UAAI,OAAO,IAAI,WAAW,OAAO,CAAC;AAClC,UAAI,YAAY,IAAI,GAAG;AAAA,MAEvB,WAAW,IAAI,IAAI,GAAG;AACpB,YAAI,YAAY;AAEhB,WAAG;AACD;AACA;AACA,iBAAO,IAAI,WAAW,OAAO,CAAC;AAAA,QAChC,SAAS,IAAI,IAAI,KAAK,YAAY;AAElC,YAAI,YAAY,KAAK,SAAS,EAAE,OAAO;AACrC;AAAA,QACF;AAAA,MACF,OAAO;AAEL;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,MACV,SAAS;AAAA,MACT,WAAW;AAAA,MACX,SAAS;AAAA,IACX;AACA,YAAQ,SAAS;AACjB,aAAS,SAAS,OAAO;AACvB,UAAI,SAAS,CAAC;AACd,UAAI,MAAM,MAAM,IAAI,QAAQ;AAC5B,UAAI,OAAO,KACT,SAAS,KAAK;AAChB,UAAI,SAAS;AACb,UAAI,OAAO;AACX,UAAI,QAAQ;AACZ,UAAI,MAAM;AACV,UAAI,MAAM,SAAS,WAAW,SAAS,SAAS,WAAW,MAAM,OAAO,MAAM,UAAU,YAAY,OAAO;AAC3G,eAAS,SAAS,MAAM,KAAK;AAC3B,YAAI,MAAM,MAAM;AAEd,iBAAO;AACP,iBAAO,IAAI,SAAS;AAAA,QACtB,OAAO;AACL,gBAAM,MAAM,MAAM,cAAc,MAAM,MAAM,QAAQ,QAAQ,KAAK;AAAA,QACnE;AAAA,MACF;AACA,aAAO,QAAQ,QAAQ;AACrB,eAAO,IAAI,WAAW,KAAK;AAC3B,YAAI,SAAS,EAAE,SAAS;AACtB,mBAAS;AACT,kBAAQ;AAAA,QACV;AACA,gBAAQ,MAAM;AAAA,UACZ,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AACL,mBAAO;AACP,eAAG;AACD,sBAAQ;AACR,qBAAO,IAAI,WAAW,IAAI;AAC1B,kBAAI,SAAS,EAAE,SAAS;AACtB,yBAAS;AACT,wBAAQ;AAAA,cACV;AAAA,YACF,SAAS,SAAS,EAAE,SAAS,SAAS,EAAE,WAAW,SAAS,EAAE,OAAO,SAAS,EAAE,MAAM,SAAS,EAAE;AACjG,wBAAY,EAAE;AACd,sBAAU;AACV,wBAAY,OAAO,SAAS;AAC5B,kBAAM;AACN;AAAA,UACF,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AACL,mBAAO;AACP,eAAG;AACD,sBAAQ;AACR,qBAAO,IAAI,WAAW,IAAI;AAAA,YAC5B,SAAS,SAAS,EAAE,QAAQ,SAAS,EAAE,eAAe,SAAS,EAAE,SAAS,SAAS,EAAE;AACrF,wBAAY,EAAE;AACd,sBAAU;AACV,wBAAY,QAAQ;AACpB,kBAAM;AACN;AAAA;AAAA,UAGF,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AACL,mBAAO;AACP,wBAAY;AACZ,sBAAU;AACV,wBAAY,QAAQ;AACpB,kBAAM,OAAO;AACb;AAAA,UACF,KAAK,EAAE;AAAA,UACP,KAAK,EAAE;AACL,oBAAQ,SAAS,EAAE,cAAc,MAAM;AACvC,mBAAO;AACP,eAAG;AACD,wBAAU;AACV,qBAAO,IAAI,QAAQ,OAAO,OAAO,CAAC;AAClC,kBAAI,SAAS,IAAI;AACf,yBAAS,SAAS,KAAK;AAAA,cACzB;AACA,0BAAY;AACZ,qBAAO,IAAI,WAAW,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,6BAAa;AACb,0BAAU,CAAC;AAAA,cACb;AAAA,YACF,SAAS;AACT,wBAAY,EAAE;AACd,sBAAU;AACV,wBAAY,QAAQ;AACpB,kBAAM,OAAO;AACb;AAAA,UACF;AACE,gBAAI,SAAS,EAAE,SAAS,IAAI,WAAW,QAAQ,CAAC,MAAM,EAAE,UAAU;AAChE,qBAAO,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI;AACtC,kBAAI,SAAS,GAAG;AACd,yBAAS,WAAW,IAAI;AAAA,cAC1B;AACA,wBAAU,IAAI,MAAM,OAAO,OAAO,CAAC;AACnC,sBAAQ,QAAQ,MAAM,IAAI;AAC1B,qBAAO,MAAM,SAAS;AACtB,kBAAI,OAAO,GAAG;AACZ,2BAAW,OAAO;AAClB,6BAAa,OAAO,MAAM,IAAI,EAAE;AAAA,cAClC,OAAO;AACL,2BAAW;AACX,6BAAa;AAAA,cACf;AACA,0BAAY,EAAE;AACd,qBAAO;AACP,wBAAU;AACV,0BAAY,OAAO;AAAA,YACrB,WAAW,SAAS,EAAE,OAAO;AAC3B,qBAAO;AACP,0BAAY;AACZ,wBAAU;AACV,0BAAY,QAAQ;AACpB,oBAAM,OAAO;AAAA,YACf,OAAO;AACL,qBAAO,YAAY,KAAK,KAAK;AAC7B,0BAAY,EAAE;AACd,wBAAU;AACV,0BAAY,OAAO;AAAA,YACrB;AACA,kBAAM,OAAO;AACb;AAAA,QACJ;AAGA,eAAO,KAAK;AAAA,UAAC;AAAA;AAAA,UAEb;AAAA;AAAA,UAEA,QAAQ;AAAA;AAAA,UAER;AAAA;AAAA,UAEA;AAAA;AAAA,UAEA;AAAA;AAAA,UAEA;AAAA;AAAA,QACA,CAAC;AAGD,YAAI,YAAY;AACd,mBAAS;AACT,uBAAa;AAAA,QACf;AACA,gBAAQ;AAAA,MACV;AACA,aAAO;AAAA,IACT;AAAA;AAAA;;;AC9OA;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,QAAQ,uBAAuB,cAA2B;AAC9D,QAAI,YAAY,uBAAuB,kBAA+B;AACtE,QAAI,aAAa,uBAAuB,mBAAgC;AACxE,QAAI,WAAW,uBAAuB,iBAA8B;AACpE,QAAI,MAAM,uBAAuB,YAAyB;AAC1D,QAAI,OAAO,uBAAuB,aAA0B;AAC5D,QAAI,UAAU,uBAAuB,gBAA6B;AAClE,QAAI,UAAU,uBAAuB,gBAA6B;AAClE,QAAI,aAAa,wBAAwB,mBAAgC;AACzE,QAAI,aAAa,uBAAuB,mBAAgC;AACxE,QAAI,cAAc,uBAAuB,oBAAiC;AAC1E,QAAI,WAAW,uBAAuB,iBAA8B;AACpE,QAAI,iBAAiB,uBAAuB,uBAA0B;AACtE,QAAI,YAAY,wBAAwB,kBAAqB;AAC7D,QAAI,SAAS,wBAAwB,oBAAuB;AAC5D,QAAIC,SAAQ,wBAAwB,eAA4B;AAChE,QAAI,QAAQ;AACZ,QAAI;AAAJ,QAAwB;AACxB,aAAS,yBAAyB,aAAa;AAAE,UAAI,OAAO,YAAY,WAAY,QAAO;AAAM,UAAI,oBAAoB,oBAAI,QAAQ;AAAG,UAAI,mBAAmB,oBAAI,QAAQ;AAAG,cAAQ,2BAA2B,SAASC,0BAAyBC,cAAa;AAAE,eAAOA,eAAc,mBAAmB;AAAA,MAAmB,GAAG,WAAW;AAAA,IAAG;AAC9U,aAAS,wBAAwB,KAAK,aAAa;AAAE,UAAI,CAAC,eAAe,OAAO,IAAI,YAAY;AAAE,eAAO;AAAA,MAAK;AAAE,UAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY;AAAE,eAAO,EAAE,WAAW,IAAI;AAAA,MAAG;AAAE,UAAI,QAAQ,yBAAyB,WAAW;AAAG,UAAI,SAAS,MAAM,IAAI,GAAG,GAAG;AAAE,eAAO,MAAM,IAAI,GAAG;AAAA,MAAG;AAAE,UAAI,SAAS,CAAC;AAAG,UAAI,wBAAwB,OAAO,kBAAkB,OAAO;AAA0B,eAAS,OAAO,KAAK;AAAE,YAAI,QAAQ,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAAE,cAAI,OAAO,wBAAwB,OAAO,yBAAyB,KAAK,GAAG,IAAI;AAAM,cAAI,SAAS,KAAK,OAAO,KAAK,MAAM;AAAE,mBAAO,eAAe,QAAQ,KAAK,IAAI;AAAA,UAAG,OAAO;AAAE,mBAAO,GAAG,IAAI,IAAI,GAAG;AAAA,UAAG;AAAA,QAAE;AAAA,MAAE;AAAE,aAAO,SAAS,IAAI;AAAK,UAAI,OAAO;AAAE,cAAM,IAAI,KAAK,MAAM;AAAA,MAAG;AAAE,aAAO;AAAA,IAAQ;AACxyB,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,aAAS,kBAAkB,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM,CAAC;AAAG,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW,WAAY,YAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAAG;AAAA,IAAE;AAC5T,aAAS,aAAa,aAAa,YAAY,aAAa;AAAE,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,UAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,aAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,aAAO;AAAA,IAAa;AAC5R,QAAI,qBAAqB,qBAAqB,CAAC,GAAG,mBAAmB,OAAO,KAAK,IAAI,MAAM,mBAAmB,OAAO,EAAE,IAAI,MAAM,mBAAmB,OAAO,IAAI,IAAI,MAAM,mBAAmB,OAAO,OAAO,IAAI,MAAM,mBAAmB,OAAO,GAAG,IAAI,MAAM;AAC3P,QAAI,0BAA0B,OAAO,OAAO,CAAC,GAAG,oBAAoB,iBAAiB,CAAC,GAAG,eAAe,OAAO,OAAO,IAAI,MAAM,eAAe;AAC/I,aAAS,WAAW,OAAO;AACzB,aAAO;AAAA,QACL,MAAM,MAAM,UAAU,OAAO,UAAU;AAAA,QACvC,QAAQ,MAAM,UAAU,OAAO,SAAS;AAAA,MAC1C;AAAA,IACF;AACA,aAAS,SAAS,OAAO;AACvB,aAAO;AAAA,QACL,MAAM,MAAM,UAAU,OAAO,QAAQ;AAAA,QACrC,QAAQ,MAAM,UAAU,OAAO,OAAO;AAAA,MACxC;AAAA,IACF;AACA,aAAS,UAAU,WAAW,aAAa,SAAS,WAAW;AAC7D,aAAO;AAAA,QACL,OAAO;AAAA,UACL,MAAM;AAAA,UACN,QAAQ;AAAA,QACV;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN,QAAQ;AAAA,QACV;AAAA,MACF;AAAA,IACF;AACA,aAAS,eAAe,OAAO;AAC7B,aAAO,UAAU,MAAM,UAAU,OAAO,UAAU,GAAG,MAAM,UAAU,OAAO,SAAS,GAAG,MAAM,UAAU,OAAO,QAAQ,GAAG,MAAM,UAAU,OAAO,OAAO,CAAC;AAAA,IAC3J;AACA,aAAS,mBAAmB,YAAY,UAAU;AAChD,UAAI,CAAC,YAAY;AACf,eAAO;AAAA,MACT;AACA,aAAO,UAAU,WAAW,UAAU,OAAO,UAAU,GAAG,WAAW,UAAU,OAAO,SAAS,GAAG,SAAS,UAAU,OAAO,QAAQ,GAAG,SAAS,UAAU,OAAO,OAAO,CAAC;AAAA,IAC3K;AACA,aAAS,aAAa,MAAM,MAAM;AAChC,UAAI,QAAQ,KAAK,IAAI;AACrB,UAAI,OAAO,UAAU,UAAU;AAC7B;AAAA,MACF;AACA,UAAI,MAAM,QAAQ,IAAI,MAAM,IAAI;AAC9B,SAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,aAAK,IAAI,KAAK,GAAG,MAAM,OAAO,KAAK;AACnC,YAAI,KAAK,KAAK,IAAI,MAAM,QAAW;AACjC,eAAK,KAAK,IAAI,IAAI;AAAA,QACpB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,UAAU,OAAO,MAAM;AAC9B,UAAI,IAAI;AACR,UAAI,UAAU,CAAC;AACf,cAAQ,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC,OAAO,IAAI;AAC9C,gBAAQ,KAAK,CAAC;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AACA,aAAS,QAAQ;AACf,UAAI,OAAO,MAAM,UAAU,OAAO,MAAM,CAAC,GAAG,SAAS;AACrD,aAAO,KAAK,OAAO,SAAU,MAAM,GAAG;AACpC,eAAO,MAAM,KAAK,QAAQ,IAAI;AAAA,MAChC,CAAC;AAAA,IACH;AACA,QAAI,SAAsB,2BAAY;AACpC,eAASC,QAAO,MAAM,SAAS;AAC7B,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,aAAK,OAAO;AACZ,aAAK,UAAU,OAAO,OAAO;AAAA,UAC3B,OAAO;AAAA,UACP,MAAM;AAAA,QACR,GAAG,OAAO;AACV,aAAK,WAAW;AAChB,aAAK,MAAM,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO,KAAK,KAAK;AACjE,aAAK,UAAU,GAAG,UAAU,SAAS,GAAG;AAAA,UACtC,KAAK,KAAK;AAAA,UACV,OAAO,KAAK,gBAAgB;AAAA,UAC5B,MAAM,KAAK,QAAQ;AAAA,QACrB,CAAC;AACD,YAAI,aAAa,mBAAmB,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,CAAC;AACvF,aAAK,OAAO,IAAI,MAAM,SAAS,EAAE;AAAA,UAC/B,QAAQ;AAAA,QACV,CAAC;AACD,aAAK,KAAK,iBAAiB,KAAK,gBAAgB;AAChD,YAAI,WAAW,IAAI,UAAU,SAAS,EAAE;AAAA,UACtC,QAAQ;AAAA,YACN,OAAO;AAAA,cACL,MAAM;AAAA,cACN,QAAQ;AAAA,YACV;AAAA,UACF;AAAA,UACA,aAAa;AAAA,QACf,CAAC;AACD,aAAK,KAAK,OAAO,QAAQ;AACzB,aAAK,UAAU;AACf,aAAK,KAAK;AAAA,MACZ;AACA,UAAI,SAASA,QAAO;AACpB,aAAO,kBAAkB,SAAS,kBAAkB;AAClD,YAAI,QAAQ;AACZ,eAAO,SAAU,SAAS,cAAc;AACtC,cAAI,OAAO,MAAM,SAAS,UAAU;AAClC,mBAAO,IAAI,MAAM,OAAO;AAAA,UAC1B;AACA,iBAAO,MAAM,KAAK,MAAM,SAAS,YAAY;AAAA,QAC/C;AAAA,MACF;AACA,aAAO,YAAY,SAASC,aAAY;AACtC,YAAIC,QAAO,CAAC;AACZ,YAAI,gBAAgB,KAAK;AACzB,aAAK;AACL,eAAO,KAAK,WAAW,KAAK,OAAO,UAAU,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,aAAa;AACzG,UAAAA,MAAK,KAAK,KAAK,SAAS;AACxB,eAAK;AAAA,QACP;AACA,YAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,aAAa;AAChE,iBAAO,KAAK,SAAS,0BAA0B,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,QAC3F;AACA,YAAI,MAAMA,MAAK;AACf,YAAI,OAAO;AAAA,UACT,QAAQ,UAAU,cAAc,CAAC,GAAG,cAAc,CAAC,GAAG,KAAK,UAAU,CAAC,GAAG,KAAK,UAAU,CAAC,CAAC;AAAA,UAC1F,aAAa,cAAc,UAAU,OAAO,SAAS;AAAA,QACvD;AACA,YAAI,QAAQ,KAAK,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,QAAQA,MAAK,CAAC,EAAE,UAAU,OAAO,IAAI,CAAC,GAAG;AACxE,iBAAO,KAAK,SAAS,aAAaA,MAAK,CAAC,EAAE,UAAU,OAAO,SAAS,CAAC;AAAA,QACvE;AACA,YAAI,MAAM;AACV,YAAI,cAAc;AAClB,YAAI,gBAAgB;AACpB,YAAI,YAAY;AAChB,YAAI,4BAA4B;AAChC,eAAO,MAAM,KAAK;AAChB,cAAI,QAAQA,MAAK,GAAG;AACpB,cAAI,UAAU,KAAK,QAAQ,KAAK;AAChC,cAAI,OAAOA,MAAK,MAAM,CAAC;AACvB,kBAAQ,MAAM,UAAU,OAAO,IAAI,GAAG;AAAA,YACpC,KAAK,OAAO;AAOV,0CAA4B;AAC5B,kBAAI,KAAK,QAAQ,OAAO;AACtB;AAAA,cACF;AACA,kBAAI,WAAW;AACb,iBAAC,GAAG,MAAM,cAAc,MAAM,UAAU,SAAS;AACjD,oBAAI,cAAc,KAAK,OAAO,SAAS,EAAE,SAAS;AAClD,qBAAK,OAAO,SAAS,EAAE,QAAQ,cAAc;AAC7C,oBAAI,mBAAmB,GAAG,MAAM,SAAS,MAAM,QAAQ,UAAU,WAAW,OAAO,KAAK;AACxF,oBAAI,iBAAiB;AACnB,uBAAK,KAAK,OAAO,SAAS,EAAE,QAAQ,kBAAkB;AAAA,gBACxD;AAAA,cACF,OAAO;AACL,8BAAc,cAAc;AAC5B,gCAAgB,gBAAgB;AAAA,cAClC;AACA;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,QAAQ;AACjD,qBAAK,WAAW;AAChB,4BAAY;AAAA,cACd,YAAY,CAAC,KAAK,aAAa,cAAc,eAAe,CAAC,8BAA8B,MAAM;AAC/F,oBAAI,aAAa;AACf,mBAAC,GAAG,MAAM,cAAc,MAAM,UAAU,WAAW;AACnD,uBAAK,OAAO,UAAU,SAAS;AAC/B,gCAAc;AAAA,gBAChB;AACA,oBAAI,eAAe;AACjB,mBAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,UAAU,WAAW;AAC3D,uBAAK,KAAK,OAAO,UAAU,SAAS;AACpC,kCAAgB;AAAA,gBAClB;AACA,qBAAK,aAAa,KAAK,aAAa,MAAM;AAC1C,oBAAI,YAAY,GAAG,MAAM,SAAS,MAAM,QAAQ,WAAW,KAAK;AAChE,oBAAI,UAAU;AACZ,uBAAK,KAAK,aAAa;AAAA,gBACzB;AACA,4BAAY;AAAA,cACd;AACA,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,cAAc,SAAS;AACzB,oBAAI,eAAe,GAAG,MAAM,SAAS,MAAM,QAAQ,OAAO;AAC1D,qBAAK,SAAS;AACd,oBAAI,aAAa;AACf,uBAAK,KAAK,QAAQ,cAAc;AAAA,gBAClC;AACA;AAAA,cACF;AAAA;AAAA,YAEF,KAAK,OAAO;AACV,kBAAI,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,QAAQ;AACjD,qBAAK,WAAW;AAChB,4BAAY;AAAA,cACd;AACA,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,YAAY,OAAO,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,QAAQ;AACpE,qBAAK,WAAW;AAChB,4BAAY;AAAA,cACd;AACA,kBAAI,YAAY,KAAK;AACnB,4CAA4B;AAC5B;AAAA,cACF;AACA,kBAAI,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,QAAQ;AACjD,qBAAK,WAAW;AAChB,4BAAY;AAAA,cACd,WAAW,CAAC,KAAK,aAAa,CAAC,KAAK,WAAW;AAC7C,qBAAK,YAAY;AAAA,cACnB;AACA,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,QAAQ,KAAK,QAAQ,IAAI,MAAM,OAAOA,MAAK,MAAM,CAAC,KAAKA,MAAK,MAAM,CAAC,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO;AAAA,cAE3G,CAAC,KAAK,YAAY,CAAC,KAAK,WAAW;AACjC,qBAAK,YAAY;AACjB,4BAAY;AAAA,cACd,WAAW,CAAC,KAAK,aAAa,cAAc,eAAe,CAAC,2BAA2B;AACrF,oBAAI,aAAa;AACf,mBAAC,GAAG,MAAM,cAAc,MAAM,UAAU,WAAW;AACnD,uBAAK,OAAO,UAAU,SAAS;AAC/B,gCAAc;AAAA,gBAChB;AACA,oBAAI,eAAe;AACjB,mBAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,UAAU,WAAW;AAC3D,uBAAK,KAAK,OAAO,UAAU,SAAS;AACpC,kCAAgB;AAAA,gBAClB;AACA,qBAAK,aAAa,KAAK,aAAa,MAAM;AAC1C,oBAAI,aAAa,GAAG,MAAM,SAAS,MAAM,QAAQ,WAAW,KAAK;AACjE,oBAAI,WAAW;AACb,uBAAK,KAAK,aAAa;AAAA,gBACzB;AACA,4BAAY;AAAA,cACd,WAAW,CAAC,KAAK,SAAS,KAAK,UAAU,MAAM,cAAc,WAAW,EAAE,6BAA6B,KAAK,YAAY;AACtH,oBAAI,cAAc,GAAG,MAAM,OAAO,OAAO;AACzC,oBAAI,gBAAgB,GAAG,MAAM,SAAS,MAAM,QAAQ,OAAO,KAAK;AAChE,oBAAI,WAAW,KAAK,SAAS;AAC7B,qBAAK,QAAQ,WAAW;AACxB,qBAAK,YAAY;AACjB,oBAAI,eAAe,WAAW,cAAc;AAC1C,mBAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,uBAAK,KAAK,SAAS,gBAAgB,YAAY;AAAA,gBACjD;AACA,4BAAY;AAAA,cACd,OAAO;AACL,oBAAI,cAAc,YAAY,OAAO,YAAY;AACjD,qBAAK,KAAK,SAAS,KAAK,UAAU,QAAQ,KAAK,aAAa,4BAA4B;AACtF,uBAAK,cAAc;AACnB,sBAAI,CAAC,eAAe,YAAY,KAAK;AACnC,qBAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,yBAAK,KAAK,kBAAkB;AAAA,kBAC9B;AACA,8BAAY;AACZ,sBAAI,aAAa;AACf,qBAAC,GAAG,MAAM,cAAc,MAAM,UAAU,aAAa;AACrD,yBAAK,OAAO,YAAY,SAAS;AACjC,kCAAc;AAAA,kBAChB;AACA,sBAAI,eAAe;AACjB,qBAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,UAAU,aAAa;AAC7D,yBAAK,KAAK,OAAO,YAAY,SAAS;AACtC,oCAAgB;AAAA,kBAClB;AAAA,gBACF,WAAW,KAAK,SAAS,KAAK,UAAU,IAAI;AAC1C,8BAAY;AACZ,uBAAK,SAAS;AACd,sBAAI,KAAK,KAAK,OAAO;AACnB,yBAAK,KAAK,SAAS;AAAA,kBACrB;AAAA,gBACF;AAAA,cACF;AACA,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU;AACrC,uBAAO,KAAK,MAAM,uEAAuE;AAAA,kBACvF,OAAO,MAAM,UAAU,OAAO,SAAS;AAAA,gBACzC,CAAC;AAAA,cACH;AACA,kBAAI,kBAAkB,GAAG,WAAW,eAAe,OAAO,GACxD,YAAY,eAAe,WAC3B,YAAY,eAAe;AAC7B,mBAAK,QAAQ;AACb,mBAAK,YAAY;AACjB,0BAAY;AACZ,eAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,mBAAK,KAAK,QAAQ;AAClB,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,CAAC,KAAK,WAAW;AACnB,uBAAO,KAAK,SAAS,aAAa,MAAM,UAAU,OAAO,SAAS,GAAG,OAAO;AAAA,cAC9E;AACA,kBAAI,KAAK,OAAO;AACd,uBAAO,KAAK,MAAM,0DAA0D;AAAA,kBAC1E,OAAO,MAAM,UAAU,OAAO,SAAS;AAAA,gBACzC,CAAC;AAAA,cACH;AACA,mBAAK,WAAW,KAAK,WAAW,KAAK,WAAW,UAAU;AAC1D,0BAAY;AACZ,0CAA4B;AAC5B;AAAA,YACF,KAAK,OAAO;AACV,kBAAI,WAAW;AACb,oBAAI,6BAA6B,QAAQ,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS,cAAc,eAAe;AACpH,sBAAI,eAAe,GAAG,MAAM,SAAS,MAAM,UAAU,WAAW,OAAO,KAAK;AAC5E,sBAAI,kBAAkB,GAAG,MAAM,SAAS,MAAM,QAAQ,UAAU,WAAW,OAAO,KAAK;AACvF,mBAAC,GAAG,MAAM,cAAc,MAAM,QAAQ,UAAU,SAAS;AACzD,uBAAK,KAAK,OAAO,SAAS,EAAE,QAAQ,iBAAiB;AAAA,gBACvD,OAAO;AACL,sBAAI,YAAY,KAAK,SAAS,KAAK;AACnC,sBAAI,gBAAgB,GAAG,MAAM,SAAS,MAAM,QAAQ,SAAS,KAAK;AAClE,mBAAC,GAAG,MAAM,cAAc,MAAM,MAAM;AACpC,uBAAK,KAAK,SAAS,IAAI,eAAe;AAAA,gBACxC;AAAA,cACF,OAAO;AACL,gCAAgB,gBAAgB;AAAA,cAClC;AACA;AAAA,YACF;AACE,qBAAO,KAAK,MAAM,iBAAkB,UAAU,YAAa;AAAA,gBACzD,OAAO,MAAM,UAAU,OAAO,SAAS;AAAA,cACzC,CAAC;AAAA,UACL;AACA;AAAA,QACF;AACA,qBAAa,MAAM,WAAW;AAC9B,qBAAa,MAAM,WAAW;AAC9B,aAAK,QAAQ,IAAI,WAAW,SAAS,EAAE,IAAI,CAAC;AAC5C,aAAK;AAAA,MACP;AAcA,aAAO,kCAAkC,SAAS,gCAAgC,cAAc;AAC9F,YAAI,eAAe,GAAG;AACpB,yBAAe,KAAK,OAAO;AAAA,QAC7B;AACA,YAAI,gBAAgB,KAAK;AACzB,YAAI,QAAQ,CAAC;AACb,YAAI,QAAQ;AACZ,YAAI,cAAc;AAClB,WAAG;AACD,cAAI,kBAAkB,KAAK,UAAU,UAAU,OAAO,IAAI,CAAC,GAAG;AAC5D,gBAAI,CAAC,KAAK,QAAQ,OAAO;AACvB,uBAAS,KAAK,QAAQ;AAAA,YACxB;AAAA,UACF,WAAW,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS;AACnE,gBAAI,SAAS,CAAC;AACd,gBAAI,OAAO;AACT,qBAAO,SAAS;AAChB,sBAAQ;AAAA,YACV;AACA,0BAAc,IAAI,SAAS,SAAS,EAAE;AAAA,cACpC,OAAO,KAAK,QAAQ;AAAA,cACpB,QAAQ,eAAe,KAAK,SAAS;AAAA,cACrC,aAAa,KAAK,UAAU,UAAU,OAAO,SAAS;AAAA,cACtD;AAAA,YACF,CAAC;AACD,kBAAM,KAAK,WAAW;AAAA,UACxB;AAAA,QACF,SAAS,EAAE,KAAK,WAAW;AAC3B,YAAI,OAAO;AACT,cAAI,aAAa;AACf,wBAAY,OAAO,QAAQ;AAAA,UAC7B,WAAW,CAAC,KAAK,QAAQ,OAAO;AAC9B,gBAAI,aAAa,KAAK,OAAO,aAAa;AAC1C,gBAAI,YAAY,KAAK,OAAO,KAAK,WAAW,CAAC;AAC7C,kBAAM,KAAK,IAAI,QAAQ,SAAS,EAAE;AAAA,cAChC,OAAO;AAAA,cACP,QAAQ,UAAU,WAAW,UAAU,OAAO,UAAU,GAAG,WAAW,UAAU,OAAO,SAAS,GAAG,UAAU,UAAU,OAAO,QAAQ,GAAG,UAAU,UAAU,OAAO,OAAO,CAAC;AAAA,cAC5K,aAAa,WAAW,UAAU,OAAO,SAAS;AAAA,cAClD,QAAQ;AAAA,gBACN,QAAQ;AAAA,gBACR,OAAO;AAAA,cACT;AAAA,YACF,CAAC,CAAC;AAAA,UACJ;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAMA,aAAO,gCAAgC,SAAS,8BAA8B,OAAO,eAAe;AAClG,YAAI,SAAS;AACb,YAAI,kBAAkB,QAAQ;AAC5B,0BAAgB;AAAA,QAClB;AACA,YAAI,QAAQ;AACZ,YAAI,WAAW;AACf,cAAM,QAAQ,SAAU,GAAG;AACzB,cAAI,cAAc,OAAO,WAAW,EAAE,OAAO,QAAQ,aAAa;AAClE,cAAI,iBAAiB,OAAO,WAAW,EAAE,gBAAgB,aAAa;AACtE,mBAAS,cAAc,OAAO,WAAW,EAAE,OAAO,OAAO,iBAAiB,YAAY,WAAW,CAAC;AAClG,sBAAY,cAAc,EAAE,QAAQ,OAAO,WAAW,EAAE,eAAe,iBAAiB,eAAe,WAAW,CAAC;AAAA,QACrH,CAAC;AACD,YAAI,aAAa,OAAO;AACtB,qBAAW;AAAA,QACb;AACA,YAAI,SAAS;AAAA,UACX;AAAA,UACA;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,aAAO,oBAAoB,SAAS,kBAAkB,UAAU;AAC9D,YAAI,aAAa,QAAQ;AACvB,qBAAW,KAAK;AAAA,QAClB;AACA,eAAO,KAAK,OAAO,WAAW,CAAC,KAAK,KAAK,OAAO,WAAW,CAAC,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS,KAAK,OAAO,WAAW,CAAC,KAAK,KAAK,OAAO,WAAW,CAAC,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO,QAAQ,KAAK,OAAO,WAAW,CAAC,KAAK,KAAK,OAAO,WAAW,CAAC,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO;AAAA,MACrS;AACA,aAAO,kBAAkB,SAAS,kBAAkB;AAClD,YAAI,KAAK,kBAAkB,GAAG;AAC5B,cAAI,UAAU,KAAK,QAAQ,KAAK,OAAO,KAAK,WAAW,CAAC,CAAC;AACzD,cAAI,QAAQ,GAAG,MAAM,OAAO,OAAO,EAAE,YAAY;AACjD,cAAI,OAAO,CAAC;AACZ,cAAI,SAAS,SAAS;AACpB,iBAAK,QAAQ,MAAM,UAAU;AAAA,UAC/B;AACA,cAAI,OAAO,IAAI,YAAY,SAAS,EAAE;AAAA,YACpC,OAAO,MAAM,OAAO;AAAA,YACpB,QAAQ,UAAU,KAAK,UAAU,UAAU,OAAO,UAAU,GAAG,KAAK,UAAU,UAAU,OAAO,SAAS,GAAG,KAAK,OAAO,KAAK,WAAW,CAAC,EAAE,UAAU,OAAO,QAAQ,GAAG,KAAK,OAAO,KAAK,WAAW,CAAC,EAAE,UAAU,OAAO,OAAO,CAAC;AAAA,YAC9N,aAAa,KAAK,UAAU,UAAU,OAAO,SAAS;AAAA,YACtD;AAAA,UACF,CAAC;AACD,eAAK,WAAW,KAAK,WAAW;AAChC,iBAAO;AAAA,QACT,OAAO;AACL,eAAK,WAAW;AAAA,QAClB;AAAA,MACF;AACA,aAAO,aAAa,SAASC,cAAa;AACxC,YAAI,SAAS;AACb,YAAI,KAAK,QAAQ,MAAM,KAAK;AAC1B,iBAAO,KAAK,UAAU;AAAA,QACxB;AAEA,YAAI,kBAAkB,KAAK,0BAA0B,KAAK,QAAQ;AAClE,YAAI,kBAAkB,KAAK,KAAK,OAAO,eAAe,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS,KAAK,OAAO,eAAe,EAAE,UAAU,OAAO,IAAI,MAAM,OAAO,kBAAkB;AAClL,cAAI,QAAQ,KAAK,gCAAgC,eAAe;AAChE,cAAI,MAAM,SAAS,GAAG;AACpB,gBAAI,OAAO,KAAK,QAAQ;AACxB,gBAAI,MAAM;AACR,kBAAI,wBAAwB,KAAK,8BAA8B,KAAK,GAClE,QAAQ,sBAAsB,OAC9B,WAAW,sBAAsB;AACnC,kBAAI,aAAa,QAAW;AAC1B,qBAAK,iBAAiB;AAAA,cACxB;AACA,mBAAK,OAAO,SAAS;AAAA,YACvB,OAAO;AACL,oBAAM,QAAQ,SAAU,GAAG;AACzB,uBAAO,OAAO,QAAQ,CAAC;AAAA,cACzB,CAAC;AAAA,YACH;AAAA,UACF;AACA;AAAA,QACF;AACA,YAAI,aAAa,KAAK;AACtB,YAAI,iCAAiC;AACrC,YAAI,kBAAkB,KAAK,UAAU;AACnC,2CAAiC,KAAK,gCAAgC,eAAe;AAAA,QACvF;AACA,YAAI;AACJ,YAAI,KAAK,kBAAkB,GAAG;AAC5B,iBAAO,KAAK,gBAAgB;AAAA,QAC9B,WAAW,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,YAAY;AACtE,iBAAO,IAAI,YAAY,SAAS,EAAE;AAAA,YAChC,OAAO,KAAK,QAAQ;AAAA,YACpB,QAAQ,eAAe,KAAK,SAAS;AAAA,YACrC,aAAa,KAAK,UAAU,UAAU,OAAO,SAAS;AAAA,UACxD,CAAC;AACD,eAAK;AAAA,QACP,WAAW,kBAAkB,KAAK,UAAU,UAAU,OAAO,IAAI,CAAC,GAAG;AAAA,QAErE,WAAW,CAAC,gCAAgC;AAC1C,eAAK,WAAW;AAAA,QAClB;AACA,YAAI,MAAM;AACR,cAAI,gCAAgC;AAClC,gBAAI,yBAAyB,KAAK,8BAA8B,8BAA8B,GAC5F,SAAS,uBAAuB,OAChC,YAAY,uBAAuB;AACrC,iBAAK,OAAO,SAAS;AACrB,iBAAK,iBAAiB;AAAA,UACxB;AAAA,QACF,OAAO;AAEL,cAAI,yBAAyB,KAAK,8BAA8B,gCAAgC,IAAI,GAClG,UAAU,uBAAuB,OACjC,aAAa,uBAAuB;AACtC,cAAI,CAAC,YAAY;AACf,yBAAa;AAAA,UACf;AACA,cAAI,SAAS,CAAC;AACd,cAAI,OAAO;AAAA,YACT,QAAQ,CAAC;AAAA,UACX;AACA,cAAI,QAAQ,SAAS,GAAG,KAAK,WAAW,SAAS,GAAG,GAAG;AACrD,mBAAO,SAAS,QAAQ,MAAM,GAAG,QAAQ,SAAS,CAAC;AACnD,iBAAK,OAAO,SAAS,WAAW,MAAM,GAAG,WAAW,SAAS,CAAC;AAAA,UAChE,WAAW,QAAQ,WAAW,GAAG,KAAK,WAAW,WAAW,GAAG,GAAG;AAChE,mBAAO,QAAQ,QAAQ,MAAM,CAAC;AAC9B,iBAAK,OAAO,QAAQ,WAAW,MAAM,CAAC;AAAA,UACxC,OAAO;AACL,iBAAK,QAAQ;AAAA,UACf;AACA,iBAAO,IAAI,YAAY,SAAS,EAAE;AAAA,YAChC,OAAO;AAAA,YACP,QAAQ,mBAAmB,YAAY,KAAK,OAAO,KAAK,WAAW,CAAC,CAAC;AAAA,YACrE,aAAa,WAAW,UAAU,OAAO,SAAS;AAAA,YAClD;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AACA,YAAI,KAAK,aAAa,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,OAAO;AAC5E,eAAK,OAAO,QAAQ,KAAK,cAAc,KAAK,QAAQ,CAAC;AACrD,eAAK;AAAA,QACP;AACA,eAAO,KAAK,QAAQ,IAAI;AAAA,MAC1B;AACA,aAAO,QAAQ,SAAS,QAAQ;AAC9B,YAAI,KAAK,aAAa,KAAK,OAAO,SAAS,GAAG;AAC5C,eAAK,KAAK,gBAAgB;AAC1B,eAAK;AACL;AAAA,QACF;AACA,aAAK,QAAQ,kBAAkB;AAC/B,YAAI,WAAW,IAAI,UAAU,SAAS,EAAE;AAAA,UACtC,QAAQ;AAAA,YACN,OAAO,WAAW,KAAK,OAAO,KAAK,WAAW,CAAC,CAAC;AAAA,UAClD;AAAA,UACA,aAAa,KAAK,OAAO,KAAK,WAAW,CAAC,EAAE,UAAU,OAAO,SAAS;AAAA,QACxE,CAAC;AACD,aAAK,QAAQ,OAAO,OAAO,QAAQ;AACnC,aAAK,UAAU;AACf,aAAK;AAAA,MACP;AACA,aAAO,UAAU,SAAS,UAAU;AAClC,YAAI,UAAU,KAAK;AACnB,aAAK,QAAQ,IAAI,SAAS,SAAS,EAAE;AAAA,UACnC,OAAO,KAAK,QAAQ;AAAA,UACpB,QAAQ,eAAe,OAAO;AAAA,UAC9B,aAAa,QAAQ,UAAU,OAAO,SAAS;AAAA,QACjD,CAAC,CAAC;AACF,aAAK;AAAA,MACP;AACA,aAAO,QAAQ,SAASC,OAAM,SAAS,MAAM;AAC3C,cAAM,KAAK,KAAK,MAAM,SAAS,IAAI;AAAA,MACrC;AACA,aAAO,mBAAmB,SAAS,mBAAmB;AACpD,eAAO,KAAK,MAAM,iDAAiD;AAAA,UACjE,OAAO,KAAK,UAAU,UAAU,OAAO,SAAS;AAAA,QAClD,CAAC;AAAA,MACH;AACA,aAAO,qBAAqB,SAAS,qBAAqB;AACxD,eAAO,KAAK,SAAS,uBAAuB,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,MACxF;AACA,aAAO,uBAAuB,SAAS,uBAAuB;AAC5D,eAAO,KAAK,SAAS,0BAA0B,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,MAC3F;AACA,aAAO,aAAa,SAAS,aAAa;AACxC,eAAO,KAAK,MAAM,iBAAiB,KAAK,QAAQ,IAAI,oDAAoD,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,MACpJ;AACA,aAAO,iBAAiB,SAAS,iBAAiB;AAChD,eAAO,KAAK,MAAM,mBAAmB,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,MACjF;AACA,aAAO,YAAY,SAAS,YAAY;AACtC,YAAI,SAAS,KAAK,aAAa,KAAK,QAAQ,KAAK,SAAS,KAAK;AAC/D,YAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,MAAM;AACzD,eAAK;AACL,iBAAO,KAAK,KAAK,MAAM;AAAA,QACzB,WAAW,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,UAAU;AACpE,eAAK;AACL,iBAAO,KAAK,UAAU,MAAM;AAAA,QAC9B;AACA,aAAK,eAAe;AAAA,MACtB;AACA,aAAO,UAAU,SAAS,UAAU;AAClC,YAAI,KAAK,WAAW;AAClB,cAAI,cAAc,KAAK,QAAQ,KAAK,SAAS;AAC7C,cAAI,gBAAgB,KAAK;AACvB,iBAAK;AACL;AAAA,UACF;AAAA,QACF;AACA,YAAI,UAAU,KAAK;AACnB,aAAK,QAAQ,IAAI,SAAS,SAAS,EAAE;AAAA,UACnC,OAAO,KAAK,QAAQ;AAAA,UACpB,QAAQ,eAAe,OAAO;AAAA,UAC9B,aAAa,QAAQ,UAAU,OAAO,SAAS;AAAA,QACjD,CAAC,CAAC;AACF,aAAK;AAAA,MACP;AACA,aAAO,cAAc,SAAS,cAAc;AAC1C,YAAI,OAAO,KAAK,QAAQ;AACxB,YAAI,aAAa;AACjB,aAAK;AACL,YAAI,QAAQ,KAAK,SAASP,OAAM,QAAQ;AACtC,cAAI,WAAW,IAAI,UAAU,SAAS,EAAE;AAAA,YACtC,QAAQ;AAAA,cACN,OAAO,WAAW,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,YAC9C;AAAA,YACA,aAAa,KAAK,OAAO,KAAK,QAAQ,EAAE,UAAU,OAAO,SAAS;AAAA,UACpE,CAAC;AACD,cAAI,QAAQ,KAAK;AACjB,eAAK,OAAO,QAAQ;AACpB,eAAK,UAAU;AACf,iBAAO,KAAK,WAAW,KAAK,OAAO,UAAU,YAAY;AACvD,gBAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,iBAAiB;AACpE;AAAA,YACF;AACA,gBAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,kBAAkB;AACrE;AAAA,YACF;AACA,gBAAI,YAAY;AACd,mBAAK,MAAM;AAAA,YACb,OAAO;AACL,mBAAK,QAAQ,OAAO,MAAM,SAAS,KAAK,SAAS;AACjD,mBAAK,QAAQ,OAAO,OAAO,MAAM,SAAS,KAAK,SAAS;AACxD,mBAAK;AAAA,YACP;AAAA,UACF;AACA,eAAK,UAAU;AAAA,QACjB,OAAO;AAGL,cAAI,aAAa,KAAK;AACtB,cAAI,aAAa;AACjB,cAAI;AACJ,iBAAO,KAAK,WAAW,KAAK,OAAO,UAAU,YAAY;AACvD,gBAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,iBAAiB;AACpE;AAAA,YACF;AACA,gBAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,kBAAkB;AACrE;AAAA,YACF;AACA,uBAAW,KAAK;AAChB,0BAAc,KAAK,sBAAsB,KAAK,SAAS;AACvD,iBAAK;AAAA,UACP;AACA,cAAI,MAAM;AACR,iBAAK,0BAA0B,SAAS,YAAY,UAAU;AAAA,UAChE,OAAO;AACL,iBAAK,QAAQ,IAAI,QAAQ,SAAS,EAAE;AAAA,cAClC,OAAO;AAAA,cACP,QAAQ,UAAU,WAAW,UAAU,OAAO,UAAU,GAAG,WAAW,UAAU,OAAO,SAAS,GAAG,SAAS,UAAU,OAAO,QAAQ,GAAG,SAAS,UAAU,OAAO,OAAO,CAAC;AAAA,cAC1K,aAAa,WAAW,UAAU,OAAO,SAAS;AAAA,YACpD,CAAC,CAAC;AAAA,UACJ;AAAA,QACF;AACA,YAAI,YAAY;AACd,iBAAO,KAAK,SAAS,uBAAuB,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,QACxF;AAAA,MACF;AACA,aAAO,SAAS,SAASQ,UAAS;AAChC,YAAI,SAAS;AACb,YAAI,YAAY;AAChB,YAAI,gBAAgB,KAAK;AACzB,eAAO,KAAK,aAAa,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,OAAO;AAC/E,uBAAa,KAAK,QAAQ;AAC1B,eAAK;AAAA,QACP;AACA,YAAI,CAAC,KAAK,WAAW;AACnB,iBAAO,KAAK,SAAS,CAAC,gBAAgB,gBAAgB,GAAG,KAAK,WAAW,CAAC;AAAA,QAC5E;AACA,YAAI,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,MAAM;AACzD,eAAK,UAAU,OAAO,SAAU,OAAO,QAAQ;AAC7C,yBAAa;AACb,mBAAO,QAAQ,IAAI,QAAQ,SAAS,EAAE;AAAA,cACpC,OAAO;AAAA,cACP,QAAQ,mBAAmB,eAAe,OAAO,SAAS;AAAA,cAC1D,aAAa,cAAc,UAAU,OAAO,SAAS;AAAA,YACvD,CAAC,CAAC;AACF,gBAAI,SAAS,KAAK,OAAO,aAAa,OAAO,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,iBAAiB;AACxG,qBAAO,MAAM,0BAA0B;AAAA,gBACrC,OAAO,OAAO,UAAU,UAAU,OAAO,SAAS;AAAA,cACpD,CAAC;AAAA,YACH;AAAA,UACF,CAAC;AAAA,QACH,OAAO;AACL,iBAAO,KAAK,SAAS,CAAC,gBAAgB,gBAAgB,GAAG,KAAK,UAAU,UAAU,OAAO,SAAS,CAAC;AAAA,QACrG;AAAA,MACF;AACA,aAAO,QAAQ,SAAS,QAAQ;AAC9B,YAAI,UAAU,KAAK,QAAQ;AAE3B,YAAI,KAAK,aAAa,KAAK,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,mBAAmB,KAAK,QAAQ,MAAM,MAAM,SAAU,MAAM;AAChM,iBAAO,KAAK,SAAS;AAAA,QACvB,CAAC,GAAG;AACF,eAAK,SAAS,KAAK,cAAc,OAAO;AACxC,eAAK;AAAA,QACP,WAAW,KAAK,aAAa,KAAK,OAAO,SAAS,KAAK,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,SAAS,KAAK,UAAU,UAAU,OAAO,IAAI,MAAM,OAAO,kBAAkB;AAClL,eAAK,QAAQ,KAAK,OAAO,QAAQ,KAAK,cAAc,OAAO;AAC3D,eAAK;AAAA,QACP,OAAO;AACL,eAAK,WAAW;AAAA,QAClB;AAAA,MACF;AACA,aAAO,SAAS,SAAS,SAAS;AAChC,YAAI,UAAU,KAAK;AACnB,aAAK,QAAQ,IAAI,QAAQ,SAAS,EAAE;AAAA,UAClC,OAAO,KAAK,QAAQ;AAAA,UACpB,QAAQ,eAAe,OAAO;AAAA,UAC9B,aAAa,QAAQ,UAAU,OAAO,SAAS;AAAA,QACjD,CAAC,CAAC;AACF,aAAK;AAAA,MACP;AACA,aAAO,YAAY,SAAS,UAAU,WAAW;AAC/C,YAAI,YAAY,KAAK;AACrB,YAAI,aAAa,KAAK,QAAQ,SAAS,MAAM,KAAK;AAChD,eAAK;AACL,iBAAO,KAAK,UAAU;AAAA,QACxB;AACA,YAAI,UAAU,KAAK;AACnB,aAAK,QAAQ,IAAI,WAAW,SAAS,EAAE;AAAA,UACrC,OAAO,KAAK,QAAQ;AAAA,UACpB,QAAQ,eAAe,OAAO;AAAA,UAC9B,aAAa,QAAQ,UAAU,OAAO,SAAS;AAAA,QACjD,CAAC,GAAG,SAAS;AACb,aAAK;AAAA,MACP;AACA,aAAO,YAAY,SAAS,UAAU,WAAW,eAAe;AAC9D,YAAI,SAAS;AACb,YAAI,YAAY,KAAK;AACrB,YAAI,OAAO,KAAK,QAAQ;AACxB,eAAO,aAAa,CAAC,CAAC,OAAO,QAAQ,OAAO,OAAO,OAAO,QAAQ,OAAO,IAAI,EAAE,QAAQ,UAAU,UAAU,OAAO,IAAI,CAAC,GAAG;AACxH,eAAK;AACL,cAAI,UAAU,KAAK,QAAQ;AAC3B,kBAAQ;AACR,cAAI,QAAQ,YAAY,IAAI,MAAM,QAAQ,SAAS,GAAG;AACpD,gBAAI,OAAO,KAAK;AAChB,gBAAI,QAAQ,KAAK,UAAU,OAAO,IAAI,MAAM,OAAO,OAAO;AACxD,sBAAQ,KAAK,cAAc,KAAK,QAAQ,IAAI,CAAC;AAC7C,mBAAK;AAAA,YACP;AAAA,UACF;AACA,sBAAY,KAAK;AAAA,QACnB;AACA,YAAI,WAAW,UAAU,MAAM,GAAG,EAAE,OAAO,SAAU,GAAG;AAEtD,cAAI,aAAa,KAAK,IAAI,CAAC,MAAM;AAEjC,cAAI,qBAAqB,cAAc,KAAK,IAAI;AAChD,iBAAO,CAAC,cAAc,CAAC;AAAA,QACzB,CAAC;AACD,YAAI,QAAQ,UAAU,MAAM,GAAG,EAAE,OAAO,SAAU,GAAG;AACnD,iBAAO,KAAK,IAAI,CAAC,MAAM;AAAA,QACzB,CAAC;AAED,YAAI,iBAAiB,UAAU,MAAM,IAAI;AACzC,YAAI,eAAe,QAAQ;AACzB,kBAAQ,MAAM,OAAO,SAAU,WAAW;AACxC,mBAAO,CAAC,CAAC,eAAe,QAAQ,SAAS;AAAA,UAC3C,CAAC;AAAA,QACH;AACA,YAAI,WAAW,GAAG,eAAe,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,CAAC;AAC/E,gBAAQ,QAAQ,SAAU,KAAK,GAAG;AAChC,cAAI,QAAQ,QAAQ,IAAI,CAAC,KAAK,KAAK;AACnC,cAAI,QAAQ,KAAK,MAAM,KAAK,KAAK;AACjC,cAAI,MAAM,KAAK,eAAe;AAC5B,mBAAO,cAAc,KAAK,QAAQ,OAAO,QAAQ,MAAM;AAAA,UACzD;AACA,cAAI;AACJ,cAAIC,WAAU,OAAO;AACrB,cAAI,cAAcA,SAAQ,UAAU,OAAO,SAAS,IAAI,QAAQ,CAAC;AACjE,cAAI,SAAS,UAAUA,SAAQ,CAAC,GAAGA,SAAQ,CAAC,IAAI,KAAKA,SAAQ,CAAC,GAAGA,SAAQ,CAAC,KAAK,QAAQ,EAAE;AACzF,cAAI,CAAC,SAAS,QAAQ,GAAG,GAAG;AAC1B,gBAAI,gBAAgB;AAAA,cAClB,OAAO,MAAM,MAAM,CAAC;AAAA,cACpB;AAAA,cACA;AAAA,YACF;AACA,mBAAO,IAAI,WAAW,SAAS,EAAE,aAAa,eAAe,OAAO,CAAC;AAAA,UACvE,WAAW,CAAC,MAAM,QAAQ,GAAG,GAAG;AAC9B,gBAAI,SAAS;AAAA,cACX,OAAO,MAAM,MAAM,CAAC;AAAA,cACpB;AAAA,cACA;AAAA,YACF;AACA,mBAAO,IAAI,IAAI,SAAS,EAAE,aAAa,QAAQ,OAAO,CAAC;AAAA,UACzD,OAAO;AACL,gBAAI,UAAU;AAAA,cACZ;AAAA,cACA;AAAA,cACA;AAAA,YACF;AACA,yBAAa,SAAS,OAAO;AAC7B,mBAAO,IAAI,KAAK,SAAS,EAAE,OAAO;AAAA,UACpC;AACA,iBAAO,QAAQ,MAAM,SAAS;AAE9B,sBAAY;AAAA,QACd,CAAC;AACD,aAAK;AAAA,MACP;AACA,aAAO,OAAO,SAAS,KAAK,WAAW;AACrC,YAAI,YAAY,KAAK;AACrB,YAAI,aAAa,KAAK,QAAQ,SAAS,MAAM,KAAK;AAChD,eAAK;AACL,iBAAO,KAAK,UAAU;AAAA,QACxB;AACA,eAAO,KAAK,UAAU,SAAS;AAAA,MACjC;AACA,aAAO,OAAO,SAAS,OAAO;AAC5B,eAAO,KAAK,WAAW,KAAK,OAAO,QAAQ;AACzC,eAAK,MAAM,IAAI;AAAA,QACjB;AACA,aAAK,QAAQ,kBAAkB;AAC/B,eAAO,KAAK;AAAA,MACd;AACA,aAAO,QAAQ,SAASC,OAAM,oBAAoB;AAChD,gBAAQ,KAAK,UAAU,UAAU,OAAO,IAAI,GAAG;AAAA,UAC7C,KAAK,OAAO;AACV,iBAAK,MAAM;AACX;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,QAAQ;AACb;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,YAAY;AACjB;AAAA,UACF,KAAK,OAAO;AACV,gBAAI,oBAAoB;AACtB,mBAAK,mBAAmB;AAAA,YAC1B;AACA;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,UAAU;AACf;AAAA,UACF,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO;AACV,iBAAK,KAAK;AACV;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,OAAO;AACZ;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,MAAM;AACX;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,UAAU;AACf;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,QAAQ;AACb;AAAA,UACF,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO;AACV,iBAAK,WAAW;AAChB;AAAA,UACF,KAAK,OAAO;AACV,iBAAK,OAAO;AACZ;AAAA;AAAA,UAEF,KAAK,OAAO;AACV,iBAAK,qBAAqB;AAAA,UAC5B,KAAK,OAAO;AACV,iBAAK,iBAAiB;AAAA,UACxB;AACE,iBAAK,WAAW;AAAA,QACpB;AAAA,MACF;AAKA,aAAO,WAAW,SAAS,SAAS,aAAa,OAAO,OAAO;AAC7D,YAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,cAAI,OAAO,YAAY,IAAI;AAC3B,wBAAc,YAAY,KAAK,IAAI,IAAI,SAAS;AAAA,QAClD;AACA,YAAI,KAAK,WAAW,KAAK,YAAY,CAAC,CAAC,IAAI,OAAO;AAClD,YAAI,CAAC,OAAO;AACV,iBAAO,KAAK,MAAM,cAAc,KAAK,MAAM,cAAc,KAAK;AAAA,YAC5D;AAAA,UACF,CAAC;AAAA,QACH;AACA,eAAO,KAAK,MAAM,cAAc,KAAK,MAAM,cAAc,cAAe,QAAQ,cAAe;AAAA,UAC7F;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,gBAAgB,SAAS,cAAc,OAAO;AACnD,eAAO,KAAK,QAAQ,QAAQ,MAAM;AAAA,MACpC;AACA,aAAO,gBAAgB,SAAS,cAAc,OAAO;AACnD,eAAO,KAAK,QAAQ,QAAQ,KAAK;AAAA,MACnC;AACA,aAAO,aAAa,SAAS,WAAW,OAAO,UAAU;AACvD,YAAI,KAAK,QAAQ,OAAO;AACtB,iBAAO,WAAW,MAAM;AAAA,QAC1B,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,wBAAwB,SAAS,sBAAsB,OAAO;AACnE,YAAI,UAAU,KAAK,QAAQ,KAAK;AAChC,YAAI,MAAM,UAAU,OAAO,IAAI,MAAM,OAAO,OAAO;AACjD,iBAAO,KAAK,cAAc,OAAO;AAAA,QACnC,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,UAAU,SAAS,QAAQ,MAAM,WAAW;AACjD,YAAI,WAAW;AACb,cAAI,OAAO,KAAK,SAAS,GAAG;AAC1B,gBAAI,CAAC,KAAK,QAAQ,OAAO;AACvB,mBAAK,UAAU,KAAK,UAAU,MAAM;AAAA,YACtC;AACA,wBAAY;AAAA,UACd;AACA,eAAK,YAAY;AACjB,uBAAa,MAAM,WAAW;AAAA,QAChC;AACA,YAAI,KAAK,QAAQ;AACf,eAAK,OAAO,SAAS,KAAK;AAC1B,eAAK,SAAS;AAAA,QAChB;AACA,eAAO,KAAK,QAAQ,OAAO,IAAI;AAAA,MACjC;AACA,aAAO,UAAU,SAAS,QAAQ,OAAO;AACvC,YAAI,UAAU,QAAQ;AACpB,kBAAQ,KAAK;AAAA,QACf;AACA,eAAO,KAAK,IAAI,MAAM,MAAM,UAAU,OAAO,SAAS,GAAG,MAAM,UAAU,OAAO,OAAO,CAAC;AAAA,MAC1F;AAKA,aAAO,4BAA4B,SAAS,0BAA0B,eAAe;AACnF,YAAI,kBAAkB,QAAQ;AAC5B,0BAAgB,KAAK,WAAW;AAAA,QAClC;AACA,YAAI,iBAAiB;AACrB,eAAO,iBAAiB,KAAK,OAAO,QAAQ;AAC1C,cAAI,wBAAwB,KAAK,OAAO,cAAc,EAAE,UAAU,OAAO,IAAI,CAAC,GAAG;AAC/E;AACA;AAAA,UACF,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,mBAAaP,SAAQ,CAAC;AAAA,QACpB,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,OAAO,KAAK,QAAQ;AAAA,QAClC;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,OAAO,KAAK,WAAW,CAAC;AAAA,QACtC;AAAA,MACF,GAAG;AAAA,QACD,KAAK;AAAA,QACL,KAAK,SAAS,MAAM;AAClB,iBAAO,KAAK,OAAO,KAAK,WAAW,CAAC;AAAA,QACtC;AAAA,MACF,CAAC,CAAC;AACF,aAAOA;AAAA,IACT,EAAE;AACF,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACt/BzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,UAAU,uBAAuB,gBAAmB;AACxD,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,QAAIQ,aAAyB,2BAAY;AACvC,eAASA,WAAU,MAAM,SAAS;AAChC,aAAK,OAAO,QAAQ,SAAS,OAAO;AAAA,QAAC;AACrC,aAAK,UAAU;AACf,aAAK,UAAU;AAAA,MACjB;AACA,UAAI,SAASA,WAAU;AACvB,aAAO,wBAAwB,SAAS,sBAAsB,MAAM,SAAS;AAC3E,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,YAAI,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,SAAS,OAAO;AACpD,YAAI,OAAO,mBAAmB,OAAO;AACnC,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO,OAAO,SAAS;AAAA,QACzB;AAAA,MACF;AACA,aAAO,WAAW,SAAS,SAAS,SAAS;AAC3C,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,YAAI,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,SAAS,OAAO;AACpD,YAAI,OAAO,aAAa,OAAO;AAC7B,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,QAAQ,SAAS,MAAM,MAAM,SAAS;AAC3C,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,YAAI,SAAS,IAAI,QAAQ,SAAS,EAAE,MAAM,KAAK,cAAc,OAAO,CAAC;AACrE,eAAO,OAAO;AAAA,MAChB;AACA,aAAO,gBAAgB,SAAS,cAAc,SAAS;AACrD,eAAO;AAAA,UACL,OAAO,KAAK,SAAS,OAAO;AAAA,QAC9B;AAAA,MACF;AACA,aAAO,OAAO,SAAS,KAAK,MAAM,SAAS;AACzC,YAAI,QAAQ;AACZ,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,eAAO,IAAI,QAAQ,SAAUC,WAAS,QAAQ;AAC5C,cAAI;AACF,gBAAIC,QAAO,MAAM,MAAM,MAAM,OAAO;AACpC,oBAAQ,QAAQ,MAAM,KAAKA,KAAI,CAAC,EAAE,KAAK,SAAU,WAAW;AAC1D,kBAAI,SAAS;AACb,kBAAI,MAAM,sBAAsB,MAAM,OAAO,GAAG;AAC9C,yBAASA,MAAK,SAAS;AACvB,qBAAK,WAAW;AAAA,cAClB;AACA,qBAAO;AAAA,gBACL;AAAA,gBACA,MAAMA;AAAA,gBACN;AAAA,cACF;AAAA,YACF,CAAC,EAAE,KAAKD,WAAS,MAAM;AAAA,UACzB,SAAS,GAAG;AACV,mBAAO,CAAC;AACR;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,WAAW,SAAS,SAAS,MAAM,SAAS;AACjD,YAAI,YAAY,QAAQ;AACtB,oBAAU,CAAC;AAAA,QACb;AACA,YAAIC,QAAO,KAAK,MAAM,MAAM,OAAO;AACnC,YAAI,YAAY,KAAK,KAAKA,KAAI;AAC9B,YAAI,aAAa,OAAO,UAAU,SAAS,YAAY;AACrD,gBAAM,IAAI,MAAM,8DAA8D;AAAA,QAChF;AACA,YAAI,SAAS;AACb,YAAI,QAAQ,kBAAkB,OAAO,SAAS,UAAU;AACtD,mBAASA,MAAK,SAAS;AACvB,eAAK,WAAW;AAAA,QAClB;AACA,eAAO;AAAA,UACL;AAAA,UACA,MAAMA;AAAA,UACN;AAAA,QACF;AAAA,MACF;AASA,aAAO,MAAM,SAAS,IAAI,MAAM,SAAS;AACvC,eAAO,KAAK,KAAK,MAAM,OAAO,EAAE,KAAK,SAAU,QAAQ;AACrD,iBAAO,OAAO;AAAA,QAChB,CAAC;AAAA,MACH;AASA,aAAO,UAAU,SAAS,QAAQ,MAAM,SAAS;AAC/C,eAAO,KAAK,SAAS,MAAM,OAAO,EAAE;AAAA,MACtC;AASA,aAAO,YAAY,SAAS,UAAU,MAAM,SAAS;AACnD,eAAO,KAAK,KAAK,MAAM,OAAO,EAAE,KAAK,SAAU,QAAQ;AACrD,iBAAO,OAAO;AAAA,QAChB,CAAC;AAAA,MACH;AASA,aAAO,gBAAgB,SAAS,cAAc,MAAM,SAAS;AAC3D,eAAO,KAAK,SAAS,MAAM,OAAO,EAAE;AAAA,MACtC;AASA,aAAO,UAAU,SAASC,SAAQ,MAAM,SAAS;AAC/C,eAAO,KAAK,KAAK,MAAM,OAAO,EAAE,KAAK,SAAU,QAAQ;AACrD,iBAAO,OAAO,UAAU,OAAO,KAAK,SAAS;AAAA,QAC/C,CAAC;AAAA,MACH;AASA,aAAO,cAAc,SAAS,YAAY,MAAM,SAAS;AACvD,YAAI,SAAS,KAAK,SAAS,MAAM,OAAO;AACxC,eAAO,OAAO,UAAU,OAAO,KAAK,SAAS;AAAA,MAC/C;AACA,aAAOH;AAAA,IACT,EAAE;AACF,YAAQ,SAAS,IAAIA;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACzKzB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,YAAY,QAAQ,MAAM,QAAQ,SAAS,QAAQ,WAAW,QAAQ,OAAO,QAAQ,SAAS,QAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAQ,aAAa,QAAQ,YAAY,QAAQ,YAAY;AACpN,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAI,cAAc,uBAAuB,oBAAuB;AAChE,QAAI,WAAW,uBAAuB,iBAAoB;AAC1D,QAAI,MAAM,uBAAuB,YAAe;AAChD,QAAI,WAAW,uBAAuB,iBAAoB;AAC1D,QAAI,UAAU,uBAAuB,gBAAmB;AACxD,QAAI,QAAQ,uBAAuB,cAAiB;AACpD,QAAI,YAAY,uBAAuB,kBAAqB;AAC5D,QAAI,UAAU,uBAAuB,gBAAmB;AACxD,QAAI,OAAO,uBAAuB,aAAgB;AAClD,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,QAAII,aAAY,SAASA,WAAU,MAAM;AACvC,aAAO,IAAI,WAAW,SAAS,EAAE,IAAI;AAAA,IACvC;AACA,YAAQ,YAAYA;AACpB,QAAI,YAAY,SAASC,WAAU,MAAM;AACvC,aAAO,IAAI,WAAW,SAAS,EAAE,IAAI;AAAA,IACvC;AACA,YAAQ,YAAY;AACpB,QAAIC,cAAa,SAASA,YAAW,MAAM;AACzC,aAAO,IAAI,YAAY,SAAS,EAAE,IAAI;AAAA,IACxC;AACA,YAAQ,aAAaA;AACrB,QAAI,UAAU,SAASC,SAAQ,MAAM;AACnC,aAAO,IAAI,SAAS,SAAS,EAAE,IAAI;AAAA,IACrC;AACA,YAAQ,UAAU;AAClB,QAAIC,MAAK,SAASA,IAAG,MAAM;AACzB,aAAO,IAAI,IAAI,SAAS,EAAE,IAAI;AAAA,IAChC;AACA,YAAQ,KAAKA;AACb,QAAI,UAAU,SAASC,SAAQ,MAAM;AACnC,aAAO,IAAI,SAAS,SAAS,EAAE,IAAI;AAAA,IACrC;AACA,YAAQ,UAAU;AAClB,QAAIC,UAAS,SAASA,QAAO,MAAM;AACjC,aAAO,IAAI,QAAQ,SAAS,EAAE,IAAI;AAAA,IACpC;AACA,YAAQ,SAASA;AACjB,QAAIC,QAAO,SAASA,MAAK,MAAM;AAC7B,aAAO,IAAI,MAAM,SAAS,EAAE,IAAI;AAAA,IAClC;AACA,YAAQ,OAAOA;AACf,QAAI,WAAW,SAASC,UAAS,MAAM;AACrC,aAAO,IAAI,UAAU,SAAS,EAAE,IAAI;AAAA,IACtC;AACA,YAAQ,WAAW;AACnB,QAAI,SAAS,SAASC,QAAO,MAAM;AACjC,aAAO,IAAI,QAAQ,SAAS,EAAE,IAAI;AAAA,IACpC;AACA,YAAQ,SAAS;AACjB,QAAI,MAAM,SAASC,KAAI,MAAM;AAC3B,aAAO,IAAI,KAAK,SAAS,EAAE,IAAI;AAAA,IACjC;AACA,YAAQ,MAAM;AACd,QAAI,YAAY,SAASC,WAAU,MAAM;AACvC,aAAO,IAAI,WAAW,SAAS,EAAE,IAAI;AAAA,IACvC;AACA,YAAQ,YAAY;AAAA;AAAA;;;AChEpB;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,YAAY,QAAQ,eAAe,QAAQ,cAAc,QAAQ,cAAc;AACvF,YAAQ,cAAc;AACtB,YAAQ,eAAe;AACvB,YAAQ,cAAc;AACtB,YAAQ,YAAY;AACpB,YAAQ,SAAS;AACjB,YAAQ,WAAW;AACnB,YAAQ,gBAAgB;AACxB,YAAQ,kBAAkB;AAC1B,YAAQ,cAAc,QAAQ,QAAQ,QAAQ,WAAW,QAAQ,aAAa,QAAQ,SAAS;AAC/F,QAAI,SAAS;AACb,QAAI;AACJ,QAAI,WAAW,WAAW,CAAC,GAAG,SAAS,OAAO,SAAS,IAAI,MAAM,SAAS,OAAO,KAAK,IAAI,MAAM,SAAS,OAAO,UAAU,IAAI,MAAM,SAAS,OAAO,OAAO,IAAI,MAAM,SAAS,OAAO,EAAE,IAAI,MAAM,SAAS,OAAO,OAAO,IAAI,MAAM,SAAS,OAAO,MAAM,IAAI,MAAM,SAAS,OAAO,IAAI,IAAI,MAAM,SAAS,OAAO,QAAQ,IAAI,MAAM,SAAS,OAAO,MAAM,IAAI,MAAM,SAAS,OAAO,GAAG,IAAI,MAAM,SAAS,OAAO,SAAS,IAAI,MAAM;AACla,aAAS,OAAO,MAAM;AACpB,aAAO,OAAO,SAAS,YAAY,QAAQ,KAAK,IAAI;AAAA,IACtD;AACA,aAAS,WAAW,MAAM,MAAM;AAC9B,aAAO,OAAO,IAAI,KAAK,KAAK,SAAS;AAAA,IACvC;AACA,QAAI,cAAc,WAAW,KAAK,MAAM,OAAO,SAAS;AACxD,YAAQ,cAAc;AACtB,QAAI,cAAc,WAAW,KAAK,MAAM,OAAO,KAAK;AACpD,YAAQ,cAAc;AACtB,QAAI,eAAe,WAAW,KAAK,MAAM,OAAO,UAAU;AAC1D,YAAQ,eAAe;AACvB,QAAI,YAAY,WAAW,KAAK,MAAM,OAAO,OAAO;AACpD,YAAQ,YAAY;AACpB,QAAI,eAAe,WAAW,KAAK,MAAM,OAAO,EAAE;AAClD,YAAQ,eAAe;AACvB,QAAI,YAAY,WAAW,KAAK,MAAM,OAAO,OAAO;AACpD,YAAQ,YAAY;AACpB,QAAI,WAAW,WAAW,KAAK,MAAM,OAAO,MAAM;AAClD,YAAQ,WAAW;AACnB,QAAI,SAAS,WAAW,KAAK,MAAM,OAAO,IAAI;AAC9C,YAAQ,SAAS;AACjB,QAAI,aAAa,WAAW,KAAK,MAAM,OAAO,QAAQ;AACtD,YAAQ,aAAa;AACrB,QAAI,WAAW,WAAW,KAAK,MAAM,OAAO,MAAM;AAClD,YAAQ,WAAW;AACnB,QAAI,QAAQ,WAAW,KAAK,MAAM,OAAO,GAAG;AAC5C,YAAQ,QAAQ;AAChB,QAAI,cAAc,WAAW,KAAK,MAAM,OAAO,SAAS;AACxD,YAAQ,cAAc;AACtB,aAAS,gBAAgB,MAAM;AAC7B,aAAO,SAAS,IAAI,KAAK,KAAK,UAAU,KAAK,MAAM,WAAW,IAAI,KAAK,KAAK,MAAM,YAAY,MAAM,aAAa,KAAK,MAAM,YAAY,MAAM,YAAY,KAAK,MAAM,YAAY,MAAM,mBAAmB,KAAK,MAAM,YAAY,MAAM;AAAA,IACzO;AACA,aAAS,cAAc,MAAM;AAC3B,aAAO,SAAS,IAAI,KAAK,CAAC,gBAAgB,IAAI;AAAA,IAChD;AACA,aAAS,YAAY,MAAM;AACzB,aAAO,CAAC,EAAE,OAAO,IAAI,KAAK,KAAK;AAAA,IACjC;AACA,aAAS,YAAY,MAAM;AACzB,aAAO,YAAY,IAAI,KAAK,MAAM,IAAI;AAAA,IACxC;AAAA;AAAA;;;ACzDA;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,QAAI,SAAS;AACb,WAAO,KAAK,MAAM,EAAE,QAAQ,SAAU,KAAK;AACzC,UAAI,QAAQ,aAAa,QAAQ,aAAc;AAC/C,UAAI,OAAO,WAAW,QAAQ,GAAG,MAAM,OAAO,GAAG,EAAG;AACpD,cAAQ,GAAG,IAAI,OAAO,GAAG;AAAA,IAC3B,CAAC;AACD,QAAI,gBAAgB;AACpB,WAAO,KAAK,aAAa,EAAE,QAAQ,SAAU,KAAK;AAChD,UAAI,QAAQ,aAAa,QAAQ,aAAc;AAC/C,UAAI,OAAO,WAAW,QAAQ,GAAG,MAAM,cAAc,GAAG,EAAG;AAC3D,cAAQ,GAAG,IAAI,cAAc,GAAG;AAAA,IAClC,CAAC;AACD,QAAI,UAAU;AACd,WAAO,KAAK,OAAO,EAAE,QAAQ,SAAU,KAAK;AAC1C,UAAI,QAAQ,aAAa,QAAQ,aAAc;AAC/C,UAAI,OAAO,WAAW,QAAQ,GAAG,MAAM,QAAQ,GAAG,EAAG;AACrD,cAAQ,GAAG,IAAI,QAAQ,GAAG;AAAA,IAC5B,CAAC;AAAA;AAAA;;;ACpBD;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,SAAS,IAAI;AACrB,QAAI,aAAa,uBAAuB,mBAAsB;AAC9D,QAAIC,aAAY,wBAAwB,mBAAsB;AAC9D,aAAS,yBAAyB,aAAa;AAAE,UAAI,OAAO,YAAY,WAAY,QAAO;AAAM,UAAI,oBAAoB,oBAAI,QAAQ;AAAG,UAAI,mBAAmB,oBAAI,QAAQ;AAAG,cAAQ,2BAA2B,SAASC,0BAAyBC,cAAa;AAAE,eAAOA,eAAc,mBAAmB;AAAA,MAAmB,GAAG,WAAW;AAAA,IAAG;AAC9U,aAAS,wBAAwB,KAAK,aAAa;AAAE,UAAI,CAAC,eAAe,OAAO,IAAI,YAAY;AAAE,eAAO;AAAA,MAAK;AAAE,UAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY;AAAE,eAAO,EAAE,WAAW,IAAI;AAAA,MAAG;AAAE,UAAI,QAAQ,yBAAyB,WAAW;AAAG,UAAI,SAAS,MAAM,IAAI,GAAG,GAAG;AAAE,eAAO,MAAM,IAAI,GAAG;AAAA,MAAG;AAAE,UAAI,SAAS,CAAC;AAAG,UAAI,wBAAwB,OAAO,kBAAkB,OAAO;AAA0B,eAAS,OAAO,KAAK;AAAE,YAAI,QAAQ,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAAE,cAAI,OAAO,wBAAwB,OAAO,yBAAyB,KAAK,GAAG,IAAI;AAAM,cAAI,SAAS,KAAK,OAAO,KAAK,MAAM;AAAE,mBAAO,eAAe,QAAQ,KAAK,IAAI;AAAA,UAAG,OAAO;AAAE,mBAAO,GAAG,IAAI,IAAI,GAAG;AAAA,UAAG;AAAA,QAAE;AAAA,MAAE;AAAE,aAAO,SAAS,IAAI;AAAK,UAAI,OAAO;AAAE,cAAM,IAAI,KAAK,MAAM;AAAA,MAAG;AAAE,aAAO;AAAA,IAAQ;AACxyB,aAAS,uBAAuB,KAAK;AAAE,aAAO,OAAO,IAAI,aAAa,MAAM,EAAE,WAAW,IAAI;AAAA,IAAG;AAChG,QAAI,SAAS,SAASC,QAAO,WAAW;AACtC,aAAO,IAAI,WAAW,SAAS,EAAE,SAAS;AAAA,IAC5C;AACA,WAAO,OAAO,QAAQH,UAAS;AAC/B,WAAO,OAAO;AACd,QAAI,WAAW;AACf,YAAQ,SAAS,IAAI;AACrB,WAAO,UAAU,QAAQ;AAAA;AAAA;;;ACiLzB,IAAM,SAAS,CACb,KACA,aACA,SACA,OACA,OAEiC,gBAC/B;AACF,QAAM,KAAK,IAAI,IAAI,SAAS,QAAQ,EAAE,MAAK,IAAK,MAAS;AAEzD,QAAM,oBAAoB,IAAI,IAAI;AAClC,SAAO;AACT;AAEO,IAAM,QAAQ,CACnB,SACA,OACA,SACG,OAAO,OAAO,OAAO,SAAS,OAAO,IAAI;AAEvC,IAAM,YAAY,CACvB,SACA,OACA,SACG,OAAO,WAAW,WAAW,SAAS,OAAO,IAAI;AAE/C,IAAM,cAAc,CACzB,SACA,OACA,SACG,OAAO,aAAa,aAAa,SAAS,OAAO,IAAI;;;AChO1D,SAAS,eAAe;AACxB,SACE,YACA,MACA,SACA,SAAS,eACJ;AACP,SAAS,eAA+B;;;ACmDlC,SAAU,UACd,KACA,OACAI,SAAQ,IACR,QAIkB;AAElB,MAAI,IAAI;AACR,MAAI,IAAI;AACR,QAAM,IAAI,MAAM;AAChB,QAAM,QAA2B,CAAA;AACjC,SAAO,MAAM,IAAI;AACf,QAAI,IAAI,QAAQ,OAAO,CAAC;AACxB,UAAM,OACJ,MAAM,MAAM,MAAM,WAAWA,SAAQ,IACnC,IAAI,UAAU,CAAC,IACf,IAAI,UAAU,GAAG,CAAC;AACtB,UAAM,KAAM,SAAS,MAAM,OAAO,CAAC,KAAK,IAAwB;AAChE,QAAI,MAAM,WAAWA,QAAO;AAE1B,aAAO;IACT;AACA,QAAI,IAAI;EACV;AACA,SAAO;AACT;;;AClFA,IAAM,cAAc,CAAC,MAA8B;AACjD,MAAI,CAAC,WAAW,KAAK,CAAC;AAAG,WAAO;AAChC,QAAM,IAAI,OAAO,CAAC;AAClB,SAAO,KAAK,OAAO,mBAAmB,IAAI;AAC5C;AAEA,IAAM,aAAa,CACjB,GACAC,UACA,UACU;AACV,QAAM,IAAI,OAAO,CAAC;AAClB,MAAI,IAAI,OAAO,kBAAkB;AAC/B,UAAM,eACJA,UACA,WAAW,KAAK,gBAAgB,OAAO,gBAAgB,EAAE;EAE7D;AACA,SAAO;AACT;AAEA,IAAM,KAAK;EACT,QAAQ;EACR,MAAM;EACN,YAAY;EACZ,OAAO;EACP,MAAM;;AAGR,IAAM,iBAAiB,CACrBA,UACA,YACe;AACf,QAAM,KAAK,YACT,oBAAoB,OAAO,IAC3B,EAAE,SAAAA,SAAO,GACT,OAAO;AAET,SAAO;AACT;AAqBM,IAAO,UAAP,MAAO,SAAO;;EAElB;;EAGA;;EAEA;;EAEA;;;;;;;EAOA;;;;;;EAMA;;EAGA,WAAQ;AACN,WAAO,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,GAC9C,KAAK,aAAa,MAAM,KAAK,WAAW,KAAK,GAAG,IAAI,EACtD,GAAG,KAAK,QAAQ,MAAM,KAAK,MAAM,KAAK,GAAG,IAAI,EAAE;EACjD;;EAGA,OAAO,MAAMA,UAAe;AAC1B,IAAAA,WAAUA,SAAQ,QAAQ,GAAG,QAAQ,EAAE,EAAE,KAAI;AAC7C,QAAIA,SAAQ,SAAS,KAAK;AACxB,YAAM,eACJA,UACA,kCAAkC;IAEtC;AAEA,UAAM,SAASA,SAAQ,MAAM,GAAG,IAAI;AACpC,QAAI,CAAC,QAAQ;AACX,YAAM,OAAOA,SAAQ,MAAM,GAAG,IAAI;AAClC,UAAI,CAAC,MAAM;AACT,cAAM,eACJA,UACA,oCAAoC;MAExC,OAAO;AACL,cAAM,eACJA,UACA,gCAAgC;MAEpC;IACF;AACA,UAAM,CAAC,GAAG,QAAQ,QAAQ,QAAQ,YAAYC,MAAK,IAAI;AAQvD,UAAMC,SAAQ,WAAW,QAAQF,UAAS,OAAO;AACjD,UAAMG,SAAQ,WAAW,QAAQH,UAAS,OAAO;AACjD,UAAM,QAAQ,WAAW,QAAQA,UAAS,OAAO;AAEjD,WAAO,IAAI,SACTA,UACAE,QACAC,QACA,OACA,YACAF,MAAK;EAET;EAEA,YACED,UACAE,QACAC,QACA,OACA,YACAF,QAAyB;AAEzB,SAAK,MAAMD;AACX,SAAK,QAAQE;AACb,SAAK,QAAQC;AACb,SAAK,QAAQ;AAGb,QAAI,YAAY;AACd,WAAK,aAAa,UAAU,YAAY,KAAK,IAAI,OAAI;AACnD,YAAI,CAAC,GAAG;AACN,gBAAM,eACJH,UACA,mDAAmD;QAEvD;AACA,eAAO,YAAY,CAAC;MACtB,CAAC;IACH;AACA,QAAIC,QAAO;AACT,WAAK,QAAQ,UAAUA,QAAO,KAAK,IAAI,OAAI;AACzC,YAAI,CAAC,GAAG;AACN,gBAAM,eACJD,UACA,uDAAuD;QAE3D;MACF,CAAC;IACH;EACF;;;;;;;;;;;;;;;EAgBA,QAAQ,GAAU;AAChB,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AACjC,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AACjC,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AACjC,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AACjC,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AACjC,QAAI,KAAK,QAAQ,EAAE;AAAO,aAAO;AAGjC,QAAI,CAAC,EAAE,YAAY;AACjB,aAAO,CAAC,KAAK,YAAY,SAAS,IAAI;AAExC,QAAI,CAAC,KAAK,YAAY;AAAQ,aAAO;AAErC,UAAM,MAAM,KAAK,IAAI,KAAK,WAAW,QAAQ,EAAE,WAAW,MAAM;AAChE,UAAM,KAAK,KAAK;AAChB,UAAM,OAAO,EAAE;AACf,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAM,IAAI,GAAG,CAAC;AACd,YAAM,IAAI,KAAK,CAAC;AAChB,UAAI,MAAM;AAAG;AAEb,UAAI,MAAM;AAAW,eAAO;AAC5B,UAAI,MAAM;AAAW,eAAO;AAE5B,UAAI,OAAO,MAAM,OAAO,GAAG;AACzB,eAAO,OAAO,MAAM,WAAW,IAAI;MACrC;AACA,aAAO,IAAI,IAAI,IAAI;IACrB;AACA,WAAO;EACT;;;;EAKA,SAAS,GAAU;AACjB,WAAO,KAAK,KAAK,QAAQ,CAAC;EAC5B;;EAGA,YAAY,GAAU;AACpB,WAAO,KAAK,QAAQ,CAAC,MAAM;EAC7B;;EAGA,iBAAiB,GAAU;AACzB,WAAO,KAAK,QAAQ,CAAC,IAAI;EAC3B;;EAGA,SAAS,GAAU;AACjB,WAAO,KAAK,QAAQ,CAAC,MAAM;EAC7B;;EAGA,cAAc,GAAU;AACtB,WAAO,KAAK,QAAQ,CAAC,IAAI;EAC3B;;EAGA,OAAO,GAAU;AACf,WAAO,KAAK,QAAQ,CAAC,MAAM;EAC7B;;EAGA,YAAY,GAAU;AACpB,WACE,KAAK,UAAU,EAAE,SACjB,KAAK,UAAU,EAAE,SACjB,KAAK,UAAU,EAAE;EAErB;;EAGA,UAAU,GAAQ;AAChB,WAAO,EAAE,KAAK,IAAI;EACpB;;;;;;EAOA,IAAI,MAAqB,sBAA6B;AACpD,YAAQ,MAAM;MACZ,KAAK;AACH,aAAK,aAAa;AAClB,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,aAAK;AACL,aAAK,IAAI,OAAO,oBAAoB;AACpC;MAEF,KAAK;AACH,aAAK,aAAa;AAClB,aAAK,QAAQ;AACb,aAAK;AACL,aAAK,IAAI,OAAO,oBAAoB;AACpC;MAEF,KAAK;AACH,aAAK,aAAa;AAClB,aAAK,IAAI,OAAO;AAChB,aAAK,IAAI,OAAO,oBAAoB;AACpC;MAEF,KAAK;AACH,YAAI,CAAC,KAAK,YAAY;AACpB,eAAK,IAAI,SAAS,oBAAoB;AACxC,aAAK,IAAI,OAAO,oBAAoB;AACpC;MAEF,KAAK,OAAO;AAIV,YAAI,CAAC,sBAAsB;AACzB,cAAI,CAAC,KAAK,YAAY,QAAQ;AAC5B,iBAAK,aAAa,CAAC,CAAC;AACpB;UACF;AACA,gBAAM,OAAO,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC;AACvD,cAAI,OAAO,SAAS,UAAU;AAC5B,iBAAK,WAAW,KAAK,WAAW,SAAS,CAAC,IAAI,OAAO;UACvD,OAAO;AACL,iBAAK,WAAW,KAAK,CAAC;UACxB;AACA;QACF;AACA,YAAI,CAAC,KAAK,YAAY,QAAQ;AAC5B,eAAK,aAAa,CAAC,oBAAoB;AACvC;QACF;AACA,cAAM,IAAI,KAAK,WAAW,QACxB,YAAY,oBAAoB,CAAC;AAEnC,YAAI,MAAM,IAAI;AACZ,eAAK,aAAa,CAAC,oBAAoB;AACvC;QACF;AACA,cAAM,YAAY,KAAK,WAAW,IAAI,CAAC;AACvC,YAAI,OAAO,cAAc,UAAU;AACjC,eAAK,WAAW,IAAI,CAAC,IAAI,YAAY;AACrC;QACF;AACA,YAAI,MAAM,KAAK,WAAW,SAAS,GAAG;AACpC,eAAK,WAAW,KAAK,CAAC;AACtB;QACF;AACA,aAAK,WAAW,OAAO,IAAI,GAAG,GAAG,CAAC;AAClC;MACF;MAEA,KAAK;AACH,YAAI,CAAC,KAAK,YAAY,UAAU,KAAK,SAAS,KAAK;AACjD,eAAK;AACP,aAAK,aAAa;AAClB,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb;MAEF,KAAK;AACH,YAAI,CAAC,KAAK,YAAY,UAAU,KAAK;AAAO,eAAK;AACjD,aAAK,aAAa;AAClB,aAAK,QAAQ;AACb;MAEF,KAAK;AACH,YAAI,CAAC,KAAK,YAAY;AAAQ,eAAK;AACnC,aAAK,aAAa;AAClB;MAEF;AACE,cAAM,UACJ,gCACA;UACE,SAAS;UACT,OAAO;UACP,cAAc;YACZ;YACA;YACA;YACA;YACA;YACA;YACA;YACA;;WAGJ,KAAK,GAAG;IAEd;AAEA,SAAK,MAAM,KAAK,SAAQ;AACxB,WAAO;EACT;;;;AC1XF,IAAM,aAAa,CACjB,MAEA,CAAC,CAAC,MACD,MAAM,OACL,MAAM,OACN,MAAM,QACN,MAAM,QACN,MAAM,MACN,MAAM,OACN,MAAM,OACN,MAAM;AAKV,IAAM,UAAU,IAAI,IAAI,MAAO;AAE/B,IAAM,cAAc,CAAC,GAAW,YAC9B,YACE,wBAAwB,CAAC,KAAK,OAAO,IACrC,EAAE,OAAO,EAAC,GACV,UAAU;AAGd,IAAM,eAAe,CAAC,OAAe,GAAW,UAAiB;AAC/D,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,MAAM,GAAG;AACX,UAAM,YACJ,GACA,GAAG,KAAK,kCAAkC,KAAK,GAAG;EAEtD;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB,CAAC,GAAW,SAAgB;AAChD,MAAI,CAAC,GAAG;AACN,UAAM,YAAY,MAAM,gCAAgC;EAC1D;AACF;AAEA,IAAM,gBAAgB,CACpB,OACA,GACA,UACE;AACF,MAAI,SAAS,CAAC,IAAI,KAAK,GAAG;AACxB,UAAM,YACJ,GACA,gBAAgB,KAAK,iCAAiC;EAE1D;AACF;AAEA,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,QAAQ;AAEd,IAAM,MAAM,CAAC,MAAe,CAAC,KAAK,MAAM,OAAO,MAAM,OAAO,MAAM;AAkClE,IAAM,gBAAgB,CACpB,WAC6B,WAAc,OAAO,KAAK;AACzD,IAAM,WAAW,CAAC,WAChB,WAAc,OAAO,KAAK,KAAK,WAAc,OAAO,KAAK;AAC3D,IAAM,WAAW,CAAC,WAChB,WAAc,OAAO,KAAK,KAAK,WAAc,OAAO,KAAK;AAC3D,IAAM,WAAW,CAAC,WAChB,WAAc,OAAO,KAAK;AAUtB,IAAO,aAAP,MAAiB;;;;;EAKrB;;EAEA;;EAEA;;;;;EAKA,SAAmC,CAAA;;EAEnC,SAAS;;;;;;;;;EAST,QAAQ;;EAGR,WAAQ;AACN,WACE,KAAK,SAAS,aACZ,KAAK,QAAQ;;MAEb,KAAK,OAAO,IAAI,OAAM,MAAM,CAAC,IAAI,MAAM,EAAE,KAAK,EAAE,CAAE,EAAE,KAAK,GAAG;;EAElE;EAEA,YAAY,MAAc,oBAAoB,OAAK;AACjD,SAAK,oBAAoB;AACzB,WAAO,KAAK,KAAI;AAChB,SAAK,MAAM;AACX,QAAI,SAAS;AACb,UAAM,WAAW,UAAU,MAAM,KAAK,IAAI,CAAC,MAAM,OAAO,MAAK;AAC3D,UAAI,SAAS,KAAK;AAChB,YAAI,QAAQ;AACV,gBAAM,YACJ,MACA,oCAAoC;QAExC;AACA,YAAI,MAAM,WAAW,KAAK,MAAM,IAAI;AAClC,gBAAM,YACJ,MACA,qCAAqC;QAEzC;AACA,iBAAS;MACX,WAAW,UAAU,MAAM,WAAW,GAAG;AACvC,cAAM,YAAY,MAAM,4BAA4B;MACtD;IACF,CAAC;AAGD,UAAM,QAAkB,CAAA;AACxB,QAAI,oBAAoB;AAExB,QAAI,IAAI;AACR,eAAW,KAAK,UAAU;AACxB,UAAI,MAAM;AAAI;AACd,UAAI,CAAC,mBAAmB;AACtB,4BAAoB,WAAW,CAAC;AAChC,cAAM,KAAK,CAAC;AACZ;AACA;MACF;AAGA,YAAM,IAAI,CAAC,KAAM;AACjB,0BAAoB;IACtB;AAIA,QAAI,QAAQ;AACV,YAAM,CAAC,KAAK,GAAG,GAAG,IAAI;AAEtB,UAAI,CAAC,OAAO,CAAC,KAAK;AAChB,cAAM,YAAY,MAAM,qCAAqC;MAC/D;AAEA,WAAK,kBAAkB,KAAK,GAAG;IACjC,WACE,CAAC,MAAM,UACN,MAAM,WAAW,KAAK,IAAI,MAAM,CAAC,CAAC,GACnC;AACA,WAAK,OAAO,KAAK,KAAK,kBAAiB,CAAE;IAC3C,OAAO;AACL,iBAAW,KAAK,OAAO;AACrB,aAAK,OAAO,CAAC;AACb,YAAI,KAAK;AAAQ;MACnB;IACF;AACA,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO;AAChC,aAAK,QAAQ;AACb;MACF;IACF;EACF;;EAGA,eAAe,KAAW;AACxB,UAAM,IAAI,KAAK,oBAAoB,MAAM;AACzC,UAAM,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAGI,MAAK,IAAI,KAAK,QAAQ,GAAG;AACzD,WAAO,MAAM,SACT,KAAK,kBAAiB,IACtB,CAAC,MAAM,IAAI,QAAQ,KAAK,GAAG,GAAG,GAAG,IAAIA,MAAK,CAAC;EACjD;;EAGA,eAAe,KAAW;AACxB,UAAM,SAAS,KAAK,QAAQ,GAAG;AAC/B,QAAI,cAAc,MAAM,GAAG;AACzB,aAAO,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG,MAAM,CAAC;IAC1C;AACA,UAAM,IAAI,KAAK,oBAAoB,MAAM;AACzC,QAAI,SAAS,MAAM,GAAG;AAEpB,aAAO;QACL;QACA,IAAI,QACF,KACA,OAAO,KAAK,GACZ,OAAO,KAAK,IAAI,GAChB,GACA,GACA,MAAS;;IAGf;AACA,QAAI,SAAS,MAAM,GAAG;AAEpB,aAAO;QACL;QACA,IAAI,QAAQ,KAAK,OAAO,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,MAAS;;IAE1D;AACA,SAAK,SAAS;AACd,SAAK,OAAO,SAAS;AACrB,WAAO;EACT;EAEA,eAAe,KAAW;AACxB,UAAM,SAAS,KAAK,QAAQ,GAAG;AAC/B,WACE,cAAc,MAAM,IAAI,CAAC,MAAM,IAAI,QAAQ,KAAK,GAAG,MAAM,CAAC,IACxD,SAAS,MAAM,IACf;MACE;MACA,IAAI,QACF,KACA,OAAO,KAAK,GACZ,OAAO,KAAK,IAAI,GAChB,GACA,KACA,MAAS;QAGb,SAAS,MAAM,IACf;MACE;MACA,IAAI,QAAQ,KAAK,OAAO,KAAK,IAAI,GAAG,GAAG,GAAG,KAAK,MAAS;QAE1D,KAAK,kBAAiB;EAE5B;EAEA,eAAe,KAAW;AACxB,UAAM,IAAI,KAAK,oBAAoB,MAAM;AACzC,UAAM,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAGA,MAAK,IAAI,KAAK,QAAQ,GAAG;AAC7D,QAAI,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK;AAC/C,WAAK,SAAS;AACd,WAAK,OAAO,SAAS;AACrB,aAAO;IACT;AACA,WAAO,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG,GAAG,GAAG,IAAIA,MAAK,CAAC;EACnD;EAEA,SAAS,KAAa,GAAY,GAAU;AAC1C,kBAAc,GAAG,KAAK,OAAO;AAC7B,kBAAc,GAAG,KAAK,OAAO;AAC7B,QAAI,MAAM,MAAM,MAAM,IAAI;AACxB,YAAM,YAAY,KAAK,qBAAqB;IAC9C;AACA,WAAO,CAAA;EACT;EACA,SACE,KACA,GACA,GACA,GAAU;AAEV,kBAAc,GAAG,KAAK,OAAO;AAC7B,QAAI,MAAM,MAAM,MAAM,IAAI;AACxB,YAAM,YAAY,KAAK,kBAAkB,CAAC,KAAK;IACjD;AACA,WAAO,CAAC,aAAa,GAAG,KAAK,OAAO,CAAC;EACvC;EACA,SACE,KACA,GACA,GACA,GAAU;AAEV,QAAI,MAAM,IAAI;AACZ,YAAM,YAAY,KAAK,kBAAkB,CAAC,IAAI,CAAC,KAAK;IACtD;AACA,WAAO;MACL,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,GAAG,KAAK,OAAO;;EAEhC;EACA,YACE,KACA,GACA,GACA,GAAS;AAET,WAAO;MACL,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,GAAG,KAAK,OAAO;;EAEhC;EACA,aACE,KACA,GACA,GACA,GACA,IAAU;AAGV,UAAM,QAAQ,EAAE,UAAU,GAAG,EAAE;AAC/B,UAAMA,SAAQ,EAAE,UAAU,KAAK,CAAC;AAChC,QAAI,CAAC,OAAO;AACV,YAAM,YAAY,KAAK,oCAAoC;IAC7D;AACA,QAAI,CAACA,QAAO;AACV,YAAM,YAAY,KAAK,qCAAqC;IAC9D;AACA,WAAO;MACL,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,OAAO,KAAK,OAAO;MAChC;MACAA;;EAEJ;EAEA,UACE,KACA,GACA,GACA,GACA,IAAU;AAEV;AAEE,YAAM,QAAQ,EAAE,UAAU,GAAG,EAAE;AAC/B,YAAM,KAAK,EAAE,UAAU,KAAK,CAAC;AAC7B,UAAI,CAAC,OAAO;AACV,cAAM,YACJ,KACA,yCAAyC;MAE7C;AACA,UAAI,CAAC,IAAI;AACP,cAAM,YACJ,KACA,0CAA0C;MAE9C;AACA,aAAO;QACL,aAAa,GAAG,KAAK,OAAO;QAC5B,aAAa,GAAG,KAAK,OAAO;QAC5B,aAAa,OAAO,KAAK,OAAO;QAChC;QACA;;IAEJ;EACF;EACA,eACE,KACA,GACA,GACA,GACA,IACA,IAAU;AAGV,UAAM,QAAQ,EAAE,UAAU,GAAG,EAAE;AAC/B,UAAM,KAAK,EAAE,UAAU,KAAK,GAAG,EAAE;AACjC,UAAMA,SAAQ,EAAE,UAAU,KAAK,CAAC;AAChC,QAAI,CAAC,OAAO;AACV,YAAM,YACJ,KACA,yCAAyC;IAE7C;AACA,QAAI,CAAC,IAAI;AACP,YAAM,YACJ,KACA,0CAA0C;IAE9C;AACA,QAAI,CAACA,QAAO;AACV,YAAM,YAAY,KAAK,qCAAqC;IAC9D;AACA,WAAO;MACL,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,GAAG,KAAK,OAAO;MAC5B,aAAa,OAAO,KAAK,OAAO;MAChC;MACAA;;EAEJ;;;;EAKA,QAAQ,KAAW;AACjB,QAAI,CAAC,GAAG,GAAG,CAAC,IAAI,UAAU,KAAK,KAAK,CAAC;AACrC,QAAI,QAAQ;AACZ,WAAO,KAAK,QAAQ,IAAI,EAAE,OAAO,KAAK,CAAC;AAAG;AAC1C,QAAI,MAAM,UAAa,UAAU;AAAG,UAAI,EAAE,UAAU,KAAK;AAEzD,QAAI,CAAC,KAAK,IAAI,CAAC;AAAG,aAAO,KAAK,SAAS,KAAK,GAAG,CAAC;AAChD,QAAI,CAAC,KAAK,IAAI,CAAC;AAAG,aAAO,KAAK,SAAS,KAAK,GAAG,GAAG,CAAC;AACnD,QAAI,CAAC,KAAK,IAAI,CAAC;AAAG,aAAO,KAAK,SAAS,KAAK,GAAG,GAAG,CAAC;AAEnD,UAAM,KAAK,EAAE,QAAQ,GAAG;AACxB,UAAM,KAAK,EAAE,QAAQ,GAAG;AACxB,QAAI,OAAO,MAAM,OAAO;AAAI,aAAO,KAAK,YAAY,KAAK,GAAG,GAAG,CAAC;AAChE,QAAI,OAAO;AAAI,aAAO,KAAK,UAAU,KAAK,GAAG,GAAG,GAAG,EAAE;AACrD,QAAI,OAAO;AAAI,aAAO,KAAK,aAAa,KAAK,GAAG,GAAG,GAAG,EAAE;AACxD,WAAO,KAAK,eAAe,KAAK,GAAG,GAAG,GAAG,IAAI,EAAE;EACjD;EAEA,kBAAkB,KAAa,KAAW;AACxC,UAAM,OAAO,KAAK,eAAe,GAAG;AACpC,UAAM,OAAO,KAAK,eAAe,GAAG;AACpC,UAAM,SAAS,MAAM,IAAI;AACzB,UAAM,SAAS,MAAM,IAAI;AACzB,QAAI,UAAU;AAAQ,WAAK,OAAO,KAAK,KAAK,kBAAiB,CAAE;aACtD;AAAQ,WAAK,OAAO,KAAK,IAAI;aAC7B;AAAQ,WAAK,OAAO,KAAK,IAAI;;AACjC,WAAK,OAAO,KAAK,MAAM,IAAI;EAClC;EAEA,OAAO,MAAY;AACjB,UAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,UAAM,SAAS,KAAK,UAAU,GAAG,CAAC;AAClC,UAAM,KAAK,KAAK,UAAU,CAAC;AAC3B,UAAM,KAAK,KAAK,UAAU,CAAC;AAC3B,YAAQ,QAAQ;MACd,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,YAAY,EAAE;MAC5B,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,OAAO,KAAK,KAAK,eAAe,EAAE,CAAC;MACjD,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,OAAO,KAAK,KAAK,eAAe,EAAE,CAAC;IACnD;AACA,YAAQ,OAAO;MACb,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,YAAY,EAAE;MAC5B,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,YAAY,EAAE;MAC5B,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,OAAO,KAAK,KAAK,eAAe,EAAE,CAAC;MACjD,KAAK;AACH,sBAAc,IAAI,IAAI;AACtB,eAAO,KAAK,OAAO,KAAK,KAAK,eAAe,EAAE,CAAC;IACnD;AACA,WAAO,KAAK,SAAS,IAAI;EAC3B;EAEA,YAAY,MAAY;AACtB,UAAM,SAAS,KAAK,QAAQ,IAAI;AAChC,QAAI,SAAS,MAAM,GAAG;AACpB,WAAK,OAAO,KAAK,KAAK,kBAAiB,CAAE;AACzC;IACF;AACA,UAAM,IAAI,KAAK,oBAAoB,MAAM;AACzC,QAAI,SAAS,MAAM,GAAG;AACpB,YAAM,CAACC,EAAC,IAAI;AACZ,WAAK,OAAO,KACV,CAAC,MAAM,IAAI,QAAQ,MAAMA,IAAG,GAAG,GAAG,GAAG,MAAS,CAAC,GAC/C,CAAC,KAAK,IAAI,QAAQ,MAAMA,KAAI,GAAG,GAAG,GAAG,KAAK,MAAS,CAAC,CAAC;AAEvD;IACF;AACA,QAAI,SAAS,MAAM,GAAG;AACpB,YAAM,CAACA,IAAGC,EAAC,IAAI;AACf,YAAMC,KAAI,KAAK,oBAAoB,MAAM;AACzC,WAAK,OAAO,KACV,CAAC,MAAM,IAAI,QAAQ,MAAMF,IAAGC,IAAG,GAAGC,IAAG,MAAS,CAAC,GAC/C,CAAC,KAAK,IAAI,QAAQ,MAAMF,IAAGC,KAAI,GAAG,GAAG,KAAK,MAAS,CAAC,CAAC;AAEvD;IACF;AACA,UAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAGF,MAAK,IAAI;AACjC,SAAK,OAAO,KACV,CAAC,MAAM,IAAI,QAAQ,MAAM,GAAG,GAAG,GAAG,IAAIA,MAAK,CAAC,GAC5C,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,IAAI,GAAG,GAAG,KAAKA,MAAK,CAAC,CAAC;EAErD;EAEA,YAAY,MAAY;AACtB,UAAM,MAAM,KAAK,eAAe,IAAI;AACpC,QAAI,MAAM,GAAG,GAAG;AACd,WAAK,OAAO,KAAK,GAAG;AACpB;IACF;AACA,UAAM,OAAO,IAAI,CAAC;AAClB,QAAI,KAAK,UAAU,GAAG;AACpB,WAAK,OAAO,KAAK,KAAK;QACpB;QACA,IAAI,QAAQ,MAAM,KAAK,QAAQ,GAAG,GAAG,GAAG,KAAK,MAAS;OACvD;IACH,WAAW,KAAK,UAAU,GAAG;AAC3B,WAAK,OAAO,KAAK,KAAK;QACpB;QACA,IAAI,QACF,MACA,KAAK,OACL,KAAK,QAAQ,GACb,GACA,KACA,MAAS;OAEZ;IACH,WAAW,CAAC,KAAK,YAAY,QAAQ;AACnC,WAAK,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC;IAC7B,OAAO;AACL,WAAK,OAAO,KAAK,KAAK;QACpB;QACA,IAAI,QACF,MACA,KAAK,OACL,KAAK,OACL,KAAK,QAAQ,GACb,KACA,MAAS;OAEZ;IACH;EACF;EAEA,SAAS,MAAY;AACnB,UAAM,SAAS,KAAK,QAAQ,IAAI;AAChC,UAAM,IAAI,KAAK,oBAAoB,MAAM;AACzC,QAAI,cAAc,MAAM,GAAG;AACzB,WAAK,OAAO,KAAK,CAAC,IAAI,IAAI,QAAQ,MAAM,GAAG,MAAM,CAAC,CAAC;IACrD,WAAW,SAAS,MAAM,GAAG;AAC3B,WAAK,OAAO,KAAK,KAAK,kBAAiB,CAAE;IAC3C,WAAW,SAAS,MAAM,GAAG;AAC3B,WAAK,OAAO,KAAK;QACf;QACA,IAAI,QAAQ,MAAM,OAAO,KAAK,GAAG,GAAG,GAAG,GAAG,MAAS;OACpD;AACD,WAAK,OAAO,KAAK;QACf;QACA,IAAI,QAAQ,MAAM,OAAO,KAAK,IAAI,GAAG,GAAG,GAAG,KAAK,MAAS;OAC1D;IACH,WAAW,SAAS,MAAM,GAAG;AAC3B,WAAK,OAAO,KACV;QACE;QACA,IAAI,QACF,MACA,OAAO,KAAK,GACZ,OAAO,KAAK,GACZ,GACA,GACA,MAAS;SAGb;QACE;QACA,IAAI,QACF,MACA,OAAO,KAAK,GACZ,OAAO,KAAK,IAAI,GAChB,GACA,KACA,MAAS;OAEZ;IAEL;EACF;;EAGA,KAAK,GAAU;AACb,QAAI,KAAK;AAAQ,aAAO;AACxB,UAAM,KAAK,KAAK;AAChB,UAAM,QAAQ,CAAC,CAAC,EAAE,YAAY;AAC9B,QAAI,OAAO,MAAM,CAAC;AAClB,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,MAAM,CAAC,GAAG;AACZ;MACF;AACA,YAAM,CAAC,IAAI,EAAE,IAAI;AACjB,eAAS,CAAC,CAAC,GAAG,YAAY,UAAU,EAAE,YAAY,EAAE;AACpD,cAAQ,IAAI;QACV,KAAK;AACH,cAAI,CAAC,EAAE,OAAO,EAAE;AAAG,mBAAO;AAC1B;QACF,KAAK;AACH,cAAI,CAAC,EAAE,YAAY,EAAE;AAAG,mBAAO;AAC/B;QACF,KAAK;AACH,cAAI,CAAC,EAAE,iBAAiB,EAAE;AAAG,mBAAO;AACpC;QACF,KAAK;AACH,cAAI,CAAC,EAAE,SAAS,EAAE;AAAG,mBAAO;AAC5B;QACF,KAAK;AACH,cAAI,CAAC,EAAE,cAAc,EAAE;AAAG,mBAAO;AACjC;MACJ;IACF;AAGA,WAAO;EACT;EAEA,oBAAiB;AACf,WAAO,KAAK,oBAAoB,kBAAkB;EACpD;;AAGF,IAAM,QAAQ,CAAC,MACb,MAAM,iBAAiB,MAAM;AAC/B,IAAM,gBAAgB;EACpB,OAAO;EACP,UAAU,MAAM;EAChB,mBAAmB;EACnB,MAAM,CAAC,MAAe,CAAC,EAAE,YAAY;;AAEvC,IAAM,kBAAkB;EACtB,OAAO;EACP,UAAU,MAAM;EAChB,mBAAmB;EACnB,MAAM,CAAC,MAAe;;AAExB,IAAM,iBAAiB;EACrB,QAAQ;EACR,UAAU,MAAM;EAChB,mBAAmB;EACnB,MAAM,CAAC,MAAe;;;;ACxqBlB,IAAO,QAAP,MAAY;;EAEhB;;EAGA;;EAGA;;;;;;;EASA,MAAoB,CAAA;;EAGpB;;EAGA;EAEA,YAAY,OAAe,oBAAoB,OAAK;AAClD,SAAK,MAAM;AACX,SAAK,oBAAoB;AACzB,SAAK,QAAQ;AACb,QAAI,UAAU;AACd,SAAK,WAAW;AAChB,cAAU,OAAO,MAAM,IAAI,UAAO;AAChC,UAAI,KAAK;AAAO;AAChB,YAAM,MAAM,IAAI,WAAW,MAAM,KAAK,iBAAiB;AACvD,UAAI,IAAI,OAAO;AACb,aAAK,MAAM,CAAC,GAAG;AACf,aAAK,QAAQ;AACb;MACF;AACA,WAAK,IAAI,KAAK,GAAG;AACjB,UAAI,CAAC;AAAS,aAAK,WAAW;eAE5B,MAAM,QAAQ,IAAI,MAAM,KACxB,IAAI,OAAO,WAAW,KACtB,MAAM,QAAQ,IAAI,OAAO,CAAC,CAAC,KAC3B,IAAI,OAAO,CAAC,EAAE,CAAC,MAAM,IACrB;AACA,aAAK,WAAW;MAClB;AACA,gBAAU;IACZ,CAAC;EACH;;;;EAKA,KAAK,GAAU;AACb,WAAO,KAAK,IAAI,KAAK,OAAK,EAAE,KAAK,CAAC,CAAC;EACrC;;EAGA,WAAQ;AACN,QAAI,KAAK;AAAW,aAAO,KAAK;AAChC,QAAI,KAAK,UAAU;AACjB,WAAK,YAAY,OAAO,KAAK,IAAI,CAAC,CAAC;AACnC,aAAO,KAAK;IACd;AACA,SAAK,YAAY,KAAK,IAAI,IAAI,OAAK,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM;AACzD,WAAO,KAAK;EACd;;;;ACtEK,IAAM,QAAQ,CAACI,aAA6B;AACjD,MAAIA,oBAAmB;AAAS,WAAOA;AACvC,MAAI;AACF,WAAO,QAAQ,MAAM,OAAOA,QAAO,CAAC;EACtC,QAAQ;AACN,WAAO;EACT;AACF;AAGO,IAAM,aAAa,CACxB,OACA,oBAAoB,UAClB;AACF,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,MAAM,sBAAsB;AAAmB,aAAO;AAC1D,YAAQ,MAAM;EAChB;AACA,MAAI;AACF,WAAO,IAAI,MAAM,OAAO,iBAAiB;EAC3C,QAAQ;AACN,WAAO;EACT;AACF;;;ACjBO,IAAM,iBAAiB,OAAO,IAAI,4BAA4B;AAE9D,IAAM,kBAAkB;AAExB,IAAM,oBAAoB;EAC/B,KAAK;;AAGA,IAAM,kBAAkB;EAC7B,QAAQ;EACR,WAAW;EACX,QAAQ;EACR,MAAM;;AAGD,IAAM,yBAAyB;EACpC,QAAQ;EACR,WAAW;EACX,MAAM;EACN,QACE;;AAWG,IAAM,kBAAkB;EAC7B,QAAQ;EACR,WAAW;EACX,MAAM;EACN,QAAQ;;AAGH,IAAM,yBAAyB,CAAA;AAE/B,IAAM,aAAa,CACxB,aACuB;EACvB,GAAG;EACH,UAAU,SAAS,YAAY;EAC/B,oBAAoB,UAAU,kBAAkB,KAAK,CAAA;EACrD,aACE,UAAU,WAAW,IACnB;IACE,GAAG;IACH,GAAG,QAAQ,WAAW;MAExB;EACJ,YACE,SAAS,aACP;IACE,GAAG;IACH,GAAG,QAAQ;MAEb;EACJ,qBACE,UAAU,mBAAmB,IAC3B;IACE,GAAG;IACH,GAAG,QAAQ,mBAAmB;MAEhC;;AASN,IAAM,2BAA2B,CAC/B,MACA,YAEA,KAAK,WAAW,GAAG,KACnB,KAAK,WAAW,IAAI,KACpB,KAAK,WAAW,KAAK,KACrB,KAAK,WAAW,OAAO,KACvB,KAAK,WAAW,OAAO,KACvB,KAAK,WAAW,QAAQ,KACxB,KAAK,WAAW,YAAY,KAC5B,KAAK,WAAW,MAAM,KACtB,KAAK,WAAW,QAAQ,KACxB,KAAK,WAAW,YAAY,KAC5B,KAAK,WAAW,aAAa,KAC7B,KAAK,WAAW,cAAc,KAC9B,KAAK,WAAW,aAAa,KAC7B,KAAK,WAAW,gBAAgB,KAChC,KAAK,WAAW,WAAW;;AAG3B;EACE,GAAG,OAAO,KAAK,QAAQ,WAAW,CAAC;EACnC,GAAG,OAAO,KAAK,QAAQ,UAAU;EACjC,KAAK,SAAO,KAAK,WAAW,GAAG,GAAG,GAAG,CAAC;AAO1C,IAAM,cAAc,CAAC,MAAc,aACjC,KAAK,QAAQ,KAAK,WAAW,IAAI,CAAC;AAKpC,IAAM,oBAAoB,CAAC,SACzB,KAAK,QAAQ,GAAG,IAAI;AAKtB,IAAM,qBAAqB,CAAC,SAC1B,KAAK,SAAS,GAAG;AAgBb,IAAO,OAAP,MAAW;EAcf,OAAO,MACL,MACA,eACA,SAAqB;AAErB,WAAO,OAAO,SAAS,WAAW,OAC9B,IAAI,KAAK,MAAM,eAAe,OAAO;EAE3C;EAEA,OAAO,UAAU,gBAAwB,MAAkB;AACzD,UAAM,UAAU,WAAW,QAAQ,CAAA,CAAE;AAErC,QAAI,yBAAyB,gBAAgB,OAAO,GAAG;AACrD,YAAM,SAAS,KAAK,MAAM,aAAa,gBAAgB,OAAO;AAE9D,UAAI,OAAO,SAAS;AAClB,eAAO,OAAO,OAAO,QAAQ;AAC7B,eAAO,OAAO,GAAG,OAAO,IAAI,IAAI,OAAO,QAAQ;MACjD;AACA,aAAO;IACT,OAAO;AACL,YAAM,WAAW,eAAe,WAAW,GAAG;AAC9C,YAAM,KAAK,YAAY,gBAAgB,QAAQ;AAC/C,UAAI,KAAK,IAAI;AACX,eAAO,KAAK,MACV,eAAe,UAAU,GAAG,EAAE,GAC9B,eAAe,UAAU,KAAK,CAAC,GAC/B,OAAO;MAEX,WACE,kBAAkB,cAAc,KAC/B,CAAC,YAAY,mBAAmB,cAAc,GAC/C;AACA,eAAO,KAAK,MAAM,aAAa,gBAAgB,OAAO;MACxD,OAAO;AAEL,eAAO,KAAK,MAAM,GAAG,cAAc,KAAK,OAAO;MACjD;IACF;EACF;EAEA,OAAO;EAEP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;EAOA,IAAI,QAAK;AACP,QAAI,KAAK;AAAQ,aAAO,KAAK;AAC7B,WAAQ,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ,QAAQ;EAC5D;;;;;;;EAQA,WAAQ;AACN,QAAI,KAAK,cAAc;AAAW,aAAO,KAAK;AAC9C,QAAI,MAAY;AAEhB,WAAO,IAAI,SAAS;AAAS,YAAM,IAAI;AACvC,QAAI,IAAI,WAAW,IAAI,QAAQ,SAAS;AACtC,YAAM,IAAI;AACZ,WAAQ,KAAK,YAAY,KAAK,OAAO,MAAM,IAAI;EACjD;EAWA,YACE,MACA,eACA,UAAuB,CAAA,GAAE;AAEzB,QAAI,iBAAiB,OAAO,kBAAkB,UAAU;AACtD,gBAAU;AACV,sBAAgB;IAClB;AACA,SAAK,UAAU,WAAW,OAAO;AAEjC,QAAI,OAAO,kBAAkB,UAAU;AACrC,WAAK,OAAO;AACZ,WAAK,YAAY,IAAI;AACrB,WAAK,WAAW;AAChB,WAAK,OAAO,GAAG,KAAK,IAAI,IAAI,aAAa;IAC3C,OAAO;AACL,WAAK,OAAO;AACZ,YAAM,WAAW,KAAK,WAAW,GAAG;AACpC,UAAI,KAAK,YAAY,MAAM,QAAQ;AACnC,UAAI,OAAO,IAAI;AAGb,aAAK,KAAK;AACV,gBAAQ;MACV;AACA,WAAK,OAAO,KAAK,UAAU,GAAG,EAAE;AAChC,UAAI;AAAU,aAAK,YAAY,KAAK,IAAI;AACxC,WAAK,WAAW,KAAK,UAAU,KAAK,CAAC;IACvC;AAKA,QAAI,KAAK,SAAS,WAAW,UAAU,GAAG;AACxC,iBAAW,CAAC,MAAM,MAAM,KAAK,OAAO,QAAQ,eAAe,GAAG;AAC5D,YAAI,KAAK,SAAS,WAAW,MAAM,GAAG;AACpC,gBAAM,SAAS,IAAI,IAAI,KAAK,QAAQ;AACpC,gBAAM,CAAC,MAAMC,QAAO,IAAI,OAAO,SAC5B,QAAQ,UAAU,EAAE,EACpB,QAAQ,QAAQ,GAAG,EACnB,KAAI,EACJ,MAAM,GAAG;AACZ,cAAI,QAAQA,UAAS;AACnB,iBAAK,WAAW,GAAG,IAAI,IAAI,IAAI,IAAIA,QAAO,GAAG,OAAO,IAAI;AACxD,iBAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;AACzC;UACF;QACF;MACF;IACF;AAEA,QAAI,KAAK,SAAS,WAAW,YAAY,GAAG;AAC1C,WAAK,OAAO;AACZ,YAAM,KAAK,KAAK,SAAS,UAAU,aAAa,MAAM,EAAE,KAAI;AAC5D,YAAM,IAAI,GAAG,YAAY,GAAG;AAC5B,UAAI,MAAM,IAAI;AACZ,aAAK,YAAY,KAAK;MACxB,OAAO;AACL,cAAM,SAAS,GAAG,UAAU,GAAG,CAAC;AAChC,YACE,CAAC,UACD,WAAW,OACX,WAAW,OACX,WAAW,QACV,OAAO,WAAW,GAAG,IACpB,OAAO,MAAM,GAAG,EAAE,WAAW,KAC7B,OAAO,UAAU,CAAC,EAAE,SAAS,GAAG,IAChC,OAAO,SAAS,GAAG,IACrB;AACA,gBAAM,KAAK,OACT,wDACA,EAAE,OAAO,OAAM,CAAE;QAErB;AACA,aAAK,YAAY;MACnB;AAEA,YAAM,MAAM,MAAM,KAAK,KAAK,GAAG,UAAU,IAAI,CAAC,KAAK;AACnD,YAAMC,SAAQ,QAAQ,MAAM,SAAY,WAAW,GAAG;AACtD,UAAI,QAAQ,OAAO,QAAQ,OAAO,QAAQ,OAAO,CAACA,QAAO;AACvD,cAAM,KAAK,OACT,sEACA;UACE,OAAO;UACP,QAAQ;SACT;MAEL;AACA,WAAK,gBAAgB;AACrB,UAAIA,QAAO;AACT,aAAK,SAAS;AACd,aAAK,QAAQA;MACf;AACA;IACF;AAEA,QACE,KAAK,SAAS,WAAW,QAAQ,KACjC,KAAK,SAAS,WAAW,YAAY,KACrC,KAAK,SAAS,WAAW,aAAa,KACtC,KAAK,SAAS,WAAW,cAAc,KACvC,KAAK,SAAS,WAAW,aAAa;IAEtC,KAAK,SAAS,WAAW,gBAAgB,GACzC;AACA,UAAI,KAAK,SAAS,WAAW,MAAM,GAAG;AACpC,aAAK,WAAW,aAAa,KAAK,QAAQ;AAC1C,aAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;MAC3C;AACA,WAAK,OAAO;AAGZ,iBAAW,CAAC,MAAM,IAAI,KAAK,OAAO,QAChC,KAAK,QAAQ,WAAW,CAAC,GACxB;AACD,cAAM,IAAI,KAAK,QAAQ,GAAG;AAC1B,YAAI,IAAI,KAAK,KAAK,SAAS,WAAW,KAAK,UAAU,GAAG,CAAC,CAAC,GAAG;AAC3D,gBAAM,IAAI,KAAK,SACZ,UAAU,CAAC,EACX,QAAQ,gBAAgB,IAAI;AAC/B,eAAK,WAAW,GAAG,IAAI,IAAI,CAAC;AAC5B,eAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;AACzC,eAAK,gBAAgB,MAAM,IAAI;AAC/B,eAAK,OAAO;AACZ;QACF;MACF;AACA,WAAK,kBAAkB,KAAK,QAAQ;AACpC;IACF;AAGA,UAAM,SAAS,OAAO,QAAQ,KAAK,QAAQ,WAAW,CAAC;AACvD,eAAW,CAAC,MAAM,QAAQ,KAAK,QAAQ;AACrC,UAAI,KAAK,gBAAgB,MAAM,QAAQ,GAAG;AACxC,aAAK,OAAO;AACZ;MACF;IACF;AAEA,QAAI,KAAK,SAAS,WAAW,WAAW,GAAG;AACzC,YAAM,MAAM,KAAK,SAAS,UAAU,YAAY,MAAM;AACtD,YAAM,IAAI,IAAI,QAAQ,GAAG;AACzB,UAAI,MAAM,IAAI;AACZ,cAAM,KAAK,OAAO,qCAAqC;MACzD;AACA,WAAK,OAAO;AACZ,UAAI,MAAM,IAAI,UAAU,GAAG,CAAC;AAC5B,UAAI,CAAC,IAAI,SAAS,GAAG;AAAG,eAAO;AAC/B,YAAM,UAAU,IAAI,UAAU,IAAI,CAAC;AACnC,eAAS,CAAC,MAAM,CAAC,KAAK,OAAO,QAAQ,KAAK,QAAQ,UAAU,GAAG;AAC7D,YAAI,CAAC,EAAE,SAAS,GAAG,GAAG;AACpB,eAAK;AACL,eAAK,QAAQ,WAAW,IAAI,IAAI;QAClC;AACA,YAAI,MAAM;AAAK,eAAK,gBAAgB;MACtC;AACA,WAAK,mBAAmB,SAAS,GAAG;AACpC,WAAK,sBAAqB;AAC1B;IACF;AAEA,UAAM,OAAO,OAAO,QAAQ,KAAK,QAAQ,UAAU;AACnD,eAAW,CAAC,MAAM,GAAG,KAAK,MAAM;AAC9B,YAAM,IAAI,GAAG,IAAI;AACjB,UAAI,KAAK,SAAS,WAAW,CAAC,GAAG;AAC/B,aAAK,OAAO;AACZ,aAAK,gBAAgB;AACrB,aAAK,mBACH,KAAK,SAAS,UAAU,EAAE,MAAM,GAChC,GAAG,EACH,kBAAkB;AACpB,aAAK,sBAAqB;AAC1B;MACF;IACF;AAEA,QACE,KAAK,SAAS,WAAW,UAAU,KACnC,KAAK,SAAS,WAAW,SAAS,GAClC;AACA,WAAK,YAAY,KAAK;AACtB,WAAK,OAAO;AACZ;IACF;AAGA,QAAI,KAAK,SAAS,WAAW,OAAO,GAAG;AACrC,WAAK,OAAO;AACZ,YAAM,CAACC,OAAM,GAAG,IAAI,iBAClB,KAAK,YAAY,kBAAkB,EACnC,KAAK,UAAU,IAAI;AACrB,WAAK,OAAOA;AACZ,WAAK,WAAW,IAAI,QAAQ,QAAQ,EAAE;AACtC,WAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;AACzC;IACF;AAKA,QACE,CAAC,KAAK,SAAS,WAAW,IAAI,KAC9B,CAAC,KAAK,SAAS,WAAW,KAAK,KAC/B,KAAK,QAAQ,WAAW,EAAE,QAC1B;AACA,YAAM,OAAO,KAAK,SAAS,QAAQ,GAAG;AACtC,YAAM,KACJ,SAAS,KAAK,KAAK,WAAW,KAAK,SAAS,UAAU,GAAG,IAAI;AAC/D,UAAI,GAAG,MAAM,GAAG,EAAE,WAAW,GAAG;AAC9B,aAAK,WAAW,UAAU,KAAK,QAAQ;AACvC,aAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;AACzC,aAAK,gBACH,UACA,KAAK,QAAQ,WAAW,EAAE,MAAM;AAElC,aAAK,OAAO;AACZ;MACF;IACF;AAIA,QACE,KAAK,SAAS,SAAS,GAAG,KAC1B,KAAK,aAAa,OAClB,KAAK,aAAa,MAClB;AACA,WAAK,OAAO;AACZ,YAAM,CAAC,MAAM,GAAG,IAAI,iBAClB,KAAK,YAAY,kBAAkB,EACnC,QAAQ,KAAK,QAAQ,IAAI,IAAI;AAC/B,WAAK,WAAW;AAChB,WAAK,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,QAAQ;AACzC,WAAK,OAAO;AACZ;IACF;AAGA,SAAK,OAAO;AACZ,UAAM,QAAQ,WAAW,KAAK,QAAQ;AACtC,QAAI,OAAO;AACT,WAAK,SAAS,KAAK,SAAS,KAAI;AAChC,WAAK,QAAQ;IACf,OAAO;AACL,WAAK,UAAU,KAAK;IACtB;AACA,SAAK,eAAe,KAAK;AACzB,UAAM,EAAE,oBAAoB,WAAW,SAAQ,IAAK,KAAK;AACzD,UAAM,WAAW,KAAK,SAAS,UAAU,KAAK,KAAK;AACnD,SAAK,WAAW,YAAY;AAC5B,SAAK,sBAAqB;EAC5B;EAEA,YAAY,MAAY;AACtB,QAAI,CAAC,KAAK,WAAW,GAAG;AAAG;AAC3B,UAAM,IAAI,KAAK,QAAQ,GAAG;AAC1B,QAAI,IAAI,KAAK,IAAI,KAAK,SAAS,GAAG;AAChC,YAAMC,SAAQ,KAAK,UAAU,GAAG,CAAC;AACjC,WAAK,WAAW,KAAK,gBACnB,KAAK,QAAQ,kBAAkB,EAAEA,MAAK;AACxC,WAAK,QAAQA;IACf;EACF;EAEA,gBAAgB,MAAc,UAAgB;AAC5C,QAAI,KAAK,SAAS,WAAW,GAAG,IAAI,GAAG,GAAG;AACxC,YAAM,IAAI,KAAK,SAAS,QAAQ,GAAG;AACnC,YAAM,OACJ,MAAM,KAAK,KAAK,WAAW,KAAK,SAAS,UAAU,GAAG,CAAC;AACzD,YAAM,OAAO,MAAM,KAAK,KAAK,KAAK,SAAS,UAAU,CAAC;AACtD,YAAM,WAAW,KAAK,UAAU,KAAK,SAAS,CAAC;AAC/C,UAAI,CAAC,UAAU;AACb,cAAM,MAAM,oCAAoC;UAC9C,MAAM;SACP;MACH;AACA,YAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAI,EAAE,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,KAAK,MAAM,CAAC,CAAC;MACxC;AACA,WAAK;AACL,WAAK,eAAe;AACpB,WAAK,mBAAmB;AACxB,WAAK,kBAAkB,CAAC;AACxB,UAAI,KAAK,iBAAiB,CAAC,KAAK,mBAAmB,MAAM;AACvD,cAAM,cAAc,KAAK,QAAQ,mBAAmB,EAAE,IAAI;AAC1D,YAAI,aAAa;AACf,eAAK,OAAO;AACZ,cAAIC,KAAI;AACR,UAAAA,KAAIA,GAAE,MAAM,aAAa,EAAE,KAAK,KAAK,aAAa;AAClD,mBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAAA,KAAIA,GAAE,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,KAAK,MAAM,CAAC,CAAC;UACxC;AACA,eAAK,YAAYA;QACnB;MACF;AACA,aAAO;IACT;AACA,WAAO;EACT;;EAGA,CAAC,cAAc,IAAC;AACd,WAAO,qBAAqB,OAAO,IAAI,CAAC;EAC1C;;EAGA,wBAAqB;AAEnB,UAAM,EAAE,MAAM,UAAU,MAAK,IAAK,KAAK;AACvC,QAAI,CAAC,YAAY,CAAC,OAAO;AAAU;AACnC,UAAM,aAAa;AACnB,SAAK,8BAA8B,OACjC,IAAI,IACF,IAAI,IAAI,MAAM,KAAK,QAAQ,YAAY,EAAE,CAAC,IAAI,KAAK,QACnD,QAAQ,CACT;EAEL;EAEA,mBAAmB,GAAW,KAAW;AAEvC,SAAK,WAAW;AAChB,SAAK,UAAU,KAAK,YAAY,MAAM,GAAG;MACvC,GAAG,KAAK;MACR,UAAU;KACX;AACD,WAAO,KAAK;EACd;EAEA,OAAO,SAAiB,QAA0B,CAAA,GAAE;AAClD,WAAO,MAAM,SAAS,EAAE,MAAM,KAAK,MAAM,GAAG,MAAK,GAAI,KAAK,MAAM;EAClE;EAEA,kBAAkB,GAAS;AACzB,UAAM,IAAI,EAAE,QAAQ,GAAG;AACvB,QAAI,MAAM,IAAI;AACZ,WAAK,YAAY;AACjB;IACF;AACA,SAAK,YAAY,EAAE,UAAU,GAAG,CAAC;AACjC,SAAK,cAAc,EAAE,UAAU,IAAI,CAAC;AACpC,UAAM,CAAC,gBAAgB,YAAY,KAAK,IACtC,KAAK,YAAY,iBAAiB,KAAK,aAAa,IAAI;AAC1D,SAAK,QAAQ;AACb,SAAK,gBAAgB;AACrB,SAAK,oBAAoB;EAC3B;;;;;EAMA,OAAO,iBACL,UACA,MAAW;AAEX,QAAI,CAAC;AAAU,aAAO,CAAC,CAAA,CAAE;AACzB,UAAM,QAAQ,SAAS,MAAM,IAAI;AACjC,UAAM,QAAQ,MAAM,CAAC;AACrB,QAAI,aAAiC;AACrC,QAAI,QAA2B;AAC/B,UAAM,SAA4B,CAAA;AAGlC,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,UAAU,cAAc;QAC5B,OAAO;QACP,QAAQ;OACT;IACH;AAEA,QAAI,CAAC,MAAM,SAAS,GAAG,GAAG;AACxB,mBAAa;AACb,YAAM,MAAK;IACb;AACA,eAAW,MAAM,OAAO;AACtB,YAAM,IAAI,GAAG,QAAQ,GAAG;AAExB,UAAI,MAAM;AAAI;AACd,YAAM,IAAI,GAAG,UAAU,GAAG,CAAC;AAC3B,YAAM,IAAI,GAAG,UAAU,IAAI,CAAC;AAC5B,UAAI,MAAM,UAAU;AAClB,YAAI,YAAY;AACd,gBAAM,MACJ,sDACA,EAAE,KAAI,CAAE;QAEZ;AACA,gBAAQ,WAAW,CAAC;AACpB,YAAI,CAAC,OAAO;AACV,gBAAM,MAAM,iCAAiC,CAAC,IAAI,EAAE,KAAI,CAAE;QAC5D;MACF;AACA,UAAI,MAAM,YAAY,MAAM,QAAQ;AAClC,YAAI,MAAM,QAAQ;AAChB;;YACuB,KAAK,oBAAoB,WAC5C,CAAC,KAEH,yBAAyB,KAAK,CAAC;YAC/B;AACA,kBAAM,MAAM,gCAAgC,EAAE,KAAI,CAAE;UACtD;AAGA,iBAAO,QACL,KAAK,qBACH,KAAK,mBAAmB,KAAK,KAAK,CAAC,EAAE,UAAU,CAAC,IAChD,GAAG,QAAQ,OAAO,GAAG;QAE3B,OAAO;AACL,iBAAO,CAAC,IAAI;QACd;MACF;IACF;AACA,WAAO,CAAC,QAAQ,YAAY,KAAK;EACnC;;AAWK,IAAM,mBACX,CAAC,SACD,CAAC,UAAkB,SAA2C;AAC5D,QAAM,UAAU,SAAS,UACvB,QAAQ,QACR,UAAU,MAAM;AAElB,QAAM,OAAO,QAAQ,YAAY,OAAO,UAAU,EAAE;AACpD,QAAM,OAAO,SAAS,UAAU,KAAK,MAAM;AAG3C,QAAM,CAAC,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,KAAK,MAAM,IAAI,CAAC;AAE5D,MAAI,CAAC,GAAG;AAGN,WAAO,CAAC,KAAK,QAAQ;EACvB;AAEA,MACG,MAAM,OAAO,MAAM,OAAO,MAAM,OAChC,MAAM,OAAO,MAAM,KACpB;AACA,UAAM,MACJ,sDACA,EAAE,KAAI,CAAE;EAEZ;AAEA,MAAI,MAAM,KAAK;AAGb;;MAA6B,OACzB;QACE,KAAK,QAAQ,KAAK,QAAO,GAAI,KAAK,UAAU,CAAC,CAAC;QAC9C,QAAQ,IAAI;UAEd,CAAC,MAAM,QAAQ,IAAI,EAAE;;EAC3B;AAEA,MAAI,MAAM,OAAO,MAAM,KAAK;AAI1B,WAAO,OACH;MACE,KAAK,QAAQ,KAAK,QAAO,GAAI,KAAK,UAAU,CAAC,CAAC;MAC9C,QAAQ,KAAK,UAAU,CAAC,CAAC;;;MAG3B,CAAC,KAAK,UAAU,CAAC,GAAG,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE;;EACrD;AAEA,MACE,MAAM,OACN,MAAM,QACL,MAAM,OAAQ,MAAM,OAAO,MAAM,MAClC;AAKA,WAAO,CAAC,KAAK,UAAU,CAAC,GAAG,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE;EACxD;AAEA,MAAI,MAAM,QAAQ,MAAM,OAAQ,MAAM,OAAO,MAAM,MAAO;AAIxD,WAAO,CAAC,MAAM,QAAQ,IAAI,EAAE;EAC9B;AAEA,MAAI,YAAY,MAAM;AAKpB,QAAI;AACF,YAAM,SAAS,IAAI,IAAI,QAAQ;AAC/B,UAAI,OAAO,MAAM;AACf,YAAI,OAAO,SAAS,aAAa;AAC/B,gBAAM,MACJ,gEACA;YACE;YACA,OAAO,OAAO;YACd,cAAc,CAAC,IAAI,WAAW;WAC/B;QAEL;MACF;AAKA,aAAO;QACL,OAAO,SAAS,QAAQ,oBAAoB,IAAI;QAChD,UAAU,OAAO,QAAQ;;IAE7B,SAAS,IAAI;AAEX,YAAM,MAAM,6BAA6B;QACvC;QACA,OAAO;OACR;IACH;EACF;AAKA,MAAI,MAAM,QAAQ,WAAW,IAAI,GAAG;AAGlC,WAAO,CAAC,MAAM,UAAU,IAAI,EAAE;EAChC;AAIA,SAAO,CAAC,KAAK,IAAI,IAAI,UAAU,IAAI,EAAE;AACvC;;;ANrxBI,IAAOC,QAAP,cAAoB,KAAW;EACnC,CAAC,cAAc,EACb,QACA,SAAwB;AAExB,UAAM,MAAM,QACV,OAAO,YACL,OAAO,QAAQ,IAAI,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,MAAK;AACrC,aAAO,MAAM,aAAa,MAAM;IAClC,CAAC,CAAC,GAEJ,OAAO;AAET,WAAO,qBAAqB,GAAG;EACjC;;AAGFA,MAAK,qBAAqB;EACxB;EACA;EACA;EACA;EACA;;;;AOnDK,IAAM,YAAuB;AAuDpC,IAAM,cAAc,IAAI,OACtB,WAAW,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,MAC5D,SACF,KAAK,SAAS,iCAEe,SAAS,KAClC,SACF,OAAO,SAAS,KAAK,SAAS,OAAO;AAGlC,IAAM,UAAU,CAAC,QACtB,OAAO,QAAQ,YAAY,YAAY,KAAK,GAAG;AAE1C,IAAM,UAAU,CAAC,QAAsB;AAC5C,MAAI,CAAC,QAAQ,GAAG,GAAG;AACjB,UAAM,MAAM,mBAAmB;MAC7B,OAAO;KACR;EACH;AACA,SAAO;AACT;AAKO,IAAM,iBAAiB,CAAC,SAA2B;AACxD,QAAM,CAAC,MAAM,OAAO,QAAQ,KAAK,IAAI;AACrC,QAAM,IAAI,OAAO,KAAK;AACtB,UAAQ,MAAM;IACZ,KAAK;AACH,aAAO,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,GAAG,QAAQ,GAAG,SAAS,GAAG,OAAO,KAAK,CAAC,KAAK,EAAE;IACpG,KAAK;AACH,aAAO,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,GAAG,QAAQ,GAAG,SAAS,GAAG,OAAO,KAAK,CAAC,KAAK,EAAE;IAC3G;AACE,aAAO,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,KAAK,EAAE;EAClF;AACF;AAGA,IAAM,SAAS,CAAC,MACd,mBAAmB,CAAC,EAAE,WAAW,OAAO,GAAG;AAKtC,IAAM,aAAa,CAACC,QAA0B;AACnD,QAAM,CAAC,MAAM,QAAQ,IAAI,QAAQ,KAAK,IAAIA,IAAG,MAAM,WAAW,CAAC;AAC/D,QAAM,IAAI,mBAAmB,KAAK;AAClC,UAAQ,MAAM;IACZ,KAAK;IACL,KAAK,IAAI;AACP,UAAI,WAAW,QAAW;AACxB,cAAM,MAAM,WAAW,IAAI,OAAO,EAAE,OAAOA,IAAE,CAAE;MACjD;AACA,YAAM,IAAgB;QACpB,QAAQ;QACR;QACA,mBAAmB,MAAM;;AAE3B,UAAI;AAAO,UAAE,KAAK,mBAAmB,KAAK,CAAC;AAC3C,aAAO;IACT;IACA,KAAK;IACL,KAAK;IACL,KAAK,aAAa;AAChB,YAAM,IAAgB,CAAC,MAAM,CAAC;AAC9B,UAAI;AAAQ,UAAE,KAAK,mBAAmB,MAAM,CAAC;AAC7C,aAAO;IACT;IACA,SAAS;AACP,YAAM,MAAM,sBAAsB;QAChC,OAAO;QACP,cAAc,CAAC,OAAO,QAAQ,aAAa,UAAU,EAAE;OACxD;IACH;EACF;AACF;AAKO,IAAM,UAAU,CACrBA,KACA,MACA,UAAuB,CAAA,MACd,aAAa,WAAWA,GAAE,GAAG,MAAM,OAAO;AAK9C,IAAM,eAAe,CAC1B,OACA,MACA,UAAuB,CAAA,MACrB;AACF,QAAM,CAAC,MAAM,OAAO,MAAM,IAAI;AAC9B,UAAQ,MAAM;IACZ,KAAK,UAAU;AACb,UAAI,CAAC;AACH,cAAM,MAAM,mCAAmC;UAC7C,OAAO;SACR;AACH,aAAOC,MAAK,MAAM,QAAQ,aAAa,KAAK;IAC9C;IACA,KAAK,QAAQ;AACX,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,mCAAmC;UAC7C,OAAO;SACR;MACH;AACA,aAAOA,MAAK,MAAM,QAAQ,aAAa,QAAQ,KAAK,IAAI,OAAO;IACjE;IACA,KAAK,YAAY;AACf,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,MAAM,0CAA0C;UACpD,OAAO;SACR;MACH;AACA,UAAI,CAAC,QAAQ;AACX,cAAM,MAAM,oCAAoC;UAC9C,OAAO;SACR;MACH;AACA,UAAI,CAAC,OAAO;AAEV,cAAMC,KAAID,MAAK,MAAM,MAAM;AAC3B,YAAI,QAAQC,GAAE,SAAS,MAAM;AAC3B,iBAAOD,MAAK,MAAM,GAAG,IAAI,QAAQ,MAAM,EAAE;QAC3C,OAAO;AACL,iBAAOC;QACT;MACF;AACA,UAAI,CAAC,eAAe,KAAK,KAAK,GAAG;AAC/B,cAAM,MAAM,QAAQ,aAAa,KAAK;AACtC,YAAI,UAAU,SAAS,CAAC,KAAK;AAC3B,gBAAM,MAAM,uCAAuC;YACjD,MAAM;YACN,OAAO;WACR;QACH;AACA,eAAOD,MAAK,MACV,QAAQ,aACR,GAAG,KAAK,IAAI,MAAM,IAClB,OAAO;MAEX;AACA,YAAM,IAAIA,MAAK,MACb,QAAQ,aACR,YAAY,KAAK,IAAI,MAAM,IAC3B,OAAO;AAET,aAAO,QAAQ,EAAE,MAAM,SAAS,OAC5BA,MAAK,MAAM,EAAE,MAAM,OAAO,MAAM,EAAE,QAAQ,IAC1C;IACN;IACA,KAAK,OAAO;AACV,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,2BAA2B;UACrC,OAAO;SACR;MACH;AACA,aAAOA,MAAK,MACV,QAAQ,aACR,QAAQ,MAAM,QACd,OAAO;IAEX;IACA,KAAK,aAAa;AAChB,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,gCAAgC,EAAE,OAAO,MAAK,CAAE;MAC9D;AACA,aAAO,QAAQ,SAAS,QACpBA,MAAK,MAAM,MAAM,aAAa,KAAK,MAAM,OAAO,IAChDA,MAAK,MAAM,OAAO,eAAe,OAAO;IAC9C;EACF;AACF;AAGA,IAAM,aAAa,CAAC,MAEhB,CAAC,KACD,MAAM,gCACN,MAAM,gCAEN,KACA;AAQG,IAAM,WAAW,CAAC,MAAY,SAA8B;AACjE,QAAM,IAAI,KAAK;AACf,UAAQ,EAAE,MAAM;IACd,KAAK,YAAY;AAEf,YAAM,MAAM,WAAW,EAAE,QAAQ;AACjC,UAAI,CAAC,EAAE,iBAAiB,KAAK;AAC3B,mBAAW,CAAC,OAAO,IAAI,KAAK,OAAO,QACjC,KAAK,QAAQ,UAAU,GACtB;AACD,cAAI,QAAQ,MAAM;AAChB,cAAE,gBAAgB;AAClB;UACF;QACF;MACF;AACA,aAAO;QACL,EAAE;QACF,EAAE,iBAAiB;QACnB,GAAG,KAAK,QAAQ,KAAK,IAAI,IAAI,KAAK,WAAW,KAAK,QAAQ;;IAE9D;IACA,KAAK,OAAO;AACV,YAAM,EACJ,cACA,kBACA,WACA,cAAc,GAAE,IACd;AACJ,UAAI,CAAC;AACH,cAAM,MAAM,4BAA4B,EAAE,KAAI,CAAE;AAClD,UAAI,cAAc;AAChB,YAAI,CAAC,kBAAkB;AACrB,gBAAM,MAAM,uCAAuC;YACjD;WACD;QACH;AACA,eAAO;UACL,EAAE;UACF,GAAG,YAAY,IAAI,gBAAgB;UACnC;;MAEJ,OAAO;AACL,eAAO,CAAC,EAAE,MAAM,WAAW,WAAW;MACxC;IACF;IACA,KAAK,UAAU;AACb,YAAM,EAAE,UAAS,IAAK;AACtB,UAAI,CAAC;AACH,cAAM,MAAM,8BAA8B,EAAE,KAAI,CAAE;AACpD,aAAO,CAAC,EAAE,MAAM,SAAS;IAC3B;IACA,KAAK;IACL,KAAK;AACH,YAAM,MAAM,wCAAwC,EAAE,KAAI,CAAE;EAChE;AACF;AAQO,IAAM,QAAQ,CAAC,MAAY,SAChC,eAAe,SAAS,MAAM,IAAI,CAAC;;;ACpFrC,IAAM,0BAA0B,CAC9B,MAEA,MAAM,UAAa,qBAAqB,CAAC;AAE3C,IAAM,uBAAuB,CAC3B,MAEA,gBAAwB,GAAG,OAAK,OAAO,MAAM,QAAQ;AAEvD,IAAM,kBAAkB,CACtB,GACA,UAEA,CAAC,CAAC,KACF,OAAO,MAAM,YACb,OAAO,QAAQ,CAAC,EAAE,MAChB,CAAC,CAAC,GAAG,CAAC,MAAM,OAAO,MAAM,YAAY,MAAM,CAAC,CAAC;AAQjD,IAAM,+BAA+B,CACnC,MAEA,MAAM,UACN,gBAA2C,GAAG,OAC5C,4BAA4B,CAAC,CAAC;AAGlC,IAAM,eAAe,CAAC,MACpB,MAAM,UAAa,OAAO,MAAM;AAElC,IAAM,8BAA8B,CAClC,MAEA,CAAC,CAAC,KAAK,OAAO,MAAM,YAAY,aAAa,EAAE,QAAQ;AAEzD,IAAM,cAAc,CAAC,MACnB,MAAM,UAAa,OAAO,MAAM;AAElC,IAAM,YAAY,CAAC,MACjB,MAAM,UACL,CAAC,CAAC,KAAK,OAAO,MAAM,YAAY,YAAY,EAAE,OAAO;AAEjD,IAAM,aAAa,CAAC,MACzB,CAAC,CAAC,KACF,OAAO,MAAM,YACb,CAAC,MAAM,QAAQ,CAAC,KAChB,YAAY,EAAE,IAAI,KAClB,YAAY,EAAE,OAAO,KACrB,wBAAwB,EAAE,YAAY,KACtC,wBAAwB,EAAE,eAAe,KACzC,wBAAwB,EAAE,oBAAoB,KAC9C,wBAAwB,EAAE,gBAAgB,KAC1C,wBAAwB,EAAE,kBAAkB,KAC5C,6BAA6B,EAAE,oBAAoB,KACnD,UAAU,EAAE,IAAI;AAOX,IAAM,aAAa,CACxB,GACA,SACY;AACZ,MAAI,CAAC,WAAW,CAAC,GAAG;AAClB,UAAM,MAAM,oBAAoB,EAAE,OAAO,EAAC,GAAI,QAAQ,UAAU;EAClE;AACA,SAAO;AACT;;;ACnTA,SAAS,cAAc,qBAAqB;AAC5C,SAAS,WAAAE,gBAAe;;;ACiCxB,IAAM,SAAS,CAAC,MACd,MAAM,KAAK,CAAC,EACT,IACC,OAAK,OAAO,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,YAAW,EAAG,SAAS,GAAG,GAAG,CAAC,EAExE,KAAK,EAAE;AAOZ,IAAM,aAAa,CAAC,GAAU,KAAa,YAAmC;AAC5E,MAAI,CAAC,KAAK;AACR,WAAO;MACL,SAAS,EAAE,UAAU;MACrB,UAAU;;EAEd;AACA,QAAM,WAAW,EAAE,QAAQ,MAAM,+BAA+B;AAChE,QAAM,QAAQ,EAAE,QAAQ,MAAM,qBAAqB;AAInD,QAAM,SAAS,uDAAuD,KACpE,EAAE,OAAO,IAEP,IAAI,SAAS,IACb,SAAS,MAAM,CAAC,IAChB,CAAC,MAAM,CAAC,IACR,qBAAqB,KAAK,EAAE,OAAO,IACnC,IACA;AAEJ,QAAM,MACJ,YAAY,SAAS,CAAC,IAClB,EAAE,QAAQ,QACR,uBACA,oBAAoB,KAAK,UAAU,SAAS,CAAC,CAAC,CAAC,KAAK,OAClD,SAAS,CAAC,CAAC,CACZ,GAAG,IAEN,EAAE;AAGR,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,UAAM,QAAQ,UAAU,UAAU,IAAI,SAAS;AAE/C,UAAM,MAAM,SAAS,WAAW,IAAI,SAAS,IAAI,SAAS,SAAS;AAEnE,UAAM,SACH,UAAU,IAAI,KAAK,SACpB,IAAI,MAAM,OAAO,GAAG,KACnB,QAAQ,IAAI,SAAS,KAAK;AAE7B,UAAM,OAAO,QAAQ,QAAQ,KAAK;AAElC,WAAO;MACL,SAAS,MAAM,kBAAkB,IAAI,GAAG,KAAK,UAAU,KAAK,CAAC;MAC7D,UAAU;;EAEd,OAAO;AACL,WAAO;MACL,SAAS,MAAM,mBAAmB,IAAI,MAAM,GAAG,UAAU,CAAC,CAAC;MAC3D,UAAU;;EAEd;AACF;AAEM,IAAO,iBAAP,cAA8B,YAAW;EAC7C;EACA;EACA;EACA,YACE,IACA,KACA,UAAkB,IAClB,QAA0C;AAE1C,UAAM,EAAE,SAAS,SAAQ,IAAK,WAAW,IAAI,KAAK,OAAO;AACzD,UAAM,OAAO;AACb,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,OAAO;AACZ,UAAM,kBAAkB,MAAM,UAAU,KAAK,WAAW;EAC1D;EACA,IAAI,OAAI;AACN,WAAO,KAAK,YAAY;EAC1B;EACA,IAAI,KAAK,GAAC;EAAG;EACb,KAAK,OAAO,WAAW,IAAC;AACtB,WAAO,KAAK,YAAY;EAC1B;;AAGK,IAAM,UAAU,OAAO,IAAI,QAAQ;AACnC,IAAM,WAAW,OAAO,IAAI,SAAS;AAK5C,IAAM,WAAW;AACjB,IAAM,UAAU;AAiBT,IAAMC,SAAQ,CACnB,KACA,SACA,YACc;AACd,QAAM,YAAY,SAAS,OAAO,GAAG,CAAC;AACtC,MAAI,CAAC;AAAS,cAAU;AACxB,YAAU,WAAW;AACrB,MAAI;AAOF,UAAM,CAAC,EAAE,UAAU,MAAM,SAAS,IAAI,IAAI,UAAU,MAAM,OAAO,KAC/D,UAAU,MAAM,QAAQ,KAAK,CAAC,EAAE,IAAI,EAAE;AAExC,UAAM,SAAS,KAAK,MAAM,WAAW,OAAO;AAC5C,QAAI,UAAU,OAAO,WAAW,UAAU;AACxC,aAAO,QAAQ,IAAI;AACnB,aAAO,OAAO,IAAI;IACpB;AACA,WAAO;EACT,SAAS,GAAG;AACV,QAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,GAAG;AACpD,YAAM,eACJ,MAAM,QAAQ,GAAG,KAAM,IAAmB,WAAW;AACvD,YAAM,OAAO,OACX,IAAI,UACF,gBAAgB,eAAe,mBAAmB,OAAO,GAAG,CAAC,EAAE,GAEjE;QACE,MAAM;QACN,aAAa;OACd;IAEL;AAEA,UAAM,IAAI,eAAe,GAAY,WAAW,SAASA,MAAK;EAChE;AACF;AAWA,IAAM,WAAW,CAAC,QAAgB,OAAO,GAAG,EAAE,QAAQ,WAAW,EAAE;AAE5D,IAAM,YAAY,CACvB,KACA,UACA,WACE;AACF,QAAM,QAAQ,WAAW,SAAY,IAAI,OAAO,IAAI;AAEpD,QAAM;;IAEJ,OAAO,aAAa,aAChB,KAAK,UAAU,KAAK,UAAU,KAAK,IACnC,KAAK,UAAU,KAAK,UAAU,KAAK;;AAEzC,QAAM,KAAK,IAAI,QAAQ,KAAK;AAC5B,SAAO,SAAS,OAAO,OAAO,MAAM,IAAI,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK;AACvE;;;AD1NM,IAAO,cAAP,MAAkB;;;;EAItB,SAAS,oBAAI,IAAG;;;;EAKhB,aAAa,oBAAI,IAAG;;;;EAKpB,YAAY,oBAAI,IAAG;;;;;EAMnB,KAAK,KAAa,EAAE,OAAM,IAA2B,CAAA,GAAE;AACrD,UAAM,oBAAoB,CAAC,UAAU,KAAK,OAAO,IAAI,GAAG;AACxD,QAAI,mBAAmB;AACrB,aAAO;IACT;AAEA,UAAM,WAAWC,SAAQ,KAAK,cAAc;AAE5C,UAAM,OAAO,CAAC,QACZ,MAAM,oCAAoC,KAAK,KAAK,IAAI;AAE1D,UAAM,cAAc,CAAC,UAAU,KAAK,UAAU,IAAI,GAAG;AACrD,QAAI,aAAa;AACf,YAAM,KAAK,WAAW;IACxB;AAEA,QAAI;AACF,YAAM,MAAgB,WACpBC,OAAM,aAAa,UAAU,EAAE,UAAU,OAAM,CAAE,CAAC,CAAC;AAErD,WAAK,OAAO,IAAI,KAAK,GAAG;AACxB,WAAK,WAAW,IAAI,KAAK,GAAG;AAC5B,aAAO;IACT,SAAS,KAAK;AACZ,YAAM,KAAuB;QAC3B,MAAM;QACN,OAAO;;AAET,WAAK,UAAU,IAAI,KAAK,EAAE;AAC1B,YAAM,KAAK,EAAE;IACf;EACF;EAEA,MAAM,KAAa,UAAkB;AACnC,UAAM,WAAWD,SAAQ,KAAK,cAAc;AAE5C,QAAI;AAGF,oBAAc,UAAU,UAAU,QAAQ,CAAC;AAC3C,WAAK,OAAO,IAAI,KAAK,QAAQ;AAC7B,WAAK,WAAW,IAAI,UAAU,GAAG;IACnC,SAAS,KAAK;AAGZ,WAAK,OAAO,OAAO,GAAG;AACtB,WAAK,WAAW,OAAO,QAAQ;AAC/B,YAAM,MACJ,qCACA;QACE,MAAM;QACN,OAAO;SAET,KAAK,KAAK;IAEd;EACF;EAEA,KAAK,UAAkB;AACrB,UAAM,MAAM,KAAK,WAAW,IAAI,QAAQ;AACxC,QAAI,CAAC,KAAK;AACR,YAAM,MACJ,2BACA;QACE;SAEF,KAAK,IAAI;IAEb;AACA,SAAK,MAAM,KAAK,QAAQ;EAC1B;;;;AE5FF,SAAS,gBAAAE,eAAc,gBAAgB;;;ACJvC,6BAAmB;;;ACAnB,IAAM,qBAAqB,OAAO;AAC3B,IAAM,qBAA6C,CACxD,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,eAAsE;EAC1E,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;;AAKnC,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,CACxBC,OACA,aACoB;AACpB,QAAM,MAAM;AAEZ,MAAIA,MAAK,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,IAAIA,MAAK,QAAQ;AAC7B,UAAM,IAAIA,MAAK,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,YAAIA,MAAK,WAAW,KAAK,CAAC,GAAG;AAE3B,cAAI,YAAY;AACd,mBAAO,CAAC,MAAM,OAAOA,MAAK,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,QAAIA,MAAK,WAAW,MAAM,IAAI,CAAC,GAAG;AAChC,aAAO,KAAK,YAAY,IAAI,GAAG,CAAC;AAChC,WAAK;AACL;IACF;AACA,QAAIA,MAAK,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,OAAOA,MAAK,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,SAClB,MAAM,UAAU,MAAM,QAAQ,MAC9B,OAAO,SACP,UACA;AAEN,SAAO,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI;AACzC;;;AC7JO,IAAM,WAAW,CACtB,GACA,EACE,uBAAuB,MAAK,IACsB,CAAA,MAClD;AACF,SAAO,uBACH,EAAE,QAAQ,kBAAkB,IAAI,IAChC,EAAE,QAAQ,6BAA6B,MAAM,EAAE,QAAQ,cAAc,IAAI;AAC/E;;;ACoBA,IAAM,QAAQ,oBAAI,IAAiB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AAC5D,IAAM,gBAAgB,CAAC,MACrB,MAAM,IAAI,CAAgB;AAM5B,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;AAKtB,IAAO,MAAP,MAAO,KAAG;EACd;EACS;EAET;EACA,SAAkB;EAClB,SAA2B,CAAA;EAClB;EACA;EACT;EACA,cAAuB;EACvB;EACA;;;EAGA,YAAqB;EAErB,YACE,MACA,QACA,UAA4B,CAAA,GAAE;AAE9B,SAAK,OAAO;AAEZ,QAAI;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,QAAI,SAAS,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,QAAI;AACJ,WAAQ,IAAI,KAAK,MAAM,IAAG,GAAK;AAC7B,UAAI,EAAE,SAAS;AAAK;AAEpB,UAAI,IAAqB;AACzB,UAAI,KAAK,EAAE;AACX,aAAO,IAAI;AACT,iBACM,IAAI,EAAE,eAAe,GACzB,CAAC,GAAG,QAAQ,IAAI,GAAG,OAAO,QAC1B,KACA;AACA,qBAAW,QAAQ,EAAE,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,UAAI,OAAO,MAAM,YAAY,EAAE,aAAa,QAAO,EAAE,YAAY,OAAO;AACtE,cAAM,IAAI,MAAM,mBAAmB,CAAC;MACtC;AAEA,WAAK,OAAO,KAAK,CAAC;IACpB;EACF;EAEA,SAAM;AACJ,UAAM,MACJ,KAAK,SAAS,OACV,KAAK,OAAO,MAAK,EAAG,IAAI,OAAM,OAAO,MAAM,WAAW,IAAI,EAAE,OAAM,CAAG,IACrE,CAAC,KAAK,MAAM,GAAG,KAAK,OAAO,IAAI,OAAM,EAAU,OAAM,CAAE,CAAC;AAC9D,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,QAAO,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,KAAI,KAAK,MAAM,MAAM;AACnC,eAAW,KAAK,KAAK,QAAQ;AAC3B,QAAE,OAAO,CAAC;IACZ;AACA,WAAO;EACT;EAEA,OAAO,UACL,KACA,KACA,KACA,KAAqB;AAErB,QAAI,WAAW;AACf,QAAI,UAAU;AACd,QAAI,aAAa;AACjB,QAAI,WAAW;AACf,QAAI,IAAI,SAAS,MAAM;AAErB,UAAIC,KAAI;AACR,UAAIC,OAAM;AACV,aAAOD,KAAI,IAAI,QAAQ;AACrB,cAAM,IAAI,IAAI,OAAOA,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;AAEA,YAAI,CAAC,IAAI,SAAS,cAAc,CAAC,KAAK,IAAI,OAAOD,EAAC,MAAM,KAAK;AAC3D,cAAI,KAAKC,IAAG;AACZ,UAAAA,OAAM;AACN,gBAAMC,OAAM,IAAI,KAAI,GAAG,GAAG;AAC1B,UAAAF,KAAI,KAAI,UAAU,KAAKE,MAAKF,IAAG,GAAG;AAClC,cAAI,KAAKE,IAAG;AACZ;QACF;AACA,QAAAD,QAAO;MACT;AACA,UAAI,KAAKA,IAAG;AACZ,aAAOD;IACT;AAIA,QAAI,IAAI,MAAM;AACd,QAAI,OAAO,IAAI,KAAI,MAAM,GAAG;AAC5B,UAAM,QAAe,CAAA;AACrB,QAAI,MAAM;AACV,WAAO,IAAI,IAAI,QAAQ;AACrB,YAAM,IAAI,IAAI,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,UAAI,cAAc,CAAC,KAAK,IAAI,OAAO,CAAC,MAAM,KAAK;AAC7C,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAME,OAAM,IAAI,KAAI,GAAG,IAAI;AAC3B,aAAK,KAAKA,IAAG;AACb,YAAI,KAAI,UAAU,KAAKA,MAAK,GAAG,GAAG;AAClC;MACF;AACA,UAAI,MAAM,KAAK;AACb,aAAK,KAAK,GAAG;AACb,cAAM;AACN,cAAM,KAAK,IAAI;AACf,eAAO,IAAI,KAAI,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,CAAC,IAAI,UAAU,MAAM,CAAC,CAAC;AACpC,WAAO;EACT;EAEA,OAAO,SAAS,SAAiB,UAA4B,CAAA,GAAE;AAC7D,UAAM,MAAM,IAAI,KAAI,MAAM,QAAW,OAAO;AAC5C,SAAI,UAAU,SAAS,KAAK,GAAG,OAAO;AACtC,WAAO;EACT;;;EAIA,cAAW;AAGT,QAAI,SAAS,KAAK;AAAO,aAAO,KAAK,MAAM,YAAW;AAEtD,UAAMC,QAAO,KAAK,SAAQ;AAC1B,UAAM,CAACC,KAAI,MAAMC,WAAU,KAAK,IAAI,KAAK,eAAc;AAIvD,UAAM,WACJA,aACA,KAAK,aACJ,KAAK,SAAS,UACb,CAAC,KAAK,SAAS,mBACfF,MAAK,YAAW,MAAOA,MAAK,YAAW;AAC3C,QAAI,CAAC,UAAU;AACb,aAAO;IACT;AAEA,UAAM,SAAS,KAAK,SAAS,SAAS,MAAM,OAAO,QAAQ,MAAM;AACjE,WAAO,OAAO,OAAO,IAAI,OAAO,IAAIC,GAAE,KAAK,KAAK,GAAG;MACjD,MAAMA;MACN,OAAOD;KACR;EACH;EAEA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAuEA,eACE,UAAkB;AAElB,UAAM,MAAM,YAAY,CAAC,CAAC,KAAK,SAAS;AACxC,QAAI,KAAK,UAAU;AAAM,WAAK,UAAS;AACvC,QAAI,CAAC,KAAK,MAAM;AACd,YAAM,UAAU,KAAK,QAAO,KAAM,KAAK,MAAK;AAC5C,YAAM,MAAM,KAAK,OACd,IAAI,OAAI;AACP,cAAM,CAACC,KAAI,GAAGC,WAAU,KAAK,IAC3B,OAAO,MAAM,WACT,KAAI,WAAW,GAAG,KAAK,WAAW,OAAO,IACzC,EAAE,eAAe,QAAQ;AAC/B,aAAK,YAAY,KAAK,aAAaA;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,SAAQ,aAAa,mBAAmB,YAAY,aAAa;UACnE;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,WAAK,SAAS,CAAC,CAAC;AAChB,WAAK,OAAO;AACZ,WAAK,YAAY;AACjB,aAAO,CAAC,GAAG,SAAS,KAAK,SAAQ,CAAE,GAAG,OAAO,KAAK;IACpD;AAGA,QAAI,iBACF,CAAC,YAAY,YAAY,OAAO,CAAC,aAC7B,KACA,KAAK,eAAe,IAAI;AAC9B,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;;QAEV,QACC,KAAK,QAAO,KAAM,CAAC,OAAO,CAAC,WAAW,aAAa,MACpD,OACA;UACA,KAAK,SAAS,MACd,MACA,KAAK,SAAS,MACd,OACA,KAAK,SAAS,OAAO,iBACrB,MACA,KAAK,SAAS,OAAO,iBACrB,OACA,IAAI,KAAK,IAAI;AACnB,cAAQ,QAAQ,OAAO;IACzB;AACA,WAAO;MACL;MACA,SAAS,IAAI;MACZ,KAAK,YAAY,CAAC,CAAC,KAAK;MACzB,KAAK;;EAET;EAEA,eAAe,KAAY;AACzB,WAAO,KAAK,OACT,IAAI,OAAI;AAGP,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,IAAI,MAAM,8BAA8B;MAChD;AAGA,YAAM,CAACH,KAAI,GAAG,WAAW,KAAK,IAAI,EAAE,eAAe,GAAG;AACtD,WAAK,SAAS,KAAK,UAAU;AAC7B,aAAOA;IACT,CAAC,EACA,OAAO,OAAK,EAAE,KAAK,QAAO,KAAM,KAAK,MAAK,MAAO,CAAC,CAAC,CAAC,EACpD,KAAK,GAAG;EACb;EAEA,OAAO,WACLD,OACAE,WACA,UAAmB,OAAK;AAExB,QAAI,WAAW;AACf,QAAID,MAAK;AACT,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAID,MAAK,QAAQ,KAAK;AACpC,YAAM,IAAIA,MAAK,OAAO,CAAC;AACvB,UAAI,UAAU;AACZ,mBAAW;AACX,QAAAC,QAAO,WAAW,IAAI,CAAC,IAAI,OAAO,MAAM;AACxC;MACF;AACA,UAAI,MAAM,MAAM;AACd,YAAI,MAAMD,MAAK,SAAS,GAAG;AACzB,UAAAC,OAAM;QACR,OAAO;AACL,qBAAW;QACb;AACA;MACF;AACA,UAAI,MAAM,KAAK;AACb,cAAM,CAAC,KAAK,WAAW,UAAU,KAAK,IAAI,WAAWD,OAAM,CAAC;AAC5D,YAAI,UAAU;AACZ,UAAAC,OAAM;AACN,kBAAQ,SAAS;AACjB,eAAK,WAAW;AAChB,UAAAC,YAAWA,aAAY;AACvB;QACF;MACF;AACA,UAAI,MAAM,KAAK;AACb,YAAI,WAAWF,UAAS;AAAK,UAAAC,OAAM;;AAC9B,UAAAA,OAAM;AACX,QAAAC,YAAW;AACX;MACF;AACA,UAAI,MAAM,KAAK;AACb,QAAAD,OAAM;AACN,QAAAC,YAAW;AACX;MACF;AACA,MAAAD,OAAM,aAAa,CAAC;IACtB;AACA,WAAO,CAACA,KAAI,SAASD,KAAI,GAAG,CAAC,CAACE,WAAU,KAAK;EAC/C;;;;ACjpBK,IAAM,SAAS,CACpB,GACA,EACE,uBAAuB,MAAK,IACsB,CAAA,MAClD;AAIF,SAAO,uBACH,EAAE,QAAQ,cAAc,MAAM,IAC9B,EAAE,QAAQ,gBAAgB,MAAM;AACtC;;;ALoBO,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,CAACG,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,MAAc,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AAC3E,IAAM,qBAAqB,CAAC,MAC1B,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC3C,IAAM,YAAY;AAClB,IAAM,cAAc,CAAC,MAAc,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,GAAG;AAC9E,IAAM,SAAS;AACf,IAAM,WAAW,CAAC,MAAc,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,GAAG;AACnE,IAAM,cAAc,CAAC,MAAc,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AACxE,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,UAC1B,OAAO,QAAQ,QAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACd,QAAQ,WACR;AAGN,IAAM,OAAsC;EAC1C,OAAO,EAAE,KAAK,KAAI;EAClB,OAAO,EAAE,KAAK,IAAG;;AAIZ,IAAM,MAAM,oBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC7E,UAAU,MAAM;AAET,IAAM,WAAW,OAAO,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,YACE,MACA,QACA,UAA4B,CAAA,GAAE;AAE9B,cAAM,MAAM,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,UAA0D,CAAA,MACvD,KAAK,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC;IAEvC,QAAQ,CACN,GACA,UAA0D,CAAA,MACvD,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,CAAC;IAErC,QAAQ,CAAC,SAAiB,UAA4B,CAAA,MACpD,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;IAExC,UAAU,CAAC,YAA8B,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC;IAExE,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,CAAC,MAAgB,SAAiB,UAA4B,CAAA,MACnE,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;IAE7C,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,aAAO,uBAAAE,SAAO,OAAO;AACvB;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;EAEA;EACA,YAAY,SAAiB,UAA4B,CAAA,GAAE;AACzD,uBAAmB,OAAO;AAE1B,cAAU,WAAW,CAAA;AACrB,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,WAAW,QAAQ,YAAY;AACpC,SAAK,YAAY,KAAK,aAAa;AACnC,SAAK,uBACH,CAAC,CAAC,QAAQ,wBAAwB,QAAQ,uBAAuB;AACnE,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,SAC3B,QAAQ,qBACR,CAAC,EAAE,KAAK,aAAa,KAAK;AAEhC,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,SAAS,GAAQ;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,QAAI,MAAM,KAAK,UAAU,IAAI,CAAC,GAAG,GAAG,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,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,QAAM,KAAK,MAAM,EAAE,CAAC,CAAC;QACnE,WAAW,SAAS;AAClB,iBAAO,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,EAAE,IAAI,QAAM,KAAK,MAAM,EAAE,CAAC,CAAC;QACvD;MACF;AACA,aAAO,EAAE,IAAI,QAAM,KAAK,MAAM,EAAE,CAAC;IACnC,CAAC;AAED,SAAK,MAAM,KAAK,SAAS,GAAG;AAG5B,SAAK,MAAM,IAAI,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,iBAAS,IAAI,GAAG,IAAI,UAAU,CAAC,EAAE,QAAQ,KAAK;AAC5C,cAAI,UAAU,CAAC,EAAE,CAAC,MAAM,MAAM;AAC5B,sBAAU,CAAC,EAAE,CAAC,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,UAAI,KAAa;AACjB,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,YAAI,IAAI;AACR,eAAO,MAAM,IAAI,CAAC,MAAM,MAAM;AAC5B;QACF;AACA,YAAI,MAAM,IAAI;AACZ,gBAAM,OAAO,IAAI,IAAI,EAAE;QACzB;MACF;AACA,aAAO;IACT,CAAC;EACH;;EAGA,iBAAiB,WAAqB;AACpC,WAAO,UAAU,IAAI,WAAQ;AAC3B,cAAQ,MAAM,OAAO,CAAC,KAAe,SAAQ;AAC3C,cAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,YAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,iBAAO;QACT;AACA,YAAI,SAAS,MAAM;AACjB,cAAI,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;AAC1D,gBAAI,IAAG;AACP,mBAAO;UACT;QACF;AACA,YAAI,KAAK,IAAI;AACb,eAAO;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,YAAI,KAAa;AACjB,eAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;AAChD,cAAI,MAAc;AAClB,iBAAO,MAAM,MAAM,CAAC,MAAM,MAAM;AAE9B;UACF;AAGA,cAAI,MAAM,IAAI;AACZ,kBAAM,OAAO,KAAK,GAAG,MAAM,EAAE;UAC/B;AAEA,cAAI,OAAO,MAAM,KAAK,CAAC;AACvB,gBAAM,IAAI,MAAM,KAAK,CAAC;AACtB,gBAAM,KAAK,MAAM,KAAK,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,OAAO,IAAI,CAAC;AAClB,gBAAM,QAAQ,MAAM,MAAM,CAAC;AAC3B,gBAAM,EAAE,IAAI;AACZ,oBAAU,KAAK,KAAK;AACpB;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,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,cAAM,UAAU,KAAK,WACnB,UAAU,CAAC,GACX,UAAU,CAAC,GACX,CAAC,KAAK,uBAAuB;AAE/B,YAAI,SAAS;AACX,oBAAU,CAAC,IAAI,CAAA;AACf,oBAAU,CAAC,IAAI;AACf;QACF;MACF;IACF;AACA,WAAO,UAAU,OAAO,QAAM,GAAG,MAAM;EACzC;EAEA,WACE,GACA,GACA,eAAwB,OAAK;AAE7B,QAAI,KAAK;AACT,QAAI,KAAK;AACT,QAAI,SAAmB,CAAA;AACvB,QAAI,QAAgB;AACpB,WAAO,KAAK,EAAE,UAAU,KAAK,EAAE,QAAQ;AACrC,UAAI,EAAE,EAAE,MAAM,EAAE,EAAE,GAAG;AACnB,eAAO,KAAK,UAAU,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;AACzC;AACA;MACF,WAAW,gBAAgB,EAAE,EAAE,MAAM,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAE,EAAE,CAAC;AACjB;MACF,WAAW,gBAAgB,EAAE,EAAE,MAAM,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG;AAChE,eAAO,KAAK,EAAE,EAAE,CAAC;AACjB;MACF,WACE,EAAE,EAAE,MAAM,OACV,EAAE,EAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAE,EAAE,EAAE,WAAW,GAAG,MAC1C,EAAE,EAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAE,EAAE,CAAC;AACjB;AACA;MACF,WACE,EAAE,EAAE,MAAM,OACV,EAAE,EAAE,MACH,KAAK,QAAQ,OAAO,CAAC,EAAE,EAAE,EAAE,WAAW,GAAG,MAC1C,EAAE,EAAE,MAAM,MACV;AACA,YAAI,UAAU;AAAK,iBAAO;AAC1B,gBAAQ;AACR,eAAO,KAAK,EAAE,EAAE,CAAC;AACjB;AACA;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,SAAS,MAAgB,SAAwB,UAAmB,OAAK;AACvE,UAAM,UAAU,KAAK;AAKrB,QAAI,KAAK,WAAW;AAClB,YAAM,YAAY,OAAO,KAAK,CAAC,MAAM,YAAY,YAAY,KAAK,KAAK,CAAC,CAAC;AACzE,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,MAAM,UAAU,IAAI,YAAY,IAAI;AAC1C,YAAM,MAAM,aAAa,IAAI,eAAe,IAAI;AAChD,UAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;AACtD,cAAM,CAAC,IAAI,EAAE,IAAsB,CAAC,KAAK,GAAG,GAAG,QAAQ,GAAG,CAAW;AACrE,YAAI,GAAG,YAAW,MAAO,GAAG,YAAW,GAAI;AACzC,kBAAQ,GAAG,IAAI;AACf,cAAI,MAAM,KAAK;AACb,sBAAU,QAAQ,MAAM,GAAG;UAC7B,WAAW,MAAM,KAAK;AACpB,mBAAO,KAAK,MAAM,GAAG;UACvB;QACF;MACF;IACF;AAIA,UAAM,EAAE,oBAAoB,EAAC,IAAK,KAAK;AACvC,QAAI,qBAAqB,GAAG;AAC1B,aAAO,KAAK,qBAAqB,IAAI;IACvC;AAEA,SAAK,MAAM,YAAY,MAAM,EAAE,MAAM,QAAO,CAAE;AAC9C,SAAK,MAAM,YAAY,KAAK,QAAQ,QAAQ,MAAM;AAElD,aACM,KAAK,GAAG,KAAK,GAAG,KAAK,KAAK,QAAQ,KAAK,QAAQ,QACnD,KAAK,MAAM,KAAK,IAChB,MAAM,MACN;AACA,WAAK,MAAM,eAAe;AAC1B,UAAI,IAAI,QAAQ,EAAE;AAClB,UAAI,IAAI,KAAK,EAAE;AAEf,WAAK,MAAM,SAAS,GAAG,CAAC;AAKxB,UAAI,MAAM,OAAO;AACf,eAAO;MACT;AAGA,UAAI,MAAM,UAAU;AAClB,aAAK,MAAM,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC;AAwBtC,YAAI,KAAK;AACT,YAAI,KAAK,KAAK;AACd,YAAI,OAAO,IAAI;AACb,eAAK,MAAM,eAAe;AAO1B,iBAAO,KAAK,IAAI,MAAM;AACpB,gBACE,KAAK,EAAE,MAAM,OACb,KAAK,EAAE,MAAM,QACZ,CAAC,QAAQ,OAAO,KAAK,EAAE,EAAE,OAAO,CAAC,MAAM;AAExC,qBAAO;UACX;AACA,iBAAO;QACT;AAGA,eAAO,KAAK,IAAI;AACd,cAAI,YAAY,KAAK,EAAE;AAEvB,eAAK,MAAM,oBAAoB,MAAM,IAAI,SAAS,IAAI,SAAS;AAG/D,cAAI,KAAK,SAAS,KAAK,MAAM,EAAE,GAAG,QAAQ,MAAM,EAAE,GAAG,OAAO,GAAG;AAC7D,iBAAK,MAAM,yBAAyB,IAAI,IAAI,SAAS;AAErD,mBAAO;UACT,OAAO;AAGL,gBACE,cAAc,OACd,cAAc,QACb,CAAC,QAAQ,OAAO,UAAU,OAAO,CAAC,MAAM,KACzC;AACA,mBAAK,MAAM,iBAAiB,MAAM,IAAI,SAAS,EAAE;AACjD;YACF;AAGA,iBAAK,MAAM,0CAA0C;AACrD;UACF;QACF;AAKA,YAAI,SAAS;AAEX,eAAK,MAAM,4BAA4B,MAAM,IAAI,SAAS,EAAE;AAC5D,cAAI,OAAO,IAAI;AACb,mBAAO;UACT;QACF;AAEA,eAAO;MACT;AAKA,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,QAAI,OAAO,MAAM,OAAO,IAAI;AAG1B,aAAO;IACT,WAAW,OAAO,IAAI;AAIpB,aAAO;IACT,WAAW,OAAO,IAAI;AAKpB,aAAO,OAAO,KAAK,KAAK,KAAK,EAAE,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,SACJ,QAAQ,MACN,0BACA,uBACF,QAAQ,MACR,oBACA,gBACJ,EAAE,CAAC,CAAC;IACR,WAAY,IAAI,QAAQ,MAAM,QAAQ,GAAI;AACxC,kBACE,QAAQ,SACJ,QAAQ,MACN,sBACA,mBACF,QAAQ,MACR,gBACA,YACJ,CAAC;IACL,WAAY,IAAI,QAAQ,MAAM,aAAa,GAAI;AAC7C,iBAAW,QAAQ,MAAM,qBAAqB;IAChD,WAAY,IAAI,QAAQ,MAAM,SAAS,GAAI;AACzC,iBAAW;IACb;AAEA,UAAMC,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,UAAM,MAAM,KAAK;AAEjB,QAAI,CAAC,IAAI,QAAQ;AACf,WAAK,SAAS;AACd,aAAO,KAAK;IACd;AACA,UAAM,UAAU,KAAK;AAErB,UAAM,UAAU,QAAQ,aACpBH,QACA,QAAQ,MACR,aACA;AACJ,UAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAA,CAAE;AAQjD,QAAIG,MAAK,IACN,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,eAAO,OAAO,MAAM,WAChBD,cAAa,CAAC,IACd,MAAM,WACN,WACA,EAAE;MACR,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,YAAY,UAAU;QAC3C,WAAW,SAAS,UAAU;AAC5B,aAAG,IAAI,CAAC,IAAI,OAAO,eAAe,UAAU,SAAS;AACrD,aAAG,IAAI,CAAC,IAAI;QACd;MACF,CAAC;AACD,aAAO,GAAG,OAAO,OAAK,MAAM,QAAQ,EAAE,KAAK,GAAG;IAChD,CAAC,EACA,KAAK,GAAG;AAIX,UAAM,CAAC,MAAM,KAAK,IAAI,IAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;AAG7D,IAAAC,MAAK,MAAM,OAAOA,MAAK,QAAQ;AAG/B,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,UAAM,MAAM,KAAK;AACjB,SAAK,MAAM,KAAK,SAAS,OAAO,GAAG;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,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAM,UAAU,IAAI,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;;;AM7qCrB,SAAS,iBAAAC,sBAAqB;;;ACI9B,IAAM,OACJ,OAAO,gBAAgB,YACvB,eACA,OAAO,YAAY,QAAQ,aACvB,cACA;AAEN,IAAM,SAAS,oBAAI,IAAG;AAMtB,IAAM,UACJ,OAAO,YAAY,YAAY,CAAC,CAAC,UAAU,UAAU,CAAA;AAIvD,IAAM,cAAc,CAClB,KACA,MACA,MACA,OACE;AACF,SAAO,QAAQ,gBAAgB,aAC3B,QAAQ,YAAY,KAAK,MAAM,MAAM,EAAE,IACvC,QAAQ,MAAM,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE;AAC/C;AAEA,IAAI,KAAK,WAAW;AACpB,IAAI,KAAK,WAAW;AAGpB,IAAI,OAAO,OAAO,aAAa;AAE7B,OAAK,MAAM,YAAW;IACpB;IACA,WAAqC,CAAA;IACrC;IACA,UAAmB;IACnB,iBAAiB,GAAW,IAAwB;AAClD,WAAK,SAAS,KAAK,EAAE;IACvB;;AAGF,OAAK,MAAM,gBAAe;IACxB,cAAA;AACE,qBAAc;IAChB;IACA,SAAS,IAAI,GAAE;IACf,MAAM,QAAW;AACf,UAAI,KAAK,OAAO;AAAS;AAEzB,WAAK,OAAO,SAAS;AAErB,WAAK,OAAO,UAAU;AAEtB,iBAAW,MAAM,KAAK,OAAO,UAAU;AACrC,WAAG,MAAM;;AAEX,WAAK,OAAO,UAAU,MAAM;IAC9B;;AAEF,MAAI,yBACF,QAAQ,KAAK,gCAAgC;AAC/C,QAAM,iBAAiB,MAAK;AAC1B,QAAI,CAAC;AAAwB;AAC7B,6BAAyB;AACzB,gBACE,oaAOA,uBACA,WACA,cAAc;EAElB;;AAIF,IAAM,aAAa,CAAC,SAAiB,CAAC,OAAO,IAAI,IAAI;AAErD,IAAM,OAAO,OAAO,MAAM;AAI1B,IAAM,WAAW,CAAC,MAChB,KAAK,MAAM,KAAK,MAAM,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;AAcjD,IAAM,eAAe,CAAC,QACpB,CAAC,SAAS,GAAG,IACT,OACA,OAAO,KAAK,IAAI,GAAG,CAAC,IACpB,aACA,OAAO,KAAK,IAAI,GAAG,EAAE,IACrB,cACA,OAAO,KAAK,IAAI,GAAG,EAAE,IACrB,cACA,OAAO,OAAO,mBACd,YACA;AAGN,IAAM,YAAN,cAAwB,MAAa;EACnC,YAAY,MAAY;AACtB,UAAM,IAAI;AACV,SAAK,KAAK,CAAC;EACb;;AAMF,IAAM,QAAN,MAAM,OAAK;EACT;EACA;;EAEA,OAAO,gBAAyB;EAChC,OAAO,OAAO,KAAW;AACvB,UAAM,UAAU,aAAa,GAAG;AAChC,QAAI,CAAC;AAAS,aAAO,CAAA;AACrB,WAAM,gBAAgB;AACtB,UAAM,IAAI,IAAI,OAAM,KAAK,OAAO;AAChC,WAAM,gBAAgB;AACtB,WAAO;EACT;EACA,YACE,KACA,SAAyC;AAGzC,QAAI,CAAC,OAAM,eAAe;AACxB,YAAM,IAAI,UAAU,yCAAyC;;AAG/D,SAAK,OAAO,IAAI,QAAQ,GAAG;AAC3B,SAAK,SAAS;EAChB;EACA,KAAK,GAAQ;AACX,SAAK,KAAK,KAAK,QAAQ,IAAI;EAC7B;EACA,MAAG;AACD,WAAO,KAAK,KAAK,EAAE,KAAK,MAAM;EAChC;;AAu7BI,IAAO,WAAP,MAAO,UAAQ;;EAIV;EACA;EACA;EACA;EACA;EACA;;;;EAKT;;;;EAKA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAKA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;;;EAIA;;EAGA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;;;;;;;;;;EAWA,OAAO,sBAIL,GAAqB;AACrB,WAAO;;MAEL,QAAQ,EAAE;MACV,MAAM,EAAE;MACR,OAAO,EAAE;MACT,QAAQ,EAAE;MACV,SAAS,EAAE;MACX,SAAS,EAAE;MACX,MAAM,EAAE;MACR,MAAM,EAAE;MACR,IAAI,OAAI;AACN,eAAO,EAAE;MACX;MACA,IAAI,OAAI;AACN,eAAO,EAAE;MACX;MACA,MAAM,EAAE;;MAER,mBAAmB,CAAC,MAAW,EAAE,mBAAmB,CAAC;MACrD,iBAAiB,CACf,GACA,OACA,SACA,YAEA,EAAE,iBACA,GACA,OACA,SACA,OAAO;MAEX,YAAY,CAAC,UACX,EAAE,YAAY,KAAc;MAC9B,SAAS,CAAC,YACR,EAAE,SAAS,OAAO;MACpB,UAAU,CAAC,YACT,EAAE,UAAU,OAAO;MACrB,SAAS,CAAC,UACR,EAAE,SAAS,KAAc;;EAE/B;;;;;EAOA,IAAI,MAAG;AACL,WAAO,KAAK;EACd;;;;EAIA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;;;;EAIA,IAAI,iBAAc;AAChB,WAAO,KAAK;EACd;;;;EAIA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;;;;EAIA,IAAI,cAAW;AACb,WAAO,KAAK;EACd;EACA,IAAI,aAAU;AACZ,WAAO,KAAK;EACd;;;;EAIA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;;;;EAIA,IAAI,eAAY;AACd,WAAO,KAAK;EACd;EAEA,YACE,SAAwD;AAExD,UAAM,EACJ,MAAM,GACN,KACA,gBAAgB,GAChB,cACA,gBACA,gBACA,YACA,SACA,cACA,gBACA,aACA,UAAU,GACV,eAAe,GACf,iBACA,aACA,YACA,0BACA,oBACA,4BACA,wBACA,iBAAgB,IACd;AAEJ,QAAI,QAAQ,KAAK,CAAC,SAAS,GAAG,GAAG;AAC/B,YAAM,IAAI,UAAU,0CAA0C;;AAGhE,UAAM,YAAY,MAAM,aAAa,GAAG,IAAI;AAC5C,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,wBAAwB,GAAG;;AAG7C,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,eAAe,gBAAgB,KAAK;AACzC,SAAK,kBAAkB;AACvB,QAAI,KAAK,iBAAiB;AACxB,UAAI,CAAC,KAAK,YAAY,CAAC,KAAK,cAAc;AACxC,cAAM,IAAI,UACR,oEAAoE;;AAGxE,UAAI,OAAO,KAAK,oBAAoB,YAAY;AAC9C,cAAM,IAAI,UAAU,qCAAqC;;;AAI7D,QACE,eAAe,UACf,OAAO,eAAe,YACtB;AACA,YAAM,IAAI,UAAU,0CAA0C;;AAEhE,SAAK,cAAc;AAEnB,QACE,gBAAgB,UAChB,OAAO,gBAAgB,YACvB;AACA,YAAM,IAAI,UACR,6CAA6C;;AAGjD,SAAK,eAAe;AACpB,SAAK,kBAAkB,CAAC,CAAC;AAEzB,SAAK,UAAU,oBAAI,IAAG;AACtB,SAAK,WAAW,IAAI,MAAM,GAAG,EAAE,KAAK,MAAS;AAC7C,SAAK,WAAW,IAAI,MAAM,GAAG,EAAE,KAAK,MAAS;AAC7C,SAAK,QAAQ,IAAI,UAAU,GAAG;AAC9B,SAAK,QAAQ,IAAI,UAAU,GAAG;AAC9B,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,QAAQ,MAAM,OAAO,GAAG;AAC7B,SAAK,QAAQ;AACb,SAAK,kBAAkB;AAEvB,QAAI,OAAO,YAAY,YAAY;AACjC,WAAK,WAAW;;AAElB,QAAI,OAAO,iBAAiB,YAAY;AACtC,WAAK,gBAAgB;AACrB,WAAK,YAAY,CAAA;WACZ;AACL,WAAK,gBAAgB;AACrB,WAAK,YAAY;;AAEnB,SAAK,cAAc,CAAC,CAAC,KAAK;AAC1B,SAAK,mBAAmB,CAAC,CAAC,KAAK;AAE/B,SAAK,iBAAiB,CAAC,CAAC;AACxB,SAAK,cAAc,CAAC,CAAC;AACrB,SAAK,2BAA2B,CAAC,CAAC;AAClC,SAAK,6BAA6B,CAAC,CAAC;AACpC,SAAK,yBAAyB,CAAC,CAAC;AAChC,SAAK,mBAAmB,CAAC,CAAC;AAG1B,QAAI,KAAK,iBAAiB,GAAG;AAC3B,UAAI,KAAK,aAAa,GAAG;AACvB,YAAI,CAAC,SAAS,KAAK,QAAQ,GAAG;AAC5B,gBAAM,IAAI,UACR,iDAAiD;;;AAIvD,UAAI,CAAC,SAAS,KAAK,YAAY,GAAG;AAChC,cAAM,IAAI,UACR,sDAAsD;;AAG1D,WAAK,wBAAuB;;AAG9B,SAAK,aAAa,CAAC,CAAC;AACpB,SAAK,qBAAqB,CAAC,CAAC;AAC5B,SAAK,iBAAiB,CAAC,CAAC;AACxB,SAAK,iBAAiB,CAAC,CAAC;AACxB,SAAK,gBACH,SAAS,aAAa,KAAK,kBAAkB,IACzC,gBACA;AACN,SAAK,eAAe,CAAC,CAAC;AACtB,SAAK,MAAM,OAAO;AAClB,QAAI,KAAK,KAAK;AACZ,UAAI,CAAC,SAAS,KAAK,GAAG,GAAG;AACvB,cAAM,IAAI,UACR,6CAA6C;;AAGjD,WAAK,uBAAsB;;AAI7B,QAAI,KAAK,SAAS,KAAK,KAAK,QAAQ,KAAK,KAAK,aAAa,GAAG;AAC5D,YAAM,IAAI,UACR,kDAAkD;;AAGtD,QAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,QAAQ,CAAC,KAAK,UAAU;AACtD,YAAM,OAAO;AACb,UAAI,WAAW,IAAI,GAAG;AACpB,eAAO,IAAI,IAAI;AACf,cAAM,MACJ;AAEF,oBAAY,KAAK,yBAAyB,MAAM,SAAQ;;;EAG9D;;;;;EAMA,gBAAgB,KAAM;AACpB,WAAO,KAAK,QAAQ,IAAI,GAAG,IAAI,WAAW;EAC5C;EAEA,yBAAsB;AACpB,UAAM,OAAO,IAAI,UAAU,KAAK,IAAI;AACpC,UAAM,SAAS,IAAI,UAAU,KAAK,IAAI;AACtC,SAAK,QAAQ;AACb,SAAK,UAAU;AAEf,SAAK,cAAc,CAAC,OAAO,KAAK,QAAQ,KAAK,IAAG,MAAM;AACpD,aAAO,KAAK,IAAI,QAAQ,IAAI,QAAQ;AACpC,WAAK,KAAK,IAAI;AACd,UAAI,QAAQ,KAAK,KAAK,cAAc;AAClC,cAAM,IAAI,WAAW,MAAK;AACxB,cAAI,KAAK,SAAS,KAAK,GAAG;AACxB,iBAAK,QAAQ,KAAK,SAAS,KAAK,GAAQ,QAAQ;;QAEpD,GAAG,MAAM,CAAC;AAGV,YAAI,EAAE,OAAO;AACX,YAAE,MAAK;;;IAIb;AAEA,SAAK,iBAAiB,WAAQ;AAC5B,aAAO,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,IAAG,IAAK;IACnD;AAEA,SAAK,aAAa,CAAC,QAAQ,UAAS;AAClC,UAAI,KAAK,KAAK,GAAG;AACf,cAAM,MAAM,KAAK,KAAK;AACtB,cAAM,QAAQ,OAAO,KAAK;AAE1B,YAAI,CAAC,OAAO,CAAC;AAAO;AACpB,eAAO,MAAM;AACb,eAAO,QAAQ;AACf,eAAO,MAAM,aAAa,OAAM;AAChC,cAAM,MAAM,OAAO,MAAM;AACzB,eAAO,eAAe,MAAM;;IAEhC;AAIA,QAAI,YAAY;AAChB,UAAM,SAAS,MAAK;AAClB,YAAM,IAAI,KAAK,IAAG;AAClB,UAAI,KAAK,gBAAgB,GAAG;AAC1B,oBAAY;AACZ,cAAM,IAAI,WACR,MAAO,YAAY,GACnB,KAAK,aAAa;AAIpB,YAAI,EAAE,OAAO;AACX,YAAE,MAAK;;;AAIX,aAAO;IACT;AAEA,SAAK,kBAAkB,SAAM;AAC3B,YAAM,QAAQ,KAAK,QAAQ,IAAI,GAAG;AAClC,UAAI,UAAU,QAAW;AACvB,eAAO;;AAET,YAAM,MAAM,KAAK,KAAK;AACtB,YAAM,QAAQ,OAAO,KAAK;AAC1B,UAAI,CAAC,OAAO,CAAC,OAAO;AAClB,eAAO;;AAET,YAAM,OAAO,aAAa,OAAM,KAAM;AACtC,aAAO,MAAM;IACf;AAEA,SAAK,WAAW,WAAQ;AACtB,YAAM,IAAI,OAAO,KAAK;AACtB,YAAM,IAAI,KAAK,KAAK;AACpB,aAAO,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,aAAa,OAAM,KAAM,IAAI;IACrD;EACF;;EAGA,iBAAyC,MAAK;EAAE;EAChD,aACE,MAAK;EAAE;EACT,cAMY,MAAK;EAAE;;EAGnB,WAAsC,MAAM;EAE5C,0BAAuB;AACrB,UAAM,QAAQ,IAAI,UAAU,KAAK,IAAI;AACrC,SAAK,kBAAkB;AACvB,SAAK,SAAS;AACd,SAAK,kBAAkB,WAAQ;AAC7B,WAAK,mBAAmB,MAAM,KAAK;AACnC,YAAM,KAAK,IAAI;IACjB;AACA,SAAK,eAAe,CAAC,GAAG,GAAG,MAAM,oBAAmB;AAGlD,UAAI,KAAK,mBAAmB,CAAC,GAAG;AAC9B,eAAO;;AAET,UAAI,CAAC,SAAS,IAAI,GAAG;AACnB,YAAI,iBAAiB;AACnB,cAAI,OAAO,oBAAoB,YAAY;AACzC,kBAAM,IAAI,UAAU,oCAAoC;;AAE1D,iBAAO,gBAAgB,GAAG,CAAC;AAC3B,cAAI,CAAC,SAAS,IAAI,GAAG;AACnB,kBAAM,IAAI,UACR,0DAA0D;;eAGzD;AACL,gBAAM,IAAI,UACR,2HAEwB;;;AAI9B,aAAO;IACT;AACA,SAAK,eAAe,CAClB,OACA,MACA,WACE;AACF,YAAM,KAAK,IAAI;AACf,UAAI,KAAK,UAAU;AACjB,cAAM,UAAU,KAAK,WAAY,MAAM,KAAK;AAC5C,eAAO,KAAK,kBAAkB,SAAS;AACrC,eAAK,OAAO,IAAI;;;AAGpB,WAAK,mBAAmB,MAAM,KAAK;AACnC,UAAI,QAAQ;AACV,eAAO,YAAY;AACnB,eAAO,sBAAsB,KAAK;;IAEtC;EACF;EAEA,kBAA0C,QAAK;EAAE;EACjD,eAIY,CAAC,IAAI,IAAI,QAAO;EAAE;EAC9B,eAKqB,CACnB,IACA,IACA,MACA,oBACE;AACF,QAAI,QAAQ,iBAAiB;AAC3B,YAAM,IAAI,UACR,kEAAkE;;AAGtE,WAAO;EACT;EAEA,CAAC,SAAS,EAAE,aAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC7C,QAAI,KAAK,OAAO;AACd,eAAS,IAAI,KAAK,OAAO,QAAQ;AAC/B,YAAI,CAAC,KAAK,cAAc,CAAC,GAAG;AAC1B;;AAEF,YAAI,cAAc,CAAC,KAAK,SAAS,CAAC,GAAG;AACnC,gBAAM;;AAER,YAAI,MAAM,KAAK,OAAO;AACpB;eACK;AACL,cAAI,KAAK,MAAM,CAAC;;;;EAIxB;EAEA,CAAC,UAAU,EAAE,aAAa,KAAK,WAAU,IAAK,CAAA,GAAE;AAC9C,QAAI,KAAK,OAAO;AACd,eAAS,IAAI,KAAK,OAAO,QAAQ;AAC/B,YAAI,CAAC,KAAK,cAAc,CAAC,GAAG;AAC1B;;AAEF,YAAI,cAAc,CAAC,KAAK,SAAS,CAAC,GAAG;AACnC,gBAAM;;AAER,YAAI,MAAM,KAAK,OAAO;AACpB;eACK;AACL,cAAI,KAAK,MAAM,CAAC;;;;EAIxB;EAEA,cAAc,OAAY;AACxB,WACE,UAAU,UACV,KAAK,QAAQ,IAAI,KAAK,SAAS,KAAK,CAAM,MAAM;EAEpD;;;;;EAMA,CAAC,UAAO;AACN,eAAW,KAAK,KAAK,SAAQ,GAAI;AAC/B,UACE,KAAK,SAAS,CAAC,MAAM,UACrB,KAAK,SAAS,CAAC,MAAM,UACrB,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM,CAAC,KAAK,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;;;EAG/C;;;;;;;EAQA,CAAC,WAAQ;AACP,eAAW,KAAK,KAAK,UAAS,GAAI;AAChC,UACE,KAAK,SAAS,CAAC,MAAM,UACrB,KAAK,SAAS,CAAC,MAAM,UACrB,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM,CAAC,KAAK,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;;;EAG/C;;;;;EAMA,CAAC,OAAI;AACH,eAAW,KAAK,KAAK,SAAQ,GAAI;AAC/B,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,UACE,MAAM,UACN,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM;;;EAGZ;;;;;;;EAQA,CAAC,QAAK;AACJ,eAAW,KAAK,KAAK,UAAS,GAAI;AAChC,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,UACE,MAAM,UACN,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM;;;EAGZ;;;;;EAMA,CAAC,SAAM;AACL,eAAW,KAAK,KAAK,SAAQ,GAAI;AAC/B,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,UACE,MAAM,UACN,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM,KAAK,SAAS,CAAC;;;EAG3B;;;;;;;EAQA,CAAC,UAAO;AACN,eAAW,KAAK,KAAK,UAAS,GAAI;AAChC,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,UACE,MAAM,UACN,CAAC,KAAK,mBAAmB,KAAK,SAAS,CAAC,CAAC,GACzC;AACA,cAAM,KAAK,SAAS,CAAC;;;EAG3B;;;;;EAMA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,QAAO;EACrB;;;;;;EAOA,CAAC,OAAO,WAAW,IAAI;;;;;EAMvB,KACE,IACAC,cAA4C,CAAA,GAAE;AAE9C,eAAW,KAAK,KAAK,SAAQ,GAAI;AAC/B,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,YAAM,QAAQ,KAAK,mBAAmB,CAAC,IACnC,EAAE,uBACF;AACJ,UAAI,UAAU;AAAW;AACzB,UAAI,GAAG,OAAO,KAAK,SAAS,CAAC,GAAQ,IAAI,GAAG;AAC1C,eAAO,KAAK,IAAI,KAAK,SAAS,CAAC,GAAQA,WAAU;;;EAGvD;;;;;;;;;;;;EAaA,QACE,IACA,QAAa,MAAI;AAEjB,eAAW,KAAK,KAAK,SAAQ,GAAI;AAC/B,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,YAAM,QAAQ,KAAK,mBAAmB,CAAC,IACnC,EAAE,uBACF;AACJ,UAAI,UAAU;AAAW;AACzB,SAAG,KAAK,OAAO,OAAO,KAAK,SAAS,CAAC,GAAQ,IAAI;;EAErD;;;;;EAMA,SACE,IACA,QAAa,MAAI;AAEjB,eAAW,KAAK,KAAK,UAAS,GAAI;AAChC,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,YAAM,QAAQ,KAAK,mBAAmB,CAAC,IACnC,EAAE,uBACF;AACJ,UAAI,UAAU;AAAW;AACzB,SAAG,KAAK,OAAO,OAAO,KAAK,SAAS,CAAC,GAAQ,IAAI;;EAErD;;;;;EAMA,aAAU;AACR,QAAI,UAAU;AACd,eAAW,KAAK,KAAK,UAAU,EAAE,YAAY,KAAI,CAAE,GAAG;AACpD,UAAI,KAAK,SAAS,CAAC,GAAG;AACpB,aAAK,QAAQ,KAAK,SAAS,CAAC,GAAQ,QAAQ;AAC5C,kBAAU;;;AAGd,WAAO;EACT;;;;;;;;;;;;;EAcA,KAAK,KAAM;AACT,UAAM,IAAI,KAAK,QAAQ,IAAI,GAAG;AAC9B,QAAI,MAAM;AAAW,aAAO;AAC5B,UAAM,IAAI,KAAK,SAAS,CAAC;AACzB,UAAM,QAAuB,KAAK,mBAAmB,CAAC,IAClD,EAAE,uBACF;AACJ,QAAI,UAAU;AAAW,aAAO;AAChC,UAAM,QAA2B,EAAE,MAAK;AACxC,QAAI,KAAK,SAAS,KAAK,SAAS;AAC9B,YAAM,MAAM,KAAK,MAAM,CAAC;AACxB,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,UAAI,OAAO,OAAO;AAChB,cAAM,SAAS,OAAO,KAAK,IAAG,IAAK;AACnC,cAAM,MAAM;AACZ,cAAM,QAAQ,KAAK,IAAG;;;AAG1B,QAAI,KAAK,QAAQ;AACf,YAAM,OAAO,KAAK,OAAO,CAAC;;AAE5B,WAAO;EACT;;;;;;;;;;;;;;EAeA,OAAI;AACF,UAAM,MAAgC,CAAA;AACtC,eAAW,KAAK,KAAK,SAAS,EAAE,YAAY,KAAI,CAAE,GAAG;AACnD,YAAM,MAAM,KAAK,SAAS,CAAC;AAC3B,YAAM,IAAI,KAAK,SAAS,CAAC;AACzB,YAAM,QAAuB,KAAK,mBAAmB,CAAC,IAClD,EAAE,uBACF;AACJ,UAAI,UAAU,UAAa,QAAQ;AAAW;AAC9C,YAAM,QAA2B,EAAE,MAAK;AACxC,UAAI,KAAK,SAAS,KAAK,SAAS;AAC9B,cAAM,MAAM,KAAK,MAAM,CAAC;AAGxB,cAAM,MAAM,KAAK,IAAG,IAAM,KAAK,QAAQ,CAAC;AACxC,cAAM,QAAQ,KAAK,MAAM,KAAK,IAAG,IAAK,GAAG;;AAE3C,UAAI,KAAK,QAAQ;AACf,cAAM,OAAO,KAAK,OAAO,CAAC;;AAE5B,UAAI,QAAQ,CAAC,KAAK,KAAK,CAAC;;AAE1B,WAAO;EACT;;;;;;;;;;EAWA,KAAK,KAA6B;AAChC,SAAK,MAAK;AACV,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK;AAC9B,UAAI,MAAM,OAAO;AAOf,cAAM,MAAM,KAAK,IAAG,IAAK,MAAM;AAC/B,cAAM,QAAQ,KAAK,IAAG,IAAK;;AAE7B,WAAK,IAAI,KAAK,MAAM,OAAO,KAAK;;EAEpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAgCA,IACE,GACA,GACA,aAA4C,CAAA,GAAE;AAE9C,QAAI,MAAM,QAAW;AACnB,WAAK,OAAO,CAAC;AACb,aAAO;;AAET,UAAM,EACJ,MAAM,KAAK,KACX,OACA,iBAAiB,KAAK,gBACtB,kBAAkB,KAAK,iBACvB,OAAM,IACJ;AACJ,QAAI,EAAE,cAAc,KAAK,YAAW,IAAK;AAEzC,UAAM,OAAO,KAAK,aAChB,GACA,GACA,WAAW,QAAQ,GACnB,eAAe;AAIjB,QAAI,KAAK,gBAAgB,OAAO,KAAK,cAAc;AACjD,UAAI,QAAQ;AACV,eAAO,MAAM;AACb,eAAO,uBAAuB;;AAGhC,WAAK,QAAQ,GAAG,KAAK;AACrB,aAAO;;AAET,QAAI,QAAQ,KAAK,UAAU,IAAI,SAAY,KAAK,QAAQ,IAAI,CAAC;AAC7D,QAAI,UAAU,QAAW;AAEvB,cACE,KAAK,UAAU,IACX,KAAK,QACL,KAAK,MAAM,WAAW,IACtB,KAAK,MAAM,IAAG,IACd,KAAK,UAAU,KAAK,OACpB,KAAK,OAAO,KAAK,IACjB,KAAK;AAEX,WAAK,SAAS,KAAK,IAAI;AACvB,WAAK,SAAS,KAAK,IAAI;AACvB,WAAK,QAAQ,IAAI,GAAG,KAAK;AACzB,WAAK,MAAM,KAAK,KAAK,IAAI;AACzB,WAAK,MAAM,KAAK,IAAI,KAAK;AACzB,WAAK,QAAQ;AACb,WAAK;AACL,WAAK,aAAa,OAAO,MAAM,MAAM;AACrC,UAAI;AAAQ,eAAO,MAAM;AACzB,oBAAc;WACT;AAEL,WAAK,YAAY,KAAK;AACtB,YAAM,SAAS,KAAK,SAAS,KAAK;AAClC,UAAI,MAAM,QAAQ;AAChB,YAAI,KAAK,mBAAmB,KAAK,mBAAmB,MAAM,GAAG;AAC3D,iBAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC;AACpD,gBAAM,EAAE,sBAAsB,EAAC,IAAK;AACpC,cAAI,MAAM,UAAa,CAAC,gBAAgB;AACtC,gBAAI,KAAK,aAAa;AACpB,mBAAK,WAAW,GAAQ,GAAG,KAAK;;AAElC,gBAAI,KAAK,kBAAkB;AACzB,mBAAK,WAAW,KAAK,CAAC,GAAQ,GAAG,KAAK,CAAC;;;mBAGlC,CAAC,gBAAgB;AAC1B,cAAI,KAAK,aAAa;AACpB,iBAAK,WAAW,QAAa,GAAG,KAAK;;AAEvC,cAAI,KAAK,kBAAkB;AACzB,iBAAK,WAAW,KAAK,CAAC,QAAa,GAAG,KAAK,CAAC;;;AAGhD,aAAK,gBAAgB,KAAK;AAC1B,aAAK,aAAa,OAAO,MAAM,MAAM;AACrC,aAAK,SAAS,KAAK,IAAI;AACvB,YAAI,QAAQ;AACV,iBAAO,MAAM;AACb,gBAAM,WACJ,UAAU,KAAK,mBAAmB,MAAM,IACpC,OAAO,uBACP;AACN,cAAI,aAAa;AAAW,mBAAO,WAAW;;iBAEvC,QAAQ;AACjB,eAAO,MAAM;;;AAGjB,QAAI,QAAQ,KAAK,CAAC,KAAK,OAAO;AAC5B,WAAK,uBAAsB;;AAE7B,QAAI,KAAK,OAAO;AACd,UAAI,CAAC,aAAa;AAChB,aAAK,YAAY,OAAO,KAAK,KAAK;;AAEpC,UAAI;AAAQ,aAAK,WAAW,QAAQ,KAAK;;AAE3C,QAAI,CAAC,kBAAkB,KAAK,oBAAoB,KAAK,WAAW;AAC9D,YAAM,KAAK,KAAK;AAChB,UAAI;AACJ,aAAQ,OAAO,IAAI,MAAK,GAAK;AAC3B,aAAK,gBAAgB,GAAG,IAAI;;;AAGhC,WAAO;EACT;;;;;EAMA,MAAG;AACD,QAAI;AACF,aAAO,KAAK,OAAO;AACjB,cAAM,MAAM,KAAK,SAAS,KAAK,KAAK;AACpC,aAAK,OAAO,IAAI;AAChB,YAAI,KAAK,mBAAmB,GAAG,GAAG;AAChC,cAAI,IAAI,sBAAsB;AAC5B,mBAAO,IAAI;;mBAEJ,QAAQ,QAAW;AAC5B,iBAAO;;;;AAIX,UAAI,KAAK,oBAAoB,KAAK,WAAW;AAC3C,cAAM,KAAK,KAAK;AAChB,YAAI;AACJ,eAAQ,OAAO,IAAI,MAAK,GAAK;AAC3B,eAAK,gBAAgB,GAAG,IAAI;;;;EAIpC;EAEA,OAAO,MAAa;AAClB,UAAM,OAAO,KAAK;AAClB,UAAM,IAAI,KAAK,SAAS,IAAI;AAC5B,UAAM,IAAI,KAAK,SAAS,IAAI;AAC5B,QAAI,KAAK,mBAAmB,KAAK,mBAAmB,CAAC,GAAG;AACtD,QAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;eACrC,KAAK,eAAe,KAAK,kBAAkB;AACpD,UAAI,KAAK,aAAa;AACpB,aAAK,WAAW,GAAG,GAAG,OAAO;;AAE/B,UAAI,KAAK,kBAAkB;AACzB,aAAK,WAAW,KAAK,CAAC,GAAG,GAAG,OAAO,CAAC;;;AAGxC,SAAK,gBAAgB,IAAI;AAEzB,QAAI,MAAM;AACR,WAAK,SAAS,IAAI,IAAI;AACtB,WAAK,SAAS,IAAI,IAAI;AACtB,WAAK,MAAM,KAAK,IAAI;;AAEtB,QAAI,KAAK,UAAU,GAAG;AACpB,WAAK,QAAQ,KAAK,QAAQ;AAC1B,WAAK,MAAM,SAAS;WACf;AACL,WAAK,QAAQ,KAAK,MAAM,IAAI;;AAE9B,SAAK,QAAQ,OAAO,CAAC;AACrB,SAAK;AACL,WAAO;EACT;;;;;;;;;;;;;;;;;EAkBA,IAAI,GAAM,aAA4C,CAAA,GAAE;AACtD,UAAM,EAAE,iBAAiB,KAAK,gBAAgB,OAAM,IAClD;AACF,UAAM,QAAQ,KAAK,QAAQ,IAAI,CAAC;AAChC,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI,KAAK,SAAS,KAAK;AAC7B,UACE,KAAK,mBAAmB,CAAC,KACzB,EAAE,yBAAyB,QAC3B;AACA,eAAO;;AAET,UAAI,CAAC,KAAK,SAAS,KAAK,GAAG;AACzB,YAAI,gBAAgB;AAClB,eAAK,eAAe,KAAK;;AAE3B,YAAI,QAAQ;AACV,iBAAO,MAAM;AACb,eAAK,WAAW,QAAQ,KAAK;;AAE/B,eAAO;iBACE,QAAQ;AACjB,eAAO,MAAM;AACb,aAAK,WAAW,QAAQ,KAAK;;eAEtB,QAAQ;AACjB,aAAO,MAAM;;AAEf,WAAO;EACT;;;;;;;;EASA,KAAK,GAAM,cAA8C,CAAA,GAAE;AACzD,UAAM,EAAE,aAAa,KAAK,WAAU,IAAK;AACzC,UAAM,QAAQ,KAAK,QAAQ,IAAI,CAAC;AAChC,QACE,UAAU,UACT,CAAC,cAAc,KAAK,SAAS,KAAK,GACnC;AACA;;AAEF,UAAM,IAAI,KAAK,SAAS,KAAK;AAE7B,WAAO,KAAK,mBAAmB,CAAC,IAAI,EAAE,uBAAuB;EAC/D;EAEA,iBACE,GACA,OACA,SACA,SAAY;AAEZ,UAAM,IAAI,UAAU,SAAY,SAAY,KAAK,SAAS,KAAK;AAC/D,QAAI,KAAK,mBAAmB,CAAC,GAAG;AAC9B,aAAO;;AAGT,UAAM,KAAK,IAAI,GAAE;AACjB,UAAM,EAAE,OAAM,IAAK;AAEnB,YAAQ,iBAAiB,SAAS,MAAM,GAAG,MAAM,OAAO,MAAM,GAAG;MAC/D,QAAQ,GAAG;KACZ;AAED,UAAM,YAAY;MAChB,QAAQ,GAAG;MACX;MACA;;AAGF,UAAM,KAAK,CACTC,IACA,cAAc,UACG;AACjB,YAAM,EAAE,QAAO,IAAK,GAAG;AACvB,YAAM,cAAc,QAAQ,oBAAoBA,OAAM;AACtD,UAAI,QAAQ,QAAQ;AAClB,YAAI,WAAW,CAAC,aAAa;AAC3B,kBAAQ,OAAO,eAAe;AAC9B,kBAAQ,OAAO,aAAa,GAAG,OAAO;AACtC,cAAI;AAAa,oBAAQ,OAAO,oBAAoB;eAC/C;AACL,kBAAQ,OAAO,gBAAgB;;;AAGnC,UAAI,WAAW,CAAC,eAAe,CAAC,aAAa;AAC3C,eAAO,UAAU,GAAG,OAAO,MAAM;;AAGnC,YAAMC,MAAK;AACX,UAAI,KAAK,SAAS,KAAc,MAAM,GAAG;AACvC,YAAID,OAAM,QAAW;AACnB,cAAIC,IAAG,sBAAsB;AAC3B,iBAAK,SAAS,KAAc,IAAIA,IAAG;iBAC9B;AACL,iBAAK,QAAQ,GAAG,OAAO;;eAEpB;AACL,cAAI,QAAQ;AAAQ,oBAAQ,OAAO,eAAe;AAClD,eAAK,IAAI,GAAGD,IAAG,UAAU,OAAO;;;AAGpC,aAAOA;IACT;AAEA,UAAM,KAAK,CAAC,OAAW;AACrB,UAAI,QAAQ,QAAQ;AAClB,gBAAQ,OAAO,gBAAgB;AAC/B,gBAAQ,OAAO,aAAa;;AAE9B,aAAO,UAAU,EAAE;IACrB;AAEA,UAAM,YAAY,CAAC,OAA0B;AAC3C,YAAM,EAAE,QAAO,IAAK,GAAG;AACvB,YAAM,oBACJ,WAAW,QAAQ;AACrB,YAAM,aACJ,qBAAqB,QAAQ;AAC/B,YAAM,WAAW,cAAc,QAAQ;AACvC,YAAMC,MAAK;AACX,UAAI,KAAK,SAAS,KAAc,MAAM,GAAG;AAGvC,cAAM,MAAM,CAAC,YAAYA,IAAG,yBAAyB;AACrD,YAAI,KAAK;AACP,eAAK,QAAQ,GAAG,OAAO;mBACd,CAAC,mBAAmB;AAK7B,eAAK,SAAS,KAAc,IAAIA,IAAG;;;AAGvC,UAAI,YAAY;AACd,YAAI,QAAQ,UAAUA,IAAG,yBAAyB,QAAW;AAC3D,kBAAQ,OAAO,gBAAgB;;AAEjC,eAAOA,IAAG;iBACDA,IAAG,eAAeA,KAAI;AAC/B,cAAM;;IAEV;AAEA,UAAM,QAAQ,CACZ,KACA,QACE;AACF,YAAM,MAAM,KAAK,eAAe,GAAG,GAAG,SAAS;AAC/C,UAAI,OAAO,eAAe,SAAS;AACjC,YAAI,KAAK,CAAAD,OAAK,IAAIA,OAAM,SAAY,SAAYA,EAAC,GAAG,GAAG;;AAKzD,SAAG,OAAO,iBAAiB,SAAS,MAAK;AACvC,YACE,CAAC,QAAQ,oBACT,QAAQ,wBACR;AACA,cAAI,MAAS;AAEb,cAAI,QAAQ,wBAAwB;AAClC,kBAAM,CAAAA,OAAK,GAAGA,IAAG,IAAI;;;MAG3B,CAAC;IACH;AAEA,QAAI,QAAQ;AAAQ,cAAQ,OAAO,kBAAkB;AACrD,UAAM,IAAI,IAAI,QAAQ,KAAK,EAAE,KAAK,IAAI,EAAE;AACxC,UAAM,KAAyB,OAAO,OAAO,GAAG;MAC9C,mBAAmB;MACnB,sBAAsB;MACtB,YAAY;KACb;AAED,QAAI,UAAU,QAAW;AAEvB,WAAK,IAAI,GAAG,IAAI,EAAE,GAAG,UAAU,SAAS,QAAQ,OAAS,CAAE;AAC3D,cAAQ,KAAK,QAAQ,IAAI,CAAC;WACrB;AACL,WAAK,SAAS,KAAK,IAAI;;AAEzB,WAAO;EACT;EAEA,mBAAmB,GAAM;AACvB,QAAI,CAAC,KAAK;AAAiB,aAAO;AAClC,UAAM,IAAI;AACV,WACE,CAAC,CAAC,KACF,aAAa,WACb,EAAE,eAAe,sBAAsB,KACvC,EAAE,6BAA6B;EAEnC;EA+GA,MAAM,MACJ,GACA,eAAgD,CAAA,GAAE;AAElD,UAAM;;MAEJ,aAAa,KAAK;MAClB,iBAAiB,KAAK;MACtB,qBAAqB,KAAK;;MAE1B,MAAM,KAAK;MACX,iBAAiB,KAAK;MACtB,OAAO;MACP,kBAAkB,KAAK;MACvB,cAAc,KAAK;;MAEnB,2BAA2B,KAAK;MAChC,6BAA6B,KAAK;MAClC,mBAAmB,KAAK;MACxB,yBAAyB,KAAK;MAC9B;MACA,eAAe;MACf;MACA;IAAM,IACJ;AAEJ,QAAI,CAAC,KAAK,iBAAiB;AACzB,UAAI;AAAQ,eAAO,QAAQ;AAC3B,aAAO,KAAK,IAAI,GAAG;QACjB;QACA;QACA;QACA;OACD;;AAGH,UAAM,UAAU;MACd;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;;AAGF,QAAI,QAAQ,KAAK,QAAQ,IAAI,CAAC;AAC9B,QAAI,UAAU,QAAW;AACvB,UAAI;AAAQ,eAAO,QAAQ;AAC3B,YAAM,IAAI,KAAK,iBAAiB,GAAG,OAAO,SAAS,OAAO;AAC1D,aAAQ,EAAE,aAAa;WAClB;AAEL,YAAM,IAAI,KAAK,SAAS,KAAK;AAC7B,UAAI,KAAK,mBAAmB,CAAC,GAAG;AAC9B,cAAM,QACJ,cAAc,EAAE,yBAAyB;AAC3C,YAAI,QAAQ;AACV,iBAAO,QAAQ;AACf,cAAI;AAAO,mBAAO,gBAAgB;;AAEpC,eAAO,QAAQ,EAAE,uBAAwB,EAAE,aAAa;;AAK1D,YAAM,UAAU,KAAK,SAAS,KAAK;AACnC,UAAI,CAAC,gBAAgB,CAAC,SAAS;AAC7B,YAAI;AAAQ,iBAAO,QAAQ;AAC3B,aAAK,YAAY,KAAK;AACtB,YAAI,gBAAgB;AAClB,eAAK,eAAe,KAAK;;AAE3B,YAAI;AAAQ,eAAK,WAAW,QAAQ,KAAK;AACzC,eAAO;;AAKT,YAAM,IAAI,KAAK,iBAAiB,GAAG,OAAO,SAAS,OAAO;AAC1D,YAAM,WAAW,EAAE,yBAAyB;AAC5C,YAAM,WAAW,YAAY;AAC7B,UAAI,QAAQ;AACV,eAAO,QAAQ,UAAU,UAAU;AACnC,YAAI,YAAY;AAAS,iBAAO,gBAAgB;;AAElD,aAAO,WAAW,EAAE,uBAAwB,EAAE,aAAa;;EAE/D;EAoCA,MAAM,WACJ,GACA,eAAgD,CAAA,GAAE;AAElD,UAAM,IAAI,MAAM,KAAK,MACnB,GACA,YAI8C;AAEhD,QAAI,MAAM;AAAW,YAAM,IAAI,MAAM,4BAA4B;AACjE,WAAO;EACT;EAqCA,KAAK,GAAM,cAA8C,CAAA,GAAE;AACzD,UAAM,aAAa,KAAK;AACxB,QAAI,CAAC,YAAY;AACf,YAAM,IAAI,MAAM,uCAAuC;;AAEzD,UAAM,EAAE,SAAS,cAAc,GAAG,QAAO,IAAK;AAC9C,UAAM,IAAI,KAAK,IAAI,GAAG,OAAO;AAC7B,QAAI,CAAC,gBAAgB,MAAM;AAAW,aAAO;AAC7C,UAAM,KAAK,WAAW,GAAG,GAAG;MAC1B;MACA;KACqC;AACvC,SAAK,IAAI,GAAG,IAAI,OAAO;AACvB,WAAO;EACT;;;;;;;EAQA,IAAI,GAAMD,cAA4C,CAAA,GAAE;AACtD,UAAM,EACJ,aAAa,KAAK,YAClB,iBAAiB,KAAK,gBACtB,qBAAqB,KAAK,oBAC1B,OAAM,IACJA;AACJ,UAAM,QAAQ,KAAK,QAAQ,IAAI,CAAC;AAChC,QAAI,UAAU,QAAW;AACvB,YAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,YAAM,WAAW,KAAK,mBAAmB,KAAK;AAC9C,UAAI;AAAQ,aAAK,WAAW,QAAQ,KAAK;AACzC,UAAI,KAAK,SAAS,KAAK,GAAG;AACxB,YAAI;AAAQ,iBAAO,MAAM;AAEzB,YAAI,CAAC,UAAU;AACb,cAAI,CAAC,oBAAoB;AACvB,iBAAK,QAAQ,GAAG,QAAQ;;AAE1B,cAAI,UAAU;AAAY,mBAAO,gBAAgB;AACjD,iBAAO,aAAa,QAAQ;eACvB;AACL,cACE,UACA,cACA,MAAM,yBAAyB,QAC/B;AACA,mBAAO,gBAAgB;;AAEzB,iBAAO,aAAa,MAAM,uBAAuB;;aAE9C;AACL,YAAI;AAAQ,iBAAO,MAAM;AAMzB,YAAI,UAAU;AACZ,iBAAO,MAAM;;AAEf,aAAK,YAAY,KAAK;AACtB,YAAI,gBAAgB;AAClB,eAAK,eAAe,KAAK;;AAE3B,eAAO;;eAEA,QAAQ;AACjB,aAAO,MAAM;;EAEjB;EAEA,SAAS,GAAU,GAAQ;AACzB,SAAK,MAAM,CAAC,IAAI;AAChB,SAAK,MAAM,CAAC,IAAI;EAClB;EAEA,YAAY,OAAY;AAStB,QAAI,UAAU,KAAK,OAAO;AACxB,UAAI,UAAU,KAAK,OAAO;AACxB,aAAK,QAAQ,KAAK,MAAM,KAAK;aACxB;AACL,aAAK,SACH,KAAK,MAAM,KAAK,GAChB,KAAK,MAAM,KAAK,CAAU;;AAG9B,WAAK,SAAS,KAAK,OAAO,KAAK;AAC/B,WAAK,QAAQ;;EAEjB;;;;;;EAOA,OAAO,GAAI;AACT,WAAO,KAAK,QAAQ,GAAG,QAAQ;EACjC;EAEA,QAAQ,GAAM,QAA8B;AAC1C,QAAI,UAAU;AACd,QAAI,KAAK,UAAU,GAAG;AACpB,YAAM,QAAQ,KAAK,QAAQ,IAAI,CAAC;AAChC,UAAI,UAAU,QAAW;AACvB,kBAAU;AACV,YAAI,KAAK,UAAU,GAAG;AACpB,eAAK,OAAO,MAAM;eACb;AACL,eAAK,gBAAgB,KAAK;AAC1B,gBAAM,IAAI,KAAK,SAAS,KAAK;AAC7B,cAAI,KAAK,mBAAmB,CAAC,GAAG;AAC9B,cAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;qBACrC,KAAK,eAAe,KAAK,kBAAkB;AACpD,gBAAI,KAAK,aAAa;AACpB,mBAAK,WAAW,GAAQ,GAAG,MAAM;;AAEnC,gBAAI,KAAK,kBAAkB;AACzB,mBAAK,WAAW,KAAK,CAAC,GAAQ,GAAG,MAAM,CAAC;;;AAG5C,eAAK,QAAQ,OAAO,CAAC;AACrB,eAAK,SAAS,KAAK,IAAI;AACvB,eAAK,SAAS,KAAK,IAAI;AACvB,cAAI,UAAU,KAAK,OAAO;AACxB,iBAAK,QAAQ,KAAK,MAAM,KAAK;qBACpB,UAAU,KAAK,OAAO;AAC/B,iBAAK,QAAQ,KAAK,MAAM,KAAK;iBACxB;AACL,kBAAM,KAAK,KAAK,MAAM,KAAK;AAC3B,iBAAK,MAAM,EAAE,IAAI,KAAK,MAAM,KAAK;AACjC,kBAAM,KAAK,KAAK,MAAM,KAAK;AAC3B,iBAAK,MAAM,EAAE,IAAI,KAAK,MAAM,KAAK;;AAEnC,eAAK;AACL,eAAK,MAAM,KAAK,KAAK;;;;AAI3B,QAAI,KAAK,oBAAoB,KAAK,WAAW,QAAQ;AACnD,YAAM,KAAK,KAAK;AAChB,UAAI;AACJ,aAAQ,OAAO,IAAI,MAAK,GAAK;AAC3B,aAAK,gBAAgB,GAAG,IAAI;;;AAGhC,WAAO;EACT;;;;EAKA,QAAK;AACH,WAAO,KAAK,OAAO,QAAQ;EAC7B;EACA,OAAO,QAA8B;AACnC,eAAW,SAAS,KAAK,UAAU,EAAE,YAAY,KAAI,CAAE,GAAG;AACxD,YAAM,IAAI,KAAK,SAAS,KAAK;AAC7B,UAAI,KAAK,mBAAmB,CAAC,GAAG;AAC9B,UAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;aACzC;AACL,cAAM,IAAI,KAAK,SAAS,KAAK;AAC7B,YAAI,KAAK,aAAa;AACpB,eAAK,WAAW,GAAQ,GAAQ,MAAM;;AAExC,YAAI,KAAK,kBAAkB;AACzB,eAAK,WAAW,KAAK,CAAC,GAAQ,GAAQ,MAAM,CAAC;;;;AAKnD,SAAK,QAAQ,MAAK;AAClB,SAAK,SAAS,KAAK,MAAS;AAC5B,SAAK,SAAS,KAAK,MAAS;AAC5B,QAAI,KAAK,SAAS,KAAK,SAAS;AAC9B,WAAK,MAAM,KAAK,CAAC;AACjB,WAAK,QAAQ,KAAK,CAAC;;AAErB,QAAI,KAAK,QAAQ;AACf,WAAK,OAAO,KAAK,CAAC;;AAEpB,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,MAAM,SAAS;AACpB,SAAK,kBAAkB;AACvB,SAAK,QAAQ;AACb,QAAI,KAAK,oBAAoB,KAAK,WAAW;AAC3C,YAAM,KAAK,KAAK;AAChB,UAAI;AACJ,aAAQ,OAAO,IAAI,MAAK,GAAK;AAC3B,aAAK,gBAAgB,GAAG,IAAI;;;EAGlC;;;;ACl2FF,SAAS,OAAO,aAAa;AAE7B,SAAS,qBAAqB;AAE9B,SACE,WACA,WAAW,WACX,aACA,cACA,gBAAgB,WACX;AACP,YAAY,cAAc;AAM1B,SAAS,OAAO,SAAS,UAAU,gBAAgB;;;ACXnD,SAAS,oBAAoB;AAC7B,OAAO,YAAY;AACnB,SAAS,qBAAqB;AAT9B,IAAM,OACJ,OAAO,YAAY,YAAY,UAC3B,UACA;EACE,QAAQ;EACR,QAAQ;;AAiBT,IAAM,WAAW,CACtB,MAEA,CAAC,CAAC,KACF,OAAO,MAAM,aACZ,aAAa,YACZ,aAAa,UACb,WAAW,CAAC,KACZ,WAAW,CAAC;AAKT,IAAM,aAAa,CAAC,MACzB,CAAC,CAAC,KACF,OAAO,MAAM,YACb,aAAa,gBACb,OAAQ,EAAwB,SAAS;AAExC,EAAwB,SAAS,OAAO,SAAS,UAAU;AAKvD,IAAM,aAAa,CAAC,MACzB,CAAC,CAAC,KACF,OAAO,MAAM,YACb,aAAa,gBACb,OAAQ,EAAwB,UAAU,cAC1C,OAAQ,EAAwB,QAAQ;AAE1C,IAAM,MAAM,OAAO,KAAK;AACxB,IAAM,iBAAiB,OAAO,cAAc;AAC5C,IAAM,cAAc,OAAO,YAAY;AACvC,IAAM,eAAe,OAAO,aAAa;AACzC,IAAM,gBAAgB,OAAO,cAAc;AAC3C,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,OAAO,OAAO,MAAM;AAC1B,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,aAAa,OAAO,YAAY;AACtC,IAAM,WAAW,OAAO,UAAU;AAClC,IAAM,UAAU,OAAO,SAAS;AAChC,IAAM,UAAU,OAAO,SAAS;AAChC,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,eAAe,OAAO,cAAc;AAC1C,IAAM,aAAa,OAAO,YAAY;AACtC,IAAM,cAAc,OAAO,aAAa;AACxC,IAAM,aAAa,OAAO,YAAY;AAEtC,IAAM,YAAY,OAAO,WAAW;AAEpC,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,WAAW,OAAO,UAAU;AAClC,IAAM,UAAU,OAAO,SAAS;AAChC,IAAM,WAAW,OAAO,UAAU;AAClC,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,UAAU,OAAO,SAAS;AAChC,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,gBAAgB,OAAO,eAAe;AAC5C,IAAM,YAAY,OAAO,WAAW;AAEpC,IAAM,QAAQ,CAAC,OAA6B,QAAQ,QAAO,EAAG,KAAK,EAAE;AACrE,IAAM,UAAU,CAAC,OAA6B,GAAE;AAMhD,IAAM,WAAW,CAAC,OAChB,OAAO,SAAS,OAAO,YAAY,OAAO;AAE5C,IAAM,oBAAoB,CAAC,MACzB,aAAa,eACZ,CAAC,CAAC,KACD,OAAO,MAAM,YACb,EAAE,eACF,EAAE,YAAY,SAAS,iBACvB,EAAE,cAAc;AAEpB,IAAM,oBAAoB,CAAC,MACzB,CAAC,OAAO,SAAS,CAAC,KAAK,YAAY,OAAO,CAAC;AAqB7C,IAAM,OAAN,MAAU;EACR;EACA;EACA;EACA;EACA,YACE,KACA,MACA,MAAiB;AAEjB,SAAK,MAAM;AACX,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,UAAU,MAAM,IAAI,MAAM,EAAC;AAChC,SAAK,KAAK,GAAG,SAAS,KAAK,OAAO;EACpC;EACA,SAAM;AACJ,SAAK,KAAK,eAAe,SAAS,KAAK,OAAO;EAChD;;;EAGA,YAAY,KAAQ;EAAG;;EAEvB,MAAG;AACD,SAAK,OAAM;AACX,QAAI,KAAK,KAAK;AAAK,WAAK,KAAK,IAAG;EAClC;;AASF,IAAM,kBAAN,cAAiC,KAAO;EACtC,SAAM;AACJ,SAAK,IAAI,eAAe,SAAS,KAAK,WAAW;AACjD,UAAM,OAAM;EACd;EACA,YACE,KACA,MACA,MAAiB;AAEjB,UAAM,KAAK,MAAM,IAAI;AACrB,SAAK,cAAc,QAAM,KAAK,KAAK,SAAS,EAAE;AAC9C,QAAI,GAAG,SAAS,KAAK,WAAW;EAClC;;AA8IF,IAAM,sBAAsB,CAC1B,MACoC,CAAC,CAAC,EAAE;AAE1C,IAAM,oBAAoB,CACxB,MAEA,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,aAAa;AAa5C,IAAO,WAAP,cAOI,aAAY;EAGpB,CAAC,OAAO,IAAa;EACrB,CAAC,MAAM,IAAa;EACpB,CAAC,KAAK,IAAmB,CAAA;EACzB,CAAC,MAAM,IAAa,CAAA;EACpB,CAAC,UAAU;EACX,CAAC,QAAQ;EACT,CAAC,KAAK;EACN,CAAC,OAAO;EACR,CAAC,GAAG,IAAa;EACjB,CAAC,WAAW,IAAa;EACzB,CAAC,YAAY,IAAa;EAC1B,CAAC,MAAM,IAAa;EACpB,CAAC,aAAa,IAAa;EAC3B,CAAC,YAAY,IAAY;EACzB,CAAC,SAAS,IAAa;EACvB,CAAC,MAAM;EACP,CAAC,OAAO,IAAa;EACrB,CAAC,aAAa,IAAY;EAC1B,CAAC,SAAS,IAAa;;;;EAKvB,WAAoB;;;;EAIpB,WAAoB;;;;;;;EAQpB,eACK,MAI+B;AAElC,UAAM,UAAoC,KAAK,CAAC,KAC9C,CAAA;AACF,UAAK;AACL,QAAI,QAAQ,cAAc,OAAO,QAAQ,aAAa,UAAU;AAC9D,YAAM,IAAI,UACR,kDAAkD;IAEtD;AACA,QAAI,oBAAoB,OAAO,GAAG;AAChC,WAAK,UAAU,IAAI;AACnB,WAAK,QAAQ,IAAI;IACnB,WAAW,kBAAkB,OAAO,GAAG;AACrC,WAAK,QAAQ,IAAI,QAAQ;AACzB,WAAK,UAAU,IAAI;IACrB,OAAO;AACL,WAAK,UAAU,IAAI;AACnB,WAAK,QAAQ,IAAI;IACnB;AACA,SAAK,KAAK,IAAI,CAAC,CAAC,QAAQ;AACxB,SAAK,OAAO,IAAI,KAAK,QAAQ,IACxB,IAAI,cAAc,KAAK,QAAQ,CAAC,IACjC;AAGJ,QAAI,WAAW,QAAQ,sBAAsB,MAAM;AACjD,aAAO,eAAe,MAAM,UAAU,EAAE,KAAK,MAAM,KAAK,MAAM,EAAC,CAAE;IACnE;AAEA,QAAI,WAAW,QAAQ,qBAAqB,MAAM;AAChD,aAAO,eAAe,MAAM,SAAS,EAAE,KAAK,MAAM,KAAK,KAAK,EAAC,CAAE;IACjE;AAEA,UAAM,EAAE,OAAM,IAAK;AACnB,QAAI,QAAQ;AACV,WAAK,MAAM,IAAI;AACf,UAAI,OAAO,SAAS;AAClB,aAAK,KAAK,EAAC;MACb,OAAO;AACL,eAAO,iBAAiB,SAAS,MAAM,KAAK,KAAK,EAAC,CAAE;MACtD;IACF;EACF;;;;;;;;;;EAWA,IAAI,eAAY;AACd,WAAO,KAAK,YAAY;EAC1B;;;;EAKA,IAAI,WAAQ;AACV,WAAO,KAAK,QAAQ;EACtB;;;;EAKA,IAAI,SAAS,MAAI;AACf,UAAM,IAAI,MAAM,4CAA4C;EAC9D;;;;EAKA,YAAY,MAAuB;AACjC,UAAM,IAAI,MAAM,4CAA4C;EAC9D;;;;EAKA,IAAI,aAAU;AACZ,WAAO,KAAK,UAAU;EACxB;;;;EAKA,IAAI,WAAW,KAAG;AAChB,UAAM,IAAI,MAAM,8CAA8C;EAChE;;;;EAKA,KAAK,OAAO,IAAC;AACX,WAAO,KAAK,KAAK;EACnB;;;;;;;;EAQA,KAAK,OAAO,EAAE,GAAU;AACtB,SAAK,KAAK,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC;EACjC;;EAGA,CAAC,KAAK,IAAC;AACL,SAAK,OAAO,IAAI;AAChB,SAAK,KAAK,SAAS,KAAK,MAAM,GAAG,MAAM;AACvC,SAAK,QAAQ,KAAK,MAAM,GAAG,MAAM;EACnC;;;;EAKA,IAAI,UAAO;AACT,WAAO,KAAK,OAAO;EACrB;;;;;EAKA,IAAI,QAAQ,GAAC;EAAG;EA0BhB,MACE,OACA,UACA,IAAe;AAEf,QAAI,KAAK,OAAO;AAAG,aAAO;AAC1B,QAAI,KAAK,GAAG;AAAG,YAAM,IAAI,MAAM,iBAAiB;AAEhD,QAAI,KAAK,SAAS,GAAG;AACnB,WAAK,KACH,SACA,OAAO,OACL,IAAI,MAAM,gDAAgD,GAC1D,EAAE,MAAM,uBAAsB,CAAE,CACjC;AAEH,aAAO;IACT;AAEA,QAAI,OAAO,aAAa,YAAY;AAClC,WAAK;AACL,iBAAW;IACb;AAEA,QAAI,CAAC;AAAU,iBAAW;AAE1B,UAAM,KAAK,KAAK,KAAK,IAAI,QAAQ;AAMjC,QAAI,CAAC,KAAK,UAAU,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAChD,UAAI,kBAAkB,KAAK,GAAG;AAE5B,gBAAQ,OAAO,KACb,MAAM,QACN,MAAM,YACN,MAAM,UAAU;MAEpB,WAAW,kBAAkB,KAAK,GAAG;AAEnC,gBAAQ,OAAO,KAAK,KAAK;MAC3B,WAAW,OAAO,UAAU,UAAU;AACpC,cAAM,IAAI,MACR,sDAAsD;MAE1D;IACF;AAIA,QAAI,KAAK,UAAU,GAAG;AAGpB,UAAI,KAAK,OAAO,KAAK,KAAK,YAAY,MAAM;AAAG,aAAK,KAAK,EAAE,IAAI;AAG/D,UAAI,KAAK,OAAO;AAAG,aAAK,KAAK,QAAQ,KAAyB;;AACzD,aAAK,UAAU,EAAE,KAAyB;AAE/C,UAAI,KAAK,YAAY,MAAM;AAAG,aAAK,KAAK,UAAU;AAElD,UAAI;AAAI,WAAG,EAAE;AAEb,aAAO,KAAK,OAAO;IACrB;AAIA,QAAI,CAAE,MAAkC,QAAQ;AAC9C,UAAI,KAAK,YAAY,MAAM;AAAG,aAAK,KAAK,UAAU;AAClD,UAAI;AAAI,WAAG,EAAE;AACb,aAAO,KAAK,OAAO;IACrB;AAIA,QACE,OAAO,UAAU;IAEjB,EAAE,aAAa,KAAK,QAAQ,KAAK,CAAC,KAAK,OAAO,GAAG,WACjD;AAEA,cAAQ,OAAO,KAAK,OAAO,QAAQ;IACrC;AAEA,QAAI,OAAO,SAAS,KAAK,KAAK,KAAK,QAAQ,GAAG;AAE5C,cAAQ,KAAK,OAAO,EAAE,MAAM,KAAK;IACnC;AAGA,QAAI,KAAK,OAAO,KAAK,KAAK,YAAY,MAAM;AAAG,WAAK,KAAK,EAAE,IAAI;AAE/D,QAAI,KAAK,OAAO;AAAG,WAAK,KAAK,QAAQ,KAAyB;;AACzD,WAAK,UAAU,EAAE,KAAyB;AAE/C,QAAI,KAAK,YAAY,MAAM;AAAG,WAAK,KAAK,UAAU;AAElD,QAAI;AAAI,SAAG,EAAE;AAEb,WAAO,KAAK,OAAO;EACrB;;;;;;;;;;;;;;EAeA,KAAK,GAAiB;AACpB,QAAI,KAAK,SAAS;AAAG,aAAO;AAC5B,SAAK,SAAS,IAAI;AAElB,QACE,KAAK,YAAY,MAAM,KACvB,MAAM,KACL,KAAK,IAAI,KAAK,YAAY,GAC3B;AACA,WAAK,cAAc,EAAC;AACpB,aAAO;IACT;AAEA,QAAI,KAAK,UAAU;AAAG,UAAI;AAE1B,QAAI,KAAK,MAAM,EAAE,SAAS,KAAK,CAAC,KAAK,UAAU,GAAG;AAGhD,WAAK,MAAM,IAAI;QACZ,KAAK,QAAQ,IACV,KAAK,MAAM,EAAE,KAAK,EAAE,IACpB,OAAO,OACL,KAAK,MAAM,GACX,KAAK,YAAY,CAAC;;IAG5B;AAEA,UAAM,MAAM,KAAK,IAAI,EAAE,KAAK,MAAM,KAAK,MAAM,EAAE,CAAC,CAAU;AAC1D,SAAK,cAAc,EAAC;AACpB,WAAO;EACT;EAEA,CAAC,IAAI,EAAE,GAAkB,OAAY;AACnC,QAAI,KAAK,UAAU;AAAG,WAAK,WAAW,EAAC;SAClC;AACH,YAAM,IAAI;AACV,UAAI,MAAM,EAAE,UAAU,MAAM;AAAM,aAAK,WAAW,EAAC;eAC1C,OAAO,MAAM,UAAU;AAC9B,aAAK,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC;AAC3B,gBAAQ,EAAE,MAAM,GAAG,CAAC;AACpB,aAAK,YAAY,KAAK;MACxB,OAAO;AACL,aAAK,MAAM,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;AAC9B,gBAAQ,EAAE,SAAS,GAAG,CAAC;AACvB,aAAK,YAAY,KAAK;MACxB;IACF;AAEA,SAAK,KAAK,QAAQ,KAAK;AAEvB,QAAI,CAAC,KAAK,MAAM,EAAE,UAAU,CAAC,KAAK,GAAG;AAAG,WAAK,KAAK,OAAO;AAEzD,WAAO;EACT;EAUA,IACE,OACA,UACA,IAAe;AAEf,QAAI,OAAO,UAAU,YAAY;AAC/B,WAAK;AACL,cAAQ;IACV;AACA,QAAI,OAAO,aAAa,YAAY;AAClC,WAAK;AACL,iBAAW;IACb;AACA,QAAI,UAAU;AAAW,WAAK,MAAM,OAAO,QAAQ;AACnD,QAAI;AAAI,WAAK,KAAK,OAAO,EAAE;AAC3B,SAAK,GAAG,IAAI;AACZ,SAAK,WAAW;AAMhB,QAAI,KAAK,OAAO,KAAK,CAAC,KAAK,MAAM;AAAG,WAAK,cAAc,EAAC;AACxD,WAAO;EACT;;EAGA,CAAC,MAAM,IAAC;AACN,QAAI,KAAK,SAAS;AAAG;AAErB,QAAI,CAAC,KAAK,aAAa,KAAK,CAAC,KAAK,KAAK,EAAE,QAAQ;AAC/C,WAAK,SAAS,IAAI;IACpB;AACA,SAAK,MAAM,IAAI;AACf,SAAK,OAAO,IAAI;AAChB,SAAK,KAAK,QAAQ;AAClB,QAAI,KAAK,MAAM,EAAE;AAAQ,WAAK,KAAK,EAAC;aAC3B,KAAK,GAAG;AAAG,WAAK,cAAc,EAAC;;AACnC,WAAK,KAAK,OAAO;EACxB;;;;;;;;;;EAWA,SAAM;AACJ,WAAO,KAAK,MAAM,EAAC;EACrB;;;;EAKA,QAAK;AACH,SAAK,OAAO,IAAI;AAChB,SAAK,MAAM,IAAI;AACf,SAAK,SAAS,IAAI;EACpB;;;;EAKA,IAAI,YAAS;AACX,WAAO,KAAK,SAAS;EACvB;;;;;EAMA,IAAI,UAAO;AACT,WAAO,KAAK,OAAO;EACrB;;;;EAKA,IAAI,SAAM;AACR,WAAO,KAAK,MAAM;EACpB;EAEA,CAAC,UAAU,EAAE,OAAY;AACvB,QAAI,KAAK,UAAU;AAAG,WAAK,YAAY,KAAK;;AACvC,WAAK,YAAY,KAAM,MAAkC;AAC9D,SAAK,MAAM,EAAE,KAAK,KAAK;EACzB;EAEA,CAAC,WAAW,IAAC;AACX,QAAI,KAAK,UAAU;AAAG,WAAK,YAAY,KAAK;;AAE1C,WAAK,YAAY,KACf,KAAK,MAAM,EAAE,CAAC,EACd;AACJ,WAAO,KAAK,MAAM,EAAE,MAAK;EAC3B;EAEA,CAAC,KAAK,EAAE,UAAmB,OAAK;AAC9B,OAAG;IAAC,SACF,KAAK,UAAU,EAAE,KAAK,WAAW,EAAC,CAAE,KACpC,KAAK,MAAM,EAAE;AAGf,QAAI,CAAC,WAAW,CAAC,KAAK,MAAM,EAAE,UAAU,CAAC,KAAK,GAAG;AAAG,WAAK,KAAK,OAAO;EACvE;EAEA,CAAC,UAAU,EAAE,OAAY;AACvB,SAAK,KAAK,QAAQ,KAAK;AACvB,WAAO,KAAK,OAAO;EACrB;;;;;;EAOA,KAAkC,MAAS,MAAkB;AAC3D,QAAI,KAAK,SAAS;AAAG,aAAO;AAC5B,SAAK,SAAS,IAAI;AAElB,UAAM,QAAQ,KAAK,WAAW;AAC9B,WAAO,QAAQ,CAAA;AACf,QAAI,SAAS,KAAK,UAAU,SAAS,KAAK;AAAQ,WAAK,MAAM;;AACxD,WAAK,MAAM,KAAK,QAAQ;AAC7B,SAAK,cAAc,CAAC,CAAC,KAAK;AAG1B,QAAI,OAAO;AACT,UAAI,KAAK;AAAK,aAAK,IAAG;IACxB,OAAO;AAGL,WAAK,KAAK,EAAE,KACV,CAAC,KAAK,cACF,IAAI,KAAY,MAAyB,MAAM,IAAI,IACnD,IAAI,gBAAuB,MAAyB,MAAM,IAAI,CAAC;AAErE,UAAI,KAAK,KAAK;AAAG,cAAM,MAAM,KAAK,MAAM,EAAC,CAAE;;AACtC,aAAK,MAAM,EAAC;IACnB;AAEA,WAAO;EACT;;;;;;;;;EAUA,OAAoC,MAAO;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,KAAK,CAAAG,OAAKA,GAAE,SAAS,IAAI;AAC/C,QAAI,GAAG;AACL,UAAI,KAAK,KAAK,EAAE,WAAW,GAAG;AAC5B,YAAI,KAAK,OAAO,KAAK,KAAK,aAAa,MAAM,GAAG;AAC9C,eAAK,OAAO,IAAI;QAClB;AACA,aAAK,KAAK,IAAI,CAAA;MAChB;AAAO,aAAK,KAAK,EAAE,OAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC;AACnD,QAAE,OAAM;IACV;EACF;;;;EAKA,YACE,IACA,SAAwC;AAExC,WAAO,KAAK,GAAG,IAAI,OAAO;EAC5B;;;;;;;;;;;;;;;;;;EAmBA,GACE,IACA,SAAwC;AAExC,UAAM,MAAM,MAAM,GAChB,IACA,OAA+B;AAEjC,QAAI,OAAO,QAAQ;AACjB,WAAK,SAAS,IAAI;AAClB,WAAK,aAAa;AAClB,UAAI,CAAC,KAAK,KAAK,EAAE,UAAU,CAAC,KAAK,OAAO,GAAG;AACzC,aAAK,MAAM,EAAC;MACd;IACF,WAAW,OAAO,cAAc,KAAK,YAAY,MAAM,GAAG;AACxD,YAAM,KAAK,UAAU;IACvB,WAAW,SAAS,EAAE,KAAK,KAAK,WAAW,GAAG;AAC5C,YAAM,KAAK,EAAE;AACb,WAAK,mBAAmB,EAAE;IAC5B,WAAW,OAAO,WAAW,KAAK,aAAa,GAAG;AAChD,YAAM,IAAI;AACV,UAAI,KAAK,KAAK;AAAG,cAAM,MAAM,EAAE,KAAK,MAAM,KAAK,aAAa,CAAC,CAAC;;AACzD,UAAE,KAAK,MAAM,KAAK,aAAa,CAAC;IACvC;AACA,WAAO;EACT;;;;EAKA,eACE,IACA,SAAwC;AAExC,WAAO,KAAK,IAAI,IAAI,OAAO;EAC7B;;;;;;;;;EAUA,IACE,IACA,SAAwC;AAExC,UAAM,MAAM,MAAM,IAChB,IACA,OAA+B;AAKjC,QAAI,OAAO,QAAQ;AACjB,WAAK,aAAa,IAAI,KAAK,UAAU,MAAM,EAAE;AAC7C,UACE,KAAK,aAAa,MAAM,KACxB,CAAC,KAAK,SAAS,KACf,CAAC,KAAK,KAAK,EAAE,QACb;AACA,aAAK,OAAO,IAAI;MAClB;IACF;AACA,WAAO;EACT;;;;;;;;;EAUA,mBAA+C,IAAU;AACvD,UAAM,MAAM,MAAM,mBAAmB,EAAiC;AACtE,QAAI,OAAO,UAAU,OAAO,QAAW;AACrC,WAAK,aAAa,IAAI;AACtB,UAAI,CAAC,KAAK,SAAS,KAAK,CAAC,KAAK,KAAK,EAAE,QAAQ;AAC3C,aAAK,OAAO,IAAI;MAClB;IACF;AACA,WAAO;EACT;;;;EAKA,IAAI,aAAU;AACZ,WAAO,KAAK,WAAW;EACzB;EAEA,CAAC,cAAc,IAAC;AACd,QACE,CAAC,KAAK,YAAY,KAClB,CAAC,KAAK,WAAW,KACjB,CAAC,KAAK,SAAS,KACf,KAAK,MAAM,EAAE,WAAW,KACxB,KAAK,GAAG,GACR;AACA,WAAK,YAAY,IAAI;AACrB,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,WAAW;AACrB,WAAK,KAAK,QAAQ;AAClB,UAAI,KAAK,MAAM;AAAG,aAAK,KAAK,OAAO;AACnC,WAAK,YAAY,IAAI;IACvB;EACF;;;;;;;;;;;;;;;;;;;;;;;;;EA0BA,KACE,OACG,MAAmB;AAEtB,UAAM,OAAO,KAAK,CAAC;AAEnB,QACE,OAAO,WACP,OAAO,WACP,OAAO,aACP,KAAK,SAAS,GACd;AACA,aAAO;IACT,WAAW,OAAO,QAAQ;AACxB,aAAO,CAAC,KAAK,UAAU,KAAK,CAAC,OACzB,QACA,KAAK,KAAK,KACT,MAAM,MAAM,KAAK,QAAQ,EAAE,IAAa,CAAC,GAAG,QAC7C,KAAK,QAAQ,EAAE,IAAa;IAClC,WAAW,OAAO,OAAO;AACvB,aAAO,KAAK,OAAO,EAAC;IACtB,WAAW,OAAO,SAAS;AACzB,WAAK,MAAM,IAAI;AAEf,UAAI,CAAC,KAAK,WAAW,KAAK,CAAC,KAAK,SAAS;AAAG,eAAO;AACnD,YAAMC,OAAM,MAAM,KAAK,OAAO;AAC9B,WAAK,mBAAmB,OAAO;AAC/B,aAAOA;IACT,WAAW,OAAO,SAAS;AACzB,WAAK,aAAa,IAAI;AACtB,YAAM,KAAK,OAAO,IAAI;AACtB,YAAMA,OACJ,CAAC,KAAK,MAAM,KAAK,KAAK,UAAU,OAAO,EAAE,SACrC,MAAM,KAAK,SAAS,IAAI,IACxB;AACN,WAAK,cAAc,EAAC;AACpB,aAAOA;IACT,WAAW,OAAO,UAAU;AAC1B,YAAMA,OAAM,MAAM,KAAK,QAAQ;AAC/B,WAAK,cAAc,EAAC;AACpB,aAAOA;IACT,WAAW,OAAO,YAAY,OAAO,aAAa;AAChD,YAAMA,OAAM,MAAM,KAAK,EAAE;AACzB,WAAK,mBAAmB,EAAE;AAC1B,aAAOA;IACT;AAGA,UAAM,MAAM,MAAM,KAAK,IAAc,GAAG,IAAI;AAC5C,SAAK,cAAc,EAAC;AACpB,WAAO;EACT;EAEA,CAAC,QAAQ,EAAE,MAAW;AACpB,eAAW,KAAK,KAAK,KAAK,GAAG;AAC3B,UAAI,EAAE,KAAK,MAAM,IAAa,MAAM;AAAO,aAAK,MAAK;IACvD;AACA,UAAM,MAAM,KAAK,SAAS,IAAI,QAAQ,MAAM,KAAK,QAAQ,IAAI;AAC7D,SAAK,cAAc,EAAC;AACpB,WAAO;EACT;EAEA,CAAC,OAAO,IAAC;AACP,QAAI,KAAK,WAAW;AAAG,aAAO;AAE9B,SAAK,WAAW,IAAI;AACpB,SAAK,WAAW;AAChB,WAAO,KAAK,KAAK,KACZ,MAAM,MAAM,KAAK,QAAQ,EAAC,CAAE,GAAG,QAChC,KAAK,QAAQ,EAAC;EACpB;EAEA,CAAC,QAAQ,IAAC;AACR,QAAI,KAAK,OAAO,GAAG;AACjB,YAAM,OAAO,KAAK,OAAO,EAAE,IAAG;AAC9B,UAAI,MAAM;AACR,mBAAW,KAAK,KAAK,KAAK,GAAG;AAC3B,YAAE,KAAK,MAAM,IAAa;QAC5B;AACA,YAAI,CAAC,KAAK,SAAS;AAAG,gBAAM,KAAK,QAAQ,IAAI;MAC/C;IACF;AAEA,eAAW,KAAK,KAAK,KAAK,GAAG;AAC3B,QAAE,IAAG;IACP;AACA,UAAM,MAAM,MAAM,KAAK,KAAK;AAC5B,SAAK,mBAAmB,KAAK;AAC7B,WAAO;EACT;;;;;EAMA,MAAM,UAAO;AACX,UAAM,MAAwC,OAAO,OAAO,CAAA,GAAI;MAC9D,YAAY;KACb;AACD,QAAI,CAAC,KAAK,UAAU;AAAG,UAAI,aAAa;AAGxC,UAAM,IAAI,KAAK,QAAO;AACtB,SAAK,GAAG,QAAQ,OAAI;AAClB,UAAI,KAAK,CAAC;AACV,UAAI,CAAC,KAAK,UAAU;AAClB,YAAI,cAAe,EAA8B;IACrD,CAAC;AACD,UAAM;AACN,WAAO;EACT;;;;;;;EAQA,MAAM,SAAM;AACV,QAAI,KAAK,UAAU,GAAG;AACpB,YAAM,IAAI,MAAM,6BAA6B;IAC/C;AACA,UAAM,MAAM,MAAM,KAAK,QAAO;AAC9B,WACE,KAAK,QAAQ,IACT,IAAI,KAAK,EAAE,IACX,OAAO,OAAO,KAAiB,IAAI,UAAU;EAErD;;;;EAKA,MAAM,UAAO;AACX,WAAO,IAAI,QAAc,CAACC,WAAS,WAAU;AAC3C,WAAK,GAAG,WAAW,MAAM,OAAO,IAAI,MAAM,kBAAkB,CAAC,CAAC;AAC9D,WAAK,GAAG,SAAS,QAAM,OAAO,EAAE,CAAC;AACjC,WAAK,GAAG,OAAO,MAAMA,UAAO,CAAE;IAChC,CAAC;EACH;;;;;;EAOA,CAAC,OAAO,aAAa,IAAC;AAGpB,SAAK,SAAS,IAAI;AAClB,QAAI,UAAU;AACd,UAAM,OAAO,YAAgD;AAC3D,WAAK,MAAK;AACV,gBAAU;AACV,aAAO,EAAE,OAAO,QAAW,MAAM,KAAI;IACvC;AACA,UAAM,OAAO,MAA2C;AACtD,UAAI;AAAS,eAAO,KAAI;AACxB,YAAM,MAAM,KAAK,KAAI;AACrB,UAAI,QAAQ;AAAM,eAAO,QAAQ,QAAQ,EAAE,MAAM,OAAO,OAAO,IAAG,CAAE;AAEpE,UAAI,KAAK,GAAG;AAAG,eAAO,KAAI;AAE1B,UAAIA;AACJ,UAAI;AACJ,YAAM,QAAQ,CAAC,OAAe;AAC5B,aAAK,IAAI,QAAQ,MAAM;AACvB,aAAK,IAAI,OAAO,KAAK;AACrB,aAAK,IAAI,WAAW,SAAS;AAC7B,aAAI;AACJ,eAAO,EAAE;MACX;AACA,YAAM,SAAS,CAAC,UAAgB;AAC9B,aAAK,IAAI,SAAS,KAAK;AACvB,aAAK,IAAI,OAAO,KAAK;AACrB,aAAK,IAAI,WAAW,SAAS;AAC7B,aAAK,MAAK;AACV,QAAAA,UAAQ,EAAE,OAAO,MAAM,CAAC,CAAC,KAAK,GAAG,EAAC,CAAE;MACtC;AACA,YAAM,QAAQ,MAAK;AACjB,aAAK,IAAI,SAAS,KAAK;AACvB,aAAK,IAAI,QAAQ,MAAM;AACvB,aAAK,IAAI,WAAW,SAAS;AAC7B,aAAI;AACJ,QAAAA,UAAQ,EAAE,MAAM,MAAM,OAAO,OAAS,CAAE;MAC1C;AACA,YAAM,YAAY,MAAM,MAAM,IAAI,MAAM,kBAAkB,CAAC;AAC3D,aAAO,IAAI,QAA+B,CAACC,MAAK,QAAO;AACrD,iBAAS;AACT,QAAAD,YAAUC;AACV,aAAK,KAAK,WAAW,SAAS;AAC9B,aAAK,KAAK,SAAS,KAAK;AACxB,aAAK,KAAK,OAAO,KAAK;AACtB,aAAK,KAAK,QAAQ,MAAM;MAC1B,CAAC;IACH;AAEA,WAAO;MACL;MACA,OAAO;MACP,QAAQ;MACR,CAAC,OAAO,aAAa,IAAC;AACpB,eAAO;MACT;;EAEJ;;;;;;;EAQA,CAAC,OAAO,QAAQ,IAAC;AAGf,SAAK,SAAS,IAAI;AAClB,QAAI,UAAU;AACd,UAAM,OAAO,MAAiC;AAC5C,WAAK,MAAK;AACV,WAAK,IAAI,OAAO,IAAI;AACpB,WAAK,IAAI,WAAW,IAAI;AACxB,WAAK,IAAI,OAAO,IAAI;AACpB,gBAAU;AACV,aAAO,EAAE,MAAM,MAAM,OAAO,OAAS;IACvC;AAEA,UAAM,OAAO,MAAkC;AAC7C,UAAI;AAAS,eAAO,KAAI;AACxB,YAAM,QAAQ,KAAK,KAAI;AACvB,aAAO,UAAU,OAAO,KAAI,IAAK,EAAE,MAAM,OAAO,MAAK;IACvD;AAEA,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,KAAK,OAAO,IAAI;AACrB,SAAK,KAAK,WAAW,IAAI;AAEzB,WAAO;MACL;MACA,OAAO;MACP,QAAQ;MACR,CAAC,OAAO,QAAQ,IAAC;AACf,eAAO;MACT;;EAEJ;;;;;;;;;;;;;EAcA,QAAQ,IAAY;AAClB,QAAI,KAAK,SAAS,GAAG;AACnB,UAAI;AAAI,aAAK,KAAK,SAAS,EAAE;;AACxB,aAAK,KAAK,SAAS;AACxB,aAAO;IACT;AAEA,SAAK,SAAS,IAAI;AAClB,SAAK,SAAS,IAAI;AAGlB,SAAK,MAAM,EAAE,SAAS;AACtB,SAAK,YAAY,IAAI;AAErB,UAAM,KAAK;AAGX,QAAI,OAAO,GAAG,UAAU,cAAc,CAAC,KAAK,MAAM;AAAG,SAAG,MAAK;AAE7D,QAAI;AAAI,WAAK,KAAK,SAAS,EAAE;;AAExB,WAAK,KAAK,SAAS;AAExB,WAAO;EACT;;;;;;;;EASA,WAAW,WAAQ;AACjB,WAAO;EACT;;;;ADrzCF,IAAM,eAAe,IAAI;AA2EzB,IAAM,YAAqB;EACzB;EACA,SAAS;EACT;EACA;EACA;EACA,UAAU;IACR;IACA;IACA;IACA;;;AAKJ,IAAM,eAAe,CAAC,aACpB,CAAC,YAAY,aAAa,aAAa,aAAa,WAClD,YACA;EACE,GAAG;EACH,GAAG;EACH,UAAU;IACR,GAAG,UAAU;IACb,GAAI,SAAS,YAAY,CAAA;;;AAKjC,IAAM,iBAAiB;AACvB,IAAM,aAAa,CAAC,aAClB,SAAS,QAAQ,OAAO,IAAI,EAAE,QAAQ,gBAAgB,MAAM;AAG9D,IAAM,YAAY;AAElB,IAAM,UAAU;AAChB,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,SAAS;AACf,IAAM,OAAO;AAab,IAAM,eAAe,CAAC;AAGtB,IAAM,iBAAiB;AAEvB,IAAM,eAAe;AAErB,IAAM,UAAU;AAGhB,IAAM,SAAS;AAGf,IAAM,cAAc;AAEpB,IAAM,cAAc;AAEpB,IAAM,WAAW,UAAU,SAAS;AACpC,IAAM,WAAW;AAEjB,IAAM,YAAY,CAAC,MACjB,EAAE,OAAM,IAAK,QACX,EAAE,YAAW,IAAK,QAClB,EAAE,eAAc,IAAK,QACrB,EAAE,kBAAiB,IAAK,QACxB,EAAE,cAAa,IAAK,QACpB,EAAE,SAAQ,IAAK,SACf,EAAE,OAAM,IAAK,QACb;AAGJ,IAAM,iBAAiB,oBAAI,IAAG;AAC9B,IAAM,YAAY,CAAC,MAAa;AAC9B,QAAM,IAAI,eAAe,IAAI,CAAC;AAC9B,MAAI;AAAG,WAAO;AACd,QAAM,IAAI,EAAE,UAAU,MAAM;AAC5B,iBAAe,IAAI,GAAG,CAAC;AACvB,SAAO;AACT;AAEA,IAAM,uBAAuB,oBAAI,IAAG;AACpC,IAAM,kBAAkB,CAAC,MAAa;AACpC,QAAM,IAAI,qBAAqB,IAAI,CAAC;AACpC,MAAI;AAAG,WAAO;AACd,QAAM,IAAI,UAAU,EAAE,YAAW,CAAE;AACnC,uBAAqB,IAAI,GAAG,CAAC;AAC7B,SAAO;AACT;AAoBM,IAAO,eAAP,cAA4B,SAAwB;EACxD,cAAA;AACE,UAAM,EAAE,KAAK,IAAG,CAAE;EACpB;;AAmBI,IAAO,gBAAP,cAA6B,SAA4B;EAC7D,YAAY,UAAkB,KAAK,MAAI;AACrC,UAAM;MACJ;;MAEA,iBAAiB,OAAK,EAAE,SAAS;KAClC;EACH;;AAUF,IAAM,WAAW,OAAO,qBAAqB;AAevC,IAAgB,WAAhB,MAAwB;;;;;;;;;;EAU5B;;;;;;EAMA;;;;;;EAMA;;;;;;EAMA;;;;;EAKA;;;;;EAMA,QAAiB;;EAajB;;EAGA;EACA,IAAI,MAAG;AACL,WAAO,KAAK;EACd;EACA;EACA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;EACA;EACA,IAAI,QAAK;AACP,WAAO,KAAK;EACd;EACA;EACA,IAAI,MAAG;AACL,WAAO,KAAK;EACd;EACA;EACA,IAAI,MAAG;AACL,WAAO,KAAK;EACd;EACA;EACA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;EACA;EACA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;EACA;EACA,IAAI,MAAG;AACL,WAAO,KAAK;EACd;EACA;EACA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;EACA;EACA,IAAI,SAAM;AACR,WAAO,KAAK;EACd;EACA;EACA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;EACA;EACA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;EACA;EACA,IAAI,UAAO;AACT,WAAO,KAAK;EACd;EACA;EACA,IAAI,cAAW;AACb,WAAO,KAAK;EACd;EACA;EACA,IAAI,QAAK;AACP,WAAO,KAAK;EACd;EACA;EACA,IAAI,QAAK;AACP,WAAO,KAAK;EACd;EACA;EACA,IAAI,QAAK;AACP,WAAO,KAAK;EACd;EACA;EACA,IAAI,YAAS;AACX,WAAO,KAAK;EACd;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;EAQA,IAAI,aAAU;AACZ,YAAQ,KAAK,UAAU,MAAM,SAAQ;EACvC;;;;;;;EAQA,IAAI,OAAI;AACN,WAAO,KAAK;EACd;;;;;;;EAQA,YACE,MACA,OAAe,SACfC,OACA,OACA,QACA,UACA,MAAc;AAEd,SAAK,OAAO;AACZ,SAAK,aAAa,SAAS,gBAAgB,IAAI,IAAI,UAAU,IAAI;AACjE,SAAK,QAAQ,OAAO;AACpB,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,OAAOA,SAAQ;AACpB,SAAK,YAAY;AACjB,SAAK,YAAY,KAAK;AACtB,SAAK,YAAY,KAAK;AACtB,SAAK,iBAAiB,KAAK;AAC3B,SAAK,SAAS,KAAK;AACnB,QAAI,KAAK,QAAQ;AACf,WAAK,MAAM,KAAK,OAAO;IACzB,OAAO;AACL,WAAK,MAAM,aAAa,KAAK,EAAE;IACjC;EACF;;;;;;EAOA,QAAK;AACH,QAAI,KAAK,WAAW;AAAW,aAAO,KAAK;AAC3C,QAAI,CAAC,KAAK;AAAQ,aAAQ,KAAK,SAAS;AACxC,WAAQ,KAAK,SAAS,KAAK,OAAO,MAAK,IAAK;EAC9C;;;;EAkBA,gBAAa;AACX,WAAO,KAAK;EACd;;;;EAKA,QAAQC,OAAa;AACnB,QAAI,CAACA,OAAM;AACT,aAAO;IACT;AACA,UAAM,WAAW,KAAK,cAAcA,KAAI;AACxC,UAAM,MAAMA,MAAK,UAAU,SAAS,MAAM;AAC1C,UAAM,WAAW,IAAI,MAAM,KAAK,QAAQ;AACxC,UAAM,SACJ,WACE,KAAK,QAAQ,QAAQ,EAAE,cAAc,QAAQ,IAC7C,KAAK,cAAc,QAAQ;AAC/B,WAAO;EACT;EAEA,cAAc,UAAkB;AAC9B,QAAI,IAAc;AAClB,eAAW,QAAQ,UAAU;AAC3B,UAAI,EAAE,MAAM,IAAI;IAClB;AACA,WAAO;EACT;;;;;;;;;EAUA,WAAQ;AACN,UAAM,SAAS,KAAK,UAAU,IAAI,IAAI;AACtC,QAAI,QAAQ;AACV,aAAO;IACT;AACA,UAAM,WAAqB,OAAO,OAAO,CAAA,GAAI,EAAE,aAAa,EAAC,CAAE;AAC/D,SAAK,UAAU,IAAI,MAAM,QAAQ;AACjC,SAAK,SAAS,CAAC;AACf,WAAO;EACT;;;;;;;;;;;;;;EAeA,MAAM,UAAkB,MAAe;AACrC,QAAI,aAAa,MAAM,aAAa,KAAK;AACvC,aAAO;IACT;AACA,QAAI,aAAa,MAAM;AACrB,aAAO,KAAK,UAAU;IACxB;AAGA,UAAM,WAAW,KAAK,SAAQ;AAC9B,UAAM,OACJ,KAAK,SAAS,gBAAgB,QAAQ,IAAI,UAAU,QAAQ;AAC9D,eAAW,KAAK,UAAU;AACxB,UAAI,EAAE,eAAe,MAAM;AACzB,eAAO;MACT;IACF;AAKA,UAAM,IAAI,KAAK,SAAS,KAAK,MAAM;AACnC,UAAM,WACJ,KAAK,YAAY,KAAK,YAAY,IAAI,WAAW;AACnD,UAAM,SAAS,KAAK,SAAS,UAAU,SAAS;MAC9C,GAAG;MACH,QAAQ;MACR;KACD;AAED,QAAI,CAAC,KAAK,WAAU,GAAI;AACtB,aAAO,SAAS;IAClB;AAIA,aAAS,KAAK,MAAM;AACpB,WAAO;EACT;;;;;EAMA,WAAQ;AACN,QAAI,KAAK;AAAO,aAAO;AACvB,QAAI,KAAK,cAAc,QAAW;AAChC,aAAO,KAAK;IACd;AACA,UAAM,OAAO,KAAK;AAClB,UAAM,IAAI,KAAK;AACf,QAAI,CAAC,GAAG;AACN,aAAQ,KAAK,YAAY,KAAK;IAChC;AACA,UAAM,KAAK,EAAE,SAAQ;AACrB,WAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,KAAK,KAAK,OAAO;EACnD;;;;;;;EAQA,gBAAa;AACX,QAAI,KAAK,QAAQ;AAAK,aAAO,KAAK,SAAQ;AAC1C,QAAI,KAAK;AAAO,aAAO;AACvB,QAAI,KAAK,mBAAmB;AAAW,aAAO,KAAK;AACnD,UAAM,OAAO,KAAK;AAClB,UAAM,IAAI,KAAK;AACf,QAAI,CAAC,GAAG;AACN,aAAQ,KAAK,iBAAiB,KAAK,cAAa;IAClD;AACA,UAAM,KAAK,EAAE,cAAa;AAC1B,WAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,KAAK,OAAO;EAC9C;;;;EAKA,WAAQ;AACN,QAAI,KAAK,cAAc,QAAW;AAChC,aAAO,KAAK;IACd;AACA,UAAM,OAAO,KAAK;AAClB,UAAM,IAAI,KAAK;AACf,QAAI,CAAC,GAAG;AACN,aAAQ,KAAK,YAAY,KAAK;IAChC;AACA,UAAM,KAAK,EAAE,SAAQ;AACrB,UAAM,KAAK,MAAM,CAAC,EAAE,SAAS,KAAK,KAAK,OAAO;AAC9C,WAAQ,KAAK,YAAY;EAC3B;;;;;;;EAQA,gBAAa;AACX,QAAI,KAAK,mBAAmB;AAAW,aAAO,KAAK;AACnD,QAAI,KAAK,QAAQ;AAAK,aAAQ,KAAK,iBAAiB,KAAK,SAAQ;AACjE,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAMC,KAAI,KAAK,SAAQ,EAAG,QAAQ,OAAO,GAAG;AAC5C,UAAI,aAAa,KAAKA,EAAC,GAAG;AACxB,eAAQ,KAAK,iBAAiB,OAAOA,EAAC;MACxC,OAAO;AACL,eAAQ,KAAK,iBAAiBA;MAChC;IACF;AACA,UAAM,IAAI,KAAK;AACf,UAAM,OAAO,EAAE,cAAa;AAC5B,UAAM,MAAM,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,KAAK,OAAO,KAAK;AAC1D,WAAQ,KAAK,iBAAiB;EAChC;;;;;;;;EASA,YAAS;AACP,YAAQ,KAAK,QAAQ,UAAU;EACjC;EAEA,OAAO,MAAU;AACf,WAAO,KAAK,KAAK,IAAI,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;;MACD,KAAK,SAAQ,IAAK,WACxC;;EAGN;;;;EAKA,SAAM;AACJ,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,cAAW;AACT,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,oBAAiB;AACf,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,gBAAa;AACX,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,SAAM;AACJ,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,WAAQ;AACN,YAAQ,KAAK,QAAQ,UAAU;EACjC;;;;EAKA,iBAAc;AACZ,YAAQ,KAAK,QAAQ,WAAW;EAClC;;;;;;;;EASA,cAAW;AACT,WAAO,KAAK,QAAQ,eAAe,OAAO;EAC5C;;;;;;;;;EAUA,iBAAc;AACZ,WAAO,KAAK;EACd;;;;;;;;;EAUA,iBAAc;AACZ,WAAO,KAAK;EACd;;;;;;;;;EAUA,gBAAa;AACX,UAAM,WAAW,KAAK,SAAQ;AAC9B,WAAO,SAAS,MAAM,GAAG,SAAS,WAAW;EAC/C;;;;;;;;EASA,cAAW;AACT,QAAI,KAAK;AAAa,aAAO;AAC7B,QAAI,CAAC,KAAK;AAAQ,aAAO;AAEzB,UAAM,OAAO,KAAK,QAAQ;AAC1B,WAAO,EACJ,SAAS,WAAW,SAAS,SAC9B,KAAK,QAAQ,eACb,KAAK,QAAQ;EAEjB;;;;;EAMA,gBAAa;AACX,WAAO,CAAC,EAAE,KAAK,QAAQ;EACzB;;;;;;EAOA,WAAQ;AACN,WAAO,CAAC,EAAE,KAAK,QAAQ;EACzB;;;;;;;;;;;;EAaA,QAAQ,GAAS;AACf,WAAO,CAAC,KAAK,SACT,KAAK,eAAe,UAAU,CAAC,IAC/B,KAAK,eAAe,gBAAgB,CAAC;EAC3C;;;;;;;;;EAUA,MAAM,WAAQ;AACZ,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ;AACV,aAAO;IACT;AACA,QAAI,CAAC,KAAK,YAAW,GAAI;AACvB,aAAO;IACT;AAGA,QAAI,CAAC,KAAK,QAAQ;AAChB,aAAO;IACT;AAEA,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,IAAI,SAAS,SAAS,KAAK,SAAQ,CAAE;AAC7D,YAAM,cAAc,MAAM,KAAK,OAAO,SAAQ,IAAK,QAAQ,IAAI;AAC/D,UAAI,YAAY;AACd,eAAQ,KAAK,cAAc;MAC7B;IACF,SAAS,IAAI;AACX,WAAK,cAAe,GAA6B,IAAI;AACrD,aAAO;IACT;EACF;;;;EAKA,eAAY;AACV,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ;AACV,aAAO;IACT;AACA,QAAI,CAAC,KAAK,YAAW,GAAI;AACvB,aAAO;IACT;AAGA,QAAI,CAAC,KAAK,QAAQ;AAChB,aAAO;IACT;AAEA,QAAI;AACF,YAAM,OAAO,KAAK,IAAI,aAAa,KAAK,SAAQ,CAAE;AAClD,YAAM,aAAa,KAAK,OAAO,aAAY,GAAI,QAAQ,IAAI;AAC3D,UAAI,YAAY;AACd,eAAQ,KAAK,cAAc;MAC7B;IACF,SAAS,IAAI;AACX,WAAK,cAAe,GAA6B,IAAI;AACrD,aAAO;IACT;EACF;EAEA,gBAAgB,UAAkB;AAEhC,SAAK,SAAS;AAEd,aAAS,IAAI,SAAS,aAAa,IAAI,SAAS,QAAQ,KAAK;AAC3D,YAAM,IAAI,SAAS,CAAC;AACpB,UAAI;AAAG,UAAE,YAAW;IACtB;EACF;EAEA,cAAW;AAET,QAAI,KAAK,QAAQ;AAAQ;AACzB,SAAK,SAAS,KAAK,QAAQ,UAAU;AACrC,SAAK,oBAAmB;EAC1B;EAEA,sBAAmB;AAEjB,UAAM,WAAW,KAAK,SAAQ;AAC9B,aAAS,cAAc;AACvB,eAAW,KAAK,UAAU;AACxB,QAAE,YAAW;IACf;EACF;EAEA,mBAAgB;AACd,SAAK,SAAS;AACd,SAAK,aAAY;EACnB;;EAGA,eAAY;AAMV,QAAI,KAAK,QAAQ;AAAS;AAE1B,QAAI,IAAI,KAAK;AAGb,SAAK,IAAI,UAAU;AAAO,WAAK;AAC/B,SAAK,QAAQ,IAAI;AACjB,SAAK,oBAAmB;EAC1B;EAEA,aAAa,OAAe,IAAE;AAE5B,QAAI,SAAS,aAAa,SAAS,SAAS;AAC1C,WAAK,aAAY;IACnB,WAAW,SAAS,UAAU;AAC5B,WAAK,YAAW;IAClB,OAAO;AACL,WAAK,SAAQ,EAAG,cAAc;IAChC;EACF;EAEA,WAAW,OAAe,IAAE;AAG1B,QAAI,SAAS,WAAW;AAEtB,YAAM,IAAI,KAAK;AACf,QAAE,aAAY;IAChB,WAAW,SAAS,UAAU;AAE5B,WAAK,YAAW;IAClB;EACF;EAEA,cAAc,OAAe,IAAE;AAC7B,QAAI,MAAM,KAAK;AACf,WAAO;AACP,QAAI,SAAS;AAAU,aAAO;AAE9B,QAAI,SAAS,YAAY,SAAS,WAAW;AAG3C,aAAO;IACT;AACA,SAAK,QAAQ;AAIb,QAAI,SAAS,aAAa,KAAK,QAAQ;AACrC,WAAK,OAAO,aAAY;IAC1B;EAEF;EAEA,iBAAiB,GAAW,GAAW;AACrC,WACE,KAAK,0BAA0B,GAAG,CAAC,KACnC,KAAK,oBAAoB,GAAG,CAAC;EAEjC;EAEA,oBAAoB,GAAW,GAAW;AAExC,UAAM,OAAO,UAAU,CAAC;AACxB,UAAM,QAAQ,KAAK,SAAS,EAAE,MAAM,MAAM,EAAE,QAAQ,KAAI,CAAE;AAC1D,UAAM,OAAO,MAAM,QAAQ;AAC3B,QAAI,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS;AACxD,YAAM,SAAS;IACjB;AACA,MAAE,QAAQ,KAAK;AACf,MAAE;AACF,WAAO;EACT;EAEA,0BAA0B,GAAW,GAAW;AAC9C,aAAS,IAAI,EAAE,aAAa,IAAI,EAAE,QAAQ,KAAK;AAC7C,YAAM,SAAS,EAAE,CAAC;AAClB,YAAM,OACJ,KAAK,SAAS,gBAAgB,EAAE,IAAI,IAAI,UAAU,EAAE,IAAI;AAC1D,UAAI,SAAS,OAAQ,YAAY;AAC/B;MACF;AAEA,aAAO,KAAK,qBAAqB,GAAG,QAAS,GAAG,CAAC;IACnD;EACF;EAEA,qBACE,GACA,GACA,OACA,GAAW;AAEX,UAAM,IAAI,EAAE;AAEZ,MAAE,QAAS,EAAE,QAAQ,eAAgB,UAAU,CAAC;AAEhD,QAAI,MAAM,EAAE;AAAM,QAAE,OAAO,EAAE;AAI7B,QAAI,UAAU,EAAE,aAAa;AAC3B,UAAI,UAAU,EAAE,SAAS;AAAG,UAAE,IAAG;;AAC5B,UAAE,OAAO,OAAO,CAAC;AACtB,QAAE,QAAQ,CAAC;IACb;AACA,MAAE;AACF,WAAO;EACT;;;;;;;;;;;;;;;;EAiBA,MAAM,QAAK;AACT,SAAK,KAAK,QAAQ,YAAY,GAAG;AAC/B,UAAI;AACF,aAAK,WAAW,MAAM,KAAK,IAAI,SAAS,MAAM,KAAK,SAAQ,CAAE,CAAC;AAC9D,eAAO;MACT,SAAS,IAAI;AACX,aAAK,WAAY,GAA6B,IAAI;MACpD;IACF;EACF;;;;EAKA,YAAS;AACP,SAAK,KAAK,QAAQ,YAAY,GAAG;AAC/B,UAAI;AACF,aAAK,WAAW,KAAK,IAAI,UAAU,KAAK,SAAQ,CAAE,CAAC;AACnD,eAAO;MACT,SAAS,IAAI;AACX,aAAK,WAAY,GAA6B,IAAI;MACpD;IACF;EACF;EAEA,WAAW,IAAS;AAClB,UAAM,EACJ,OACA,SACA,WACA,aACA,SACA,QACA,OACA,SACA,KACA,KACA,KACA,MACA,OACA,SACA,OACA,MACA,MACA,IAAG,IACD;AACJ,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,aAAa;AAClB,SAAK,eAAe;AACpB,SAAK,WAAW;AAChB,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,UAAM,OAAO,UAAU,EAAE;AAEzB,SAAK,QAAS,KAAK,QAAQ,eAAgB,OAAO;AAClD,QAAI,SAAS,WAAW,SAAS,SAAS,SAAS,OAAO;AACxD,WAAK,SAAS;IAChB;EACF;EAEA,eAGc,CAAA;EACd,qBAA8B;EAC9B,iBAAiB,UAAgB;AAC/B,SAAK,qBAAqB;AAC1B,UAAM,MAAM,KAAK,aAAa,MAAK;AACnC,SAAK,aAAa,SAAS;AAC3B,QAAI,QAAQ,QAAM,GAAG,MAAM,QAAQ,CAAC;EACtC;;;;;;;;;;;;;;;;;EAkBA,UACE,IACA,aAAsB,OAAK;AAE3B,QAAI,CAAC,KAAK,WAAU,GAAI;AACtB,UAAI;AAAY,WAAG,MAAM,CAAA,CAAE;;AACtB,uBAAe,MAAM,GAAG,MAAM,CAAA,CAAE,CAAC;AACtC;IACF;AAEA,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,GAAI;AACxB,YAAM,IAAI,SAAS,MAAM,GAAG,SAAS,WAAW;AAChD,UAAI;AAAY,WAAG,MAAM,CAAC;;AACrB,uBAAe,MAAM,GAAG,MAAM,CAAC,CAAC;AACrC;IACF;AAGA,SAAK,aAAa,KAAK,EAAE;AACzB,QAAI,KAAK,oBAAoB;AAC3B;IACF;AACA,SAAK,qBAAqB;AAI1B,UAAM,WAAW,KAAK,SAAQ;AAC9B,SAAK,IAAI,QAAQ,UAAU,EAAE,eAAe,KAAI,GAAI,CAAC,IAAI,YAAW;AAClE,UAAI,IAAI;AACN,aAAK,aAAc,GAA6B,IAAI;AACpD,iBAAS,cAAc;MACzB,OAAO;AAGL,mBAAW,KAAK,SAAS;AACvB,eAAK,iBAAiB,GAAG,QAAQ;QACnC;AACA,aAAK,gBAAgB,QAAQ;MAC/B;AACA,WAAK,iBAAiB,SAAS,MAAM,GAAG,SAAS,WAAW,CAAC;AAC7D;IACF,CAAC;EACH;EAEA;;;;;;;;;;EAWA,MAAM,UAAO;AACX,QAAI,CAAC,KAAK,WAAU,GAAI;AACtB,aAAO,CAAA;IACT;AAEA,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,GAAI;AACxB,aAAO,SAAS,MAAM,GAAG,SAAS,WAAW;IAC/C;AAIA,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,uBAAuB;AAC9B,YAAM,KAAK;IACb,OAAO;AAEL,UAAIC,YAAsB,MAAK;MAAE;AAEjC,WAAK,wBAAwB,IAAI,QAC/B,SAAQA,YAAU,GAAI;AAExB,UAAI;AACF,mBAAW,KAAK,MAAM,KAAK,IAAI,SAAS,QAAQ,UAAU;UACxD,eAAe;SAChB,GAAG;AACF,eAAK,iBAAiB,GAAG,QAAQ;QACnC;AACA,aAAK,gBAAgB,QAAQ;MAC/B,SAAS,IAAI;AACX,aAAK,aAAc,GAA6B,IAAI;AACpD,iBAAS,cAAc;MACzB;AACA,WAAK,wBAAwB;AAC7B,MAAAA,UAAO;IACT;AACA,WAAO,SAAS,MAAM,GAAG,SAAS,WAAW;EAC/C;;;;EAKA,cAAW;AACT,QAAI,CAAC,KAAK,WAAU,GAAI;AACtB,aAAO,CAAA;IACT;AAEA,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,KAAK,cAAa,GAAI;AACxB,aAAO,SAAS,MAAM,GAAG,SAAS,WAAW;IAC/C;AAIA,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI;AACF,iBAAW,KAAK,KAAK,IAAI,YAAY,UAAU;QAC7C,eAAe;OAChB,GAAG;AACF,aAAK,iBAAiB,GAAG,QAAQ;MACnC;AACA,WAAK,gBAAgB,QAAQ;IAC/B,SAAS,IAAI;AACX,WAAK,aAAc,GAA6B,IAAI;AACpD,eAAS,cAAc;IACzB;AACA,WAAO,SAAS,MAAM,GAAG,SAAS,WAAW;EAC/C;EAEA,aAAU;AACR,QAAI,KAAK,QAAQ;AAAU,aAAO;AAClC,UAAM,OAAO,OAAO,KAAK;AAGzB,QAAI,EAAE,SAAS,WAAW,SAAS,SAAS,SAAS,QAAQ;AAC3D,aAAO;IACT;AAEA,WAAO;EACT;EAEA,WACE,MACA,YAAqC;AAErC,YACG,KAAK,QAAQ,WAAW,SACzB,EAAE,KAAK,QAAQ,aACf,CAAC,KAAK,IAAI,IAAI,MACb,CAAC,cAAc,WAAW,IAAI;EAEnC;;;;;;;;;;EAWA,MAAM,WAAQ;AACZ,QAAI,KAAK;AAAW,aAAO,KAAK;AAChC,SAAK,cAAc,cAAc,UAAU,KAAK;AAAO,aAAO;AAC9D,QAAI;AACF,YAAM,KAAK,MAAM,KAAK,IAAI,SAAS,SAAS,KAAK,SAAQ,CAAE;AAC3D,aAAQ,KAAK,YAAY,KAAK,QAAQ,EAAE;IAC1C,SAAS,GAAG;AACV,WAAK,iBAAgB;IACvB;EACF;;;;EAKA,eAAY;AACV,QAAI,KAAK;AAAW,aAAO,KAAK;AAChC,SAAK,cAAc,cAAc,UAAU,KAAK;AAAO,aAAO;AAC9D,QAAI;AACF,YAAM,KAAK,KAAK,IAAI,aAAa,KAAK,SAAQ,CAAE;AAChD,aAAQ,KAAK,YAAY,KAAK,QAAQ,EAAE;IAC1C,SAAS,GAAG;AACV,WAAK,iBAAgB;IACvB;EACF;;;;;;;EAQA,CAAC,QAAQ,EAAE,QAAgB;AACzB,QAAI,WAAW;AAAM;AACrB,WAAO,QAAQ;AACf,SAAK,QAAQ;AAEb,UAAM,UAAU,oBAAI,IAAc,CAAA,CAAE;AACpC,QAAI,KAAK,CAAA;AACT,QAAI,IAAc;AAClB,WAAO,KAAK,EAAE,QAAQ;AACpB,cAAQ,IAAI,CAAC;AACb,QAAE,YAAY,GAAG,KAAK,KAAK,GAAG;AAC9B,QAAE,iBAAiB,GAAG,KAAK,GAAG;AAC9B,UAAI,EAAE;AACN,SAAG,KAAK,IAAI;IACd;AAEA,QAAI;AACJ,WAAO,KAAK,EAAE,UAAU,CAAC,QAAQ,IAAI,CAAC,GAAG;AACvC,QAAE,YAAY;AACd,QAAE,iBAAiB;AACnB,UAAI,EAAE;IACR;EACF;;AASI,IAAO,YAAP,MAAO,mBAAkB,SAAQ;;;;EAIrC,MAAY;;;;EAIZ,WAAmB;;;;;;;EAQnB,YACE,MACA,OAAe,SACfH,OACA,OACA,QACA,UACA,MAAc;AAEd,UAAM,MAAM,MAAMA,OAAM,OAAO,QAAQ,UAAU,IAAI;EACvD;;;;EAKA,SAAS,MAAc,OAAe,SAAS,OAAiB,CAAA,GAAE;AAChE,WAAO,IAAI,WACT,MACA,MACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,IAAI;EAER;;;;EAKA,cAAcC,OAAY;AACxB,WAAO,MAAM,MAAMA,KAAI,EAAE;EAC3B;;;;EAKA,QAAQ,UAAgB;AACtB,eAAW,WAAW,SAAS,YAAW,CAAE;AAC5C,QAAI,aAAa,KAAK,KAAK,MAAM;AAC/B,aAAO,KAAK;IACd;AAEA,eAAW,CAAC,SAASD,KAAI,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACxD,UAAI,KAAK,SAAS,UAAU,OAAO,GAAG;AACpC,eAAQ,KAAK,MAAM,QAAQ,IAAIA;MACjC;IACF;AAEA,WAAQ,KAAK,MAAM,QAAQ,IAAI,IAAI,gBACjC,UACA,IAAI,EACJ;EACJ;;;;EAKA,SAAS,UAAkB,UAAkB,KAAK,KAAK,MAAI;AAIzD,eAAW,SACR,YAAW,EACX,QAAQ,OAAO,IAAI,EACnB,QAAQ,gBAAgB,MAAM;AACjC,WAAO,aAAa;EACtB;;AAQI,IAAO,YAAP,MAAO,mBAAkB,SAAQ;;;;EAIrC,WAAgB;;;;EAIhB,MAAW;;;;;;;EAQX,YACE,MACA,OAAe,SACfA,OACA,OACA,QACA,UACA,MAAc;AAEd,UAAM,MAAM,MAAMA,OAAM,OAAO,QAAQ,UAAU,IAAI;EACvD;;;;EAKA,cAAcC,OAAY;AACxB,WAAOA,MAAK,WAAW,GAAG,IAAI,MAAM;EACtC;;;;EAKA,QAAQ,WAAiB;AACvB,WAAO,KAAK;EACd;;;;EAKA,SAAS,MAAc,OAAe,SAAS,OAAiB,CAAA,GAAE;AAChE,WAAO,IAAI,WACT,MACA,MACA,KAAK,MACL,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,IAAI;EAER;;AA0CI,IAAgB,iBAAhB,MAA8B;;;;EAIlC;;;;EAIA;;;;EAIA;;;;EAIA;EACA;EACA;EACA;;;;;;EAMA;EASA;;;;;;;;EASA,YACE,MAAoB,QAAQ,IAAG,GAC/B,UACAG,MACA,EACE,QACA,oBAAoB,KAAK,MACzB,IAAAC,MAAK,UAAS,IACI,CAAA,GAAE;AAEtB,SAAK,MAAM,aAAaA,GAAE;AAC1B,QAAI,eAAe,OAAO,IAAI,WAAW,SAAS,GAAG;AACnD,YAAM,cAAc,GAAG;IACzB;AAGA,UAAM,UAAU,SAAS,QAAQ,GAAG;AACpC,SAAK,QAAQ,uBAAO,OAAO,IAAI;AAC/B,SAAK,WAAW,KAAK,cAAc,OAAO;AAC1C,SAAK,gBAAgB,IAAI,aAAY;AACrC,SAAK,qBAAqB,IAAI,aAAY;AAC1C,SAAK,YAAY,IAAI,cAAc,iBAAiB;AAEpD,UAAM,QAAQ,QAAQ,UAAU,KAAK,SAAS,MAAM,EAAE,MAAMD,IAAG;AAE/D,QAAI,MAAM,WAAW,KAAK,CAAC,MAAM,CAAC,GAAG;AACnC,YAAM,IAAG;IACX;AAEA,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,UACR,oDAAoD;IAExD;AAEA,SAAK,SAAS;AACd,SAAK,OAAO,KAAK,QAAQ,KAAK,GAAG;AACjC,SAAK,MAAM,KAAK,QAAQ,IAAI,KAAK;AACjC,QAAI,OAAiB,KAAK;AAC1B,QAAI,MAAM,MAAM,SAAS;AACzB,UAAM,UAAU,SAAS;AACzB,QAAI,MAAM,KAAK;AACf,QAAI,WAAW;AACf,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI;AACV,aAAO,KAAK,MAAM,MAAM;QACtB,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,OAAO;QAC9C,eAAe,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG;QAC/C,UAAW,QAAQ,WAAW,KAAK,WAAW;OAC/C;AACD,iBAAW;IACb;AACA,SAAK,MAAM;EACb;;;;EAKA,MAAMH,QAAsB,KAAK,KAAG;AAClC,QAAI,OAAOA,UAAS,UAAU;AAC5B,MAAAA,QAAO,KAAK,IAAI,QAAQA,KAAI;IAC9B;AACA,WAAOA,MAAK,MAAK;EACnB;;;;;;;EAyBA,gBAAa;AACX,WAAO,KAAK;EACd;;;;;;;;;;EAWA,WAAW,OAAe;AAGxB,QAAI,IAAI;AACR,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,CAAC,KAAK,MAAM;AAAK;AACrB,UAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK;AACtB,UAAI,KAAK,WAAW,CAAC,GAAG;AACtB;MACF;IACF;AACA,UAAM,SAAS,KAAK,cAAc,IAAI,CAAC;AACvC,QAAI,WAAW,QAAW;AACxB,aAAO;IACT;AACA,UAAM,SAAS,KAAK,IAAI,QAAQ,CAAC,EAAE,SAAQ;AAC3C,SAAK,cAAc,IAAI,GAAG,MAAM;AAChC,WAAO;EACT;;;;;;;;;;;;EAaA,gBAAgB,OAAe;AAG7B,QAAI,IAAI;AACR,aAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,CAAC,KAAK,MAAM;AAAK;AACrB,UAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK;AACtB,UAAI,KAAK,WAAW,CAAC,GAAG;AACtB;MACF;IACF;AACA,UAAM,SAAS,KAAK,mBAAmB,IAAI,CAAC;AAC5C,QAAI,WAAW,QAAW;AACxB,aAAO;IACT;AACA,UAAM,SAAS,KAAK,IAAI,QAAQ,CAAC,EAAE,cAAa;AAChD,SAAK,mBAAmB,IAAI,GAAG,MAAM;AACrC,WAAO;EACT;;;;EAKA,SAAS,QAA2B,KAAK,KAAG;AAC1C,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,WAAO,MAAM,SAAQ;EACvB;;;;;EAMA,cAAc,QAA2B,KAAK,KAAG;AAC/C,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,WAAO,MAAM,cAAa;EAC5B;;;;EAKA,SAAS,QAA2B,KAAK,KAAG;AAC1C,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,WAAO,MAAM;EACf;;;;EAKA,QAAQ,QAA2B,KAAK,KAAG;AACzC,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,YAAQ,MAAM,UAAU,OAAO,SAAQ;EACzC;EAkCA,MAAM,QACJ,QAAwD,KAAK,KAC7D,OAAmC;IACjC,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EAAE,cAAa,IAAK;AAC1B,QAAI,CAAC,MAAM,WAAU,GAAI;AACvB,aAAO,CAAA;IACT,OAAO;AACL,YAAM,IAAI,MAAM,MAAM,QAAO;AAC7B,aAAO,gBAAgB,IAAI,EAAE,IAAI,OAAK,EAAE,IAAI;IAC9C;EACF;EAsBA,YACE,QAAwD,KAAK,KAC7D,OAAmC;IACjC,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EAAE,gBAAgB,KAAI,IAAK;AACjC,QAAI,CAAC,MAAM,WAAU,GAAI;AACvB,aAAO,CAAA;IACT,WAAW,eAAe;AACxB,aAAO,MAAM,YAAW;IAC1B,OAAO;AACL,aAAO,MAAM,YAAW,EAAG,IAAI,OAAK,EAAE,IAAI;IAC5C;EACF;;;;;;;;;;;;;;;;EAiBA,MAAM,MACJ,QAA2B,KAAK,KAAG;AAEnC,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,WAAO,MAAM,MAAK;EACpB;;;;EAKA,UAAU,QAA2B,KAAK,KAAG;AAC3C,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC;AACA,WAAO,MAAM,UAAS;EACxB;EAkCA,MAAM,SACJ,QAAwD,KAAK,KAC7D,EAAE,cAAa,IAAiC;IAC9C,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,sBAAgB,MAAM;AACtB,cAAQ,KAAK;IACf;AACA,UAAM,IAAI,MAAM,MAAM,SAAQ;AAC9B,WAAO,gBAAgB,IAAI,GAAG,SAAQ;EACxC;EAuBA,aACE,QAAwD,KAAK,KAC7D,EAAE,cAAa,IAAiC;IAC9C,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,sBAAgB,MAAM;AACtB,cAAQ,KAAK;IACf;AACA,UAAM,IAAI,MAAM,aAAY;AAC5B,WAAO,gBAAgB,IAAI,GAAG,SAAQ;EACxC;EAiCA,MAAM,SACJ,QAAwD,KAAK,KAC7D,EAAE,cAAa,IAAiC;IAC9C,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,sBAAgB,MAAM;AACtB,cAAQ,KAAK;IACf;AACA,UAAM,IAAI,MAAM,MAAM,SAAQ;AAC9B,WAAO,gBAAgB,IAAI,GAAG,SAAQ;EACxC;EAoBA,aACE,QAAwD,KAAK,KAC7D,EAAE,cAAa,IAAiC;IAC9C,eAAe;KAChB;AAED,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,sBAAgB,MAAM;AACtB,cAAQ,KAAK;IACf;AACA,UAAM,IAAI,MAAM,aAAY;AAC5B,WAAO,gBAAgB,IAAI,GAAG,SAAQ;EACxC;EA6BA,MAAM,KACJ,QAAyC,KAAK,KAC9C,OAAoB,CAAA,GAAE;AAEtB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EACJ,gBAAgB,MAChB,SAAS,OACT,QAAAK,SACA,WAAU,IACR;AACJ,UAAM,UAAiC,CAAA;AACvC,QAAI,CAACA,WAAUA,QAAO,KAAK,GAAG;AAC5B,cAAQ,KAAK,gBAAgB,QAAQ,MAAM,SAAQ,CAAE;IACvD;AACA,UAAM,OAAO,oBAAI,IAAG;AACpB,UAAMC,QAAO,CACX,KACA,OACE;AACF,WAAK,IAAI,GAAG;AACZ,UAAI,UAAU,CAAC,IAAI,YAAW;AAE5B,YAAI,IAAI;AACN,iBAAO,GAAG,EAAE;QACd;AAEA,YAAI,MAAM,QAAQ;AAClB,YAAI,CAAC;AAAK,iBAAO,GAAE;AACnB,cAAM,OAAO,MAAK;AAChB,cAAI,EAAE,QAAQ,GAAG;AACf,eAAE;UACJ;QACF;AACA,mBAAW,KAAK,SAAS;AACvB,cAAI,CAACD,WAAUA,QAAO,CAAC,GAAG;AACxB,oBAAQ,KAAK,gBAAgB,IAAI,EAAE,SAAQ,CAAE;UAC/C;AACA,cAAI,UAAU,EAAE,eAAc,GAAI;AAChC,cAAE,SAAQ,EACP,KAAK,OAAM,GAAG,UAAS,IAAK,EAAE,MAAK,IAAK,CAAE,EAC1C,KAAK,OACJ,GAAG,WAAW,MAAM,UAAU,IAAIC,MAAK,GAAG,IAAI,IAAI,KAAI,CAAE;UAE9D,OAAO;AACL,gBAAI,EAAE,WAAW,MAAM,UAAU,GAAG;AAClC,cAAAA,MAAK,GAAG,IAAI;YACd,OAAO;AACL,mBAAI;YACN;UACF;QACF;MACF,GAAG,IAAI;IACT;AAEA,UAAM,QAAQ;AACd,WAAO,IAAI,QAA+B,CAAC,KAAK,QAAO;AACrD,MAAAA,MAAK,OAAO,QAAK;AAEf,YAAI;AAAI,iBAAO,IAAI,EAAE;AAErB,YAAI,OAAgC;MACtC,CAAC;IACH,CAAC;EACH;EA6BA,SACE,QAAyC,KAAK,KAC9C,OAAoB,CAAA,GAAE;AAEtB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EACJ,gBAAgB,MAChB,SAAS,OACT,QAAAD,SACA,WAAU,IACR;AACJ,UAAM,UAAiC,CAAA;AACvC,QAAI,CAACA,WAAUA,QAAO,KAAK,GAAG;AAC5B,cAAQ,KAAK,gBAAgB,QAAQ,MAAM,SAAQ,CAAE;IACvD;AACA,UAAM,OAAO,oBAAI,IAAc,CAAC,KAAK,CAAC;AACtC,eAAW,OAAO,MAAM;AACtB,YAAM,UAAU,IAAI,YAAW;AAC/B,iBAAW,KAAK,SAAS;AACvB,YAAI,CAACA,WAAUA,QAAO,CAAC,GAAG;AACxB,kBAAQ,KAAK,gBAAgB,IAAI,EAAE,SAAQ,CAAE;QAC/C;AACA,YAAI,IAA0B;AAC9B,YAAI,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE,WAAW,IAAI,EAAE,aAAY;AAAM;AACzC,cAAI,EAAE,UAAS;AAAI,cAAE,UAAS;QAChC;AACA,YAAI,EAAE,WAAW,MAAM,UAAU,GAAG;AAClC,eAAK,IAAI,CAAC;QACZ;MACF;IACF;AACA,WAAO;EACT;;;;;;;;;;EAWA,CAAC,OAAO,aAAa,IAAC;AACpB,WAAO,KAAK,QAAO;EACrB;EA+BA,QACE,QAAyC,KAAK,KAC9C,UAAuB,CAAA,GAAE;AAKzB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,gBAAU;AACV,cAAQ,KAAK;IACf;AACA,WAAO,KAAK,OAAO,OAAO,OAAO,EAAE,OAAO,aAAa,EAAC;EAC1D;;;;;;EAOA,CAAC,OAAO,QAAQ,IAAC;AACf,WAAO,KAAK,YAAW;EACzB;EAuBA,CAAC,YACC,QAAyC,KAAK,KAC9C,OAAoB,CAAA,GAAE;AAEtB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EACJ,gBAAgB,MAChB,SAAS,OACT,QAAAA,SACA,WAAU,IACR;AACJ,QAAI,CAACA,WAAUA,QAAO,KAAK,GAAG;AAC5B,YAAM,gBAAgB,QAAQ,MAAM,SAAQ;IAC9C;AACA,UAAM,OAAO,oBAAI,IAAc,CAAC,KAAK,CAAC;AACtC,eAAW,OAAO,MAAM;AACtB,YAAM,UAAU,IAAI,YAAW;AAC/B,iBAAW,KAAK,SAAS;AACvB,YAAI,CAACA,WAAUA,QAAO,CAAC,GAAG;AACxB,gBAAM,gBAAgB,IAAI,EAAE,SAAQ;QACtC;AACA,YAAI,IAA0B;AAC9B,YAAI,EAAE,eAAc,GAAI;AACtB,cAAI,EAAE,WAAW,IAAI,EAAE,aAAY;AAAM;AACzC,cAAI,EAAE,UAAS;AAAI,cAAE,UAAS;QAChC;AACA,YAAI,EAAE,WAAW,MAAM,UAAU,GAAG;AAClC,eAAK,IAAI,CAAC;QACZ;MACF;IACF;EACF;EA2BA,OACE,QAAyC,KAAK,KAC9C,OAAoB,CAAA,GAAE;AAEtB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EACJ,gBAAgB,MAChB,SAAS,OACT,QAAAA,SACA,WAAU,IACR;AACJ,UAAM,UAAU,IAAI,SAA4B,EAAE,YAAY,KAAI,CAAE;AACpE,QAAI,CAACA,WAAUA,QAAO,KAAK,GAAG;AAC5B,cAAQ,MAAM,gBAAgB,QAAQ,MAAM,SAAQ,CAAE;IACxD;AACA,UAAM,OAAO,oBAAI,IAAG;AACpB,UAAM,QAAoB,CAAC,KAAK;AAChC,QAAI,aAAa;AACjB,UAAME,WAAU,MAAK;AACnB,UAAI,SAAS;AACb,aAAO,CAAC,QAAQ;AACd,cAAM,MAAM,MAAM,MAAK;AACvB,YAAI,CAAC,KAAK;AACR,cAAI,eAAe;AAAG,oBAAQ,IAAG;AACjC;QACF;AAEA;AACA,aAAK,IAAI,GAAG;AAEZ,cAAM,YAAY,CAChB,IACA,SACA,eAAwB,UACtB;AAEF,cAAI;AAAI,mBAAO,QAAQ,KAAK,SAAS,EAAE;AAEvC,cAAI,UAAU,CAAC,cAAc;AAC3B,kBAAMC,YAA4C,CAAA;AAClD,uBAAW,KAAK,SAAS;AACvB,kBAAI,EAAE,eAAc,GAAI;AACtB,gBAAAA,UAAS,KACP,EACG,SAAQ,EACR,KAAK,CAAC,MACL,GAAG,UAAS,IAAK,EAAE,MAAK,IAAK,CAAC,CAC/B;cAEP;YACF;AACA,gBAAIA,UAAS,QAAQ;AACnB,sBAAQ,IAAIA,SAAQ,EAAE,KAAK,MACzB,UAAU,MAAM,SAAS,IAAI,CAAC;AAEhC;YACF;UACF;AAEA,qBAAW,KAAK,SAAS;AACvB,gBAAI,MAAM,CAACH,WAAUA,QAAO,CAAC,IAAI;AAC/B,kBAAI,CAAC,QAAQ,MAAM,gBAAgB,IAAI,EAAE,SAAQ,CAAE,GAAG;AACpD,yBAAS;cACX;YACF;UACF;AAEA;AACA,qBAAW,KAAK,SAAS;AACvB,kBAAM,IAAI,EAAE,eAAc,KAAM;AAChC,gBAAI,EAAE,WAAW,MAAM,UAAU,GAAG;AAClC,oBAAM,KAAK,CAAC;YACd;UACF;AACA,cAAI,UAAU,CAAC,QAAQ,SAAS;AAC9B,oBAAQ,KAAK,SAASE,QAAO;UAC/B,WAAW,CAACE,OAAM;AAChB,YAAAF,SAAO;UACT;QACF;AAGA,YAAIE,QAAO;AACX,YAAI,UAAU,WAAW,IAAI;AAC7B,QAAAA,QAAO;MACT;IACF;AACA,IAAAF,SAAO;AACP,WAAO;EACT;EA8BA,WACE,QAAyC,KAAK,KAC9C,OAAoB,CAAA,GAAE;AAEtB,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ,KAAK,IAAI,QAAQ,KAAK;IAChC,WAAW,EAAE,iBAAiB,WAAW;AACvC,aAAO;AACP,cAAQ,KAAK;IACf;AACA,UAAM,EACJ,gBAAgB,MAChB,SAAS,OACT,QAAAF,SACA,WAAU,IACR;AACJ,UAAM,UAAU,IAAI,SAA4B,EAAE,YAAY,KAAI,CAAE;AACpE,UAAM,OAAO,oBAAI,IAAG;AACpB,QAAI,CAACA,WAAUA,QAAO,KAAK,GAAG;AAC5B,cAAQ,MAAM,gBAAgB,QAAQ,MAAM,SAAQ,CAAE;IACxD;AACA,UAAM,QAAoB,CAAC,KAAK;AAChC,QAAI,aAAa;AACjB,UAAME,WAAU,MAAK;AACnB,UAAI,SAAS;AACb,aAAO,CAAC,QAAQ;AACd,cAAM,MAAM,MAAM,MAAK;AACvB,YAAI,CAAC,KAAK;AACR,cAAI,eAAe;AAAG,oBAAQ,IAAG;AACjC;QACF;AACA;AACA,aAAK,IAAI,GAAG;AAEZ,cAAM,UAAU,IAAI,YAAW;AAC/B,mBAAW,KAAK,SAAS;AACvB,cAAI,CAACF,WAAUA,QAAO,CAAC,GAAG;AACxB,gBAAI,CAAC,QAAQ,MAAM,gBAAgB,IAAI,EAAE,SAAQ,CAAE,GAAG;AACpD,uBAAS;YACX;UACF;QACF;AACA;AACA,mBAAW,KAAK,SAAS;AACvB,cAAI,IAA0B;AAC9B,cAAI,EAAE,eAAc,GAAI;AACtB,gBAAI,EAAE,WAAW,IAAI,EAAE,aAAY;AAAM;AACzC,gBAAI,EAAE,UAAS;AAAI,gBAAE,UAAS;UAChC;AACA,cAAI,EAAE,WAAW,MAAM,UAAU,GAAG;AAClC,kBAAM,KAAK,CAAC;UACd;QACF;MACF;AACA,UAAI,UAAU,CAAC,QAAQ;AAAS,gBAAQ,KAAK,SAASE,QAAO;IAC/D;AACA,IAAAA,SAAO;AACP,WAAO;EACT;EAEA,MAAMP,QAAsB,KAAK,KAAG;AAClC,UAAM,SAAS,KAAK;AACpB,SAAK,MAAM,OAAOA,UAAS,WAAW,KAAK,IAAI,QAAQA,KAAI,IAAIA;AAC/D,SAAK,IAAI,QAAQ,EAAE,MAAM;EAC3B;;AAwEI,IAAO,kBAAP,cAA+B,eAAc;;;;EAIjD,MAAY;EAEZ,YACE,MAAoB,QAAQ,IAAG,GAC/B,OAAuB,CAAA,GAAE;AAEzB,UAAM,EAAE,SAAS,KAAI,IAAK;AAC1B,UAAM,KAAK,OAAO,MAAM,EAAE,GAAG,MAAM,OAAM,CAAE;AAC3C,SAAK,SAAS;AACd,aAAS,IAA0B,KAAK,KAAK,GAAG,IAAI,EAAE,QAAQ;AAC5D,QAAE,SAAS,KAAK;IAClB;EACF;;;;EAKA,cAAc,KAAW;AAIvB,WAAO,MAAM,MAAM,GAAG,EAAE,KAAK,YAAW;EAC1C;;;;EAKA,QAAQI,KAAW;AACjB,WAAO,IAAI,UACT,KAAK,UACL,OACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAA,IAAE,CAAE;EAEV;;;;EAKA,WAAW,GAAS;AAClB,WACE,EAAE,WAAW,GAAG,KAAK,EAAE,WAAW,IAAI,KAAK,kBAAkB,KAAK,CAAC;EAEvE;;AAUI,IAAO,kBAAP,cAA+B,eAAc;;;;EAIjD,MAAW;EACX,YACE,MAAoB,QAAQ,IAAG,GAC/B,OAAuB,CAAA,GAAE;AAEzB,UAAM,EAAE,SAAS,MAAK,IAAK;AAC3B,UAAM,KAAK,OAAO,KAAK,EAAE,GAAG,MAAM,OAAM,CAAE;AAC1C,SAAK,SAAS;EAChB;;;;EAKA,cAAc,MAAY;AACxB,WAAO;EACT;;;;EAKA,QAAQA,KAAW;AACjB,WAAO,IAAI,UACT,KAAK,UACL,OACA,QACA,KAAK,OACL,KAAK,QACL,KAAK,cAAa,GAClB,EAAE,IAAAA,IAAE,CAAE;EAEV;;;;EAKA,WAAW,GAAS;AAClB,WAAO,EAAE,WAAW,GAAG;EACzB;;AAWI,IAAO,mBAAP,cAAgC,gBAAe;EACnD,YACE,MAAoB,QAAQ,IAAG,GAC/B,OAAuB,CAAA,GAAE;AAEzB,UAAM,EAAE,SAAS,KAAI,IAAK;AAC1B,UAAM,KAAK,EAAE,GAAG,MAAM,OAAM,CAAE;EAChC;;AAQK,IAAM,OAAO,QAAQ,aAAa,UAAU,YAAY;AASxD,IAAM,aAIX,QAAQ,aAAa,UAAU,kBAC7B,QAAQ,aAAa,WAAW,mBAChC;;;AE1vFJ,IAAM,gBAAgB,CAAC,OACrB,GAAG,UAAU;AACf,IAAM,aAAa,CAAC,OAAiC,GAAG,UAAU;AAM5D,IAAO,UAAP,MAAO,SAAO;EACT;EACA;EACA;EACA;EACA;EACT;EACA;EACA;EACA;EACA;EACA,kBAA2B;EAE3B,YACE,aACA,UACA,OACA,UAAyB;AAEzB,QAAI,CAAC,cAAc,WAAW,GAAG;AAC/B,YAAM,IAAI,UAAU,oBAAoB;IAC1C;AACA,QAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAM,IAAI,UAAU,iBAAiB;IACvC;AACA,QAAI,SAAS,WAAW,YAAY,QAAQ;AAC1C,YAAM,IAAI,UAAU,+CAA+C;IACrE;AACA,SAAK,SAAS,YAAY;AAC1B,QAAI,QAAQ,KAAK,SAAS,KAAK,QAAQ;AACrC,YAAM,IAAI,UAAU,oBAAoB;IAC1C;AACA,SAAK,eAAe;AACpB,SAAK,YAAY;AACjB,SAAK,SAAS;AACd,SAAK,YAAY;AAGjB,QAAI,KAAK,WAAW,GAAG;AASrB,UAAI,KAAK,MAAK,GAAI;AAEhB,cAAM,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,KAAK,IAAI,KAAK;AACxC,cAAM,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,KAAK,IAAI,KAAK;AACxC,YAAI,MAAM,CAAC,MAAM,IAAI;AAEnB,gBAAM,MAAK;AACX,gBAAM,MAAK;QACb;AACA,cAAM,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,KAAK,GAAG;AACvC,cAAM,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,KAAK,GAAG;AACvC,aAAK,eAAe,CAAC,GAAG,GAAG,KAAK;AAChC,aAAK,YAAY,CAAC,GAAG,GAAG,KAAK;AAC7B,aAAK,SAAS,KAAK,aAAa;MAClC,WAAW,KAAK,QAAO,KAAM,KAAK,WAAU,GAAI;AAC9C,cAAM,CAAC,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,cAAM,CAAC,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,YAAI,MAAM,CAAC,MAAM,IAAI;AAEnB,gBAAM,MAAK;AACX,gBAAM,MAAK;QACb;AACA,cAAM,IAAK,KAAgB;AAC3B,cAAM,IAAI,KAAK;AACf,aAAK,eAAe,CAAC,GAAG,GAAG,KAAK;AAChC,aAAK,YAAY,CAAC,GAAG,GAAG,KAAK;AAC7B,aAAK,SAAS,KAAK,aAAa;MAClC;IACF;EACF;;;;EAKA,UAAO;AACL,WAAO,KAAK,aAAa,KAAK,MAAM;EACtC;;;;EAKA,WAAQ;AACN,WAAO,OAAO,KAAK,aAAa,KAAK,MAAM,MAAM;EACnD;;;;EAIA,aAAU;AACR,WAAO,KAAK,aAAa,KAAK,MAAM,MAAM;EAC5C;;;;EAIA,WAAQ;AACN,WAAO,KAAK,aAAa,KAAK,MAAM,aAAa;EACnD;;;;EAKA,aAAU;AACR,WAAQ,KAAK,cACX,KAAK,gBACJ,KAAK,WAAW,IACf,KAAK,WAAU,IACb,KAAK,UAAU,CAAC,IAAI,KAAK,UAAU,MAAM,CAAC,EAAE,KAAK,GAAG,IACpD,KAAK,UAAU,KAAK,GAAG,IACzB,KAAK,UAAU,MAAM,KAAK,MAAM,EAAE,KAAK,GAAG;EAChD;;;;EAKA,UAAO;AACL,WAAO,KAAK,SAAS,KAAK,SAAS;EACrC;;;;EAKA,OAAI;AACF,QAAI,KAAK,UAAU;AAAW,aAAO,KAAK;AAC1C,QAAI,CAAC,KAAK,QAAO;AAAI,aAAQ,KAAK,QAAQ;AAC1C,SAAK,QAAQ,IAAI,SACf,KAAK,cACL,KAAK,WACL,KAAK,SAAS,GACd,KAAK,SAAS;AAEhB,SAAK,MAAM,cAAc,KAAK;AAC9B,SAAK,MAAM,SAAS,KAAK;AACzB,SAAK,MAAM,WAAW,KAAK;AAC3B,WAAO,KAAK;EACd;;;;EAKA,QAAK;AACH,UAAM,KAAK,KAAK;AAChB,WAAO,KAAK,WAAW,SACnB,KAAK,SACJ,KAAK,SACJ,KAAK,cAAc,WACnB,KAAK,WAAW,KAChB,GAAG,CAAC,MAAM,MACV,GAAG,CAAC,MAAM,MACV,OAAO,GAAG,CAAC,MAAM,YACjB,CAAC,CAAC,GAAG,CAAC,KACN,OAAO,GAAG,CAAC,MAAM,YACjB,CAAC,CAAC,GAAG,CAAC;EACd;;;;;;;;;EAUA,UAAO;AACL,UAAM,KAAK,KAAK;AAChB,WAAO,KAAK,aAAa,SACrB,KAAK,WACJ,KAAK,WACJ,KAAK,cAAc,WACnB,KAAK,WAAW,KAChB,KAAK,SAAS,KACd,OAAO,GAAG,CAAC,MAAM,YACjB,YAAY,KAAK,GAAG,CAAC,CAAC;EAC9B;;;;;;;EAQA,aAAU;AACR,UAAM,KAAK,KAAK;AAChB,WAAO,KAAK,gBAAgB,SACxB,KAAK,cACJ,KAAK,cACH,GAAG,CAAC,MAAM,MAAM,GAAG,SAAS,KAC7B,KAAK,QAAO,KACZ,KAAK,MAAK;EAClB;;;;EAKA,OAAI;AACF,UAAM,IAAI,KAAK,aAAa,CAAC;AAC7B,WACI,OAAO,MAAM,YAAY,KAAK,WAAU,KAAM,KAAK,WAAW,IAE9D,IACA;EACN;;;;;EAMA,sBAAmB;AACjB,WAAO,EACL,KAAK,WAAW,KAChB,CAAC,KAAK,WAAU,KAChB,CAAC,KAAK;EAEV;;;;EAKA,qBAAkB;AAChB,QAAI,KAAK,WAAW,KAAK,CAAC,KAAK,WAAU,KAAM,CAAC,KAAK;AACnD,aAAO;AACT,SAAK,kBAAkB;AACvB,WAAO;EACT;;;;AC9OF,IAAMM,mBAEF,OAAO,YAAY,YACnB,WACA,OAAO,QAAQ,aAAa,WAE5B,QAAQ,WACR;AAKE,IAAO,SAAP,MAAa;EACjB;EACA;EACA;EACA;EACA;EACA;EAEA,YACE,SACA,EACE,SACA,QACA,OACA,YACA,WAAWA,iBAAe,GACX;AAEjB,SAAK,WAAW,CAAA;AAChB,SAAK,WAAW,CAAA;AAChB,SAAK,mBAAmB,CAAA;AACxB,SAAK,mBAAmB,CAAA;AACxB,SAAK,WAAW;AAChB,SAAK,SAAS;MACZ,KAAK;MACL;MACA;MACA;MACA;MACA,mBAAmB;MACnB;MACA,WAAW;MACX,UAAU;;AAEZ,eAAW,OAAO;AAAS,WAAK,IAAI,GAAG;EACzC;EAEA,IAAI,KAAW;AAab,UAAM,KAAK,IAAI,UAAU,KAAK,KAAK,MAAM;AACzC,aAAS,IAAI,GAAG,IAAI,GAAG,IAAI,QAAQ,KAAK;AACtC,YAAM,SAAS,GAAG,IAAI,CAAC;AACvB,YAAM,YAAY,GAAG,UAAU,CAAC;AAEhC,UAAI,CAAC,UAAU,CAAC,WAAW;AACzB,cAAM,IAAI,MAAM,wBAAwB;MAC1C;AAGA,aAAO,OAAO,CAAC,MAAM,OAAO,UAAU,CAAC,MAAM,KAAK;AAChD,eAAO,MAAK;AACZ,kBAAU,MAAK;MACjB;AAEA,YAAM,IAAI,IAAI,QAAQ,QAAQ,WAAW,GAAG,KAAK,QAAQ;AACzD,YAAM,IAAI,IAAI,UAAU,EAAE,WAAU,GAAI,KAAK,MAAM;AACnD,YAAM,WAAW,UAAU,UAAU,SAAS,CAAC,MAAM;AACrD,YAAM,WAAW,EAAE,WAAU;AAC7B,UAAI;AAAU,aAAK,SAAS,KAAK,CAAC;;AAC7B,aAAK,SAAS,KAAK,CAAC;AACzB,UAAI,UAAU;AACZ,YAAI;AAAU,eAAK,iBAAiB,KAAK,CAAC;;AACrC,eAAK,iBAAiB,KAAK,CAAC;MACnC;IACF;EACF;EAEA,QAAQ,GAAO;AACb,UAAM,WAAW,EAAE,SAAQ;AAC3B,UAAM,YAAY,GAAG,QAAQ;AAC7B,UAAMC,YAAW,EAAE,SAAQ,KAAM;AACjC,UAAM,YAAY,GAAGA,SAAQ;AAC7B,eAAW,KAAK,KAAK,UAAU;AAC7B,UAAI,EAAE,MAAMA,SAAQ,KAAK,EAAE,MAAM,SAAS;AAAG,eAAO;IACtD;AACA,eAAW,KAAK,KAAK,UAAU;AAC7B,UAAI,EAAE,MAAM,QAAQ,KAAK,EAAE,MAAM,SAAS;AAAG,eAAO;IACtD;AACA,WAAO;EACT;EAEA,gBAAgB,GAAO;AACrB,UAAM,WAAW,EAAE,SAAQ,IAAK;AAChC,UAAMA,aAAY,EAAE,SAAQ,KAAM,OAAO;AACzC,eAAW,KAAK,KAAK,kBAAkB;AACrC,UAAI,EAAE,MAAMA,SAAQ;AAAG,eAAO;IAChC;AACA,eAAW,KAAK,KAAK,kBAAkB;AACrC,UAAI,EAAE,MAAM,QAAQ;AAAG,eAAO;IAChC;AACA,WAAO;EACT;;;;ACxHI,IAAO,iBAAP,MAAO,gBAAc;EACzB;EACA,YAAY,QAAkC,oBAAI,IAAG,GAAE;AACrD,SAAK,QAAQ;EACf;EACA,OAAI;AACF,WAAO,IAAI,gBAAe,IAAI,IAAI,KAAK,KAAK,CAAC;EAC/C;EACA,UAAU,QAAc,SAAgB;AACtC,WAAO,KAAK,MAAM,IAAI,OAAO,SAAQ,CAAE,GAAG,IAAI,QAAQ,WAAU,CAAE;EACpE;EACA,YAAY,QAAc,SAAgB;AACxC,UAAM,WAAW,OAAO,SAAQ;AAChC,UAAM,SAAS,KAAK,MAAM,IAAI,QAAQ;AACtC,QAAI;AAAQ,aAAO,IAAI,QAAQ,WAAU,CAAE;;AACtC,WAAK,MAAM,IAAI,UAAU,oBAAI,IAAI,CAAC,QAAQ,WAAU,CAAE,CAAC,CAAC;EAC/D;;AAQI,IAAO,cAAP,MAAkB;EACtB,QAA2B,oBAAI,IAAG;EAClC,IAAI,QAAc,UAAmB,OAAc;AACjD,UAAM,KAAK,WAAW,IAAI,MAAM,QAAQ,IAAI;AAC5C,UAAM,UAAU,KAAK,MAAM,IAAI,MAAM;AACrC,SAAK,MAAM,IAAI,QAAQ,YAAY,SAAY,IAAI,IAAI,OAAO;EAChE;;EAEA,UAAO;AACL,WAAO,CAAC,GAAG,KAAK,MAAM,QAAO,CAAE,EAAE,IAAI,CAAC,CAACC,OAAM,CAAC,MAAM;MAClDA;MACA,CAAC,EAAE,IAAI;MACP,CAAC,EAAE,IAAI;KACR;EACH;;AAOI,IAAO,WAAP,MAAe;EACnB,QAA8B,oBAAI,IAAG;EACrC,IAAI,QAAc,SAAgB;AAChC,QAAI,CAAC,OAAO,WAAU,GAAI;AACxB;IACF;AACA,UAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAClC,QAAI,MAAM;AACR,UAAI,CAAC,KAAK,KAAK,OAAK,EAAE,WAAU,MAAO,QAAQ,WAAU,CAAE,GAAG;AAC5D,aAAK,KAAK,OAAO;MACnB;IACF;AAAO,WAAK,MAAM,IAAI,QAAQ,CAAC,OAAO,CAAC;EACzC;EACA,IAAI,QAAY;AACd,UAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AAElC,QAAI,CAAC,MAAM;AACT,YAAM,IAAI,MAAM,iCAAiC;IACnD;AAEA,WAAO;EACT;EACA,UAAO;AACL,WAAO,KAAK,KAAI,EAAG,IAAI,OAAK,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,CAAc,CAAC;EACjE;EACA,OAAI;AACF,WAAO,CAAC,GAAG,KAAK,MAAM,KAAI,CAAE,EAAE,OAAO,OAAK,EAAE,WAAU,CAAE;EAC1D;;AASI,IAAO,YAAP,MAAO,WAAS;EACpB;EACA,UAAU,IAAI,YAAW;EACzB,WAAW,IAAI,SAAQ;EACvB;EACA;EACA;EACA;EAEA,YAAY,MAAsB,gBAA+B;AAC/D,SAAK,OAAO;AACZ,SAAK,SAAS,CAAC,CAAC,KAAK;AACrB,SAAK,MAAM,CAAC,CAAC,KAAK;AAClB,SAAK,iBACH,iBAAiB,eAAe,KAAI,IAAK,IAAI,eAAc;EAC/D;EAEA,gBAAgB,QAAc,UAAmB;AAC/C,SAAK,WAAW;AAChB,UAAM,gBAAmC,SAAS,IAAI,OAAK,CAAC,QAAQ,CAAC,CAAC;AAKtE,aAAS,CAAC,GAAG,OAAO,KAAK,eAAe;AACtC,WAAK,eAAe,YAAY,GAAG,OAAO;AAE1C,YAAMC,QAAO,QAAQ,KAAI;AACzB,YAAM,WAAW,QAAQ,WAAU,KAAM,KAAK,KAAK,aAAa;AAGhE,UAAIA,OAAM;AACR,YAAI,EAAE,QACJA,UAAS,OAAO,KAAK,KAAK,SAAS,SACjC,KAAK,KAAK,OACVA,KAAI;AAER,cAAMC,QAAO,QAAQ,KAAI;AACzB,YAAI,CAACA,OAAM;AACT,eAAK,QAAQ,IAAI,GAAG,MAAM,KAAK;AAC/B;QACF,OAAO;AACL,oBAAUA;QACZ;MACF;AAEA,UAAI,EAAE,SAAQ;AAAI;AAElB,UAAI;AACJ,UAAI;AACJ,UAAI,UAAU;AACd,aACE,QAAQ,IAAI,QAAQ,QAAO,OAAQ,aAClC,OAAO,QAAQ,KAAI,IACpB;AACA,cAAM,IAAI,EAAE,QAAQ,CAAC;AACrB,YAAI;AACJ,kBAAU;AACV,kBAAU;MACZ;AACA,UAAI,QAAQ,QAAO;AACnB,aAAO,QAAQ,KAAI;AACnB,UAAI,SAAS;AACX,YAAI,KAAK,eAAe,UAAU,GAAG,OAAO;AAAG;AAC/C,aAAK,eAAe,YAAY,GAAG,OAAO;MAC5C;AAKA,UAAI,OAAO,MAAM,UAAU;AAGzB,cAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM,MAAM;AAC9C,aAAK,QAAQ,IAAI,EAAE,QAAQ,CAAC,GAAG,UAAU,KAAK;AAC9C;MACF,WAAW,MAAM,UAAU;AAMzB,YACE,CAAC,EAAE,eAAc,KACjB,KAAK,UACL,QAAQ,oBAAmB,GAC3B;AACA,eAAK,SAAS,IAAI,GAAG,OAAO;QAC9B;AACA,cAAM,KAAK,MAAM,QAAO;AACxB,cAAM,QAAQ,MAAM,KAAI;AACxB,YAAI,CAAC,SAAU,OAAO,MAAM,OAAO,QAAQ,CAAC,OAAQ;AAGlD,eAAK,QAAQ,IAAI,GAAG,UAAU,OAAO,MAAM,OAAO,GAAG;QACvD,OAAO;AACL,cAAI,OAAO,MAAM;AAIf,kBAAM,KAAK,EAAE,UAAU;AAEvB,gBAAI,CAAC;AAAO,mBAAK,QAAQ,IAAI,IAAI,UAAU,IAAI;qBACtC,CAAC,KAAK,eAAe,UAAU,IAAI,KAAK,GAAG;AAClD,mBAAK,SAAS,IAAI,IAAI,KAAK;YAC7B;UACF;QACF;MACF,WAAW,aAAa,QAAQ;AAC9B,aAAK,SAAS,IAAI,GAAG,OAAO;MAC9B;IACF;AAEA,WAAO;EACT;EAEA,iBAAc;AACZ,WAAO,KAAK,SAAS,KAAI;EAC3B;EAEA,QAAK;AACH,WAAO,IAAI,WAAU,KAAK,MAAM,KAAK,cAAc;EACrD;;;;;EAMA,cAAc,QAAc,SAAe;AACzC,UAAM,WAAW,KAAK,SAAS,IAAI,MAAM;AAEzC,UAAM,UAAU,KAAK,MAAK;AAC1B,eAAW,KAAK,SAAS;AACvB,iBAAW,WAAW,UAAU;AAC9B,cAAM,WAAW,QAAQ,WAAU;AACnC,cAAM,IAAI,QAAQ,QAAO;AACzB,cAAM,OAAO,QAAQ,KAAI;AACzB,YAAI,MAAM,UAAU;AAClB,kBAAQ,aAAa,GAAG,SAAS,MAAM,QAAQ;QACjD,WAAW,aAAa,QAAQ;AAC9B,kBAAQ,WAAW,GAAG,GAAG,MAAM,QAAQ;QACzC,OAAO;AACL,kBAAQ,WAAW,GAAG,GAAG,MAAM,QAAQ;QACzC;MACF;IACF;AACA,WAAO;EACT;EAEA,aACE,GACA,SACA,MACA,UAAiB;AAEjB,QAAI,KAAK,OAAO,CAAC,EAAE,KAAK,WAAW,GAAG,GAAG;AACvC,UAAI,CAAC,QAAQ,QAAO,GAAI;AACtB,aAAK,QAAQ,IAAI,GAAG,UAAU,KAAK;MACrC;AACA,UAAI,EAAE,WAAU,GAAI;AAMlB,YAAI,KAAK,UAAU,CAAC,EAAE,eAAc,GAAI;AACtC,eAAK,SAAS,IAAI,GAAG,OAAO;QAC9B,WAAW,EAAE,eAAc,GAAI;AAC7B,cAAI,QAAQ,QAAQ,oBAAmB,GAAI;AACzC,iBAAK,SAAS,IAAI,GAAG,IAAI;UAC3B,WAAW,QAAQ,mBAAkB,GAAI;AACvC,iBAAK,SAAS,IAAI,GAAG,OAAO;UAC9B;QACF;MACF;IACF;AAGA,QAAI,MAAM;AACR,YAAM,KAAK,KAAK,QAAO;AACvB,UACE,OAAO,OAAO;MAEd,OAAO,QACP,OAAO,MACP,OAAO,KACP;AACA,aAAK,WAAW,GAAG,IAAI,KAAK,KAAI,GAAI,QAAQ;MAC9C,WAAW,OAAO,MAAM;AAEtB,cAAM,KAAK,EAAE,UAAU;AAEvB,aAAK,SAAS,IAAI,IAAI,IAAI;MAC5B,WAAW,cAAc,QAAQ;AAC/B,aAAK,WAAW,GAAG,IAAI,KAAK,KAAI,GAAI,QAAQ;MAC9C;IACF;EACF;EAEA,WACE,GACA,GACA,MACA,UAAiB;AAEjB,QAAI,CAAC,EAAE,KAAK,EAAE,IAAI;AAAG;AACrB,QAAI,CAAC,MAAM;AACT,WAAK,QAAQ,IAAI,GAAG,UAAU,KAAK;IACrC,OAAO;AACL,WAAK,SAAS,IAAI,GAAG,IAAI;IAC3B;EACF;EAEA,WAAW,GAAS,GAAW,MAAsB,UAAiB;AAEpE,QAAI,CAAC,EAAE,QAAQ,CAAC;AAAG;AACnB,QAAI,CAAC,MAAM;AACT,WAAK,QAAQ,IAAI,GAAG,UAAU,KAAK;IACrC,OAAO;AACL,WAAK,SAAS,IAAI,GAAG,IAAI;IAC3B;EACF;;;;AC9OF,IAAM,aAAa,CACjB,QACA,SAEA,OAAO,WAAW,WAAW,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,IACpD,MAAM,QAAQ,MAAM,IAAI,IAAI,OAAO,QAAQ,IAAI,IAC/C;AAKE,IAAgB,WAAhB,MAAwB;EAC5B;EACA;EACA;EACA,OAAkB,oBAAI,IAAG;EACzB,SAAkB;EAClB,UAAmB;EACnB,YAA2B,CAAA;EAC3B;EACA;EACA;EACA;EACA;EAGA,YAAY,UAAqBC,OAAY,MAAO;AAClD,SAAK,WAAW;AAChB,SAAK,OAAOA;AACZ,SAAK,OAAO;AACZ,SAAK,OAAO,CAAC,KAAK,SAAS,KAAK,aAAa,UAAU,OAAO;AAC9D,SAAK,sBAAsB,KAAK,wBAAwB;AACxD,QAAI,KAAK,UAAU,CAAC,KAAK,qBAAqB;AAC5C,WAAK,UAAU,WAAW,KAAK,UAAU,CAAA,GAAI,IAAI;AACjD,UACE,CAAC,KAAK,uBACN,OAAO,KAAK,QAAQ,QAAQ,YAC5B;AACA,cAAM,IAAI;AACV,cAAM,IAAI,MAAM,CAAC;MACnB;IACF;AAIA,SAAK,WAAW,KAAK,YAAY;AAEjC,QAAI,KAAK,QAAQ;AACf,WAAK,SAAS,KAAK;AACnB,WAAK,OAAO,iBAAiB,SAAS,MAAK;AACzC,aAAK,UAAU,SAAS;MAC1B,CAAC;IACH;EACF;EAEA,SAASA,OAAU;AACjB,WAAO,KAAK,KAAK,IAAIA,KAAI,KAAK,CAAC,CAAC,KAAK,SAAS,UAAUA,KAAI;EAC9D;EACA,iBAAiBA,OAAU;AACzB,WAAO,CAAC,CAAC,KAAK,SAAS,kBAAkBA,KAAI;EAC/C;;EAGA,QAAK;AACH,SAAK,SAAS;EAChB;EACA,SAAM;AAEJ,QAAI,KAAK,QAAQ;AAAS;AAE1B,SAAK,SAAS;AACd,QAAI,KAA8B;AAClC,WAAO,CAAC,KAAK,WAAW,KAAK,KAAK,UAAU,MAAK,IAAK;AACpD,SAAE;IACJ;EACF;EACA,SAAS,IAAa;AACpB,QAAI,KAAK,QAAQ;AAAS;AAE1B,QAAI,CAAC,KAAK,QAAQ;AAChB,SAAE;IACJ,OAAO;AAEL,WAAK,UAAU,KAAK,EAAE;IACxB;EACF;;;EAIA,MAAM,WAAW,GAAS,OAAc;AACtC,QAAI,SAAS,KAAK,KAAK;AAAO,aAAO;AACrC,QAAI;AACJ,QAAI,KAAK,KAAK,UAAU;AACtB,YAAM,EAAE,eAAc,KAAO,MAAM,EAAE,SAAQ;AAC7C,UAAI,CAAC;AAAK,eAAO;AACjB,UAAI;IACN;AACA,UAAM,WAAW,EAAE,UAAS,KAAM,KAAK,KAAK;AAC5C,UAAM,IAAI,WAAW,MAAM,EAAE,MAAK,IAAK;AACvC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS,GAAG,eAAc,GAAI;AAC9D,YAAM,SAAS,MAAM,EAAE,SAAQ;AAE/B,UAAI,WAAW,OAAO,UAAS,KAAM,KAAK,KAAK,OAAO;AACpD,cAAM,OAAO,MAAK;MACpB;IAEF;AACA,WAAO,KAAK,eAAe,GAAG,KAAK;EACrC;EAEA,eAAe,GAAqB,OAAc;AAChD,WACI,MACG,KAAK,aAAa,YAAY,EAAE,MAAK,KAAM,KAAK,cAChD,CAAC,SAAS,EAAE,WAAU,OACtB,CAAC,KAAK,KAAK,SAAS,CAAC,EAAE,YAAW,OAClC,CAAC,KAAK,KAAK,SACV,CAAC,KAAK,KAAK,UACX,CAAC,EAAE,eAAc,KACjB,CAAC,EAAE,eAAc,GAAI,YAAW,MAClC,CAAC,KAAK,SAAS,CAAC,IAElB,IACA;EACN;EAEA,eAAe,GAAS,OAAc;AACpC,QAAI,SAAS,KAAK,KAAK;AAAO,aAAO;AACrC,QAAI;AACJ,QAAI,KAAK,KAAK,UAAU;AACtB,YAAM,EAAE,eAAc,KAAM,EAAE,aAAY;AAC1C,UAAI,CAAC;AAAK,eAAO;AACjB,UAAI;IACN;AACA,UAAM,WAAW,EAAE,UAAS,KAAM,KAAK,KAAK;AAC5C,UAAM,IAAI,WAAW,EAAE,UAAS,IAAK;AACrC,QAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS,GAAG,eAAc,GAAI;AAC9D,YAAM,SAAS,EAAE,aAAY;AAC7B,UAAI,WAAW,QAAQ,UAAS,KAAM,KAAK,KAAK,OAAO;AACrD,eAAO,UAAS;MAClB;IACF;AACA,WAAO,KAAK,eAAe,GAAG,KAAK;EACrC;EAKA,YAAY,GAAS,UAAiB;AACpC,QAAI,KAAK,SAAS,CAAC;AAAG;AAEtB,QAAI,CAAC,KAAK,uBAAuB,KAAK,SAAS,KAAK;AAClD,YAAM,MAAM,GAAG,EAAE,cAAa,CAAE;AAChC,WAAK,QAAQ,IAAI,GAAG;IACtB;AACA,UAAM,MACJ,KAAK,KAAK,aAAa,SAAY,WAAW,KAAK,KAAK;AAC1D,SAAK,KAAK,IAAI,CAAC;AACf,UAAM,OAAO,KAAK,KAAK,QAAQ,EAAE,YAAW,IAAK,KAAK,OAAO;AAE7D,QAAI,KAAK,KAAK,eAAe;AAC3B,WAAK,UAAU,CAAC;IAClB,WAAW,KAAK;AACd,YAAMC,OAAM,KAAK,KAAK,QAAQ,EAAE,cAAa,IAAK,EAAE,SAAQ;AAC5D,WAAK,UAAUA,OAAM,IAAI;IAC3B,OAAO;AACL,YAAM,MAAM,KAAK,KAAK,QAAQ,EAAE,cAAa,IAAK,EAAE,SAAQ;AAC5D,YAAM,MACJ,KAAK,KAAK,eAAe,CAAC,IAAI,WAAW,OAAO,KAAK,IAAI,IACvD,MAAM,KAAK,OACX;AACJ,WAAK,UAAU,CAAC,MAAM,MAAM,OAAO,MAAM,MAAM,IAAI;IACrD;EACF;EAEA,MAAM,MAAM,GAAS,UAAmB,OAAc;AACpD,UAAM,IAAI,MAAM,KAAK,WAAW,GAAG,KAAK;AACxC,QAAI;AAAG,WAAK,YAAY,GAAG,QAAQ;EACrC;EAEA,UAAU,GAAS,UAAmB,OAAc;AAClD,UAAM,IAAI,KAAK,eAAe,GAAG,KAAK;AACtC,QAAI;AAAG,WAAK,YAAY,GAAG,QAAQ;EACrC;EAEA,OAAO,QAAc,UAAqB,IAAa;AAErD,QAAI,KAAK,QAAQ;AAAS,SAAE;AAE5B,SAAK,QAAQ,QAAQ,UAAU,IAAI,UAAU,KAAK,IAAI,GAAG,EAAE;EAC7D;EAEA,QACE,QACA,UACA,WACA,IAAa;AAEb,QAAI,KAAK,iBAAiB,MAAM;AAAG,aAAO,GAAE;AAC5C,QAAI,KAAK,QAAQ;AAAS,SAAE;AAC5B,QAAI,KAAK,QAAQ;AACf,WAAK,SAAS,MAAM,KAAK,QAAQ,QAAQ,UAAU,WAAW,EAAE,CAAC;AACjE;IACF;AACA,cAAU,gBAAgB,QAAQ,QAAQ;AAK1C,QAAI,QAAQ;AACZ,UAAM,OAAO,MAAK;AAChB,UAAI,EAAE,UAAU;AAAG,WAAE;IACvB;AAEA,eAAW,CAAC,GAAG,UAAU,KAAK,KAAK,UAAU,QAAQ,QAAO,GAAI;AAC9D,UAAI,KAAK,SAAS,CAAC;AAAG;AACtB;AACA,WAAK,MAAM,GAAG,UAAU,KAAK,EAAE,KAAK,MAAM,KAAI,CAAE;IAClD;AAEA,eAAW,KAAK,UAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,YAAY,EAAE,MAAK,KAAM,KAAK,UAAU;AAC5D;MACF;AACA;AACA,YAAM,iBAAiB,EAAE,cAAa;AACtC,UAAI,EAAE,cAAa;AACjB,aAAK,QAAQ,GAAG,gBAAgB,WAAW,IAAI;WAC5C;AACH,UAAE,UACA,CAAC,GAAG,YAAY,KAAK,QAAQ,GAAG,SAAS,WAAW,IAAI,GACxD,IAAI;MAER;IACF;AAEA,SAAI;EACN;EAEA,QACE,QACA,SACA,WACA,IAAa;AAEb,gBAAY,UAAU,cAAc,QAAQ,OAAO;AAEnD,QAAI,QAAQ;AACZ,UAAM,OAAO,MAAK;AAChB,UAAI,EAAE,UAAU;AAAG,WAAE;IACvB;AAEA,eAAW,CAAC,GAAG,UAAU,KAAK,KAAK,UAAU,QAAQ,QAAO,GAAI;AAC9D,UAAI,KAAK,SAAS,CAAC;AAAG;AACtB;AACA,WAAK,MAAM,GAAG,UAAU,KAAK,EAAE,KAAK,MAAM,KAAI,CAAE;IAClD;AACA,eAAW,CAACC,SAAQ,QAAQ,KAAK,UAAU,SAAS,QAAO,GAAI;AAC7D;AACA,WAAK,QAAQA,SAAQ,UAAU,UAAU,MAAK,GAAI,IAAI;IACxD;AAEA,SAAI;EACN;EAEA,WAAW,QAAc,UAAqB,IAAa;AAEzD,QAAI,KAAK,QAAQ;AAAS,SAAE;AAE5B,SAAK,YAAY,QAAQ,UAAU,IAAI,UAAU,KAAK,IAAI,GAAG,EAAE;EACjE;EAEA,YACE,QACA,UACA,WACA,IAAa;AAEb,QAAI,KAAK,iBAAiB,MAAM;AAAG,aAAO,GAAE;AAC5C,QAAI,KAAK,QAAQ;AAAS,SAAE;AAC5B,QAAI,KAAK,QAAQ;AACf,WAAK,SAAS,MACZ,KAAK,YAAY,QAAQ,UAAU,WAAW,EAAE,CAAC;AAEnD;IACF;AACA,cAAU,gBAAgB,QAAQ,QAAQ;AAK1C,QAAI,QAAQ;AACZ,UAAM,OAAO,MAAK;AAChB,UAAI,EAAE,UAAU;AAAG,WAAE;IACvB;AAEA,eAAW,CAAC,GAAG,UAAU,KAAK,KAAK,UAAU,QAAQ,QAAO,GAAI;AAC9D,UAAI,KAAK,SAAS,CAAC;AAAG;AACtB,WAAK,UAAU,GAAG,UAAU,KAAK;IACnC;AAEA,eAAW,KAAK,UAAU,eAAc,GAAI;AAC1C,UAAI,KAAK,aAAa,YAAY,EAAE,MAAK,KAAM,KAAK,UAAU;AAC5D;MACF;AACA;AACA,YAAM,WAAW,EAAE,YAAW;AAC9B,WAAK,YAAY,GAAG,UAAU,WAAW,IAAI;IAC/C;AAEA,SAAI;EACN;EAEA,YACE,QACA,SACA,WACA,IAAa;AAEb,gBAAY,UAAU,cAAc,QAAQ,OAAO;AAEnD,QAAI,QAAQ;AACZ,UAAM,OAAO,MAAK;AAChB,UAAI,EAAE,UAAU;AAAG,WAAE;IACvB;AAEA,eAAW,CAAC,GAAG,UAAU,KAAK,KAAK,UAAU,QAAQ,QAAO,GAAI;AAC9D,UAAI,KAAK,SAAS,CAAC;AAAG;AACtB,WAAK,UAAU,GAAG,UAAU,KAAK;IACnC;AACA,eAAW,CAACA,SAAQ,QAAQ,KAAK,UAAU,SAAS,QAAO,GAAI;AAC7D;AACA,WAAK,YAAYA,SAAQ,UAAU,UAAU,MAAK,GAAI,IAAI;IAC5D;AAEA,SAAI;EACN;;AAGI,IAAO,aAAP,cAEI,SAAW;EACnB,UAAU,oBAAI,IAAG;EAEjB,YAAY,UAAqBF,OAAY,MAAO;AAClD,UAAM,UAAUA,OAAM,IAAI;EAC5B;EAEA,UAAU,GAAY;AACpB,SAAK,QAAQ,IAAI,CAAC;EACpB;EAEA,MAAM,OAAI;AACR,QAAI,KAAK,QAAQ;AAAS,YAAM,KAAK,OAAO;AAC5C,QAAI,KAAK,KAAK,UAAS,GAAI;AACzB,YAAM,KAAK,KAAK,MAAK;IACvB;AACA,UAAM,IAAI,QAAQ,CAAC,KAAK,QAAO;AAC7B,WAAK,OAAO,KAAK,MAAM,KAAK,UAAU,MAAK;AACzC,YAAI,KAAK,QAAQ,SAAS;AACxB,cAAI,KAAK,OAAO,MAAM;QACxB,OAAO;AACL,cAAI,KAAK,OAAO;QAClB;MACF,CAAC;IACH,CAAC;AACD,WAAO,KAAK;EACd;EAEA,WAAQ;AACN,QAAI,KAAK,QAAQ;AAAS,YAAM,KAAK,OAAO;AAC5C,QAAI,KAAK,KAAK,UAAS,GAAI;AACzB,WAAK,KAAK,UAAS;IACrB;AAEA,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAK;AAC7C,UAAI,KAAK,QAAQ;AAAS,cAAM,KAAK,OAAO;IAC9C,CAAC;AACD,WAAO,KAAK;EACd;;AAGI,IAAO,aAAP,cAEI,SAAW;EACnB;EAEA,YAAY,UAAqBA,OAAY,MAAO;AAClD,UAAM,UAAUA,OAAM,IAAI;AAC1B,SAAK,UAAU,IAAI,SAA+B;MAChD,QAAQ,KAAK;MACb,YAAY;KACb;AACD,SAAK,QAAQ,GAAG,SAAS,MAAM,KAAK,OAAM,CAAE;AAC5C,SAAK,QAAQ,GAAG,UAAU,MAAM,KAAK,OAAM,CAAE;EAC/C;EAEA,UAAU,GAAY;AACpB,SAAK,QAAQ,MAAM,CAAC;AACpB,QAAI,CAAC,KAAK,QAAQ;AAAS,WAAK,MAAK;EACvC;EAEA,SAAM;AACJ,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO,UAAS,GAAI;AACtB,aAAO,MAAK,EAAG,KAAK,MAAK;AACvB,aAAK,OAAO,QAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE;MAC7D,CAAC;IACH,OAAO;AACL,WAAK,OAAO,QAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE;IAC7D;AACA,WAAO,KAAK;EACd;EAEA,aAAU;AACR,QAAI,KAAK,KAAK,UAAS,GAAI;AACzB,WAAK,KAAK,UAAS;IACrB;AACA,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAM,KAAK,QAAQ,IAAG,CAAE;AAClE,WAAO,KAAK;EACd;;;;AP1dF,IAAMG,mBAEF,OAAO,YAAY,YACnB,WACA,OAAO,QAAQ,aAAa,WAE5B,QAAQ,WACR;AA4VE,IAAO,OAAP,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,YAAY,SAA4B,MAAU;AAEhD,QAAI,CAAC;AAAM,YAAM,IAAI,UAAU,uBAAuB;AAEtD,SAAK,gBAAgB,CAAC,CAAC,KAAK;AAC5B,SAAK,SAAS,KAAK;AACnB,SAAK,SAAS,CAAC,CAAC,KAAK;AACrB,SAAK,MAAM,CAAC,CAAC,KAAK;AAClB,SAAK,cAAc,CAAC,CAAC,KAAK;AAC1B,SAAK,QAAQ,CAAC,CAAC,KAAK;AACpB,SAAK,OAAO,CAAC,CAAC,KAAK;AACnB,QAAI,CAAC,KAAK,KAAK;AACb,WAAK,MAAM;IACb,WAAW,KAAK,eAAe,OAAO,KAAK,IAAI,WAAW,SAAS,GAAG;AACpE,WAAK,MAAMC,eAAc,KAAK,GAAG;IACnC;AACA,SAAK,MAAM,KAAK,OAAO;AACvB,SAAK,OAAO,KAAK;AACjB,SAAK,gBAAgB,CAAC,CAAC,KAAK;AAC5B,SAAK,UAAU,CAAC,CAAC,KAAK;AACtB,SAAK,QAAQ,CAAC,CAAC,KAAK;AACpB,SAAK,WAAW,CAAC,CAAC,KAAK;AACvB,SAAK,WAAW,KAAK;AACrB,SAAK,sBAAsB,KAAK,wBAAwB;AAExD,SAAK,aAAa,CAAC,CAAC,KAAK;AACzB,SAAK,YAAY,CAAC,CAAC,KAAK;AACxB,SAAK,WACH,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;AACtD,SAAK,OAAO,CAAC,CAAC,KAAK;AACnB,SAAK,SAAS,KAAK;AAEnB,QAAI,KAAK,iBAAiB,KAAK,aAAa,QAAW;AACrD,YAAM,IAAI,MAAM,4CAA4C;IAC9D;AAEA,QAAI,OAAO,YAAY,UAAU;AAC/B,gBAAU,CAAC,OAAO;IACpB;AAEA,SAAK,uBACH,CAAC,CAAC,KAAK,wBACN,KAA0C,uBACzC;AAEJ,QAAI,KAAK,sBAAsB;AAC7B,gBAAU,QAAQ,IAAI,OAAK,EAAE,QAAQ,OAAO,GAAG,CAAC;IAClD;AAEA,QAAI,KAAK,WAAW;AAClB,UAAI,KAAK,YAAY;AACnB,cAAM,IAAI,UAAU,iCAAiC;MACvD;AACA,gBAAU,QAAQ,IAAI,OAAM,EAAE,SAAS,GAAG,IAAI,IAAI,QAAQ,CAAC,EAAG;IAChE;AAEA,SAAK,UAAU;AAEf,SAAK,WAAW,KAAK,YAAYD;AACjC,SAAK,OAAO,EAAE,GAAG,MAAM,UAAU,KAAK,SAAQ;AAC9C,QAAI,KAAK,QAAQ;AACf,WAAK,SAAS,KAAK;AACnB,UACE,KAAK,WAAW,UAChB,KAAK,WAAW,KAAK,OAAO,QAC5B;AACA,cAAM,IAAI,MAAM,kDAAkD;MACpE;IACF,OAAO;AACL,YAAM,SACJ,KAAK,aAAa,UAAU,kBAC1B,KAAK,aAAa,WAAW,mBAC7B,KAAK,WAAW,kBAChB;AACJ,WAAK,SAAS,IAAI,OAAO,KAAK,KAAK;QACjC,QAAQ,KAAK;QACb,IAAI,KAAK;OACV;IACH;AACA,SAAK,SAAS,KAAK,OAAO;AAM1B,UAAM,kBACJ,KAAK,aAAa,YAAY,KAAK,aAAa;AAElD,UAAM,MAAwB;;MAE5B,GAAG;MACH,KAAK,KAAK;MACV,WAAW,KAAK;MAChB,SAAS,KAAK;MACd,QAAQ,KAAK;MACb;MACA,WAAW;MACX,OAAO,KAAK;MACZ,UAAU;MACV,mBAAmB;MACnB,UAAU,KAAK;MACf,sBAAsB,KAAK;MAC3B,OAAO,CAAC,CAAC,KAAK,KAAK;;AAGrB,UAAM,MAAM,KAAK,QAAQ,IAAI,OAAK,IAAI,UAAU,GAAG,GAAG,CAAC;AACvD,UAAM,CAAC,UAAU,SAAS,IAAI,IAAI,OAChC,CAAC,KAA4B,MAAK;AAChC,UAAI,CAAC,EAAE,KAAK,GAAG,EAAE,GAAG;AACpB,UAAI,CAAC,EAAE,KAAK,GAAG,EAAE,SAAS;AAC1B,aAAO;IACT,GACA,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC;AAEV,SAAK,WAAW,SAAS,IAAI,CAAC,KAAK,MAAK;AACtC,YAAM,IAAI,UAAU,CAAC;AAErB,UAAI,CAAC;AAAG,cAAM,IAAI,MAAM,wBAAwB;AAEhD,aAAO,IAAI,QAAQ,KAAK,GAAG,GAAG,KAAK,QAAQ;IAC7C,CAAC;EACH;EAMA,MAAM,OAAI;AAKR,WAAO;MACL,GAAI,MAAM,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;QACvD,GAAG,KAAK;QACR,UACE,KAAK,aAAa,WAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC;QACJ,UAAU,KAAK;QACf,QAAQ,KAAK;QACb,qBAAqB,KAAK;OAC3B,EAAE,KAAI;;EAEX;EAMA,WAAQ;AACN,WAAO;MACL,GAAG,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;QAChD,GAAG,KAAK;QACR,UACE,KAAK,aAAa,WAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC;QACJ,UAAU,KAAK;QACf,QAAQ,KAAK;QACb,qBAAqB,KAAK;OAC3B,EAAE,SAAQ;;EAEf;EAMA,SAAM;AACJ,WAAO,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;MACpD,GAAG,KAAK;MACR,UACE,KAAK,aAAa,WAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC;MACJ,UAAU,KAAK;MACf,QAAQ,KAAK;MACb,qBAAqB,KAAK;KAC3B,EAAE,OAAM;EACX;EAMA,aAAU;AACR,WAAO,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;MACpD,GAAG,KAAK;MACR,UACE,KAAK,aAAa,WAChB,KAAK,WAAW,KAAK,OAAO,IAAI,MAAK,IACrC;MACJ,UAAU,KAAK;MACf,QAAQ,KAAK;MACb,qBAAqB,KAAK;KAC3B,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;;;;AQrnBK,IAAM,WAAW,CACtB,SACA,UAAuB,CAAA,MACZ;AACX,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAC3B,cAAU,CAAC,OAAO;EACpB;AACA,aAAW,KAAK,SAAS;AACvB,QAAI,IAAI,UAAU,GAAG,OAAO,EAAE,SAAQ;AAAI,aAAO;EACnD;AACA,SAAO;AACT;;;AC4BM,SAAU,eACd,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,WAAU;AAC9C;AAsBM,SAAU,WACd,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,OAAM;AAC1C;AAqBM,SAAU,SACd,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,SAAQ;AAC5C;AAwBA,eAAe,MACb,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,KAAI;AACxC;AAqBM,SAAU,gBACd,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,YAAW;AAC/C;AAqBM,SAAU,YACd,SACA,UAAuB,CAAA,GAAE;AAEzB,SAAO,IAAI,KAAK,SAAS,OAAO,EAAE,QAAO;AAC3C;AAGO,IAAM,aAAa;AACnB,IAAM,SAAS,OAAO,OAAO,YAAY,EAAE,MAAM,eAAc,CAAE;AACjE,IAAM,cAAc;AACpB,IAAM,UAAU,OAAO,OAAO,aAAa;EAChD,MAAM;CACP;AACM,IAAM,OAAO,OAAO,OAAO,UAAU;EAC1C,QAAQ;EACR,SAAS;CACV;AAEM,IAAM,OAAO,OAAO,OAAO,OAAO;EACvC,MAAM;EACN;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AACD,KAAK,OAAO;;;AC/NZ,SAAS,uBAAuB;AA6F1B,IAAgB,aAAhB,MAA0B;EAYrB,UAA6B,oBAAI,IAAG;EAGpC,UAAoC,oBAAI,IAAG;EAG3C,aAAmC,oBAAI,IAAG;EAG1C,mBAAyC,oBAAI,IAAG;EAGhD;EAaA;EAGA;EAGA,SAAoB,CAAA;EAMpB;EAET,YAAY,SAAY,MAAe;AACrC,UAAM,KAAK,IAAI,gBAAe;AAC9B,SAAK,OAAO,QAAQ,KAAK;AACzB,SAAK,kBAAkB;AACvB,oBAAgB,UAAU,GAAG,MAAM;AACnC,SAAK,UAAU;AACf,QAAI,CAAC,QAAQ,MAAM,QAAQ;AACzB,YAAM,KAAK,IAAI,MAAM,wCAAwC;QAC3D,OAAO;UACL,OAAO,QAAQ;UACf,QAAQ;;OAEX;AACD,YAAM,kBAAkB,IAAI,IAAI;AAChC,YAAM;IACR;AACA,SAAK,WAAW,QAAQ,aAAa;AACrC,UAAM,EAAE,OAAM,IAAK;AACnB,QAAI,WAAW,QAAW;AACxB,aAAO,iBAAiB,SAAS,YAAU,GAAG,MAAM,MAAM,GAAG;QAC3D,MAAM;QACN,QAAQ,GAAG;OACZ;IACH;EACF;EAsCA,MAAM,GAAS,GAAO;AACpB,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC;AACxC,QAAI,CAAC,YAAY,IAAI,CAAC;AAAG,aAAO;AAChC,UAAM,mBAAmB,KAAK,iBAAiB,IAAI,CAAC;AAEpD,QAAI,CAAC;AAAkB,aAAO;AAC9B,QAAI,iBAAiB,IAAI,CAAC,GAAG;AAC3B,aAAO,CAAC,GAAG,CAAC;IACd;AACA,UAAM,QAAmC;MACvC,GAAG;MACH,IAAI,QAAM,CAAC,IAAI,CAAC,CAAC;AACnB,QAAI,OAA4C;AAChD,WAAO,YAAe,OAAO,MAAM,MAAK,IAAK;AAE3C,UAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC;AAAG;AAC9B,UAAI,KAAK,CAAC,MAAM,GAAG;AACjB,eAAO;MACT;AACA,YAAM,MAAM,KAAK,iBAAiB,IAAI,KAAK,CAAC,CAAC;AAC7C,UAAI,KAAK;AACP,mBAAWE,MAAK,KAAK;AACnB,gBAAM,KAAK,CAACA,IAAG,GAAG,IAAI,CAAC;QACzB;MACF;IACF;EACF;EAUA,WAAW,GAASC,OAAc,GAAO;AAEvC,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AACjC,UAAM,UAAU,WAAW,IAAI,CAAC;AAChC,QAAI,SAAS;AACX,YAAM,QAAQ,KAAK,MAAM,GAAG,CAAC;AAE7B,UAAI,CAAC,OAAO;AACV,cAAM,IAAI,MAAM,2CAA2C;MAC7D;AAEA,YAAM,QAAQ,CAAC;AACf,WAAK,QAAQ,GAAG,OAAOA,KAAI;AAC3B,aAAO;IACT;AAEA,UAAM,QAAQ,KAAK,iBAAiB,IAAI,CAAC,KAAK,oBAAI,IAAG;AACrD,SAAK,iBAAiB,IAAI,GAAG,KAAK;AAClC,UAAM,IAAI,CAAC;AAEX,UAAM,gBAAgB,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACvD,SAAK,WAAW,IAAI,GAAG,aAAa;AACpC,eAAWC,MAAK,YAAY;AAC1B,oBAAc,IAAIA,EAAC;IACrB;AACA,kBAAc,IAAI,CAAC;AACnB,WAAO;EACT;EAOA,YAAY,IAAa,GAASD,OAAY;AAC5C,SAAK,OAAO,KAAK,EAAE;AACnB,SAAK,QAAQ,IAAI,GAAG;MAClB,QAAQ;MACR,QAAQ;KACT;AACD,QAAI,KAAK,UAAU;AACjB,WAAK,gBAAgB,MAAM,EAAE;AAC7B,YAAM,IAAI,IAAI,MAAM,0BAA0B;QAC5C,OAAO;UACL,MAAM;UACN,MAAAA;UACA,OAAO;;OAEV;AACD,YAAM,kBAAkB,GAAG,KAAK,IAAI;AACpC,YAAM;IACR;EACF;EAOA,YAAY,OAAe,GAAO;AAChC,SAAK,QAAQ,IAAI,GAAG,KAAK;AACzB,SAAK,QAAQ,IAAI,GAAG;MAClB,QAAQ;MACR;KACD;EACH;;AAII,IAAO,SAAP,cAAoC,WAKzC;EAEU,UAAU,oBAAI,IAAG;EAE1B,MAAM,QAAQ,GAAO;AAEnB,QAAI,KAAK,gBAAgB,OAAO;AAAS,aAAO,CAAA;AAChD,UAAM,OAAO,MAAM,KAAK,QAAQ,QAAQ,CAAC;AACzC,eAAW,KAAK,MAAM;AACpB,YAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,WAAK,WAAW,IAAI,GAAG,UAAU;AACjC,iBAAW,IAAI,CAAC;AAChB,YAAM,QAAQ,KAAK,iBAAiB,IAAI,CAAC,KAAK,oBAAI,IAAG;AACrD,WAAK,iBAAiB,IAAI,GAAG,KAAK;AAClC,YAAM,IAAI,CAAC;IACb;AACA,WAAO;EACT;EAEA,MAAM,MACJ,GACAA,OACA,YAAoC;AAEpC,UAAM,EAAE,OAAM,IAAK,KAAK;AACxB,WAAO,KAAK,QAAQ,MAAM,GAAG,QAAQA,OAAM,UAAU;EACvD;EAEA,MAAM,QAAQ,GAAS,OAAeA,OAAY;AAEhD,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,KAAK,QAAQ,UAAU,GAAG,OAAOA,KAAI;EAC7C;EAEA,MAAM,MAAM,GAASA,OAAY;AAC/B,UAAM,IAAI,KAAK,QAAQ,IAAI,CAAC;AAE5B,QAAI;AAAG,aAAO;AAEd,QAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AAEzB,UAAM,IAAI,KAAK,MAAM,GAAGA,KAAI,EAAE,KAC5B,MAAK;AACH,WAAK,QAAQ,OAAO,CAAC;IACvB,GAEA,QAAK;AACH,WAAK,QAAQ,OAAO,CAAC;AACrB,YAAM;IACR,CAAC;AAGH,SAAK,QAAQ,IAAI,GAAG,CAAC;AACrB,WAAO;EACT;EAEA,MAAM,MAAM,GAASA,OAAY;AAC/B,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AAEjC,UAAM,OAAO,MAAM,KAAK,QAAQ,CAAC;AACjC,UAAM,WAA4B,CAAA;AAClC,UAAM,UAAU,CAAC,GAAGA,OAAM,CAAC;AAE3B,eAAW,KAAK,MAAM;AAEpB,UAAI,KAAK,gBAAgB,OAAO;AAAS;AAEzC,UAAI,MAAM;AAAG;AACb,UAAI,KAAK,WAAW,GAAG,SAAS,CAAC;AAAG;AAEpC,UAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AACzB,eAAS,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,KAAK,MAAM,GAAG,OAAO,CAAC;IAC7D;AAGA,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,QAAQ,IAAI,QAAQ;AAC1B,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,SAAS,IAAI,IACjB,KAAK,IAAI,OAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;AAEzC,QAAI;AACF,WAAK,YAAY,MAAM,KAAK,MAAM,GAAGA,OAAM,MAAM,GAAG,CAAC;IACvD,SAAS,IAAI;AACX,WAAK,YAAY,IAAI,GAAGA,KAAI;IAC9B;EACF;EAEA,MAAM,MAAG;AACP,UAAME,YAA4B,CAAA;AAClC,eAAW,KAAK,KAAK,QAAQ,OAAO;AAClC,MAAAA,UAAS,KAAK,KAAK,MAAM,GAAG,CAAA,CAAE,CAAC;IACjC;AACA,UAAM,QAAQ,IAAIA,SAAQ;EAC5B;;AAII,IAAO,aAAP,cAAwC,WAK7C;EACC,QAAQ,GAAO;AACb,QAAI,KAAK,gBAAgB,OAAO;AAAS,aAAO,CAAA;AAChD,WAAO,KAAK,QAAQ,QAAQ,CAAC;EAC/B;EAEA,MAAM,GAASF,OAAc,YAAoC;AAC/D,UAAM,EAAE,OAAM,IAAK,KAAK;AACxB,WAAO,KAAK,QAAQ,MAAM,GAAG,QAAQA,OAAM,UAAU;EACvD;EAEA,QAAQ,GAAS,OAAeA,OAAY;AAE1C,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,SAAK,QAAQ,UAAU,GAAG,OAAOA,KAAI;EACvC;EAEA,MAAM,GAASA,OAAY;AAEzB,QAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AAEzB,SAAK,MAAM,GAAGA,KAAI;EACpB;EAEA,MAAM,GAASA,OAAY;AACzB,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AAEjC,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,UAAM,UAAU,CAAC,GAAGA,OAAM,CAAC;AAC3B,eAAW,KAAK,MAAM;AACpB,UAAI,KAAK,gBAAgB,OAAO;AAAS;AAEzC,UAAI,MAAM;AAAG;AACb,UAAI,KAAK,WAAW,GAAG,SAAS,CAAC;AAAG;AACpC,UAAI,CAAC,KAAK,QAAQ,IAAI,CAAC;AAAG,aAAK,MAAM,GAAG,OAAO;IACjD;AAEA,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,SAAS,IAAI,IACjB,KAAK,IAAI,OAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;AAEzC,QAAI;AACF,WAAK,YAAY,KAAK,MAAM,GAAGA,OAAM,MAAM,GAAG,CAAC;IACjD,SAAS,IAAI;AACX,WAAK,YAAY,IAAI,GAAGA,KAAI;IAC9B;EACF;EAEA,MAAG;AACD,eAAW,KAAK,KAAK,QAAQ,OAAO;AAClC,WAAK,MAAM,GAAG,CAAA,CAAE;IAClB;AACA,WAAO,KAAK;EACd;;AAUK,IAAM,WAAW,OACtB,YAC8B;AAC9B,QAAM,SAAS,IAAI,OAAO,SAAS,QAAQ;AAC3C,QAAM,OAAO,IAAG;AAChB,MAAI,OAAO,OAAO,QAAQ;AACxB,UAAM,IAAI,IAAI,eACZ,OAAO,QACP,wBAAwB;AAE1B,UAAM,kBAAkB,GAAG,QAAQ;AACnC,UAAM;EACR;AACA,SAAO,OAAO;AAChB;AASO,IAAM,eAAe,CAC1B,YACqB;AACrB,QAAM,SAAS,IAAI,WAAW,SAAS,YAAY;AACnD,SAAO,IAAG;AACV,MAAI,OAAO,OAAO,QAAQ;AACxB,UAAM,IAAI,IAAI,eACZ,OAAO,QACP,wBAAwB;AAE1B,UAAM,kBAAkB,GAAG,YAAY;AACvC,UAAM;EACR;AACA,SAAO,OAAO;AAChB;;;AjBngBA,SAAS,UAAU,WAAAG,UAAS,SAAAC,cAAa;AA6ClC,IAAM,aAAa,CACxB,MACAC,UACyB;AACzB,iBAAe,MAAMA,KAAI;AACzB,SACE,OAAO,SAAS,WAAW,EAAE,UAAU,CAAC,IAAI,EAAC,IAC3C,MAAM,QAAQ,IAAI,IAAI,EAAE,UAAU,KAAI,IACtC;AAEN;AAKO,IAAM,iBAG0B,CACrC,MACAA,UACE;AACF,MAAI,OAAO,SAAS;AAAU,WAAO;AAErC,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAW,KAAK,MAAM;AACpB,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,MAAM,gCAAgC;UAC1C,MAAAA;UACA,OAAO;UACP,QAAQ;SACT;MACH;IACF;AACA;EACF;AAEA,MAAI,QAAQ,OAAO,SAAS,UAAU;AACpC,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AACjD,UAAI,OAAO,UAAU;AAAU;AAC/B,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,mBAAW,KAAK,OAAO;AACrB,cAAI,OAAO,MAAM,UAAU;AACzB,kBAAM,MAAM,gCAAgC;cAC1C,MAAAA;cACA,MAAM;cACN,OAAO;cACP,QAAQ;aACT;UACH;QACF;AACA;MACF;AACA,YAAM,MAAM,gCAAgC;QAC1C,MAAAA;QACA,MAAM;QACN,OAAO;QACP,QAAQ;OACT;IACH;AACA;EACF;AAEA,QAAM,MAAM,gCAAgC;IAC1C,MAAAA;IACA,OAAO;IACP,QACE;GACH;AACH;AA2BM,IAAO,WAAP,MAAO,UAAQ;;EAEnB;;EAEA;;EAGA,cAAc,oBAAI,IAAG;EACrB,UAAU,oBAAI,IAAG;EACjB;EACA;;;;EAKA,IAAI,OAAI;AACN,WAAO,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE;EAC5B;EAEA,YAAY,aAAqB,UAA2B,CAAA,GAAE;AAC5D,SAAK,cAAcC,SAAQ,WAAW;AACtC,SAAK,SAAS,QAAQ,UAAU,IAAI,WAAW,WAAW;AAC1D,SAAK,cAAc,QAAQ,eAAe,IAAI,YAAW;AACzD,SAAK,UAAU,QAAQ;AACvB,QAAI,QAAQ;AAAM,WAAK,KAAK,QAAQ,IAAI;EAC1C;;;;;;;;;;EAWA,IAAI,SAAM;AACR,QAAI,KAAK;AAAS,aAAO,KAAK;AAC9B,UAAM,OAAOA,SAAQ,KAAK,aAAa,qBAAqB;AAC5D,QAAI;AACJ,QAAI;AACF,iBAAWC,cAAa,MAAM,MAAM;IACtC,SAAS,IAAI;AACX,YAAM,MAAM,mDAAmD;QAC7D,MAAM,KAAK;QACX,OAAO;OACR;IACH;AACA,QAAI;AACJ,QAAI;AACF,eAASC,OAAM,QAAQ;IACzB,SAAS,IAAI;AACX,YAAM,MAAM,oCAAoC;QAC9C,MAAM,KAAK;QACX,OAAO;OACR;IACH;AACA,SAAK,UAAU,WAAW,QAAQ,IAAI;AACtC,WAAO,KAAK;EACd;;;;;EAMA,EAAE,OAAO,QAAQ,IAAC;AAChB,UAAM,CAAC,EAAE,IAAI,CAAC,GAAG,KAAK,OAAM,CAAE;AAC9B,QAAI,CAAC;AAAI;AAGT,eAAW,aAAa,KAAK,QAAQ,MAAK;IAAE,CAAC,EAAE,KAAI,GAAI;AACrD,YAAM;IACR;EACF;;;;;EAMA,QAAQ,OAAO,aAAa,IAAC;AAK3B,UAAM,CAAC,EAAE,IAAI,CAAC,GAAG,KAAK,OAAM,CAAE;AAC9B,QAAI,CAAC;AAAI;AACT,eAAW,cAAc,MAAM,KAAK,IAAI,MAAK;IAAE,CAAC,GAAG,KAAI,GAAI;AACzD,YAAM;IACR;EACF;;;;;;;;;;;;;;;;EAiBA,KAAK,QAAmB,CAAA,GAAE;AACxB,UAAM,QAAQ,IAAI,IAChB,OAAO,MAAM,UAAU,WACrB,CAAC,MAAM,KAAK,IACX,MAAM,SAAS,CAAA,CAAG;AAEvB,UAAM,SAAS,IAAI,IACjB,OAAO,MAAM,WAAW,WACtB,CAAC,MAAM,MAAM,IACZ,MAAM,UAAU,CAAA,CAAG;AAGxB,UAAM,iBAA8C,CAAA;AACpD,eAAW,CAAC,OAAO,OAAO,KAAK,OAAO,QAAQ,KAAK,MAAM,GAAG;AAC1D,UAAI,OAAO,QAAQ,CAAC,OAAO,IAAI,KAAK;AAAG;AACvC,qBAAe,KAAK,IAAI,KAAK,MAAM,OAAO;IAC5C;AACA,UAAMC,UAAS,MAAM,OAAO,KAAK,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI;AAGrD,QAAI,MAAM,QAAQ,CAACA,QAAO;AAAM,aAAO;AAEvC,eAAW,CAAC,OAAO,OAAO,KAAK,OAAO,QAAQ,cAAc,GAAG;AAC7D,iBAAWJ,SAAQ,SAAS;AAC1B,YAAII,QAAO,QAAQ,CAACA,QAAO,IAAIJ,KAAI;AAAG;AACtC,aAAK,QAAQA,OAAM,KAAK;MAC1B;IACF;AAEA,WAAO;EACT;;;EAIA,QAAQA,OAAc,OAAc;AAClC,UAAM,WAAWC,SAAQ,KAAK,aAAaD,KAAI;AAC/C,UAAM,SAAS,KAAK,YAAY,IAAI,QAAQ;AAC5C,QAAI;AAAQ,aAAO;AACnB,UAAM,YAAY,eAAe,IAAI,QAAQ;AAC7C,UAAM,WACJ,WAAW,YAAY,KAAK,YAAY,KAAK,QAAQ;AACvD,UAAM,KAAK,aAAa,IAAI,UAAUA,OAAM,UAAU,QAAQ;AAC9D,QAAI;AAAO,SAAG,OAAO,KAAK,KAAK;AAC/B,SAAK,YAAY,IAAI,GAAG,UAAU,EAAE;AACpC,SAAK,YAAY,IAAI,GAAG,MAAM,EAAE;AAChC,SAAK,YAAY,IAAI,GAAG,MAAM,EAAE;AAChC,eAAW,QAAQ,GAAG,QAAQ;AAC5B,YAAMK,SAAQ,KAAK,QAAQ,IAAI,IAAI,KAAK,oBAAI,IAAG;AAC/C,MAAAA,OAAM,IAAI,EAAE;AACZ,WAAK,QAAQ,IAAI,MAAMA,MAAK;IAC9B;AACA,WAAO;EACT;;;EAIA,aAAa,SAAoB;AAI/B,UAAM,YAAY,CAAC,MAAqB;AACtC,aACE,CAAC,CAAC,GAAG,cAAa,MACjB,QAAQ,IAAI,EAAE,cAAa,CAAE,KAAK,UAAU,EAAE,MAAM;IAEzD;AAEA,WAAO;MACL,MAAM,KAAK;MACX,KAAK,KAAK;MACV,OAAO;MACP,QAAQ,KAAK;MACb,eAAe;MACf,QAAQ;QACN,iBAAiB,OACf,SAAS,EAAE,cAAa,CAAE,MAAM,kBAChC,UAAU,CAAC;;QAEb,SAAS,OAAI;AACX,YAAE,UAAS;AACX,gBAAM,MAAM,EAAE,cAAa;AAC3B,cAAI,CAAC;AAAK,mBAAO;AACjB,gBAAM,cAAwB,CAAA;AAC9B,qBAAW,KAAK,SAAS;AACvB,gBAAI,IAAI,WAAW,IAAI,GAAG;AAAG,qBAAO;AACpC,gBAAI,EAAE,WAAW,MAAM,GAAG,GAAG;AAC3B,0BAAY,KAAK,CAAC;YACpB;UACF;AACA,cAAI,CAAC,EAAE,YAAW;AAAI,mBAAO;AAC7B,gBAAM,KAAK,EAAE,QAAQ,cAAc,EAAE,UAAS;AAC9C,cAAI,CAAC,IAAI,OAAM;AAAI,mBAAO;AAC1B,cAAI;AACF,iBAAK,YAAY,KAAK,EAAE,SAAQ,CAAE;UACpC,QAAQ;AACN,mBAAO;UACT;AACA,qBAAW,KAAK,aAAa;AAC3B,oBAAQ,OAAO,CAAC;UAClB;AACA,kBAAQ,IAAI,GAAG;AACf,iBAAO;QACT;;;EAGN;EAEA,MAAM,SAA0B;AAC9B,UAAM,UAAU,oBAAI,IAAG;AACvB,aAAS,SAAS,KAAK,aAAa,OAAO,CAAC;AAC5C,WAAO;EACT;;;;;;;;;;;;EAaA,QAAQ,IAAe,YAAY,OAAK;AAGtC,UAAM,EAAE,SAAQ,IAAK;AACrB,UAAM,gBAA6B,CAAA;AACnC,QAAI,eAAe;AACnB,eAAW,WAAW;MACpB;MACA;MACA;MACA;OACU;AACV,YAAM,OAAO,SAAS,OAAO;AAC7B,UAAI,CAAC;AAAM;AACX,iBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,YAAI,KAAK,WAAW,YAAY,GAAG;AACjC,cAAI,QAAQ,KAAK,YAAY,IAAI,GAAG;AACpC,cAAI,CAAC,OAAO;AACV,gBAAI,CAAC;AAAW;AAChB,gBAAI;AAAc;AAClB,2BAAe;AACf,iBAAK,KAAI;AACT,oBAAQ,KAAK,YAAY,IAAI,GAAG;AAChC,gBAAI,CAAC;AAAO;UACd;AACA,wBAAc,KAAK,KAAK;QAC1B;MACF;IACF;AACA,WAAO;EACT;EAEA,QACE,KACA,QACA,UAAqB;EASvB;;;;;EAMA,MAAM,OAAa;AACjB,WAAO,KAAK,QAAQ,IAAI,KAAK;EAC/B;;;;;;;EAQA,IAAI,YAAkB;AACpB,WAAO,KAAK,YAAY,IAAI,UAAU;EACxC;;;;EAKA,CAAC,QAAK;AACJ,eAAW,CAAC,KAAK,EAAE,KAAK,KAAK,aAAa;AACxC,UAAI,QAAQ,GAAG;AAAM,cAAM;IAC7B;EACF;;;;EAKA,CAAC,QAAK;AACJ,eAAW,CAAC,KAAK,EAAE,KAAK,KAAK,aAAa;AACxC,UAAI,QAAQ,GAAG;AAAM,cAAM;IAC7B;EACF;;;;;;;EAQA,CAAC,SAAM;AACL,UAAM,OAAO,oBAAI,IAAG;AACpB,eAAW,MAAM,KAAK,YAAY,OAAM,GAAI;AAC1C,UAAI,KAAK,IAAI,GAAG,QAAQ;AAAG;AAC3B,WAAK,IAAI,GAAG,QAAQ;AACpB,YAAM;IACR;EACF;;;;;EAMA,CAAC,OAAI;AACH,eAAW,MAAM,KAAK,OAAM,GAAI;AAC9B,YAAM,GAAG;AACT,UAAI,GAAG,SAAS,GAAG;AAAM,cAAM,GAAG;IACpC;EACF;;;;;;EAOA,CAAC,OAAO,EACN,WAAW,cACX,mBAAmB,UAAS,GACL;AACvB,UAAM,oBAAoB,cAAc,IAAI,CAAAC,UAC1C,UAAU,OAAOC,OAAM,KAAKD,KAAI,CAAC,CAAC;AAEpC,eAAW,MAAM,MAAM;AAErB,UAAI,WAAW,KAAK,OAAK,GAAG,OAAO,SAAS,CAAC,CAAC,GAAG;AAC/C,cAAM;AACN;MACF;AAGA,UACE,cACI,IAAI,OAAKC,OAAM,KAAK,CAAC,CAAC,EACvB,KAAK,OAAK,GAAG,KAAK,SAAS,CAAC,CAAC,GAChC;AACA,cAAM;AACN;MACF;AAEA,UACE,GAAG,KAAK,KAAK,SAAO,mBAAmB,KAAK,QAAM,GAAG,GAAG,CAAC,CAAC,GAC1D;AACA,cAAM;MACR;IACF;EACF;;;;;;;;;;;;EAaA,MAAM,IACJ,WAKA,YAAY,OAAK;AAEjB,UAAM,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,YAAY,OAAM,CAAE;AACnD,QAAI,CAAC,IAAI;AACP,YAAM,MAAM,wBAAwB,QAAW,KAAK,GAAG;IACzD;AAEA,WAAO,SAAuB;MAC5B,OAAO,CAAC,IAAI,GAAG,IAAI;MACnB,SAAS,CAAAC,QAAM,KAAK,QAAQA,KAAI,SAAS;MACzC,OAAO,OAAOA,KAAI,QAAQ,GAAG,eAC3B,MAAM,UAAUA,KAAI,QAAQ,UAAU;MACxC,SAAS,CAACA,KAAI,OAAOR,UAAS,KAAK,QAAQQ,KAAI,OAAOR,KAAI;KAC3D;EACH;;;;;;;;;;;;EAaA,QACE,WAKA,YAAY,OAAK;AAEjB,UAAM,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,YAAY,OAAM,CAAE;AACnD,QAAI,CAAC,IAAI;AACP,YAAM,MAAM,wBAAwB,QAAW,KAAK,GAAG;IACzD;AAEA,WAAO,aAA2B;MAChC,OAAO,CAAC,IAAI,GAAG,IAAI;MACnB,SAAS,CAAAQ,QAAM,KAAK,QAAQA,KAAI,SAAS;MACzC,OAAO,CAACA,KAAI,QAAQ,GAAG,eACrB,UAAUA,KAAI,QAAQ,UAAU;MAClC,SAAS,CAACA,KAAI,OAAOR,UAAS,KAAK,QAAQQ,KAAI,OAAOR,KAAI;KAC3D;EACH;;;;;;EAOA,OAAO,UACL,aACA,UAA2B,EAAE,MAAM,CAAA,EAAE,GAAE;AAEvC,QAAI;AACF,UACE,CAAC,SACCC,SAAQ,aAAa,qBAAqB,CAAC,EAC3C,OAAM,GACR;AACA;MACF;IACF,QAAQ;AACN;IACF;AACA,UAAM,EAAE,MAAAQ,QAAO,CAAA,EAAE,IAAK;AACtB,WAAO,IAAI,UAAS,aAAa,EAAE,GAAG,SAAS,MAAAA,MAAI,CAAE;EACvD;;;;;EAMA,OAAO,KACL,aACA,UAA2B,EAAE,MAAM,CAAA,EAAE,GAAE;AAEvC,UAAM,EAAE,MAAAA,QAAO,CAAA,EAAE,IAAK;AACtB,WAAO,IAAI,UAAS,aAAa,EAAE,GAAG,SAAS,MAAAA,MAAI,CAAE;EACvD;;AAGK,IAAM,iBAAiB,oBAAI,IAAG;AAK/B,IAAO,YAAP,MAAgB;EACpB;EACA;EACA;EACA;EACA,SAAmB,CAAA;EACnB;EACA;EAEA,YAAYT,OAAc,UAAoB,UAAgB;AAC5D,SAAK,KAAK,eAAe,CAAC,aAAaA,KAAI,CAAC;AAC5C,mBAAe,IAAI,UAAU,IAAI;AACjC,SAAK,OAAOA;AACZ,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,OAAO,SAAS,QAAQA;EAC/B;EAEA,IAAI,OAAI;AACN,QAAI,KAAK,OAAO;AACd,aAAO,KAAK;IACd;AACA,SAAK,QAAQ,CAAC,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ;AACjD,WAAO,KAAK;EACd;;;;AkB1oBF,SAAS,UAAU,WAAAU,gBAAe;AAM3B,IAAM,YAAY,CACvBC,KACA,MACA,eAAe,QAAQ,IAAG,GAC1B,cAAc,QAAQ,IAAG,GACzB,aAEA,CAAC,CAACA,OACF,eACE,WAAWA,GAAE,GACb,MACA,cACA,aACA,QAAQ;AAGL,IAAM,iBAAiB,CAC5B,OACA,MACA,eAAe,QAAQ,IAAG,GAC1B,cAAc,QAAQ,IAAG,GACzB,aACW;AACX,QAAM,EAAE,QAAO,IAAK;AACpB,SAAO,KAAK;AACZ,QAAM,CAAC,MAAM,OAAO,MAAM,IAAI;AAC9B,MAAI,KAAK,SAAS;AAAM,WAAO;AAE/B,UAAQ,KAAK,MAAM;IACjB,KAAK,YAAY;AACf,UAAI,CAAC,OAAO;AAEV,YAAI,KAAK,aAAa,QAAQ,UAAU;AACtC,iBAAO;QACT;MACF,OAAO;AACL,cAAM,gBAAgB,QAAQ,WAAW,KAAK;AAC9C,YAAI,iBAAiB,kBAAkB,KAAK,UAAU;AAEpD,iBAAO;QACT,WAAW,CAAC,iBAAiB,UAAU,KAAK,UAAU;AAEpD,iBAAO;QACT;MACF;AAEA,UAAI,CAAC;AAAQ,cAAM,MAAM,iBAAiB,EAAE,OAAO,MAAK,CAAE;AAC1D,YAAM,CAAC,MAAMC,QAAO,IAAI,aAAa,MAAM;AAC3C;;QAEE,SAAS,KAAK,QAAQ,CAACA,WAAU,QAE/B,CAAC,KAAK,QAAQ,OACd,KAAK,MAAM,KAAK,QAAQ,MAAMA,QAAO,CAAC;;IAE5C;IAEA,KAAK,QAAQ;AAEX,UAAI,KAAK,SAAS;AAAW,eAAO;AACpC,YAAM,eAAeF,SACnB,aACA,cACA,KAAK,IAAI;AAEX,YAAM,aAAaA,SAAQ,aAAa,KAAK;AAE7C,aAAO,CAAC,SAAS,cAAc,UAAU;IAC3C;IAEA,KAAK,aAAa;AAChB,mBAAa,SAAS,KAAK,WAAW;AAEtC,UAAI,CAAC,KAAK;AAAW,eAAO;AAC5B,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,WAAW,SAAS,IAAI,KAAK,SAAS;AAC5C,UAAI,WAAW,YAAY,CAAC,YAAY,CAAC;AAAQ,eAAO;AACxD,UAAI,CAAC,KAAK;AAAO,eAAO;AACxB,YAAM,IAAI,MAAM,OAAO,SAAS,WAAW,EAAE;AAC7C,aAAO,CAAC,CAAC,KAAK,KAAK,MAAM,KAAK,CAAC;IACjC;IAEA,KAAK,UAAU;AACb,aAAO,KAAK,cAAc;IAC5B;IAEA,KAAK,OAAO;AACV,YAAM,EACJ,WACA,oBAAoB,CAAA,GACpB,aACA,eACA,cACA,iBAAgB,IACd;AACJ,UAAI,cAAc,OAAO;AACvB,YAAI,gBAAgB,kBAAkB;AACpC,gBAAM,MAAM,GAAG,YAAY;AAC3B,cAAI,MAAM,WAAW,GAAG,GAAG;AACzB,gBAAI,UAAU,MAAM;AAAkB,qBAAO;UAC/C;AAAO,mBAAO;QAChB;AAAO,iBAAO;MAChB;AACA,UAAI,eAAe,CAAC;AAAQ,eAAO;AAEnC,YAAM,CAAC,QAAQ,UAAU,IAAIG,MAAK,iBAAiB,UAAU,EAAE;AAC/D,UAAI,iBAAiB;AACnB,eAAO,CAAC,CAAC,WAAW,WAAW,aAAa;AAC9C,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,iBAAiB,GAAG;AACtD,YAAI,OAAO,CAA4B,MAAM;AAAG,iBAAO;MACzD;AACA,aAAO;IACT;;IAGA,SAAS;AACP,YAAM,MAAM,qBAAqB,EAAE,KAAI,CAAE;IAC3C;EACF;AAEF;AAEA,IAAM,eAAe,CAAC,OAAgC;AACpD,QAAM,KAAK,GAAG,YAAY,GAAG;AAE7B,SAAO,MAAM,IACT,CAAC,IAAI,EAAE,IACP,CAAC,GAAG,UAAU,GAAG,EAAE,GAAG,GAAG,UAAU,KAAK,CAAC,CAAC;AAChD;;;ACzIA,SAAS,WAAAC,gBAA+B;AAKxC,IAAMC,kBAAiB,OAAO,IAAI,4BAA4B;AAExD,IAAO,OAAP,MAAW;EACf,KAAK,OAAO,WAAW,IAAC;AACtB,WAAO;EACT;EAEA,CAACA,eAAc,EAAE,GAAW,SAAuB;AACjD,UAAM,MAAMD,SACV;MACE,MAAM,KAAK,KAAK;MAChB,MAAM,KAAK;MACX,MAAM,OAAO,KAAK,IAAI;MACtB,IAAI,KAAK,IAAI;OAEf,OAAO;AAET,WAAO,GAAG,KAAK,OAAO,WAAW,CAAC,IAAI,GAAG;EAC3C;;;;EAKA;;;;EAKA;;;;EAKA;;;;EAKA;EAEA,YACE,MACA,MACA,MACA,IAAS;AAET,SAAK,OAAO;AACZ,SAAK,KAAK;AACV,SAAK,OAAO;AACZ,SAAK,OAAO;EACd;;;;EAKA,IAAI,OAAI;AACN,WAAO,KAAK,KAAK;EACnB;;;;EAKA,IAAI,MAAG;AACL,WAAO,KAAK,SAAS;EACvB;EAEA,IAAI,WAAQ;AACV,WAAO,KAAK,SAAS,kBAAkB,KAAK,SAAS;EACvD;EAEA,IAAI,OAAI;AACN,WAAO,KAAK,SAAS,UAAU,KAAK,SAAS;EAC/C;EAEA,IAAI,eAAY;AACd,WAAO,KAAK,SAAS;EACvB;EAEA,QAAK;AACH,WAAO,CAAC,KAAK,KACT,KAAK,WACL,UACE,KAAK,GAAG,IACR,KAAK,MACL,KAAK,KAAK,UACV,KAAK,KAAK,WAAW;EAE7B;;;;ACxFF,SAAS,WAAAE,gBAA+B;;;ACYjC,IAAM,qBAAqB,CAAC,SAIjC,KAAK,YAAY,KAAK,MAAM,8BAC1B,KAAK,WAAW,2BAChB,KAAK,MAAM,sBACX;AAEG,IAAM,yBAAyB,CAAC,WAA8B;EACnE,KAAK,CAAC,EAAE,QAAQ;EAChB,UAAU,CAAC,EAAE,QAAQ;;AAGhB,IAAM,uBAAuB;AAC7B,IAAM,2BAA2B;AACjC,IAAM,sBAAsB;AAC5B,IAAM,8BAA8B;;;ACD3C,IAAM,cAAc,CAClB,OACA,eACA,aACE;AAGF,QAAM,MAAc,CAAC,GAAG,KAAK,EAAE,OAAO,UAAQ,CAAC,KAAK,QAAQ;AAE5D,QAAM,eAAuB,IAAI,KAAK,CAAC,GAAG,MACxC,EAAE,GAAG,cAAc,EAAE,IAAI,IAAI,CAAC;AAGhC,QAAM,MAAmC,CAAA;AACzC,aAAW,QAAQ,cAAc;AAC/B,UAAM,iBACJ,KAAK,YAAY,YAAY,CAAC,KAAK,SAAS,WAAW,QAAQ;AACjE,UAAM,WAAW,iBAAiB,KAAK,WAAW;AAElD,UAAM,WAEF,KAAK,GAAG,WAAW,MAAM,KACzB,KAAK,SAAS,SACZ,wBACE,KAAK,KACL,mBACA,KAAK,IAAI,IAGb,SACA,KAAK;AAET,UAAM,QAAQ,mBAAmB,IAAI;AACrC,UAAM,eAA6B,CAAC,OAAO,KAAK,IAAI;AAEpD,QAAI,KAAK,WAAW;AAClB,mBAAa,CAAC,IAAI,KAAK;IACzB;AAEA,QAAI,UAAU;AACZ,mBAAa,CAAC,IAAI;IACpB;AAEA,QAAI,UAAU;AACZ,mBAAa,CAAC,IAAI;IACpB;AAEA,QAAI,eAAe;AACjB,mBAAa,CAAC,IAAI,KAAK;IACzB;AAEA,QAAI,KAAK,EAAE,IAAI;EACjB;AACA,SAAO;AACT;AAEA,IAAM,cAAc,CAAC,UACnB,OAAO,YACL,CAAC,GAAG,KAAK,EACN,KACC,CAAC,GAAG;;;;EAIF,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,KAChD,EAAE,KAAK,GAAG,cAAc,EAAE,KAAK,IAAI,IAAI,KACvC,EAAE,KAAK,cAAc,EAAE,MAAM,IAAI,MAChC,EAAE,IAAI,MAAM,IAAI,cAAc,EAAE,IAAI,MAAM,EAAE;CAAC,EAGjD,IAAI,CAAC,SAA+C;EACnD,GAAG,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,IAAI;EACjC,GAAG,KAAK,IAAI,IAAI,KAAK,KAAK,YAAY,GAAG,IAAI,KAAK,IAAI,MAAM,SAAS;CACtE,CAAC;AAGR,IAAMC,wBAAuB,CAC3B,eAEA,EAAE,CAAC,cAAc,OAAO,eAAe;AAEzC,IAAM,qBAAqB,CACzB,cACA,UACE;AACF,QAAM,MAA8B,CAAA;AACpC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,QAAI,CAAC,aAAa,GAAG,KAAK,aAAa,GAAG,MAAM,OAAO;AACrD,UAAI,GAAG,IAAI;IACb;EACF;AACA,SAAO;AACT;AAEO,IAAM,eAAe,CAAC,EAC3B,OACA,aAAa,UACb,qBAAqB,iBACrB,UACA,YACA,eACA,oBAAoB,gBAAe,MACL;AAC9B,QAAM,gBACJA,sBAAqB,QAAQ,IAC3B,mBAAmB,iBAAiB,QAAQ,IAC5C;AACJ,QAAM,uBACJA,sBAAqB,eAAe,IAClC,mBAAmB,wBAAwB,eAAe,IAC1D;AACJ,QAAM,kBACJA,sBAAqB,UAAU,IAC7B,mBAAmB,mBAAmB,UAAU,IAChD;AACJ,QAAM,uBACJA,sBAAqB,eAAe,IAClC,mBAAmB,wBAAwB,eAAe,IAC1D;AACJ,QAAM,WAAW,CAAC,UAChB,SAAS,OAAO,KAAK,KAAK,EAAE;AAC9B,SAAO;IACL,SAAS;MACP,GAAI,SAAS,oBAAoB,IAC/B,EAAE,oBAAoB,qBAAoB,IAC1C;MACF,GAAI,aAAa,UAAa,aAAa,kBACzC,EAAE,SAAQ,IACV;MACF,GAAI,SAAS,UAAU,IACrB,EAAE,YAAY,gBAAe,IAC7B;MACF,GAAI,SAAS,aAAa,IACxB,EAAE,aAAa,cAAa,IAC5B;MACF,GAAI,SAAS,oBAAoB,IAC/B,EAAE,qBAAqB,qBAAoB,IAC3C;;IAEJ,OAAO,YAAY,MAAM,MAAM,OAAM,GAAI,eAAe,QAAQ;IAChE,OAAO,YAAY,MAAM,KAAK;;AAElC;;;AC9KO,IAAMC,aAAuB;AAuDpC,IAAMC,eAAc,IAAI,OACtB,WAAWD,UAAS,KAAKA,UAAS,KAAKA,UAAS,KAAKA,UAAS,MAC5DA,UACF,KAAKA,UAAS,iCAEeA,UAAS,KAClCA,UACF,OAAOA,UAAS,KAAKA,UAAS,OAAO;AAGlC,IAAME,WAAU,CAAC,QACtB,OAAO,QAAQ,YAAYD,aAAY,KAAK,GAAG;AAE1C,IAAME,WAAU,CAAC,QAAsB;AAC5C,MAAI,CAACD,SAAQ,GAAG,GAAG;AACjB,UAAM,MAAM,mBAAmB;MAC7B,OAAO;KACR;EACH;AACA,SAAO;AACT;AAyBO,IAAME,cAAa,CAACC,QAA0B;AACnD,QAAM,CAAC,MAAM,QAAQ,IAAI,QAAQ,KAAK,IAAIA,IAAG,MAAMC,YAAW,CAAC;AAC/D,QAAM,IAAI,mBAAmB,KAAK;AAClC,UAAQ,MAAM;IACZ,KAAK;IACL,KAAK,IAAI;AACP,UAAI,WAAW,QAAW;AACxB,cAAM,MAAM,WAAW,IAAI,OAAO,EAAE,OAAOD,IAAE,CAAE;MACjD;AACA,YAAM,IAAgB;QACpB,QAAQ;QACR;QACA,mBAAmB,MAAM;;AAE3B,UAAI;AAAO,UAAE,KAAK,mBAAmB,KAAK,CAAC;AAC3C,aAAO;IACT;IACA,KAAK;IACL,KAAK;IACL,KAAK,aAAa;AAChB,YAAM,IAAgB,CAAC,MAAM,CAAC;AAC9B,UAAI;AAAQ,UAAE,KAAK,mBAAmB,MAAM,CAAC;AAC7C,aAAO;IACT;IACA,SAAS;AACP,YAAM,MAAM,sBAAsB;QAChC,OAAO;QACP,cAAc,CAAC,OAAO,QAAQ,aAAa,UAAU,EAAE;OACxD;IACH;EACF;AACF;;;AClIO,IAAM,gBAAgB,CAAC,SAAmB;AAC/C,MAAI,CAAC;AAAM,WAAO;AAClB,QAAME,WAAU,KAAK,UAAU,IAAI,KAAK,OAAO,KAAK;AACpD,QAAM,CAAC,MAAM,KAAK,WAAW,IAAIC,YAAW,KAAK,EAAE;AAEnD,MAAI,SAAS,YAAY;AACvB,UAAM,SAAS,MAAM,GAAG,GAAG,MAAM;AACjC,WAAO,GAAG,MAAM,GAAG,WAAW;EAChC,WAAW,SAAS,aAAa;AAC/B,WAAO,aAAa,KAAK,IAAI;EAC/B,WAAW,SAAS,UAAU,KAAK,cAAc;AAC/C,WAAO,QAAQ,KAAK,IAAI;EAC1B,OAAO;AAGL,UAAMC,eACJ,KAAK,SAAS,KAAK,KAAK,IAAI,KAAK,IAAI,GAAGF,QAAO,KAAK;AACtD,WAAO,GAAG,IAAI,IAAI,GAAG,IAAIE,YAAW;EACtC;AACF;;;ACFM,IAAO,OAAP,MAAO,MAAI;EACf,KAAK,OAAO,WAAW,IAAC;AACtB,WAAO;EACT;EAEA;EACA;EAEA,YAAY;;;;;;;;EAQZ,IAAI,WAAQ;AACV,WAAO,KAAK;EACd;EACA,IAAI,SAAS,UAAiB;AAC5B,UAAM,SAAS,KAAK;AACpB,SAAK,YAAY;AACjB,QAAI,UAAU,CAAC,UAAU;AAEvB,iBAAW,EAAE,IAAI,UAAAC,UAAQ,KAAM,KAAK,SAAS,OAAM,GAAI;AACrD,YAAI,CAACA,aAAY,IAAI;AAAU,aAAG,WAAW;MAC/C;IACF;EACF;EAEA,aAAU;AACR,WAAO,KAAK;EACd;EAEA,OAAO;;;;;;;EAOP,IAAI,MAAG;AACL,WAAO,KAAK;EACd;EACA,IAAI,IAAI,KAAY;AAClB,UAAM,SAAS,KAAK;AACpB,SAAK,OAAO;AACZ,QAAI,UAAU,CAAC,KAAK;AAElB,iBAAW,EAAE,IAAI,KAAAC,KAAG,KAAM,KAAK,SAAS,OAAM,GAAI;AAChD,YAAI,CAACA,QAAO,IAAI;AAAK,aAAG,MAAM;MAChC;IACF;EACF;EAEA,QAAK;AACH,WAAO,KAAK;EACd;;;;EAKA,UAAU,oBAAI,IAAG;;;;;EAMjB,WAAW,oBAAI,IAAG;;;;EAKlB;;;;EAKA,WAAW;;;;EAKX,eAAe;;;;EAKf;;;;EAKA;;;;EAKA;;;;EAKA;;;;;;EAOA;;;;;;;EAQA;EACA,IAAI,OAAI;AACN,QAAI,KAAK;AAAO,aAAO,KAAK;AAC5B,SAAK,QAAQ,KAAK;AAClB,WAAO,KAAK;EACd;;;;;;;;;EAUA,IAAI,cAAW;AACb,UAAM,MAAM,KAAK;AACjB,WAAO,KAAK,WAAU,IAClB,IAAI,UAAU,GAAG,IAAI,SAAS,KAAK,KAAK,SAAS,CAAC,IAClD,MAAM;EACZ;;;;;;;EAQA;;;;EAKA;;;;EAKA,IAAI,WAAQ;AACV,QAAI,KAAK,WAAW;AAClB,aAAO,KAAK;IACd;AACA,SAAK,YAAY,uBAAuB,KAAK,EAAE,iBAAiB,KAAK,IAAI;AAEzE,SAAK,aAAa,MAAM;AACxB,WAAO,KAAK;EACd;EAEA,IAAI,SAAS,UAAgB;AAC3B,SAAK,YAAY;AAEjB,QAAI,KAAK,eAAe,MAAK,UAAU,YAAY;AACjD,WAAK,aAAa,MAAK,UAAU;IACnC;EACF;EAEA,YACE,SACAC,KACA,UACA,MACA,MACAC,UAAgB;AAEhB,SAAK,WAAW;AAChB,SAAK,cAAc,QAAQ;AAC3B,QAAID,KAAI;AACN,WAAK,KAAKA;IACZ,OAAO;AACL,UAAI,CAAC,YAAY,CAAC,MAAM;AACtB,cAAM,UACJ,gEACA;UACE;SACD;MAEL;AACA,WAAK,KAAK,MAAM,MAAM,QAAQ;IAChC;AACA,SAAK,QAAQ,QAAQ;AACrB,SAAK,WAAW;AAChB,SAAK,QAAQ,QAAQ,KAAK,UAAU;AACpC,SAAK,UAAUC,YAAW,KAAK,UAAU;EAC3C;;;;;;EAOA,aAAU;AAIR,UAAM,UAAU,KAAK,SAAS,SAC5B,QAAQ,KAAK,EAAE,iBAAiB,KAAK,IAAI,EAAE;AAE7C,SAAK,aAAa,MAAM;AACxB,WAAO;EACT;EAEA,sBAAsB,OAAiB;AACrC,UAAM,OAAO,aAAa,OAAO,KAAK,OAAO,KAAK,QAAQ;AAC1D,SAAK,WACH,KAAK,UAAU,MAAM,WAAW,KAAK;AACvC,SAAK,cAAc,KAAK,UAAU,MAAM;EAC1C;EAEA,OAAO,OAAW;AAChB,WAAO,KAAK,OAAO,MAAM,MAAM,KAAK,aAAa,MAAM;EACzD;;;;EAKA,oBAAoB,UAAgB;AAClC,SAAK,YAAY;AACjB,SAAK,WAAW;EAClB;;;;;;EAOA,cAAW;AAIT,UAAM,QAAQ,WAAW,KAAK,EAAE;AAChC,UAAM,CAAC,MAAM,QAAQ,IAAI;AACzB,YAAQ,MAAM;MACZ,KAAK;AACH,aAAK,sBAAsB,KAAK;AAChC;MACF;AACE,aAAK,WAAW;AAChB;IACJ;EACF;EAEA,qBAAkB;AAChB,UAAM,MAAM,uBAAuB,KAAK,EAAE,iBAAiB,KAAK,IAAI;AAGpE,QACE,CAAC,KAAK,aACL,CAAC,KAAK,aACJ,KAAK,cAAc,OAClB,2BAA2B,KAAK,KAAK,SAAS,IAClD;AACA,WAAK,YAAY;IACnB;EACF;;;;EAKA,WAAW,MAA2B,MAAY,MAAW;AAC3D,UAAM,OAAO,IAAI,KAAK,MAAM,MAAM,MAAM,IAAI;AAC5C,UAAM,QAAQ,IAAI,IAAI;AACtB,SAAK,SAAS,IAAI,KAAK,MAAM,IAAI;AACjC,WAAO;EACT;EAEA,SAAM;AACJ,WAAO;MACL,IAAI,KAAK;MACT,MAAM,KAAK;MACX,SAAS,KAAK;MACd,UAAU,KAAK;MACf,UAAU,KAAK;MACf,UAAU,KAAK;MACf,aAAa,KAAK;MAClB,WAAW,KAAK;MAChB,UAAU,KAAK;MACf,KAAK,KAAK;MACV,UAAU,KAAK;;EAEnB;EAEA,WAAQ;AACN,WAAO,cAAc,IAAI;EAC3B;;;;ALpTF,IAAMC,kBAAiB,OAAO,IAAI,4BAA4B;AAI9D,IAAM,YAAY,eAAe,CAAC,QAAQ,GAAG,CAAC;AAuBxC,IAAO,QAAP,MAAY;EAChB,KAAK,OAAO,WAAW,IAAC;AACtB,WAAO;EACT;EAEA;EAEA;;;;EAKA;;;;EAKA;;;;EAKA,QAAQ,oBAAI,IAAG;;;;EAKf,QAAQ,oBAAI,IAAG;;;;EAKf,cAAc,oBAAI,IAAG;;;;EAKrB,cAAc,oBAAI,IAAG;;;;EAKrB,qBAAqB,oBAAI,IAAG;;;;EAK5B,YAAY,oBAAI,IAAG;;;;EAKnB;;;;EAKA,yBAAyB,oBAAI,IAAG;;;;EAKhC;EAEA,YAAY,SAAqB;AAC/B,UAAM,EAAE,cAAc,WAAW,UAAU,YAAW,IAAK;AAC3D,SAAK,WAAW;AAChB,SAAK,YAAY,aAAa,oBAAI,IAAG;AACrC,SAAK,cAAc;AACnB,SAAK,eAAe;MAClB,GAAG,KAAK;MACR,OAAO;;AAIT,UAAM,uBAAuB;AAC7B,UAAM,mBAAmBC,MAAK,MAC5B,aAAa,QAAQ,UACrB,oBAAoB;AAEtB,UAAM,eAAe,KAAK,QACxB,WACA,cACA,gBAAgB;AAElB,iBAAa,oBAAoB,oBAAoB;AACrD,iBAAa,eAAe;AAC5B,SAAK,eAAe;AACpB,SAAK,UAAU,IAAI,YAAY;AAC/B,SAAK,UAAU,IAAI,aAAa,IAAI,YAAY;AAIhD,SAAK,WAAW;AAChB,QAAI,KAAK,UAAU;AACjB,iBAAW,MAAM,KAAK,UAAU;AAC9B,cAAM,SAAS,KAAK,QAClB,GAAG,IACH,GAAG,UACH,QACA,GAAG,IAAI;AAET,eAAO,oBAAoB,KAAK,GAAG,IAAI,EAAE;AACzC,YAAI,OAAO,UAAU;AACnB,eAAK,UAAU,IAAI,OAAO,IAAI,OAAO,QAAQ;QAC/C;AACA,aAAK,UAAU,IAAI,MAAM;MAC3B;IACF;EACF;;;;;;;;;;EAWA,KAAE;AACA,UAAM,EAAE,MAAK,IAAK;AAClB,SAAK,QAAQ,oBAAI,IAAG;AACpB,UAAM,SAAS,IAAI,IAAI,KAAK,SAAS;AACrC,eAAW,OAAO,QAAQ;AAExB,YAAM,OAAO,IAAI,EAAE;AACnB,WAAK,MAAM,IAAI,IAAI,IAAI,GAAG;AAC1B,iBAAW,EAAE,GAAE,KAAM,IAAI,SAAS,OAAM,GAAI;AAC1C,YAAI,CAAC,MAAM,OAAO,IAAI,EAAE;AAAG;AAC3B,eAAO,IAAI,EAAE;AACb,cAAM,OAAO,GAAG,EAAE;AAClB,aAAK,MAAM,IAAI,GAAG,IAAI,EAAE;MAC1B;IACF;AACA,eAAW,QAAQ,MAAM,OAAM,GAAI;AACjC,WAAK,WAAW,IAAI;IACtB;AACA,WAAO;EACT;;;;;;EAOA,QACE,MACA,MACA,MACA,IAAa;AAGb,QAAI,KAAK,SAAS,aAAa;AAC7B,UAAI,IAAI;AACN,aAAK,OAAO,GAAG,QAA6B;AAC5C,aAAK,OAAO,GAAG,GAAG,IAAI,IAAI,KAAK,QAAQ;MACzC,OAAO;AACL,cAAM,MACJ,sDACA,EAAE,KAAI,CAAE;MAEZ;IACF;AACA,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK,IAAI;AAC5C,QAAI,UAAU;AACZ,YAAM,OAAO;AACb,UACE,KAAK,SAAS,QACd,KAAK,KAAK,aAAa,KAAK,UAC5B;AACA,YAAI,MAAM,OAAO,KAAK,IAAI;AACxB,eAAK,KAAK;AACV,eAAK,GAAG,QAAQ,IAAI,IAAI;QAC1B;AACA,eAAO;MACT;AACA,WAAK,MAAM,OAAO,IAAI;IACxB;AACA,UAAM,IAAI;AACV,UAAM,UAAU,EAAE,WAAW,MAAM,MAAM,EAAsB;AAC/D,SAAK,MAAM,IAAI,OAAO;AACtB,WAAO;EACT;;;;EAKA,eAAe,MAAY,UAAc;AACvC,UAAM,IAAI,KAAK;AAEf,UAAM,WACJ,EAAE,SAAS,SAAS,SAAS,WAAW,QAAQ;AAClD,UAAM,KAAK,WAAW,OAAO,CAAC;AAC9B,UAAM,SAAS,KAAK,YAAY,IAAI,EAAE;AACtC,QAAI;AAAQ,aAAO;AACnB,UAAM,MAAM,KAAK,YAAY,IAAI,EAAE,IAAI;AACvC,QAAI,CAAC;AAAK,aAAO;AACjB,eAAW,QAAQ,KAAK;AACtB,UACE,UACE,KAAK,IACL,GACA,SAAS,UACT,KAAK,aACL,KAAK,QAAQ,GAEf;AACA,aAAK,YAAY,IAAI,IAAI,IAAI;AAE7B,aAAK,mBAAmB,IAAI,IAAI,GAAG,IAAI,EAAE;AACzC,eAAO;MACT;IACF;EACF;;;;EAKA,QACEC,KACA,UACA,MACA,MACAC,UAAgB;AAEhB,UAAM,OAAO,IAAI,KACf,KAAK,cACLD,KACA,UACA,MACA,MACAC,QAAO;AAET,SAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAC5B,UAAM,MAAM,KAAK,YAAY,IAAI,KAAK,IAAI,KAAK,oBAAI,IAAG;AACtD,QAAI,IAAI,IAAI;AACZ,SAAK,YAAY,IAAI,KAAK,MAAM,GAAG;AACnC,QAAI,MAAM;AACR,YAAM,IAAI,OAAO,KAAK,KAAK;AAG3B,UAAI,KAAK,MAAM,SAAS,QAAQ;AAC9B,aAAK,YAAY,IAAI,GAAG,IAAI;AAC5B,cAAM,OAAO,KAAK,mBAAmB,IAAI,IAAI,KAAK,oBAAI,IAAG;AACzD,aAAK,IAAI,CAAC;AACV,aAAK,mBAAmB,IAAI,MAAM,IAAI;MACxC;IACF;AACA,QAAI,UAAU;AACZ,WAAK,UAAU,IAAI,KAAK,IAAI,QAAQ;IACtC;AACA,WAAO;EACT;;;;;;;;;EAUA,aACE,UACA,SACA,MACA,UACAD,KAAU;AAIV,QAAI,CAAC,YAAY,CAACA,KAAI;AACpB,WAAK,QAAQ,SAAS,MAAM,QAAQ;AACpC;IACF;AAGA,UAAM,QAAQ;MACZ,KAAK,SAAS,OAAO,YAAY;MACjC,UACE,SAAS,YACT,YAAY,cACZ,YAAY;;AAGhB,UAAM,QAAQA,OAAO,YAAY,MAAM,MAAM,QAAQ;AAGrD,QAAI,CAAC,OAAO;AACV,YAAM,MAAM,8CAA8C;QACxD;QACA;OACD;IACH;AAKA,UAAM,cAAc,KAAK,MAAM,IAAI,KAAK;AACxC,QAAI,aAAa;AACf,WAAK,QAAQ,SAAS,MAAM,UAAU,WAAW;AAGjD,kBAAY,QAAQ,MAAM;AAC1B,kBAAY,aAAa,MAAM;AAC/B,aAAO;IACT;AAGA,UAAM,SAAS,KAAK,QAAQ,OAAO,QAAQ;AAC3C,WAAO,WAAW,KAAK;AACvB,WAAO,MAAM,MAAM;AACnB,WAAO,WAAW,MAAM;AACxB,SAAK,QAAQ,SAAS,MAAM,UAAU,MAAM;AAC5C,WAAO;EACT;;;;;;;;EASA,WAAW,MAAY,aAAkB;AACvC,SAAK,MAAM,OAAO,KAAK,EAAE;AACzB,UAAM,MAAM,KAAK,YAAY,IAAI,KAAK,IAAI;AAE1C,QAAI,KAAK,SAAS;AAAG,WAAK,YAAY,OAAO,KAAK,IAAI;;AACjD,WAAK,OAAO,IAAI;AACrB,eAAW,KAAK,KAAK,mBAAmB,IAAI,IAAI,KAAK,oBAAI,IAAG,GAAI;AAC9D,WAAK,YAAY,OAAO,CAAC;IAC3B;AACA,SAAK,mBAAmB,OAAO,IAAI;AACnC,SAAK,UAAU,OAAO,KAAK,EAAE;AAC7B,eAAW,QAAQ,KAAK,SAAS,OAAM,GAAI;AACzC,WAAK,MAAM,OAAO,IAAI;IACxB;AACA,eAAW,QAAQ,KAAK,SAAS;AAC/B,UACE,eACA,UACE,YAAY,IACZ,KAAK,MACL,KAAK,KAAK,UACV,KAAK,aACL,KAAK,QAAQ,GAEf;AACA,aAAK,KAAK;MACZ,OAAO;AACL,aAAK,KAAK;MACZ;IACF;EACF;EAEA,SAAM;AACJ,WAAO,aAAa;MAClB,GAAG,KAAK;MACR,OAAO;MACP,eAAe;KAChB;EACH;EAEA,CAACF,eAAc,EAAE,GAAW,SAAuB;AACjD,UAAM,OAAO,KAAK,OAAM;AACxB,WAAO,GAAG,KAAK,OAAO,WAAW,CAAC,IAAII,SAAQ,MAAM,OAAO,CAAC;EAC9D;;;;AMhYK,IAAM,wBAAwB,CACnC,QAC+B,qBAAqB,IAAI,GAAG;AAuEtD,IAAM,sBAAsB,oBAAI,IAAwB;EAC7D;EACA;EACA;EACA;CACD;AAKM,IAAM,uBAAuB,oBAAI,IAAyB;EAC/D;EACA;EACA;EACA;EACA;CACD;AAMM,IAAM,kBAAkB,oBAAI,IAGjC;EACA,CAAC,gBAAgB,MAAM;EACvB,CAAC,mBAAmB,KAAK;EACzB,CAAC,oBAAoB,MAAM;EAC3B,CAAC,wBAAwB,UAAU;CACpC;AAKM,IAAM,UAAU,CACrB,UACA,MACA,aACuB;AACvB,QAAM,YAAY,gBAAgB,IAAI,QAAQ;AAC9C,MAAI,CAAC,WAAW;AACd,UAAM,MAAM,gCAAgC;MAC1C,OAAO;MACP,cAAc,CAAC,GAAG,mBAAmB;KACtC;EACH;AACA,MAAI,cAAc,QAAQ;AACxB,WAAO;EACT;AACA,MACE,QACA,UAAU,uBAAuB,IAAI,GAAG,aAAa,MACrD;AACA,WAAO;EACT;AACA,SAAO;AACT;;;ACpHM,SAAU,WAAW,EAAE,OAAO,MAAK,GAAqB;AAC5D,QAAM,MAAwB,CAAA;AAG9B,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,UAAU;AACjB,UAAI,KAAK;;QAEP,MAAM,KAAK,QAAQ,KAAK;QACxB,IAAI;OACL;IACH;EACF;AAGA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK;MACP,MAAM,KAAK;MACX,QAAQ,KAAK,KAAK;MAClB,MAAM,OAAO,KAAK,IAAI;MACtB,MAAM,KAAK;MACX,IAAI,KAAK;KACV;EACH;AAEA,SAAO,KAAK,UAAU,KAAK,MAAM,CAAC;AACpC;;;AC5DA,IAAM,QAAQ,IAAI,IAChB,OAAO,QAAQ;EACb,YAAY;EACZ,MAAM;EACN,cAAc;EACd,gBAAgB;EAChB,GAAG;CACJ,CAAC;AAuBJ,IAAM,aAAa,CACjB,SACA,MACA,SAEA,CAAC,GACE,CAAC,QAAQ,QAAQ,MAAM,SAAS,IAAI,OACpC,CAAC,QAAQ,QAAQ,MAAM,SAAS,IAAI;AAMzC,IAAM,eAAe,CACnB,cACA,YACE;AACF,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,YAAY,oBAAI,IAAG;AAIzB,QAAM,WAAW,IAAI,IAAc,YAAY;AAC/C,aAAW,QAAQ,UAAU;AAC3B,QAAI,KAAK,MAAM;AACb,UAAI,UAAU,IAAI,KAAK,IAAI,GAAG;AAC5B,aAAK,UAAU;AACf;MACF;AACA,gBAAU,IAAI,KAAK,IAAI;AACvB,YAAM,QAAQ,CAAC,GAAG,KAAK,KAAK,SAAS,OAAM,CAAE,EAAE,KAAK,OAClD,OAAO,EAAE,IAAI,QAAQ,CAAC;AAExB,iBAAW,QAAQ,OAAO;AACxB,cAAM,UAAU,UAAU,IAAI,IAAI,KAAK,oBAAI,IAAG;AAC9C,cAAM,WAAqB;UACzB;UACA,MAAM,KAAK;UACX,YAAY;UACZ,SAAS;UACT,QAAQ;UACR,SAAS;UACT,SAAS,WAAW,SAAS,MAAM,KAAK,EAAE;UAC1C,QAAQ;;AAEV,gBAAQ,IAAI,KAAK,IAAI,QAAQ;AAC7B,kBAAU,IAAI,MAAM,OAAO;AAC3B,iBAAS,IAAI,QAAQ;MACvB;IACF;EACF;AACA,aAAW,QAAQ,CAAC,GAAG,QAAQ,EAAE,QAAO,GAAI;AAC1C,QAAI,KAAK,WAAW,KAAK,QAAQ;AAC/B,WAAK,OAAO,UAAU;IACxB;EACF;AACA,SAAO;AACT;AAKM,SAAU,oBACd,SAAmC;AAEnC,QAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,QAAM,OAAO,CAAC,MAAsB;AACpC,QAAM,EACJ,MAAM,MACN,MAAM,MACN,QAAQ,MACR,SAAS,KAAI,IACX,UAAU,CAAA;AACd,QAAM,eAAe,oBAAI,IAAG;AAC5B,aAAW,YAAY,WAAW;AAChC,iBAAa,IAAI;MACf,MAAM,SAAS;MACf,MAAM;MACN,MAAM;MACN,QAAQ;MACR,SAAS;MACT,YAAY;MACZ,SAAS;MACT,SAAS,WAAW,SAAS,QAAW,QAAQ;MAChD,QAAQ;KACT;EACH;AACA,QAAM,YAAY,aAAa,cAAc,OAAO;AAEpD,MAAI,MAAM;AACV,QAAM,WAAW,CAAC,SAAkB;AAClC,QAAI,SAAS;AACb,QAAI,UAAU;AAEd,UAAM,aAAa,KAAK,MAAM,MAAM,WAAW,KAAK,KAAK,EAAE;AAC3D,UAAM,eACJ,aAAa,CAAC,MAAM,cAAc,WAAW,CAAC;AAChD,UAAM,OACJ,eAAe,GAAG,WAAW,CAAC,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK;AACxD,UAAM,gBAEF,QAAQ,sBACR,WAAW,SAAS,KAAK,MAAM,KAAK,IAAI,IAExC,OAAO,IAAI,IACX;AACJ,QAAI,CAAC,KAAK,QAAQ,KAAK,SAAS;AAC9B,YAAMC,WACJ,KAAK,MAAM,KAAK,SAAS,SAAS,IAChC,IAAI,oBAAoB,IACxB,IAAI,WAAW;AACnB,aAAO,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,GAAG,aAAa,IAAIA,QAAO;;IACjE;AAEA,UAAM,UAAU,KAAK,UAAU,IAAI,IAAI,WAAW,CAAC,KAAK;AACxD,cAAU,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,GAAG,aAAa,GAAG,OAAO;;AAGjE,QAAI,CAAC,KAAK,SAAS;AACjB,YAAM,QAAQ,KAAK,OAAO,CAAC,GAAG,KAAK,KAAK,SAAS,OAAM,CAAE,IAAI,CAAA;AAC7D,YAAM,YAAY,MAAM,IAAI,OAAK,UAAU,IAAI,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC;AAC5D,YAAM,gBAAgB,UAAU,OAAO,OAAK,GAAG,OAAO;AAEtD,iBAAW,YAAY,WAAW;AAEhC,YAAI,CAAC;AAAU;AAEf,cAAM,SAAS;AACf,cAAM,SACJ,cAAc,QAAQ,QAAQ,MAAM,cAAc,SAAS;AAC7D,cAAM,SACJ,SAAS,MAAM,UACb,GAAG,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,OAAO,KAC9C,SAAS,MAAM;AACnB,cAAM,WAAW,SAAS,eAAe;AAEzC,iBAAS,OAEL,SAAS,MAAM,QACf,SAAS,MAAM,SAAS,SAAS,MAAM,IAAI,OAE3C,GAAG,SAAS,MAAM,IAAI,KAAK,MAAM,MACjC,GAAG,SAAS,MAAM,IAAI,IAAI,SAAS,MAAM,WAAW,SAAS,MAAM,KAAK,QAAQ;AACpF,iBAAS,UACP,OAAO,OAAO,SACZ,GAAG,OAAO,OAAO,GAAG,OAAO,aAAa,MAAM,IAAI,MAAM,IAAI,GAAG,MAC/D;AACJ,iBAAS,SAAS,GAAG,MAAM,IAAI,QAAQ,CAAC,GAAG,MAAM,IAAI,YAAY,CAAC,GAAG,MAAM,IAAI,YAAY,CAAC;AAC5F,iBAAS,aAAa,CAAC;AAEvB,mBAAW,SAAS,QAAQ;MAC9B;IACF;AAEA,UAAM,oBAAoB,GAAG,MAAM,IAAI,YAAY,CAAC;AACpD,UAAM,mBAAmB,GAAG,MAAM,IAAI,GAAG,CAAC;AAC1C,WAAO,KAAK,UACR,GAAG,UAAU,OAAO,QAAQ,mBAAmB,gBAAgB,IAAI,MAAM,GAAG,OAAO,KACnF;EACN;AAEA,aAAW,QAAQ,cAAc;AAC/B,WAAO,SAAS,IAAI;EACtB;AACA,SAAO,MAAM,GAAG;AAClB;;;ACvLA,IAAI,eAAe;AAEnB,IAAM,YAAY,CAAC,SACjB,IAAI,OAAO,IAAI,EAAE,WAAW,KAAK,MAAM,CAAC;AAE1C,SAAS,UACP,WACA,eACA,MAAc;AAEd,MAAI,UAAU,IAAI,KAAK,EAAE,KAAK,CAAC,cAAc,IAAI,IAAI,GAAG;AACtD,WAAO;EACT;AACA,YAAU,IAAI,KAAK,EAAE;AACrB,QAAM,QAAgB,CAAC,GAAG,KAAK,SAAS,OAAM,CAAE,EAC7C,IAAI,OAAK,UAAU,WAAW,eAAe,CAAC,CAAC,EAC/C,OAAO,OAAO,EACd,KAAK,IAAI;AACZ,SAAO,GAAG,mBAAmB,KAAK,EAAE,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI,MAAM,SAAS,OAAO,EAAE,GAAG,KAAK;AAC9F;AAEA,SAAS,UACP,WACA,eACA,MAAc;AAEd,MAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,WAAO;EACT;AAEA,QAAM,aACJ,GAAG,mBAAmB,KAAK,KAAK,EAAE,CAAC,IAAI,UAAU,KAAK,IAAI,CAAC,UAClD,OAAO,KAAK,IAAI,EAAE,WAAW,KAAK,MAAM,CAAC,KAAK,KAAK,IAAI;AAElE,QAAM,eACJ,KAAK,KAAK,SAAS,SAAS,IAAI,qBAAqB;AACvD,MAAI,CAAC,KAAK,IAAI;AACZ,WAAO,aAAa,WAAW,cAAc,IAAI,YAAY;;EAC/D;AAEA,SACE,aACA,GAAG,mBAAmB,KAAK,GAAG,EAAE,CAAC,IAAI,UAAU,KAAK,EAAE,CAAC;IACvD,UAAU,WAAW,eAAe,KAAK,EAAE;AAE/C;AAKM,SAAU,cAAc,EAC5B,OACA,WACA,MAAK,GACgB;AACrB,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,gBAAgB,oBAAI,IAAG;AAC7B,QAAM,WAAW,IAAI,IACnB,CAAC,GAAG,SAAS,EAAE,IAAI,QAAM,EAAE,MAAM,GAAG,QAAQ,OAAS,EAAG,CAAC;AAG3D,aAAW,QAAQ,UAAU;AAC3B,QAAI,KAAK,IAAI,KAAK,IAAI;AAAG;AACzB,SAAK,IAAI,KAAK,IAAI;AAElB,QAAI,KAAK,gBAAgB,MAAM;AAC7B,UAAI,MAAM,SAAS,KAAK,IAAI,GAAG;AAC7B,sBAAc,IAAI,KAAK,MAAM,IAAI;MACnC;AACA,UAAI,KAAK,KAAK,IAAI;AAChB,iBAAS,IAAI,EAAE,MAAM,KAAK,KAAK,IAAI,QAAQ,KAAK,KAAI,CAAE;MACxD;IACF;AAEA,QAAI,KAAK,gBAAgB,MAAM;AAC7B,UAAI,MAAM,SAAS,KAAK,IAAI,GAAG;AAC7B,sBAAc,IAAI,KAAK,MAAM,IAAI;MACnC;AACA,iBAAW,QAAQ,KAAK,KAAK,SAAS,OAAM,GAAI;AAC9C,iBAAS,IAAI,EAAE,MAAM,MAAM,QAAQ,KAAK,KAAI,CAAE;MAChD;IACF;EACF;AAEA,aAAW,QAAQ,CAAC,GAAG,QAAQ,EAAE,QAAO,GAAI;AAC1C,QAAI,cAAc,IAAI,KAAK,IAAI,KAAK,KAAK,QAAQ;AAC/C,oBAAc,IAAI,KAAK,QAAQ,IAAI;IACrC;EACF;AAEA,SACE,mBACA,CAAC,GAAG,SAAS,EACV,IAAI,OAAK,UAAU,oBAAI,IAAG,GAAW,eAAe,CAAC,CAAC,EACtD,KAAK,IAAI;AAEhB;;;AC5GA,SAAS,gBAAAC,qBAAoB;AAC7B,SAAS,WAAAC,gBAAe;;;ACUjB,IAAM,YAAY,CACvB,OACA,OACA,YACE;AACF,QAAM,UAAU,OAAO,QAAQ,KAAK;AAIpC,aAAW,CAAC,KAAK,KAAK,KAAK,SAAS;AAClC,UAAM,CAAC,QAAQ,QAAQ,IAAI,UAAU,KAAK,KAAK,CAAC;AAChD,UAAM,CAAC,SAAS,OAAO,IAAI,UAAU,OAAO,KAAK,CAAC;AAClD,UAAM,UAAU,SAAS,YAAY,GAAG,KAAK;AAG7C,QAAI,CAAC,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,UAAU,GAAG;AAC/D;IACF;AAEA,UAAM,OAAO,KAAK,MAChB,UACA,QAAQ,UAAU,GAAG,OAAO,GAC5B,OAAO;AAET,UAAM,OAAO,QAAQ,UAAU,UAAU,CAAC;AAC1C,UAAM,OAAO,MAAM,MAAM,IAAIC,SAAQ,MAAM,CAAC;AAC5C,QAAI,CAAC,MAAM;AACT,YAAM,MAAM,qCAAqC;QAC/C,OAAO;UACL,OAAO,CAAC,GAAG,MAAM,KAAK,EAAE,IAAI,CAAC,CAACC,GAAE,MAAMA,GAAE;UACxC;UACA;UACA,MAAM,EAAE,CAAC,GAAG,GAAG,MAAK;;OAEvB;IACH;AACA,UAAM,KACJ,SAAS,YAAY,SAAY,MAAM,MAAM,IAAID,SAAQ,IAAI,CAAC;AAChE,QAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC,YAAM,MAAM,iDAAiD;QAC3D,cAAc,CAAC,GAAG,mBAAmB;OACtC;IACH;AACA,UAAM,QAAQ,SAAS,MAAM,MAAM,EAAE;EACvC;AACF;;;ACnDO,IAAM,YAAY,CACvB,OACA,UACE;AACF,QAAM,UAAU,OAAO,QAAQ,KAAK;AACpC,aAAW,CAACE,KAAI,YAAY,KAAK,SAAS;AAGxC,QAAI,MAAM,MAAM,IAAIA,GAAE;AAAG;AAEzB,UAAM,CAAC,OAAO,MAAM,WAAW,UAAU,UAAU,QAAQ,IACzD;AACF,UAAM,CAAC,MAAK,EAAG,IAAI,IAAIC,YAAWD,GAAE;AAIpC,UAAM,OACJ,WACE,MAAM,QAAQA,KAAI,QAAQ,IAC1B,MAAM,QACJA,KACA,QACA,QACA,QAAQ,QACR,SAAS,cAAc,KAAK,QAAQ,GAAG,IAAI,IACzC,KAAK,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,IAC3B,MAAS;AAGjB,UAAM,EAAE,KAAK,SAAQ,IAAK,uBAAuB,KAAK;AACtD,SAAK,MAAM;AACX,SAAK,WAAW;AAChB,SAAK,YAAY,aAAa;AAC9B,SAAK,WAAW,YAAY;AAC5B,QAAI;AAAU,WAAK,WAAW;EAChC;AACF;;;AFEO,IAAM,aAAa,CAAC,YAA+B;AACxD,QAAM,EAAE,YAAW,IAAK;AACxB,SAAO,WACL,SACA,KAAK,MACHE,cACEC,SAAQ,aAAa,6BAA6B,GAClD,EAAE,UAAU,OAAM,CAAE,CACrB,CACF;AAEL;AAEO,IAAM,aAAa,CACxB,SACAC,kBACE;AACF,QAAM,EAAE,cAAc,OAAM,IAAK;AACjC,QAAM,cAAc,QAAQ,eAAe,IAAI,YAAW;AAC1D,QAAM,WACJ,QAAQ,YACR,SAAS,UAAU,QAAQ,aAAa,EAAE,aAAa,OAAM,CAAE;AACjE,QAAM,EACJ,oBAAoB,iBACpB,UACA,YACA,aAAa,UACb,qBAAqB,gBAAe,IAClCA,cAAa;AACjB,QAAM,gBAAgB;IACpB,GAAG;IACH,oBAAoB;MAClB,GAAG,QAAQ,kBAAkB;MAC7B,GAAG;;IAEL,UAAU,YAAY,QAAQ;IAC9B,YAAY;MACV,GAAG,QAAQ;MACX,GAAG;;IAEL,aAAa;MACX,GAAG,QAAQ,WAAW;MACtB,GAAG;;IAEL,qBAAqB;MACnB,GAAG,QAAQ,mBAAmB;MAC9B,GAAG;;;AAGP,QAAM,QAAQ,IAAI,MAAM;IACtB,GAAG;IACH;IACA;GACD;AAED,YAAU,OAAOA,cAAa,KAAK;AACnC,YAAU,OAAOA,cAAa,OAAO,aAAa;AAElD,SAAO;AACT;;;AG3CA,IAAM,gBAAgB,oBAAI,IAAI,CAAC,QAAQ,WAAW,CAAC;AACnD,IAAM,kBAAkB,CACtB,SACiC,cAAc,IAAI,IAAI;AACzD,IAAM,iBAAiB,CACrB,MACAC,UAEA,gBAAgB,KAAK,IAAI,IACvB,eAAe,CAAC,KAAK,MAAMA,KAAI,CAAC,IAChC;AAKJ,IAAM,YAAY,CAAC,EAAE,QAAQ,KAAI,MAC/B,QAAQ,SAAS,SAAS,QAAQ,IAAI,IACpC,QAAQ,UAAU,QAAQ,UAAU,MAAM,IAC1C;AAKJ,IAAM,kBAAkB,CAAC,EACvB,QACA,MACA,MAAK,MAEL,QAAQ,SAAS,iBAAiB,SAChC,UAAU,SAAS,UAAU,CAAC,QAAQ,gBAAgB,MAAM,IAC5D;AAKJ,IAAM,WAAW,CAAC,EAAE,QAAQ,KAAI,MAC9B,QAAQ,KAAK,WAAW,GAAG,IAAI,GAAG,OAAO,IAAI,IAAI,IAAI,KAAK;AAE5D,IAAM,gBAAgB,CAAC,MACrB,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,OAAK,OAAO,MAAM,QAAQ;AAMxD,IAAM,UAAU,CAAC,SAAc;AAC7B,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,aAAsB,KAAK,UAAU,sBAAsB,CAAA;AAGjE,QAAM,UAEF,CAAC,KAAK,YACN,CAAC,KAAK,GAAG,WAAW,KAAK,KACzB,cAAc,UAAU,IAExB,IAAI,IAAI,UAAU,IAClB,oBAAI,IAAG;AACX,aAAW,WAAW,qBAAqB;AACzC,UAAM,MACJ,KAAK,WAAW,OAAO;AAIzB,QACE,YAAY,qBACZ,CAAC,KAAK,YACN,CAAC,KAAK,GAAG,WAAW,KAAK,KACzB,CAAC,KAAK,GAAG,WAAW,MAAM,GAC1B;AACA;IACF;AACA,QAAI,KAAK;AACP,iBAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,GAAG,GAAG;AAElD,YAAI,QAAQ,IAAI,IAAI;AAAG;AACvB,qBAAa,IAAI,MAAM;UACrB;UACA,MAAM;UACN;UACA,UAAU,KAAK;SAChB;MACH;IACF;EACF;AACA,SAAO;AACT;AAQA,IAAM,UAAU,CACd,QACA,SACA,iBACE;AACF,QAAM,MAAM,oBAAI,IAAG;AACnB,aAAW,SAAS,OAAO,YAAY,OAAO,GAAG;AAE/C,QAAI,MAAM,KAAK,WAAW,GAAG;AAAG;AAIhC,QAAI,MAAM,KAAK,WAAW,GAAG,GAAG;AAC9B,YAAM,cAAc,QAAQ,QAAQ,OAAO,YAAY;AACvD,iBAAW,cAAc,aAAa;AACpC,YAAI,IAAI,UAAU;MACpB;AACA;IACF;AAGA,QAAI,CAAC,MAAM,eAAc;AAAI;AAK7B,UAAMC,YAAW,MAAM,aAAY;AACnC,QAAI,CAACA,WAAU;AACb;IACF;AAGA,UAAM,QAAQ,SAAS,KAAK;AAC5B,UAAM,OAAO,SAASA,SAAQ;AAC9B,QAAI,IAAI;MACN;MACA;MACA,UAAAA;KACD;EACH;AACA,SAAO;AACT;AAMA,IAAM,WAAW,CACf,SACA,QACA,aACA,WACA,OACA,UACA,YACE;AACF,QAAM,EAAE,cAAa,IAAK;AAC1B,QAAM,eAAe,QAAQ,QAAQ;AACrC,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,YAA4B,QAChC,QACA,SACA,SAAS,IAAI;AAGf,aAAW,EAAE,OAAO,MAAM,UAAAA,UAAQ,KAAM,WAAW;AACjD,QAAI;AAIJ,aAAS,IAAI,KAAK;AAIlB,QAAI,CAAC,eAAe;AAClB,YAAM,QAAQ,UAAUA,SAAQ;AAEhC,UAAI,OAAO;AACT,cAAM,IAAI,QAAQ,OAAO,OAAO;UAC9B,GAAG;UACH,UAAU,SAAS;SACpB;AAKD,eAAO,MAAM;UACX;UACA;;UACA;;UACA;YACE;YACA,GAAI,EAAE,eACJ,EAAE,SAAS,EAAE,aAAY,IACzB;;UAEJ;QAAK;MAET;IACF;AAKA,UAAM,OAAO,aAAa,IAAI,KAAK;AAMnC,QAAI,CAAC,MAAM;AACT,YAAM,OAAO,YAAY,KAAKA,UAAS,SAAQ,CAAE;AAGjD,YAAM,OAAO,MAAM,QAAQ;AAC3B,YAAM,WAAW,MAAM,YAAY;AAEnC,YAAM,UAAU,QAAQ,MAAM,OAAO,SAAS,QAAQ;AACtD,YAAM,OAAOC,MAAK,MAAM,OAAO,UAAU;QACvC,GAAG;QACH,UAAU,SAAS;OACpB;AACD,YAAM,UAAU,eAAe,MAAMD,UAAS,cAAa,CAAE;AAC7D,aAAO,MAAM,aACX,UACA,SACA,MACA,MACA,OAAO;IAEX;AAEA,QAAI,MAAM;AAOR,UAAI,iBAAiB,CAAC,MAAM;AAC1B,cAAM,CAAC,IAAI,IAAI,KAAK;AACpB,YAAI,MAAM;AACR,gBAAM,uBAAuB,IAAI,IAAI;QACvC;MACF;AAIA,WAAK,WAAW,KAAKA,UAAS,cAAa,CAAE;AAC7C,YAAM,eAAe,gBAAgBA,SAAQ;AAI7C,UAAI,cAAc;AAChB,kBAAU,IAAI,MAAM,YAAY;MAClC;IACF;EACF;AAIA,aAAW,EAAE,MAAM,MAAM,SAAQ,KAAM,aAAa,OAAM,GAAI;AAC5D,QAAI,CAAC,SAAS,IAAI,IAAI,GAAG;AACvB,YAAM,UAAU,QAAQ,MAAM,MAAM,SAAS,QAAQ;AACrD,YAAM,OAAOC,MAAK,MAAM,MAAM,UAAU;QACtC,GAAG;QACH,UAAU,SAAS;OACpB;AACD,YAAM,aAAa,UAAU,SAAS,IAAI;IAC5C;EACF;AACF;AAOO,IAAM,OAAO,CAAC,YAA+B;AAElD,QAAM,EACJ,qBAAqB,MACrB,aACA,aACA,QACA,SAAQ,IACN;AACJ,QAAM,eACJ,QAAQ,gBAAgB,YAAY,KAAK,WAAW;AAEtD,MAAI,CAAC,oBAAoB;AACvB,QAAI;AACF,YAAMC,SAAQ,WAAW;QACvB;QACA;QACA;QACA;QACA;OACD;AAED,aAAOA;IACT,QAAQ;IAAC;EACX;AAEA,QAAM,QAAQ,IAAI,MAAM,EAAE,GAAG,SAAS,aAAY,CAAE;AACpD,QAAM,YAAY,oBAAI,IAAG;AAGzB,aAAW,YAAY,MAAM,WAAW;AACtC,cAAU,IACR,UACA,OAAO,IAAI,QAAQ,GAAG,SAAS,QAAQ,eAAe,CAAC;EAE3D;AAKA,aAAW,CAAC,MAAMH,KAAI,KAAK,UAAU,QAAO,GAAI;AAC9C,aACE,SACA,QACA,aACA,WACA,OACA,MACAA,KAAI;EAER;AAEA,SAAO;AACT;;;ACpYA,SAAS,aAAa;AACtB,SAAS,UAAAI,eAAc;AACvB,SAAS,YAAAC,WAAU,eAAe;;;ACClC,IAAM,cAAc,CAAC,KAAU,MAC7B,OAAO,QAAQ,eAAe,OAAO,QAAQ;AAExC,IAAM,kBAAkB,CAAC,MAC9B,CAAC,CAAC,KACF,OAAO,MAAM,YACb,YAAY,EAAE,cAAc,SAAS,KACrC,YAAY,EAAE,KAAK,QAAQ,KAC3B,YAAY,EAAE,YAAY,QAAQ,KAClC,YAAY,EAAE,YAAY,QAAQ,KAClC,YAAY,EAAE,SAAS,QAAQ,KAC/B,YAAY,EAAE,YAAY,QAAQ,MACjC,YAAY,EAAE,MAAM,SAAS,KAAM,EAAE,QAAQ,OAAO,EAAE,SAAS,aAChE,YAAY,EAAE,QAAQ,UAAU;AAE3B,IAAM,sBAAwC,CACnD,MAC8B;AAC9B,MAAI,CAAC,gBAAgB,CAAC,GAAG;AACvB,UAAM,IAAI,MAAM,wBAAwB;EAC1C;AACF;AAsBA,IAAM,UAAU,CACd,QAK8B;AAC9B,sBAAoB,GAAG;AACvB,QAAM,EAAE,MAAAC,OAAM,GAAG,QAAO,IAAK;AAC7B,MAAI,CAACA,OAAM;AACT,WAAO;EACT;AACA,QAAM,UACJA,UAAS,OACP,IAAI,SACF,EAAE,QAAQ,IAAI,OAAM,IACpB,CAAA,IACF,IAAI,SACJ;IACE,QAAQ,IAAI;IACZ,GAAGA;MAELA;AACJ,SAAO;IACL,GAAG;IACH,MAAM;MACJ,GAAG;;;MAGH,UAAU;MACV,eAAe;;;AAGrB;AAEO,IAAM,SAAS,CAAC,MAA0B,CAAA,MAAO,QAAQ,GAAG;AAC5D,IAAM,aAAa,CAAC,MAAyB,CAAA,MAAO,QAAQ,GAAG;;;AClFtE,SAAS,SAAAC,QAAO,WAAAC,gBAAe;AAC/B,SAAS,WAAAC,gBAAe;;;ACDxB,IAAA,mBAAe,QAAQ,IAAI,+BAA+B,QAAQ;;;ADKlE,IAAM,UAAU,CAACC,OAAc,MAA0B,CAAA,MAAM;AAC7D,QAAM,OAAO,OAAOA;AACpB,MAAI,SAAS,UAAU;AACrB,UAAM,OAAOA,SAAQ,SAAS,YAAYA,MAAK;AAC/C,UAAM,WACJ,QAAQ,KAAK,OAAO,kBAAkB,KAAK,IAAI,KAC7C,SAAS,WAAWC,SAAQD,KAAI,IAChC,QAAQ,IAAI,IAAIA,KAAI;AACxB,UAAM,MACJ,wDAA6D,QAAQ;AACvE,UAAM,OAAO,OAAO,IAAI,UAAU,GAAG,GAAG;MACtC,MAAAA;MACA,MAAM;KACP;EACH;AAEA,MAAI,KAAK,KAAKA,KAAI,GAAG;AAEnB,UAAM,MAAM;AACZ,UAAM,OAAO,OAAO,IAAI,UAAU,GAAG,GAAG;MACtC,MAAAA;MACA,MAAM;KACP;EACH;AAEA,EAAAA,QAAOE,SAAQF,KAAI;AACnB,QAAM,EAAE,MAAAG,MAAI,IAAKC,OAAMJ,KAAI;AAE3B,MAAIA,UAASG,SAAQ,IAAI,iBAAiB,OAAO;AAC/C,UAAM,MAAM;AACZ,UAAM,OAAO,OAAO,IAAI,MAAM,GAAG,GAAG;MAClC,MAAAH;MACA,MAAM;KACP;EACH;AAEA,MAAI,qBAAa,SAAS;AACxB,UAAM,cAAc;AACpB,UAAM,EAAE,MAAAG,MAAI,IAAKC,OAAMJ,KAAI;AAC3B,QAAI,YAAY,KAAKA,MAAK,UAAUG,MAAK,MAAM,CAAC,GAAG;AACjD,YAAM,OAAO,OAAO,IAAI,MAAM,6BAA6B,GAAG;QAC5D,MAAAH;QACA,MAAM;OACP;IACH;EACF;AAEA,SAAOA;AACT;AAEA,IAAA,mBAAe;;;AErDf,OAAO,QAAoB;AAG3B,SACE,WACA,WACA,YACA,WACA,QACA,YAAAK,WACA,aAAAC,YACA,kBACK;AAEP,SAAS,eAAe,cAAc;AAC/B,IAAMC,eAAc,CAACC,UAC1B,OAAOA,OAAM,EAAE,eAAe,KAAI,CAAE;AAOtC,IAAM,QAAQ,CAACA,OAAmB,SAChC,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,MAAMA,OAAM,MAAM,CAAC,OAAO,MAAc,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,CAAE,CAAC;AAGzE,IAAM,QAAQ,CACZA,OACA,YAMA,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,MAAMA,OAAM,SAAS,CAAC,IAAI,SAAU,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,CAAE,CAAC;AAGrE,IAAMC,WAAU,CAACD,UACf,IAAI,QAAkB,CAAC,KAAK,QAC1B,GAAG,QAAQA,OAAM,EAAE,eAAe,KAAI,GAAI,CAAC,IAAI,SAC7C,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,CACzB;AAGL,IAAM,SAAS,CAAC,SAAsB,YACpC,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,OAAO,SAAS,SAAS,CAAC,OAAO,MAClC,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,CAAC,CACzB;AAGL,IAAM,KAAK,CAACA,OAAmB,YAC7B,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,GAAGA,OAAM,SAAS,CAAC,OAAO,MAAc,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,CAAE,CAAC;AAGzE,IAAM,QAAQ,CAACA,UACb,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,MAAMA,OAAM,CAAC,OAAO,MAAc,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,CAAE,CAAC;AAGnE,IAAM,OAAO,CAACA,UACZ,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,KAAKA,OAAM,CAAC,IAAI,SAAU,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,CAAE,CAAC;AAG3D,IAAME,SAAQ,CAACF,UACb,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,MAAMA,OAAM,CAAC,IAAI,SAAU,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,CAAE,CAAC;AAG5D,IAAM,SAAS,CAACA,UACd,IAAI,QAAQ,CAAC,KAAK,QAChB,GAAG,OAAOA,OAAM,CAAC,OAAO,MAAc,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,CAAE,CAAC;AAG7D,IAAM,WAAW;EACtB;EACA;EACA,SAAAC;EACA;EACA;EACA;EACA;EACA,OAAAC;EACA;;;;ACjFF,SAAS,SAAAC,QAAO,WAAAC,gBAAe;;;ACN/B,IAAM,EAAE,SAAAC,SAAO,IAAK;AACb,IAAM,iBAAiB,CAACC,UAC7BD,SAAQC,KAAI,EAAE,MAAM,QAAM,EAA2B;AAChD,IAAM,qBAAqB,CAACA,UAAgB;AACjD,MAAI;AACF,WAAOC,aAAYD,KAAI;EACzB,SAAS,IAAI;AACX,WAAO;EACT;AACF;;;ACZO,IAAM,eAAe,OAAO,MACjC,EAAE,MAAM,QAAK;AACX,MAAI,GAAG,SAAS,UAAU;AACxB,UAAM;EACR;AACF,CAAC;AAEI,IAAM,mBAAmB,CAAC,OAAiB;AAChD,MAAI;AACF,WAAO,GAAE;EACX,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS,UAAU;AACpD,YAAM;IACR;EACF;AACF;;;AFRA,IAAM,EAAE,OAAAE,QAAO,OAAAC,QAAO,QAAAC,QAAM,IAAK;AAU1B,IAAM,cAAc,OAAOC,OAAc,QAA2B;AACzE,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,MAAM,eAAeA,OAAM,KAAK,MAAMH,OAAMG,KAAI,CAAC;EAC1D,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEO,IAAM,kBAAkB,CAACA,OAAc,QAA0B;AACtE,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,mBAAmBA,OAAM,KAAKC,WAAUD,KAAI,CAAC;EACtD,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEA,IAAM,iBAAiB,OACrBA,OACA,KACA,QACoB;AACpB,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,QAAM,UAAU,IAAI,YAAW,IAAK,MAAM,eAAeA,KAAI,IAAI;AACjE,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,aAAO;IACT;AACA,UAAM,aAAaD,QAAOC,KAAI,CAAC;AAC/B,WAAO;EACT;AAEA,QAAM,cACJ,MAAM,QAAQ,IACZ,QAAQ,IAAI,CAAAE,SAAO,eAAeC,SAAQH,OAAME,KAAI,IAAI,GAAG,KAAKA,IAAG,CAAC,CAAC,GAEvE,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,IAAI;AAE/B,MAAI,CAAC,YAAY;AACf,WAAO;EACT;AAKA,MAAI,IAAI,iBAAiB,SAASF,UAASI,OAAMJ,KAAI,EAAE,MAAM;AAC3D,WAAO;EACT;AAEA,MAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,WAAO;EACT;AAEA,QAAM,aAAaF,OAAME,KAAI,CAAC;AAC9B,SAAO;AACT;AAEA,IAAM,qBAAqB,CACzBA,OACA,KACA,QACW;AACX,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,QAAM,UAAU,IAAI,YAAW,IAAK,mBAAmBA,KAAI,IAAI;AAC/D,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,aAAO;IACT;AACA,qBAAiB,MAAM,WAAWA,KAAI,CAAC;AACvC,WAAO;EACT;AACA,MAAI,aAAsB;AAC1B,aAAWE,QAAO,SAAS;AACzB,UAAM,IAAIC,SAAQH,OAAME,KAAI,IAAI;AAChC,iBAAa,mBAAmB,GAAG,KAAKA,IAAG,KAAK;EAClD;AACA,MAAI,IAAI,iBAAiB,SAASF,UAASI,OAAMJ,KAAI,EAAE,MAAM;AAC3D,WAAO;EACT;AAEA,MAAI,CAAC,YAAY;AACf,WAAO;EACT;AAEA,MAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,WAAO;EACT;AAEA,mBAAiB,MAAM,UAAUA,KAAI,CAAC;AACtC,SAAO;AACT;;;AGnIA,SAAS,SAAAK,QAAO,WAAAC,iBAAe;;;ACV/B,IAAM,EAAE,OAAAC,OAAK,IAAK;AAEX,IAAM,WACX,CAAC,OAAuC,OAAOC,UAAgB;AAC7D,MAAI;AACF,WAAO,MAAM,GAAGA,KAAI;EACtB,SAAS,IAAI;AACX,UAAM,MAAM;AACZ,QAAI,KAAK,SAAS,UAAU;AAC1B;IACF;AACA,QAAI,KAAK,SAAS,SAAS;AACzB,UAAI;AACF,cAAMD,OAAMC,OAAM,GAAK;MACzB,SAAS,KAAK;AACZ,cAAM,OAAO;AACb,YAAI,MAAM,SAAS,UAAU;AAC3B;QACF;AACA,cAAM;MACR;AACA,aAAO,MAAM,GAAGA,KAAI;IACtB;AACA,UAAM;EACR;AACF;AAEK,IAAM,eAAe,CAAC,OAA8B,CAACA,UAAgB;AAC1E,MAAI;AACF,WAAO,GAAGA,KAAI;EAChB,SAAS,IAAI;AACX,UAAM,MAAM;AACZ,QAAI,KAAK,SAAS,UAAU;AAC1B;IACF;AACA,QAAI,KAAK,SAAS,SAAS;AACzB,UAAI;AACF,kBAAUA,OAAM,GAAK;MACvB,SAAS,KAAK;AACZ,cAAM,OAAO;AACb,YAAI,MAAM,SAAS,UAAU;AAC3B;QACF;AACA,cAAM;MACR;AACA,aAAO,GAAGA,KAAI;IAChB;AACA,UAAM;EACR;AACF;;;AC9CO,IAAM,aAAa;AACnB,IAAM,OAAO;AACb,IAAM,aAAa;AACnB,IAAM,QAAQ,oBAAI,IAAI,CAAC,UAAU,UAAU,OAAO,CAAC;AAEnD,IAAM,YAAY,CAAC,OAAsC;AAC9D,QAAM,SAAS,OACbC,OACA,KACA,UAAU,GACV,QAAQ,MACN;AACF,UAAM,MAAM,IAAI,cAAc;AAC9B,UAAM,OAAO,IAAI,WAAW;AAC5B,UAAM,MAAM,IAAI,cAAc;AAC9B,QAAI,UAAU;AACd,WAAO,MAAM;AACX,UAAI;AACF,eAAO,MAAM,GAAGA,KAAI;MACtB,SAAS,IAAI;AACX,cAAM,MAAM;AACZ,YAAI,KAAK,SAASA,SAAQ,KAAK,QAAQ,MAAM,IAAI,IAAI,IAAI,GAAG;AAC1D,oBAAU,KAAK,KAAK,UAAU,IAAI;AAClC,kBAAQ,UAAU;AAClB,cAAI,QAAQ,KAAK;AACf,mBAAO,IAAI,QAAQ,CAAC,KAAK,QAAO;AAC9B,yBAAW,MAAK;AACd,uBAAOA,OAAM,KAAK,SAAS,KAAK,EAAE,KAAK,KAAK,GAAG;cACjD,GAAG,OAAO;YACZ,CAAC;UACH;AACA,cAAI,UAAU,KAAK;AACjB;AACA;UACF;QACF;AACA,cAAM;MACR;IACF;EACF;AAEA,SAAO;AACT;AAGO,IAAM,gBAAgB,CAAC,OAA6B;AACzD,QAAM,SAAS,CAACA,OAAc,QAAsB;AAClD,UAAM,MAAM,IAAI,cAAc;AAC9B,QAAI,UAAU;AACd,WAAO,MAAM;AACX,UAAI;AACF,eAAO,GAAGA,KAAI;MAChB,SAAS,IAAI;AACX,cAAM,MAAM;AACZ,YACE,KAAK,SAASA,SACd,KAAK,QACL,MAAM,IAAI,IAAI,IAAI,KAClB,UAAU,KACV;AACA;AACA;QACF;AACA,cAAM;MACR;IACF;EACF;AACA,SAAO;AACT;;;AC3DA,SAAS,YAAAC,WAAU,SAAAC,QAAO,WAAAC,gBAAe;;;ACHzC,SAAS,cAAc;AACvB,SAAS,SAAAC,QAAO,WAAAC,gBAAe;AAG/B,IAAM,EAAE,MAAAC,MAAI,IAAK;AAEjB,IAAM,YAAY,CAACC,UAAgB;AACjC,MAAI;AACF,WAAOC,UAASD,KAAI,EAAE,YAAW;EACnC,SAAS,IAAI;AACX,WAAO;EACT;AACF;AAEA,IAAM,QAAQ,CAACA,UACbD,MAAKC,KAAI,EAAE,KACT,QAAM,GAAG,YAAW,GACpB,MAAM,KAAK;AAGf,IAAM,kBAAkB,OAAOA,UAAgB;AAC7C,QAAM,EAAE,MAAAE,MAAI,IAAKC,OAAMH,KAAI;AAC3B,QAAM,MAAM,OAAM;AAClB,QAAM,EAAE,MAAM,QAAO,IAAKG,OAAM,GAAG;AACnC,MAAID,MAAK,YAAW,MAAO,QAAQ,YAAW,GAAI;AAChD,WAAO;EACT;AAEA,QAAM,WAAWE,SAAQF,OAAM,OAAO;AACtC,MAAI,MAAM,MAAM,QAAQ,GAAG;AACzB,WAAO;EACT;AAEA,SAAOA;AACT;AAEA,IAAM,sBAAsB,CAACF,UAAgB;AAC3C,QAAM,EAAE,MAAAE,MAAI,IAAKC,OAAMH,KAAI;AAC3B,QAAM,MAAM,OAAM;AAClB,QAAM,EAAE,MAAM,QAAO,IAAKG,OAAM,GAAG;AACnC,MAAID,MAAK,YAAW,MAAO,QAAQ,YAAW,GAAI;AAChD,WAAO;EACT;AAEA,QAAM,WAAWE,SAAQF,OAAM,OAAO;AACtC,MAAI,UAAU,QAAQ,GAAG;AACvB,WAAO;EACT;AAEA,SAAOA;AACT;AAEA,IAAM,kBAAkB,YAAY,OAAM;AAC1C,IAAM,sBAAsB,MAAM,OAAM;AAEjC,IAAM,aACX,qBAAa,UAAU,kBAAkB;AACpC,IAAM,iBACX,qBAAa,UAAU,sBAAsB;;;AD1C/C,IAAM,EAAE,OAAAG,QAAO,QAAAC,SAAQ,QAAAC,SAAQ,OAAAC,QAAO,OAAAC,OAAK,IAAK;AAOhD,IAAM,iBAAiB,CAACC,UAAiB,IAAIC,UAASD,KAAI,CAAC,IAAI,KAAK,OAAM,CAAE;AAE5E,IAAM,iBAAiB,OAAOA,UAC5BH,QAAOG,KAAI,EAAE,MAAM,CAAC,OAAiC;AACnD,MAAI,GAAG,SAAS,SAAS;AACvB,WAAOD,OAAMC,OAAM,GAAK,EAAE,KACxB,MAAMH,QAAOG,KAAI,GACjB,SAAM;AACJ,UAAI,IAAI,SAAS,UAAU;AACzB;MACF;AACA,YAAM;IACR,CAAC;EAEL,WAAW,GAAG,SAAS,UAAU;AAC/B;EACF;AACA,QAAM;AACR,CAAC;AAEH,IAAM,qBAAqB,CAACA,UAAgB;AAC1C,MAAI;AACF,eAAWA,KAAI;EACjB,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS,SAAS;AACnD,UAAI;AACF,eAAO,UAAUA,OAAM,GAAK;MAC9B,SAAS,KAAK;AACZ,YAAK,KAA+B,SAAS,UAAU;AACrD;QACF;AACA,cAAM;MACR;IACF,WAAY,IAA8B,SAAS,UAAU;AAC3D;IACF;AACA,UAAM;EACR;AACF;AAEO,IAAM,mBAAmB,OAC9BA,OACA,QACE;AACF,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,MAAM,oBAAoBA,OAAM,KAAK,MAAML,OAAMK,KAAI,CAAC;EAC/D,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEA,IAAM,sBAAsB,OAC1BA,OACA,KACA,QACoB;AACpB,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI,CAAC,IAAI,KAAK;AACZ,WAAO,oBACLA,OACA,EAAE,GAAG,KAAK,KAAK,MAAM,WAAWA,KAAI,EAAC,GACrC,GAAG;EAEP;AACA,MAAIA,UAAS,IAAI,OAAOE,OAAMF,KAAI,EAAE,SAASA,OAAM;AACjD,UAAM,IAAI,MAAM,gDAAgD;EAClE;AAEA,QAAM,UAAU,IAAI,YAAW,IAAK,MAAM,eAAeA,KAAI,IAAI;AACjE,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,aAAO;IACT;AACA,UAAM,aAAa,UAAUA,OAAM,IAAI,KAAK,cAAc,CAAC;AAC3D,WAAO;EACT;AAEA,QAAM,cACJ,MAAM,QAAQ,IACZ,QAAQ,IAAI,CAAAG,SACV,oBAAoBC,SAAQJ,OAAMG,KAAI,IAAI,GAAG,KAAKA,IAAG,CAAC,CACvD,GAEH,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,IAAI;AAC/B,MAAI,CAAC,YAAY;AACf,WAAO;EACT;AAKA,MAAI,IAAI,iBAAiB,SAASH,UAASE,OAAMF,KAAI,EAAE,MAAM;AAC3D,WAAO;EACT;AACA,MAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,WAAO;EACT;AACA,QAAM,aAAa,UAAUA,OAAM,IAAI,KAAKF,MAAK,CAAC;AAClD,SAAO;AACT;AAEA,IAAM,YAAY,OAChBE,OACA,KACAK,QACE;AACF,QAAM,UAAUD,SAAQ,KAAK,eAAeJ,KAAI,CAAC;AACjD,QAAMJ,QAAOI,OAAM,OAAO;AAC1B,SAAO,MAAMK,IAAG,OAAO;AACzB;AAEO,IAAM,uBAAuB,CAACL,OAAc,QAA0B;AAC3E,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,wBAAwBA,OAAM,KAAKM,WAAUN,KAAI,CAAC;EAC3D,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEA,IAAM,0BAA0B,CAC9BA,OACA,KACA,QACW;AACX,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI,CAAC,IAAI,KAAK;AACZ,WAAO,wBACLA,OACA,EAAE,GAAG,KAAK,KAAK,eAAeA,KAAI,EAAC,GACnC,GAAG;EAEP;AACA,QAAM,MAAc,IAAI;AAExB,MAAIA,UAAS,IAAI,OAAOE,OAAMF,KAAI,EAAE,SAASA,OAAM;AACjD,UAAM,IAAI,MAAM,gDAAgD;EAClE;AAEA,QAAM,UAAU,IAAI,YAAW,IAAK,mBAAmBA,KAAI,IAAI;AAC/D,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,aAAO;IACT;AACA,qBAAiB,MAAM,cAAcA,OAAM,KAAK,kBAAkB,CAAC;AACnE,WAAO;EACT;AAEA,MAAI,aAAa;AACjB,aAAWG,QAAO,SAAS;AACzB,UAAM,IAAIC,SAAQJ,OAAMG,KAAI,IAAI;AAChC,iBAAa,wBAAwB,GAAG,KAAKA,IAAG,KAAK;EACvD;AACA,MAAI,CAAC,YAAY;AACf,WAAO;EACT;AACA,MAAI,IAAI,iBAAiB,SAASH,UAASE,OAAMF,KAAI,EAAE,MAAM;AAC3D,WAAO;EACT;AACA,MAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,WAAO;EACT;AACA,mBAAiB,MAAM,cAAcA,OAAM,KAAK,SAAS,CAAC;AAC1D,SAAO;AACT;AAEA,IAAM,gBAAgB,CACpBA,OACA,KACAO,YACE;AACF,QAAM,UAAUH,SAAQ,KAAK,eAAeJ,KAAI,CAAC;AACjD,aAAWA,OAAM,OAAO;AACxB,SAAOO,QAAO,OAAO;AACvB;;;AH/NA,IAAM,EAAE,QAAAC,SAAQ,OAAAC,QAAO,OAAAC,OAAK,IAAK;AAEjC,IAAM,oBAAoB,UAAU,SAASF,OAAM,CAAC;AACpD,IAAM,wBAAwB,cAAc,aAAa,UAAU,CAAC;AACpE,IAAM,wBAAwB,UAAU,SAASC,MAAK,CAAC;AACvD,IAAM,4BAA4B,cAAc,aAAa,SAAS,CAAC;AAEvE,IAAM,qCAAqC,OACzCE,OACA,QACoB;AAEpB,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AAGA,QAAM,EAAE,QAAAC,SAAQ,GAAG,QAAO,IAAK;AAC/B,MAAI;AACF,WAAO,MAAM,sBAAsBD,OAAM,OAAO;EAClD,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS,aAAa;AACvD,aAAO,MAAM,iBAAiBA,OAAM,OAAO;IAC7C;AACA,UAAM;EACR;AACF;AAEA,IAAM,yCAAyC,CAC7CA,OACA,QACW;AACX,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AAEA,QAAM,EAAE,QAAAC,SAAQ,GAAG,QAAO,IAAK;AAC/B,MAAI;AACF,WAAO,0BAA0BD,OAAM,OAAO;EAChD,SAAS,IAAI;AACX,UAAM,MAAM;AACZ,QAAI,KAAK,SAAS,aAAa;AAC7B,aAAO,qBAAqBA,OAAM,OAAO;IAC3C;AACA,UAAM;EACR;AACF;AAEA,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,QAAQ,OAAO,OAAO;AAC5B,IAAM,SAAS,OAAO,QAAQ;AAEvB,IAAM,gBAAgB,OAAOA,OAAc,QAA2B;AAC3E,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,MAAM,iBAAiBA,OAAM,KAAK,MAAMD,OAAMC,KAAI,GAAG,KAAK;EACnE,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEO,IAAM,oBAAoB,CAACA,OAAc,QAA0B;AACxE,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AACA,MAAI;AACF,WAAO,qBAAqBA,OAAM,KAAKE,WAAUF,KAAI,GAAG,KAAK;EAC/D,SAAS,IAAI;AACX,QAAK,IAA8B,SAAS;AAAU,aAAO;AAC7D,UAAM;EACR;AACF;AAEA,IAAM,mBAAmB,OACvBA,OACA,KACA,KACA,QAAQ,UACY;AACpB,MAAI,KAAK,QAAQ,SAAS;AACxB,UAAM,IAAI,OAAO;EACnB;AAEA,QAAM,UAAU,IAAI,YAAW,IAAK,MAAM,eAAeA,KAAI,IAAI;AACjE,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,aAAO;IACT;AAEA,UAAM,aAAa,kBAAkBA,OAAM,GAAG,CAAC;AAC/C,WAAO;EACT;AAEA,QAAM,IAAI,UAAU,QAAQ,QAAQ;AACpC,QAAM,cACJ,MAAM,QAAQ,IACZ,QAAQ,IAAI,CAAAG,SACV,iBAAiBC,UAAQJ,OAAMG,KAAI,IAAI,GAAG,KAAKA,MAAK,CAAC,CAAC,CACvD,GAEH,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,IAAI;AAE/B,MAAI,UAAU,OAAO;AACnB,WAAO,iBAAiBH,OAAM,KAAK,KAAK,MAAM;EAChD,WAAW,UAAU,QAAQ;AAC3B,QAAI,IAAI,iBAAiB,SAASA,UAASK,OAAML,KAAI,EAAE,MAAM;AAC3D,aAAO;IACT;AACA,QAAI,CAAC,YAAY;AACf,aAAO;IACT;AACA,QAAI,IAAI,UAAU,CAAE,MAAM,IAAI,OAAOA,OAAM,GAAG,GAAI;AAChD,aAAO;IACT;AACA,UAAM,aAAa,mCAAmCA,OAAM,GAAG,CAAC;EAClE;AACA,SAAO;AACT;AAEA,IAAM,uBAAuB,CAC3BA,OACA,KACA,KACA,QAAQ,UACG;AACX,QAAM,UAAU,IAAI,YAAW,IAAK,mBAAmBA,KAAI,IAAI;AAC/D,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAI3B,QAAI,SAAS;AACX,UAAI,QAAQ,SAAS,UAAU;AAC7B,eAAO;MACT;AACA,UAAI,QAAQ,SAAS,WAAW;AAC9B,cAAM;MACR;IACF;AAEA,QAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,aAAO;IACT;AAEA,qBAAiB,MAAM,sBAAsBA,OAAM,GAAG,CAAC;AACvD,WAAO;EACT;AAEA,MAAI,aAAa;AACjB,aAAWG,QAAO,SAAS;AACzB,UAAM,IAAI,UAAU,QAAQ,QAAQ;AACpC,UAAM,IAAIC,UAAQJ,OAAMG,KAAI,IAAI;AAChC,iBAAa,qBAAqB,GAAG,KAAKA,MAAK,CAAC,KAAK;EACvD;AAEA,MAAI,UAAU,OAAO;AACnB,WAAO,qBAAqBH,OAAM,KAAK,KAAK,MAAM;EACpD,WAAW,UAAU,QAAQ;AAC3B,QAAI,IAAI,iBAAiB,SAASA,UAASK,OAAML,KAAI,EAAE,MAAM;AAC3D,aAAO;IACT;AACA,QAAI,CAAC,YAAY;AACf,aAAO;IACT;AACA,QAAI,IAAI,UAAU,CAAC,IAAI,OAAOA,OAAM,GAAG,GAAG;AACxC,aAAO;IACT;AACA,qBAAiB,MAAK;AACpB,6CAAuCA,OAAM,GAAG;IAClD,CAAC;EACH;AACA,SAAO;AACT;;;AKxMO,IAAM,eAAe,qBAAa,UAAU,gBAAgB;AAC5D,IAAM,mBACX,qBAAa,UAAU,oBAAoB;;;ACL7C,IAAM,EAAE,IAAAM,IAAE,IAAK;AAER,IAAM,eAAe,OAC1BC,OACA,QACoB;AACpB,QAAMD,IAAGC,OAAM;IACb,GAAG;IACH,OAAO;IACP,WAAW;GACZ;AACD,SAAO;AACT;AAEO,IAAM,mBAAmB,CAC9BA,OACA,QACW;AACX,SAAOA,OAAM;IACX,GAAG;IACH,OAAO;IACP,WAAW;GACZ;AACD,SAAO;AACT;;;ACvBA,IAAM,UAAU,QAAQ,IAAI,mCAAmC,QAAQ;AACvE,IAAM,UAAU,QAAQ,QAAQ,MAAM,EAAE,EAAE,MAAM,GAAG;AAGnD,IAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,QAAQ,IAAI,OAAK,SAAS,GAAG,EAAE,CAAC;AAE/D,IAAM,YAAY,QAAQ,MAAO,UAAU,MAAM,SAAS;AAInD,IAAM,YACX,CAAC,aAAa,qBAAa,UACzB,MAAM,QACN,SAAO,CAAC,KAAK,UAAU,CAAC,KAAK;AAC1B,IAAM,gBACX,CAAC,aAAa,qBAAa,UACzB,MAAM,QACN,SAAO,CAAC,KAAK,UAAU,CAAC,KAAK;;;ACGjC,IAAM,OACJ,CAAC,OACD,OACEC,OACA,QACoB;AACpB,QAAM,UAAU,OAAO,GAAG;AAC1B,MAAI,QAAQ,MAAM;AAChB,IAAAA,QAAO,MAAM,KAAKA,OAAM,QAAQ,IAAI;EACtC;AACA,MAAI,MAAM,QAAQA,KAAI,GAAG;AACvB,WAAO,CAAC,EACN,MAAM,QAAQ,IAAIA,MAAK,IAAI,OAAK,GAAG,iBAAQ,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,GACjE,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,IAAI;EACjC,OAAO;AACL,WAAO,CAAC,CAAE,MAAM,GAAG,iBAAQA,OAAM,OAAO,GAAG,OAAO;EACpD;AACF;AAEF,IAAM,WACJ,CAAC,OACD,CAACA,OAAyB,QAAoC;AAC5D,QAAM,UAAU,WAAW,GAAG;AAC9B,MAAI,QAAQ,MAAM;AAChB,IAAAA,QAAO,SAASA,OAAM,QAAQ,IAAI;EACpC;AACA,MAAI,MAAM,QAAQA,KAAI,GAAG;AACvB,WAAO,CAAC,CAACA,MACN,IAAI,OAAK,GAAG,iBAAQ,GAAG,OAAO,GAAG,OAAO,CAAC,EACzC,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,IAAI;EAClC,OAAO;AACL,WAAO,CAAC,CAAC,GAAG,iBAAQA,OAAM,OAAO,GAAG,OAAO;EAC7C;AACF;AAEK,IAAM,aAAa,SAAS,gBAAgB;AAC5C,IAAM,SAAS,OAAO,OAAO,KAAK,YAAY,GAAG,EAAE,MAAM,WAAU,CAAE;AAErE,IAAM,aAAa,SAAS,gBAAgB;AAC5C,IAAM,SAAS,OAAO,OAAO,KAAK,YAAY,GAAG,EAAE,MAAM,WAAU,CAAE;AAErE,IAAM,cAAc,SAAS,iBAAiB;AAC9C,IAAM,UAAU,OAAO,OAAO,KAAK,aAAa,GAAG,EAAE,MAAM,YAAW,CAAE;AAExE,IAAM,YAAY,SAAS,eAAe;AAC1C,IAAMC,SAAQ,OAAO,OAAO,KAAK,WAAW,GAAG,EAAE,MAAM,UAAS,CAAE;AAElE,IAAM,iBAAiB,SAAS,oBAAoB;AACpD,IAAM,aAAa,OAAO,OAAO,KAAK,gBAAgB,GAAG;EAC9D,MAAM;CACP;AAEM,IAAM,aAAa,SAAS,CAACD,OAAM,QACxC,cAAc,GAAG,IACf,iBAAiBA,OAAM,GAAG,IAC1B,iBAAiBA,OAAM,GAAG,CAAC;AAI/B,IAAM,UAAU,KAAK,CAACE,OAAM,QAC1B,UAAU,GAAG,IAAI,aAAaA,OAAM,GAAG,IAAI,aAAaA,OAAM,GAAG,CAAC;AAE7D,IAAM,SAAS,OAAO,OAAO,SAAS;EAC3C,QAAQ;EACR,MAAM;EACN;EACA;EACA;EACA;EACA;EACA,OAAAC;EACA;EACA;EACA;EACA;EACA;CACD;AACD,OAAO,SAAS;;;ACpGhB,SAAS,WAAAC,iBAAe;AACjB,IAAM,2BAA2BA;AAAA,EACtC;AAAA,EACA;AACF;;;ACFA,SAAS,wBAAAC,6BAA4B;;;ACFrC,YAAY,QAAQ;AAMpB,IAAM,WACJ,0BAA0B,KACxB,KAAK,IAAI,GAAM,wBAAoB,IAAK,CAAC,IACzC,KAAK,IAAI,GAAoC,QAAI,EAAG,SAAS,CAAC;;;ACElE,IAAMC,kBAAiB,OAAO,IAAI,4BAA4B;AAaxD,IAAO,OAAP,MAAW;EACf;EACA;EAEA;;;;;EAMA,sBAAsB;;;;EAKtB,QAAQ;;IAEN,KAAK,oBAAI,IAAG;;IAEZ,QAAQ,oBAAI,IAAG;;;;;EAMjB,QAAQ;;IAEN,KAAK,oBAAI,IAAG;;IAEZ,QAAQ,oBAAI,IAAG;;EAGjB,KAAK,OAAO,WAAW,IAAC;AACtB,WAAO;EACT;EAEA,YAAY,MAAa,IAAS;AAChC,SAAK,OAAO;AACZ,SAAK,KAAK;AACV,SAAK,cAAc,KAAK;AACxB,QAAI,GAAG,gBAAgB,KAAK,aAAa;AACvC,YAAM,MAAM,sCAAsC;QAChD,QAAQ,KAAK;QACb,OAAO,GAAG;OACX;IACH;AAEA,eAAW,CAACC,KAAI,IAAI,KAAK,KAAK,KAAK,OAAO;AACxC,UAAI,CAAC,KAAK,GAAG,MAAM,IAAIA,GAAE,GAAG,OAAO,IAAI,GAAG;AACxC,aAAK,MAAM,OAAO,IAAI,IAAI;MAC5B;IACF;AAEA,eAAW,CAACA,KAAI,IAAI,KAAK,KAAK,GAAG,OAAO;AACtC,UAAI,CAAC,KAAK,KAAK,MAAM,IAAIA,GAAE,GAAG,OAAO,IAAI,GAAG;AAC1C,aAAK,MAAM,IAAI,IAAI,IAAI;MACzB;IACF;AAEA,eAAW,QAAQ,KAAK,GAAG,OAAO;AAEhC,YAAM,WAAW,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,EAAE;AACjD,YAAM,WAAW,UAAU,SAAS,IAAI,KAAK,KAAK,IAAI;AACtD,UAAI,UAAU,IAAI,OAAO,KAAK,IAAI;AAAI;AACtC,UAAI,UAAU;AAAI,aAAK,MAAM,OAAO,IAAI,QAAQ;AAChD,UAAI,KAAK;AAAI,aAAK,MAAM,IAAI,IAAI,IAAI;IACtC;AACA,eAAW,QAAQ,KAAK,KAAK,OAAO;AAElC,YAAM,SAAS,KAAK,GAAG,MAAM,IAAI,KAAK,KAAK,EAAE;AAC7C,YAAM,SAAS,QAAQ,SAAS,IAAI,KAAK,KAAK,IAAI;AAClD,UAAI,QAAQ,IAAI,OAAO,KAAK,IAAI;AAAI;AACpC,UAAI,KAAK;AAAI,aAAK,MAAM,OAAO,IAAI,IAAI;AACvC,UAAI,QAAQ;AAAI,aAAK,MAAM,IAAI,IAAI,MAAM;IAC3C;EACF;EAEA,CAACD,eAAc,EAAE,GAAW,SAAwB;AAClD,UAAM,MACJ,SAAS,SAAS,CAAC,YAAY,QAAQ,IAAI,CAAC,IAAI,EAAE;AACpD,UAAM,QACJ,SAAS,SAAS,CAAC,YAAY,QAAQ,IAAI,CAAC,IAAI,EAAE;AACpD,UAAM,QAAkB,CAAA;AACxB,eAAW,QAAQ,KAAK,MAAM,KAAK;AACjC,YAAM,KAAK,KAAK,KAAK,EAAE,EAAE;IAC3B;AACA,eAAW,QAAQ,KAAK,MAAM,QAAQ;AACpC,YAAM,KAAK,KAAK,KAAK,EAAE,EAAE;IAC3B;AACA,eAAW,QAAQ,KAAK,MAAM,KAAK;AAEjC,YAAM,KAAK,KAAK,IAAI,MAAM;AAC1B,YAAM,KACJ,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,GAAG,KAAI,CAAE;IAE9D;AACA,eAAW,QAAQ,KAAK,MAAM,QAAQ;AAEpC,YAAM,KAAK,KAAK,IAAI,MAAM;AAC1B,YAAM,KACJ,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,GAAG,KAAI,CAAE;IAE9D;AACA,UAAME,QAAO,CAAC,GAAW,MAAwB,EAAE,KAAK,CAAC;AACzD,UAAM,QACJ,SAAS,SACP,CAAC,MAAcA,MAAK,GAAG,EAAE,WAAW,GAAG,IAAI,QAAQ,GAAG,IACtD,CAAC,MAAc;AAEnB,WAAO,GAAG,KAAK,OAAO,WAAW,CAAC;EACpC,MACC,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,EACjE,IAAI,OAAK,OAAO,MAAM,CAAC,CAAC,EACxB,KAAK,IAAI,CAAC;;EAEX;;;;ACzIF,SAAS,SAAAC,QAAO,eAAe;AAC/B,SAAS,WAAAC,UAAS,YAAAC,iBAAgB;;;ACOlC,IAAM,oBAAoB,QAAQ,MAAM,QAAQ,OAAO;;;ACTvD,SAGE,SAAAC,cAGK;;;ACCP,yBAAuB;AARvB,SAIE,SAAS,iBAGJ;;;ACmBA,IAAM,UAA4B,CAAA;AACzC,QAAQ,KAAK,UAAU,UAAU,SAAS;AAE1C,IAAI,QAAQ,aAAa,SAAS;AAChC,UAAQ;IACN;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;;;;;;AAOJ,IAAI,QAAQ,aAAa,SAAS;AAChC,UAAQ,KAAK,SAAS,WAAW,UAAU,WAAW;;;;ACnCxD,IAAM,YAAY,CAACC,aACjB,CAAC,CAACA,YACF,OAAOA,aAAY,YACnB,OAAOA,SAAQ,mBAAmB,cAClC,OAAOA,SAAQ,SAAS,cACxB,OAAOA,SAAQ,eAAe,cAC9B,OAAOA,SAAQ,cAAc,cAC7B,OAAOA,SAAQ,SAAS,cACxB,OAAOA,SAAQ,QAAQ,YACvB,OAAOA,SAAQ,OAAO;AAExB,IAAM,eAAe,OAAO,IAAI,qBAAqB;AACrD,IAAMC,UAA2D;AACjE,IAAM,uBAAuB,OAAO,eAAe,KAAK,MAAM;AAyB9D,IAAM,UAAN,MAAa;EACX,UAAmB;IACjB,WAAW;IACX,MAAM;;EAGR,YAAuB;IACrB,WAAW,CAAA;IACX,MAAM,CAAA;;EAGR,QAAgB;EAChB,KAAa,KAAK,OAAM;EAExB,cAAA;AACE,QAAIA,QAAO,YAAY,GAAG;AACxB,aAAOA,QAAO,YAAY;;AAE5B,yBAAqBA,SAAQ,cAAc;MACzC,OAAO;MACP,UAAU;MACV,YAAY;MACZ,cAAc;KACf;EACH;EAEA,GAAG,IAAe,IAAW;AAC3B,SAAK,UAAU,EAAE,EAAE,KAAK,EAAE;EAC5B;EAEA,eAAe,IAAe,IAAW;AACvC,UAAM,OAAO,KAAK,UAAU,EAAE;AAC9B,UAAM,IAAI,KAAK,QAAQ,EAAE;AAEzB,QAAI,MAAM,IAAI;AACZ;;AAGF,QAAI,MAAM,KAAK,KAAK,WAAW,GAAG;AAChC,WAAK,SAAS;WACT;AACL,WAAK,OAAO,GAAG,CAAC;;EAEpB;EAEA,KACE,IACA,MACA,QAA6B;AAE7B,QAAI,KAAK,QAAQ,EAAE,GAAG;AACpB,aAAO;;AAET,SAAK,QAAQ,EAAE,IAAI;AACnB,QAAI,MAAe;AACnB,eAAW,MAAM,KAAK,UAAU,EAAE,GAAG;AACnC,YAAM,GAAG,MAAM,MAAM,MAAM,QAAQ;;AAErC,QAAI,OAAO,QAAQ;AACjB,YAAM,KAAK,KAAK,aAAa,MAAM,MAAM,KAAK;;AAEhD,WAAO;EACT;;AAGF,IAAe,iBAAf,MAA6B;;AAM7B,IAAM,iBAAiB,CAA2B,YAAc;AAC9D,SAAO;IACL,OAAO,IAAa,MAA+B;AACjD,aAAO,QAAQ,OAAO,IAAI,IAAI;IAChC;IACA,OAAI;AACF,aAAO,QAAQ,KAAI;IACrB;IACA,SAAM;AACJ,aAAO,QAAQ,OAAM;IACvB;;AAEJ;AAEA,IAAM,qBAAN,cAAiC,eAAc;EAC7C,SAAM;AACJ,WAAO,MAAK;IAAE;EAChB;EACA,OAAI;EAAI;EACR,SAAM;EAAI;;AAGZ,IAAM,aAAN,cAAyB,eAAc;;;;EAIrC,UAAUD,SAAQ,aAAa,UAAU,WAAW;;EAEpD,WAAW,IAAI,QAAO;EACtB;EACA;EACA;EAEA,gBAAwD,CAAA;EACxD,UAAmB;EAEnB,YAAYA,UAAkB;AAC5B,UAAK;AACL,SAAK,WAAWA;AAEhB,SAAK,gBAAgB,CAAA;AACrB,eAAW,OAAO,SAAS;AACzB,WAAK,cAAc,GAAG,IAAI,MAAK;AAK7B,cAAM,YAAY,KAAK,SAAS,UAAU,GAAG;AAC7C,YAAI,EAAE,MAAK,IAAK,KAAK;AAQrB,cAAM,IAAIA;AAGV,YACE,OAAO,EAAE,4BAA4B,YACrC,OAAO,EAAE,wBAAwB,UAAU,UAC3C;AACA,mBAAS,EAAE,wBAAwB;;AAGrC,YAAI,UAAU,WAAW,OAAO;AAC9B,eAAK,OAAM;AACX,gBAAM,MAAM,KAAK,SAAS,KAAK,QAAQ,MAAM,GAAG;AAEhD,gBAAM,IAAI,QAAQ,WAAW,KAAK,UAAU;AAC5C,cAAI,CAAC;AAAK,YAAAA,SAAQ,KAAKA,SAAQ,KAAK,CAAC;;MAGzC;;AAGF,SAAK,6BAA6BA,SAAQ;AAC1C,SAAK,uBAAuBA,SAAQ;EACtC;EAEA,OAAO,IAAa,MAA+B;AAEjD,QAAI,CAAC,UAAU,KAAK,QAAQ,GAAG;AAC7B,aAAO,MAAK;MAAE;;AAIhB,QAAI,KAAK,YAAY,OAAO;AAC1B,WAAK,KAAI;;AAGX,UAAM,KAAK,MAAM,aAAa,cAAc;AAC5C,SAAK,SAAS,GAAG,IAAI,EAAE;AACvB,WAAO,MAAK;AACV,WAAK,SAAS,eAAe,IAAI,EAAE;AACnC,UACE,KAAK,SAAS,UAAU,MAAM,EAAE,WAAW,KAC3C,KAAK,SAAS,UAAU,WAAW,EAAE,WAAW,GAChD;AACA,aAAK,OAAM;;IAEf;EACF;EAEA,OAAI;AACF,QAAI,KAAK,SAAS;AAChB;;AAEF,SAAK,UAAU;AAMf,SAAK,SAAS,SAAS;AAEvB,eAAW,OAAO,SAAS;AACzB,UAAI;AACF,cAAM,KAAK,KAAK,cAAc,GAAG;AACjC,YAAI;AAAI,eAAK,SAAS,GAAG,KAAK,EAAE;eACzB,GAAG;MAAA;;AAGd,SAAK,SAAS,OAAO,CAAC,OAAe,MAAY;AAC/C,aAAO,KAAK,aAAa,IAAI,GAAG,CAAC;IACnC;AACA,SAAK,SAAS,aAAa,CAAC,SAAoC;AAC9D,aAAO,KAAK,mBAAmB,IAAI;IACrC;EACF;EAEA,SAAM;AACJ,QAAI,CAAC,KAAK,SAAS;AACjB;;AAEF,SAAK,UAAU;AAEf,YAAQ,QAAQ,SAAM;AACpB,YAAM,WAAW,KAAK,cAAc,GAAG;AAEvC,UAAI,CAAC,UAAU;AACb,cAAM,IAAI,MAAM,sCAAsC,GAAG;;AAG3D,UAAI;AACF,aAAK,SAAS,eAAe,KAAK,QAAQ;eAEnC,GAAG;MAAA;IAEd,CAAC;AACD,SAAK,SAAS,OAAO,KAAK;AAC1B,SAAK,SAAS,aAAa,KAAK;AAChC,SAAK,SAAS,SAAS;EACzB;EAEA,mBAAmB,MAAgC;AAEjD,QAAI,CAAC,UAAU,KAAK,QAAQ,GAAG;AAC7B,aAAO;;AAET,SAAK,SAAS,WAAW,QAAQ;AAGjC,SAAK,SAAS,KAAK,QAAQ,KAAK,SAAS,UAAU,IAAI;AACvD,WAAO,KAAK,2BAA2B,KACrC,KAAK,UACL,KAAK,SAAS,QAAQ;EAE1B;EAEA,aAAa,OAAe,MAAW;AACrC,UAAM,KAAK,KAAK;AAChB,QAAI,OAAO,UAAU,UAAU,KAAK,QAAQ,GAAG;AAC7C,UAAI,OAAO,KAAK,CAAC,MAAM,UAAU;AAC/B,aAAK,SAAS,WAAW,KAAK,CAAC;;AAIjC,YAAM,MAAM,GAAG,KAAK,KAAK,UAAU,IAAI,GAAG,IAAI;AAE9C,WAAK,SAAS,KAAK,QAAQ,KAAK,SAAS,UAAU,IAAI;AAEvD,aAAO;WACF;AACL,aAAO,GAAG,KAAK,KAAK,UAAU,IAAI,GAAG,IAAI;;EAE7C;;AAGF,IAAMA,WAAU,WAAW;AAGpB,IAAM;;;;;;;;;;EAUX;;;;;;;;EASA,MAAAE;;;;;;;;EASA;AAAM,IACJ,eACF,UAAUF,QAAO,IAAI,IAAI,WAAWA,QAAO,IAAI,IAAI,mBAAkB,CAAE;;;ACzVzE,OAAO,eAAe;AACf,IAAM;;EAEX,OAAO,KAAK,SAAS,EAAE,OACrB,OACE,EAAE,WAAW,KAAK;EAElB,MAAM;EAEN,MAAM,SAAS;;;;ACLrB,SAAuB,SAAAG,cAAa;AAEpC,IAAM,eAAe,OAAO;;;;;;;;;;;;;;;;;;;;;;;;AJQ5B,IAAMC,SAAQ,SAAS,aAAa,UAAU,mBAAAC,UAAa;;;AKd3D,SAAS,WAAAC,UAAS,WAAAC,iBAAe;;;ACMjC,SAAS,YAAAC,iBAAgB;AACzB,SAAS,SAAAC,cAAa;;;ACFtB,IAAM,aAAa,CAAC,SAAyB,QAAe;AAC1D,SAAO,CAAC,QAAQ,GAAG,GAAG,CAAC;AACzB;AAEA,IAAM,aAAa,CAAC,SAAyB,QAAe;AAC1D,SAAO;IACL,QAAQ,GAAG,GAAG;IACd,QAAQ,GAAG,MAAM,MAAM;IACvB,QAAQ,GAAG,MAAM,OAAO;;AAE5B;AAEA,IAAM,QAAQ,QAAQ,aAAa,UAAU,aAAa;;;AbQ1D,IAAM,QAAQ,KAAK,IAAIC,sBAAoB,IAAK,GAAG,CAAC,IAAI;;;AcbjD,IAAM,SAAS,EAAE,KAAgB;;;ACVxC,qCAAkC;;;ACuD3B,IAAM,4BAA4B,CACvC,SAEA,UAAU,QAAQ,WAAW;AAExB,IAAM,4BAA4B,CACvC,SAC2B;AAC3B,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,0BAA0B,IAAI,GAAG;AACpC,UAAM,MAAM,2CAA2C;MACrD,OAAO;KACR;EACH;AACA,SAAO;AACT;AAEO,IAAM,kBAAkB,CAAC,SAC9B,KAAK,aAAa,KAAK,SAAS;AAE3B,IAAM,kBAAkB,CAAC,SAAiC;AAC/D,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,gBAAgB,IAAI,GAAG;AAC1B,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AACA,SAAO;AACT;AAEO,IAAM,cAAc,CAAC,SAC1B,KAAK,SAAS,KAAK,SAAS;AAEvB,IAAM,cAAc,CAAC,SAAiC;AAC3D,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,YAAY,IAAI,GAAG;AACtB,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AACA,SAAO;AACT;AAEO,IAAM,mBAAmB,CAAC,SAC/B,KAAK,SAAS,KAAK,SAAS;AAEvB,IAAM,mBAAmB,CAAC,SAAkC;AACjE,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,iBAAiB,IAAI,GAAG;AAC3B,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AACA,SAAO;AACT;AAEO,IAAM,mBAAmB,CAAC,SAC/B,KAAK,SAAS,KAAK,SAAS;AAEvB,IAAM,mBAAmB,CAAC,SAAkC;AACjE,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,iBAAiB,IAAI,GAAG;AAC3B,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AACA,SAAO;AACT;AAEO,IAAM,iBAAiB,CAAC,SAC7B,0BAA0B,IAAI,KAAK,KAAK,SAAS;AAE5C,IAAM,eAAe,CAAC,SAC3B,KAAK,SAAS,KAAK,SAAS;AAEvB,IAAM,eAAe,CAAC,SAA8B;AACzD,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,aAAa,IAAI,GAAG;AACvB,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AACA,SAAO;AACT;AAEO,IAAM,YAAY,CAAC,SACxB,KAAK,SAAS,KAAK,SAAS;AAEvB,IAAM,YAAY,CAAC,SAA2B;AACnD,MAAI,CAAC,MAAM;AACT,UAAM,MAAM,uBAAuB;EACrC;AAEA,MAAI,CAAC,UAAU,IAAI,GAAG;AACpB,UAAM,MAAM,0BAA0B;MACpC,QAAQ;MACR,OAAO,KAAK;KACb;EACH;AAEA,SAAO;AACT;;;AC1KO,IAAM,4BAA4B,CACvC,MACA,YACAC,eACwB;AACxB,MAAI,CAAC,KAAK;AAAU;AAEpB,QAAM,WAAW,oBAAI,IAAe,CAAC,KAAK,QAAqB,CAAC;AAChE,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,OAAO,YAAY;AAC5B,eAAW,QAAQ,UAAU;AAE3B,UAAI,CAAC,MAAM;AACT,cAAM,MAAM,2CAA2C;UACrD,OAAO;SACR;MACH;AAIA,UAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,mBAAW,KAAK,MAAM;AACpB,mBAAS,IAAI,CAAC;QAChB;AACA;MACF;AAGA,UACE,OAAO,SAAS,YAChB,OAAO,SAAS,YAChB,OAAO,SAAS,WAChB;AACA;MACF;AAGA,UAAI,OAAO,MAAM;AACf,cAAM,YAAY,KAAK,GAAG;AAC1B,YAAI,WAAW;AACb,cAAI,QAAQA,YAAW;AACrB,kBAAM,IAAI,SAAS;UACrB,OAAO;AACL,qBAAS,OAAO,IAAI;AACpB,qBAAS,IAAI,SAAS;UACxB;QACF;MACF;IACF;EACF;AAGA,MAAI,CAAC,MAAM;AAAM;AAGjB,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,iBAAW,KAAK,MAAM;AACpB,gBAAQ,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE;MAChC;IACF,OAAO;AACL,cAAQ,IAAI,OAAO,IAAI,CAAC;IAC1B;EACF;AAEA,SAAO,CAAC,GAAG,OAAO;AACpB;AAIO,IAAM,mBAAmB,CAC9B,OACA,YACA,OACA,cACA,aACA,mBAA6B,CAAA,MACd;AACf,QAAM,QAAQ,CAACC,UACb,aACE,cAAc,OAAOA,KAAI,EAAE,YAAW,IAAK,OAAOA,KAAI,GACtD,cAAc,MAAM,YAAW,IAAK,KAAK;AAE7C,QAAM,aAAa,CAAC,SAAkB;AACpC,eAAW,QAAQ,KAAK,SAAS;AAC/B,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;AACA,UAAM,QAAQ,MAAM,OAAO,IAAI;EACjC;AAEA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAM,WACJ,iBAAiB,SAAS,mBAAmB,CAAC,YAAY;AAC5D,UAAM,QAAQ,0BACZ,MACA,UACA,YAAY;AAId,QAAI,CAAC,OAAO,QAAQ;AAClB,iBAAW,IAAI;AACf;IACF;AAGA,QAAI,cAAc,CAAC,MAAM,KAAK,KAAK,GAAG;AACpC,iBAAW,IAAI;IACjB;EACF;AAEA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AAGtC,QAAI,iBAAiB,UAAU,MAAM,KAAK,IAAI,GAAG;AAC/C;IACF;AAEA,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;EACF;AACA,SAAO;AACT;AAGA,IAAM,qBAAmD;EACvD,KAAK,CAACA,OAAc,QAAQ,OAAOA,UAAS;EAC5C,MAAM,CAACA,OAAc,QAAQ,OAAOA,MAAK,WAAW,KAAK;EACzD,MAAM,CAACA,OAAc,QAAQ,OAAOA,MAAK,SAAS,KAAK;EACvD,MAAM,CAACA,OAAc,QAAQ,OAC3B,IAAI,IAAYA,MAAK,MAAM,MAAM,CAAC,EAAE,IAAI,KAAK;EAC/C,MAAM,CAACA,OAAc,QAAQ,OAAOA,MAAK,SAAS,KAAK;EACvD,MAAM,CAACA,OAAc,QAAQ,OAC3BA,UAAS,SAASA,MAAK,WAAW,GAAG,KAAK,GAAG;EAC/C,WAAW,CAACA,UAAiB,CAAC,CAACA;;AAE1B,IAAM,wBAAwB,IAAI,IACvC,OAAO,QAAQ,kBAAkB,CAAC;AAM7B,IAAM,YAAY,OACvB,UACwB;AACxB,QAAM,OAAO,gBAAgB,MAAM,OAAO;AAC1C,QAAM,aAAa,sBAAsB,IAAI,OAAO,KAAK,QAAQ,CAAC;AAClE,MAAI,CAAC,YAAY;AACf,QAAI,MAAM,OAAO;AACf,aAAO;IACT;AAEA,UAAM,IAAI,MACR,mCAAmC,KAAK,QAAQ,EAAE;EAEtD;AAEA,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,eAAe,KAAK;AAC1B,QAAM,cAAc,CAAC,CAAC,KAAK;AAC3B,SAAO,iBACL,OACA,YACA,OACA,cACA,WAAW;AAEf;;;ACnLA,IAAM,iBAA2C;EAC/C,MAAM,OAAO,UAAsB;AACjC,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,KAAK,SAAS,UAAU,KAAK,KAAK,KAAK;AACzC,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,QAAQ,MAAM,OAAO,IAAI;AAC/B;MACF;AACA,YAAM,WAAW,IAAI,IAAI,KAAK,OAAO;AACrC,iBAAW,QAAQ,UAAU;AAC3B,YAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,IAAI,GAAG;AAClC,mBAAS,OAAO,IAAI;QACtB;MACF;AACA,UAAI,CAAC,SAAS,MAAM;AAClB,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,WAAO;EACT;EACA,KAAK,OAAO,UAAsB;AAChC,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,KAAK,SAAS,SAAS,CAAC,KAAK,KAAK,KAAK;AACzC,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,QAAQ,MAAM,OAAO,IAAI;AAC/B;MACF;AACA,YAAM,WAAW,IAAI,IAAI,KAAK,OAAO;AACrC,iBAAW,QAAQ,UAAU;AAC3B,YAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,IAAI,GAAG;AAClC,mBAAS,OAAO,IAAI;QACtB;MACF;AACA,UAAI,CAAC,SAAS,MAAM;AAClB,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,WAAO;EACT;EACA,UAAU,OAAO,UAAsB;AACrC,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,KAAK,SAAS,cAAc,CAAC,KAAK,KAAK,UAAU;AACnD,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,QAAQ,MAAM,OAAO,IAAI;AAC/B;MACF;AACA,YAAM,WAAW,IAAI,IAAI,KAAK,OAAO;AACrC,iBAAW,QAAQ,UAAU;AAC3B,YAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,IAAI,GAAG;AAClC,mBAAS,OAAO,IAAI;QACtB;MACF;AACA,UAAI,CAAC,SAAS,MAAM;AAClB,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,WAAO;EACT;EACA,MAAM,OAAO,UAAsB;AACjC,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,KAAK,SAAS,QAAQ;AACxB,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,QAAQ,MAAM,OAAO,IAAI;AAC/B;MACF;AACA,iBAAW,KAAK,KAAK,SAAS;AAC5B,YAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG;AAC/B,gBAAM,QAAQ,MAAM,OAAO,IAAI;QACjC;MACF;IACF;AACA,WAAO;EACT;EACA,WAAW,OAAO,UAAsB;AACtC,eAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAI,CAAC,KAAK,YAAY,KAAK,cAAc;AACvC,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,eAAW,QAAQ,MAAM,QAAQ,OAAO;AAEtC,UAAI,CAAC,KAAK,IAAI;AACZ,cAAM,QAAQ,MAAM,OAAO,IAAI;MAEjC,WAAW,CAAC,MAAM,QAAQ,MAAM,IAAI,KAAK,EAAE,GAAG;AAC5C,cAAM,QAAQ,MAAM,OAAO,IAAI;MACjC;IACF;AACA,WAAO;EACT;;;;AAKF,IAAM,oBAAoB,IAAI,IAC5B,OAAO,QAAQ,cAAc,CAAC;AAMzB,IAAM,UAAU,OAAO,UAAsB;AAClD,QAAM,OAAO,YAAY,MAAM,OAAO;AACtC,QAAM,eAAe,KAAK,SAAS,kBAAkB,IAAI,KAAK,KAAK;AACnE,MAAI,CAAC,cAAc;AACjB,QAAI,MAAM,OAAO;AACf,aAAO;IACT;AAEA,UAAM,IAAI,MAAM,sBAAsB,MAAM,QAAQ,KAAK,EAAE;EAC7D;AACA,SAAO,aAAa,KAAK;AAC3B;;;ACrHA,IAAM,kBAAkB,OAAO,UAAsB;AACnD,QAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,KAAK;AAC5C,QAAM,QAAQ,MAAM,MAAK;AACzB,QAAM,QAAQ,MAAM,MAAK;AAKzB,aAAW,QAAQ,UAAU;AAC3B,eAAW,QAAQ,KAAK,SAAS,OAAM,GAAI;AACzC,UAAI,KAAK,IAAI;AACX,cAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,cAAM,QAAQ,MAAM,IAAI,KAAK,EAAE;MACjC;IACF;EACF;AAEA,SAAO;AACT;AAcA,IAAM,8BAA8B,OAAO,UAAsB;AAC/D,QAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,KAAK;AAC5C,QAAM,QAAQ,MAAM,MAAK;AACzB,QAAM,QAAQ,MAAM,MAAK;AAKzB,aAAW,QAAQ,UAAU;AAC3B,eAAW,QAAQ,KAAK,SAAS;AAC/B,YAAM,UACJ,KAAK,KAAK,SAAS,OAAM;AAC3B,iBAAWC,SAAQ,SAAS;AAC1B,YAAIA,MAAK,MAAMA,MAAK,OAAO,MAAM;AAC/B,gBAAM,QAAQ,MAAM,IAAIA,KAAI;AAC5B,gBAAM,QAAQ,MAAM,IAAIA,MAAK,EAAE;QACjC;MACF;IACF;EACF;AAEA,SAAO;AACT;AAQA,IAAM,uBAAuB,OAAO,UAAsB;AAExD,MAAI,MAAM,MAAM,SAAS,SAAS,MAAM,MAAM,SAAS,OAAO;AAC5D,WAAO;EACT;AAEA,QAAM,WAAW,IAAI,IAAc,MAAM,QAAQ,KAAK;AACtD,QAAM,QAAQ,MAAM,MAAK;AACzB,QAAM,QAAQ,MAAM,MAAK;AAIzB,aAAW,QAAQ,UAAU;AAC3B,UAAM,WAAW,oBAAI,IAAG;AACxB,eAAW,QAAQ,KAAK,SAAS,OAAM,GAAI;AACzC,UAAI,KAAK,IAAI;AACX,iBAAS,IAAI,KAAK,EAAE;AACpB,cAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,cAAM,QAAQ,MAAM,IAAI,KAAK,EAAE;MACjC;IACF;AACA,eAAW,SAAS,UAAU;AAC5B,eAAS,IAAI,KAAK;IACpB;EACF;AAEA,SAAO;AACT;AAEA,IAAM,sBAAsB;EAC1B,KAAK;EACL,KAAK;EACL,KAAK;;AAGP,IAAM,yBAAyB,IAAI,IACjC,OAAO,QAAQ,mBAAmB,CAAC;AAM9B,IAAM,aAAa,OAAO,UAAsB;AACrD,QAAM,OAAO,iBAAiB,MAAM,OAAO;AAC3C,QAAM,WACJ,KAAK,SAAS,uBAAuB,IAAI,KAAK,KAAK;AACrD,MAAI,CAAC,UAAU;AACb,QAAI,MAAM,OAAO;AACf,aAAO;IACT;AAEA,UAAM,IAAI,MAAM,2BAA2B,MAAM,QAAQ,KAAK,EAAE;EAClE;AACA,SAAO,SAAS,KAAK;AACvB;;;ACvHO,IAAM,KAAK,OAAO,UAAsB;AAC7C,QAAM,EAAE,MAAK,IAAK,iBAAiB,MAAM,OAAO;AAChD,QAAM,aAAa,sBAAsB,IAAI,GAAG;AAGhD,MAAI,CAAC,OAAO;AACV,UAAM,MAAM,yBAAyB;EACvC;AACA,MAAI,CAAC,YAAY;AACf,UAAM,MAAM,8CAA8C;EAC5D;AAGA,SAAO,iBAAiB,OAAO,YAAY,OAAO,QAAQ,IAAI;AAChE;;;ACGA,IAAM,aAAa,CAAC,OAAoB,SAAkB;AACxD,aAAW,QAAQ,KAAK,SAAS;AAC/B,UAAM,QAAQ,MAAM,OAAO,IAAI;EACjC;AACA,QAAM,QAAQ,MAAM,OAAO,IAAI;AACjC;AAEA,IAAM,sBAAsB,CAAC,UAAsB;AACjD,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;EACF;AACF;AAKA,IAAM,qBAAqB,CAAC,UAAuC;AAEjE,QAAM,oBAAoB,gBACxB,0BAA0B,MAAM,IAAG,CAAE,EAAE,MAAM,CAAC,CAAC;AAGjD,QAAM,aAAuB,CAAA;AAC7B,aAAW,YAAY,OAAO;AAC5B,eAAW,KACT,UAAU,0BAA0B,QAAQ,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK;EAEjE;AAEA,aAAW,KAAK,kBAAkB,SAAS;AAE3C,SAAO;IACL,WAAW,kBAAkB;IAC7B,aAAa,kBAAkB,eAAe;IAC9C,UAAU,kBAAkB;IAC5B,OAAO,kBAAkB;IACzB;;AAEJ;AAMA,IAAM,OAAO,OAAO,UAAsB;AAExC,MAAI;AACJ,MAAI;AACF,gBAAY,mBACV,0BAA0B,MAAM,OAAO,EAAE,KAAK;EAElD,SAAS,KAAK;AACZ,UAAM,MAAM,kCAAkC;MAC5C,OAAO;KACR;EACH;AAGA,QAAM,aACJ,UAAU,WACR,sBAAsB,IAAI,UAAU,QAAQ,IAC5C;AACJ,QAAM,QAAQ,UAAU,SAAS;AACjC,QAAM,eAAe,UAAU;AAC/B,QAAM,cAAc,UAAU;AAC9B,QAAM,mBAAmB,UAAU;AACnC,SAAO,iBACL,OACA,YACA,OACA,cACA,aACA,gBAAgB;AAEpB;AAIA,IAAM,QAAQ,OAAO,UAAsB;AACzC,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,KAAK,SAAS,OAAO,GAAG;AAC1B,iBAAW,OAAO,IAAI;IACxB;EACF;AACA,SAAO;AACT;AAMA,IAAM,MAAM,OAAO,UAAsB;AACvC,QAAM,MAAM,0BAA0B,MAAM,OAAO;AACnD,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,eAAe,oBAAI,IAAG;AAE5B,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,eAAe,IAAI,GAAG;AACxB,YAAM,cAAc,MAAM,MAAM,KAAK;QACnC,SAAS;UACP,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;UAClC,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;;QAEpC,SAAS;QACT,MAAM,MAAM;QACZ,SAAS;UACP,OAAO,oBAAI,IAAG;UACd,OAAO,oBAAI,IAAG;;QAEhB,SAAS;UACP,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;UAClC,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;;OAErC;AACD,iBAAW,KAAK,YAAY,QAAQ,OAAO;AACzC,qBAAa,IAAI,CAAC;MACpB;AACA,iBAAW,KAAK,YAAY,QAAQ,OAAO;AACzC,qBAAa,IAAI,CAAC;MACpB;IACF;EACF;AAIA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,QAAQ,MAAM,MAAK;AACzB,UAAM,QAAQ,MAAM,MAAK;AACzB,WAAO;EACT;AAKA,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,WAAW,IAAI,IAAI,YAAY;AACrC,aAAW,QAAQ,UAAU;AAC3B,eAAW,QAAQ,KAAK,SAAS;AAC/B,mBAAa,IAAI,KAAK,IAAI;AAC1B,UAAI,KAAK,KAAK,QAAQ,MAAM;AAC1B,iBAAS,IAAI,KAAK,IAAI;MACxB;IACF;EACF;AAKA,YAAW,YAAW,QAAQ,MAAM,QAAQ,OAAO;AACjD,QAAI,KAAK,SAAS,SAAS,KAAK,CAAC,aAAa,IAAI,IAAI,GAAG;AACvD,iBAAW,OAAO,IAAI;AACtB;IACF;AAEA,eAAW,QAAQ,KAAK,SAAS,OAAM,GAAI;AACzC,UAAI,aAAa,IAAI,IAAI,GAAG;AAC1B,iBAAS;MACX;IACF;AACA,eAAW,OAAO,IAAI;EACxB;AAEA,sBAAoB,KAAK;AAEzB,SAAO;AACT;AASA,IAAM,KAAK,OAAO,UAAsB;AACtC,QAAM,MAAM,0BAA0B,MAAM,OAAO;AACnD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,eAAe,IAAI,GAAG;AACxB,YAAM,cAAc,MAAM,MAAM,KAAK;QACnC,SAAS;UACP,OAAO,oBAAI,IAAG;UACd,OAAO,oBAAI,IAAG;;QAEhB,SAAS;QACT,SAAS,MAAM;QACf,OAAO;QACP,SAAS;UACP,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;UAClC,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;;QAEpC,MAAM,MAAM;OACb;AACD,iBAAW,KAAK,YAAY,QAAQ,OAAO;AACzC,gBAAQ,IAAI,CAAC;MACf;IACF;EACF;AACA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,CAAC,QAAQ,IAAI,IAAI,GAAG;AACtB,iBAAW,OAAO,IAAI;IACxB;EACF;AACA,SAAO;AACT;AAMA,IAAM,UAAU,OAAO,UAAsB;AAC3C,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,KAAK,IAAI;AACX,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;EACF;AACA,QAAM,QAAQ,MAAM,MAAK;AACzB,SAAO;AACT;AAOA,IAAM,MAAM,OAAO,UAAsB;AACvC,QAAM,MAAM,0BAA0B,MAAM,OAAO;AACnD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,eAAe,IAAI,GAAG;AACxB,YAAM,cAAc,MAAM,MAAM,KAAK;QACnC,SAAS;UACP,OAAO,oBAAI,IAAG;UACd,OAAO,oBAAI,IAAG;;QAEhB,SAAS;QACT,SAAS,MAAM;QACf,SAAS;UACP,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;UAClC,OAAO,IAAI,IAAI,MAAM,QAAQ,KAAK;;QAEpC,MAAM,MAAM;OACb;AACD,iBAAW,KAAK,YAAY,QAAQ,OAAO;AACzC,gBAAQ,IAAI,CAAC;MACf;IAEF,OAAO;AACL,YAAM,MAAM,kCAAkC;QAC5C,QAAQ,EAAE,MAAM,WAAU;QAC1B,OAAO;OACR;IACH;EAEF;AACA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,iBAAW,OAAO,IAAI;IACxB;EACF;AACA,SAAO;AACT;AAMA,IAAM,YAAY,OAAO,UAAsB;AAC7C,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,CAAC,KAAK,YAAY,CAAC,WAAW,KAAK,QAAQ,EAAE,SAAS;AACxD,iBAAW,OAAO,IAAI;IACxB;EACF;AAEA,sBAAoB,KAAK;AAEzB,SAAO;AACT;AAKA,IAAM,OAAO,OAAO,UAAsB;AACxC,QAAM,CAAC,OAAO,IAAI,MAAM,QAAQ,MAAM,OAAM;AAC5C,QAAM,eAAe,SAAS,MAAM;AACpC,MAAI,CAAC,cAAc;AACjB,UAAM,MAAM,iDAAiD;EAC/D;AACA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,KAAK,OAAO,cAAc;AAC5B,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;EACF;AACA,QAAM,QAAQ,MAAM,MAAK;AACzB,QAAM,QAAQ,MAAM,IAAI,YAAY;AACpC,SAAO;AACT;AAMA,IAAM,UAAU,OAAO,UAAsB;AAC3C,QAAM,CAAC,OAAO,IAAI,MAAM,QAAQ,MAAM,OAAM;AAC5C,QAAM,YAAY,SAAS,MAAM;AACjC,MAAI,CAAC,WAAW,MAAM;AACpB,UAAM,MAAM,oDAAoD;EAClE;AAKA,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,YAAY,WAAW;AAChC,eAAW,QAAQ,SAAS,SAAS;AACnC,uBAAiB,IAAI,IAAI;IAC3B;EACF;AAEA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,QAAI,CAAC,KAAK,MAAM,CAAC,iBAAiB,IAAI,IAAI,GAAG;AAC3C,YAAM,QAAQ,MAAM,OAAO,IAAI;IACjC;EACF;AACA,QAAM,QAAQ,MAAM,MAAK;AACzB,aAAW,YAAY,WAAW;AAChC,UAAM,QAAQ,MAAM,IAAI,QAAQ;EAClC;AACA,SAAO;AACT;AAMA,IAAM,QAAQ,OAAO,UAAsB;AACzC,QAAM,QAAQ,MAAM,MAAK;AACzB,QAAM,QAAQ,MAAM,MAAK;AACzB,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAM,QAAQ,MAAM,IAAI,IAAI;EAC9B;AACA,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAM,QAAQ,MAAM,IAAI,IAAI;EAC9B;AACA,SAAO;AACT;AAMA,IAAM,SAAS,OAAO,UAAsB;AAC1C,QAAM,OAAO,0BAA0B,MAAM,OAAO;AACpD,QAAM,WAAW,0BAA0B,KAAK,MAAM,CAAC,CAAC;AACxD,QAAM,OAAO,UAAU,SAAS,MAAM,CAAC,CAAC,EAAE;AAC1C,aAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,UAAM,WAAWC,YAAW,KAAK,EAAE,EAAE,CAAC;AACtC,QAAI,aAAa,MAAM;AACrB,iBAAW,OAAO,IAAI;IACxB;EACF;AACA,SAAO;AACT;AAEA,IAAM,kBAAkB,IAAI,IAC1B,OAAO,QAAQ;EACb;EACA;EACA;EACA;;EAEA;EACA;;EAEA,SAAS;EACT;EACA;EACA;EACA,MAAM;;;CAGP,CAAC;AAMG,IAAM,SAAS,OAAO,UAAsB;AACjD,QAAM,OAAO,aAAa,MAAM,OAAO;AACvC,QAAM,WACJ,KAAK,SAAS,gBAAgB,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;AAEvD,MAAI,CAAC,UAAU;AACb,QAAI,MAAM,OAAO;AACf,aAAO;IACT;AAEA,UAAM,IAAI,MACR,6BAA6B,MAAM,QAAQ,KAAK,EAAE;EAEtD;AACA,SAAO,SAAS,KAAK;AACvB;;;AN3ZA,IAAM,SAAS,OAAO,UAAuB;AAE7C,IAAM,YAAY;EAChB;EACA,OAAO;EACP;EACA,SAAS;EACT;EACA,SAAS;EACT;EACA,MAAM;EACN,UAAU,OAAO,UAAsB;AACrC,UAAM,QAAQ,QAAQ,IAAI,IAAI,MAAM,QAAQ,KAAK;AACjD,UAAM,QAAQ,QAAQ,IAAI,IAAI,MAAM,QAAQ,KAAK;AACjD,WAAO;EACT;EACA,QAAQ,OAAO,UAAsB;AACnC,UAAM,MAAM,wBAAwB,EAAE,OAAO,MAAM,QAAO,CAAE;EAC9D;EACA,KAAK,OAAO,UAAsB;AAChC,QAAI,MAAM,QAAQ,UAAU,OAAO,MAAM,QAAQ,UAAU,KAAK;AAC9D,YAAM,MAAM,wBAAwB,EAAE,OAAO,MAAM,QAAO,CAAE;IAC9D;AACA,WAAO;EACT;EACA,WAAW;;AAEb,IAAM,eAAe,IAAI,IACvB,OAAO,QAAQ,SAAS,CAAC;AAGpB,IAAM,OAAO,OAClB,UACwB;AACxB,QAAM,WAAW,aAAa,IAAI,MAAM,QAAQ,IAAI;AAEpD,MAAI,CAAC,UAAU;AACb,QAAI,MAAM,OAAO;AACf,aAAO;IACT;AAEA,UAAM,IAAI,MACR,kCAAkC,MAAM,QAAQ,IAAI,EAAE;EAE1D;AACA,UAAQ,MAAM,SAAS,KAAK;AAG5B,MACE,0BAA0B,MAAM,OAAO,KACvC,MAAM,QAAQ,SAAS,UACvB;AACA,UAAM,OAAgC,0BACpC,MAAM,OAAO;AAGf,QAAI,KAAK,MAAM,QAAQ;AACrB,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AAC1C,cAAM,UAAU,KAAK,MAAM,CAAC;AAE5B,YAAI,CAAC;AAAS;AAEd,cAAM,aAA0B;UAC9B,GAAG;UACH;UACA,MAAM,KAAK,MAAM,IAAI,CAAC;UACtB,MAAM,KAAK,MAAM,IAAI,CAAC;;AAExB,gBAAQ,MAAM,KAAK,UAAU;MAC/B;IACF;AAEA,QAAI,eAAe,IAAI,GAAG;AACxB,iBAAW,QAAQ,MAAM,QAAQ,OAAO;AACtC,cAAM,QAAQ,MAAM,IAAI,IAAI;MAC9B;AACA,iBAAWC,SAAQ,MAAM,QAAQ,OAAO;AACtC,cAAM,QAAQ,MAAM,IAAIA,KAAI;MAC9B;IACF;EACF;AACA,SAAO;AACT;AAMM,IAAO,QAAP,MAAY;EAChB;EACA;EAEA,YAAY,EAAE,MAAK,GAAgB;AACjC,SAAK,SAAS,oBAAI,IAAG;AACrB,SAAK,SAAS;EAChB;EAEA,MAAM,OAAO,OAAa;AACxB,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,IAAI,UACR,4CAA4C;IAEhD;AAEA,QAAI,CAAC;AAAO,aAAO,EAAE,OAAO,CAAA,GAAI,OAAO,CAAA,EAAE;AAEzC,UAAM,eAAe,KAAK,OAAO,IAAI,KAAK;AAC1C,QAAI,cAAc;AAChB,aAAO;IACT;AAEA,UAAM,QAAQ,IAAI,IAChB,MAAM,KAAK,KAAK,OAAO,MAAM,OAAM,CAAE,CAAC;AAExC,UAAM,QAAQ,IAAI,IAAc,MAAM,KAAK,KAAK,OAAO,KAAK,CAAC;AAI7D,UAAM,EAAE,QAAO,IAAK,MAAM,KAAK;MAC7B,aAAS,+BAAAC,SAAqB,EAAG,QAAQ,KAAK;MAC9C,SAAS;QACP,OAAO,IAAI,IAAI,KAAK;QACpB,OAAO,IAAI,IAAI,KAAK;;MAEtB,SAAS;QACP,OAAO,oBAAI,IAAG;QACd,OAAO,oBAAI,IAAG;;MAEhB,SAAS,EAAE,OAAO,MAAK;MACvB;KACD;AAED,UAAM,MAAqB;MACzB,OAAO,MAAM,KAAK,QAAQ,KAAK;MAC/B,OAAO,MAAM,KAAK,QAAQ,KAAK;;AAEjC,SAAK,OAAO,IAAI,OAAO,GAAG;AAC1B,WAAO;EACT;;;;AO9JF,IAAM,yBAAyB;AAE/B,IAAM,aAAa,CAAC,SAAS,MAAM,UAAQ,QAAU,OAAO,MAAM;AAElE,IAAM,cAAc,CAAC,SAAS,MAAM,UAAQ,QAAU,KAAK,MAAM,MAAM,IAAI;AAE3E,IAAM,cAAc,CAAC,SAAS,MAAM,CAAC,KAAK,OAAO,SAAS,QAAU,KAAK,MAAM,MAAM,GAAG,IAAI,KAAK,IAAI,IAAI;AAEzG,IAAM,SAAS;AAAA,EACd,UAAU;AAAA,IACT,OAAO,CAAC,GAAG,CAAC;AAAA;AAAA,IAEZ,MAAM,CAAC,GAAG,EAAE;AAAA,IACZ,KAAK,CAAC,GAAG,EAAE;AAAA,IACX,QAAQ,CAAC,GAAG,EAAE;AAAA,IACd,WAAW,CAAC,GAAG,EAAE;AAAA,IACjB,UAAU,CAAC,IAAI,EAAE;AAAA,IACjB,SAAS,CAAC,GAAG,EAAE;AAAA,IACf,QAAQ,CAAC,GAAG,EAAE;AAAA,IACd,eAAe,CAAC,GAAG,EAAE;AAAA,EACtB;AAAA,EACA,OAAO;AAAA,IACN,OAAO,CAAC,IAAI,EAAE;AAAA,IACd,KAAK,CAAC,IAAI,EAAE;AAAA,IACZ,OAAO,CAAC,IAAI,EAAE;AAAA,IACd,QAAQ,CAAC,IAAI,EAAE;AAAA,IACf,MAAM,CAAC,IAAI,EAAE;AAAA,IACb,SAAS,CAAC,IAAI,EAAE;AAAA,IAChB,MAAM,CAAC,IAAI,EAAE;AAAA,IACb,OAAO,CAAC,IAAI,EAAE;AAAA;AAAA,IAGd,aAAa,CAAC,IAAI,EAAE;AAAA,IACpB,MAAM,CAAC,IAAI,EAAE;AAAA;AAAA,IACb,MAAM,CAAC,IAAI,EAAE;AAAA;AAAA,IACb,WAAW,CAAC,IAAI,EAAE;AAAA,IAClB,aAAa,CAAC,IAAI,EAAE;AAAA,IACpB,cAAc,CAAC,IAAI,EAAE;AAAA,IACrB,YAAY,CAAC,IAAI,EAAE;AAAA,IACnB,eAAe,CAAC,IAAI,EAAE;AAAA,IACtB,YAAY,CAAC,IAAI,EAAE;AAAA,IACnB,aAAa,CAAC,IAAI,EAAE;AAAA,EACrB;AAAA,EACA,SAAS;AAAA,IACR,SAAS,CAAC,IAAI,EAAE;AAAA,IAChB,OAAO,CAAC,IAAI,EAAE;AAAA,IACd,SAAS,CAAC,IAAI,EAAE;AAAA,IAChB,UAAU,CAAC,IAAI,EAAE;AAAA,IACjB,QAAQ,CAAC,IAAI,EAAE;AAAA,IACf,WAAW,CAAC,IAAI,EAAE;AAAA,IAClB,QAAQ,CAAC,IAAI,EAAE;AAAA,IACf,SAAS,CAAC,IAAI,EAAE;AAAA;AAAA,IAGhB,eAAe,CAAC,KAAK,EAAE;AAAA,IACvB,QAAQ,CAAC,KAAK,EAAE;AAAA;AAAA,IAChB,QAAQ,CAAC,KAAK,EAAE;AAAA;AAAA,IAChB,aAAa,CAAC,KAAK,EAAE;AAAA,IACrB,eAAe,CAAC,KAAK,EAAE;AAAA,IACvB,gBAAgB,CAAC,KAAK,EAAE;AAAA,IACxB,cAAc,CAAC,KAAK,EAAE;AAAA,IACtB,iBAAiB,CAAC,KAAK,EAAE;AAAA,IACzB,cAAc,CAAC,KAAK,EAAE;AAAA,IACtB,eAAe,CAAC,KAAK,EAAE;AAAA,EACxB;AACD;AAEO,IAAM,gBAAgB,OAAO,KAAK,OAAO,QAAQ;AACjD,IAAM,uBAAuB,OAAO,KAAK,OAAO,KAAK;AACrD,IAAM,uBAAuB,OAAO,KAAK,OAAO,OAAO;AACvD,IAAM,aAAa,CAAC,GAAG,sBAAsB,GAAG,oBAAoB;AAE3E,SAAS,iBAAiB;AACzB,QAAMC,SAAQ,oBAAI,IAAI;AAEtB,aAAW,CAAC,WAAW,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACxD,eAAW,CAAC,WAAW,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AACvD,aAAO,SAAS,IAAI;AAAA,QACnB,MAAM,QAAU,MAAM,CAAC,CAAC;AAAA,QACxB,OAAO,QAAU,MAAM,CAAC,CAAC;AAAA,MAC1B;AAEA,YAAM,SAAS,IAAI,OAAO,SAAS;AAEnC,MAAAA,OAAM,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,IAC7B;AAEA,WAAO,eAAe,QAAQ,WAAW;AAAA,MACxC,OAAO;AAAA,MACP,YAAY;AAAA,IACb,CAAC;AAAA,EACF;AAEA,SAAO,eAAe,QAAQ,SAAS;AAAA,IACtC,OAAOA;AAAA,IACP,YAAY;AAAA,EACb,CAAC;AAED,SAAO,MAAM,QAAQ;AACrB,SAAO,QAAQ,QAAQ;AAEvB,SAAO,MAAM,OAAO,WAAW;AAC/B,SAAO,MAAM,UAAU,YAAY;AACnC,SAAO,MAAM,UAAU,YAAY;AACnC,SAAO,QAAQ,OAAO,WAAW,sBAAsB;AACvD,SAAO,QAAQ,UAAU,YAAY,sBAAsB;AAC3D,SAAO,QAAQ,UAAU,YAAY,sBAAsB;AAG3D,SAAO,iBAAiB,QAAQ;AAAA,IAC/B,cAAc;AAAA,MACb,MAAM,KAAK,OAAO,MAAM;AAGvB,YAAI,QAAQ,SAAS,UAAU,MAAM;AACpC,cAAI,MAAM,GAAG;AACZ,mBAAO;AAAA,UACR;AAEA,cAAI,MAAM,KAAK;AACd,mBAAO;AAAA,UACR;AAEA,iBAAO,KAAK,OAAQ,MAAM,KAAK,MAAO,EAAE,IAAI;AAAA,QAC7C;AAEA,eAAO,KACH,KAAK,KAAK,MAAM,MAAM,MAAM,CAAC,IAC7B,IAAI,KAAK,MAAM,QAAQ,MAAM,CAAC,IAC/B,KAAK,MAAM,OAAO,MAAM,CAAC;AAAA,MAC7B;AAAA,MACA,YAAY;AAAA,IACb;AAAA,IACA,UAAU;AAAA,MACT,MAAM,KAAK;AACV,cAAM,UAAU,yBAAyB,KAAK,IAAI,SAAS,EAAE,CAAC;AAC9D,YAAI,CAAC,SAAS;AACb,iBAAO,CAAC,GAAG,GAAG,CAAC;AAAA,QAChB;AAEA,YAAI,CAAC,WAAW,IAAI;AAEpB,YAAI,YAAY,WAAW,GAAG;AAC7B,wBAAc,CAAC,GAAG,WAAW,EAAE,IAAI,eAAa,YAAY,SAAS,EAAE,KAAK,EAAE;AAAA,QAC/E;AAEA,cAAM,UAAU,OAAO,SAAS,aAAa,EAAE;AAE/C,eAAO;AAAA;AAAA,UAEL,WAAW,KAAM;AAAA,UACjB,WAAW,IAAK;AAAA,UACjB,UAAU;AAAA;AAAA,QAEX;AAAA,MACD;AAAA,MACA,YAAY;AAAA,IACb;AAAA,IACA,cAAc;AAAA,MACb,OAAO,SAAO,OAAO,aAAa,GAAG,OAAO,SAAS,GAAG,CAAC;AAAA,MACzD,YAAY;AAAA,IACb;AAAA,IACA,eAAe;AAAA,MACd,MAAM,MAAM;AACX,YAAI,OAAO,GAAG;AACb,iBAAO,KAAK;AAAA,QACb;AAEA,YAAI,OAAO,IAAI;AACd,iBAAO,MAAM,OAAO;AAAA,QACrB;AAEA,YAAI;AACJ,YAAI;AACJ,YAAI;AAEJ,YAAI,QAAQ,KAAK;AAChB,kBAAS,OAAO,OAAO,KAAM,KAAK;AAClC,kBAAQ;AACR,iBAAO;AAAA,QACR,OAAO;AACN,kBAAQ;AAER,gBAAM,YAAY,OAAO;AAEzB,gBAAM,KAAK,MAAM,OAAO,EAAE,IAAI;AAC9B,kBAAQ,KAAK,MAAM,YAAY,CAAC,IAAI;AACpC,iBAAQ,YAAY,IAAK;AAAA,QAC1B;AAEA,cAAM,QAAQ,KAAK,IAAI,KAAK,OAAO,IAAI,IAAI;AAE3C,YAAI,UAAU,GAAG;AAChB,iBAAO;AAAA,QACR;AAGA,YAAI,SAAS,MAAO,KAAK,MAAM,IAAI,KAAK,IAAM,KAAK,MAAM,KAAK,KAAK,IAAK,KAAK,MAAM,GAAG;AAEtF,YAAI,UAAU,GAAG;AAChB,oBAAU;AAAA,QACX;AAEA,eAAO;AAAA,MACR;AAAA,MACA,YAAY;AAAA,IACb;AAAA,IACA,WAAW;AAAA,MACV,OAAO,CAAC,KAAK,OAAO,SAAS,OAAO,cAAc,OAAO,aAAa,KAAK,OAAO,IAAI,CAAC;AAAA,MACvF,YAAY;AAAA,IACb;AAAA,IACA,WAAW;AAAA,MACV,OAAO,SAAO,OAAO,cAAc,OAAO,aAAa,GAAG,CAAC;AAAA,MAC3D,YAAY;AAAA,IACb;AAAA,EACD,CAAC;AAED,SAAO;AACR;AAEA,IAAM,aAAa,eAAe;AAElC,IAAO,sBAAQ;;;AC9Nf,OAAOC,cAAa;AACpB,OAAOC,SAAQ;AACf,OAAO,SAAS;AAIhB,SAAS,QAAQ,MAAM,OAAO,WAAW,OAAO,WAAW,KAAK,OAAOD,SAAQ,MAAM;AACpF,QAAM,SAAS,KAAK,WAAW,GAAG,IAAI,KAAM,KAAK,WAAW,IAAI,MAAM;AACtE,QAAM,WAAW,KAAK,QAAQ,SAAS,IAAI;AAC3C,QAAM,qBAAqB,KAAK,QAAQ,IAAI;AAC5C,SAAO,aAAa,OAAO,uBAAuB,MAAM,WAAW;AACpE;AAEA,IAAM,EAAC,IAAG,IAAIA;AAEd,IAAI;AACJ,IACC,QAAQ,UAAU,KACf,QAAQ,WAAW,KACnB,QAAQ,aAAa,KACrB,QAAQ,aAAa,GACvB;AACD,mBAAiB;AAClB,WACC,QAAQ,OAAO,KACZ,QAAQ,QAAQ,KAChB,QAAQ,YAAY,KACpB,QAAQ,cAAc,GACxB;AACD,mBAAiB;AAClB;AAEA,SAAS,gBAAgB;AACxB,MAAI,iBAAiB,KAAK;AACzB,QAAI,IAAI,gBAAgB,QAAQ;AAC/B,aAAO;AAAA,IACR;AAEA,QAAI,IAAI,gBAAgB,SAAS;AAChC,aAAO;AAAA,IACR;AAEA,WAAO,IAAI,YAAY,WAAW,IAAI,IAAI,KAAK,IAAI,OAAO,SAAS,IAAI,aAAa,EAAE,GAAG,CAAC;AAAA,EAC3F;AACD;AAEA,SAAS,eAAe,OAAO;AAC9B,MAAI,UAAU,GAAG;AAChB,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN;AAAA,IACA,UAAU;AAAA,IACV,QAAQ,SAAS;AAAA,IACjB,QAAQ,SAAS;AAAA,EAClB;AACD;AAEA,SAAS,eAAe,YAAY,EAAC,aAAa,aAAa,KAAI,IAAI,CAAC,GAAG;AAC1E,QAAM,mBAAmB,cAAc;AACvC,MAAI,qBAAqB,QAAW;AACnC,qBAAiB;AAAA,EAClB;AAEA,QAAM,aAAa,aAAa,iBAAiB;AAEjD,MAAI,eAAe,GAAG;AACrB,WAAO;AAAA,EACR;AAEA,MAAI,YAAY;AACf,QAAI,QAAQ,WAAW,KACnB,QAAQ,YAAY,KACpB,QAAQ,iBAAiB,GAAG;AAC/B,aAAO;AAAA,IACR;AAEA,QAAI,QAAQ,WAAW,GAAG;AACzB,aAAO;AAAA,IACR;AAAA,EACD;AAIA,MAAI,cAAc,OAAO,gBAAgB,KAAK;AAC7C,WAAO;AAAA,EACR;AAEA,MAAI,cAAc,CAAC,eAAe,eAAe,QAAW;AAC3D,WAAO;AAAA,EACR;AAEA,QAAM,MAAM,cAAc;AAE1B,MAAI,IAAI,SAAS,QAAQ;AACxB,WAAO;AAAA,EACR;AAEA,MAAIA,SAAQ,aAAa,SAAS;AAGjC,UAAM,YAAYC,IAAG,QAAQ,EAAE,MAAM,GAAG;AACxC,QACC,OAAO,UAAU,CAAC,CAAC,KAAK,MACrB,OAAO,UAAU,CAAC,CAAC,KAAK,OAC1B;AACD,aAAO,OAAO,UAAU,CAAC,CAAC,KAAK,QAAS,IAAI;AAAA,IAC7C;AAEA,WAAO;AAAA,EACR;AAEA,MAAI,QAAQ,KAAK;AAChB,QAAI,oBAAoB,OAAO,mBAAmB,KAAK;AACtD,aAAO;AAAA,IACR;AAEA,QAAI,CAAC,UAAU,YAAY,YAAY,aAAa,aAAa,OAAO,EAAE,KAAK,UAAQ,QAAQ,GAAG,KAAK,IAAI,YAAY,YAAY;AAClI,aAAO;AAAA,IACR;AAEA,WAAO;AAAA,EACR;AAEA,MAAI,sBAAsB,KAAK;AAC9B,WAAO,gCAAgC,KAAK,IAAI,gBAAgB,IAAI,IAAI;AAAA,EACzE;AAEA,MAAI,IAAI,cAAc,aAAa;AAClC,WAAO;AAAA,EACR;AAEA,MAAI,IAAI,SAAS,eAAe;AAC/B,WAAO;AAAA,EACR;AAEA,MAAI,kBAAkB,KAAK;AAC1B,UAAMC,WAAU,OAAO,UAAU,IAAI,wBAAwB,IAAI,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE;AAElF,YAAQ,IAAI,cAAc;AAAA,MACzB,KAAK,aAAa;AACjB,eAAOA,YAAW,IAAI,IAAI;AAAA,MAC3B;AAAA,MAEA,KAAK,kBAAkB;AACtB,eAAO;AAAA,MACR;AAAA,IAED;AAAA,EACD;AAEA,MAAI,iBAAiB,KAAK,IAAI,IAAI,GAAG;AACpC,WAAO;AAAA,EACR;AAEA,MAAI,8DAA8D,KAAK,IAAI,IAAI,GAAG;AACjF,WAAO;AAAA,EACR;AAEA,MAAI,eAAe,KAAK;AACvB,WAAO;AAAA,EACR;AAEA,SAAO;AACR;AAEO,SAAS,oBAAoBC,SAAQ,UAAU,CAAC,GAAG;AACzD,QAAM,QAAQ,eAAeA,SAAQ;AAAA,IACpC,aAAaA,WAAUA,QAAO;AAAA,IAC9B,GAAG;AAAA,EACJ,CAAC;AAED,SAAO,eAAe,KAAK;AAC5B;AAEA,IAAM,gBAAgB;AAAA,EACrB,QAAQ,oBAAoB,EAAC,OAAO,IAAI,OAAO,CAAC,EAAC,CAAC;AAAA,EAClD,QAAQ,oBAAoB,EAAC,OAAO,IAAI,OAAO,CAAC,EAAC,CAAC;AACnD;AAEA,IAAO,yBAAQ;;;ACpLR,SAAS,iBAAiB,QAAQ,WAAW,UAAU;AAC7D,MAAI,QAAQ,OAAO,QAAQ,SAAS;AACpC,MAAI,UAAU,IAAI;AACjB,WAAO;AAAA,EACR;AAEA,QAAM,kBAAkB,UAAU;AAClC,MAAI,WAAW;AACf,MAAI,cAAc;AAClB,KAAG;AACF,mBAAe,OAAO,MAAM,UAAU,KAAK,IAAI,YAAY;AAC3D,eAAW,QAAQ;AACnB,YAAQ,OAAO,QAAQ,WAAW,QAAQ;AAAA,EAC3C,SAAS,UAAU;AAEnB,iBAAe,OAAO,MAAM,QAAQ;AACpC,SAAO;AACR;AAEO,SAAS,+BAA+B,QAAQ,QAAQ,SAAS,OAAO;AAC9E,MAAI,WAAW;AACf,MAAI,cAAc;AAClB,KAAG;AACF,UAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM;AACpC,mBAAe,OAAO,MAAM,UAAW,QAAQ,QAAQ,IAAI,KAAM,IAAI,UAAU,QAAQ,SAAS,QAAQ;AACxG,eAAW,QAAQ;AACnB,YAAQ,OAAO,QAAQ,MAAM,QAAQ;AAAA,EACtC,SAAS,UAAU;AAEnB,iBAAe,OAAO,MAAM,QAAQ;AACpC,SAAO;AACR;;;ACzBA,IAAM,EAAC,QAAQ,aAAa,QAAQ,YAAW,IAAI;AAEnD,IAAM,YAAY,OAAO,WAAW;AACpC,IAAM,SAAS,OAAO,QAAQ;AAC9B,IAAM,WAAW,OAAO,UAAU;AAGlC,IAAM,eAAe;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AAEA,IAAMC,UAAS,uBAAO,OAAO,IAAI;AAEjC,IAAM,eAAe,CAAC,QAAQ,UAAU,CAAC,MAAM;AAC9C,MAAI,QAAQ,SAAS,EAAE,OAAO,UAAU,QAAQ,KAAK,KAAK,QAAQ,SAAS,KAAK,QAAQ,SAAS,IAAI;AACpG,UAAM,IAAI,MAAM,qDAAqD;AAAA,EACtE;AAGA,QAAM,aAAa,cAAc,YAAY,QAAQ;AACrD,SAAO,QAAQ,QAAQ,UAAU,SAAY,aAAa,QAAQ;AACnE;AASA,IAAM,eAAe,aAAW;AAC/B,QAAMC,SAAQ,IAAI,YAAY,QAAQ,KAAK,GAAG;AAC9C,eAAaA,QAAO,OAAO;AAE3B,SAAO,eAAeA,QAAO,YAAY,SAAS;AAElD,SAAOA;AACR;AAEA,SAAS,YAAY,SAAS;AAC7B,SAAO,aAAa,OAAO;AAC5B;AAEA,OAAO,eAAe,YAAY,WAAW,SAAS,SAAS;AAE/D,WAAW,CAAC,WAAW,KAAK,KAAK,OAAO,QAAQ,mBAAU,GAAG;AAC5D,EAAAC,QAAO,SAAS,IAAI;AAAA,IACnB,MAAM;AACL,YAAM,UAAU,cAAc,MAAM,aAAa,MAAM,MAAM,MAAM,OAAO,KAAK,MAAM,CAAC,GAAG,KAAK,QAAQ,CAAC;AACvG,aAAO,eAAe,MAAM,WAAW,EAAC,OAAO,QAAO,CAAC;AACvD,aAAO;AAAA,IACR;AAAA,EACD;AACD;AAEAA,QAAO,UAAU;AAAA,EAChB,MAAM;AACL,UAAM,UAAU,cAAc,MAAM,KAAK,MAAM,GAAG,IAAI;AACtD,WAAO,eAAe,MAAM,WAAW,EAAC,OAAO,QAAO,CAAC;AACvD,WAAO;AAAA,EACR;AACD;AAEA,IAAM,eAAe,CAAC,OAAO,OAAO,SAAS,eAAe;AAC3D,MAAI,UAAU,OAAO;AACpB,QAAI,UAAU,WAAW;AACxB,aAAO,oBAAW,IAAI,EAAE,QAAQ,GAAG,UAAU;AAAA,IAC9C;AAEA,QAAI,UAAU,WAAW;AACxB,aAAO,oBAAW,IAAI,EAAE,QAAQ,oBAAW,aAAa,GAAG,UAAU,CAAC;AAAA,IACvE;AAEA,WAAO,oBAAW,IAAI,EAAE,KAAK,oBAAW,UAAU,GAAG,UAAU,CAAC;AAAA,EACjE;AAEA,MAAI,UAAU,OAAO;AACpB,WAAO,aAAa,OAAO,OAAO,MAAM,GAAG,oBAAW,SAAS,GAAG,UAAU,CAAC;AAAA,EAC9E;AAEA,SAAO,oBAAW,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU;AAC7C;AAEA,IAAM,aAAa,CAAC,OAAO,OAAO,SAAS;AAE3C,WAAW,SAAS,YAAY;AAC/B,EAAAA,QAAO,KAAK,IAAI;AAAA,IACf,MAAM;AACL,YAAM,EAAC,MAAK,IAAI;AAChB,aAAO,YAAa,YAAY;AAC/B,cAAM,SAAS,aAAa,aAAa,OAAO,aAAa,KAAK,GAAG,SAAS,GAAG,UAAU,GAAG,oBAAW,MAAM,OAAO,KAAK,MAAM,CAAC;AAClI,eAAO,cAAc,MAAM,QAAQ,KAAK,QAAQ,CAAC;AAAA,MAClD;AAAA,IACD;AAAA,EACD;AAEA,QAAM,UAAU,OAAO,MAAM,CAAC,EAAE,YAAY,IAAI,MAAM,MAAM,CAAC;AAC7D,EAAAA,QAAO,OAAO,IAAI;AAAA,IACjB,MAAM;AACL,YAAM,EAAC,MAAK,IAAI;AAChB,aAAO,YAAa,YAAY;AAC/B,cAAM,SAAS,aAAa,aAAa,OAAO,aAAa,KAAK,GAAG,WAAW,GAAG,UAAU,GAAG,oBAAW,QAAQ,OAAO,KAAK,MAAM,CAAC;AACtI,eAAO,cAAc,MAAM,QAAQ,KAAK,QAAQ,CAAC;AAAA,MAClD;AAAA,IACD;AAAA,EACD;AACD;AAEA,IAAM,QAAQ,OAAO,iBAAiB,MAAM;AAAC,GAAG;AAAA,EAC/C,GAAGA;AAAA,EACH,OAAO;AAAA,IACN,YAAY;AAAA,IACZ,MAAM;AACL,aAAO,KAAK,SAAS,EAAE;AAAA,IACxB;AAAA,IACA,IAAI,OAAO;AACV,WAAK,SAAS,EAAE,QAAQ;AAAA,IACzB;AAAA,EACD;AACD,CAAC;AAED,IAAM,eAAe,CAAC,MAAM,OAAO,WAAW;AAC7C,MAAI;AACJ,MAAI;AACJ,MAAI,WAAW,QAAW;AACzB,cAAU;AACV,eAAW;AAAA,EACZ,OAAO;AACN,cAAU,OAAO,UAAU;AAC3B,eAAW,QAAQ,OAAO;AAAA,EAC3B;AAEA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAEA,IAAM,gBAAgB,CAAC,MAAM,SAAS,aAAa;AAGlD,QAAM,UAAU,IAAI,eAAe,WAAW,SAAU,WAAW,WAAW,IAAM,KAAK,WAAW,CAAC,IAAK,WAAW,KAAK,GAAG,CAAC;AAI9H,SAAO,eAAe,SAAS,KAAK;AAEpC,UAAQ,SAAS,IAAI;AACrB,UAAQ,MAAM,IAAI;AAClB,UAAQ,QAAQ,IAAI;AAEpB,SAAO;AACR;AAEA,IAAM,aAAa,CAAC,MAAM,WAAW;AACpC,MAAI,KAAK,SAAS,KAAK,CAAC,QAAQ;AAC/B,WAAO,KAAK,QAAQ,IAAI,KAAK;AAAA,EAC9B;AAEA,MAAI,SAAS,KAAK,MAAM;AAExB,MAAI,WAAW,QAAW;AACzB,WAAO;AAAA,EACR;AAEA,QAAM,EAAC,SAAS,SAAQ,IAAI;AAC5B,MAAI,OAAO,SAAS,MAAQ,GAAG;AAC9B,WAAO,WAAW,QAAW;AAI5B,eAAS,iBAAiB,QAAQ,OAAO,OAAO,OAAO,IAAI;AAE3D,eAAS,OAAO;AAAA,IACjB;AAAA,EACD;AAKA,QAAM,UAAU,OAAO,QAAQ,IAAI;AACnC,MAAI,YAAY,IAAI;AACnB,aAAS,+BAA+B,QAAQ,UAAU,SAAS,OAAO;AAAA,EAC3E;AAEA,SAAO,UAAU,SAAS;AAC3B;AAEA,OAAO,iBAAiB,YAAY,WAAWA,OAAM;AAErD,IAAM,QAAQ,YAAY;AACnB,IAAM,cAAc,YAAY,EAAC,OAAO,cAAc,YAAY,QAAQ,EAAC,CAAC;AAoBnF,IAAO,iBAAQ;;;ACrNR,IAAM,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;AAyBd,IAAM,UAAU,OAAO,SAAsB;AAClD,QAAM,WAAW,KAAK,QAAQ;AAC9B,QAAM,eAAe,KAAK,QAAQ,YAAY,KAC5C,KAAK,QAAQ,WAAW;AAE1B,QAAM,QAAQ,OAAO,KAAK;IACxB,GAAG,KAAK;IACR;IACA;IACA,eAAe;GAChB;AAED,QAAM,cAAc,KAAK,YAAY,CAAC;AACtC,QAAM,QAAQ,IAAI,MAAM,EAAE,MAAK,CAAE;AACjC,QAAM,qBAAqB;AAC3B,QAAM,kBAA4B,CAAA;AAElC,QAAM,YAAY,oBAAI,IAAG;AACzB,MAAI,UAAU;AACZ,eAAW,aAAa,SAAS,OAAO,KAAK,MAAM,GAAG;AACpD,YAAM,IAAsB,MAAM,MAAM,IAAI,UAAU,EAAE;AACxD,UAAI,GAAG;AACL,kBAAU,IAAI,CAAC;AACf,wBAAgB,KAAK,UAAU,EAAE,IAAI,IAAI;AACzC,wBAAgB,KAAK,UAAU,EAAE,IAAI,QAAQ;MAC/C;IACF;EACF;AACA,MAAI,UAAU,SAAS,GAAG;AACxB,eAAW,YAAY,MAAM,WAAW;AACtC,gBAAU,IAAI,QAAQ;IACxB;EACF;AAEA,QAAM,6BAA6B,gBAAgB,KAAK,IAAI;AAC5D,QAAM,qBAEF,gBAAgB,UAChB,gBAAgB,SAAS,MAAM,UAAU,OAEzC,6BACA;AACJ,QAAM,EAAE,OAAO,MAAK,IAAK,MAAM,MAAM,OACnC,eAAe,kBAAkB;AAEnC,QAAM,SAAS,KAAK,OAAO,QAAQ,iBAAQ;AAE3C,QAAM,SAEF,KAAK,OAAO,SAAS;EAEpB,CAAC,KAAK,OAAO,QAAQ,CAAC,QAAQ,OAAO,QAEtC,WAAW,EAAE,OAAO,MAAK,CAAE,IAC3B,KAAK,OAAO,SAAS,YACrB,cAAc,EAAE,WAAW,OAAO,MAAK,CAAE,IACzC,oBAAoB;IAClB;IACA;IACA;IACA;IACA,oBAAoB,CAAC,CAAC;GACvB;AAEL,UAAQ,IAAI,MAAM;AACpB;",
   "names": ["expand", "sync", "fs", "path", "stat", "sync", "fs", "path", "stat", "fs", "sync", "path", "resolve", "is", "path", "resolve", "ext", "is", "path", "env", "match", "path", "fs", "command", "path", "escape", "parse", "command", "parse", "spawn", "command", "cloneNode", "Node", "types", "_getRequireWildcardCache", "nodeInterop", "_setPrototypeOf", "o", "p", "Container", "id", "empty", "walk", "split", "filter", "_setPrototypeOf", "o", "p", "Root", "error", "_setPrototypeOf", "o", "p", "Selector", "merge", "defaults", "cssesc", "_setPrototypeOf", "o", "p", "ClassName", "_setPrototypeOf", "o", "p", "Comment", "_setPrototypeOf", "o", "p", "ID", "_setPrototypeOf", "o", "p", "Namespace", "_setPrototypeOf", "o", "p", "Tag", "_setPrototypeOf", "o", "p", "String", "_setPrototypeOf", "o", "p", "Pseudo", "require_node", "_setPrototypeOf", "o", "p", "Attribute", "_setPrototypeOf", "o", "p", "Universal", "_setPrototypeOf", "o", "p", "Combinator", "_setPrototypeOf", "o", "p", "Nesting", "combinator", "_getRequireWildcardCache", "nodeInterop", "types", "_getRequireWildcardCache", "nodeInterop", "Parser", "attribute", "attr", "combinator", "error", "pseudo", "current", "parse", "Processor", "resolve", "root", "process", "attribute", "className", "combinator", "comment", "id", "nesting", "pseudo", "root", "selector", "string", "tag", "universal", "selectors", "_getRequireWildcardCache", "nodeInterop", "parser", "limit", "version", "build", "major", "minor", "build", "M", "m", "z", "version", "project", "range", "path", "scope", "t", "Spec", "id", "Spec", "s", "resolve", "parse", "resolve", "parse", "readFileSync", "glob", "i", "acc", "ext", "glob", "re", "hasMagic", "start", "final", "ext", "qmark", "star", "expand", "regExpEscape", "re", "fileURLToPath", "getOptions", "v", "bf", "p", "ret", "resolve", "res", "root", "path", "p", "resolve", "sep", "fs", "filter", "walk", "process", "promises", "sync", "defaultPlatform", "relative", "path", "root", "rest", "path", "abs", "target", "defaultPlatform", "fileURLToPath", "d", "path", "n", "promises", "resolve", "posix", "path", "resolve", "readFileSync", "parse", "filter", "group", "glob", "posix", "ws", "load", "resolve", "id", "version", "Spec", "inspect", "kCustomInspect", "inspect", "isRecordStringString", "delimiter", "depIDRegExp", "isDepID", "asDepID", "splitDepID", "id", "delimiter", "version", "splitDepID", "nameVersion", "optional", "dev", "id", "version", "kCustomInspect", "Spec", "id", "version", "inspect", "missing", "readFileSync", "resolve", "asDepID", "id", "id", "splitDepID", "readFileSync", "resolve", "lockfileData", "path", "realpath", "Spec", "graph", "rename", "basename", "glob", "parse", "resolve", "inspect", "path", "inspect", "resolve", "root", "parse", "statSync", "lstatSync", "readdirSync", "path", "readdir", "lstat", "parse", "resolve", "readdir", "path", "readdirSync", "lstat", "rmdir", "unlink", "path", "lstatSync", "ent", "resolve", "parse", "parse", "resolve", "chmod", "path", "path", "basename", "parse", "resolve", "parse", "resolve", "stat", "path", "statSync", "root", "parse", "resolve", "lstat", "rename", "unlink", "rmdir", "chmod", "path", "basename", "parse", "ent", "resolve", "rm", "lstatSync", "rmSync", "unlink", "rmdir", "lstat", "path", "filter", "lstatSync", "ent", "resolve", "parse", "rm", "path", "path", "posix", "path", "posix", "resolve", "availableParallelism", "kCustomInspect", "id", "wrap", "mkdir", "dirname", "relative", "spawn", "process", "global", "load", "spawn", "spawn", "crossSpawn", "dirname", "resolve", "statSync", "chmod", "availableParallelism", "attribute", "attr", "edge", "splitDepID", "node", "postcssSelectorParser", "codes", "process", "os", "version", "stream", "styles", "chalk", "styles"]