Microsoft/TypeScript
1
0
Fork 0
mirror of https://github.com/microsoft/TypeScript.git synced 2025-11-18 17:21:48 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(eslint): consistent-type-assertions (#43556)

Browse Source
This commit is contained in:
Oleksandr T
2021-05-18 06:20:57 -07:00
committed by GitHub
parent fc07ee2ad7
commit db01e84700
115 changed files with 2680 additions and 2679 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/server/scriptVersionCache.ts
+15 -15
View File
@@ -76,11 +76,11 @@ namespace ts.server {
let lastZeroCount: LineCollection | undefined;
for (let k = this.endBranch.length - 1; k >= 0; k--) {
(<LineNode>this.endBranch[k]).updateCounts();
(this.endBranch[k] as LineNode).updateCounts();
if (this.endBranch[k].charCount() === 0) {
lastZeroCount = this.endBranch[k];
if (k > 0) {
branchParent = <LineNode>this.endBranch[k - 1];
branchParent = this.endBranch[k - 1] as LineNode;
}
else {
branchParent = this.branchNode;
@@ -92,20 +92,20 @@ namespace ts.server {
}
// path at least length two (root and leaf)
const leafNode = <LineLeaf>this.startPath[this.startPath.length - 1];
const leafNode = this.startPath[this.startPath.length - 1] as LineLeaf;
if (lines.length > 0) {
leafNode.text = lines[0];
if (lines.length > 1) {
let insertedNodes = <LineCollection[]>new Array(lines.length - 1);
let startNode = <LineCollection>leafNode;
let insertedNodes = new Array(lines.length - 1) as LineCollection[];
let startNode = leafNode as LineCollection;
for (let i = 1; i < lines.length; i++) {
insertedNodes[i - 1] = new LineLeaf(lines[i]);
}
let pathIndex = this.startPath.length - 2;
while (pathIndex >= 0) {
const insertionNode = <LineNode>this.startPath[pathIndex];
const insertionNode = this.startPath[pathIndex] as LineNode;
insertedNodes = insertionNode.insertAt(startNode, insertedNodes);
pathIndex--;
startNode = insertionNode;
@@ -122,16 +122,16 @@ namespace ts.server {
}
else {
for (let j = this.startPath.length - 2; j >= 0; j--) {
(<LineNode>this.startPath[j]).updateCounts();
(this.startPath[j] as LineNode).updateCounts();
}
}
}
else {
const insertionNode = <LineNode>this.startPath[this.startPath.length - 2];
const insertionNode = this.startPath[this.startPath.length - 2] as LineNode;
// no content for leaf node, so delete it
insertionNode.remove(leafNode);
for (let j = this.startPath.length - 2; j >= 0; j--) {
(<LineNode>this.startPath[j]).updateCounts();
(this.startPath[j] as LineNode).updateCounts();
}
}
@@ -220,7 +220,7 @@ namespace ts.server {
break;
}
if (this.goSubtree) {
this.stack.push(<LineNode>child);
this.stack.push(child as LineNode);
}
}
// just gather text from the leaves
@@ -544,9 +544,9 @@ namespace ts.server {
const lineMap = computeLineStarts(text);
if (lineMap.length === 0) {
return { lines: <string[]>[], lineMap };
return { lines: [] as string[], lineMap };
}
const lines = <string[]>new Array(lineMap.length);
const lines = new Array(lineMap.length) as string[];
const lc = lineMap.length - 1;
for (let lmi = 0; lmi < lc; lmi++) {
lines[lmi] = text.substring(lineMap[lmi], lineMap[lmi + 1]);
@@ -673,7 +673,7 @@ namespace ts.server {
return { oneBasedLine: lineNumberAccumulator, zeroBasedColumn: relativePosition, lineText: child.text };
}
else {
return (<LineNode>child).charOffsetToLineInfo(lineNumberAccumulator, relativePosition);
return (child as LineNode).charOffsetToLineInfo(lineNumberAccumulator, relativePosition);
}
}
else {
@@ -696,7 +696,7 @@ namespace ts.server {
for (const child of this.children) {
const childLineCount = child.lineCount();
if (childLineCount >= relativeOneBasedLine) {
return child.isLeaf() ? { position: positionAccumulator, leaf: child } : (<LineNode>child).lineNumberToInfo(relativeOneBasedLine, positionAccumulator);
return child.isLeaf() ? { position: positionAccumulator, leaf: child } : (child as LineNode).lineNumberToInfo(relativeOneBasedLine, positionAccumulator);
}
else {
relativeOneBasedLine -= childLineCount;
@@ -764,7 +764,7 @@ namespace ts.server {
let splitNodeCount = 0;
if (nodeIndex < nodeCount) {
splitNodeCount = Math.ceil((nodeCount - nodeIndex) / lineCollectionCapacity);
splitNodes = <LineNode[]>new Array(splitNodeCount);
splitNodes = new Array(splitNodeCount) as LineNode[];
let splitNodeIndex = 0;
for (let i = 0; i < splitNodeCount; i++) {
splitNodes[i] = new LineNode();