@sitecore/sc-contenthub-blok 1.0.14 → 1.0.27

package/node_modules/@babel/traverse/lib/traverse-node.js

@@ -118,7 +118,6 @@ function _traverse(node, opts, scope, state, path, skipKeys, visitSelf) {
   return false;
 }
 function traverseNode(node, opts, scope, state, path, skipKeys, visitSelf) {
-  ;
   const keys = VISITOR_KEYS[node.type];
   if (!keys) return false;
   const context = new _context.default(scope, opts, state, path);

package/node_modules/@babel/traverse/lib/traverse-node.js.map

@@ -1 +1 @@
-{"version":3,"names":["_context","require","_index","_t","_context2","VISITOR_KEYS","_visitPaths","ctx","paths","queue","priorityQueue","visited","Set","stop","visitIndex","length","path","resync","call","contexts","pushContext","key","node","has","add","_visit","i","popContext","_opts$denylist","opts","denylist","blacklist","includes","type","shouldSkip","shouldStop","_call","enter","_opts$node$type","_traverse","scope","state","skipKeys","exit","_opts$node$type2","visitSelf","keys","TraversalContext","parentKey","prop","Array","isArray","childPath","NodePath","get","parentPath","parent","container","listKey","push","traverseNode","context","visitQueue","visit"],"sources":["../src/traverse-node.ts"],"sourcesContent":["import TraversalContext from \"./context.ts\";\nimport type { ExplodedTraverseOptions } from \"./index.ts\";\nimport NodePath from \"./path/index.ts\";\nimport type Scope from \"./scope/index.ts\";\nimport type * as t from \"@babel/types\";\nimport { VISITOR_KEYS } from \"@babel/types\";\nimport { _call, popContext, pushContext, resync } from \"./path/context.ts\";\n\nfunction _visitPaths(ctx: TraversalContext, paths: NodePath[]): boolean {\n  // set queue\n  ctx.queue = paths;\n  ctx.priorityQueue = [];\n\n  const visited = new Set();\n  let stop = false;\n  let visitIndex = 0;\n\n  for (; visitIndex < paths.length; ) {\n    const path = paths[visitIndex];\n    visitIndex++;\n\n    resync.call(path);\n\n    if (\n      path.contexts.length === 0 ||\n      path.contexts[path.contexts.length - 1] !== ctx\n    ) {\n      // The context might already have been pushed when this path was inserted and queued.\n      // If we always re-pushed here, we could get duplicates and risk leaving contexts\n      // on the stack after the traversal has completed, which could break things.\n      pushContext.call(path, ctx);\n    }\n\n    // this path no longer belongs to the tree\n    if (path.key === null) continue;\n\n    // ensure we don't visit the same node twice\n    const { node } = path;\n    if (visited.has(node)) continue;\n    if (node) visited.add(node);\n\n    if (_visit(ctx, path)) {\n      stop = true;\n      break;\n    }\n\n    if (ctx.priorityQueue.length) {\n      stop = _visitPaths(ctx, ctx.priorityQueue);\n      ctx.priorityQueue = [];\n      ctx.queue = paths;\n      if (stop) break;\n    }\n  }\n\n  // pop contexts\n  for (let i = 0; i < visitIndex; i++) {\n    popContext.call(paths[i]);\n  }\n\n  // clear queue\n  ctx.queue = null;\n\n  return stop;\n}\n\nfunction _visit(ctx: TraversalContext, path: NodePath) {\n  const node = path.node;\n  if (!node) {\n    return false;\n  }\n  const opts = ctx.opts;\n\n  // @ts-expect-error TODO(Babel 8): Remove blacklist\n  const denylist = opts.denylist ?? opts.blacklist;\n  if (denylist?.includes(node.type)) {\n    return false;\n  }\n\n  if (opts.shouldSkip?.(path)) {\n    return false;\n  }\n\n  // Note: We need to check \"this.shouldSkip\" first because\n  // another visitor can set it to true. Usually .shouldSkip is false\n  // before calling the enter visitor, but it can be true in case of\n  // a requeued node (e.g. by .replaceWith()) that is then marked\n  // with .skip().\n  if (path.shouldSkip) return path.shouldStop;\n\n  if (_call.call(path, opts.enter)) return path.shouldStop;\n  if (path.node) {\n    if (_call.call(path, opts[node.type]?.enter)) return path.shouldStop;\n  }\n\n  path.shouldStop = _traverse(\n    path.node,\n    opts,\n    path.scope,\n    ctx.state,\n    path,\n    path.skipKeys,\n  );\n\n  if (path.node) {\n    if (_call.call(path, opts.exit)) return true;\n  }\n  if (path.node) {\n    _call.call(path, opts[node.type]?.exit);\n  }\n\n  return path.shouldStop;\n}\n\nfunction _traverse<S>(\n  node: t.Node,\n  opts: ExplodedTraverseOptions<S>,\n  scope?: Scope,\n  state?: S,\n  path?: NodePath,\n  skipKeys?: Record<string, boolean>,\n  visitSelf?: boolean,\n) {\n  const keys = VISITOR_KEYS[node.type];\n  if (!keys?.length) return false;\n\n  const ctx = new TraversalContext(scope, opts, state, path);\n  if (visitSelf) {\n    if (skipKeys?.[path.parentKey]) return false;\n    return _visitPaths(ctx, [path]);\n  }\n\n  for (const key of keys) {\n    if (skipKeys?.[key]) continue;\n    // @ts-expect-error key must present in node\n    const prop = node[key];\n    if (!prop) continue;\n\n    if (Array.isArray(prop)) {\n      if (!prop.length) continue;\n      const paths = [];\n      for (let i = 0; i < prop.length; i++) {\n        const childPath = NodePath.get({\n          parentPath: path,\n          parent: node,\n          container: prop,\n          key: i,\n          listKey: key,\n        });\n        paths.push(childPath);\n      }\n      if (_visitPaths(ctx, paths)) return true;\n    } else {\n      if (\n        _visitPaths(ctx, [\n          NodePath.get({\n            parentPath: path,\n            parent: node,\n            container: node,\n            key,\n            listKey: null,\n          }),\n        ])\n      ) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\n/**\n * Traverse the children of given node\n * @param {Node} node\n * @param {TraverseOptions} opts The traverse options used to create a new traversal context\n * @param {scope} scope A traversal scope used to create a new traversal context. When opts.noScope is true, scope should not be provided\n * @param {any} state A user data storage provided as the second callback argument for traversal visitors\n * @param {NodePath} path A NodePath of given node\n * @param {Record<string, boolean>} skipKeys A map from key names to whether that should be skipped during traversal. The skipKeys are applied to every descendants\n * @returns {boolean} Whether the traversal stops early\n\n * @note This function does not visit the given `node`.\n */\nexport function traverseNode<S = unknown>(\n  node: t.Node,\n  opts: ExplodedTraverseOptions<S>,\n  scope?: Scope,\n  state?: S,\n  path?: NodePath,\n  skipKeys?: Record<string, boolean>,\n  visitSelf?: boolean,\n): boolean {\n  if (process.env.BABEL_8_BREAKING) {\n    return _traverse(node, opts, scope, state, path, skipKeys, visitSelf);\n  }\n\n  const keys = VISITOR_KEYS[node.type];\n  if (!keys) return false;\n\n  const context = new TraversalContext<S>(scope, opts, state, path);\n  if (visitSelf) {\n    if (skipKeys?.[path.parentKey]) return false;\n    return context.visitQueue([path]);\n  }\n\n  for (const key of keys) {\n    if (skipKeys?.[key]) continue;\n    if (context.visit(node, key)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,QAAA,GAAAC,OAAA;AAEA,IAAAC,MAAA,GAAAD,OAAA;AAGA,IAAAE,EAAA,GAAAF,OAAA;AACA,IAAAG,SAAA,GAAAH,OAAA;AAA2E;EADlEI;AAAY,IAAAF,EAAA;AAGrB,SAASG,WAAWA,CAACC,GAAqB,EAAEC,KAAiB,EAAW;EAEtED,GAAG,CAACE,KAAK,GAAGD,KAAK;EACjBD,GAAG,CAACG,aAAa,GAAG,EAAE;EAEtB,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAC,CAAC;EACzB,IAAIC,IAAI,GAAG,KAAK;EAChB,IAAIC,UAAU,GAAG,CAAC;EAElB,OAAOA,UAAU,GAAGN,KAAK,CAACO,MAAM,GAAI;IAClC,MAAMC,IAAI,GAAGR,KAAK,CAACM,UAAU,CAAC;IAC9BA,UAAU,EAAE;IAEZG,gBAAM,CAACC,IAAI,CAACF,IAAI,CAAC;IAEjB,IACEA,IAAI,CAACG,QAAQ,CAACJ,MAAM,KAAK,CAAC,IAC1BC,IAAI,CAACG,QAAQ,CAACH,IAAI,CAACG,QAAQ,CAACJ,MAAM,GAAG,CAAC,CAAC,KAAKR,GAAG,EAC/C;MAIAa,qBAAW,CAACF,IAAI,CAACF,IAAI,EAAET,GAAG,CAAC;IAC7B;IAGA,IAAIS,IAAI,CAACK,GAAG,KAAK,IAAI,EAAE;IAGvB,MAAM;MAAEC;IAAK,CAAC,GAAGN,IAAI;IACrB,IAAIL,OAAO,CAACY,GAAG,CAACD,IAAI,CAAC,EAAE;IACvB,IAAIA,IAAI,EAAEX,OAAO,CAACa,GAAG,CAACF,IAAI,CAAC;IAE3B,IAAIG,MAAM,CAAClB,GAAG,EAAES,IAAI,CAAC,EAAE;MACrBH,IAAI,GAAG,IAAI;MACX;IACF;IAEA,IAAIN,GAAG,CAACG,aAAa,CAACK,MAAM,EAAE;MAC5BF,IAAI,GAAGP,WAAW,CAACC,GAAG,EAAEA,GAAG,CAACG,aAAa,CAAC;MAC1CH,GAAG,CAACG,aAAa,GAAG,EAAE;MACtBH,GAAG,CAACE,KAAK,GAAGD,KAAK;MACjB,IAAIK,IAAI,EAAE;IACZ;EACF;EAGA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGZ,UAAU,EAAEY,CAAC,EAAE,EAAE;IACnCC,oBAAU,CAACT,IAAI,CAACV,KAAK,CAACkB,CAAC,CAAC,CAAC;EAC3B;EAGAnB,GAAG,CAACE,KAAK,GAAG,IAAI;EAEhB,OAAOI,IAAI;AACb;AAEA,SAASY,MAAMA,CAAClB,GAAqB,EAAES,IAAc,EAAE;EAAA,IAAAY,cAAA;EACrD,MAAMN,IAAI,GAAGN,IAAI,CAACM,IAAI;EACtB,IAAI,CAACA,IAAI,EAAE;IACT,OAAO,KAAK;EACd;EACA,MAAMO,IAAI,GAAGtB,GAAG,CAACsB,IAAI;EAGrB,MAAMC,QAAQ,IAAAF,cAAA,GAAGC,IAAI,CAACC,QAAQ,YAAAF,cAAA,GAAIC,IAAI,CAACE,SAAS;EAChD,IAAID,QAAQ,YAARA,QAAQ,CAAEE,QAAQ,CAACV,IAAI,CAACW,IAAI,CAAC,EAAE;IACjC,OAAO,KAAK;EACd;EAEA,IAAIJ,IAAI,CAACK,UAAU,YAAfL,IAAI,CAACK,UAAU,CAAGlB,IAAI,CAAC,EAAE;IAC3B,OAAO,KAAK;EACd;EAOA,IAAIA,IAAI,CAACkB,UAAU,EAAE,OAAOlB,IAAI,CAACmB,UAAU;EAE3C,IAAIC,eAAK,CAAClB,IAAI,CAACF,IAAI,EAAEa,IAAI,CAACQ,KAAK,CAAC,EAAE,OAAOrB,IAAI,CAACmB,UAAU;EACxD,IAAInB,IAAI,CAACM,IAAI,EAAE;IAAA,IAAAgB,eAAA;IACb,IAAIF,eAAK,CAAClB,IAAI,CAACF,IAAI,GAAAsB,eAAA,GAAET,IAAI,CAACP,IAAI,CAACW,IAAI,CAAC,qBAAfK,eAAA,CAAiBD,KAAK,CAAC,EAAE,OAAOrB,IAAI,CAACmB,UAAU;EACtE;EAEAnB,IAAI,CAACmB,UAAU,GAAGI,SAAS,CACzBvB,IAAI,CAACM,IAAI,EACTO,IAAI,EACJb,IAAI,CAACwB,KAAK,EACVjC,GAAG,CAACkC,KAAK,EACTzB,IAAI,EACJA,IAAI,CAAC0B,QACP,CAAC;EAED,IAAI1B,IAAI,CAACM,IAAI,EAAE;IACb,IAAIc,eAAK,CAAClB,IAAI,CAACF,IAAI,EAAEa,IAAI,CAACc,IAAI,CAAC,EAAE,OAAO,IAAI;EAC9C;EACA,IAAI3B,IAAI,CAACM,IAAI,EAAE;IAAA,IAAAsB,gBAAA;IACbR,eAAK,CAAClB,IAAI,CAACF,IAAI,GAAA4B,gBAAA,GAAEf,IAAI,CAACP,IAAI,CAACW,IAAI,CAAC,qBAAfW,gBAAA,CAAiBD,IAAI,CAAC;EACzC;EAEA,OAAO3B,IAAI,CAACmB,UAAU;AACxB;AAEA,SAASI,SAASA,CAChBjB,IAAY,EACZO,IAAgC,EAChCW,KAAa,EACbC,KAAS,EACTzB,IAAe,EACf0B,QAAkC,EAClCG,SAAmB,EACnB;EACA,MAAMC,IAAI,GAAGzC,YAAY,CAACiB,IAAI,CAACW,IAAI,CAAC;EACpC,IAAI,EAACa,IAAI,YAAJA,IAAI,CAAE/B,MAAM,GAAE,OAAO,KAAK;EAE/B,MAAMR,GAAG,GAAG,IAAIwC,gBAAgB,CAACP,KAAK,EAAEX,IAAI,EAAEY,KAAK,EAAEzB,IAAI,CAAC;EAC1D,IAAI6B,SAAS,EAAE;IACb,IAAIH,QAAQ,YAARA,QAAQ,CAAG1B,IAAI,CAACgC,SAAS,CAAC,EAAE,OAAO,KAAK;IAC5C,OAAO1C,WAAW,CAACC,GAAG,EAAE,CAACS,IAAI,CAAC,CAAC;EACjC;EAEA,KAAK,MAAMK,GAAG,IAAIyB,IAAI,EAAE;IACtB,IAAIJ,QAAQ,YAARA,QAAQ,CAAGrB,GAAG,CAAC,EAAE;IAErB,MAAM4B,IAAI,GAAG3B,IAAI,CAACD,GAAG,CAAC;IACtB,IAAI,CAAC4B,IAAI,EAAE;IAEX,IAAIC,KAAK,CAACC,OAAO,CAACF,IAAI,CAAC,EAAE;MACvB,IAAI,CAACA,IAAI,CAAClC,MAAM,EAAE;MAClB,MAAMP,KAAK,GAAG,EAAE;MAChB,KAAK,IAAIkB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuB,IAAI,CAAClC,MAAM,EAAEW,CAAC,EAAE,EAAE;QACpC,MAAM0B,SAAS,GAAGC,cAAQ,CAACC,GAAG,CAAC;UAC7BC,UAAU,EAAEvC,IAAI;UAChBwC,MAAM,EAAElC,IAAI;UACZmC,SAAS,EAAER,IAAI;UACf5B,GAAG,EAAEK,CAAC;UACNgC,OAAO,EAAErC;QACX,CAAC,CAAC;QACFb,KAAK,CAACmD,IAAI,CAACP,SAAS,CAAC;MACvB;MACA,IAAI9C,WAAW,CAACC,GAAG,EAAEC,KAAK,CAAC,EAAE,OAAO,IAAI;IAC1C,CAAC,MAAM;MACL,IACEF,WAAW,CAACC,GAAG,EAAE,CACf8C,cAAQ,CAACC,GAAG,CAAC;QACXC,UAAU,EAAEvC,IAAI;QAChBwC,MAAM,EAAElC,IAAI;QACZmC,SAAS,EAAEnC,IAAI;QACfD,GAAG;QACHqC,OAAO,EAAE;MACX,CAAC,CAAC,CACH,CAAC,EACF;QACA,OAAO,IAAI;MACb;IACF;EACF;EAEA,OAAO,KAAK;AACd;AAcO,SAASE,YAAYA,CAC1BtC,IAAY,EACZO,IAAgC,EAChCW,KAAa,EACbC,KAAS,EACTzB,IAAe,EACf0B,QAAkC,EAClCG,SAAmB,EACV;EAAA;EAKT,MAAMC,IAAI,GAAGzC,YAAY,CAACiB,IAAI,CAACW,IAAI,CAAC;EACpC,IAAI,CAACa,IAAI,EAAE,OAAO,KAAK;EAEvB,MAAMe,OAAO,GAAG,IAAId,gBAAgB,CAAIP,KAAK,EAAEX,IAAI,EAAEY,KAAK,EAAEzB,IAAI,CAAC;EACjE,IAAI6B,SAAS,EAAE;IACb,IAAIH,QAAQ,YAARA,QAAQ,CAAG1B,IAAI,CAACgC,SAAS,CAAC,EAAE,OAAO,KAAK;IAC5C,OAAOa,OAAO,CAACC,UAAU,CAAC,CAAC9C,IAAI,CAAC,CAAC;EACnC;EAEA,KAAK,MAAMK,GAAG,IAAIyB,IAAI,EAAE;IACtB,IAAIJ,QAAQ,YAARA,QAAQ,CAAGrB,GAAG,CAAC,EAAE;IACrB,IAAIwC,OAAO,CAACE,KAAK,CAACzC,IAAI,EAAED,GAAG,CAAC,EAAE;MAC5B,OAAO,IAAI;IACb;EACF;EAEA,OAAO,KAAK;AACd","ignoreList":[]}
+{"version":3,"names":["_context","require","_index","_t","_context2","VISITOR_KEYS","_visitPaths","ctx","paths","queue","priorityQueue","visited","Set","stop","visitIndex","length","path","resync","call","contexts","pushContext","key","node","has","add","_visit","i","popContext","_opts$denylist","opts","denylist","blacklist","includes","type","shouldSkip","shouldStop","_call","enter","_opts$node$type","_traverse","scope","state","skipKeys","exit","_opts$node$type2","visitSelf","keys","TraversalContext","parentKey","prop","Array","isArray","childPath","NodePath","get","parentPath","parent","container","listKey","push","traverseNode","context","visitQueue","visit"],"sources":["../src/traverse-node.ts"],"sourcesContent":["import TraversalContext from \"./context.ts\";\nimport type { ExplodedTraverseOptions } from \"./index.ts\";\nimport NodePath from \"./path/index.ts\";\nimport type Scope from \"./scope/index.ts\";\nimport type * as t from \"@babel/types\";\nimport { VISITOR_KEYS } from \"@babel/types\";\nimport { _call, popContext, pushContext, resync } from \"./path/context.ts\";\n\nfunction _visitPaths(ctx: TraversalContext, paths: NodePath[]): boolean {\n  // set queue\n  ctx.queue = paths;\n  ctx.priorityQueue = [];\n\n  const visited = new Set();\n  let stop = false;\n  let visitIndex = 0;\n\n  for (; visitIndex < paths.length; ) {\n    const path = paths[visitIndex];\n    visitIndex++;\n\n    resync.call(path);\n\n    if (\n      path.contexts.length === 0 ||\n      path.contexts[path.contexts.length - 1] !== ctx\n    ) {\n      // The context might already have been pushed when this path was inserted and queued.\n      // If we always re-pushed here, we could get duplicates and risk leaving contexts\n      // on the stack after the traversal has completed, which could break things.\n      pushContext.call(path, ctx);\n    }\n\n    // this path no longer belongs to the tree\n    if (path.key === null) continue;\n\n    // ensure we don't visit the same node twice\n    const { node } = path;\n    if (visited.has(node)) continue;\n    if (node) visited.add(node);\n\n    if (_visit(ctx, path)) {\n      stop = true;\n      break;\n    }\n\n    if (ctx.priorityQueue.length) {\n      stop = _visitPaths(ctx, ctx.priorityQueue);\n      ctx.priorityQueue = [];\n      ctx.queue = paths;\n      if (stop) break;\n    }\n  }\n\n  // pop contexts\n  for (let i = 0; i < visitIndex; i++) {\n    popContext.call(paths[i]);\n  }\n\n  // clear queue\n  ctx.queue = null;\n\n  return stop;\n}\n\nfunction _visit(ctx: TraversalContext, path: NodePath) {\n  const node = path.node;\n  if (!node) {\n    return false;\n  }\n  const opts = ctx.opts;\n\n  // @ts-expect-error TODO(Babel 8): Remove blacklist\n  const denylist = opts.denylist ?? opts.blacklist;\n  if (denylist?.includes(node.type)) {\n    return false;\n  }\n\n  if (opts.shouldSkip?.(path)) {\n    return false;\n  }\n\n  // Note: We need to check \"this.shouldSkip\" first because\n  // another visitor can set it to true. Usually .shouldSkip is false\n  // before calling the enter visitor, but it can be true in case of\n  // a requeued node (e.g. by .replaceWith()) that is then marked\n  // with .skip().\n  if (path.shouldSkip) return path.shouldStop;\n\n  if (_call.call(path, opts.enter)) return path.shouldStop;\n  if (path.node) {\n    if (_call.call(path, opts[node.type]?.enter)) return path.shouldStop;\n  }\n\n  path.shouldStop = _traverse(\n    path.node,\n    opts,\n    path.scope,\n    ctx.state,\n    path,\n    path.skipKeys,\n  );\n\n  if (path.node) {\n    if (_call.call(path, opts.exit)) return true;\n  }\n  if (path.node) {\n    _call.call(path, opts[node.type]?.exit);\n  }\n\n  return path.shouldStop;\n}\n\nfunction _traverse<S>(\n  node: t.Node,\n  opts: ExplodedTraverseOptions<S>,\n  scope?: Scope | null,\n  state?: S,\n  path?: NodePath,\n  skipKeys?: Record<string, boolean> | null,\n  visitSelf?: boolean,\n) {\n  const keys = VISITOR_KEYS[node.type];\n  if (!keys?.length) return false;\n\n  const ctx = new TraversalContext(scope, opts, state, path);\n  if (visitSelf) {\n    if (skipKeys?.[path!.parentKey]) return false;\n    return _visitPaths(ctx, [path!]);\n  }\n\n  for (const key of keys) {\n    if (skipKeys?.[key]) continue;\n    // @ts-expect-error key must present in node\n    const prop = node[key];\n    if (!prop) continue;\n\n    if (Array.isArray(prop)) {\n      if (!prop.length) continue;\n      const paths = [];\n      for (let i = 0; i < prop.length; i++) {\n        const childPath = NodePath.get({\n          parentPath: path,\n          parent: node,\n          container: prop,\n          key: i,\n          listKey: key,\n        });\n        paths.push(childPath);\n      }\n      if (_visitPaths(ctx, paths)) return true;\n    } else {\n      if (\n        _visitPaths(ctx, [\n          NodePath.get({\n            parentPath: path,\n            parent: node,\n            container: node,\n            key,\n            listKey: null,\n          }),\n        ])\n      ) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\n/**\n * Traverse the children of given node\n * @param {Node} node\n * @param {TraverseOptions} opts The traverse options used to create a new traversal context\n * @param {scope} scope A traversal scope used to create a new traversal context. When opts.noScope is true, scope should not be provided\n * @param {any} state A user data storage provided as the second callback argument for traversal visitors\n * @param {NodePath} path A NodePath of given node\n * @param {Record<string, boolean>} skipKeys A map from key names to whether that should be skipped during traversal. The skipKeys are applied to every descendants\n * @returns {boolean} Whether the traversal stops early\n\n * @note This function does not visit the given `node`.\n */\nexport function traverseNode<S = unknown>(\n  node: t.Node,\n  opts: ExplodedTraverseOptions<S>,\n  scope?: Scope | null,\n  state?: S,\n  path?: NodePath,\n  skipKeys?: Record<string, boolean> | null,\n  visitSelf?: boolean,\n): boolean {\n  if (process.env.BABEL_8_BREAKING) {\n    return _traverse(node, opts, scope, state, path, skipKeys, visitSelf);\n  }\n\n  const keys = VISITOR_KEYS[node.type];\n  if (!keys) return false;\n\n  const context = new TraversalContext<S>(scope, opts, state as S, path);\n  if (visitSelf) {\n    if (skipKeys?.[path!.parentKey]) return false;\n    return context.visitQueue([path!]);\n  }\n\n  for (const key of keys) {\n    if (skipKeys?.[key]) continue;\n    if (context.visit(node, key)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,QAAA,GAAAC,OAAA;AAEA,IAAAC,MAAA,GAAAD,OAAA;AAGA,IAAAE,EAAA,GAAAF,OAAA;AACA,IAAAG,SAAA,GAAAH,OAAA;AAA2E;EADlEI;AAAY,IAAAF,EAAA;AAGrB,SAASG,WAAWA,CAACC,GAAqB,EAAEC,KAAiB,EAAW;EAEtED,GAAG,CAACE,KAAK,GAAGD,KAAK;EACjBD,GAAG,CAACG,aAAa,GAAG,EAAE;EAEtB,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAC,CAAC;EACzB,IAAIC,IAAI,GAAG,KAAK;EAChB,IAAIC,UAAU,GAAG,CAAC;EAElB,OAAOA,UAAU,GAAGN,KAAK,CAACO,MAAM,GAAI;IAClC,MAAMC,IAAI,GAAGR,KAAK,CAACM,UAAU,CAAC;IAC9BA,UAAU,EAAE;IAEZG,gBAAM,CAACC,IAAI,CAACF,IAAI,CAAC;IAEjB,IACEA,IAAI,CAACG,QAAQ,CAACJ,MAAM,KAAK,CAAC,IAC1BC,IAAI,CAACG,QAAQ,CAACH,IAAI,CAACG,QAAQ,CAACJ,MAAM,GAAG,CAAC,CAAC,KAAKR,GAAG,EAC/C;MAIAa,qBAAW,CAACF,IAAI,CAACF,IAAI,EAAET,GAAG,CAAC;IAC7B;IAGA,IAAIS,IAAI,CAACK,GAAG,KAAK,IAAI,EAAE;IAGvB,MAAM;MAAEC;IAAK,CAAC,GAAGN,IAAI;IACrB,IAAIL,OAAO,CAACY,GAAG,CAACD,IAAI,CAAC,EAAE;IACvB,IAAIA,IAAI,EAAEX,OAAO,CAACa,GAAG,CAACF,IAAI,CAAC;IAE3B,IAAIG,MAAM,CAAClB,GAAG,EAAES,IAAI,CAAC,EAAE;MACrBH,IAAI,GAAG,IAAI;MACX;IACF;IAEA,IAAIN,GAAG,CAACG,aAAa,CAACK,MAAM,EAAE;MAC5BF,IAAI,GAAGP,WAAW,CAACC,GAAG,EAAEA,GAAG,CAACG,aAAa,CAAC;MAC1CH,GAAG,CAACG,aAAa,GAAG,EAAE;MACtBH,GAAG,CAACE,KAAK,GAAGD,KAAK;MACjB,IAAIK,IAAI,EAAE;IACZ;EACF;EAGA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGZ,UAAU,EAAEY,CAAC,EAAE,EAAE;IACnCC,oBAAU,CAACT,IAAI,CAACV,KAAK,CAACkB,CAAC,CAAC,CAAC;EAC3B;EAGAnB,GAAG,CAACE,KAAK,GAAG,IAAI;EAEhB,OAAOI,IAAI;AACb;AAEA,SAASY,MAAMA,CAAClB,GAAqB,EAAES,IAAc,EAAE;EAAA,IAAAY,cAAA;EACrD,MAAMN,IAAI,GAAGN,IAAI,CAACM,IAAI;EACtB,IAAI,CAACA,IAAI,EAAE;IACT,OAAO,KAAK;EACd;EACA,MAAMO,IAAI,GAAGtB,GAAG,CAACsB,IAAI;EAGrB,MAAMC,QAAQ,IAAAF,cAAA,GAAGC,IAAI,CAACC,QAAQ,YAAAF,cAAA,GAAIC,IAAI,CAACE,SAAS;EAChD,IAAID,QAAQ,YAARA,QAAQ,CAAEE,QAAQ,CAACV,IAAI,CAACW,IAAI,CAAC,EAAE;IACjC,OAAO,KAAK;EACd;EAEA,IAAIJ,IAAI,CAACK,UAAU,YAAfL,IAAI,CAACK,UAAU,CAAGlB,IAAI,CAAC,EAAE;IAC3B,OAAO,KAAK;EACd;EAOA,IAAIA,IAAI,CAACkB,UAAU,EAAE,OAAOlB,IAAI,CAACmB,UAAU;EAE3C,IAAIC,eAAK,CAAClB,IAAI,CAACF,IAAI,EAAEa,IAAI,CAACQ,KAAK,CAAC,EAAE,OAAOrB,IAAI,CAACmB,UAAU;EACxD,IAAInB,IAAI,CAACM,IAAI,EAAE;IAAA,IAAAgB,eAAA;IACb,IAAIF,eAAK,CAAClB,IAAI,CAACF,IAAI,GAAAsB,eAAA,GAAET,IAAI,CAACP,IAAI,CAACW,IAAI,CAAC,qBAAfK,eAAA,CAAiBD,KAAK,CAAC,EAAE,OAAOrB,IAAI,CAACmB,UAAU;EACtE;EAEAnB,IAAI,CAACmB,UAAU,GAAGI,SAAS,CACzBvB,IAAI,CAACM,IAAI,EACTO,IAAI,EACJb,IAAI,CAACwB,KAAK,EACVjC,GAAG,CAACkC,KAAK,EACTzB,IAAI,EACJA,IAAI,CAAC0B,QACP,CAAC;EAED,IAAI1B,IAAI,CAACM,IAAI,EAAE;IACb,IAAIc,eAAK,CAAClB,IAAI,CAACF,IAAI,EAAEa,IAAI,CAACc,IAAI,CAAC,EAAE,OAAO,IAAI;EAC9C;EACA,IAAI3B,IAAI,CAACM,IAAI,EAAE;IAAA,IAAAsB,gBAAA;IACbR,eAAK,CAAClB,IAAI,CAACF,IAAI,GAAA4B,gBAAA,GAAEf,IAAI,CAACP,IAAI,CAACW,IAAI,CAAC,qBAAfW,gBAAA,CAAiBD,IAAI,CAAC;EACzC;EAEA,OAAO3B,IAAI,CAACmB,UAAU;AACxB;AAEA,SAASI,SAASA,CAChBjB,IAAY,EACZO,IAAgC,EAChCW,KAAoB,EACpBC,KAAS,EACTzB,IAAe,EACf0B,QAAyC,EACzCG,SAAmB,EACnB;EACA,MAAMC,IAAI,GAAGzC,YAAY,CAACiB,IAAI,CAACW,IAAI,CAAC;EACpC,IAAI,EAACa,IAAI,YAAJA,IAAI,CAAE/B,MAAM,GAAE,OAAO,KAAK;EAE/B,MAAMR,GAAG,GAAG,IAAIwC,gBAAgB,CAACP,KAAK,EAAEX,IAAI,EAAEY,KAAK,EAAEzB,IAAI,CAAC;EAC1D,IAAI6B,SAAS,EAAE;IACb,IAAIH,QAAQ,YAARA,QAAQ,CAAG1B,IAAI,CAAEgC,SAAS,CAAC,EAAE,OAAO,KAAK;IAC7C,OAAO1C,WAAW,CAACC,GAAG,EAAE,CAACS,IAAI,CAAE,CAAC;EAClC;EAEA,KAAK,MAAMK,GAAG,IAAIyB,IAAI,EAAE;IACtB,IAAIJ,QAAQ,YAARA,QAAQ,CAAGrB,GAAG,CAAC,EAAE;IAErB,MAAM4B,IAAI,GAAG3B,IAAI,CAACD,GAAG,CAAC;IACtB,IAAI,CAAC4B,IAAI,EAAE;IAEX,IAAIC,KAAK,CAACC,OAAO,CAACF,IAAI,CAAC,EAAE;MACvB,IAAI,CAACA,IAAI,CAAClC,MAAM,EAAE;MAClB,MAAMP,KAAK,GAAG,EAAE;MAChB,KAAK,IAAIkB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuB,IAAI,CAAClC,MAAM,EAAEW,CAAC,EAAE,EAAE;QACpC,MAAM0B,SAAS,GAAGC,cAAQ,CAACC,GAAG,CAAC;UAC7BC,UAAU,EAAEvC,IAAI;UAChBwC,MAAM,EAAElC,IAAI;UACZmC,SAAS,EAAER,IAAI;UACf5B,GAAG,EAAEK,CAAC;UACNgC,OAAO,EAAErC;QACX,CAAC,CAAC;QACFb,KAAK,CAACmD,IAAI,CAACP,SAAS,CAAC;MACvB;MACA,IAAI9C,WAAW,CAACC,GAAG,EAAEC,KAAK,CAAC,EAAE,OAAO,IAAI;IAC1C,CAAC,MAAM;MACL,IACEF,WAAW,CAACC,GAAG,EAAE,CACf8C,cAAQ,CAACC,GAAG,CAAC;QACXC,UAAU,EAAEvC,IAAI;QAChBwC,MAAM,EAAElC,IAAI;QACZmC,SAAS,EAAEnC,IAAI;QACfD,GAAG;QACHqC,OAAO,EAAE;MACX,CAAC,CAAC,CACH,CAAC,EACF;QACA,OAAO,IAAI;MACb;IACF;EACF;EAEA,OAAO,KAAK;AACd;AAcO,SAASE,YAAYA,CAC1BtC,IAAY,EACZO,IAAgC,EAChCW,KAAoB,EACpBC,KAAS,EACTzB,IAAe,EACf0B,QAAyC,EACzCG,SAAmB,EACV;EAKT,MAAMC,IAAI,GAAGzC,YAAY,CAACiB,IAAI,CAACW,IAAI,CAAC;EACpC,IAAI,CAACa,IAAI,EAAE,OAAO,KAAK;EAEvB,MAAMe,OAAO,GAAG,IAAId,gBAAgB,CAAIP,KAAK,EAAEX,IAAI,EAAEY,KAAK,EAAOzB,IAAI,CAAC;EACtE,IAAI6B,SAAS,EAAE;IACb,IAAIH,QAAQ,YAARA,QAAQ,CAAG1B,IAAI,CAAEgC,SAAS,CAAC,EAAE,OAAO,KAAK;IAC7C,OAAOa,OAAO,CAACC,UAAU,CAAC,CAAC9C,IAAI,CAAE,CAAC;EACpC;EAEA,KAAK,MAAMK,GAAG,IAAIyB,IAAI,EAAE;IACtB,IAAIJ,QAAQ,YAARA,QAAQ,CAAGrB,GAAG,CAAC,EAAE;IACrB,IAAIwC,OAAO,CAACE,KAAK,CAACzC,IAAI,EAAED,GAAG,CAAC,EAAE;MAC5B,OAAO,IAAI;IACb;EACF;EAEA,OAAO,KAAK;AACd","ignoreList":[]}

package/node_modules/@babel/traverse/lib/types.js.map

@@ -1 +1 @@
-{"version":3,"names":[],"sources":["../src/types.ts"],"sourcesContent":["import type * as t from \"@babel/types\";\nimport type { NodePath } from \"./index.ts\";\nimport type { VirtualTypeAliases } from \"./path/lib/virtual-types.ts\";\nimport type {\n  ExplVisitorBase,\n  VisitorBaseNodes,\n  VisitorBaseAliases,\n} from \"./generated/visitor-types.d.ts\";\n\nexport type VisitPhase = \"enter\" | \"exit\";\n\ninterface VisitNodeObject<S, P extends t.Node> {\n  enter?: VisitNodeFunction<S, P>;\n  exit?: VisitNodeFunction<S, P>;\n}\n\nexport interface ExplVisitNode<S, P extends t.Node> {\n  enter?: VisitNodeFunction<S, P>[];\n  exit?: VisitNodeFunction<S, P>[];\n}\n\nexport interface ExplodedVisitor<S = unknown>\n  extends ExplVisitorBase<S>,\n    ExplVisitNode<S, t.Node> {\n  _exploded: true;\n  _verified: true;\n}\n\n// TODO: Assert that the keys of this are the keys of VirtualTypeAliases without\n// the keys of VisitorBaseNodes and VisitorBaseAliases\n// prettier-ignore\ninterface VisitorVirtualAliases<S> {\n  BindingIdentifier?: VisitNode<S, VirtualTypeAliases[\"BindingIdentifier\"]>;\n  BlockScoped?: VisitNode<S, VirtualTypeAliases[\"BlockScoped\"]>;\n  ExistentialTypeParam?: VisitNode<S, VirtualTypeAliases[\"ExistentialTypeParam\"]>;\n  Expression?: VisitNode<S, VirtualTypeAliases[\"Expression\"]>;\n  //Flow?: VisitNode<S, VirtualTypeAliases[\"Flow\"]>;\n  ForAwaitStatement?: VisitNode<S, VirtualTypeAliases[\"ForAwaitStatement\"]>;\n  Generated?: VisitNode<S, VirtualTypeAliases[\"Generated\"]>;\n  NumericLiteralTypeAnnotation?: VisitNode<S, VirtualTypeAliases[\"NumericLiteralTypeAnnotation\"]>;\n  Pure?: VisitNode<S, VirtualTypeAliases[\"Pure\"]>;\n  Referenced?: VisitNode<S, VirtualTypeAliases[\"Referenced\"]>;\n  ReferencedIdentifier?: VisitNode<S, VirtualTypeAliases[\"ReferencedIdentifier\"]>;\n  ReferencedMemberExpression?: VisitNode<S, VirtualTypeAliases[\"ReferencedMemberExpression\"]>;\n  //RestProperty?: VisitNode<S, VirtualTypeAliases[\"RestProperty\"]>;\n  Scope?: VisitNode<S, VirtualTypeAliases[\"Scope\"]>;\n  //SpreadProperty?: VisitNode<S, VirtualTypeAliases[\"SpreadProperty\"]>;\n  Statement?: VisitNode<S, VirtualTypeAliases[\"Statement\"]>;\n  User?: VisitNode<S, VirtualTypeAliases[\"User\"]>;\n  Var?: VisitNode<S, VirtualTypeAliases[\"Var\"]>;\n}\n\n// TODO: Do not export this? Or give it a better name?\nexport interface VisitorBase<S>\n  extends VisitNodeObject<S, t.Node>,\n    VisitorBaseNodes<S>,\n    VisitorBaseAliases<S>,\n    VisitorVirtualAliases<S> {\n  // Babel supports `NodeTypesWithoutComment | NodeTypesWithoutComment | ... ` but it is\n  // too complex for TS. So we type it as a general visitor only if the key contains `|`\n  // this is good enough for non-visitor traverse options e.g. `noScope`\n  [k: `${string}|${string}`]: VisitNode<S, t.Node>;\n}\n\nexport type Visitor<S = unknown> = VisitorBase<S> | ExplodedVisitor<S>;\n\nexport type VisitNode<S, P extends t.Node> =\n  | VisitNodeFunction<S, P>\n  | VisitNodeObject<S, P>;\n\nexport type VisitNodeFunction<S, P extends t.Node> = (\n  this: S,\n  path: NodePath<P>,\n  state: S,\n) => void;\n"],"mappings":"","ignoreList":[]}
+{"version":3,"names":[],"sources":["../src/types.ts"],"sourcesContent":["import type * as t from \"@babel/types\";\nimport type { NodePath } from \"./index.ts\";\nimport type { VirtualTypeAliases } from \"./path/lib/virtual-types.ts\";\nimport type {\n  ExplVisitorBase,\n  VisitorBaseNodes,\n  VisitorBaseAliases,\n} from \"./generated/visitor-types.d.ts\";\n\nexport type VisitPhase = \"enter\" | \"exit\";\n\ninterface VisitNodeObject<S, P extends t.Node> {\n  enter?: VisitNodeFunction<S, P>;\n  exit?: VisitNodeFunction<S, P>;\n}\n\nexport interface ExplVisitNode<S, P extends t.Node> {\n  enter?: VisitNodeFunction<S, P>[];\n  exit?: VisitNodeFunction<S, P>[];\n}\n\nexport interface ExplodedVisitor<S = unknown>\n  extends ExplVisitorBase<S>,\n    ExplVisitNode<S, t.Node> {\n  _exploded: true;\n  _verified: true;\n}\n\n// TODO: Assert that the keys of this are the keys of VirtualTypeAliases without\n// the keys of VisitorBaseNodes and VisitorBaseAliases\n// prettier-ignore\ninterface VisitorVirtualAliases<S> {\n  BindingIdentifier?: VisitNode<S, VirtualTypeAliases[\"BindingIdentifier\"]>;\n  BlockScoped?: VisitNode<S, VirtualTypeAliases[\"BlockScoped\"]>;\n  ExistentialTypeParam?: VisitNode<S, VirtualTypeAliases[\"ExistentialTypeParam\"]>;\n  Expression?: VisitNode<S, VirtualTypeAliases[\"Expression\"]>;\n  //Flow?: VisitNode<S, VirtualTypeAliases[\"Flow\"]>;\n  ForAwaitStatement?: VisitNode<S, VirtualTypeAliases[\"ForAwaitStatement\"]>;\n  Generated?: VisitNode<S, VirtualTypeAliases[\"Generated\"]>;\n  NumericLiteralTypeAnnotation?: VisitNode<S, VirtualTypeAliases[\"NumericLiteralTypeAnnotation\"]>;\n  Pure?: VisitNode<S, VirtualTypeAliases[\"Pure\"]>;\n  Referenced?: VisitNode<S, VirtualTypeAliases[\"Referenced\"]>;\n  ReferencedIdentifier?: VisitNode<S, VirtualTypeAliases[\"ReferencedIdentifier\"]>;\n  ReferencedMemberExpression?: VisitNode<S, VirtualTypeAliases[\"ReferencedMemberExpression\"]>;\n  //RestProperty?: VisitNode<S, VirtualTypeAliases[\"RestProperty\"]>;\n  Scope?: VisitNode<S, VirtualTypeAliases[\"Scope\"]>;\n  //SpreadProperty?: VisitNode<S, VirtualTypeAliases[\"SpreadProperty\"]>;\n  Statement?: VisitNode<S, VirtualTypeAliases[\"Statement\"]>;\n  User?: VisitNode<S, VirtualTypeAliases[\"User\"]>;\n  Var?: VisitNode<S, VirtualTypeAliases[\"Var\"]>;\n}\n\n// TODO: Do not export this? Or give it a better name?\nexport interface VisitorBase<S>\n  extends VisitNodeObject<S, t.Node>,\n    VisitorBaseNodes<S>,\n    VisitorBaseAliases<S>,\n    VisitorVirtualAliases<S>,\n    // Babel supports `NodeTypesWithoutComment | NodeTypesWithoutComment | ... ` but it is\n    // too complex for TS. So we type it as a general visitor only if the key contains `|`\n    // this is good enough for non-visitor traverse options e.g. `noScope`\n    Record<`${string}|${string}`, VisitNode<S, t.Node>> {}\n\nexport type Visitor<S = unknown> = VisitorBase<S> | ExplodedVisitor<S>;\n\nexport type VisitNode<S, P extends t.Node> =\n  | VisitNodeFunction<S, P>\n  | VisitNodeObject<S, P>;\n\nexport type VisitNodeFunction<S, P extends t.Node> = (\n  this: S,\n  path: NodePath<P>,\n  state: S,\n) => void;\n"],"mappings":"","ignoreList":[]}

package/node_modules/@babel/traverse/lib/visitors.js

@@ -53,11 +53,9 @@ function explode$1(visitor) {
     const types = virtualTypes[nodeType];
     if (types !== null) {
       for (const type of types) {
-        if (visitor[type]) {
-          mergePair(visitor[type], fns);
-        } else {
-          visitor[type] = fns;
-        }
+        var _visitor$type;
+        (_visitor$type = visitor[type]) != null ? _visitor$type : visitor[type] = {};
+        mergePair(visitor[type], fns);
       }
     } else {
       mergePair(visitor, fns);
@@ -104,7 +102,7 @@ function verify$1(visitor) {
     }
     if (shouldIgnoreKey(nodeType)) continue;
     if (!TYPES.includes(nodeType)) {
-      throw new Error(`You gave us a visitor for the node type ${nodeType} but it's not a valid type in @babel/traverse ${"7.28.0"}`);
+      throw new Error(`You gave us a visitor for the node type ${nodeType} but it's not a valid type in @babel/traverse ${"7.29.0"}`);
     }
     const visitors = visitor[nodeType];
     if (typeof visitors === "object") {
@@ -132,14 +130,12 @@ function merge(visitors, states = [], wrapper) {
     _verified: true,
     _exploded: true
   };
-  {
-    Object.defineProperty(mergedVisitor, "_exploded", {
-      enumerable: false
-    });
-    Object.defineProperty(mergedVisitor, "_verified", {
-      enumerable: false
-    });
-  }
+  Object.defineProperty(mergedVisitor, "_exploded", {
+    enumerable: false
+  });
+  Object.defineProperty(mergedVisitor, "_verified", {
+    enumerable: false
+  });
   for (let i = 0; i < visitors.length; i++) {
     const visitor = explode$1(visitors[i]);
     const state = states[i];
@@ -211,15 +207,13 @@ function wrapCheck(nodeType, fn) {
   return newFn;
 }
 function shouldIgnoreKey(key) {
-  if (key[0] === "_") return true;
+  if (key.startsWith("_")) return true;
   if (key === "enter" || key === "exit" || key === "shouldSkip") return true;
   if (key === "denylist" || key === "noScope" || key === "skipKeys") {
     return true;
   }
-  {
-    if (key === "blacklist") {
-      return true;
-    }
+  if (key === "blacklist") {
+    return true;
   }
   return false;
 }

package/node_modules/@babel/traverse/lib/visitors.js.map

@@ -1 +1 @@
-{"version":3,"names":["virtualTypes","require","virtualTypesValidators","_t","_context","DEPRECATED_KEYS","DEPRECATED_ALIASES","FLIPPED_ALIAS_KEYS","TYPES","__internal__deprecationWarning","deprecationWarning","isVirtualType","type","isExplodedVisitor","visitor","_exploded","explode$1","nodeType","Object","keys","shouldIgnoreKey","parts","split","length","fns","part","verify$1","__esModule","ensureEntranceObjects","ensureCallbackArrays","wrapCheck","types","mergePair","aliases","deprecatedKey","deprecatedAlias","alias","existing","assign","_verified","Error","validateVisitorMethods","includes","visitors","visitorKey","path","val","concat","fn","TypeError","merge","states","wrapper","mergedVisitor","defineProperty","enumerable","i","state","topVisitor","wrapWithStateOrWrapper","key","typeVisitor","nodeVisitor","oldVisitor","newVisitor","phase","Array","isArray","map","newFn","call","toString","obj","enter","exit","fnKey","validator","apply","arguments","dest","src","_environmentVisitor","FunctionParent","isArrowFunctionExpression","skip","isMethod","requeueComputedKeyAndDecorators","Property","isObjectProperty","environmentVisitor"],"sources":["../src/visitors.ts"],"sourcesContent":["import * as virtualTypes from \"./path/lib/virtual-types.ts\";\nimport * as virtualTypesValidators from \"./path/lib/virtual-types-validator.ts\";\nimport type { Node } from \"@babel/types\";\nimport {\n  DEPRECATED_KEYS,\n  DEPRECATED_ALIASES,\n  FLIPPED_ALIAS_KEYS,\n  TYPES,\n  __internal__deprecationWarning as deprecationWarning,\n} from \"@babel/types\";\nimport type { ExplodedVisitor, NodePath, Visitor } from \"./index.ts\";\nimport type { ExplVisitNode, VisitNodeFunction, VisitPhase } from \"./types.ts\";\nimport { requeueComputedKeyAndDecorators } from \"./path/context.ts\";\n\ntype VIRTUAL_TYPES = keyof typeof virtualTypes;\nfunction isVirtualType(type: string): type is VIRTUAL_TYPES {\n  return type in virtualTypes;\n}\nexport type VisitWrapper<S = any> = (\n  stateName: string | undefined,\n  visitorType: VisitPhase,\n  callback: VisitNodeFunction<S, Node>,\n) => VisitNodeFunction<S, Node>;\n\nexport function isExplodedVisitor(\n  visitor: Visitor,\n): visitor is ExplodedVisitor {\n  // @ts-expect-error _exploded is not defined on non-exploded Visitor\n  return visitor?._exploded;\n}\n\n// We need to name this function `explode$1` because otherwise rollup-plugin-dts\n// will generate a `namespace traverse { var explode: typeof explode; }` when\n// bundling @babel/traverse's index.d.ts.\n// TODO: Just call it `explode` once https://github.com/Swatinem/rollup-plugin-dts/issues/307\n// is fixed.\nexport { explode$1 as explode };\n/**\n * explode() will take a visitor object with all of the various shorthands\n * that we support, and validates & normalizes it into a common format, ready\n * to be used in traversal\n *\n * The various shorthands are:\n * * `Identifier() { ... }` -> `Identifier: { enter() { ... } }`\n * * `\"Identifier|NumericLiteral\": { ... }` -> `Identifier: { ... }, NumericLiteral: { ... }`\n * * Aliases in `@babel/types`: e.g. `Property: { ... }` -> `ObjectProperty: { ... }, ClassProperty: { ... }`\n * Other normalizations are:\n * * Visitors of virtual types are wrapped, so that they are only visited when\n *   their dynamic check passes\n * * `enter` and `exit` functions are wrapped in arrays, to ease merging of\n *   visitors\n */\nfunction explode$1<S>(visitor: Visitor<S>): ExplodedVisitor<S> {\n  if (isExplodedVisitor(visitor)) return visitor;\n  // @ts-expect-error `visitor` will be cast to ExplodedVisitor by this function\n  visitor._exploded = true;\n\n  // normalise pipes\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    const parts: Array<string> = nodeType.split(\"|\");\n    if (parts.length === 1) continue;\n\n    const fns = visitor[nodeType];\n    delete visitor[nodeType];\n\n    for (const part of parts) {\n      // @ts-expect-error part will be verified by `verify` later\n      visitor[part] = fns;\n    }\n  }\n\n  // verify data structure\n  verify$1(visitor);\n\n  // make sure there's no __esModule type since this is because we're using loose mode\n  // and it sets __esModule to be enumerable on all modules :(\n  // @ts-expect-error ESModule interop\n  delete visitor.__esModule;\n\n  // ensure visitors are objects\n  ensureEntranceObjects(visitor);\n\n  // ensure enter/exit callbacks are arrays\n  ensureCallbackArrays(visitor);\n\n  // add type wrappers\n  for (const nodeType of Object.keys(visitor)) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    if (!isVirtualType(nodeType)) continue;\n\n    // wrap all the functions\n    const fns = visitor[nodeType];\n    for (const type of Object.keys(fns)) {\n      // @ts-expect-error normalised as VisitNodeObject\n      fns[type] = wrapCheck(nodeType, fns[type]);\n    }\n\n    // clear it from the visitor\n    delete visitor[nodeType];\n\n    const types = virtualTypes[nodeType];\n    if (types !== null) {\n      for (const type of types) {\n        // merge the visitor if necessary or just put it back in\n        if (visitor[type]) {\n          mergePair(visitor[type], fns);\n        } else {\n          // @ts-expect-error Expression produces too complex union\n          visitor[type] = fns;\n        }\n      }\n    } else {\n      mergePair(visitor, fns);\n    }\n  }\n\n  // add aliases\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    let aliases = FLIPPED_ALIAS_KEYS[nodeType];\n\n    if (nodeType in DEPRECATED_KEYS) {\n      const deprecatedKey = DEPRECATED_KEYS[nodeType];\n      deprecationWarning(nodeType, deprecatedKey, \"Visitor \");\n      aliases = [deprecatedKey];\n    } else if (nodeType in DEPRECATED_ALIASES) {\n      const deprecatedAlias =\n        DEPRECATED_ALIASES[nodeType as keyof typeof DEPRECATED_ALIASES];\n      deprecationWarning(nodeType, deprecatedAlias, \"Visitor \");\n      aliases = FLIPPED_ALIAS_KEYS[deprecatedAlias];\n    }\n\n    if (!aliases) continue;\n\n    const fns = visitor[nodeType];\n    // clear it from the visitor\n    delete visitor[nodeType];\n\n    for (const alias of aliases) {\n      const existing = visitor[alias];\n      if (existing) {\n        mergePair(existing, fns);\n      } else {\n        visitor[alias] = { ...fns };\n      }\n    }\n  }\n\n  for (const nodeType of Object.keys(visitor)) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    ensureCallbackArrays(\n      // @ts-expect-error nodeType must present in visitor after previous validations\n      visitor[nodeType],\n    );\n  }\n\n  // @ts-expect-error explosion has been performed\n  return visitor as ExplodedVisitor;\n}\n\n// We need to name this function `verify$1` because otherwise rollup-plugin-dts\n// will generate a `namespace traverse { var verify: typeof verify; }` when\n// bundling @babel/traverse's index.d.ts.\n// TODO: Just call it `verify` once https://github.com/Swatinem/rollup-plugin-dts/issues/307\n// is fixed.\nexport { verify$1 as verify };\nfunction verify$1(visitor: Visitor) {\n  // @ts-expect-error _verified is not defined on non-verified Visitor.\n  // TODO: unify _verified and _exploded.\n  if (visitor._verified) return;\n\n  if (typeof visitor === \"function\") {\n    throw new Error(\n      \"You passed `traverse()` a function when it expected a visitor object, \" +\n        \"are you sure you didn't mean `{ enter: Function }`?\",\n    );\n  }\n\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (nodeType === \"enter\" || nodeType === \"exit\") {\n      validateVisitorMethods(nodeType, visitor[nodeType]);\n    }\n\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    if (!TYPES.includes(nodeType)) {\n      throw new Error(\n        `You gave us a visitor for the node type ${nodeType} but it's not a valid type in @babel/traverse ${PACKAGE_JSON.version}`,\n      );\n    }\n\n    const visitors = visitor[nodeType];\n    if (typeof visitors === \"object\") {\n      for (const visitorKey of Object.keys(visitors)) {\n        if (visitorKey === \"enter\" || visitorKey === \"exit\") {\n          // verify that it just contains functions\n          validateVisitorMethods(\n            `${nodeType}.${visitorKey}`,\n            visitors[visitorKey],\n          );\n        } else {\n          throw new Error(\n            \"You passed `traverse()` a visitor object with the property \" +\n              `${nodeType} that has the invalid property ${visitorKey}`,\n          );\n        }\n      }\n    }\n  }\n\n  // @ts-expect-error _verified is not defined on non-verified Visitor.\n  // TODO: unify _verified and _exploded.\n  visitor._verified = true;\n}\n\nfunction validateVisitorMethods(\n  path: string,\n  val: any,\n): asserts val is Function | Function[] {\n  const fns = [].concat(val);\n  for (const fn of fns) {\n    if (typeof fn !== \"function\") {\n      throw new TypeError(\n        `Non-function found defined in ${path} with type ${typeof fn}`,\n      );\n    }\n  }\n}\n\nexport function merge<State>(\n  visitors: Visitor<State>[],\n): ExplodedVisitor<State>;\nexport function merge(\n  visitors: Visitor<unknown>[],\n  states?: any[],\n  wrapper?: Function | null,\n): ExplodedVisitor<unknown>;\nexport function merge(\n  visitors: any[],\n  states: any[] = [],\n  wrapper?: VisitWrapper | null,\n): ExplodedVisitor {\n  const mergedVisitor: ExplodedVisitor = { _verified: true, _exploded: true };\n  if (!process.env.BABEL_8_BREAKING) {\n    // For compatibility with old Babel versions, we must hide _verified and _exploded.\n    // Otherwise, old versions of the validator will throw sayng that `true` is not\n    // a function, because it tries to validate it as a visitor.\n    Object.defineProperty(mergedVisitor, \"_exploded\", { enumerable: false });\n    Object.defineProperty(mergedVisitor, \"_verified\", { enumerable: false });\n  }\n\n  for (let i = 0; i < visitors.length; i++) {\n    const visitor = explode$1(visitors[i]);\n    const state = states[i];\n\n    let topVisitor: ExplVisitNode<unknown, Node> = visitor;\n    if (state || wrapper) {\n      topVisitor = wrapWithStateOrWrapper(topVisitor, state, wrapper);\n    }\n    mergePair(mergedVisitor, topVisitor);\n\n    for (const key of Object.keys(visitor) as (keyof ExplodedVisitor)[]) {\n      if (shouldIgnoreKey(key)) continue;\n\n      let typeVisitor = visitor[key];\n\n      // if we have state or wrapper then overload the callbacks to take it\n      if (state || wrapper) {\n        typeVisitor = wrapWithStateOrWrapper(typeVisitor, state, wrapper);\n      }\n\n      const nodeVisitor = (mergedVisitor[key] ||= {});\n      mergePair(nodeVisitor, typeVisitor);\n    }\n  }\n\n  return mergedVisitor;\n}\n\nfunction wrapWithStateOrWrapper<State>(\n  oldVisitor: ExplVisitNode<State, Node>,\n  state: State | null,\n  wrapper?: VisitWrapper<State> | null,\n): ExplVisitNode<State, Node> {\n  const newVisitor: ExplVisitNode<State, Node> = {};\n\n  for (const phase of [\"enter\", \"exit\"] as VisitPhase[]) {\n    let fns = oldVisitor[phase];\n\n    // not an enter/exit array of callbacks\n    if (!Array.isArray(fns)) continue;\n\n    fns = fns.map(function (fn) {\n      let newFn = fn;\n\n      if (state) {\n        newFn = function (path: NodePath) {\n          fn.call(state, path, state);\n        };\n      }\n\n      if (wrapper) {\n        // @ts-expect-error Fixme: actually PluginPass.key (aka pluginAlias)?\n        newFn = wrapper(state?.key, phase, newFn);\n      }\n\n      // Override toString in case this function is printed, we want to print the wrapped function, same as we do in `wrapCheck`\n      if (newFn !== fn) {\n        newFn.toString = () => fn.toString();\n      }\n\n      return newFn;\n    });\n\n    newVisitor[phase] = fns;\n  }\n\n  return newVisitor;\n}\n\nfunction ensureEntranceObjects(obj: Visitor) {\n  for (const key of Object.keys(obj) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(key)) continue;\n\n    const fns = obj[key];\n    if (typeof fns === \"function\") {\n      // @ts-expect-error: Expression produces a union type that is too complex to represent.\n      obj[key] = { enter: fns };\n    }\n  }\n}\n\nfunction ensureCallbackArrays(obj: Visitor) {\n  if (obj.enter && !Array.isArray(obj.enter)) obj.enter = [obj.enter];\n  if (obj.exit && !Array.isArray(obj.exit)) obj.exit = [obj.exit];\n}\n\nfunction wrapCheck(nodeType: VIRTUAL_TYPES, fn: Function) {\n  const fnKey = `is${nodeType}`;\n  // @ts-expect-error we know virtualTypesValidators will contain `fnKey`, but TS doesn't\n  const validator = virtualTypesValidators[fnKey];\n  const newFn = function (this: unknown, path: NodePath) {\n    if (validator.call(path)) {\n      return fn.apply(this, arguments);\n    }\n  };\n  newFn.toString = () => fn.toString();\n  return newFn;\n}\n\nfunction shouldIgnoreKey(key: string): key is\n  | `_${string}` // ` // Comment to fix syntax highlighting in vscode\n  | \"enter\"\n  | \"exit\"\n  | \"shouldSkip\"\n  | \"denylist\"\n  | \"noScope\"\n  | \"skipKeys\"\n  | \"blacklist\" {\n  // internal/hidden key\n  if (key[0] === \"_\") return true;\n\n  // ignore function keys\n  if (key === \"enter\" || key === \"exit\" || key === \"shouldSkip\") return true;\n\n  // ignore other options\n  if (key === \"denylist\" || key === \"noScope\" || key === \"skipKeys\") {\n    return true;\n  }\n\n  if (!process.env.BABEL_8_BREAKING) {\n    if (key === \"blacklist\") {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n/*\nfunction mergePair(\n  dest: ExplVisitNode<unknown, Node>,\n  src: ExplVisitNode<unknown, Node>,\n);\n*/\nfunction mergePair(dest: any, src: any) {\n  for (const phase of [\"enter\", \"exit\"] as VisitPhase[]) {\n    if (!src[phase]) continue;\n    dest[phase] = [].concat(dest[phase] || [], src[phase]);\n  }\n}\n\n// environmentVisitor should be used when traversing the whole class and not for specific class elements/methods.\n// For perf reasons, the environmentVisitor might be traversed with `{ noScope: true }`, which means `path.scope` is undefined.\n// Avoid using `path.scope` here\nconst _environmentVisitor: Visitor = {\n  FunctionParent(path) {\n    // arrows are not skipped because they inherit the context.\n    if (path.isArrowFunctionExpression()) return;\n\n    path.skip();\n    if (path.isMethod()) {\n      if (\n        !process.env.BABEL_8_BREAKING &&\n        !path.requeueComputedKeyAndDecorators\n      ) {\n        // See https://github.com/babel/babel/issues/16694\n        requeueComputedKeyAndDecorators.call(path);\n      } else {\n        path.requeueComputedKeyAndDecorators();\n      }\n    }\n  },\n  Property(path) {\n    if (path.isObjectProperty()) return;\n    path.skip();\n    if (\n      !process.env.BABEL_8_BREAKING &&\n      !path.requeueComputedKeyAndDecorators\n    ) {\n      // See https://github.com/babel/babel/issues/16694\n      requeueComputedKeyAndDecorators.call(path);\n    } else {\n      path.requeueComputedKeyAndDecorators();\n    }\n  },\n};\n\nexport function environmentVisitor<S>(visitor: Visitor<S>): Visitor<S> {\n  return merge([_environmentVisitor, visitor]);\n}\n"],"mappings":";;;;;;;;;;AAAA,IAAAA,YAAA,GAAAC,OAAA;AACA,IAAAC,sBAAA,GAAAD,OAAA;AAEA,IAAAE,EAAA,GAAAF,OAAA;AASA,IAAAG,QAAA,GAAAH,OAAA;AAAoE;EARlEI,eAAe;EACfC,kBAAkB;EAClBC,kBAAkB;EAClBC,KAAK;EACLC,8BAA8B,EAAIC;AAAkB,IAAAP,EAAA;AAOtD,SAASQ,aAAaA,CAACC,IAAY,EAAyB;EAC1D,OAAOA,IAAI,IAAIZ,YAAY;AAC7B;AAOO,SAASa,iBAAiBA,CAC/BC,OAAgB,EACY;EAE5B,OAAOA,OAAO,oBAAPA,OAAO,CAAEC,SAAS;AAC3B;AAuBA,SAASC,SAASA,CAAIF,OAAmB,EAAsB;EAC7D,IAAID,iBAAiB,CAACC,OAAO,CAAC,EAAE,OAAOA,OAAO;EAE9CA,OAAO,CAACC,SAAS,GAAG,IAAI;EAGxB,KAAK,MAAME,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,MAAMI,KAAoB,GAAGJ,QAAQ,CAACK,KAAK,CAAC,GAAG,CAAC;IAChD,IAAID,KAAK,CAACE,MAAM,KAAK,CAAC,EAAE;IAExB,MAAMC,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAC;IAC7B,OAAOH,OAAO,CAACG,QAAQ,CAAC;IAExB,KAAK,MAAMQ,IAAI,IAAIJ,KAAK,EAAE;MAExBP,OAAO,CAACW,IAAI,CAAC,GAAGD,GAAG;IACrB;EACF;EAGAE,QAAQ,CAACZ,OAAO,CAAC;EAKjB,OAAOA,OAAO,CAACa,UAAU;EAGzBC,qBAAqB,CAACd,OAAO,CAAC;EAG9Be,oBAAoB,CAACf,OAAO,CAAC;EAG7B,KAAK,MAAMG,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAE;IAC3C,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAI,CAACN,aAAa,CAACM,QAAQ,CAAC,EAAE;IAG9B,MAAMO,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAC;IAC7B,KAAK,MAAML,IAAI,IAAIM,MAAM,CAACC,IAAI,CAACK,GAAG,CAAC,EAAE;MAEnCA,GAAG,CAACZ,IAAI,CAAC,GAAGkB,SAAS,CAACb,QAAQ,EAAEO,GAAG,CAACZ,IAAI,CAAC,CAAC;IAC5C;IAGA,OAAOE,OAAO,CAACG,QAAQ,CAAC;IAExB,MAAMc,KAAK,GAAG/B,YAAY,CAACiB,QAAQ,CAAC;IACpC,IAAIc,KAAK,KAAK,IAAI,EAAE;MAClB,KAAK,MAAMnB,IAAI,IAAImB,KAAK,EAAE;QAExB,IAAIjB,OAAO,CAACF,IAAI,CAAC,EAAE;UACjBoB,SAAS,CAAClB,OAAO,CAACF,IAAI,CAAC,EAAEY,GAAG,CAAC;QAC/B,CAAC,MAAM;UAELV,OAAO,CAACF,IAAI,CAAC,GAAGY,GAAG;QACrB;MACF;IACF,CAAC,MAAM;MACLQ,SAAS,CAAClB,OAAO,EAAEU,GAAG,CAAC;IACzB;EACF;EAGA,KAAK,MAAMP,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAIgB,OAAO,GAAG1B,kBAAkB,CAACU,QAAQ,CAAC;IAE1C,IAAIA,QAAQ,IAAIZ,eAAe,EAAE;MAC/B,MAAM6B,aAAa,GAAG7B,eAAe,CAACY,QAAQ,CAAC;MAC/CP,kBAAkB,CAACO,QAAQ,EAAEiB,aAAa,EAAE,UAAU,CAAC;MACvDD,OAAO,GAAG,CAACC,aAAa,CAAC;IAC3B,CAAC,MAAM,IAAIjB,QAAQ,IAAIX,kBAAkB,EAAE;MACzC,MAAM6B,eAAe,GACnB7B,kBAAkB,CAACW,QAAQ,CAAoC;MACjEP,kBAAkB,CAACO,QAAQ,EAAEkB,eAAe,EAAE,UAAU,CAAC;MACzDF,OAAO,GAAG1B,kBAAkB,CAAC4B,eAAe,CAAC;IAC/C;IAEA,IAAI,CAACF,OAAO,EAAE;IAEd,MAAMT,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAC;IAE7B,OAAOH,OAAO,CAACG,QAAQ,CAAC;IAExB,KAAK,MAAMmB,KAAK,IAAIH,OAAO,EAAE;MAC3B,MAAMI,QAAQ,GAAGvB,OAAO,CAACsB,KAAK,CAAC;MAC/B,IAAIC,QAAQ,EAAE;QACZL,SAAS,CAACK,QAAQ,EAAEb,GAAG,CAAC;MAC1B,CAAC,MAAM;QACLV,OAAO,CAACsB,KAAK,CAAC,GAAAlB,MAAA,CAAAoB,MAAA,KAAQd,GAAG,CAAE;MAC7B;IACF;EACF;EAEA,KAAK,MAAMP,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAE;IAC3C,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/BY,oBAAoB,CAElBf,OAAO,CAACG,QAAQ,CAClB,CAAC;EACH;EAGA,OAAOH,OAAO;AAChB;AAQA,SAASY,QAAQA,CAACZ,OAAgB,EAAE;EAGlC,IAAIA,OAAO,CAACyB,SAAS,EAAE;EAEvB,IAAI,OAAOzB,OAAO,KAAK,UAAU,EAAE;IACjC,MAAM,IAAI0B,KAAK,CACb,wEAAwE,GACtE,qDACJ,CAAC;EACH;EAEA,KAAK,MAAMvB,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIG,QAAQ,KAAK,OAAO,IAAIA,QAAQ,KAAK,MAAM,EAAE;MAC/CwB,sBAAsB,CAACxB,QAAQ,EAAEH,OAAO,CAACG,QAAQ,CAAC,CAAC;IACrD;IAEA,IAAIG,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAI,CAACT,KAAK,CAACkC,QAAQ,CAACzB,QAAQ,CAAC,EAAE;MAC7B,MAAM,IAAIuB,KAAK,CACb,2CAA2CvB,QAAQ,2DACrD,CAAC;IACH;IAEA,MAAM0B,QAAQ,GAAG7B,OAAO,CAACG,QAAQ,CAAC;IAClC,IAAI,OAAO0B,QAAQ,KAAK,QAAQ,EAAE;MAChC,KAAK,MAAMC,UAAU,IAAI1B,MAAM,CAACC,IAAI,CAACwB,QAAQ,CAAC,EAAE;QAC9C,IAAIC,UAAU,KAAK,OAAO,IAAIA,UAAU,KAAK,MAAM,EAAE;UAEnDH,sBAAsB,CACpB,GAAGxB,QAAQ,IAAI2B,UAAU,EAAE,EAC3BD,QAAQ,CAACC,UAAU,CACrB,CAAC;QACH,CAAC,MAAM;UACL,MAAM,IAAIJ,KAAK,CACb,6DAA6D,GAC3D,GAAGvB,QAAQ,kCAAkC2B,UAAU,EAC3D,CAAC;QACH;MACF;IACF;EACF;EAIA9B,OAAO,CAACyB,SAAS,GAAG,IAAI;AAC1B;AAEA,SAASE,sBAAsBA,CAC7BI,IAAY,EACZC,GAAQ,EAC8B;EACtC,MAAMtB,GAAG,GAAG,EAAE,CAACuB,MAAM,CAACD,GAAG,CAAC;EAC1B,KAAK,MAAME,EAAE,IAAIxB,GAAG,EAAE;IACpB,IAAI,OAAOwB,EAAE,KAAK,UAAU,EAAE;MAC5B,MAAM,IAAIC,SAAS,CACjB,iCAAiCJ,IAAI,cAAc,OAAOG,EAAE,EAC9D,CAAC;IACH;EACF;AACF;AAUO,SAASE,KAAKA,CACnBP,QAAe,EACfQ,MAAa,GAAG,EAAE,EAClBC,OAA6B,EACZ;EACjB,MAAMC,aAA8B,GAAG;IAAEd,SAAS,EAAE,IAAI;IAAExB,SAAS,EAAE;EAAK,CAAC;EACxC;IAIjCG,MAAM,CAACoC,cAAc,CAACD,aAAa,EAAE,WAAW,EAAE;MAAEE,UAAU,EAAE;IAAM,CAAC,CAAC;IACxErC,MAAM,CAACoC,cAAc,CAACD,aAAa,EAAE,WAAW,EAAE;MAAEE,UAAU,EAAE;IAAM,CAAC,CAAC;EAC1E;EAEA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGb,QAAQ,CAACpB,MAAM,EAAEiC,CAAC,EAAE,EAAE;IACxC,MAAM1C,OAAO,GAAGE,SAAS,CAAC2B,QAAQ,CAACa,CAAC,CAAC,CAAC;IACtC,MAAMC,KAAK,GAAGN,MAAM,CAACK,CAAC,CAAC;IAEvB,IAAIE,UAAwC,GAAG5C,OAAO;IACtD,IAAI2C,KAAK,IAAIL,OAAO,EAAE;MACpBM,UAAU,GAAGC,sBAAsB,CAACD,UAAU,EAAED,KAAK,EAAEL,OAAO,CAAC;IACjE;IACApB,SAAS,CAACqB,aAAa,EAAEK,UAAU,CAAC;IAEpC,KAAK,MAAME,GAAG,IAAI1C,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAA+B;MACnE,IAAIM,eAAe,CAACwC,GAAG,CAAC,EAAE;MAE1B,IAAIC,WAAW,GAAG/C,OAAO,CAAC8C,GAAG,CAAC;MAG9B,IAAIH,KAAK,IAAIL,OAAO,EAAE;QACpBS,WAAW,GAAGF,sBAAsB,CAACE,WAAW,EAAEJ,KAAK,EAAEL,OAAO,CAAC;MACnE;MAEA,MAAMU,WAAW,GAAIT,aAAa,CAACO,GAAG,CAAC,KAAlBP,aAAa,CAACO,GAAG,CAAC,GAAK,CAAC,CAAC,CAAC;MAC/C5B,SAAS,CAAC8B,WAAW,EAAED,WAAW,CAAC;IACrC;EACF;EAEA,OAAOR,aAAa;AACtB;AAEA,SAASM,sBAAsBA,CAC7BI,UAAsC,EACtCN,KAAmB,EACnBL,OAAoC,EACR;EAC5B,MAAMY,UAAsC,GAAG,CAAC,CAAC;EAEjD,KAAK,MAAMC,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAkB;IACrD,IAAIzC,GAAG,GAAGuC,UAAU,CAACE,KAAK,CAAC;IAG3B,IAAI,CAACC,KAAK,CAACC,OAAO,CAAC3C,GAAG,CAAC,EAAE;IAEzBA,GAAG,GAAGA,GAAG,CAAC4C,GAAG,CAAC,UAAUpB,EAAE,EAAE;MAC1B,IAAIqB,KAAK,GAAGrB,EAAE;MAEd,IAAIS,KAAK,EAAE;QACTY,KAAK,GAAG,SAAAA,CAAUxB,IAAc,EAAE;UAChCG,EAAE,CAACsB,IAAI,CAACb,KAAK,EAAEZ,IAAI,EAAEY,KAAK,CAAC;QAC7B,CAAC;MACH;MAEA,IAAIL,OAAO,EAAE;QAEXiB,KAAK,GAAGjB,OAAO,CAACK,KAAK,oBAALA,KAAK,CAAEG,GAAG,EAAEK,KAAK,EAAEI,KAAK,CAAC;MAC3C;MAGA,IAAIA,KAAK,KAAKrB,EAAE,EAAE;QAChBqB,KAAK,CAACE,QAAQ,GAAG,MAAMvB,EAAE,CAACuB,QAAQ,CAAC,CAAC;MACtC;MAEA,OAAOF,KAAK;IACd,CAAC,CAAC;IAEFL,UAAU,CAACC,KAAK,CAAC,GAAGzC,GAAG;EACzB;EAEA,OAAOwC,UAAU;AACnB;AAEA,SAASpC,qBAAqBA,CAAC4C,GAAY,EAAE;EAC3C,KAAK,MAAMZ,GAAG,IAAI1C,MAAM,CAACC,IAAI,CAACqD,GAAG,CAAC,EAAuB;IACvD,IAAIpD,eAAe,CAACwC,GAAG,CAAC,EAAE;IAE1B,MAAMpC,GAAG,GAAGgD,GAAG,CAACZ,GAAG,CAAC;IACpB,IAAI,OAAOpC,GAAG,KAAK,UAAU,EAAE;MAE7BgD,GAAG,CAACZ,GAAG,CAAC,GAAG;QAAEa,KAAK,EAAEjD;MAAI,CAAC;IAC3B;EACF;AACF;AAEA,SAASK,oBAAoBA,CAAC2C,GAAY,EAAE;EAC1C,IAAIA,GAAG,CAACC,KAAK,IAAI,CAACP,KAAK,CAACC,OAAO,CAACK,GAAG,CAACC,KAAK,CAAC,EAAED,GAAG,CAACC,KAAK,GAAG,CAACD,GAAG,CAACC,KAAK,CAAC;EACnE,IAAID,GAAG,CAACE,IAAI,IAAI,CAACR,KAAK,CAACC,OAAO,CAACK,GAAG,CAACE,IAAI,CAAC,EAAEF,GAAG,CAACE,IAAI,GAAG,CAACF,GAAG,CAACE,IAAI,CAAC;AACjE;AAEA,SAAS5C,SAASA,CAACb,QAAuB,EAAE+B,EAAY,EAAE;EACxD,MAAM2B,KAAK,GAAG,KAAK1D,QAAQ,EAAE;EAE7B,MAAM2D,SAAS,GAAG1E,sBAAsB,CAACyE,KAAK,CAAC;EAC/C,MAAMN,KAAK,GAAG,SAAAA,CAAyBxB,IAAc,EAAE;IACrD,IAAI+B,SAAS,CAACN,IAAI,CAACzB,IAAI,CAAC,EAAE;MACxB,OAAOG,EAAE,CAAC6B,KAAK,CAAC,IAAI,EAAEC,SAAS,CAAC;IAClC;EACF,CAAC;EACDT,KAAK,CAACE,QAAQ,GAAG,MAAMvB,EAAE,CAACuB,QAAQ,CAAC,CAAC;EACpC,OAAOF,KAAK;AACd;AAEA,SAASjD,eAAeA,CAACwC,GAAW,EAQpB;EAEd,IAAIA,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,OAAO,IAAI;EAG/B,IAAIA,GAAG,KAAK,OAAO,IAAIA,GAAG,KAAK,MAAM,IAAIA,GAAG,KAAK,YAAY,EAAE,OAAO,IAAI;EAG1E,IAAIA,GAAG,KAAK,UAAU,IAAIA,GAAG,KAAK,SAAS,IAAIA,GAAG,KAAK,UAAU,EAAE;IACjE,OAAO,IAAI;EACb;EAEmC;IACjC,IAAIA,GAAG,KAAK,WAAW,EAAE;MACvB,OAAO,IAAI;IACb;EACF;EAEA,OAAO,KAAK;AACd;AAQA,SAAS5B,SAASA,CAAC+C,IAAS,EAAEC,GAAQ,EAAE;EACtC,KAAK,MAAMf,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAkB;IACrD,IAAI,CAACe,GAAG,CAACf,KAAK,CAAC,EAAE;IACjBc,IAAI,CAACd,KAAK,CAAC,GAAG,EAAE,CAAClB,MAAM,CAACgC,IAAI,CAACd,KAAK,CAAC,IAAI,EAAE,EAAEe,GAAG,CAACf,KAAK,CAAC,CAAC;EACxD;AACF;AAKA,MAAMgB,mBAA4B,GAAG;EACnCC,cAAcA,CAACrC,IAAI,EAAE;IAEnB,IAAIA,IAAI,CAACsC,yBAAyB,CAAC,CAAC,EAAE;IAEtCtC,IAAI,CAACuC,IAAI,CAAC,CAAC;IACX,IAAIvC,IAAI,CAACwC,QAAQ,CAAC,CAAC,EAAE;MACnB,IAEE,CAACxC,IAAI,CAACyC,+BAA+B,EACrC;QAEAA,wCAA+B,CAAChB,IAAI,CAACzB,IAAI,CAAC;MAC5C,CAAC,MAAM;QACLA,IAAI,CAACyC,+BAA+B,CAAC,CAAC;MACxC;IACF;EACF,CAAC;EACDC,QAAQA,CAAC1C,IAAI,EAAE;IACb,IAAIA,IAAI,CAAC2C,gBAAgB,CAAC,CAAC,EAAE;IAC7B3C,IAAI,CAACuC,IAAI,CAAC,CAAC;IACX,IAEE,CAACvC,IAAI,CAACyC,+BAA+B,EACrC;MAEAA,wCAA+B,CAAChB,IAAI,CAACzB,IAAI,CAAC;IAC5C,CAAC,MAAM;MACLA,IAAI,CAACyC,+BAA+B,CAAC,CAAC;IACxC;EACF;AACF,CAAC;AAEM,SAASG,kBAAkBA,CAAI3E,OAAmB,EAAc;EACrE,OAAOoC,KAAK,CAAC,CAAC+B,mBAAmB,EAAEnE,OAAO,CAAC,CAAC;AAC9C","ignoreList":[]}
+{"version":3,"names":["virtualTypes","require","virtualTypesValidators","_t","_context","DEPRECATED_KEYS","DEPRECATED_ALIASES","FLIPPED_ALIAS_KEYS","TYPES","__internal__deprecationWarning","deprecationWarning","isVirtualType","type","isExplodedVisitor","visitor","_exploded","explode$1","nodeType","Object","keys","shouldIgnoreKey","parts","split","length","fns","part","verify$1","__esModule","ensureEntranceObjects","ensureCallbackArrays","wrapCheck","types","_visitor$type","mergePair","aliases","deprecatedKey","deprecatedAlias","alias","existing","assign","_verified","Error","validateVisitorMethods","includes","visitors","visitorKey","path","val","concat","fn","TypeError","merge","states","wrapper","mergedVisitor","defineProperty","enumerable","i","state","topVisitor","wrapWithStateOrWrapper","key","typeVisitor","nodeVisitor","oldVisitor","newVisitor","phase","Array","isArray","map","newFn","call","toString","obj","enter","exit","fnKey","validator","apply","arguments","startsWith","dest","src","_environmentVisitor","FunctionParent","isArrowFunctionExpression","skip","isMethod","requeueComputedKeyAndDecorators","Property","isObjectProperty","environmentVisitor"],"sources":["../src/visitors.ts"],"sourcesContent":["import * as virtualTypes from \"./path/lib/virtual-types.ts\";\nimport * as virtualTypesValidators from \"./path/lib/virtual-types-validator.ts\";\nimport type { Node } from \"@babel/types\";\nimport {\n  DEPRECATED_KEYS,\n  DEPRECATED_ALIASES,\n  FLIPPED_ALIAS_KEYS,\n  TYPES,\n  __internal__deprecationWarning as deprecationWarning,\n} from \"@babel/types\";\nimport type { ExplodedVisitor, NodePath, Visitor } from \"./index.ts\";\nimport type { ExplVisitNode, VisitNodeFunction, VisitPhase } from \"./types.ts\";\nimport { requeueComputedKeyAndDecorators } from \"./path/context.ts\";\n\ntype VIRTUAL_TYPES = keyof typeof virtualTypes;\nfunction isVirtualType(type: string): type is VIRTUAL_TYPES {\n  return type in virtualTypes;\n}\nexport type VisitWrapper<S = any> = (\n  stateName: string | undefined,\n  visitorType: VisitPhase,\n  callback: VisitNodeFunction<S, Node>,\n) => VisitNodeFunction<S, Node>;\n\nexport function isExplodedVisitor(\n  visitor: Visitor,\n): visitor is ExplodedVisitor {\n  // @ts-expect-error _exploded is not defined on non-exploded Visitor\n  return visitor?._exploded;\n}\n\n// We need to name this function `explode$1` because otherwise rollup-plugin-dts\n// will generate a `namespace traverse { var explode: typeof explode; }` when\n// bundling @babel/traverse's index.d.ts.\n// TODO: Just call it `explode` once https://github.com/Swatinem/rollup-plugin-dts/issues/307\n// is fixed.\nexport { explode$1 as explode };\n/**\n * explode() will take a visitor object with all of the various shorthands\n * that we support, and validates & normalizes it into a common format, ready\n * to be used in traversal\n *\n * The various shorthands are:\n * * `Identifier() { ... }` -> `Identifier: { enter() { ... } }`\n * * `\"Identifier|NumericLiteral\": { ... }` -> `Identifier: { ... }, NumericLiteral: { ... }`\n * * Aliases in `@babel/types`: e.g. `Property: { ... }` -> `ObjectProperty: { ... }, ClassProperty: { ... }`\n * Other normalizations are:\n * * Visitors of virtual types are wrapped, so that they are only visited when\n *   their dynamic check passes\n * * `enter` and `exit` functions are wrapped in arrays, to ease merging of\n *   visitors\n */\nfunction explode$1<S>(visitor: Visitor<S>): ExplodedVisitor<S> {\n  if (isExplodedVisitor(visitor)) return visitor;\n  // @ts-expect-error `visitor` will be cast to ExplodedVisitor by this function\n  visitor._exploded = true;\n\n  // normalise pipes\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    const parts: string[] = nodeType.split(\"|\");\n    if (parts.length === 1) continue;\n\n    const fns = visitor[nodeType];\n    delete visitor[nodeType];\n\n    for (const part of parts) {\n      // @ts-expect-error part will be verified by `verify` later\n      visitor[part] = fns;\n    }\n  }\n\n  // verify data structure\n  verify$1(visitor);\n\n  // make sure there's no __esModule type since this is because we're using loose mode\n  // and it sets __esModule to be enumerable on all modules :(\n  // @ts-expect-error ESModule interop\n  delete visitor.__esModule;\n\n  // ensure visitors are objects\n  ensureEntranceObjects(visitor);\n\n  // ensure enter/exit callbacks are arrays\n  ensureCallbackArrays(visitor);\n\n  // add type wrappers\n  for (const nodeType of Object.keys(visitor)) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    if (!isVirtualType(nodeType)) continue;\n\n    // wrap all the functions\n    const fns = visitor[nodeType]!;\n    for (const type of Object.keys(fns)) {\n      // @ts-expect-error normalised as VisitNodeObject\n      fns[type] = wrapCheck(nodeType, fns[type]);\n    }\n\n    // clear it from the visitor\n    delete visitor[nodeType];\n\n    const types = virtualTypes[nodeType];\n    if (types !== null) {\n      for (const type of types) {\n        // @ts-expect-error Expression produces too complex union\n        visitor[type] ??= {};\n        mergePair(visitor[type], fns);\n      }\n    } else {\n      mergePair(visitor, fns);\n    }\n  }\n\n  // add aliases\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    let aliases = FLIPPED_ALIAS_KEYS[nodeType];\n\n    if (nodeType in DEPRECATED_KEYS) {\n      const deprecatedKey = DEPRECATED_KEYS[nodeType];\n      deprecationWarning(nodeType, deprecatedKey, \"Visitor \");\n      aliases = [deprecatedKey];\n    } else if (nodeType in DEPRECATED_ALIASES) {\n      const deprecatedAlias =\n        DEPRECATED_ALIASES[nodeType as keyof typeof DEPRECATED_ALIASES];\n      deprecationWarning(nodeType, deprecatedAlias, \"Visitor \");\n      aliases = FLIPPED_ALIAS_KEYS[deprecatedAlias];\n    }\n\n    if (!aliases) continue;\n\n    const fns = visitor[nodeType];\n    // clear it from the visitor\n    delete visitor[nodeType];\n\n    for (const alias of aliases) {\n      const existing = visitor[alias];\n      if (existing) {\n        mergePair(existing, fns);\n      } else {\n        visitor[alias] = { ...fns };\n      }\n    }\n  }\n\n  for (const nodeType of Object.keys(visitor)) {\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    ensureCallbackArrays(\n      // @ts-expect-error nodeType must present in visitor after previous validations\n      visitor[nodeType],\n    );\n  }\n\n  // @ts-expect-error explosion has been performed\n  return visitor as ExplodedVisitor;\n}\n\n// We need to name this function `verify$1` because otherwise rollup-plugin-dts\n// will generate a `namespace traverse { var verify: typeof verify; }` when\n// bundling @babel/traverse's index.d.ts.\n// TODO: Just call it `verify` once https://github.com/Swatinem/rollup-plugin-dts/issues/307\n// is fixed.\nexport { verify$1 as verify };\nfunction verify$1(visitor: Visitor) {\n  // @ts-expect-error _verified is not defined on non-verified Visitor.\n  // TODO: unify _verified and _exploded.\n  if (visitor._verified) return;\n\n  if (typeof visitor === \"function\") {\n    throw new Error(\n      \"You passed `traverse()` a function when it expected a visitor object, \" +\n        \"are you sure you didn't mean `{ enter: Function }`?\",\n    );\n  }\n\n  for (const nodeType of Object.keys(visitor) as (keyof Visitor)[]) {\n    if (nodeType === \"enter\" || nodeType === \"exit\") {\n      validateVisitorMethods(nodeType, visitor[nodeType]);\n    }\n\n    if (shouldIgnoreKey(nodeType)) continue;\n\n    if (!TYPES.includes(nodeType)) {\n      throw new Error(\n        `You gave us a visitor for the node type ${nodeType} but it's not a valid type in @babel/traverse ${PACKAGE_JSON.version}`,\n      );\n    }\n\n    const visitors = visitor[nodeType];\n    if (typeof visitors === \"object\") {\n      for (const visitorKey of Object.keys(visitors)) {\n        if (visitorKey === \"enter\" || visitorKey === \"exit\") {\n          // verify that it just contains functions\n          validateVisitorMethods(\n            `${nodeType}.${visitorKey}`,\n            visitors[visitorKey],\n          );\n        } else {\n          throw new Error(\n            \"You passed `traverse()` a visitor object with the property \" +\n              `${nodeType} that has the invalid property ${visitorKey}`,\n          );\n        }\n      }\n    }\n  }\n\n  // @ts-expect-error _verified is not defined on non-verified Visitor.\n  // TODO: unify _verified and _exploded.\n  visitor._verified = true;\n}\n\nfunction validateVisitorMethods(\n  path: string,\n  val: any,\n): asserts val is Function | Function[] {\n  const fns = [].concat(val);\n  for (const fn of fns) {\n    if (typeof fn !== \"function\") {\n      throw new TypeError(\n        `Non-function found defined in ${path} with type ${typeof fn}`,\n      );\n    }\n  }\n}\n\nexport function merge<State>(\n  visitors: Visitor<State>[],\n): ExplodedVisitor<State>;\nexport function merge(\n  visitors: Visitor<unknown>[],\n  states?: any[],\n  wrapper?: Function | null,\n): ExplodedVisitor<unknown>;\nexport function merge(\n  visitors: any[],\n  states: any[] = [],\n  wrapper?: VisitWrapper | null,\n): ExplodedVisitor {\n  const mergedVisitor: ExplodedVisitor = { _verified: true, _exploded: true };\n  if (!process.env.BABEL_8_BREAKING) {\n    // For compatibility with old Babel versions, we must hide _verified and _exploded.\n    // Otherwise, old versions of the validator will throw sayng that `true` is not\n    // a function, because it tries to validate it as a visitor.\n    Object.defineProperty(mergedVisitor, \"_exploded\", { enumerable: false });\n    Object.defineProperty(mergedVisitor, \"_verified\", { enumerable: false });\n  }\n\n  for (let i = 0; i < visitors.length; i++) {\n    const visitor = explode$1(visitors[i]);\n    const state = states[i];\n\n    let topVisitor: ExplVisitNode<unknown, Node> = visitor;\n    if (state || wrapper) {\n      topVisitor = wrapWithStateOrWrapper(topVisitor, state, wrapper);\n    }\n    mergePair(mergedVisitor, topVisitor);\n\n    for (const key of Object.keys(visitor) as (keyof ExplodedVisitor)[]) {\n      if (shouldIgnoreKey(key)) continue;\n\n      let typeVisitor = visitor[key]!;\n\n      // if we have state or wrapper then overload the callbacks to take it\n      if (state || wrapper) {\n        typeVisitor = wrapWithStateOrWrapper(typeVisitor, state, wrapper);\n      }\n\n      const nodeVisitor = (mergedVisitor[key] ||= {});\n      mergePair(nodeVisitor, typeVisitor);\n    }\n  }\n\n  return mergedVisitor;\n}\n\nfunction wrapWithStateOrWrapper<State>(\n  oldVisitor: ExplVisitNode<State, Node>,\n  state: State | null,\n  wrapper?: VisitWrapper<State> | null,\n): ExplVisitNode<State, Node> {\n  const newVisitor: ExplVisitNode<State, Node> = {};\n\n  for (const phase of [\"enter\", \"exit\"] as VisitPhase[]) {\n    let fns = oldVisitor[phase];\n\n    // not an enter/exit array of callbacks\n    if (!Array.isArray(fns)) continue;\n\n    fns = fns.map(function (fn) {\n      let newFn = fn;\n\n      if (state) {\n        newFn = function (path: NodePath<Node>) {\n          fn.call(state, path, state);\n        };\n      }\n\n      if (wrapper) {\n        // @ts-expect-error Fixme: actually PluginPass.key (aka pluginAlias)?\n        newFn = wrapper(state?.key, phase, newFn);\n      }\n\n      // Override toString in case this function is printed, we want to print the wrapped function, same as we do in `wrapCheck`\n      if (newFn !== fn) {\n        newFn.toString = () => fn.toString();\n      }\n\n      return newFn;\n    });\n\n    newVisitor[phase] = fns;\n  }\n\n  return newVisitor;\n}\n\nfunction ensureEntranceObjects(obj: Visitor) {\n  for (const key of Object.keys(obj) as (keyof Visitor)[]) {\n    if (shouldIgnoreKey(key)) continue;\n\n    const fns = obj[key];\n    if (typeof fns === \"function\") {\n      // @ts-expect-error: Expression produces a union type that is too complex to represent.\n      obj[key] = { enter: fns };\n    }\n  }\n}\n\nfunction ensureCallbackArrays(obj: Visitor) {\n  if (obj.enter && !Array.isArray(obj.enter)) obj.enter = [obj.enter];\n  if (obj.exit && !Array.isArray(obj.exit)) obj.exit = [obj.exit];\n}\n\nfunction wrapCheck(nodeType: VIRTUAL_TYPES, fn: Function) {\n  const fnKey = `is${nodeType}`;\n  // @ts-expect-error we know virtualTypesValidators will contain `fnKey`, but TS doesn't\n  const validator = virtualTypesValidators[fnKey];\n  const newFn = function (this: unknown, path: NodePath) {\n    if (validator.call(path)) {\n      return fn.apply(this, arguments);\n    }\n  };\n  newFn.toString = () => fn.toString();\n  return newFn;\n}\n\nfunction shouldIgnoreKey(key: string): key is\n  | `_${string}` // ` // Comment to fix syntax highlighting in vscode\n  | \"enter\"\n  | \"exit\"\n  | \"shouldSkip\"\n  | \"denylist\"\n  | \"noScope\"\n  | \"skipKeys\"\n  | \"blacklist\" {\n  // internal/hidden key\n  if (key.startsWith(\"_\")) return true;\n\n  // ignore function keys\n  if (key === \"enter\" || key === \"exit\" || key === \"shouldSkip\") return true;\n\n  // ignore other options\n  if (key === \"denylist\" || key === \"noScope\" || key === \"skipKeys\") {\n    return true;\n  }\n\n  if (!process.env.BABEL_8_BREAKING) {\n    if (key === \"blacklist\") {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n/*\nfunction mergePair(\n  dest: ExplVisitNode<unknown, Node>,\n  src: ExplVisitNode<unknown, Node>,\n);\n*/\nfunction mergePair(dest: any, src: any) {\n  for (const phase of [\"enter\", \"exit\"] as VisitPhase[]) {\n    if (!src[phase]) continue;\n    dest[phase] = [].concat(dest[phase] || [], src[phase]);\n  }\n}\n\n// environmentVisitor should be used when traversing the whole class and not for specific class elements/methods.\n// For perf reasons, the environmentVisitor might be traversed with `{ noScope: true }`, which means `path.scope` is undefined.\n// Avoid using `path.scope` here\nconst _environmentVisitor: Visitor = {\n  FunctionParent(path) {\n    // arrows are not skipped because they inherit the context.\n    if (path.isArrowFunctionExpression()) return;\n\n    path.skip();\n    if (path.isMethod()) {\n      if (\n        !process.env.BABEL_8_BREAKING &&\n        !path.requeueComputedKeyAndDecorators\n      ) {\n        // See https://github.com/babel/babel/issues/16694\n        requeueComputedKeyAndDecorators.call(path);\n      } else {\n        path.requeueComputedKeyAndDecorators();\n      }\n    }\n  },\n  Property(path) {\n    if (path.isObjectProperty()) return;\n    path.skip();\n    if (\n      !process.env.BABEL_8_BREAKING &&\n      !path.requeueComputedKeyAndDecorators\n    ) {\n      // See https://github.com/babel/babel/issues/16694\n      requeueComputedKeyAndDecorators.call(path);\n    } else {\n      path.requeueComputedKeyAndDecorators();\n    }\n  },\n};\n\nexport function environmentVisitor<S>(visitor: Visitor<S>): Visitor<S> {\n  return merge([_environmentVisitor, visitor]);\n}\n"],"mappings":";;;;;;;;;;AAAA,IAAAA,YAAA,GAAAC,OAAA;AACA,IAAAC,sBAAA,GAAAD,OAAA;AAEA,IAAAE,EAAA,GAAAF,OAAA;AASA,IAAAG,QAAA,GAAAH,OAAA;AAAoE;EARlEI,eAAe;EACfC,kBAAkB;EAClBC,kBAAkB;EAClBC,KAAK;EACLC,8BAA8B,EAAIC;AAAkB,IAAAP,EAAA;AAOtD,SAASQ,aAAaA,CAACC,IAAY,EAAyB;EAC1D,OAAOA,IAAI,IAAIZ,YAAY;AAC7B;AAOO,SAASa,iBAAiBA,CAC/BC,OAAgB,EACY;EAE5B,OAAOA,OAAO,oBAAPA,OAAO,CAAEC,SAAS;AAC3B;AAuBA,SAASC,SAASA,CAAIF,OAAmB,EAAsB;EAC7D,IAAID,iBAAiB,CAACC,OAAO,CAAC,EAAE,OAAOA,OAAO;EAE9CA,OAAO,CAACC,SAAS,GAAG,IAAI;EAGxB,KAAK,MAAME,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,MAAMI,KAAe,GAAGJ,QAAQ,CAACK,KAAK,CAAC,GAAG,CAAC;IAC3C,IAAID,KAAK,CAACE,MAAM,KAAK,CAAC,EAAE;IAExB,MAAMC,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAC;IAC7B,OAAOH,OAAO,CAACG,QAAQ,CAAC;IAExB,KAAK,MAAMQ,IAAI,IAAIJ,KAAK,EAAE;MAExBP,OAAO,CAACW,IAAI,CAAC,GAAGD,GAAG;IACrB;EACF;EAGAE,QAAQ,CAACZ,OAAO,CAAC;EAKjB,OAAOA,OAAO,CAACa,UAAU;EAGzBC,qBAAqB,CAACd,OAAO,CAAC;EAG9Be,oBAAoB,CAACf,OAAO,CAAC;EAG7B,KAAK,MAAMG,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAE;IAC3C,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAI,CAACN,aAAa,CAACM,QAAQ,CAAC,EAAE;IAG9B,MAAMO,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAE;IAC9B,KAAK,MAAML,IAAI,IAAIM,MAAM,CAACC,IAAI,CAACK,GAAG,CAAC,EAAE;MAEnCA,GAAG,CAACZ,IAAI,CAAC,GAAGkB,SAAS,CAACb,QAAQ,EAAEO,GAAG,CAACZ,IAAI,CAAC,CAAC;IAC5C;IAGA,OAAOE,OAAO,CAACG,QAAQ,CAAC;IAExB,MAAMc,KAAK,GAAG/B,YAAY,CAACiB,QAAQ,CAAC;IACpC,IAAIc,KAAK,KAAK,IAAI,EAAE;MAClB,KAAK,MAAMnB,IAAI,IAAImB,KAAK,EAAE;QAAA,IAAAC,aAAA;QAExB,CAAAA,aAAA,GAAAlB,OAAO,CAACF,IAAI,CAAC,YAAAoB,aAAA,GAAblB,OAAO,CAACF,IAAI,CAAC,GAAK,CAAC,CAAC;QACpBqB,SAAS,CAACnB,OAAO,CAACF,IAAI,CAAC,EAAEY,GAAG,CAAC;MAC/B;IACF,CAAC,MAAM;MACLS,SAAS,CAACnB,OAAO,EAAEU,GAAG,CAAC;IACzB;EACF;EAGA,KAAK,MAAMP,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAIiB,OAAO,GAAG3B,kBAAkB,CAACU,QAAQ,CAAC;IAE1C,IAAIA,QAAQ,IAAIZ,eAAe,EAAE;MAC/B,MAAM8B,aAAa,GAAG9B,eAAe,CAACY,QAAQ,CAAC;MAC/CP,kBAAkB,CAACO,QAAQ,EAAEkB,aAAa,EAAE,UAAU,CAAC;MACvDD,OAAO,GAAG,CAACC,aAAa,CAAC;IAC3B,CAAC,MAAM,IAAIlB,QAAQ,IAAIX,kBAAkB,EAAE;MACzC,MAAM8B,eAAe,GACnB9B,kBAAkB,CAACW,QAAQ,CAAoC;MACjEP,kBAAkB,CAACO,QAAQ,EAAEmB,eAAe,EAAE,UAAU,CAAC;MACzDF,OAAO,GAAG3B,kBAAkB,CAAC6B,eAAe,CAAC;IAC/C;IAEA,IAAI,CAACF,OAAO,EAAE;IAEd,MAAMV,GAAG,GAAGV,OAAO,CAACG,QAAQ,CAAC;IAE7B,OAAOH,OAAO,CAACG,QAAQ,CAAC;IAExB,KAAK,MAAMoB,KAAK,IAAIH,OAAO,EAAE;MAC3B,MAAMI,QAAQ,GAAGxB,OAAO,CAACuB,KAAK,CAAC;MAC/B,IAAIC,QAAQ,EAAE;QACZL,SAAS,CAACK,QAAQ,EAAEd,GAAG,CAAC;MAC1B,CAAC,MAAM;QACLV,OAAO,CAACuB,KAAK,CAAC,GAAAnB,MAAA,CAAAqB,MAAA,KAAQf,GAAG,CAAE;MAC7B;IACF;EACF;EAEA,KAAK,MAAMP,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAE;IAC3C,IAAIM,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/BY,oBAAoB,CAElBf,OAAO,CAACG,QAAQ,CAClB,CAAC;EACH;EAGA,OAAOH,OAAO;AAChB;AAQA,SAASY,QAAQA,CAACZ,OAAgB,EAAE;EAGlC,IAAIA,OAAO,CAAC0B,SAAS,EAAE;EAEvB,IAAI,OAAO1B,OAAO,KAAK,UAAU,EAAE;IACjC,MAAM,IAAI2B,KAAK,CACb,wEAAwE,GACtE,qDACJ,CAAC;EACH;EAEA,KAAK,MAAMxB,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAAuB;IAChE,IAAIG,QAAQ,KAAK,OAAO,IAAIA,QAAQ,KAAK,MAAM,EAAE;MAC/CyB,sBAAsB,CAACzB,QAAQ,EAAEH,OAAO,CAACG,QAAQ,CAAC,CAAC;IACrD;IAEA,IAAIG,eAAe,CAACH,QAAQ,CAAC,EAAE;IAE/B,IAAI,CAACT,KAAK,CAACmC,QAAQ,CAAC1B,QAAQ,CAAC,EAAE;MAC7B,MAAM,IAAIwB,KAAK,CACb,2CAA2CxB,QAAQ,2DACrD,CAAC;IACH;IAEA,MAAM2B,QAAQ,GAAG9B,OAAO,CAACG,QAAQ,CAAC;IAClC,IAAI,OAAO2B,QAAQ,KAAK,QAAQ,EAAE;MAChC,KAAK,MAAMC,UAAU,IAAI3B,MAAM,CAACC,IAAI,CAACyB,QAAQ,CAAC,EAAE;QAC9C,IAAIC,UAAU,KAAK,OAAO,IAAIA,UAAU,KAAK,MAAM,EAAE;UAEnDH,sBAAsB,CACpB,GAAGzB,QAAQ,IAAI4B,UAAU,EAAE,EAC3BD,QAAQ,CAACC,UAAU,CACrB,CAAC;QACH,CAAC,MAAM;UACL,MAAM,IAAIJ,KAAK,CACb,6DAA6D,GAC3D,GAAGxB,QAAQ,kCAAkC4B,UAAU,EAC3D,CAAC;QACH;MACF;IACF;EACF;EAIA/B,OAAO,CAAC0B,SAAS,GAAG,IAAI;AAC1B;AAEA,SAASE,sBAAsBA,CAC7BI,IAAY,EACZC,GAAQ,EAC8B;EACtC,MAAMvB,GAAG,GAAG,EAAE,CAACwB,MAAM,CAACD,GAAG,CAAC;EAC1B,KAAK,MAAME,EAAE,IAAIzB,GAAG,EAAE;IACpB,IAAI,OAAOyB,EAAE,KAAK,UAAU,EAAE;MAC5B,MAAM,IAAIC,SAAS,CACjB,iCAAiCJ,IAAI,cAAc,OAAOG,EAAE,EAC9D,CAAC;IACH;EACF;AACF;AAUO,SAASE,KAAKA,CACnBP,QAAe,EACfQ,MAAa,GAAG,EAAE,EAClBC,OAA6B,EACZ;EACjB,MAAMC,aAA8B,GAAG;IAAEd,SAAS,EAAE,IAAI;IAAEzB,SAAS,EAAE;EAAK,CAAC;EAKzEG,MAAM,CAACqC,cAAc,CAACD,aAAa,EAAE,WAAW,EAAE;IAAEE,UAAU,EAAE;EAAM,CAAC,CAAC;EACxEtC,MAAM,CAACqC,cAAc,CAACD,aAAa,EAAE,WAAW,EAAE;IAAEE,UAAU,EAAE;EAAM,CAAC,CAAC;EAG1E,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGb,QAAQ,CAACrB,MAAM,EAAEkC,CAAC,EAAE,EAAE;IACxC,MAAM3C,OAAO,GAAGE,SAAS,CAAC4B,QAAQ,CAACa,CAAC,CAAC,CAAC;IACtC,MAAMC,KAAK,GAAGN,MAAM,CAACK,CAAC,CAAC;IAEvB,IAAIE,UAAwC,GAAG7C,OAAO;IACtD,IAAI4C,KAAK,IAAIL,OAAO,EAAE;MACpBM,UAAU,GAAGC,sBAAsB,CAACD,UAAU,EAAED,KAAK,EAAEL,OAAO,CAAC;IACjE;IACApB,SAAS,CAACqB,aAAa,EAAEK,UAAU,CAAC;IAEpC,KAAK,MAAME,GAAG,IAAI3C,MAAM,CAACC,IAAI,CAACL,OAAO,CAAC,EAA+B;MACnE,IAAIM,eAAe,CAACyC,GAAG,CAAC,EAAE;MAE1B,IAAIC,WAAW,GAAGhD,OAAO,CAAC+C,GAAG,CAAE;MAG/B,IAAIH,KAAK,IAAIL,OAAO,EAAE;QACpBS,WAAW,GAAGF,sBAAsB,CAACE,WAAW,EAAEJ,KAAK,EAAEL,OAAO,CAAC;MACnE;MAEA,MAAMU,WAAW,GAAIT,aAAa,CAACO,GAAG,CAAC,KAAlBP,aAAa,CAACO,GAAG,CAAC,GAAK,CAAC,CAAC,CAAC;MAC/C5B,SAAS,CAAC8B,WAAW,EAAED,WAAW,CAAC;IACrC;EACF;EAEA,OAAOR,aAAa;AACtB;AAEA,SAASM,sBAAsBA,CAC7BI,UAAsC,EACtCN,KAAmB,EACnBL,OAAoC,EACR;EAC5B,MAAMY,UAAsC,GAAG,CAAC,CAAC;EAEjD,KAAK,MAAMC,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAkB;IACrD,IAAI1C,GAAG,GAAGwC,UAAU,CAACE,KAAK,CAAC;IAG3B,IAAI,CAACC,KAAK,CAACC,OAAO,CAAC5C,GAAG,CAAC,EAAE;IAEzBA,GAAG,GAAGA,GAAG,CAAC6C,GAAG,CAAC,UAAUpB,EAAE,EAAE;MAC1B,IAAIqB,KAAK,GAAGrB,EAAE;MAEd,IAAIS,KAAK,EAAE;QACTY,KAAK,GAAG,SAAAA,CAAUxB,IAAoB,EAAE;UACtCG,EAAE,CAACsB,IAAI,CAACb,KAAK,EAAEZ,IAAI,EAAEY,KAAK,CAAC;QAC7B,CAAC;MACH;MAEA,IAAIL,OAAO,EAAE;QAEXiB,KAAK,GAAGjB,OAAO,CAACK,KAAK,oBAALA,KAAK,CAAEG,GAAG,EAAEK,KAAK,EAAEI,KAAK,CAAC;MAC3C;MAGA,IAAIA,KAAK,KAAKrB,EAAE,EAAE;QAChBqB,KAAK,CAACE,QAAQ,GAAG,MAAMvB,EAAE,CAACuB,QAAQ,CAAC,CAAC;MACtC;MAEA,OAAOF,KAAK;IACd,CAAC,CAAC;IAEFL,UAAU,CAACC,KAAK,CAAC,GAAG1C,GAAG;EACzB;EAEA,OAAOyC,UAAU;AACnB;AAEA,SAASrC,qBAAqBA,CAAC6C,GAAY,EAAE;EAC3C,KAAK,MAAMZ,GAAG,IAAI3C,MAAM,CAACC,IAAI,CAACsD,GAAG,CAAC,EAAuB;IACvD,IAAIrD,eAAe,CAACyC,GAAG,CAAC,EAAE;IAE1B,MAAMrC,GAAG,GAAGiD,GAAG,CAACZ,GAAG,CAAC;IACpB,IAAI,OAAOrC,GAAG,KAAK,UAAU,EAAE;MAE7BiD,GAAG,CAACZ,GAAG,CAAC,GAAG;QAAEa,KAAK,EAAElD;MAAI,CAAC;IAC3B;EACF;AACF;AAEA,SAASK,oBAAoBA,CAAC4C,GAAY,EAAE;EAC1C,IAAIA,GAAG,CAACC,KAAK,IAAI,CAACP,KAAK,CAACC,OAAO,CAACK,GAAG,CAACC,KAAK,CAAC,EAAED,GAAG,CAACC,KAAK,GAAG,CAACD,GAAG,CAACC,KAAK,CAAC;EACnE,IAAID,GAAG,CAACE,IAAI,IAAI,CAACR,KAAK,CAACC,OAAO,CAACK,GAAG,CAACE,IAAI,CAAC,EAAEF,GAAG,CAACE,IAAI,GAAG,CAACF,GAAG,CAACE,IAAI,CAAC;AACjE;AAEA,SAAS7C,SAASA,CAACb,QAAuB,EAAEgC,EAAY,EAAE;EACxD,MAAM2B,KAAK,GAAG,KAAK3D,QAAQ,EAAE;EAE7B,MAAM4D,SAAS,GAAG3E,sBAAsB,CAAC0E,KAAK,CAAC;EAC/C,MAAMN,KAAK,GAAG,SAAAA,CAAyBxB,IAAc,EAAE;IACrD,IAAI+B,SAAS,CAACN,IAAI,CAACzB,IAAI,CAAC,EAAE;MACxB,OAAOG,EAAE,CAAC6B,KAAK,CAAC,IAAI,EAAEC,SAAS,CAAC;IAClC;EACF,CAAC;EACDT,KAAK,CAACE,QAAQ,GAAG,MAAMvB,EAAE,CAACuB,QAAQ,CAAC,CAAC;EACpC,OAAOF,KAAK;AACd;AAEA,SAASlD,eAAeA,CAACyC,GAAW,EAQpB;EAEd,IAAIA,GAAG,CAACmB,UAAU,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI;EAGpC,IAAInB,GAAG,KAAK,OAAO,IAAIA,GAAG,KAAK,MAAM,IAAIA,GAAG,KAAK,YAAY,EAAE,OAAO,IAAI;EAG1E,IAAIA,GAAG,KAAK,UAAU,IAAIA,GAAG,KAAK,SAAS,IAAIA,GAAG,KAAK,UAAU,EAAE;IACjE,OAAO,IAAI;EACb;EAGE,IAAIA,GAAG,KAAK,WAAW,EAAE;IACvB,OAAO,IAAI;EACb;EAGF,OAAO,KAAK;AACd;AAQA,SAAS5B,SAASA,CAACgD,IAAS,EAAEC,GAAQ,EAAE;EACtC,KAAK,MAAMhB,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAkB;IACrD,IAAI,CAACgB,GAAG,CAAChB,KAAK,CAAC,EAAE;IACjBe,IAAI,CAACf,KAAK,CAAC,GAAG,EAAE,CAAClB,MAAM,CAACiC,IAAI,CAACf,KAAK,CAAC,IAAI,EAAE,EAAEgB,GAAG,CAAChB,KAAK,CAAC,CAAC;EACxD;AACF;AAKA,MAAMiB,mBAA4B,GAAG;EACnCC,cAAcA,CAACtC,IAAI,EAAE;IAEnB,IAAIA,IAAI,CAACuC,yBAAyB,CAAC,CAAC,EAAE;IAEtCvC,IAAI,CAACwC,IAAI,CAAC,CAAC;IACX,IAAIxC,IAAI,CAACyC,QAAQ,CAAC,CAAC,EAAE;MACnB,IAEE,CAACzC,IAAI,CAAC0C,+BAA+B,EACrC;QAEAA,wCAA+B,CAACjB,IAAI,CAACzB,IAAI,CAAC;MAC5C,CAAC,MAAM;QACLA,IAAI,CAAC0C,+BAA+B,CAAC,CAAC;MACxC;IACF;EACF,CAAC;EACDC,QAAQA,CAAC3C,IAAI,EAAE;IACb,IAAIA,IAAI,CAAC4C,gBAAgB,CAAC,CAAC,EAAE;IAC7B5C,IAAI,CAACwC,IAAI,CAAC,CAAC;IACX,IAEE,CAACxC,IAAI,CAAC0C,+BAA+B,EACrC;MAEAA,wCAA+B,CAACjB,IAAI,CAACzB,IAAI,CAAC;IAC5C,CAAC,MAAM;MACLA,IAAI,CAAC0C,+BAA+B,CAAC,CAAC;IACxC;EACF;AACF,CAAC;AAEM,SAASG,kBAAkBA,CAAI7E,OAAmB,EAAc;EACrE,OAAOqC,KAAK,CAAC,CAACgC,mBAAmB,EAAErE,OAAO,CAAC,CAAC;AAC9C","ignoreList":[]}

package/node_modules/@babel/traverse/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@babel/traverse",
-  "version": "7.28.0",
+  "version": "7.29.0",
   "description": "The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-traverse",
@@ -16,16 +16,16 @@
   },
   "main": "./lib/index.js",
   "dependencies": {
-    "@babel/code-frame": "^7.27.1",
-    "@babel/generator": "^7.28.0",
+    "@babel/code-frame": "^7.29.0",
+    "@babel/generator": "^7.29.0",
     "@babel/helper-globals": "^7.28.0",
-    "@babel/parser": "^7.28.0",
-    "@babel/template": "^7.27.2",
-    "@babel/types": "^7.28.0",
+    "@babel/parser": "^7.29.0",
+    "@babel/template": "^7.28.6",
+    "@babel/types": "^7.29.0",
     "debug": "^4.3.1"
   },
   "devDependencies": {
-    "@babel/core": "^7.28.0",
+    "@babel/core": "^7.29.0",
     "@babel/helper-plugin-test-runner": "^7.27.1"
   },
   "engines": {

package/node_modules/@babel/traverse/tsconfig.overrides.json

@@ -0,0 +1,6 @@
+{
+  "compilerOptions": {
+    "strictNullChecks": true,
+    "strictPropertyInitialization": true
+  }
+}