xo 0.52.2 → 0.52.4

package/readme.md

@@ -9,7 +9,7 @@
 > JavaScript/TypeScript linter (ESLint wrapper) with great defaults
 
 [![Coverage Status](https://codecov.io/gh/xojs/xo/branch/main/graph/badge.svg)](https://codecov.io/gh/xojs/xo/branch/main)
-[![XO code style](https://img.shields.io/badge/code_style-XO-5ed9c7.svg)](https://github.com/xojs/xo)
+[![XO code style](https://shields.io/badge/code_style-5ed9c7?logo=xo&labelColor=gray)](https://github.com/xojs/xo)
 
 Opinionated but configurable ESLint wrapper with lots of goodies included. Enforces strict and readable code. Never discuss code style on a pull request again! No decision-making. No `.eslintrc` to manage. It just works!
 
@@ -27,7 +27,7 @@ It uses [ESLint](https://eslint.org) underneath, so issues regarding built-in ru
 - No need to specify file paths to lint as it lints all JS/TS files except for [commonly ignored paths](#ignores).
 - [Config overrides per files/globs.](#config-overrides)
 - [TypeScript supported by default](#typescript)
-- Includes many useful ESLint plugins, like [`unicorn`](https://github.com/sindresorhus/eslint-plugin-unicorn), [`import`](https://github.com/benmosher/eslint-plugin-import), [`ava`](https://github.com/avajs/eslint-plugin-ava), [`node`](https://github.com/mysticatea/eslint-plugin-node) and more.
+- Includes many useful ESLint plugins, like [`unicorn`](https://github.com/sindresorhus/eslint-plugin-unicorn), [`import`](https://github.com/benmosher/eslint-plugin-import), [`ava`](https://github.com/avajs/eslint-plugin-ava), [`n`](https://github.com/weiran-zsd/eslint-plugin-node) and more.
 - Automatically enables rules based on the [`engines`](https://docs.npmjs.com/files/package.json#engines) field in your `package.json`.
 - Caches results between runs for much better performance.
 - Super simple to add XO to a project with [`$ npm init xo`](https://github.com/xojs/create-xo).
@@ -480,12 +480,14 @@ XO is based on ESLint. This project started out as just a shareable ESLint confi
 
 ## Badge
 
-Show the world you're using XO → [![XO code style](https://img.shields.io/badge/code_style-XO-5ed9c7.svg)](https://github.com/xojs/xo)
+Show the world you're using XO → [![XO code style](https://shields.io/badge/code_style-5ed9c7?logo=xo&labelColor=gray)](https://github.com/xojs/xo)
 
 ```md
-[![XO code style](https://img.shields.io/badge/code_style-XO-5ed9c7.svg)](https://github.com/xojs/xo)
+[![XO code style](https://shields.io/badge/code_style-5ed9c7?logo=xo&labelColor=gray)](https://github.com/xojs/xo)
 ```
 
+Or [customize the badge](https://github.com/xojs/xo/issues/689#issuecomment-1253127616).
+
 You can also find some nice dynamic XO badges on [badgen.net](https://badgen.net/#xo).
 
 ## Team

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/BinarySearchTree.js

@@ -1,55 +0,0 @@
-"use strict";
-// The following code is adapted from the the code in eslint.
-// License: https://github.com/eslint/eslint/blob/48700fc8408f394887cdedd071b22b757700fdcb/LICENSE
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BinarySearchTree = void 0;
-const functional_red_black_tree_1 = __importDefault(require("functional-red-black-tree"));
-/**
- * A mutable balanced binary search tree that stores (key, value) pairs. The keys are numeric, and must be unique.
- * This is intended to be a generic wrapper around a balanced binary search tree library, so that the underlying implementation
- * can easily be swapped out.
- */
-class BinarySearchTree {
-    constructor() {
-        this.rbTree = (0, functional_red_black_tree_1.default)();
-    }
-    /**
-     * Inserts an entry into the tree.
-     */
-    insert(key, value) {
-        const iterator = this.rbTree.find(key);
-        if (iterator.valid) {
-            this.rbTree = iterator.update(value);
-        }
-        else {
-            this.rbTree = this.rbTree.insert(key, value);
-        }
-    }
-    /**
-     * Finds the entry with the largest key less than or equal to the provided key
-     * @returns The found entry, or null if no such entry exists.
-     */
-    findLe(key) {
-        const iterator = this.rbTree.le(key);
-        return { key: iterator.key, value: iterator.value };
-    }
-    /**
-     * Deletes all of the keys in the interval [start, end)
-     */
-    deleteRange(start, end) {
-        // Exit without traversing the tree if the range has zero size.
-        if (start === end) {
-            return;
-        }
-        const iterator = this.rbTree.ge(start);
-        while (iterator.valid && iterator.key < end) {
-            this.rbTree = this.rbTree.remove(iterator.key);
-            iterator.next();
-        }
-    }
-}
-exports.BinarySearchTree = BinarySearchTree;
-//# sourceMappingURL=BinarySearchTree.js.map

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/BinarySearchTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"BinarySearchTree.js","sourceRoot":"","sources":["../../../src/rules/indent-new-do-not-use/BinarySearchTree.ts"],"names":[],"mappings":";AAAA,6DAA6D;AAC7D,kGAAkG;;;;;;AAGlG,0FAAmD;AAQnD;;;;GAIG;AACH,MAAa,gBAAgB;IAA7B;QACU,WAAM,GAAG,IAAA,mCAAU,GAAa,CAAC;IAwC3C,CAAC;IAtCC;;OAEG;IACI,MAAM,CAAC,GAAW,EAAE,KAAgB;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEvC,IAAI,QAAQ,CAAC,KAAK,EAAE;YAClB,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SACtC;aAAM;YACL,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SAC9C;IACH,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,GAAW;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAErC,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;IACtD,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,KAAa,EAAE,GAAW;QAC3C,+DAA+D;QAC/D,IAAI,KAAK,KAAK,GAAG,EAAE;YACjB,OAAO;SACR;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,GAAG,GAAG,GAAG,EAAE;YAC3C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/C,QAAQ,CAAC,IAAI,EAAE,CAAC;SACjB;IACH,CAAC;CACF;AAzCD,4CAyCC"}

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/OffsetStorage.js

@@ -1,221 +0,0 @@
-"use strict";
-// The following code is adapted from the the code in eslint.
-// License: https://github.com/eslint/eslint/blob/48700fc8408f394887cdedd071b22b757700fdcb/LICENSE
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.OffsetStorage = void 0;
-const BinarySearchTree_1 = require("./BinarySearchTree");
-/**
- * A class to store information on desired offsets of tokens from each other
- */
-class OffsetStorage {
-    /**
-     * @param tokenInfo a TokenInfo instance
-     * @param indentSize The desired size of each indentation level
-     * @param indentType The indentation character
-     */
-    constructor(tokenInfo, indentSize, indentType) {
-        this.tokenInfo = tokenInfo;
-        this.indentSize = indentSize;
-        this.indentType = indentType;
-        this.tree = new BinarySearchTree_1.BinarySearchTree();
-        this.tree.insert(0, { offset: 0, from: null, force: false });
-        this.lockedFirstTokens = new WeakMap();
-        this.desiredIndentCache = new WeakMap();
-        this.ignoredTokens = new WeakSet();
-    }
-    getOffsetDescriptor(token) {
-        return this.tree.findLe(token.range[0]).value;
-    }
-    /**
-     * Sets the offset column of token B to match the offset column of token A.
-     * **WARNING**: This matches a *column*, even if baseToken is not the first token on its line. In
-     * most cases, `setDesiredOffset` should be used instead.
-     * @param baseToken The first token
-     * @param offsetToken The second token, whose offset should be matched to the first token
-     */
-    matchOffsetOf(baseToken, offsetToken) {
-        /*
-         * lockedFirstTokens is a map from a token whose indentation is controlled by the "first" option to
-         * the token that it depends on. For example, with the `ArrayExpression: first` option, the first
-         * token of each element in the array after the first will be mapped to the first token of the first
-         * element. The desired indentation of each of these tokens is computed based on the desired indentation
-         * of the "first" element, rather than through the normal offset mechanism.
-         */
-        this.lockedFirstTokens.set(offsetToken, baseToken);
-    }
-    /**
-     * Sets the desired offset of a token.
-     *
-     * This uses a line-based offset collapsing behavior to handle tokens on the same line.
-     * For example, consider the following two cases:
-     *
-     * (
-     *     [
-     *         bar
-     *     ]
-     * )
-     *
-     * ([
-     *     bar
-     * ])
-     *
-     * Based on the first case, it's clear that the `bar` token needs to have an offset of 1 indent level (4 spaces) from
-     * the `[` token, and the `[` token has to have an offset of 1 indent level from the `(` token. Since the `(` token is
-     * the first on its line (with an indent of 0 spaces), the `bar` token needs to be offset by 2 indent levels (8 spaces)
-     * from the start of its line.
-     *
-     * However, in the second case `bar` should only be indented by 4 spaces. This is because the offset of 1 indent level
-     * between the `(` and the `[` tokens gets "collapsed" because the two tokens are on the same line. As a result, the
-     * `(` token is mapped to the `[` token with an offset of 0, and the rule correctly decides that `bar` should be indented
-     * by 1 indent level from the start of the line.
-     *
-     * This is useful because rule listeners can usually just call `setDesiredOffset` for all the tokens in the node,
-     * without needing to check which lines those tokens are on.
-     *
-     * Note that since collapsing only occurs when two tokens are on the same line, there are a few cases where non-intuitive
-     * behavior can occur. For example, consider the following cases:
-     *
-     * foo(
-     * ).
-     *     bar(
-     *         baz
-     *     )
-     *
-     * foo(
-     * ).bar(
-     *     baz
-     * )
-     *
-     * Based on the first example, it would seem that `bar` should be offset by 1 indent level from `foo`, and `baz`
-     * should be offset by 1 indent level from `bar`. However, this is not correct, because it would result in `baz`
-     * being indented by 2 indent levels in the second case (since `foo`, `bar`, and `baz` are all on separate lines, no
-     * collapsing would occur).
-     *
-     * Instead, the correct way would be to offset `baz` by 1 level from `bar`, offset `bar` by 1 level from the `)`, and
-     * offset the `)` by 0 levels from `foo`. This ensures that the offset between `bar` and the `)` are correctly collapsed
-     * in the second case.
-     *
-     * @param token The token
-     * @param fromToken The token that `token` should be offset from
-     * @param offset The desired indent level
-     */
-    setDesiredOffset(token, fromToken, offset) {
-        this.setDesiredOffsets(token.range, fromToken, offset);
-    }
-    /**
-     * Sets the desired offset of all tokens in a range
-     * It's common for node listeners in this file to need to apply the same offset to a large, contiguous range of tokens.
-     * Moreover, the offset of any given token is usually updated multiple times (roughly once for each node that contains
-     * it). This means that the offset of each token is updated O(AST depth) times.
-     * It would not be performant to store and update the offsets for each token independently, because the rule would end
-     * up having a time complexity of O(number of tokens * AST depth), which is quite slow for large files.
-     *
-     * Instead, the offset tree is represented as a collection of contiguous offset ranges in a file. For example, the following
-     * list could represent the state of the offset tree at a given point:
-     *
-     * * Tokens starting in the interval [0, 15) are aligned with the beginning of the file
-     * * Tokens starting in the interval [15, 30) are offset by 1 indent level from the `bar` token
-     * * Tokens starting in the interval [30, 43) are offset by 1 indent level from the `foo` token
-     * * Tokens starting in the interval [43, 820) are offset by 2 indent levels from the `bar` token
-     * * Tokens starting in the interval [820, ∞) are offset by 1 indent level from the `baz` token
-     *
-     * The `setDesiredOffsets` methods inserts ranges like the ones above. The third line above would be inserted by using:
-     * `setDesiredOffsets([30, 43], fooToken, 1);`
-     *
-     * @param range A [start, end] pair. All tokens with range[0] <= token.start < range[1] will have the offset applied.
-     * @param fromToken The token that this is offset from
-     * @param offset The desired indent level
-     * @param force `true` if this offset should not use the normal collapsing behavior. This should almost always be false.
-     */
-    setDesiredOffsets(range, fromToken, offset = 0, force = false) {
-        /*
-         * Offset ranges are stored as a collection of nodes, where each node maps a numeric key to an offset
-         * descriptor. The tree for the example above would have the following nodes:
-         *
-         * * key: 0, value: { offset: 0, from: null }
-         * * key: 15, value: { offset: 1, from: barToken }
-         * * key: 30, value: { offset: 1, from: fooToken }
-         * * key: 43, value: { offset: 2, from: barToken }
-         * * key: 820, value: { offset: 1, from: bazToken }
-         *
-         * To find the offset descriptor for any given token, one needs to find the node with the largest key
-         * which is <= token.start. To make this operation fast, the nodes are stored in a balanced binary
-         * search tree indexed by key.
-         */
-        const descriptorToInsert = { offset, from: fromToken, force };
-        const descriptorAfterRange = this.tree.findLe(range[1]).value;
-        const fromTokenIsInRange = fromToken &&
-            fromToken.range[0] >= range[0] &&
-            fromToken.range[1] <= range[1];
-        // this has to be before the delete + insert below or else you'll get into a cycle
-        const fromTokenDescriptor = fromTokenIsInRange
-            ? this.getOffsetDescriptor(fromToken)
-            : null;
-        // First, remove any existing nodes in the range from the tree.
-        this.tree.deleteRange(range[0] + 1, range[1]);
-        // Insert a new node into the tree for this range
-        this.tree.insert(range[0], descriptorToInsert);
-        /*
-         * To avoid circular offset dependencies, keep the `fromToken` token mapped to whatever it was mapped to previously,
-         * even if it's in the current range.
-         */
-        if (fromTokenIsInRange) {
-            this.tree.insert(fromToken.range[0], fromTokenDescriptor);
-            this.tree.insert(fromToken.range[1], descriptorToInsert);
-        }
-        /*
-         * To avoid modifying the offset of tokens after the range, insert another node to keep the offset of the following
-         * tokens the same as it was before.
-         */
-        this.tree.insert(range[1], descriptorAfterRange);
-    }
-    /**
-     * Gets the desired indent of a token
-     * @returns The desired indent of the token
-     */
-    getDesiredIndent(token) {
-        if (!this.desiredIndentCache.has(token)) {
-            if (this.ignoredTokens.has(token)) {
-                /*
-                 * If the token is ignored, use the actual indent of the token as the desired indent.
-                 * This ensures that no errors are reported for this token.
-                 */
-                this.desiredIndentCache.set(token, this.tokenInfo.getTokenIndent(token));
-            }
-            else if (this.lockedFirstTokens.has(token)) {
-                const firstToken = this.lockedFirstTokens.get(token);
-                this.desiredIndentCache.set(token, 
-                // (indentation for the first element's line)
-                this.getDesiredIndent(this.tokenInfo.getFirstTokenOfLine(firstToken)) +
-                    // (space between the start of the first element's line and the first element)
-                    this.indentType.repeat(firstToken.loc.start.column -
-                        this.tokenInfo.getFirstTokenOfLine(firstToken).loc.start.column));
-            }
-            else {
-                const offsetInfo = this.getOffsetDescriptor(token);
-                const offset = offsetInfo.from &&
-                    offsetInfo.from.loc.start.line === token.loc.start.line &&
-                    !/^\s*?\n/u.test(token.value) &&
-                    !offsetInfo.force
-                    ? 0
-                    : offsetInfo.offset * this.indentSize;
-                this.desiredIndentCache.set(token, (offsetInfo.from ? this.getDesiredIndent(offsetInfo.from) : '') +
-                    this.indentType.repeat(offset));
-            }
-        }
-        return this.desiredIndentCache.get(token);
-    }
-    /**
-     * Ignores a token, preventing it from being reported.
-     */
-    ignoreToken(token) {
-        if (this.tokenInfo.isFirstTokenOfLine(token)) {
-            this.ignoredTokens.add(token);
-        }
-    }
-    getFirstDependency(token) {
-        return this.getOffsetDescriptor(token).from;
-    }
-}
-exports.OffsetStorage = OffsetStorage;
-//# sourceMappingURL=OffsetStorage.js.map

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/OffsetStorage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OffsetStorage.js","sourceRoot":"","sources":["../../../src/rules/indent-new-do-not-use/OffsetStorage.ts"],"names":[],"mappings":";AAAA,6DAA6D;AAC7D,kGAAkG;;;AAGlG,yDAAiE;AAGjE;;GAEG;AACH,MAAa,aAAa;IAQxB;;;;OAIG;IACH,YAAY,SAAoB,EAAE,UAAkB,EAAE,UAAkB;QACtE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,IAAI,CAAC,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,OAAO,EAAE,CAAC;QACvC,IAAI,CAAC,kBAAkB,GAAG,IAAI,OAAO,EAAE,CAAC;QACxC,IAAI,CAAC,aAAa,GAAG,IAAI,OAAO,EAAE,CAAC;IACrC,CAAC;IAEO,mBAAmB,CAAC,KAAqB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAChD,CAAC;IAED;;;;;;OAMG;IACI,aAAa,CAClB,SAAyB,EACzB,WAA2B;QAE3B;;;;;;WAMG;QACH,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAuDG;IACI,gBAAgB,CACrB,KAAqB,EACrB,SAAgC,EAChC,MAAc;QAEd,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACI,iBAAiB,CACtB,KAAuB,EACvB,SAAgC,EAChC,MAAM,GAAG,CAAC,EACV,KAAK,GAAG,KAAK;QAEb;;;;;;;;;;;;;WAaG;QAEH,MAAM,kBAAkB,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QAE9D,MAAM,oBAAoB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAE9D,MAAM,kBAAkB,GACtB,SAAS;YACT,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,kFAAkF;QAClF,MAAM,mBAAmB,GAAG,kBAAkB;YAC5C,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;YACrC,CAAC,CAAC,IAAI,CAAC;QAET,+DAA+D;QAC/D,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9C,iDAAiD;QACjD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAE/C;;;WAGG;QACH,IAAI,kBAAkB,EAAE;YACtB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,mBAAoB,CAAC,CAAC;YAC3D,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;SAC1D;QAED;;;WAGG;QACH,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACI,gBAAgB,CAAC,KAAqB;QAC3C,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACjC;;;mBAGG;gBACH,IAAI,CAAC,kBAAkB,CAAC,GAAG,CACzB,KAAK,EACL,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CACrC,CAAC;aACH;iBAAM,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBAEtD,IAAI,CAAC,kBAAkB,CAAC,GAAG,CACzB,KAAK;gBAEL,6CAA6C;gBAC7C,IAAI,CAAC,gBAAgB,CACnB,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAC/C;oBACC,8EAA8E;oBAC9E,IAAI,CAAC,UAAU,CAAC,MAAM,CACpB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM;wBACzB,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAClE,CACJ,CAAC;aACH;iBAAM;gBACL,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACnD,MAAM,MAAM,GACV,UAAU,CAAC,IAAI;oBACf,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI;oBACvD,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;oBAC7B,CAAC,UAAU,CAAC,KAAK;oBACf,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;gBAE1C,IAAI,CAAC,kBAAkB,CAAC,GAAG,CACzB,KAAK,EACL,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7D,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CACjC,CAAC;aACH;SACF;QAED,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,KAAqB;QAC/B,IAAI,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE;YAC5C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SAC/B;IACH,CAAC;IAUD,kBAAkB,CAAC,KAAqB;QACtC,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;IAC9C,CAAC;CACF;AA5QD,sCA4QC"}

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/TokenInfo.js

@@ -1,49 +0,0 @@
-"use strict";
-// The following code is adapted from the the code in eslint.
-// License: https://github.com/eslint/eslint/blob/48700fc8408f394887cdedd071b22b757700fdcb/LICENSE
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TokenInfo = void 0;
-/**
- * A helper class to get token-based info related to indentation
- */
-class TokenInfo {
-    constructor(sourceCode) {
-        this.sourceCode = sourceCode;
-        this.firstTokensByLineNumber = sourceCode.tokensAndComments.reduce((map, token) => {
-            if (!map.has(token.loc.start.line)) {
-                map.set(token.loc.start.line, token);
-            }
-            if (!map.has(token.loc.end.line) &&
-                sourceCode.text
-                    .slice(token.range[1] - token.loc.end.column, token.range[1])
-                    .trim()) {
-                map.set(token.loc.end.line, token);
-            }
-            return map;
-        }, new Map());
-    }
-    /**
-     * Gets the first token on a given token's line
-     * @returns The first token on the given line
-     */
-    getFirstTokenOfLine(token) {
-        return this.firstTokensByLineNumber.get(token.loc.start.line);
-    }
-    /**
-     * Determines whether a token is the first token in its line
-     * @returns `true` if the token is the first on its line
-     */
-    isFirstTokenOfLine(token) {
-        return this.getFirstTokenOfLine(token) === token;
-    }
-    /**
-     * Get the actual indent of a token
-     * @param token Token to examine. This should be the first token on its line.
-     * @returns The indentation characters that precede the token
-     */
-    getTokenIndent(token) {
-        return this.sourceCode.text.slice(token.range[0] - token.loc.start.column, token.range[0]);
-    }
-}
-exports.TokenInfo = TokenInfo;
-//# sourceMappingURL=TokenInfo.js.map

package/node_modules/@typescript-eslint/eslint-plugin/dist/rules/indent-new-do-not-use/TokenInfo.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TokenInfo.js","sourceRoot":"","sources":["../../../src/rules/indent-new-do-not-use/TokenInfo.ts"],"names":[],"mappings":";AAAA,6DAA6D;AAC7D,kGAAkG;;;AAIlG;;GAEG;AACH,MAAa,SAAS;IAIpB,YAAY,UAA+B;QACzC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,uBAAuB,GAAG,UAAU,CAAC,iBAAiB,CAAC,MAAM,CAChE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YACb,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;gBAClC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACtC;YACD,IACE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;gBAC5B,UAAU,CAAC,IAAI;qBACZ,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;qBAC5D,IAAI,EAAE,EACT;gBACA,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACpC;YACD,OAAO,GAAG,CAAC;QACb,CAAC,EACD,IAAI,GAAG,EAA0B,CAClC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,mBAAmB,CACxB,KAAqC;QAErC,OAAO,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;IACjE,CAAC;IAED;;;OAGG;IACI,kBAAkB,CAAC,KAAqB;QAC7C,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,KAAqB;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAC/B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EACvC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CACf,CAAC;IACJ,CAAC;CACF;AAtDD,8BAsDC"}