whitespace.js 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. "use strict";
  2. Object.defineProperty(exports, "__esModule", {
  3. value: true
  4. });
  5. exports.list = exports.nodes = void 0;
  6. function t() {
  7. const data = _interopRequireWildcard(require("@babel/types"));
  8. t = function () {
  9. return data;
  10. };
  11. return data;
  12. }
  13. function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
  14. function crawl(node, state = {}) {
  15. if (t().isMemberExpression(node)) {
  16. crawl(node.object, state);
  17. if (node.computed) crawl(node.property, state);
  18. } else if (t().isBinary(node) || t().isAssignmentExpression(node)) {
  19. crawl(node.left, state);
  20. crawl(node.right, state);
  21. } else if (t().isCallExpression(node)) {
  22. state.hasCall = true;
  23. crawl(node.callee, state);
  24. } else if (t().isFunction(node)) {
  25. state.hasFunction = true;
  26. } else if (t().isIdentifier(node)) {
  27. state.hasHelper = state.hasHelper || isHelper(node.callee);
  28. }
  29. return state;
  30. }
  31. function isHelper(node) {
  32. if (t().isMemberExpression(node)) {
  33. return isHelper(node.object) || isHelper(node.property);
  34. } else if (t().isIdentifier(node)) {
  35. return node.name === "require" || node.name[0] === "_";
  36. } else if (t().isCallExpression(node)) {
  37. return isHelper(node.callee);
  38. } else if (t().isBinary(node) || t().isAssignmentExpression(node)) {
  39. return t().isIdentifier(node.left) && isHelper(node.left) || isHelper(node.right);
  40. } else {
  41. return false;
  42. }
  43. }
  44. function isType(node) {
  45. return t().isLiteral(node) || t().isObjectExpression(node) || t().isArrayExpression(node) || t().isIdentifier(node) || t().isMemberExpression(node);
  46. }
  47. const nodes = {
  48. AssignmentExpression(node) {
  49. const state = crawl(node.right);
  50. if (state.hasCall && state.hasHelper || state.hasFunction) {
  51. return {
  52. before: state.hasFunction,
  53. after: true
  54. };
  55. }
  56. },
  57. SwitchCase(node, parent) {
  58. return {
  59. before: node.consequent.length || parent.cases[0] === node,
  60. after: !node.consequent.length && parent.cases[parent.cases.length - 1] === node
  61. };
  62. },
  63. LogicalExpression(node) {
  64. if (t().isFunction(node.left) || t().isFunction(node.right)) {
  65. return {
  66. after: true
  67. };
  68. }
  69. },
  70. Literal(node) {
  71. if (node.value === "use strict") {
  72. return {
  73. after: true
  74. };
  75. }
  76. },
  77. CallExpression(node) {
  78. if (t().isFunction(node.callee) || isHelper(node)) {
  79. return {
  80. before: true,
  81. after: true
  82. };
  83. }
  84. },
  85. VariableDeclaration(node) {
  86. for (let i = 0; i < node.declarations.length; i++) {
  87. const declar = node.declarations[i];
  88. let enabled = isHelper(declar.id) && !isType(declar.init);
  89. if (!enabled) {
  90. const state = crawl(declar.init);
  91. enabled = isHelper(declar.init) && state.hasCall || state.hasFunction;
  92. }
  93. if (enabled) {
  94. return {
  95. before: true,
  96. after: true
  97. };
  98. }
  99. }
  100. },
  101. IfStatement(node) {
  102. if (t().isBlockStatement(node.consequent)) {
  103. return {
  104. before: true,
  105. after: true
  106. };
  107. }
  108. }
  109. };
  110. exports.nodes = nodes;
  111. nodes.ObjectProperty = nodes.ObjectTypeProperty = nodes.ObjectMethod = function (node, parent) {
  112. if (parent.properties[0] === node) {
  113. return {
  114. before: true
  115. };
  116. }
  117. };
  118. nodes.ObjectTypeCallProperty = function (node, parent) {
  119. if (parent.callProperties[0] === node && (!parent.properties || !parent.properties.length)) {
  120. return {
  121. before: true
  122. };
  123. }
  124. };
  125. nodes.ObjectTypeIndexer = function (node, parent) {
  126. if (parent.indexers[0] === node && (!parent.properties || !parent.properties.length) && (!parent.callProperties || !parent.callProperties.length)) {
  127. return {
  128. before: true
  129. };
  130. }
  131. };
  132. nodes.ObjectTypeInternalSlot = function (node, parent) {
  133. if (parent.internalSlots[0] === node && (!parent.properties || !parent.properties.length) && (!parent.callProperties || !parent.callProperties.length) && (!parent.indexers || !parent.indexers.length)) {
  134. return {
  135. before: true
  136. };
  137. }
  138. };
  139. const list = {
  140. VariableDeclaration(node) {
  141. return node.declarations.map(decl => decl.init);
  142. },
  143. ArrayExpression(node) {
  144. return node.elements;
  145. },
  146. ObjectExpression(node) {
  147. return node.properties;
  148. }
  149. };
  150. exports.list = list;
  151. [["Function", true], ["Class", true], ["Loop", true], ["LabeledStatement", true], ["SwitchStatement", true], ["TryStatement", true]].forEach(function ([type, amounts]) {
  152. if (typeof amounts === "boolean") {
  153. amounts = {
  154. after: amounts,
  155. before: amounts
  156. };
  157. }
  158. [type].concat(t().FLIPPED_ALIAS_KEYS[type] || []).forEach(function (type) {
  159. nodes[type] = function () {
  160. return amounts;
  161. };
  162. });
  163. });