initial commit

4 files changed, 381 insertions, 0 deletions

diff --git a/node_modules/@babel/generator/lib/node/index.js b/node_modules/@babel/generator/lib/node/index.js
new file mode 100644
index 0000000..58cb15c
--- /dev/null
+++ b/node_modules/@babel/generator/lib/node/index.js
@@ -0,0 +1,81 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.TokenContext = void 0;
+exports.isLastChild = isLastChild;
+exports.parentNeedsParens = parentNeedsParens;
+var parens = require("./parentheses.js");
+var _t = require("@babel/types");
+var _nodes = require("../nodes.js");
+const {
+  VISITOR_KEYS
+} = _t;
+const TokenContext = exports.TokenContext = {
+  normal: 0,
+  expressionStatement: 1,
+  arrowBody: 2,
+  exportDefault: 4,
+  arrowFlowReturnType: 8,
+  forInitHead: 16,
+  forInHead: 32,
+  forOfHead: 64,
+  forInOrInitHeadAccumulate: 128,
+  forInOrInitHeadAccumulatePassThroughMask: 128
+};
+for (const type of Object.keys(parens)) {
+  const func = parens[type];
+  if (_nodes.generatorInfosMap.has(type)) {
+    _nodes.generatorInfosMap.get(type)[2] = func;
+  }
+}
+function isOrHasCallExpression(node) {
+  switch (node.type) {
+    case "CallExpression":
+      return true;
+    case "MemberExpression":
+      return isOrHasCallExpression(node.object);
+  }
+  return false;
+}
+function parentNeedsParens(node, parent, parentId) {
+  switch (parentId) {
+    case 112:
+      if (parent.callee === node) {
+        if (isOrHasCallExpression(node)) return true;
+      }
+      break;
+    case 42:
+      return !isDecoratorMemberExpression(node) && !(node.type === "CallExpression" && isDecoratorMemberExpression(node.callee)) && node.type !== "ParenthesizedExpression";
+  }
+  return false;
+}
+function isDecoratorMemberExpression(node) {
+  switch (node.type) {
+    case "Identifier":
+      return true;
+    case "MemberExpression":
+      return !node.computed && node.property.type === "Identifier" && isDecoratorMemberExpression(node.object);
+    default:
+      return false;
+  }
+}
+function isLastChild(parent, child) {
+  const visitorKeys = VISITOR_KEYS[parent.type];
+  for (let i = visitorKeys.length - 1; i >= 0; i--) {
+    const val = parent[visitorKeys[i]];
+    if (val === child) {
+      return true;
+    } else if (Array.isArray(val)) {
+      let j = val.length - 1;
+      while (j >= 0 && val[j] === null) j--;
+      return j >= 0 && val[j] === child;
+    } else if (val) {
+      return false;
+    }
+  }
+  return false;
+}
+
+//# sourceMappingURL=index.js.map
diff --git a/node_modules/@babel/generator/lib/node/index.js.map b/node_modules/@babel/generator/lib/node/index.js.map
new file mode 100644
index 0000000..bae168f
--- /dev/null
+++ b/node_modules/@babel/generator/lib/node/index.js.map
@@ -0,0 +1 @@
+{"version":3,"names":["parens","require","_t","_nodes","VISITOR_KEYS","TokenContext","exports","normal","expressionStatement","arrowBody","exportDefault","arrowFlowReturnType","forInitHead","forInHead","forOfHead","forInOrInitHeadAccumulate","forInOrInitHeadAccumulatePassThroughMask","type","Object","keys","func","generatorInfosMap","has","get","isOrHasCallExpression","node","object","parentNeedsParens","parent","parentId","callee","isDecoratorMemberExpression","computed","property","isLastChild","child","visitorKeys","i","length","val","Array","isArray","j"],"sources":["../../src/node/index.ts"],"sourcesContent":["import * as parens from \"./parentheses.ts\";\nimport { VISITOR_KEYS } from \"@babel/types\";\nimport type * as t from \"@babel/types\";\n\nimport { generatorInfosMap } from \"../nodes.ts\";\n\nexport const enum TokenContext {\n  normal = 0,\n  expressionStatement = 1 << 0,\n  arrowBody = 1 << 1,\n  exportDefault = 1 << 2,\n  arrowFlowReturnType = 1 << 3,\n  forInitHead = 1 << 4,\n  forInHead = 1 << 5,\n  forOfHead = 1 << 6,\n  // This flag lives across the token boundary, and will\n  // be reset after forIn or forInit head is printed\n  forInOrInitHeadAccumulate = 1 << 7,\n  forInOrInitHeadAccumulatePassThroughMask = 0b10000000,\n}\n\nexport type NodeHandler<R> = (\n  node: t.Node,\n  // todo:\n  // node: K extends keyof typeof t\n  //   ? Extract<typeof t[K], { type: \"string\" }>\n  //   : t.Node,\n  parent: t.Node,\n  parentId: number,\n  tokenContext?: number,\n  getRawIdentifier?: (node: t.Identifier) => string,\n) => R | undefined;\n\nfor (const type of Object.keys(parens) as (keyof typeof parens)[]) {\n  const func = parens[type];\n  if (generatorInfosMap.has(type)) {\n    generatorInfosMap.get(type)![2] = func;\n  }\n}\n\nfunction isOrHasCallExpression(node: t.Node): boolean {\n  switch (node.type) {\n    case \"CallExpression\":\n      return true;\n    case \"MemberExpression\":\n      return isOrHasCallExpression(node.object);\n  }\n  return false;\n}\n\nexport function parentNeedsParens(\n  node: t.Node,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"NewExpression\"):\n      if (parent.callee === node) {\n        if (isOrHasCallExpression(node)) return true;\n      }\n      break;\n    case __node(\"Decorator\"):\n      return (\n        !isDecoratorMemberExpression(node) &&\n        !(\n          node.type === \"CallExpression\" &&\n          isDecoratorMemberExpression(node.callee)\n        ) &&\n        node.type !== \"ParenthesizedExpression\"\n      );\n  }\n  return false;\n}\n\nfunction isDecoratorMemberExpression(node: t.Node): boolean {\n  switch (node.type) {\n    case \"Identifier\":\n      return true;\n    case \"MemberExpression\":\n      return (\n        !node.computed &&\n        node.property.type === \"Identifier\" &&\n        isDecoratorMemberExpression(node.object)\n      );\n    default:\n      return false;\n  }\n}\n\nexport function isLastChild(parent: t.Node, child: t.Node) {\n  const visitorKeys = VISITOR_KEYS[parent.type];\n  for (let i = visitorKeys.length - 1; i >= 0; i--) {\n    const val = (parent as any)[visitorKeys[i]] as t.Node | t.Node[] | null;\n    if (val === child) {\n      return true;\n    } else if (Array.isArray(val)) {\n      let j = val.length - 1;\n      while (j >= 0 && val[j] === null) j--;\n      return j >= 0 && val[j] === child;\n    } else if (val) {\n      return false;\n    }\n  }\n  return false;\n}\n"],"mappings":";;;;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,EAAA,GAAAD,OAAA;AAGA,IAAAE,MAAA,GAAAF,OAAA;AAAgD;EAHvCG;AAAY,IAAAF,EAAA;AAAA,MAKHG,YAAY,GAAAC,OAAA,CAAAD,YAAA;EAAAE,MAAA;EAAAC,mBAAA;EAAAC,SAAA;EAAAC,aAAA;EAAAC,mBAAA;EAAAC,WAAA;EAAAC,SAAA;EAAAC,SAAA;EAAAC,yBAAA;EAAAC,wCAAA;AAAA;AA2B9B,KAAK,MAAMC,IAAI,IAAIC,MAAM,CAACC,IAAI,CAACnB,MAAM,CAAC,EAA6B;EACjE,MAAMoB,IAAI,GAAGpB,MAAM,CAACiB,IAAI,CAAC;EACzB,IAAII,wBAAiB,CAACC,GAAG,CAACL,IAAI,CAAC,EAAE;IAC/BI,wBAAiB,CAACE,GAAG,CAACN,IAAI,CAAC,CAAE,CAAC,CAAC,GAAGG,IAAI;EACxC;AACF;AAEA,SAASI,qBAAqBA,CAACC,IAAY,EAAW;EACpD,QAAQA,IAAI,CAACR,IAAI;IACf,KAAK,gBAAgB;MACnB,OAAO,IAAI;IACb,KAAK,kBAAkB;MACrB,OAAOO,qBAAqB,CAACC,IAAI,CAACC,MAAM,CAAC;EAC7C;EACA,OAAO,KAAK;AACd;AAEO,SAASC,iBAAiBA,CAC/BF,IAAY,EACZG,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;MACE,IAAID,MAAM,CAACE,MAAM,KAAKL,IAAI,EAAE;QAC1B,IAAID,qBAAqB,CAACC,IAAI,CAAC,EAAE,OAAO,IAAI;MAC9C;MACA;IACF;MACE,OACE,CAACM,2BAA2B,CAACN,IAAI,CAAC,IAClC,EACEA,IAAI,CAACR,IAAI,KAAK,gBAAgB,IAC9Bc,2BAA2B,CAACN,IAAI,CAACK,MAAM,CAAC,CACzC,IACDL,IAAI,CAACR,IAAI,KAAK,yBAAyB;EAE7C;EACA,OAAO,KAAK;AACd;AAEA,SAASc,2BAA2BA,CAACN,IAAY,EAAW;EAC1D,QAAQA,IAAI,CAACR,IAAI;IACf,KAAK,YAAY;MACf,OAAO,IAAI;IACb,KAAK,kBAAkB;MACrB,OACE,CAACQ,IAAI,CAACO,QAAQ,IACdP,IAAI,CAACQ,QAAQ,CAAChB,IAAI,KAAK,YAAY,IACnCc,2BAA2B,CAACN,IAAI,CAACC,MAAM,CAAC;IAE5C;MACE,OAAO,KAAK;EAChB;AACF;AAEO,SAASQ,WAAWA,CAACN,MAAc,EAAEO,KAAa,EAAE;EACzD,MAAMC,WAAW,GAAGhC,YAAY,CAACwB,MAAM,CAACX,IAAI,CAAC;EAC7C,KAAK,IAAIoB,CAAC,GAAGD,WAAW,CAACE,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;IAChD,MAAME,GAAG,GAAIX,MAAM,CAASQ,WAAW,CAACC,CAAC,CAAC,CAA6B;IACvE,IAAIE,GAAG,KAAKJ,KAAK,EAAE;MACjB,OAAO,IAAI;IACb,CAAC,MAAM,IAAIK,KAAK,CAACC,OAAO,CAACF,GAAG,CAAC,EAAE;MAC7B,IAAIG,CAAC,GAAGH,GAAG,CAACD,MAAM,GAAG,CAAC;MACtB,OAAOI,CAAC,IAAI,CAAC,IAAIH,GAAG,CAACG,CAAC,CAAC,KAAK,IAAI,EAAEA,CAAC,EAAE;MACrC,OAAOA,CAAC,IAAI,CAAC,IAAIH,GAAG,CAACG,CAAC,CAAC,KAAKP,KAAK;IACnC,CAAC,MAAM,IAAII,GAAG,EAAE;MACd,OAAO,KAAK;IACd;EACF;EACA,OAAO,KAAK;AACd","ignoreList":[]}
\ No newline at end of file
diff --git a/node_modules/@babel/generator/lib/node/parentheses.js b/node_modules/@babel/generator/lib/node/parentheses.js
new file mode 100644
index 0000000..b7e1f4f
--- /dev/null
+++ b/node_modules/@babel/generator/lib/node/parentheses.js
@@ -0,0 +1,298 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AssignmentExpression = AssignmentExpression;
+exports.BinaryExpression = BinaryExpression;
+exports.ClassExpression = ClassExpression;
+exports.ArrowFunctionExpression = exports.ConditionalExpression = ConditionalExpression;
+exports.DoExpression = DoExpression;
+exports.FunctionExpression = FunctionExpression;
+exports.FunctionTypeAnnotation = FunctionTypeAnnotation;
+exports.Identifier = Identifier;
+exports.LogicalExpression = LogicalExpression;
+exports.NullableTypeAnnotation = NullableTypeAnnotation;
+exports.ObjectExpression = ObjectExpression;
+exports.OptionalIndexedAccessType = OptionalIndexedAccessType;
+exports.OptionalCallExpression = exports.OptionalMemberExpression = OptionalMemberExpression;
+exports.SequenceExpression = SequenceExpression;
+exports.TSSatisfiesExpression = exports.TSAsExpression = TSAsExpression;
+exports.TSConditionalType = TSConditionalType;
+exports.TSConstructorType = exports.TSFunctionType = TSFunctionType;
+exports.TSInferType = TSInferType;
+exports.TSInstantiationExpression = TSInstantiationExpression;
+exports.TSIntersectionType = TSIntersectionType;
+exports.SpreadElement = exports.UnaryExpression = exports.TSTypeAssertion = UnaryLike;
+exports.TSTypeOperator = TSTypeOperator;
+exports.TSUnionType = TSUnionType;
+exports.IntersectionTypeAnnotation = exports.UnionTypeAnnotation = UnionTypeAnnotation;
+exports.UpdateExpression = UpdateExpression;
+exports.AwaitExpression = exports.YieldExpression = YieldExpression;
+var _t = require("@babel/types");
+var _index = require("./index.js");
+const {
+  isMemberExpression,
+  isOptionalMemberExpression,
+  isYieldExpression,
+  isStatement
+} = _t;
+const PRECEDENCE = new Map([["||", 0], ["??", 1], ["&&", 2], ["|", 3], ["^", 4], ["&", 5], ["==", 6], ["===", 6], ["!=", 6], ["!==", 6], ["<", 7], [">", 7], ["<=", 7], [">=", 7], ["in", 7], ["instanceof", 7], [">>", 8], ["<<", 8], [">>>", 8], ["+", 9], ["-", 9], ["*", 10], ["/", 10], ["%", 10], ["**", 11]]);
+function isTSTypeExpression(nodeId) {
+  return nodeId === 156 || nodeId === 201 || nodeId === 209;
+}
+const isClassExtendsClause = (node, parent, parentId) => {
+  return (parentId === 21 || parentId === 22) && parent.superClass === node;
+};
+const hasPostfixPart = (node, parent, parentId) => {
+  switch (parentId) {
+    case 108:
+    case 132:
+      return parent.object === node;
+    case 17:
+    case 130:
+    case 112:
+      return parent.callee === node;
+    case 222:
+      return parent.tag === node;
+    case 191:
+      return true;
+  }
+  return false;
+};
+function NullableTypeAnnotation(node, parent, parentId) {
+  return parentId === 4;
+}
+function FunctionTypeAnnotation(node, parent, parentId, tokenContext) {
+  return (parentId === 239 || parentId === 90 || parentId === 4 || (tokenContext & _index.TokenContext.arrowFlowReturnType) > 0
+  );
+}
+function UpdateExpression(node, parent, parentId) {
+  return hasPostfixPart(node, parent, parentId) || isClassExtendsClause(node, parent, parentId);
+}
+function needsParenBeforeExpressionBrace(tokenContext) {
+  return (tokenContext & (_index.TokenContext.expressionStatement | _index.TokenContext.arrowBody)) > 0;
+}
+function ObjectExpression(node, parent, parentId, tokenContext) {
+  return needsParenBeforeExpressionBrace(tokenContext);
+}
+function DoExpression(node, parent, parentId, tokenContext) {
+  return (tokenContext & _index.TokenContext.expressionStatement) > 0 && !node.async;
+}
+function BinaryLike(node, parent, parentId, nodeType) {
+  if (isClassExtendsClause(node, parent, parentId)) {
+    return true;
+  }
+  if (hasPostfixPart(node, parent, parentId) || parentId === 238 || parentId === 145 || parentId === 8) {
+    return true;
+  }
+  let parentPos;
+  switch (parentId) {
+    case 10:
+    case 107:
+      parentPos = PRECEDENCE.get(parent.operator);
+      break;
+    case 156:
+    case 201:
+      parentPos = 7;
+  }
+  if (parentPos !== undefined) {
+    const nodePos = nodeType === 2 ? 7 : PRECEDENCE.get(node.operator);
+    if (parentPos > nodePos) return true;
+    if (parentPos === nodePos && parentId === 10 && (nodePos === 11 ? parent.left === node : parent.right === node)) {
+      return true;
+    }
+    if (nodeType === 1 && parentId === 107 && (nodePos === 1 && parentPos !== 1 || parentPos === 1 && nodePos !== 1)) {
+      return true;
+    }
+  }
+  return false;
+}
+function UnionTypeAnnotation(node, parent, parentId) {
+  switch (parentId) {
+    case 4:
+    case 115:
+    case 90:
+    case 239:
+      return true;
+  }
+  return false;
+}
+function OptionalIndexedAccessType(node, parent, parentId) {
+  return parentId === 84 && parent.objectType === node;
+}
+function TSAsExpression(node, parent, parentId) {
+  if ((parentId === 6 || parentId === 7) && parent.left === node) {
+    return true;
+  }
+  if (parentId === 10 && (parent.operator === "|" || parent.operator === "&") && node === parent.left) {
+    return true;
+  }
+  return BinaryLike(node, parent, parentId, 2);
+}
+function TSConditionalType(node, parent, parentId) {
+  switch (parentId) {
+    case 155:
+    case 195:
+    case 211:
+    case 212:
+      return true;
+    case 175:
+      return parent.objectType === node;
+    case 181:
+    case 219:
+      return parent.types[0] === node;
+    case 161:
+      return parent.checkType === node || parent.extendsType === node;
+  }
+  return false;
+}
+function TSUnionType(node, parent, parentId) {
+  switch (parentId) {
+    case 181:
+    case 211:
+    case 155:
+    case 195:
+      return true;
+    case 175:
+      return parent.objectType === node;
+  }
+  return false;
+}
+function TSIntersectionType(node, parent, parentId) {
+  return parentId === 211 || TSTypeOperator(node, parent, parentId);
+}
+function TSInferType(node, parent, parentId) {
+  if (TSTypeOperator(node, parent, parentId)) {
+    return true;
+  }
+  if ((parentId === 181 || parentId === 219) && node.typeParameter.constraint && parent.types[0] === node) {
+    return true;
+  }
+  return false;
+}
+function TSTypeOperator(node, parent, parentId) {
+  switch (parentId) {
+    case 155:
+    case 195:
+      return true;
+    case 175:
+      if (parent.objectType === node) {
+        return true;
+      }
+  }
+  return false;
+}
+function TSInstantiationExpression(node, parent, parentId) {
+  switch (parentId) {
+    case 17:
+    case 130:
+    case 112:
+    case 177:
+      return (parent.typeParameters
+      ) != null;
+  }
+  return false;
+}
+function TSFunctionType(node, parent, parentId) {
+  if (TSUnionType(node, parent, parentId)) return true;
+  return parentId === 219 || parentId === 161 && (parent.checkType === node || parent.extendsType === node);
+}
+function BinaryExpression(node, parent, parentId, tokenContext) {
+  if (BinaryLike(node, parent, parentId, 0)) return true;
+  return (tokenContext & _index.TokenContext.forInOrInitHeadAccumulate) > 0 && node.operator === "in";
+}
+function LogicalExpression(node, parent, parentId) {
+  return BinaryLike(node, parent, parentId, 1);
+}
+function SequenceExpression(node, parent, parentId) {
+  if (parentId === 144 || parentId === 133 || parentId === 108 && parent.property === node || parentId === 132 && parent.property === node || parentId === 224) {
+    return false;
+  }
+  if (parentId === 21) {
+    return true;
+  }
+  if (parentId === 68) {
+    return parent.right === node;
+  }
+  if (parentId === 60) {
+    return true;
+  }
+  return !isStatement(parent);
+}
+function YieldExpression(node, parent, parentId) {
+  return parentId === 10 || parentId === 107 || parentId === 238 || parentId === 145 || hasPostfixPart(node, parent, parentId) || parentId === 8 && isYieldExpression(node) || parentId === 28 && node === parent.test || isClassExtendsClause(node, parent, parentId) || isTSTypeExpression(parentId);
+}
+function ClassExpression(node, parent, parentId, tokenContext) {
+  return (tokenContext & (_index.TokenContext.expressionStatement | _index.TokenContext.exportDefault)) > 0;
+}
+function UnaryLike(node, parent, parentId) {
+  return hasPostfixPart(node, parent, parentId) || parentId === 10 && parent.operator === "**" && parent.left === node || isClassExtendsClause(node, parent, parentId);
+}
+function FunctionExpression(node, parent, parentId, tokenContext) {
+  return (tokenContext & (_index.TokenContext.expressionStatement | _index.TokenContext.exportDefault)) > 0;
+}
+function ConditionalExpression(node, parent, parentId) {
+  switch (parentId) {
+    case 238:
+    case 145:
+    case 10:
+    case 107:
+    case 8:
+      return true;
+    case 28:
+      if (parent.test === node) {
+        return true;
+      }
+  }
+  if (isTSTypeExpression(parentId)) {
+    return true;
+  }
+  return UnaryLike(node, parent, parentId);
+}
+function OptionalMemberExpression(node, parent, parentId) {
+  switch (parentId) {
+    case 17:
+      return parent.callee === node;
+    case 108:
+      return parent.object === node;
+  }
+  return false;
+}
+function AssignmentExpression(node, parent, parentId, tokenContext) {
+  if (needsParenBeforeExpressionBrace(tokenContext) && node.left.type === "ObjectPattern") {
+    return true;
+  }
+  return ConditionalExpression(node, parent, parentId);
+}
+function Identifier(node, parent, parentId, tokenContext, getRawIdentifier) {
+  var _node$extra;
+  if (getRawIdentifier && getRawIdentifier(node) !== node.name) {
+    return false;
+  }
+  if (parentId === 6 && (_node$extra = node.extra) != null && _node$extra.parenthesized && parent.left === node) {
+    const rightType = parent.right.type;
+    if ((rightType === "FunctionExpression" || rightType === "ClassExpression") && parent.right.id == null) {
+      return true;
+    }
+  }
+  if (tokenContext & _index.TokenContext.forOfHead || (parentId === 108 || parentId === 132) && tokenContext & (_index.TokenContext.expressionStatement | _index.TokenContext.forInitHead | _index.TokenContext.forInHead)) {
+    if (node.name === "let") {
+      const isFollowedByBracket = isMemberExpression(parent, {
+        object: node,
+        computed: true
+      }) || isOptionalMemberExpression(parent, {
+        object: node,
+        computed: true,
+        optional: false
+      });
+      if (isFollowedByBracket && tokenContext & (_index.TokenContext.expressionStatement | _index.TokenContext.forInitHead | _index.TokenContext.forInHead)) {
+        return true;
+      }
+      return (tokenContext & _index.TokenContext.forOfHead) > 0;
+    }
+  }
+  return parentId === 68 && parent.left === node && node.name === "async" && !parent.await;
+}
+
+//# sourceMappingURL=parentheses.js.map
diff --git a/node_modules/@babel/generator/lib/node/parentheses.js.map b/node_modules/@babel/generator/lib/node/parentheses.js.map
new file mode 100644
index 0000000..0120e9c
--- /dev/null
+++ b/node_modules/@babel/generator/lib/node/parentheses.js.map
@@ -0,0 +1 @@
+{"version":3,"names":["_t","require","_index","isMemberExpression","isOptionalMemberExpression","isYieldExpression","isStatement","PRECEDENCE","Map","isTSTypeExpression","nodeId","isClassExtendsClause","node","parent","parentId","superClass","hasPostfixPart","object","callee","tag","NullableTypeAnnotation","FunctionTypeAnnotation","tokenContext","TokenContext","arrowFlowReturnType","UpdateExpression","needsParenBeforeExpressionBrace","expressionStatement","arrowBody","ObjectExpression","DoExpression","async","BinaryLike","nodeType","parentPos","get","operator","undefined","nodePos","left","right","UnionTypeAnnotation","OptionalIndexedAccessType","objectType","TSAsExpression","TSConditionalType","types","checkType","extendsType","TSUnionType","TSIntersectionType","TSTypeOperator","TSInferType","typeParameter","constraint","TSInstantiationExpression","typeParameters","TSFunctionType","BinaryExpression","forInOrInitHeadAccumulate","LogicalExpression","SequenceExpression","property","YieldExpression","test","ClassExpression","exportDefault","UnaryLike","FunctionExpression","ConditionalExpression","OptionalMemberExpression","AssignmentExpression","type","Identifier","getRawIdentifier","_node$extra","name","extra","parenthesized","rightType","id","forOfHead","forInitHead","forInHead","isFollowedByBracket","computed","optional","await"],"sources":["../../src/node/parentheses.ts"],"sourcesContent":["import {\n  isMemberExpression,\n  isOptionalMemberExpression,\n  isYieldExpression,\n  isStatement,\n} from \"@babel/types\";\nimport type * as t from \"@babel/types\";\n\nimport { TokenContext } from \"./index.ts\";\n\nconst PRECEDENCE = new Map([\n  [\"||\", 0],\n  [\"??\", 1],\n  [\"&&\", 2],\n  [\"|\", 3],\n  [\"^\", 4],\n  [\"&\", 5],\n  [\"==\", 6],\n  [\"===\", 6],\n  [\"!=\", 6],\n  [\"!==\", 6],\n  [\"<\", 7],\n  [\">\", 7],\n  [\"<=\", 7],\n  [\">=\", 7],\n  [\"in\", 7],\n  [\"instanceof\", 7],\n  [\">>\", 8],\n  [\"<<\", 8],\n  [\">>>\", 8],\n  [\"+\", 9],\n  [\"-\", 9],\n  [\"*\", 10],\n  [\"/\", 10],\n  [\"%\", 10],\n  [\"**\", 11],\n]);\n\nfunction isTSTypeExpression(nodeId: number) {\n  return (\n    nodeId === __node(\"TSAsExpression\") ||\n    nodeId === __node(\"TSSatisfiesExpression\") ||\n    nodeId === __node(\"TSTypeAssertion\")\n  );\n}\n\nconst isClassExtendsClause = (\n  node: t.Node,\n  parent: any,\n  parentId: number,\n): parent is t.Class => {\n  return (\n    (parentId === __node(\"ClassDeclaration\") ||\n      parentId === __node(\"ClassExpression\")) &&\n    parent.superClass === node\n  );\n};\n\nconst hasPostfixPart = (node: t.Node, parent: any, parentId: number) => {\n  switch (parentId) {\n    case __node(\"MemberExpression\"):\n    case __node(\"OptionalMemberExpression\"):\n      return parent.object === node;\n    case __node(\"CallExpression\"):\n    case __node(\"OptionalCallExpression\"):\n    case __node(\"NewExpression\"):\n      return parent.callee === node;\n    case __node(\"TaggedTemplateExpression\"):\n      return parent.tag === node;\n    case __node(\"TSNonNullExpression\"):\n      return true;\n  }\n\n  return false;\n};\n\nexport function NullableTypeAnnotation(\n  node: t.NullableTypeAnnotation,\n  parent: any,\n  parentId: number,\n): boolean {\n  return parentId === __node(\"ArrayTypeAnnotation\");\n}\n\nexport function FunctionTypeAnnotation(\n  node: t.FunctionTypeAnnotation,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  return (\n    // (() => A) | (() => B)\n    parentId === __node(\"UnionTypeAnnotation\") ||\n    // (() => A) & (() => B)\n    parentId === __node(\"IntersectionTypeAnnotation\") ||\n    // (() => A)[]\n    parentId === __node(\"ArrayTypeAnnotation\") ||\n    (tokenContext & TokenContext.arrowFlowReturnType) > 0\n  );\n}\n\nexport function UpdateExpression(\n  node: t.UpdateExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  return (\n    hasPostfixPart(node, parent, parentId) ||\n    isClassExtendsClause(node, parent, parentId)\n  );\n}\n\nfunction needsParenBeforeExpressionBrace(tokenContext: number) {\n  return (\n    (tokenContext &\n      (TokenContext.expressionStatement | TokenContext.arrowBody)) >\n    0\n  );\n}\n\nexport function ObjectExpression(\n  node: t.ObjectExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  return needsParenBeforeExpressionBrace(tokenContext);\n}\n\nexport function DoExpression(\n  node: t.DoExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  // `async do` can start an expression statement\n  return (tokenContext & TokenContext.expressionStatement) > 0 && !node.async;\n}\n\nconst enum BinaryLikeType {\n  Binary = 0,\n  Logical = 1,\n  TypeScript = 2,\n}\n\nfunction BinaryLike(\n  node: t.Binary | t.TSAsExpression | t.TSSatisfiesExpression,\n  parent: any,\n  parentId: number,\n  nodeType: BinaryLikeType,\n): boolean {\n  if (isClassExtendsClause(node, parent, parentId)) {\n    return true;\n  }\n\n  if (\n    hasPostfixPart(node, parent, parentId) ||\n    parentId === __node(\"UnaryExpression\") ||\n    parentId === __node(\"SpreadElement\") ||\n    parentId === __node(\"AwaitExpression\")\n  ) {\n    return true;\n  }\n  let parentPos: number | undefined;\n  switch (parentId) {\n    case __node(\"BinaryExpression\"):\n    case __node(\"LogicalExpression\"):\n      parentPos = PRECEDENCE.get(parent.operator);\n      break;\n    case __node(\"TSAsExpression\"):\n    case __node(\"TSSatisfiesExpression\"):\n      parentPos = 7; /* in */\n  }\n  if (parentPos !== undefined) {\n    const nodePos =\n      nodeType === BinaryLikeType.TypeScript\n        ? 7 /* in */\n        : PRECEDENCE.get((node as t.Binary).operator)!;\n    if (parentPos > nodePos) return true;\n    if (\n      parentPos === nodePos &&\n      parentId === __node(\"BinaryExpression\") &&\n      (nodePos === 11 /* ** */ ? parent.left === node : parent.right === node)\n    ) {\n      return true;\n    }\n    if (\n      nodeType === BinaryLikeType.Logical &&\n      parentId === __node(\"LogicalExpression\") &&\n      // 1: ??\n      ((nodePos === 1 && parentPos !== 1) || (parentPos === 1 && nodePos !== 1))\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport function UnionTypeAnnotation(\n  node: t.UnionTypeAnnotation | t.IntersectionTypeAnnotation,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"ArrayTypeAnnotation\"):\n    case __node(\"NullableTypeAnnotation\"):\n    case __node(\"IntersectionTypeAnnotation\"):\n    case __node(\"UnionTypeAnnotation\"):\n      return true;\n  }\n  return false;\n}\n\nexport { UnionTypeAnnotation as IntersectionTypeAnnotation };\n\nexport function OptionalIndexedAccessType(\n  node: t.OptionalIndexedAccessType,\n  parent: any,\n  parentId: number,\n): boolean {\n  return parentId === __node(\"IndexedAccessType\") && parent.objectType === node;\n}\n\nexport function TSAsExpression(\n  node: t.TSAsExpression | t.TSSatisfiesExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  if (\n    (parentId === __node(\"AssignmentExpression\") ||\n      parentId === __node(\"AssignmentPattern\")) &&\n    parent.left === node\n  ) {\n    return true;\n  }\n  if (\n    parentId === __node(\"BinaryExpression\") &&\n    (parent.operator === \"|\" || parent.operator === \"&\") &&\n    node === parent.left\n  ) {\n    return true;\n  }\n  return BinaryLike(node, parent, parentId, BinaryLikeType.TypeScript);\n}\n\nexport { TSAsExpression as TSSatisfiesExpression };\n\nexport { UnaryLike as TSTypeAssertion };\n\nexport function TSConditionalType(\n  node: t.TSConditionalType,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"TSArrayType\"):\n    case __node(\"TSOptionalType\"):\n    case __node(\"TSTypeOperator\"):\n    // for `infer K extends (L extends M ? M : ...)`\n    // fallthrough\n    case __node(\"TSTypeParameter\"):\n      return true;\n    case __node(\"TSIndexedAccessType\"):\n      return parent.objectType === node;\n    case __node(\"TSIntersectionType\"):\n    case __node(\"TSUnionType\"):\n      return parent.types[0] === node;\n    case __node(\"TSConditionalType\"):\n      return parent.checkType === node || parent.extendsType === node;\n  }\n  return false;\n}\n\nexport function TSUnionType(\n  node: t.TSUnionType | t.TSFunctionType,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"TSIntersectionType\"):\n    case __node(\"TSTypeOperator\"):\n    case __node(\"TSArrayType\"):\n    case __node(\"TSOptionalType\"):\n      return true;\n    case __node(\"TSIndexedAccessType\"):\n      return parent.objectType === node;\n  }\n  return false;\n}\n\nexport function TSIntersectionType(\n  node: t.TSUnionType,\n  parent: any,\n  parentId: number,\n): boolean {\n  return (\n    parentId === __node(\"TSTypeOperator\") ||\n    TSTypeOperator(node, parent, parentId)\n  );\n}\n\nexport function TSInferType(\n  node: t.TSInferType,\n  parent: any,\n  parentId: number,\n): boolean {\n  if (TSTypeOperator(node, parent, parentId)) {\n    return true;\n  }\n  if (\n    (parentId === __node(\"TSIntersectionType\") ||\n      parentId === __node(\"TSUnionType\")) &&\n    node.typeParameter.constraint &&\n    parent.types[0] === node\n  ) {\n    return true;\n  }\n  return false;\n}\n\nexport function TSTypeOperator(\n  node: t.TSTypeOperator | t.TSUnionType | t.TSInferType,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"TSArrayType\"):\n    case __node(\"TSOptionalType\"):\n      return true;\n    case __node(\"TSIndexedAccessType\"):\n      if (parent.objectType === node) {\n        return true;\n      }\n  }\n  return false;\n}\n\nexport function TSInstantiationExpression(\n  node: t.TSInstantiationExpression,\n  parent: any,\n  parentId: number,\n) {\n  switch (parentId) {\n    case __node(\"CallExpression\"):\n    case __node(\"OptionalCallExpression\"):\n    case __node(\"NewExpression\"):\n    case __node(\"TSInstantiationExpression\"):\n      return (\n        (process.env.BABEL_8_BREAKING\n          ? // @ts-ignore(Babel 7 vs Babel 8) Babel 8 AST\n            parent.typeArguments\n          : // @ts-ignore(Babel 7 vs Babel 8) Babel 7 AST\n            parent.typeParameters) != null\n      );\n  }\n\n  return false;\n}\n\nexport function TSFunctionType(\n  node: t.TSFunctionType,\n  parent: any,\n  parentId: number,\n): boolean {\n  if (TSUnionType(node, parent, parentId)) return true;\n\n  return (\n    parentId === __node(\"TSUnionType\") ||\n    (parentId === __node(\"TSConditionalType\") &&\n      (parent.checkType === node || parent.extendsType === node))\n  );\n}\n\nexport { TSFunctionType as TSConstructorType };\n\nexport function BinaryExpression(\n  node: t.BinaryExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  if (BinaryLike(node, parent, parentId, BinaryLikeType.Binary)) return true;\n\n  // for ((1 in []);;);\n  // for (var x = (1 in []) in 2);\n  return (\n    (tokenContext & TokenContext.forInOrInitHeadAccumulate) > 0 &&\n    node.operator === \"in\"\n  );\n}\n\nexport function LogicalExpression(\n  node: t.LogicalExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  return BinaryLike(node, parent, parentId, BinaryLikeType.Logical);\n}\n\nexport function SequenceExpression(\n  node: t.SequenceExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  if (\n    parentId === __node(\"SequenceExpression\") ||\n    parentId === __node(\"ParenthesizedExpression\") ||\n    (parentId === __node(\"MemberExpression\") && parent.property === node) ||\n    (parentId === __node(\"OptionalMemberExpression\") &&\n      parent.property === node) ||\n    parentId === __node(\"TemplateLiteral\")\n  ) {\n    return false;\n  }\n  if (parentId === __node(\"ClassDeclaration\")) {\n    return true;\n  }\n  if (parentId === __node(\"ForOfStatement\")) {\n    return parent.right === node;\n  }\n  if (parentId === __node(\"ExportDefaultDeclaration\")) {\n    return true;\n  }\n\n  return !isStatement(parent);\n}\n\nexport function YieldExpression(\n  node: t.YieldExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  return (\n    parentId === __node(\"BinaryExpression\") ||\n    parentId === __node(\"LogicalExpression\") ||\n    parentId === __node(\"UnaryExpression\") ||\n    parentId === __node(\"SpreadElement\") ||\n    hasPostfixPart(node, parent, parentId) ||\n    (parentId === __node(\"AwaitExpression\") && isYieldExpression(node)) ||\n    (parentId === __node(\"ConditionalExpression\") && node === parent.test) ||\n    isClassExtendsClause(node, parent, parentId) ||\n    isTSTypeExpression(parentId)\n  );\n}\n\nexport { YieldExpression as AwaitExpression };\n\nexport function ClassExpression(\n  node: t.ClassExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  return (\n    (tokenContext &\n      (TokenContext.expressionStatement | TokenContext.exportDefault)) >\n    0\n  );\n}\n\nfunction UnaryLike(\n  node:\n    | t.UnaryLike\n    | t.TSTypeAssertion\n    | t.ArrowFunctionExpression\n    | t.ConditionalExpression\n    | t.AssignmentExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  return (\n    hasPostfixPart(node, parent, parentId) ||\n    (parentId === __node(\"BinaryExpression\") &&\n      parent.operator === \"**\" &&\n      parent.left === node) ||\n    isClassExtendsClause(node, parent, parentId)\n  );\n}\n\nexport { UnaryLike as UnaryExpression, UnaryLike as SpreadElement };\n\nexport function FunctionExpression(\n  node: t.FunctionExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  return (\n    (tokenContext &\n      (TokenContext.expressionStatement | TokenContext.exportDefault)) >\n    0\n  );\n}\n\nexport function ConditionalExpression(\n  node:\n    | t.ConditionalExpression\n    | t.ArrowFunctionExpression\n    | t.AssignmentExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"UnaryExpression\"):\n    case __node(\"SpreadElement\"):\n    case __node(\"BinaryExpression\"):\n    case __node(\"LogicalExpression\"):\n    case __node(\"AwaitExpression\"):\n      return true;\n    case __node(\"ConditionalExpression\"):\n      if (parent.test === node) {\n        return true;\n      }\n  }\n\n  if (isTSTypeExpression(parentId)) {\n    return true;\n  }\n\n  return UnaryLike(node, parent, parentId);\n}\n\nexport { ConditionalExpression as ArrowFunctionExpression };\n\nexport function OptionalMemberExpression(\n  node: t.OptionalMemberExpression,\n  parent: any,\n  parentId: number,\n): boolean {\n  switch (parentId) {\n    case __node(\"CallExpression\"):\n      return parent.callee === node;\n    case __node(\"MemberExpression\"):\n      return parent.object === node;\n  }\n  return false;\n}\n\nexport { OptionalMemberExpression as OptionalCallExpression };\n\nexport function AssignmentExpression(\n  node: t.AssignmentExpression,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n): boolean {\n  if (\n    needsParenBeforeExpressionBrace(tokenContext) &&\n    node.left.type === \"ObjectPattern\"\n  ) {\n    return true;\n  }\n  return ConditionalExpression(node, parent, parentId);\n}\n\nexport function Identifier(\n  node: t.Identifier,\n  parent: any,\n  parentId: number,\n  tokenContext: number,\n  getRawIdentifier: (node: t.Identifier) => string,\n): boolean {\n  if (getRawIdentifier && getRawIdentifier(node) !== node.name) {\n    return false;\n  }\n\n  // 13.15.2 AssignmentExpression RS: Evaluation\n  // (fn) = function () {};\n  if (\n    parentId === __node(\"AssignmentExpression\") &&\n    node.extra?.parenthesized &&\n    parent.left === node\n  ) {\n    const rightType = parent.right.type;\n    if (\n      (rightType === \"FunctionExpression\" || rightType === \"ClassExpression\") &&\n      parent.right.id == null\n    ) {\n      return true;\n    }\n  }\n\n  // fast path\n  if (\n    tokenContext & TokenContext.forOfHead ||\n    ((parentId === __node(\"MemberExpression\") ||\n      parentId === __node(\"OptionalMemberExpression\")) &&\n      tokenContext &\n        (TokenContext.expressionStatement |\n          TokenContext.forInitHead |\n          TokenContext.forInHead))\n  ) {\n    // Non-strict code allows the identifier `let`, but it cannot occur as-is in\n    // certain contexts to avoid ambiguity with contextual keyword `let`.\n    if (node.name === \"let\") {\n      // Some contexts only forbid `let [`, so check if the next token would\n      // be the left bracket of a computed member expression.\n      const isFollowedByBracket =\n        isMemberExpression(parent, {\n          object: node,\n          computed: true,\n        }) ||\n        isOptionalMemberExpression(parent, {\n          object: node,\n          computed: true,\n          optional: false,\n        });\n      if (\n        isFollowedByBracket &&\n        tokenContext &\n          (TokenContext.expressionStatement |\n            TokenContext.forInitHead |\n            TokenContext.forInHead)\n      ) {\n        return true;\n      }\n      return (tokenContext & TokenContext.forOfHead) > 0;\n    }\n  }\n\n  // ECMAScript specifically forbids a for-of loop from starting with the\n  // token sequence `for (async of`, because it would be ambiguous with\n  // `for (async of => {};;)`, so we need to add extra parentheses.\n  return (\n    parentId === __node(\"ForOfStatement\") &&\n    parent.left === node &&\n    node.name === \"async\" &&\n    !parent.await\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAAAA,EAAA,GAAAC,OAAA;AAQA,IAAAC,MAAA,GAAAD,OAAA;AAA0C;EAPxCE,kBAAkB;EAClBC,0BAA0B;EAC1BC,iBAAiB;EACjBC;AAAW,IAAAN,EAAA;AAMb,MAAMO,UAAU,GAAG,IAAIC,GAAG,CAAC,CACzB,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,KAAK,EAAE,CAAC,CAAC,EACV,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,KAAK,EAAE,CAAC,CAAC,EACV,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,YAAY,EAAE,CAAC,CAAC,EACjB,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,IAAI,EAAE,CAAC,CAAC,EACT,CAAC,KAAK,EAAE,CAAC,CAAC,EACV,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,GAAG,EAAE,CAAC,CAAC,EACR,CAAC,GAAG,EAAE,EAAE,CAAC,EACT,CAAC,GAAG,EAAE,EAAE,CAAC,EACT,CAAC,GAAG,EAAE,EAAE,CAAC,EACT,CAAC,IAAI,EAAE,EAAE,CAAC,CACX,CAAC;AAEF,SAASC,kBAAkBA,CAACC,MAAc,EAAE;EAC1C,OACEA,MAAM,QAA6B,IACnCA,MAAM,QAAoC,IAC1CA,MAAM,QAA8B;AAExC;AAEA,MAAMC,oBAAoB,GAAGA,CAC3BC,IAAY,EACZC,MAAW,EACXC,QAAgB,KACM;EACtB,OACE,CAACA,QAAQ,OAA+B,IACtCA,QAAQ,OAA8B,KACxCD,MAAM,CAACE,UAAU,KAAKH,IAAI;AAE9B,CAAC;AAED,MAAMI,cAAc,GAAGA,CAACJ,IAAY,EAAEC,MAAW,EAAEC,QAAgB,KAAK;EACtE,QAAQA,QAAQ;IACd;IACA;MACE,OAAOD,MAAM,CAACI,MAAM,KAAKL,IAAI;IAC/B;IACA;IACA;MACE,OAAOC,MAAM,CAACK,MAAM,KAAKN,IAAI;IAC/B;MACE,OAAOC,MAAM,CAACM,GAAG,KAAKP,IAAI;IAC5B;MACE,OAAO,IAAI;EACf;EAEA,OAAO,KAAK;AACd,CAAC;AAEM,SAASQ,sBAAsBA,CACpCR,IAA8B,EAC9BC,MAAW,EACXC,QAAgB,EACP;EACT,OAAOA,QAAQ,MAAkC;AACnD;AAEO,SAASO,sBAAsBA,CACpCT,IAA8B,EAC9BC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,QAEER,QAAQ,QAAkC,IAE1CA,QAAQ,OAAyC,IAEjDA,QAAQ,MAAkC,IAC1C,CAACQ,YAAY,GAAGC,mBAAY,CAACC,mBAAmB,IAAI;EAAC;AAEzD;AAEO,SAASC,gBAAgBA,CAC9Bb,IAAwB,EACxBC,MAAW,EACXC,QAAgB,EACP;EACT,OACEE,cAAc,CAACJ,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,IACtCH,oBAAoB,CAACC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC;AAEhD;AAEA,SAASY,+BAA+BA,CAACJ,YAAoB,EAAE;EAC7D,OACE,CAACA,YAAY,IACVC,mBAAY,CAACI,mBAAmB,GAAGJ,mBAAY,CAACK,SAAS,CAAC,IAC7D,CAAC;AAEL;AAEO,SAASC,gBAAgBA,CAC9BjB,IAAwB,EACxBC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,OAAOI,+BAA+B,CAACJ,YAAY,CAAC;AACtD;AAEO,SAASQ,YAAYA,CAC1BlB,IAAoB,EACpBC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EAET,OAAO,CAACA,YAAY,GAAGC,mBAAY,CAACI,mBAAmB,IAAI,CAAC,IAAI,CAACf,IAAI,CAACmB,KAAK;AAC7E;AAQA,SAASC,UAAUA,CACjBpB,IAA2D,EAC3DC,MAAW,EACXC,QAAgB,EAChBmB,QAAwB,EACf;EACT,IAAItB,oBAAoB,CAACC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,EAAE;IAChD,OAAO,IAAI;EACb;EAEA,IACEE,cAAc,CAACJ,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,IACtCA,QAAQ,QAA8B,IACtCA,QAAQ,QAA4B,IACpCA,QAAQ,MAA8B,EACtC;IACA,OAAO,IAAI;EACb;EACA,IAAIoB,SAA6B;EACjC,QAAQpB,QAAQ;IACd;IACA;MACEoB,SAAS,GAAG3B,UAAU,CAAC4B,GAAG,CAACtB,MAAM,CAACuB,QAAQ,CAAC;MAC3C;IACF;IACA;MACEF,SAAS,GAAG,CAAC;EACjB;EACA,IAAIA,SAAS,KAAKG,SAAS,EAAE;IAC3B,MAAMC,OAAO,GACXL,QAAQ,MAA8B,GAClC,CAAC,GACD1B,UAAU,CAAC4B,GAAG,CAAEvB,IAAI,CAAcwB,QAAQ,CAAE;IAClD,IAAIF,SAAS,GAAGI,OAAO,EAAE,OAAO,IAAI;IACpC,IACEJ,SAAS,KAAKI,OAAO,IACrBxB,QAAQ,OAA+B,KACtCwB,OAAO,KAAK,EAAE,GAAYzB,MAAM,CAAC0B,IAAI,KAAK3B,IAAI,GAAGC,MAAM,CAAC2B,KAAK,KAAK5B,IAAI,CAAC,EACxE;MACA,OAAO,IAAI;IACb;IACA,IACEqB,QAAQ,MAA2B,IACnCnB,QAAQ,QAAgC,KAEtCwB,OAAO,KAAK,CAAC,IAAIJ,SAAS,KAAK,CAAC,IAAMA,SAAS,KAAK,CAAC,IAAII,OAAO,KAAK,CAAE,CAAC,EAC1E;MACA,OAAO,IAAI;IACb;EACF;EACA,OAAO,KAAK;AACd;AAEO,SAASG,mBAAmBA,CACjC7B,IAA0D,EAC1DC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;IACA;IACA;IACA;MACE,OAAO,IAAI;EACf;EACA,OAAO,KAAK;AACd;AAIO,SAAS4B,yBAAyBA,CACvC9B,IAAiC,EACjCC,MAAW,EACXC,QAAgB,EACP;EACT,OAAOA,QAAQ,OAAgC,IAAID,MAAM,CAAC8B,UAAU,KAAK/B,IAAI;AAC/E;AAEO,SAASgC,cAAcA,CAC5BhC,IAAgD,EAChDC,MAAW,EACXC,QAAgB,EACP;EACT,IACE,CAACA,QAAQ,MAAmC,IAC1CA,QAAQ,MAAgC,KAC1CD,MAAM,CAAC0B,IAAI,KAAK3B,IAAI,EACpB;IACA,OAAO,IAAI;EACb;EACA,IACEE,QAAQ,OAA+B,KACtCD,MAAM,CAACuB,QAAQ,KAAK,GAAG,IAAIvB,MAAM,CAACuB,QAAQ,KAAK,GAAG,CAAC,IACpDxB,IAAI,KAAKC,MAAM,CAAC0B,IAAI,EACpB;IACA,OAAO,IAAI;EACb;EACA,OAAOP,UAAU,CAACpB,IAAI,EAAEC,MAAM,EAAEC,QAAQ,GAA2B,CAAC;AACtE;AAMO,SAAS+B,iBAAiBA,CAC/BjC,IAAyB,EACzBC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;IACA;IACA;IAGA;MACE,OAAO,IAAI;IACb;MACE,OAAOD,MAAM,CAAC8B,UAAU,KAAK/B,IAAI;IACnC;IACA;MACE,OAAOC,MAAM,CAACiC,KAAK,CAAC,CAAC,CAAC,KAAKlC,IAAI;IACjC;MACE,OAAOC,MAAM,CAACkC,SAAS,KAAKnC,IAAI,IAAIC,MAAM,CAACmC,WAAW,KAAKpC,IAAI;EACnE;EACA,OAAO,KAAK;AACd;AAEO,SAASqC,WAAWA,CACzBrC,IAAsC,EACtCC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;IACA;IACA;IACA;MACE,OAAO,IAAI;IACb;MACE,OAAOD,MAAM,CAAC8B,UAAU,KAAK/B,IAAI;EACrC;EACA,OAAO,KAAK;AACd;AAEO,SAASsC,kBAAkBA,CAChCtC,IAAmB,EACnBC,MAAW,EACXC,QAAgB,EACP;EACT,OACEA,QAAQ,QAA6B,IACrCqC,cAAc,CAACvC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC;AAE1C;AAEO,SAASsC,WAAWA,CACzBxC,IAAmB,EACnBC,MAAW,EACXC,QAAgB,EACP;EACT,IAAIqC,cAAc,CAACvC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,EAAE;IAC1C,OAAO,IAAI;EACb;EACA,IACE,CAACA,QAAQ,QAAiC,IACxCA,QAAQ,QAA0B,KACpCF,IAAI,CAACyC,aAAa,CAACC,UAAU,IAC7BzC,MAAM,CAACiC,KAAK,CAAC,CAAC,CAAC,KAAKlC,IAAI,EACxB;IACA,OAAO,IAAI;EACb;EACA,OAAO,KAAK;AACd;AAEO,SAASuC,cAAcA,CAC5BvC,IAAsD,EACtDC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;IACA;MACE,OAAO,IAAI;IACb;MACE,IAAID,MAAM,CAAC8B,UAAU,KAAK/B,IAAI,EAAE;QAC9B,OAAO,IAAI;MACb;EACJ;EACA,OAAO,KAAK;AACd;AAEO,SAAS2C,yBAAyBA,CACvC3C,IAAiC,EACjCC,MAAW,EACXC,QAAgB,EAChB;EACA,QAAQA,QAAQ;IACd;IACA;IACA;IACA;MACE,OACE,CAIID,MAAM,CAAC2C;MAAc,KAAK,IAAI;EAExC;EAEA,OAAO,KAAK;AACd;AAEO,SAASC,cAAcA,CAC5B7C,IAAsB,EACtBC,MAAW,EACXC,QAAgB,EACP;EACT,IAAImC,WAAW,CAACrC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,EAAE,OAAO,IAAI;EAEpD,OACEA,QAAQ,QAA0B,IACjCA,QAAQ,QAAgC,KACtCD,MAAM,CAACkC,SAAS,KAAKnC,IAAI,IAAIC,MAAM,CAACmC,WAAW,KAAKpC,IAAI,CAAE;AAEjE;AAIO,SAAS8C,gBAAgBA,CAC9B9C,IAAwB,EACxBC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,IAAIU,UAAU,CAACpB,IAAI,EAAEC,MAAM,EAAEC,QAAQ,GAAuB,CAAC,EAAE,OAAO,IAAI;EAI1E,OACE,CAACQ,YAAY,GAAGC,mBAAY,CAACoC,yBAAyB,IAAI,CAAC,IAC3D/C,IAAI,CAACwB,QAAQ,KAAK,IAAI;AAE1B;AAEO,SAASwB,iBAAiBA,CAC/BhD,IAAyB,EACzBC,MAAW,EACXC,QAAgB,EACP;EACT,OAAOkB,UAAU,CAACpB,IAAI,EAAEC,MAAM,EAAEC,QAAQ,GAAwB,CAAC;AACnE;AAEO,SAAS+C,kBAAkBA,CAChCjD,IAA0B,EAC1BC,MAAW,EACXC,QAAgB,EACP;EACT,IACEA,QAAQ,QAAiC,IACzCA,QAAQ,QAAsC,IAC7CA,QAAQ,QAA+B,IAAID,MAAM,CAACiD,QAAQ,KAAKlD,IAAK,IACpEE,QAAQ,QAAuC,IAC9CD,MAAM,CAACiD,QAAQ,KAAKlD,IAAK,IAC3BE,QAAQ,QAA8B,EACtC;IACA,OAAO,KAAK;EACd;EACA,IAAIA,QAAQ,OAA+B,EAAE;IAC3C,OAAO,IAAI;EACb;EACA,IAAIA,QAAQ,OAA6B,EAAE;IACzC,OAAOD,MAAM,CAAC2B,KAAK,KAAK5B,IAAI;EAC9B;EACA,IAAIE,QAAQ,OAAuC,EAAE;IACnD,OAAO,IAAI;EACb;EAEA,OAAO,CAACR,WAAW,CAACO,MAAM,CAAC;AAC7B;AAEO,SAASkD,eAAeA,CAC7BnD,IAAuB,EACvBC,MAAW,EACXC,QAAgB,EACP;EACT,OACEA,QAAQ,OAA+B,IACvCA,QAAQ,QAAgC,IACxCA,QAAQ,QAA8B,IACtCA,QAAQ,QAA4B,IACpCE,cAAc,CAACJ,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,IACrCA,QAAQ,MAA8B,IAAIT,iBAAiB,CAACO,IAAI,CAAE,IAClEE,QAAQ,OAAoC,IAAIF,IAAI,KAAKC,MAAM,CAACmD,IAAK,IACtErD,oBAAoB,CAACC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,IAC5CL,kBAAkB,CAACK,QAAQ,CAAC;AAEhC;AAIO,SAASmD,eAAeA,CAC7BrD,IAAuB,EACvBC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,OACE,CAACA,YAAY,IACVC,mBAAY,CAACI,mBAAmB,GAAGJ,mBAAY,CAAC2C,aAAa,CAAC,IACjE,CAAC;AAEL;AAEA,SAASC,SAASA,CAChBvD,IAK0B,EAC1BC,MAAW,EACXC,QAAgB,EACP;EACT,OACEE,cAAc,CAACJ,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,IACrCA,QAAQ,OAA+B,IACtCD,MAAM,CAACuB,QAAQ,KAAK,IAAI,IACxBvB,MAAM,CAAC0B,IAAI,KAAK3B,IAAK,IACvBD,oBAAoB,CAACC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC;AAEhD;AAIO,SAASsD,kBAAkBA,CAChCxD,IAA0B,EAC1BC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,OACE,CAACA,YAAY,IACVC,mBAAY,CAACI,mBAAmB,GAAGJ,mBAAY,CAAC2C,aAAa,CAAC,IACjE,CAAC;AAEL;AAEO,SAASG,qBAAqBA,CACnCzD,IAG0B,EAC1BC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;IACA;IACA;IACA;IACA;MACE,OAAO,IAAI;IACb;MACE,IAAID,MAAM,CAACmD,IAAI,KAAKpD,IAAI,EAAE;QACxB,OAAO,IAAI;MACb;EACJ;EAEA,IAAIH,kBAAkB,CAACK,QAAQ,CAAC,EAAE;IAChC,OAAO,IAAI;EACb;EAEA,OAAOqD,SAAS,CAACvD,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC;AAC1C;AAIO,SAASwD,wBAAwBA,CACtC1D,IAAgC,EAChCC,MAAW,EACXC,QAAgB,EACP;EACT,QAAQA,QAAQ;IACd;MACE,OAAOD,MAAM,CAACK,MAAM,KAAKN,IAAI;IAC/B;MACE,OAAOC,MAAM,CAACI,MAAM,KAAKL,IAAI;EACjC;EACA,OAAO,KAAK;AACd;AAIO,SAAS2D,oBAAoBA,CAClC3D,IAA4B,EAC5BC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACX;EACT,IACEI,+BAA+B,CAACJ,YAAY,CAAC,IAC7CV,IAAI,CAAC2B,IAAI,CAACiC,IAAI,KAAK,eAAe,EAClC;IACA,OAAO,IAAI;EACb;EACA,OAAOH,qBAAqB,CAACzD,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC;AACtD;AAEO,SAAS2D,UAAUA,CACxB7D,IAAkB,EAClBC,MAAW,EACXC,QAAgB,EAChBQ,YAAoB,EACpBoD,gBAAgD,EACvC;EAAA,IAAAC,WAAA;EACT,IAAID,gBAAgB,IAAIA,gBAAgB,CAAC9D,IAAI,CAAC,KAAKA,IAAI,CAACgE,IAAI,EAAE;IAC5D,OAAO,KAAK;EACd;EAIA,IACE9D,QAAQ,MAAmC,KAAA6D,WAAA,GAC3C/D,IAAI,CAACiE,KAAK,aAAVF,WAAA,CAAYG,aAAa,IACzBjE,MAAM,CAAC0B,IAAI,KAAK3B,IAAI,EACpB;IACA,MAAMmE,SAAS,GAAGlE,MAAM,CAAC2B,KAAK,CAACgC,IAAI;IACnC,IACE,CAACO,SAAS,KAAK,oBAAoB,IAAIA,SAAS,KAAK,iBAAiB,KACtElE,MAAM,CAAC2B,KAAK,CAACwC,EAAE,IAAI,IAAI,EACvB;MACA,OAAO,IAAI;IACb;EACF;EAGA,IACE1D,YAAY,GAAGC,mBAAY,CAAC0D,SAAS,IACpC,CAACnE,QAAQ,QAA+B,IACvCA,QAAQ,QAAuC,KAC/CQ,YAAY,IACTC,mBAAY,CAACI,mBAAmB,GAC/BJ,mBAAY,CAAC2D,WAAW,GACxB3D,mBAAY,CAAC4D,SAAS,CAAE,EAC9B;IAGA,IAAIvE,IAAI,CAACgE,IAAI,KAAK,KAAK,EAAE;MAGvB,MAAMQ,mBAAmB,GACvBjF,kBAAkB,CAACU,MAAM,EAAE;QACzBI,MAAM,EAAEL,IAAI;QACZyE,QAAQ,EAAE;MACZ,CAAC,CAAC,IACFjF,0BAA0B,CAACS,MAAM,EAAE;QACjCI,MAAM,EAAEL,IAAI;QACZyE,QAAQ,EAAE,IAAI;QACdC,QAAQ,EAAE;MACZ,CAAC,CAAC;MACJ,IACEF,mBAAmB,IACnB9D,YAAY,IACTC,mBAAY,CAACI,mBAAmB,GAC/BJ,mBAAY,CAAC2D,WAAW,GACxB3D,mBAAY,CAAC4D,SAAS,CAAC,EAC3B;QACA,OAAO,IAAI;MACb;MACA,OAAO,CAAC7D,YAAY,GAAGC,mBAAY,CAAC0D,SAAS,IAAI,CAAC;IACpD;EACF;EAKA,OACEnE,QAAQ,OAA6B,IACrCD,MAAM,CAAC0B,IAAI,KAAK3B,IAAI,IACpBA,IAAI,CAACgE,IAAI,KAAK,OAAO,IACrB,CAAC/D,MAAM,CAAC0E,KAAK;AAEjB","ignoreList":[]}
\ No newline at end of file