UNPKG

less

Version:
333 lines (282 loc) 10.8 kB
/* eslint-disable no-unused-vars */ /** * @todo - Remove unused when JSDoc types are added for visitor methods */ import tree from '../tree/index.js'; import Visitor from './visitor.js'; import mergeRules from '../tree/merge-rules.js'; class CSSVisitorUtils { constructor(context) { this._visitor = new Visitor(this); this._context = context; } containsSilentNonBlockedChild(bodyRules) { let rule; if (!bodyRules) { return false; } for (let r = 0; r < bodyRules.length; r++) { rule = bodyRules[r]; if (rule.isSilent && rule.isSilent(this._context) && !rule.blocksVisibility()) { // the atrule contains something that was referenced (likely by extend) // therefore it needs to be shown in output too return true; } } return false; } keepOnlyVisibleChilds(owner) { if (owner && owner.rules) { owner.rules = owner.rules.filter(thing => thing.isVisible()); } } isEmpty(owner) { return (owner && owner.rules) ? (owner.rules.length === 0) : true; } hasVisibleSelector(rulesetNode) { return (rulesetNode && rulesetNode.paths) ? (rulesetNode.paths.length > 0) : false; } resolveVisibility(node) { if (!node.blocksVisibility()) { if (this.isEmpty(node)) { return ; } return node; } const compiledRulesBody = node.rules[0]; this.keepOnlyVisibleChilds(compiledRulesBody); if (this.isEmpty(compiledRulesBody)) { return ; } node.ensureVisibility(); node.removeVisibilityBlock(); return node; } isVisibleRuleset(rulesetNode) { if (rulesetNode.firstRoot) { return true; } if (this.isEmpty(rulesetNode)) { return false; } if (!rulesetNode.root && !this.hasVisibleSelector(rulesetNode)) { return false; } return true; } } const ToCSSVisitor = function(context) { this._visitor = new Visitor(this); this._context = context; this.utils = new CSSVisitorUtils(context); }; ToCSSVisitor.prototype = { isReplacing: true, run: function (root) { return this._visitor.visit(root); }, visitDeclaration: function (declNode, visitArgs) { if (declNode.blocksVisibility() || declNode.variable) { return; } return declNode; }, visitMixinDefinition: function (mixinNode, visitArgs) { // mixin definitions do not get eval'd - this means they keep state // so we have to clear that state here so it isn't used if toCSS is called twice mixinNode.frames = []; }, visitExtend: function (extendNode, visitArgs) { }, visitComment: function (commentNode, visitArgs) { if (commentNode.blocksVisibility() || commentNode.isSilent(this._context)) { return; } return commentNode; }, visitMedia: function(mediaNode, visitArgs) { const originalRules = mediaNode.rules[0].rules; mediaNode.accept(this._visitor); visitArgs.visitDeeper = false; return this.utils.resolveVisibility(mediaNode, originalRules); }, visitImport: function (importNode, visitArgs) { if (importNode.blocksVisibility()) { return ; } return importNode; }, visitAtRule: function(atRuleNode, visitArgs) { if (atRuleNode.rules && atRuleNode.rules.length) { return this.visitAtRuleWithBody(atRuleNode, visitArgs); } else { return this.visitAtRuleWithoutBody(atRuleNode, visitArgs); } }, visitAnonymous: function(anonymousNode, visitArgs) { if (!anonymousNode.blocksVisibility()) { anonymousNode.accept(this._visitor); return anonymousNode; } }, visitAtRuleWithBody: function(atRuleNode, visitArgs) { // if there is only one nested ruleset and that one has no path, then it is // just fake ruleset function hasFakeRuleset(atRuleNode) { const bodyRules = atRuleNode.rules; return bodyRules.length === 1 && (!bodyRules[0].paths || bodyRules[0].paths.length === 0); } function getBodyRules(atRuleNode) { const nodeRules = atRuleNode.rules; if (hasFakeRuleset(atRuleNode)) { return nodeRules[0].rules; } return nodeRules; } // it is still true that it is only one ruleset in array // this is last such moment // process childs const originalRules = getBodyRules(atRuleNode); atRuleNode.accept(this._visitor); visitArgs.visitDeeper = false; if (!this.utils.isEmpty(atRuleNode)) { this._mergeRules(atRuleNode.rules[0].rules); } return this.utils.resolveVisibility(atRuleNode, originalRules); }, visitAtRuleWithoutBody: function(atRuleNode, visitArgs) { if (atRuleNode.blocksVisibility()) { return; } if (atRuleNode.name === '@charset') { // Only output the debug info together with subsequent @charset definitions // a comment (or @media statement) before the actual @charset atrule would // be considered illegal css as it has to be on the first line if (this.charset) { if (atRuleNode.debugInfo) { const comment = new tree.Comment(`/* ${atRuleNode.toCSS(this._context).replace(/\n/g, '')} */\n`); comment.debugInfo = atRuleNode.debugInfo; return this._visitor.visit(comment); } return; } this.charset = true; } return atRuleNode; }, checkValidNodes: function(rules, isRoot) { if (!rules) { return; } for (let i = 0; i < rules.length; i++) { const ruleNode = rules[i]; if (isRoot && ruleNode instanceof tree.Declaration && !ruleNode.variable) { throw { message: 'Properties must be inside selector blocks. They cannot be in the root', index: ruleNode.getIndex(), filename: ruleNode.fileInfo() && ruleNode.fileInfo().filename}; } if (ruleNode instanceof tree.Call) { throw { message: `Function '${ruleNode.name}' did not return a root node`, index: ruleNode.getIndex(), filename: ruleNode.fileInfo() && ruleNode.fileInfo().filename}; } if (ruleNode.type && !ruleNode.allowRoot) { throw { message: `${ruleNode.type} node returned by a function is not valid here`, index: ruleNode.getIndex(), filename: ruleNode.fileInfo() && ruleNode.fileInfo().filename}; } } }, visitRuleset: function (rulesetNode, visitArgs) { // at this point rulesets are nested into each other let rule; const rulesets = []; this.checkValidNodes(rulesetNode.rules, rulesetNode.firstRoot); if (!rulesetNode.root) { // remove invisible paths this._compileRulesetPaths(rulesetNode); // remove rulesets from this ruleset body and compile them separately const nodeRules = rulesetNode.rules; let nodeRuleCnt = nodeRules ? nodeRules.length : 0; for (let i = 0; i < nodeRuleCnt; ) { rule = nodeRules[i]; if (rule && rule.rules) { // visit because we are moving them out from being a child rulesets.push(this._visitor.visit(rule)); nodeRules.splice(i, 1); nodeRuleCnt--; continue; } i++; } // accept the visitor to remove rules and refactor itself // then we can decide nogw whether we want it or not // compile body if (nodeRuleCnt > 0) { rulesetNode.accept(this._visitor); } else { rulesetNode.rules = null; } visitArgs.visitDeeper = false; } else { // if (! rulesetNode.root) { rulesetNode.accept(this._visitor); visitArgs.visitDeeper = false; } if (rulesetNode.rules) { this._mergeRules(rulesetNode.rules); this._removeDuplicateRules(rulesetNode.rules); } // now decide whether we keep the ruleset if (this.utils.isVisibleRuleset(rulesetNode)) { rulesetNode.ensureVisibility(); rulesets.splice(0, 0, rulesetNode); } if (rulesets.length === 1) { return rulesets[0]; } return rulesets; }, _compileRulesetPaths: function(rulesetNode) { if (rulesetNode.paths) { rulesetNode.paths = rulesetNode.paths .filter(p => { let i; if (p[0].elements[0].combinator.value === ' ') { p[0].elements[0].combinator = new(tree.Combinator)(''); } for (i = 0; i < p.length; i++) { if (p[i].isVisible() && p[i].getIsOutput()) { return true; } } return false; }); } }, _removeDuplicateRules: function(rules) { if (!rules) { return; } // remove duplicates const ruleCache = {}; for (let i = rules.length - 1; i >= 0 ; i--) { let rule = rules[i]; if (rule instanceof tree.Declaration) { if (!Object.prototype.hasOwnProperty.call(ruleCache, rule.name)) { ruleCache[rule.name] = rule; } else { let ruleList = ruleCache[rule.name]; if (!Array.isArray(ruleList)) { const prevRuleCSS = ruleList.toCSS(this._context); ruleList = ruleCache[rule.name] = [prevRuleCSS]; } const ruleCSS = rule.toCSS(this._context); if (ruleList.indexOf(ruleCSS) !== -1) { rules.splice(i, 1); } else { ruleList.push(ruleCSS); } } } } }, _mergeRules: mergeRules }; export default ToCSSVisitor;