restructure.js 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388
  1. var canReorderSingle = require('./reorderable').canReorderSingle;
  2. var extractProperties = require('./extract-properties');
  3. var isMergeable = require('./is-mergeable');
  4. var tidyRuleDuplicates = require('./tidy-rule-duplicates');
  5. var Token = require('../../tokenizer/token');
  6. var cloneArray = require('../../utils/clone-array');
  7. var serializeBody = require('../../writer/one-time').body;
  8. var serializeRules = require('../../writer/one-time').rules;
  9. function naturalSorter(a, b) {
  10. return a > b ? 1 : -1;
  11. }
  12. function cloneAndMergeSelectors(propertyA, propertyB) {
  13. var cloned = cloneArray(propertyA);
  14. cloned[5] = cloned[5].concat(propertyB[5]);
  15. return cloned;
  16. }
  17. function restructure(tokens, context) {
  18. var options = context.options;
  19. var mergeablePseudoClasses = options.compatibility.selectors.mergeablePseudoClasses;
  20. var mergeablePseudoElements = options.compatibility.selectors.mergeablePseudoElements;
  21. var mergeLimit = 8191;
  22. var specificityCache = context.cache.specificity;
  23. var movableTokens = {};
  24. var movedProperties = [];
  25. var multiPropertyMoveCache = {};
  26. var movedToBeDropped = [];
  27. var maxCombinationsLevel = 2;
  28. var ID_JOIN_CHARACTER = '%';
  29. function sendToMultiPropertyMoveCache(position, movedProperty, allFits) {
  30. for (var i = allFits.length - 1; i >= 0; i--) {
  31. var fit = allFits[i][0];
  32. var id = addToCache(movedProperty, fit);
  33. if (multiPropertyMoveCache[id].length > 1 && processMultiPropertyMove(position, multiPropertyMoveCache[id])) {
  34. removeAllMatchingFromCache(id);
  35. break;
  36. }
  37. }
  38. }
  39. function addToCache(movedProperty, fit) {
  40. var id = cacheId(fit);
  41. multiPropertyMoveCache[id] = multiPropertyMoveCache[id] || [];
  42. multiPropertyMoveCache[id].push([movedProperty, fit]);
  43. return id;
  44. }
  45. function removeAllMatchingFromCache(matchId) {
  46. var matchSelectors = matchId.split(ID_JOIN_CHARACTER);
  47. var forRemoval = [];
  48. var i;
  49. for (var id in multiPropertyMoveCache) {
  50. var selectors = id.split(ID_JOIN_CHARACTER);
  51. for (i = selectors.length - 1; i >= 0; i--) {
  52. if (matchSelectors.indexOf(selectors[i]) > -1) {
  53. forRemoval.push(id);
  54. break;
  55. }
  56. }
  57. }
  58. for (i = forRemoval.length - 1; i >= 0; i--) {
  59. delete multiPropertyMoveCache[forRemoval[i]];
  60. }
  61. }
  62. function cacheId(cachedTokens) {
  63. var id = [];
  64. for (var i = 0, l = cachedTokens.length; i < l; i++) {
  65. id.push(serializeRules(cachedTokens[i][1]));
  66. }
  67. return id.join(ID_JOIN_CHARACTER);
  68. }
  69. function tokensToMerge(sourceTokens) {
  70. var uniqueTokensWithBody = [];
  71. var mergeableTokens = [];
  72. for (var i = sourceTokens.length - 1; i >= 0; i--) {
  73. if (!isMergeable(serializeRules(sourceTokens[i][1]), mergeablePseudoClasses, mergeablePseudoElements)) {
  74. continue;
  75. }
  76. mergeableTokens.unshift(sourceTokens[i]);
  77. if (sourceTokens[i][2].length > 0 && uniqueTokensWithBody.indexOf(sourceTokens[i]) == -1)
  78. uniqueTokensWithBody.push(sourceTokens[i]);
  79. }
  80. return uniqueTokensWithBody.length > 1 ?
  81. mergeableTokens :
  82. [];
  83. }
  84. function shortenIfPossible(position, movedProperty) {
  85. var name = movedProperty[0];
  86. var value = movedProperty[1];
  87. var key = movedProperty[4];
  88. var valueSize = name.length + value.length + 1;
  89. var allSelectors = [];
  90. var qualifiedTokens = [];
  91. var mergeableTokens = tokensToMerge(movableTokens[key]);
  92. if (mergeableTokens.length < 2)
  93. return;
  94. var allFits = findAllFits(mergeableTokens, valueSize, 1);
  95. var bestFit = allFits[0];
  96. if (bestFit[1] > 0)
  97. return sendToMultiPropertyMoveCache(position, movedProperty, allFits);
  98. for (var i = bestFit[0].length - 1; i >=0; i--) {
  99. allSelectors = bestFit[0][i][1].concat(allSelectors);
  100. qualifiedTokens.unshift(bestFit[0][i]);
  101. }
  102. allSelectors = tidyRuleDuplicates(allSelectors);
  103. dropAsNewTokenAt(position, [movedProperty], allSelectors, qualifiedTokens);
  104. }
  105. function fitSorter(fit1, fit2) {
  106. return fit1[1] > fit2[1] ? 1 : (fit1[1] == fit2[1] ? 0 : -1);
  107. }
  108. function findAllFits(mergeableTokens, propertySize, propertiesCount) {
  109. var combinations = allCombinations(mergeableTokens, propertySize, propertiesCount, maxCombinationsLevel - 1);
  110. return combinations.sort(fitSorter);
  111. }
  112. function allCombinations(tokensVariant, propertySize, propertiesCount, level) {
  113. var differenceVariants = [[tokensVariant, sizeDifference(tokensVariant, propertySize, propertiesCount)]];
  114. if (tokensVariant.length > 2 && level > 0) {
  115. for (var i = tokensVariant.length - 1; i >= 0; i--) {
  116. var subVariant = Array.prototype.slice.call(tokensVariant, 0);
  117. subVariant.splice(i, 1);
  118. differenceVariants = differenceVariants.concat(allCombinations(subVariant, propertySize, propertiesCount, level - 1));
  119. }
  120. }
  121. return differenceVariants;
  122. }
  123. function sizeDifference(tokensVariant, propertySize, propertiesCount) {
  124. var allSelectorsSize = 0;
  125. for (var i = tokensVariant.length - 1; i >= 0; i--) {
  126. allSelectorsSize += tokensVariant[i][2].length > propertiesCount ? serializeRules(tokensVariant[i][1]).length : -1;
  127. }
  128. return allSelectorsSize - (tokensVariant.length - 1) * propertySize + 1;
  129. }
  130. function dropAsNewTokenAt(position, properties, allSelectors, mergeableTokens) {
  131. var i, j, k, m;
  132. var allProperties = [];
  133. for (i = mergeableTokens.length - 1; i >= 0; i--) {
  134. var mergeableToken = mergeableTokens[i];
  135. for (j = mergeableToken[2].length - 1; j >= 0; j--) {
  136. var mergeableProperty = mergeableToken[2][j];
  137. for (k = 0, m = properties.length; k < m; k++) {
  138. var property = properties[k];
  139. var mergeablePropertyName = mergeableProperty[1][1];
  140. var propertyName = property[0];
  141. var propertyBody = property[4];
  142. if (mergeablePropertyName == propertyName && serializeBody([mergeableProperty]) == propertyBody) {
  143. mergeableToken[2].splice(j, 1);
  144. break;
  145. }
  146. }
  147. }
  148. }
  149. for (i = properties.length - 1; i >= 0; i--) {
  150. allProperties.unshift(properties[i][3]);
  151. }
  152. var newToken = [Token.RULE, allSelectors, allProperties];
  153. tokens.splice(position, 0, newToken);
  154. }
  155. function dropPropertiesAt(position, movedProperty) {
  156. var key = movedProperty[4];
  157. var toMove = movableTokens[key];
  158. if (toMove && toMove.length > 1) {
  159. if (!shortenMultiMovesIfPossible(position, movedProperty))
  160. shortenIfPossible(position, movedProperty);
  161. }
  162. }
  163. function shortenMultiMovesIfPossible(position, movedProperty) {
  164. var candidates = [];
  165. var propertiesAndMergableTokens = [];
  166. var key = movedProperty[4];
  167. var j, k;
  168. var mergeableTokens = tokensToMerge(movableTokens[key]);
  169. if (mergeableTokens.length < 2)
  170. return;
  171. movableLoop:
  172. for (var value in movableTokens) {
  173. var tokensList = movableTokens[value];
  174. for (j = mergeableTokens.length - 1; j >= 0; j--) {
  175. if (tokensList.indexOf(mergeableTokens[j]) == -1)
  176. continue movableLoop;
  177. }
  178. candidates.push(value);
  179. }
  180. if (candidates.length < 2)
  181. return false;
  182. for (j = candidates.length - 1; j >= 0; j--) {
  183. for (k = movedProperties.length - 1; k >= 0; k--) {
  184. if (movedProperties[k][4] == candidates[j]) {
  185. propertiesAndMergableTokens.unshift([movedProperties[k], mergeableTokens]);
  186. break;
  187. }
  188. }
  189. }
  190. return processMultiPropertyMove(position, propertiesAndMergableTokens);
  191. }
  192. function processMultiPropertyMove(position, propertiesAndMergableTokens) {
  193. var valueSize = 0;
  194. var properties = [];
  195. var property;
  196. for (var i = propertiesAndMergableTokens.length - 1; i >= 0; i--) {
  197. property = propertiesAndMergableTokens[i][0];
  198. var fullValue = property[4];
  199. valueSize += fullValue.length + (i > 0 ? 1 : 0);
  200. properties.push(property);
  201. }
  202. var mergeableTokens = propertiesAndMergableTokens[0][1];
  203. var bestFit = findAllFits(mergeableTokens, valueSize, properties.length)[0];
  204. if (bestFit[1] > 0)
  205. return false;
  206. var allSelectors = [];
  207. var qualifiedTokens = [];
  208. for (i = bestFit[0].length - 1; i >= 0; i--) {
  209. allSelectors = bestFit[0][i][1].concat(allSelectors);
  210. qualifiedTokens.unshift(bestFit[0][i]);
  211. }
  212. allSelectors = tidyRuleDuplicates(allSelectors);
  213. dropAsNewTokenAt(position, properties, allSelectors, qualifiedTokens);
  214. for (i = properties.length - 1; i >= 0; i--) {
  215. property = properties[i];
  216. var index = movedProperties.indexOf(property);
  217. delete movableTokens[property[4]];
  218. if (index > -1 && movedToBeDropped.indexOf(index) == -1)
  219. movedToBeDropped.push(index);
  220. }
  221. return true;
  222. }
  223. function boundToAnotherPropertyInCurrrentToken(property, movedProperty, token) {
  224. var propertyName = property[0];
  225. var movedPropertyName = movedProperty[0];
  226. if (propertyName != movedPropertyName)
  227. return false;
  228. var key = movedProperty[4];
  229. var toMove = movableTokens[key];
  230. return toMove && toMove.indexOf(token) > -1;
  231. }
  232. for (var i = tokens.length - 1; i >= 0; i--) {
  233. var token = tokens[i];
  234. var isRule;
  235. var j, k, m;
  236. var samePropertyAt;
  237. if (token[0] == Token.RULE) {
  238. isRule = true;
  239. } else if (token[0] == Token.NESTED_BLOCK) {
  240. isRule = false;
  241. } else {
  242. continue;
  243. }
  244. // We cache movedProperties.length as it may change in the loop
  245. var movedCount = movedProperties.length;
  246. var properties = extractProperties(token);
  247. movedToBeDropped = [];
  248. var unmovableInCurrentToken = [];
  249. for (j = properties.length - 1; j >= 0; j--) {
  250. for (k = j - 1; k >= 0; k--) {
  251. if (!canReorderSingle(properties[j], properties[k], specificityCache)) {
  252. unmovableInCurrentToken.push(j);
  253. break;
  254. }
  255. }
  256. }
  257. for (j = properties.length - 1; j >= 0; j--) {
  258. var property = properties[j];
  259. var movedSameProperty = false;
  260. for (k = 0; k < movedCount; k++) {
  261. var movedProperty = movedProperties[k];
  262. if (movedToBeDropped.indexOf(k) == -1 && (!canReorderSingle(property, movedProperty, specificityCache) && !boundToAnotherPropertyInCurrrentToken(property, movedProperty, token) ||
  263. movableTokens[movedProperty[4]] && movableTokens[movedProperty[4]].length === mergeLimit)) {
  264. dropPropertiesAt(i + 1, movedProperty, token);
  265. if (movedToBeDropped.indexOf(k) == -1) {
  266. movedToBeDropped.push(k);
  267. delete movableTokens[movedProperty[4]];
  268. }
  269. }
  270. if (!movedSameProperty) {
  271. movedSameProperty = property[0] == movedProperty[0] && property[1] == movedProperty[1];
  272. if (movedSameProperty) {
  273. samePropertyAt = k;
  274. }
  275. }
  276. }
  277. if (!isRule || unmovableInCurrentToken.indexOf(j) > -1)
  278. continue;
  279. var key = property[4];
  280. if (movedSameProperty && movedProperties[samePropertyAt][5].length + property[5].length > mergeLimit) {
  281. dropPropertiesAt(i + 1, movedProperties[samePropertyAt]);
  282. movedProperties.splice(samePropertyAt, 1);
  283. movableTokens[key] = [token];
  284. movedSameProperty = false;
  285. } else {
  286. movableTokens[key] = movableTokens[key] || [];
  287. movableTokens[key].push(token);
  288. }
  289. if (movedSameProperty) {
  290. movedProperties[samePropertyAt] = cloneAndMergeSelectors(movedProperties[samePropertyAt], property);
  291. } else {
  292. movedProperties.push(property);
  293. }
  294. }
  295. movedToBeDropped = movedToBeDropped.sort(naturalSorter);
  296. for (j = 0, m = movedToBeDropped.length; j < m; j++) {
  297. var dropAt = movedToBeDropped[j] - j;
  298. movedProperties.splice(dropAt, 1);
  299. }
  300. }
  301. var position = tokens[0] && tokens[0][0] == Token.AT_RULE && tokens[0][1].indexOf('@charset') === 0 ? 1 : 0;
  302. for (; position < tokens.length - 1; position++) {
  303. var isImportRule = tokens[position][0] === Token.AT_RULE && tokens[position][1].indexOf('@import') === 0;
  304. var isComment = tokens[position][0] === Token.COMMENT;
  305. if (!(isImportRule || isComment))
  306. break;
  307. }
  308. for (i = 0; i < movedProperties.length; i++) {
  309. dropPropertiesAt(position, movedProperties[i]);
  310. }
  311. }
  312. module.exports = restructure;