You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

259 lines
9.5 KiB
JavaScript

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
const utils_1 = require("../utils");
const ast_utils_1 = require("../utils/ast-utils");
const regexp_1 = require("../utils/regexp");
const compat_1 = require("../utils/compat");
const DEFAULT_ORDER = [
'this',
'bind:this',
'id',
'name',
'slot',
{ match: '/^--/u', sort: 'alphabetical' },
['style', '/^style:/u'],
'class',
{ match: '/^class:/u', sort: 'alphabetical' },
{
match: ['!/:/u', '!/^(?:this|id|name|style|class)$/u', '!/^--/u'],
sort: 'alphabetical'
},
['/^bind:/u', '!bind:this', '/^on:/u'],
{ match: '/^use:/u', sort: 'alphabetical' },
{ match: '/^transition:/u', sort: 'alphabetical' },
{ match: '/^in:/u', sort: 'alphabetical' },
{ match: '/^out:/u', sort: 'alphabetical' },
{ match: '/^animate:/u', sort: 'alphabetical' },
{ match: '/^let:/u', sort: 'alphabetical' }
];
function parseOption(option) {
const order = option?.order ?? DEFAULT_ORDER;
const compiled = order.map(compileOption);
return {
ignore: (key) => {
return !compiled.some((c) => c.match(key));
},
compare: (a, b) => {
for (const c of compiled) {
const matchA = c.match(a);
const matchB = c.match(b);
if (matchA && matchB) {
if (c.sort === 'alphabetical') {
return a === b ? 0 : a < b ? -1 : 1;
}
return 0;
}
if (matchA) {
return -1;
}
if (matchB) {
return 1;
}
}
throw new Error('Illegal state');
}
};
}
function compileOption(option) {
const cache = {};
const compiled = compileOptionWithoutCache(option);
return {
match: (str) => {
if (cache[str] != null)
return cache[str];
return (cache[str] = compiled.match(str));
},
sort: compiled.sort
};
function compileOptionWithoutCache(option) {
if (typeof option === 'string') {
const match = compileMatcher([option]);
return { match, sort: 'ignore' };
}
if (Array.isArray(option)) {
const match = compileMatcher(option);
return { match, sort: 'ignore' };
}
const { match } = compileOptionWithoutCache(option.match);
return { match, sort: option.sort || 'ignore' };
}
}
function compileMatcher(pattern) {
const rules = [];
for (const p of pattern) {
let negative, patternStr;
if (p.startsWith('!')) {
negative = true;
patternStr = p.substring(1);
}
else {
negative = false;
patternStr = p;
}
const regex = (0, regexp_1.toRegExp)(patternStr);
rules.push({ negative, match: (str) => regex.test(str) });
}
return (str) => {
let result = Boolean(rules[0]?.negative);
for (const { negative, match } of rules) {
if (result === !negative) {
continue;
}
if (match(str)) {
result = !negative;
}
}
return result;
};
}
exports.default = (0, utils_1.createRule)('sort-attributes', {
meta: {
docs: {
description: 'enforce order of attributes',
category: 'Stylistic Issues',
recommended: false,
conflictWithPrettier: false
},
schema: [
{
type: 'object',
properties: {
order: {
type: 'array',
items: {
anyOf: [
{ type: 'string' },
{
type: 'array',
items: {
type: 'string'
},
uniqueItems: true,
minItems: 1
},
{
type: 'object',
properties: {
match: {
anyOf: [
{ type: 'string' },
{
type: 'array',
items: {
type: 'string'
},
uniqueItems: true,
minItems: 1
}
]
},
sort: {
enum: ['alphabetical', 'ignore']
}
},
required: ['match', 'sort'],
additionalProperties: false
}
]
},
uniqueItems: true,
additionalItems: false
},
alphabetical: { type: 'boolean' }
},
additionalProperties: false
}
],
messages: {
shouldBefore: "Attribute '{{currentKey}}' should go before '{{prevKey}}'."
},
type: 'layout',
fixable: 'code'
},
create(context) {
const option = parseOption(context.options[0]);
const cacheKeyText = new Map();
function getKeyText(node) {
const k = cacheKeyText.get(node);
if (k != null)
return k;
const result = (0, ast_utils_1.getAttributeKeyText)(node, context);
cacheKeyText.set(node, result);
return result;
}
function report(node, previousNode) {
const currentKey = getKeyText(node);
const prevKey = getKeyText(previousNode);
context.report({
node,
messageId: 'shouldBefore',
data: {
currentKey,
prevKey
},
fix(fixer) {
const attributes = node.parent.attributes;
const previousNodes = attributes.slice(attributes.indexOf(previousNode), attributes.indexOf(node));
const moveNodes = [node, ...previousNodes];
const sourceCode = (0, compat_1.getSourceCode)(context);
return moveNodes.map((moveNode, index) => {
const text = sourceCode.getText(moveNode);
return fixer.replaceText(previousNodes[index] || node, text);
});
}
});
}
function hasSpreadAttribute(node, previousNode) {
const attributes = node.parent.attributes;
const previousNodes = attributes.slice(attributes.indexOf(previousNode), attributes.indexOf(node));
return previousNodes.some((a) => a.type === 'SvelteSpreadAttribute');
}
function verifyForSpreadAttributeExist(node) {
const previousNodes = [];
const attributes = node.parent.attributes;
for (const previousNode of attributes.slice(0, attributes.indexOf(node)).reverse()) {
if (previousNode.type === 'SvelteSpreadAttribute') {
break;
}
previousNodes.unshift(previousNode);
}
const key = getKeyText(node);
const invalidPreviousNode = previousNodes.find((previousNode) => {
const prevKey = getKeyText(previousNode);
if (option.ignore(prevKey)) {
return false;
}
return option.compare(prevKey, key) > 0;
});
if (invalidPreviousNode) {
report(node, invalidPreviousNode);
}
}
return {
SvelteStartTag(node) {
const validPreviousNodes = [];
for (const attr of node.attributes) {
if (attr.type === 'SvelteSpreadAttribute') {
continue;
}
const key = getKeyText(attr);
if (option.ignore(key)) {
continue;
}
const invalidPreviousNode = validPreviousNodes.find((previousNode) => option.compare(getKeyText(previousNode), key) > 0);
if (invalidPreviousNode) {
if (attr.type !== 'SvelteAttribute' || !hasSpreadAttribute(attr, invalidPreviousNode)) {
report(attr, invalidPreviousNode);
}
else {
verifyForSpreadAttributeExist(attr);
}
continue;
}
validPreviousNodes.push(attr);
}
}
};
}
});