2020-10-20 05:15:30 +00:00

294 lines
10 KiB
JavaScript

"use strict";
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.default = applyComplexClasses;
var _lodash = _interopRequireDefault(require("lodash"));
var _postcssSelectorParser = _interopRequireDefault(require("postcss-selector-parser"));
var _postcss = _interopRequireDefault(require("postcss"));
var _substituteTailwindAtRules = _interopRequireDefault(require("../lib/substituteTailwindAtRules"));
var _evaluateTailwindFunctions = _interopRequireDefault(require("../lib/evaluateTailwindFunctions"));
var _substituteVariantsAtRules = _interopRequireDefault(require("../lib/substituteVariantsAtRules"));
var _substituteResponsiveAtRules = _interopRequireDefault(require("../lib/substituteResponsiveAtRules"));
var _convertLayerAtRulesToControlComments = _interopRequireDefault(require("../lib/convertLayerAtRulesToControlComments"));
var _substituteScreenAtRules = _interopRequireDefault(require("../lib/substituteScreenAtRules"));
var _prefixSelector = _interopRequireDefault(require("../util/prefixSelector"));
var _useMemo = require("../util/useMemo");
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
function hasAtRule(css, atRule) {
let foundAtRule = false;
css.walkAtRules(atRule, () => {
foundAtRule = true;
return false;
});
return foundAtRule;
}
function cloneWithoutChildren(node) {
if (node.type === 'atrule') {
return _postcss.default.atRule({
name: node.name,
params: node.params
});
}
if (node.type === 'rule') {
return _postcss.default.rule({
name: node.name,
selectors: node.selectors
});
}
const clone = node.clone();
clone.removeAll();
return clone;
}
const tailwindApplyPlaceholder = _postcssSelectorParser.default.attribute({
attribute: '__TAILWIND-APPLY-PLACEHOLDER__'
});
function generateRulesFromApply({
rule,
utilityName: className,
classPosition
}, replaceWiths) {
const parser = (0, _postcssSelectorParser.default)(selectors => {
let i = 0;
selectors.walkClasses(c => {
if (classPosition === i++ && c.value === className) {
c.replaceWith(tailwindApplyPlaceholder);
}
});
});
const processedSelectors = _lodash.default.flatMap(rule.selectors, selector => {
// You could argue we should make this replacement at the AST level, but if we believe
// the placeholder string is safe from collisions then it is safe to do this is a simple
// string replacement, and much, much faster.
return replaceWiths.map(replaceWith => parser.processSync(selector).replace('[__TAILWIND-APPLY-PLACEHOLDER__]', replaceWith));
});
const cloned = rule.clone();
let current = cloned;
let parent = rule.parent;
while (parent && parent.type !== 'root') {
const parentClone = cloneWithoutChildren(parent);
parentClone.append(current);
current.parent = parentClone;
current = parentClone;
parent = parent.parent;
}
cloned.selectors = processedSelectors;
return current;
}
const extractUtilityNamesParser = (0, _postcssSelectorParser.default)(selectors => {
let classes = [];
selectors.walkClasses(c => classes.push(c.value));
return classes;
});
const extractUtilityNames = (0, _useMemo.useMemo)(selector => extractUtilityNamesParser.transformSync(selector), selector => selector);
const cloneRuleWithParent = (0, _useMemo.useMemo)(rule => rule.clone({
parent: rule.parent
}), rule => rule);
function buildUtilityMap(css, lookupTree) {
let index = 0;
const utilityMap = {};
function handle(rule) {
const utilityNames = extractUtilityNames(rule.selector);
utilityNames.forEach((utilityName, i) => {
if (utilityMap[utilityName] === undefined) {
utilityMap[utilityName] = [];
}
utilityMap[utilityName].push({
index,
utilityName,
classPosition: i,
get rule() {
return cloneRuleWithParent(rule);
}
});
index++;
});
}
lookupTree.walkRules(handle);
css.walkRules(handle);
return utilityMap;
}
function mergeAdjacentRules(initialRule, rulesToInsert) {
let previousRule = initialRule;
rulesToInsert.forEach(toInsert => {
if (toInsert.type === 'rule' && previousRule.type === 'rule' && toInsert.selector === previousRule.selector) {
previousRule.append(toInsert.nodes);
} else if (toInsert.type === 'atrule' && previousRule.type === 'atrule' && toInsert.params === previousRule.params) {
const merged = mergeAdjacentRules(previousRule.nodes[previousRule.nodes.length - 1], toInsert.nodes);
previousRule.append(merged);
} else {
previousRule = toInsert;
}
toInsert.walk(n => {
if (n.nodes && n.nodes.length === 0) {
n.remove();
}
});
});
return rulesToInsert.filter(r => r.nodes.length > 0);
}
function makeExtractUtilityRules(css, lookupTree, config) {
const utilityMap = buildUtilityMap(css, lookupTree);
return function extractUtilityRules(utilityNames, rule) {
const combined = [];
utilityNames.forEach(utilityName => {
if (utilityMap[utilityName] === undefined) {
// Look for prefixed utility in case the user has goofed
const prefixedUtility = (0, _prefixSelector.default)(config.prefix, `.${utilityName}`).slice(1);
if (utilityMap[prefixedUtility] !== undefined) {
throw rule.error(`The \`${utilityName}\` class does not exist, but \`${prefixedUtility}\` does. Did you forget the prefix?`);
}
throw rule.error(`The \`${utilityName}\` class does not exist. If you're sure that \`${utilityName}\` exists, make sure that any \`@import\` statements are being properly processed before Tailwind CSS sees your CSS, as \`@apply\` can only be used for classes in the same CSS tree.`, {
word: utilityName
});
}
combined.push(...utilityMap[utilityName]);
});
return combined.sort((a, b) => a.index - b.index);
};
}
function findParent(rule, predicate) {
let parent = rule.parent;
while (parent) {
if (predicate(parent)) {
return parent;
}
parent = parent.parent;
}
throw new Error('No parent could be found');
}
function processApplyAtRules(css, lookupTree, config) {
const extractUtilityRules = makeExtractUtilityRules(css, lookupTree, config);
do {
css.walkAtRules('apply', applyRule => {
const parent = applyRule.parent; // Direct parent
const nearestParentRule = findParent(applyRule, r => r.type === 'rule');
const currentUtilityNames = extractUtilityNames(nearestParentRule.selector);
const [importantEntries, applyUtilityNames, important = importantEntries.length > 0] = _lodash.default.partition(applyRule.params.split(/[\s\t\n]+/g), n => n === '!important');
if (_lodash.default.intersection(applyUtilityNames, currentUtilityNames).length > 0) {
const currentUtilityName = _lodash.default.intersection(applyUtilityNames, currentUtilityNames)[0];
throw parent.error(`You cannot \`@apply\` the \`${currentUtilityName}\` utility here because it creates a circular dependency.`);
} // Extract any post-apply declarations and re-insert them after apply rules
const afterRule = parent.clone({
raws: {}
});
afterRule.nodes = afterRule.nodes.slice(parent.index(applyRule) + 1);
parent.nodes = parent.nodes.slice(0, parent.index(applyRule) + 1); // Sort applys to match CSS source order
const applys = extractUtilityRules(applyUtilityNames, applyRule); // Get new rules with the utility portion of the selector replaced with the new selector
const rulesToInsert = [];
applys.forEach(nearestParentRule === parent ? util => rulesToInsert.push(generateRulesFromApply(util, parent.selectors)) : util => util.rule.nodes.forEach(n => afterRule.append(n.clone())));
const {
nodes
} = _lodash.default.tap(_postcss.default.root({
nodes: rulesToInsert
}), root => root.walkDecls(d => {
d.important = important;
}));
const mergedRules = mergeAdjacentRules(nearestParentRule, [...nodes, afterRule]);
applyRule.remove();
parent.after(mergedRules); // If the base rule has nothing in it (all applys were pseudo or responsive variants),
// remove the rule fuggit.
if (parent.nodes.length === 0) {
parent.remove();
}
}); // We already know that we have at least 1 @apply rule. Otherwise this
// function would not have been called. Therefore we can execute this code
// at least once. This also means that in the best case scenario we only
// call this 2 times, instead of 3 times.
// 1st time -> before we call this function
// 2nd time -> when we check if we have to do this loop again (because do {} while (check))
// .. instead of
// 1st time -> before we call this function
// 2nd time -> when we check the first time (because while (check) do {})
// 3rd time -> when we re-check to see if we should do this loop again
} while (hasAtRule(css, 'apply'));
return css;
}
let defaultTailwindTree = null;
function applyComplexClasses(config, getProcessedPlugins, configChanged) {
return function (css) {
// We can stop already when we don't have any @apply rules. Vue users: you're welcome!
if (!hasAtRule(css, 'apply')) {
return css;
} // Tree already contains @tailwind rules, don't prepend default Tailwind tree
if (hasAtRule(css, 'tailwind')) {
return processApplyAtRules(css, _postcss.default.root(), config);
} // Tree contains no @tailwind rules, so generate all of Tailwind's styles and
// prepend them to the user's CSS. Important for <style> blocks in Vue components.
const generateLookupTree = configChanged || defaultTailwindTree === null ? () => {
return (0, _postcss.default)([(0, _substituteTailwindAtRules.default)(config, getProcessedPlugins()), (0, _evaluateTailwindFunctions.default)(config), (0, _substituteVariantsAtRules.default)(config, getProcessedPlugins()), (0, _substituteResponsiveAtRules.default)(config), (0, _convertLayerAtRulesToControlComments.default)(config), (0, _substituteScreenAtRules.default)(config)]).process(`
@tailwind base;
@tailwind components;
@tailwind utilities;
`, {
from: undefined
}).then(result => {
defaultTailwindTree = result;
return defaultTailwindTree;
});
} : () => Promise.resolve(defaultTailwindTree);
return generateLookupTree().then(result => {
return processApplyAtRules(css, result.root, config);
});
};
}