422 lines
52 KiB
JavaScript
422 lines
52 KiB
JavaScript
|
'use strict';
|
||
|
|
|
||
|
|
var _importType = require('../core/importType');
|
||
|
|
|
||
|
|
var _importType2 = _interopRequireDefault(_importType);
|
||
|
|
|
||
|
|
var _staticRequire = require('../core/staticRequire');
|
||
|
|
|
||
|
|
var _staticRequire2 = _interopRequireDefault(_staticRequire);
|
||
|
|
|
||
|
|
var _docsUrl = require('../docsUrl');
|
||
|
|
|
||
|
|
var _docsUrl2 = _interopRequireDefault(_docsUrl);
|
||
|
|
|
||
|
|
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
|
||
|
|
|
||
|
|
const defaultGroups = ['builtin', 'external', 'parent', 'sibling', 'index'];
|
||
|
|
|
||
|
|
// REPORTING AND FIXING
|
||
|
|
|
||
|
|
function reverse(array) {
|
||
|
|
return array.map(function (v) {
|
||
|
|
return {
|
||
|
|
name: v.name,
|
||
|
|
rank: -v.rank,
|
||
|
|
node: v.node
|
||
|
|
};
|
||
|
|
}).reverse();
|
||
|
|
}
|
||
|
|
|
||
|
|
function getTokensOrCommentsAfter(sourceCode, node, count) {
|
||
|
|
let currentNodeOrToken = node;
|
||
|
|
const result = [];
|
||
|
|
for (let i = 0; i < count; i++) {
|
||
|
|
currentNodeOrToken = sourceCode.getTokenOrCommentAfter(currentNodeOrToken);
|
||
|
|
if (currentNodeOrToken == null) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
result.push(currentNodeOrToken);
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
function getTokensOrCommentsBefore(sourceCode, node, count) {
|
||
|
|
let currentNodeOrToken = node;
|
||
|
|
const result = [];
|
||
|
|
for (let i = 0; i < count; i++) {
|
||
|
|
currentNodeOrToken = sourceCode.getTokenOrCommentBefore(currentNodeOrToken);
|
||
|
|
if (currentNodeOrToken == null) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
result.push(currentNodeOrToken);
|
||
|
|
}
|
||
|
|
return result.reverse();
|
||
|
|
}
|
||
|
|
|
||
|
|
function takeTokensAfterWhile(sourceCode, node, condition) {
|
||
|
|
const tokens = getTokensOrCommentsAfter(sourceCode, node, 100);
|
||
|
|
const result = [];
|
||
|
|
for (let i = 0; i < tokens.length; i++) {
|
||
|
|
if (condition(tokens[i])) {
|
||
|
|
result.push(tokens[i]);
|
||
|
|
} else {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
function takeTokensBeforeWhile(sourceCode, node, condition) {
|
||
|
|
const tokens = getTokensOrCommentsBefore(sourceCode, node, 100);
|
||
|
|
const result = [];
|
||
|
|
for (let i = tokens.length - 1; i >= 0; i--) {
|
||
|
|
if (condition(tokens[i])) {
|
||
|
|
result.push(tokens[i]);
|
||
|
|
} else {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return result.reverse();
|
||
|
|
}
|
||
|
|
|
||
|
|
function findOutOfOrder(imported) {
|
||
|
|
if (imported.length === 0) {
|
||
|
|
return [];
|
||
|
|
}
|
||
|
|
let maxSeenRankNode = imported[0];
|
||
|
|
return imported.filter(function (importedModule) {
|
||
|
|
const res = importedModule.rank < maxSeenRankNode.rank;
|
||
|
|
if (maxSeenRankNode.rank < importedModule.rank) {
|
||
|
|
maxSeenRankNode = importedModule;
|
||
|
|
}
|
||
|
|
return res;
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
function findRootNode(node) {
|
||
|
|
let parent = node;
|
||
|
|
while (parent.parent != null && parent.parent.body == null) {
|
||
|
|
parent = parent.parent;
|
||
|
|
}
|
||
|
|
return parent;
|
||
|
|
}
|
||
|
|
|
||
|
|
function findEndOfLineWithComments(sourceCode, node) {
|
||
|
|
const tokensToEndOfLine = takeTokensAfterWhile(sourceCode, node, commentOnSameLineAs(node));
|
||
|
|
let endOfTokens = tokensToEndOfLine.length > 0 ? tokensToEndOfLine[tokensToEndOfLine.length - 1].range[1] : node.range[1];
|
||
|
|
let result = endOfTokens;
|
||
|
|
for (let i = endOfTokens; i < sourceCode.text.length; i++) {
|
||
|
|
if (sourceCode.text[i] === '\n') {
|
||
|
|
result = i + 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
if (sourceCode.text[i] !== ' ' && sourceCode.text[i] !== '\t' && sourceCode.text[i] !== '\r') {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
result = i + 1;
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
function commentOnSameLineAs(node) {
|
||
|
|
return token => (token.type === 'Block' || token.type === 'Line') && token.loc.start.line === token.loc.end.line && token.loc.end.line === node.loc.end.line;
|
||
|
|
}
|
||
|
|
|
||
|
|
function findStartOfLineWithComments(sourceCode, node) {
|
||
|
|
const tokensToEndOfLine = takeTokensBeforeWhile(sourceCode, node, commentOnSameLineAs(node));
|
||
|
|
let startOfTokens = tokensToEndOfLine.length > 0 ? tokensToEndOfLine[0].range[0] : node.range[0];
|
||
|
|
let result = startOfTokens;
|
||
|
|
for (let i = startOfTokens - 1; i > 0; i--) {
|
||
|
|
if (sourceCode.text[i] !== ' ' && sourceCode.text[i] !== '\t') {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
result = i;
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
function isPlainRequireModule(node) {
|
||
|
|
if (node.type !== 'VariableDeclaration') {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
if (node.declarations.length !== 1) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
const decl = node.declarations[0];
|
||
|
|
const result = decl.id && (decl.id.type === 'Identifier' || decl.id.type === 'ObjectPattern') && decl.init != null && decl.init.type === 'CallExpression' && decl.init.callee != null && decl.init.callee.name === 'require' && decl.init.arguments != null && decl.init.arguments.length === 1 && decl.init.arguments[0].type === 'Literal';
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
function isPlainImportModule(node) {
|
||
|
|
return node.type === 'ImportDeclaration' && node.specifiers != null && node.specifiers.length > 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
function canCrossNodeWhileReorder(node) {
|
||
|
|
return isPlainRequireModule(node) || isPlainImportModule(node);
|
||
|
|
}
|
||
|
|
|
||
|
|
function canReorderItems(firstNode, secondNode) {
|
||
|
|
const parent = firstNode.parent;
|
||
|
|
const firstIndex = parent.body.indexOf(firstNode);
|
||
|
|
const secondIndex = parent.body.indexOf(secondNode);
|
||
|
|
const nodesBetween = parent.body.slice(firstIndex, secondIndex + 1);
|
||
|
|
for (var nodeBetween of nodesBetween) {
|
||
|
|
if (!canCrossNodeWhileReorder(nodeBetween)) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
function fixOutOfOrder(context, firstNode, secondNode, order) {
|
||
|
|
const sourceCode = context.getSourceCode();
|
||
|
|
|
||
|
|
const firstRoot = findRootNode(firstNode.node);
|
||
|
|
let firstRootStart = findStartOfLineWithComments(sourceCode, firstRoot);
|
||
|
|
const firstRootEnd = findEndOfLineWithComments(sourceCode, firstRoot);
|
||
|
|
|
||
|
|
const secondRoot = findRootNode(secondNode.node);
|
||
|
|
let secondRootStart = findStartOfLineWithComments(sourceCode, secondRoot);
|
||
|
|
let secondRootEnd = findEndOfLineWithComments(sourceCode, secondRoot);
|
||
|
|
const canFix = canReorderItems(firstRoot, secondRoot);
|
||
|
|
|
||
|
|
let newCode = sourceCode.text.substring(secondRootStart, secondRootEnd);
|
||
|
|
if (newCode[newCode.length - 1] !== '\n') {
|
||
|
|
newCode = newCode + '\n';
|
||
|
|
}
|
||
|
|
|
||
|
|
const message = '`' + secondNode.name + '` import should occur ' + order + ' import of `' + firstNode.name + '`';
|
||
|
|
|
||
|
|
if (order === 'before') {
|
||
|
|
context.report({
|
||
|
|
node: secondNode.node,
|
||
|
|
message: message,
|
||
|
|
fix: canFix && (fixer => fixer.replaceTextRange([firstRootStart, secondRootEnd], newCode + sourceCode.text.substring(firstRootStart, secondRootStart)))
|
||
|
|
});
|
||
|
|
} else if (order === 'after') {
|
||
|
|
context.report({
|
||
|
|
node: secondNode.node,
|
||
|
|
message: message,
|
||
|
|
fix: canFix && (fixer => fixer.replaceTextRange([secondRootStart, firstRootEnd], sourceCode.text.substring(secondRootEnd, firstRootEnd) + newCode))
|
||
|
|
});
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
function reportOutOfOrder(context, imported, outOfOrder, order) {
|
||
|
|
outOfOrder.forEach(function (imp) {
|
||
|
|
const found = imported.find(function hasHigherRank(importedItem) {
|
||
|
|
return importedItem.rank > imp.rank;
|
||
|
|
});
|
||
|
|
fixOutOfOrder(context, found, imp, order);
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
function makeOutOfOrderReport(context, imported) {
|
||
|
|
const outOfOrder = findOutOfOrder(imported);
|
||
|
|
if (!outOfOrder.length) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
// There are things to report. Try to minimize the number of reported errors.
|
||
|
|
const reversedImported = reverse(imported);
|
||
|
|
const reversedOrder = findOutOfOrder(reversedImported);
|
||
|
|
if (reversedOrder.length < outOfOrder.length) {
|
||
|
|
reportOutOfOrder(context, reversedImported, reversedOrder, 'after');
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
reportOutOfOrder(context, imported, outOfOrder, 'before');
|
||
|
|
}
|
||
|
|
|
||
|
|
// DETECTING
|
||
|
|
|
||
|
|
function computeRank(context, ranks, name, type) {
|
||
|
|
return ranks[(0, _importType2.default)(name, context)] + (type === 'import' ? 0 : 100);
|
||
|
|
}
|
||
|
|
|
||
|
|
function registerNode(context, node, name, type, ranks, imported) {
|
||
|
|
const rank = computeRank(context, ranks, name, type);
|
||
|
|
if (rank !== -1) {
|
||
|
|
imported.push({ name, rank, node });
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
function isInVariableDeclarator(node) {
|
||
|
|
return node && (node.type === 'VariableDeclarator' || isInVariableDeclarator(node.parent));
|
||
|
|
}
|
||
|
|
|
||
|
|
const types = ['builtin', 'external', 'internal', 'unknown', 'parent', 'sibling', 'index'];
|
||
|
|
|
||
|
|
// Creates an object with type-rank pairs.
|
||
|
|
// Example: { index: 0, sibling: 1, parent: 1, external: 1, builtin: 2, internal: 2 }
|
||
|
|
// Will throw an error if it contains a type that does not exist, or has a duplicate
|
||
|
|
function convertGroupsToRanks(groups) {
|
||
|
|
const rankObject = groups.reduce(function (res, group, index) {
|
||
|
|
if (typeof group === 'string') {
|
||
|
|
group = [group];
|
||
|
|
}
|
||
|
|
group.forEach(function (groupItem) {
|
||
|
|
if (types.indexOf(groupItem) === -1) {
|
||
|
|
throw new Error('Incorrect configuration of the rule: Unknown type `' + JSON.stringify(groupItem) + '`');
|
||
|
|
}
|
||
|
|
if (res[groupItem] !== undefined) {
|
||
|
|
throw new Error('Incorrect configuration of the rule: `' + groupItem + '` is duplicated');
|
||
|
|
}
|
||
|
|
res[groupItem] = index;
|
||
|
|
});
|
||
|
|
return res;
|
||
|
|
}, {});
|
||
|
|
|
||
|
|
const omittedTypes = types.filter(function (type) {
|
||
|
|
return rankObject[type] === undefined;
|
||
|
|
});
|
||
|
|
|
||
|
|
return omittedTypes.reduce(function (res, type) {
|
||
|
|
res[type] = groups.length;
|
||
|
|
return res;
|
||
|
|
}, rankObject);
|
||
|
|
}
|
||
|
|
|
||
|
|
function fixNewLineAfterImport(context, previousImport) {
|
||
|
|
const prevRoot = findRootNode(previousImport.node);
|
||
|
|
const tokensToEndOfLine = takeTokensAfterWhile(context.getSourceCode(), prevRoot, commentOnSameLineAs(prevRoot));
|
||
|
|
|
||
|
|
let endOfLine = prevRoot.range[1];
|
||
|
|
if (tokensToEndOfLine.length > 0) {
|
||
|
|
endOfLine = tokensToEndOfLine[tokensToEndOfLine.length - 1].range[1];
|
||
|
|
}
|
||
|
|
return fixer => fixer.insertTextAfterRange([prevRoot.range[0], endOfLine], '\n');
|
||
|
|
}
|
||
|
|
|
||
|
|
function removeNewLineAfterImport(context, currentImport, previousImport) {
|
||
|
|
const sourceCode = context.getSourceCode();
|
||
|
|
const prevRoot = findRootNode(previousImport.node);
|
||
|
|
const currRoot = findRootNode(currentImport.node);
|
||
|
|
const rangeToRemove = [findEndOfLineWithComments(sourceCode, prevRoot), findStartOfLineWithComments(sourceCode, currRoot)];
|
||
|
|
if (/^\s*$/.test(sourceCode.text.substring(rangeToRemove[0], rangeToRemove[1]))) {
|
||
|
|
return fixer => fixer.removeRange(rangeToRemove);
|
||
|
|
}
|
||
|
|
return undefined;
|
||
|
|
}
|
||
|
|
|
||
|
|
function makeNewlinesBetweenReport(context, imported, newlinesBetweenImports) {
|
||
|
|
const getNumberOfEmptyLinesBetween = (currentImport, previousImport) => {
|
||
|
|
const linesBetweenImports = context.getSourceCode().lines.slice(previousImport.node.loc.end.line, currentImport.node.loc.start.line - 1);
|
||
|
|
|
||
|
|
return linesBetweenImports.filter(line => !line.trim().length).length;
|
||
|
|
};
|
||
|
|
let previousImport = imported[0];
|
||
|
|
|
||
|
|
imported.slice(1).forEach(function (currentImport) {
|
||
|
|
const emptyLinesBetween = getNumberOfEmptyLinesBetween(currentImport, previousImport);
|
||
|
|
|
||
|
|
if (newlinesBetweenImports === 'always' || newlinesBetweenImports === 'always-and-inside-groups') {
|
||
|
|
if (currentImport.rank !== previousImport.rank && emptyLinesBetween === 0) {
|
||
|
|
context.report({
|
||
|
|
node: previousImport.node,
|
||
|
|
message: 'There should be at least one empty line between import groups',
|
||
|
|
fix: fixNewLineAfterImport(context, previousImport, currentImport)
|
||
|
|
});
|
||
|
|
} else if (currentImport.rank === previousImport.rank && emptyLinesBetween > 0 && newlinesBetweenImports !== 'always-and-inside-groups') {
|
||
|
|
context.report({
|
||
|
|
node: previousImport.node,
|
||
|
|
message: 'There should be no empty line within import group',
|
||
|
|
fix: removeNewLineAfterImport(context, currentImport, previousImport)
|
||
|
|
});
|
||
|
|
}
|
||
|
|
} else if (emptyLinesBetween > 0) {
|
||
|
|
context.report({
|
||
|
|
node: previousImport.node,
|
||
|
|
message: 'There should be no empty line between import groups',
|
||
|
|
fix: removeNewLineAfterImport(context, currentImport, previousImport)
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
previousImport = currentImport;
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
module.exports = {
|
||
|
|
meta: {
|
||
|
|
type: 'suggestion',
|
||
|
|
docs: {
|
||
|
|
url: (0, _docsUrl2.default)('order')
|
||
|
|
},
|
||
|
|
|
||
|
|
fixable: 'code',
|
||
|
|
schema: [{
|
||
|
|
type: 'object',
|
||
|
|
properties: {
|
||
|
|
groups: {
|
||
|
|
type: 'array'
|
||
|
|
},
|
||
|
|
'newlines-between': {
|
||
|
|
enum: ['ignore', 'always', 'always-and-inside-groups', 'never']
|
||
|
|
}
|
||
|
|
},
|
||
|
|
additionalProperties: false
|
||
|
|
}]
|
||
|
|
},
|
||
|
|
|
||
|
|
create: function importOrderRule(context) {
|
||
|
|
const options = context.options[0] || {};
|
||
|
|
const newlinesBetweenImports = options['newlines-between'] || 'ignore';
|
||
|
|
let ranks;
|
||
|
|
|
||
|
|
try {
|
||
|
|
ranks = convertGroupsToRanks(options.groups || defaultGroups);
|
||
|
|
} catch (error) {
|
||
|
|
// Malformed configuration
|
||
|
|
return {
|
||
|
|
Program: function (node) {
|
||
|
|
context.report(node, error.message);
|
||
|
|
}
|
||
|
|
};
|
||
|
|
}
|
||
|
|
let imported = [];
|
||
|
|
let level = 0;
|
||
|
|
|
||
|
|
function incrementLevel() {
|
||
|
|
level++;
|
||
|
|
}
|
||
|
|
function decrementLevel() {
|
||
|
|
level--;
|
||
|
|
}
|
||
|
|
|
||
|
|
return {
|
||
|
|
ImportDeclaration: function handleImports(node) {
|
||
|
|
if (node.specifiers.length) {
|
||
|
|
// Ignoring unassigned imports
|
||
|
|
const name = node.source.value;
|
||
|
|
registerNode(context, node, name, 'import', ranks, imported);
|
||
|
|
}
|
||
|
|
},
|
||
|
|
CallExpression: function handleRequires(node) {
|
||
|
|
if (level !== 0 || !(0, _staticRequire2.default)(node) || !isInVariableDeclarator(node.parent)) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
const name = node.arguments[0].value;
|
||
|
|
registerNode(context, node, name, 'require', ranks, imported);
|
||
|
|
},
|
||
|
|
'Program:exit': function reportAndReset() {
|
||
|
|
makeOutOfOrderReport(context, imported);
|
||
|
|
|
||
|
|
if (newlinesBetweenImports !== 'ignore') {
|
||
|
|
makeNewlinesBetweenReport(context, imported, newlinesBetweenImports);
|
||
|
|
}
|
||
|
|
|
||
|
|
imported = [];
|
||
|
|
},
|
||
|
|
FunctionDeclaration: incrementLevel,
|
||
|
|
FunctionExpression: incrementLevel,
|
||
|
|
ArrowFunctionExpression: incrementLevel,
|
||
|
|
BlockStatement: incrementLevel,
|
||
|
|
ObjectExpression: incrementLevel,
|
||
|
|
'FunctionDeclaration:exit': decrementLevel,
|
||
|
|
'FunctionExpression:exit': decrementLevel,
|
||
|
|
'ArrowFunctionExpression:exit': decrementLevel,
|
||
|
|
'BlockStatement:exit': decrementLevel,
|
||
|
|
'ObjectExpression:exit': decrementLevel
|
||
|
|
};
|
||
|
|
}
|
||
|
|
};
|
||
|
|
//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9ydWxlcy9vcmRlci5qcyJdLCJuYW1lcyI6WyJkZWZhdWx0R3JvdXBzIiwicmV2ZXJzZSIsImFycmF5IiwibWFwIiwidiIsIm5hbWUiLCJyYW5rIiwibm9kZSIsImdldFRva2Vuc09yQ29tbWVudHNBZnRlciIsInNvdXJjZUNvZGUiLCJjb3VudCIsImN1cnJlbnROb2RlT3JUb2tlbiIsInJlc3VsdCIsImkiLCJnZXRUb2tlbk9yQ29tbWVudEFmdGVyIiwicHVzaCIsImdldFRva2Vuc09yQ29tbWVudHNCZWZvcmUiLCJnZXRUb2tlbk9yQ29tbWVudEJlZm9yZSIsInRha2VUb2tlbnNBZnRlcldoaWxlIiwiY29uZGl0aW9uIiwidG9rZW5zIiwibGVuZ3RoIiwidGFrZVRva2Vuc0JlZm9yZVdoaWxlIiwiZmluZE91dE9mT3JkZXIiLCJpbXBvcnRlZCIsIm1heFNlZW5SYW5rTm9kZSIsImZpbHRlciIsImltcG9ydGVkTW9kdWxlIiwicmVzIiwiZmluZFJvb3ROb2RlIiwicGFyZW50IiwiYm9keSIsImZpbmRFbmRPZkxpbmVXaXRoQ29tbWVudHMiLCJ0b2tlbnNUb0VuZE9mTGluZSIsImNvbW1lbnRPblNhbWVMaW5lQXMiLCJlbmRPZlRva2VucyIsInJhbmdlIiwidGV4dCIsInRva2VuIiwidHlwZSIsImxvYyIsInN0YXJ0IiwibGluZSIsImVuZCIsImZpbmRTdGFydE9mTGluZVdpdGhDb21tZW50cyIsInN0YXJ0T2ZUb2tlbnMiLCJpc1BsYWluUmVxdWlyZU1vZHVsZSIsImRlY2xhcmF0aW9ucyIsImRlY2wiLCJpZCIsImluaXQiLCJjYWxsZWUiLCJhcmd1bWVudHMiLCJpc1BsYWluSW1wb3J0TW9kdWxlIiwic3BlY2lmaWVycyIsImNhbkNyb3NzTm9kZVdoaWxlUmVvcmRlciIsImNhblJlb3JkZXJJdGVtcyIsImZpcnN0Tm9kZSIsInNlY29uZE5vZGUiLCJmaXJzdEluZGV4IiwiaW5kZXhPZiIsInNlY29uZEluZGV4Iiwibm9kZXNCZXR3ZWVuIiwic2xpY2UiLCJub2RlQmV0d2VlbiIsImZpeE91dE9mT3JkZXIiLCJjb250ZXh0Iiwib3JkZXIiLCJnZXRTb3VyY2VDb2RlIiwiZmlyc3RSb290IiwiZmlyc3RSb290U3RhcnQiLCJmaXJzdFJvb3RFbmQiLCJzZWNvbmRSb290Iiwic2Vjb25kUm9vdFN0YXJ0Iiwic2Vjb25kUm9vdEVuZCIsImNhbkZpeCIsIm5ld0NvZGUiLCJzdWJzdHJpbmciLCJtZXNzYWdlIiwicmVwb3J0IiwiZml4IiwiZml4ZXIiLCJyZXBsYWNlVGV4dFJhbmdlIiwicmVwb3J0T3V0T2ZPcmRlciIsIm91dE9mT3JkZXIiLCJmb3JFYWNoIiwiaW1wIiwiZm91bmQiLCJmaW5kIiwiaGFzSGlnaGVyUmFuayIsImltcG9ydGVkSXRlbSIsIm1ha2VPdXRPZk9yZGVyUmVwb3J0IiwicmV2ZXJzZWRJbXBvcnRlZCIsInJldmVyc2VkT3JkZXIiLCJjb21wdXRlUmFuayIsInJhbmtzIiwicmVnaXN0ZXJOb2RlIiwiaXNJblZhcmlhYmxlRGVjbGFyYXRvciIsInR5cGVzIiwiY29udmVydEdyb3Vwc1RvUmFua3MiLCJncm91cHMiLCJyYW5rT2JqZWN0IiwicmVkdWNlIiwiZ3JvdXAiLCJpbmRleCIsImdyb3VwSXRlbSIsIkVycm9yIiwiSlNPTiIsInN0cmluZ2lmeSIsInVuZGVmaW5lZCIsIm9taXR0ZWRUeXBlcyIsImZpeE5ld0xpbmVBZnRlckltcG9ydCIsInByZXZpb3VzSW1wb3J0IiwicHJldlJvb3QiLCJlbmRPZkxpbmUiLCJpbnNlcnRUZXh0QWZ0ZXJSYW5nZSIsInJlbW92ZU5ld0xpbmVBZnRlckltcG9ydCIsImN1cnJlbnRJbXBvcnQiLCJjdXJyUm9vdCIsInJhbmdlVG9SZW1vdmUiLCJ0ZXN0IiwicmVtb3ZlUmFuZ2UiLCJtYWtlTmV3bGluZXNCZXR3ZWVuUmVwb3J0IiwibmV3bGluZXNCZXR3ZWVuSW1wb3J0cyIsImdldE51bWJlck9mRW1wdHlMaW5lc0JldHdlZW4iLCJsaW5lc0JldHdlZW5JbXBvcnRzIiwibGluZXMiLCJ0cmltIiwiZW1wdHlMaW5lc0JldHdlZW4iLCJtb2R1bGUiLCJleHBvcnRzIiwibWV0YSIsImRvY3MiLCJ1cmwiLCJmaXhhYmxlIiwic2NoZW1hIiwicHJvcGVydGllcyIsImVudW0iLCJhZGRpdGlvbmFsUHJvcGVydGllcyIsImNyZWF0ZSIsImltcG9ydE9yZGVyUnVsZSIsIm9wdGlvbnMiLCJlcnJvciIsIlByb2dyYW0iLCJsZXZlbCIsImluY3JlbWVudExldmVsIiwiZGVjcmVtZW50TGV2ZWwiLCJJbXBvcnREZWNsYXJhdGlvbiIsImhhbmRsZUltcG9ydHMiLCJzb3VyY2UiLCJ2YWx1ZSIsIkNhbGxFeHByZXNzaW9uIiwiaGFuZGxlUmVxdWlyZXMiLCJyZXBvcnRBbmRSZXNldCIsIkZ1bmN0aW9uRGVjbGFyYXRpb24iLCJGdW5jdGlvbkV4cHJlc3Npb24iLCJBcnJvd0Z1bmN0aW9uRXhwcmVzc2lvbiIsIkJsb2NrU3RhdGVtZW50IiwiT2JqZWN0RXhwcmVzc2lvbiJdLCJtYXBwaW5ncyI6IkFBQUE7O0FBRUE7Ozs7QUFDQTs7OztBQUNBOzs7Ozs7QUFFQSxNQUFNQSxnQkFBZ0IsQ0FBQyxTQUFELEVBQVksVUFBWixFQUF3QixRQUF4QixFQUFrQyxTQUFsQyxFQUE2QyxPQUE3QyxDQUF0Qjs7QUFFQTs7QUFFQSxTQUFTQyxPQUFULENBQWlCQyxLQUFqQixFQUF3QjtBQUN0QixTQUFPQSxNQUFNQyxHQUFOLENBQVUsVUFBVUMsQ0FBVixFQUFhO0FBQzVCLFdBQU87QUFDTEMsWUFBTUQsRUFBRUMsSUFESDtBQUVMQyxZQUFNLENBQUNGLEVBQUVFLElBRko7QUFHTEMsWUFBTUgsRUFBRUc7QUFISCxLQUFQO0FBS0QsR0FOTSxFQU1KTixPQU5JLEVBQVA7QUFPRDs7QUFFRCxTQUFTTyx3QkFBVCxDQUFrQ0MsVUFBbEMsRUFBOENGLElBQTlDLEVBQW9ERyxLQUFwRCxFQUEyRDtBQUN6RCxNQUFJQyxxQkFBcUJKLElBQXpCO0FBQ0EsUUFBTUssU0FBUyxFQUFmO0FBQ0EsT0FBSyxJQUFJQyxJQUFJLENBQWIsRUFBZ0JBLElBQUlILEtBQXBCLEVBQTJCRyxHQUEzQixFQUFnQztBQUM5QkYseUJBQXFCRixXQUFXSyxzQkFBWCxDQUFrQ0gsa0JBQWxDLENBQXJCO0FBQ0EsUUFBSUEsc0JBQXNCLElBQTFCLEVBQWdDO0FBQzlCO0FBQ0Q7QUFDREMsV0FBT0csSUFBUCxDQUFZSixrQkFBWjtBQUNEO0FBQ0QsU0FBT0MsTUFBUDtBQUNEOztBQUVELFNBQVNJLHlCQUFULENBQW1DUCxVQUFuQyxFQUErQ0YsSUFBL0MsRUFBcURHLEtBQXJELEVBQTREO0FBQzFELE1BQUlDLHFCQUFxQkosSUFBekI7QUFDQSxRQUFNSyxTQUFTLEVBQWY7QUFDQSxPQUFLLElBQUlDLElBQUksQ0FBYixFQUFnQkE
|