@babel/traverse 8.0.0-alpha.0 → 8.0.0-alpha.2

package/lib/cache.js

@@ -1,14 +1,28 @@
-export let path = new WeakMap();
+let pathsCache = new WeakMap();
+export { pathsCache as path };
 export let scope = new WeakMap();
 export function clear() {
   clearPath();
   clearScope();
 }
 export function clearPath() {
-  path = new WeakMap();
+  pathsCache = new WeakMap();
 }
 export function clearScope() {
   scope = new WeakMap();
 }
+const nullHub = Object.freeze({});
+export function getCachedPaths(hub, parent) {
+  ;
+  return pathsCache.get(hub ?? nullHub)?.get(parent);
+}
+export function getOrCreateCachedPaths(hub, parent) {
+  ;
+  let parents = pathsCache.get(hub ?? nullHub);
+  if (!parents) pathsCache.set(hub ?? nullHub, parents = new WeakMap());
+  let paths = parents.get(parent);
+  if (!paths) parents.set(parent, paths = new Map());
+  return paths;
+}
 
 //# sourceMappingURL=cache.js.map

package/lib/cache.js.map

@@ -1 +1 @@
-{"version":3,"names":["path","WeakMap","scope","clear","clearPath","clearScope"],"sources":["../src/cache.ts"],"sourcesContent":["import type { Node } from \"@babel/types\";\nimport type NodePath from \"./path\";\nimport type Scope from \"./scope\";\n\nexport let path: WeakMap<Node, Map<Node, NodePath>> = new WeakMap();\nexport let scope: WeakMap<Node, Scope> = new WeakMap();\n\nexport function clear() {\n  clearPath();\n  clearScope();\n}\n\nexport function clearPath() {\n  path = new WeakMap();\n}\n\nexport function clearScope() {\n  scope = new WeakMap();\n}\n"],"mappings":"AAIA,OAAO,IAAIA,IAAwC,GAAG,IAAIC,OAAO,CAAC,CAAC;AACnE,OAAO,IAAIC,KAA2B,GAAG,IAAID,OAAO,CAAC,CAAC;AAEtD,OAAO,SAASE,KAAKA,CAAA,EAAG;EACtBC,SAAS,CAAC,CAAC;EACXC,UAAU,CAAC,CAAC;AACd;AAEA,OAAO,SAASD,SAASA,CAAA,EAAG;EAC1BJ,IAAI,GAAG,IAAIC,OAAO,CAAC,CAAC;AACtB;AAEA,OAAO,SAASI,UAAUA,CAAA,EAAG;EAC3BH,KAAK,GAAG,IAAID,OAAO,CAAC,CAAC;AACvB"}
+{"version":3,"names":["pathsCache","WeakMap","path","scope","clear","clearPath","clearScope","nullHub","Object","freeze","getCachedPaths","hub","parent","get","getOrCreateCachedPaths","parents","set","paths","Map"],"sources":["../src/cache.ts"],"sourcesContent":["import type { Node } from \"@babel/types\";\nimport type NodePath from \"./path\";\nimport type Scope from \"./scope\";\nimport type { HubInterface } from \"./hub\";\n\nlet pathsCache: WeakMap<\n  HubInterface | typeof nullHub,\n  WeakMap<Node, Map<Node, NodePath>>\n> = new WeakMap();\nexport { pathsCache as path };\nexport let scope: WeakMap<Node, Scope> = new WeakMap();\n\nexport function clear() {\n  clearPath();\n  clearScope();\n}\n\nexport function clearPath() {\n  pathsCache = new WeakMap();\n}\n\nexport function clearScope() {\n  scope = new WeakMap();\n}\n\n// NodePath#hub can be null, but it's not a valid weakmap key because it\n// cannot be collected by GC. Use an object, knowing tht it will not be\n// collected anyway. It's not a memory leak because pathsCache.get(nullHub)\n// is itself a weakmap, so its entries can still be collected.\nconst nullHub = Object.freeze({} as const);\n\nexport function getCachedPaths(hub: HubInterface | null, parent: Node) {\n  if (!process.env.BABEL_8_BREAKING) {\n    // Only use Hub as part of the cache key in Babel 8, because it is a\n    // breaking change (it causes incompatibilities with older `@babel/core`\n    // versions: see https://github.com/babel/babel/pull/15759)\n    hub = null;\n  }\n  return pathsCache.get(hub ?? nullHub)?.get(parent);\n}\n\nexport function getOrCreateCachedPaths(hub: HubInterface | null, parent: Node) {\n  if (!process.env.BABEL_8_BREAKING) {\n    hub = null;\n  }\n\n  let parents = pathsCache.get(hub ?? nullHub);\n  if (!parents) pathsCache.set(hub ?? nullHub, (parents = new WeakMap()));\n\n  let paths = parents.get(parent);\n  if (!paths) parents.set(parent, (paths = new Map()));\n\n  return paths;\n}\n"],"mappings":"AAKA,IAAIA,UAGH,GAAG,IAAIC,OAAO,CAAC,CAAC;AACjB,SAASD,UAAU,IAAIE,IAAI;AAC3B,OAAO,IAAIC,KAA2B,GAAG,IAAIF,OAAO,CAAC,CAAC;AAEtD,OAAO,SAASG,KAAKA,CAAA,EAAG;EACtBC,SAAS,CAAC,CAAC;EACXC,UAAU,CAAC,CAAC;AACd;AAEA,OAAO,SAASD,SAASA,CAAA,EAAG;EAC1BL,UAAU,GAAG,IAAIC,OAAO,CAAC,CAAC;AAC5B;AAEA,OAAO,SAASK,UAAUA,CAAA,EAAG;EAC3BH,KAAK,GAAG,IAAIF,OAAO,CAAC,CAAC;AACvB;AAMA,MAAMM,OAAO,GAAGC,MAAM,CAACC,MAAM,CAAC,CAAC,CAAU,CAAC;AAE1C,OAAO,SAASC,cAAcA,CAACC,GAAwB,EAAEC,MAAY,EAAE;EAAA;EAOrE,OAAOZ,UAAU,CAACa,GAAG,CAACF,GAAG,IAAIJ,OAAO,CAAC,EAAEM,GAAG,CAACD,MAAM,CAAC;AACpD;AAEA,OAAO,SAASE,sBAAsBA,CAACH,GAAwB,EAAEC,MAAY,EAAE;EAAA;EAK7E,IAAIG,OAAO,GAAGf,UAAU,CAACa,GAAG,CAACF,GAAG,IAAIJ,OAAO,CAAC;EAC5C,IAAI,CAACQ,OAAO,EAAEf,UAAU,CAACgB,GAAG,CAACL,GAAG,IAAIJ,OAAO,EAAGQ,OAAO,GAAG,IAAId,OAAO,CAAC,CAAE,CAAC;EAEvE,IAAIgB,KAAK,GAAGF,OAAO,CAACF,GAAG,CAACD,MAAM,CAAC;EAC/B,IAAI,CAACK,KAAK,EAAEF,OAAO,CAACC,GAAG,CAACJ,MAAM,EAAGK,KAAK,GAAG,IAAIC,GAAG,CAAC,CAAE,CAAC;EAEpD,OAAOD,KAAK;AACd"}

package/lib/index.js

@@ -263,26 +263,39 @@ var visitors = /*#__PURE__*/Object.freeze({
   merge: merge
 });
 
-let path = new WeakMap();
+let pathsCache = new WeakMap();
 let scope = new WeakMap();
 function clear() {
   clearPath();
   clearScope();
 }
 function clearPath() {
-  path = new WeakMap();
+  pathsCache = new WeakMap();
 }
 function clearScope() {
   scope = new WeakMap();
 }
+const nullHub = Object.freeze({});
+function getCachedPaths(hub, parent) {
+  return pathsCache.get(hub ?? nullHub)?.get(parent);
+}
+function getOrCreateCachedPaths(hub, parent) {
+  let parents = pathsCache.get(hub ?? nullHub);
+  if (!parents) pathsCache.set(hub ?? nullHub, parents = new WeakMap());
+  let paths = parents.get(parent);
+  if (!paths) parents.set(parent, paths = new Map());
+  return paths;
+}
 
 var cache = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  get path () { return path; },
+  get path () { return pathsCache; },
   get scope () { return scope; },
   clear: clear,
   clearPath: clearPath,
-  clearScope: clearScope
+  clearScope: clearScope,
+  getCachedPaths: getCachedPaths,
+  getOrCreateCachedPaths: getOrCreateCachedPaths
 });
 
 const renameVisitor = {
@@ -1992,7 +2005,7 @@ function replaceWithMultiple(nodes) {
   nodes = this._verifyNodeList(nodes);
   inheritLeadingComments(nodes[0], this.node);
   inheritTrailingComments(nodes[nodes.length - 1], this.node);
-  path.get(this.parent)?.delete(this.node);
+  getCachedPaths(this.hub, this.parent)?.delete(this.node);
   this.node = this.container[this.key] = null;
   const paths = this.insertAfter(nodes);
   if (this.node) {
@@ -2079,7 +2092,7 @@ function _replaceWith(node) {
     validate$1(this.parent, this.key, node);
   }
   this.debug(`Replace with ${node?.type}`);
-  path.get(this.parent)?.set(node, this).delete(this.node);
+  getCachedPaths(this.hub, this.parent)?.set(node, this).delete(this.node);
   this.node = this.container[this.key] = node;
 }
 function replaceExpressionWithStatements(nodes) {
@@ -3611,7 +3624,9 @@ function _remove() {
 }
 function _markRemoved() {
   this._traverseFlags |= SHOULD_SKIP | REMOVED;
-  if (this.parent) path.get(this.parent).delete(this.node);
+  if (this.parent) {
+    getCachedPaths(this.hub, this.parent).delete(this.node);
+  }
   this.node = null;
 }
 function _assertUnremoved() {
@@ -3932,7 +3947,7 @@ function insertAfter(nodes_) {
 }
 function updateSiblingKeys(fromIndex, incrementBy) {
   if (!this.parent) return;
-  const paths = path.get(this.parent);
+  const paths = getCachedPaths(this.hub, this.parent) || [];
   for (const [, path] of paths) {
     if (typeof path.key === "number" && path.key >= fromIndex) {
       path.key += incrementBy;
@@ -4521,12 +4536,6 @@ function isForAwaitStatement() {
     await: true
   });
 }
-function isExistentialTypeParam() {
-  throw new Error("`path.isExistentialTypeParam` has been renamed to `path.isExistsTypeAnnotation()` in Babel 7.");
-}
-function isNumericLiteralTypeAnnotation() {
-  throw new Error("`path.isNumericLiteralTypeAnnotation()` has been renamed to `path.isNumberLiteralTypeAnnotation()` in Babel 7.");
-}
 
 var NodePath_virtual_types_validator = /*#__PURE__*/Object.freeze({
   __proto__: null,
@@ -4545,9 +4554,7 @@ var NodePath_virtual_types_validator = /*#__PURE__*/Object.freeze({
   isFlow: isFlow,
   isRestProperty: isRestProperty,
   isSpreadProperty: isSpreadProperty,
-  isForAwaitStatement: isForAwaitStatement,
-  isExistentialTypeParam: isExistentialTypeParam,
-  isNumericLiteralTypeAnnotation: isNumericLiteralTypeAnnotation
+  isForAwaitStatement: isForAwaitStatement
 });
 
 const {
@@ -4591,18 +4598,14 @@ class NodePath {
       throw new Error("To get a node path the parent needs to exist");
     }
     const targetNode = container[key];
-    let paths = path.get(parent);
-    if (!paths) {
-      paths = new Map();
-      path.set(parent, paths);
-    }
-    let path$1 = paths.get(targetNode);
-    if (!path$1) {
-      path$1 = new NodePath(hub, parent);
-      if (targetNode) paths.set(targetNode, path$1);
+    const paths = getOrCreateCachedPaths(hub, parent);
+    let path = paths.get(targetNode);
+    if (!path) {
+      path = new NodePath(hub, parent);
+      if (targetNode) paths.set(targetNode, path);
     }
-    path$1.setup(parentPath, container, listKey, key);
-    return path$1;
+    path.setup(parentPath, container, listKey, key);
+    return path;
   }
   getScope(scope) {
     return this.isScope() ? new Scope(this) : scope;
@@ -4820,12 +4823,16 @@ class TraversalContext {
 const {
   VISITOR_KEYS: VISITOR_KEYS$1
 } = _t;
-function traverseNode(node, opts, scope, state, path, skipKeys) {
+function traverseNode(node, opts, scope, state, path, skipKeys, visitSelf) {
   const keys = VISITOR_KEYS$1[node.type];
   if (!keys) return false;
   const context = new TraversalContext(scope, opts, state, path);
+  if (visitSelf) {
+    if (skipKeys?.[path.parentKey]) return false;
+    return context.visitQueue([path]);
+  }
   for (const key of keys) {
-    if (skipKeys && skipKeys[key]) continue;
+    if (skipKeys?.[key]) continue;
     if (context.visit(node, key)) {
       return true;
     }
@@ -4849,18 +4856,21 @@ const {
   removeProperties,
   traverseFast
 } = _t;
-function traverse(parent, opts = {}, scope, state, parentPath) {
+function traverse(parent, opts = {}, scope, state, parentPath, visitSelf) {
   if (!parent) return;
   if (!opts.noScope && !scope) {
     if (parent.type !== "Program" && parent.type !== "File") {
       throw new Error("You must pass a scope and parentPath unless traversing a Program/File. " + `Instead of that you tried to traverse a ${parent.type} node without ` + "passing scope and parentPath.");
     }
   }
+  if (!parentPath && visitSelf) {
+    throw new Error("visitSelf can only be used when providing a NodePath.");
+  }
   if (!VISITOR_KEYS[parent.type]) {
     return;
   }
   explode(opts);
-  traverseNode(parent, opts, scope, state, parentPath);
+  traverseNode(parent, opts, scope, state, parentPath, null, visitSelf);
 }
 traverse.visitors = visitors;
 traverse.verify = verify;
@@ -4874,7 +4884,6 @@ traverse.node = function (node, opts, scope, state, path, skipKeys) {
 };
 traverse.clearNode = function (node, opts) {
   removeProperties(node, opts);
-  path.delete(node);
 };
 traverse.removeProperties = function (tree, opts) {
   traverseFast(tree, traverse.clearNode, opts);