-
Notifications
You must be signed in to change notification settings - Fork 14
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Allen Zhang (张涛)
committed
Oct 7, 2024
1 parent
e962960
commit 4236a54
Showing
7 changed files
with
2,417 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2,186 changes: 2,185 additions & 1 deletion
2,186
...ort/mock/dynamic-data/packages/canyon-platform/src/pages/index/projects/[id]/index.tsx.js
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,163 @@ | ||
| // 获取numberOfRows | ||
| // 获取行覆盖率 | ||
| function getLineCoverage(data) { | ||
| const statementMap = data.statementMap; | ||
| const statements = data.s; | ||
| const lineMap = Object.create(null); | ||
| Object.entries(statements).forEach(([st, count]) => { | ||
| if (!statementMap[st]) { | ||
| return; | ||
| } | ||
| const { line } = statementMap[st].start; | ||
| const prevVal = lineMap[line]; | ||
| if (prevVal === undefined || prevVal < count) { | ||
| lineMap[line] = count; | ||
| } | ||
| }); | ||
| return lineMap; | ||
| } | ||
| export const genFileDetailLines = (fileCoverage, fileContent) => { | ||
| // console.log(coverage) | ||
| const totalLines = fileContent.split("\n").length; | ||
| const lineStats = getLineCoverage(fileCoverage); | ||
| console.log(lineStats); | ||
| return Array.from({ length: totalLines }, (_, index) => { | ||
| return { | ||
| count: lineStats[index + 1], | ||
| }; | ||
| }); | ||
| }; | ||
|
|
||
| export function mergeIntervals(intervals) { | ||
| // 如果输入为空，直接返回空列表 | ||
| if (intervals.length === 0) { | ||
| return []; | ||
| } | ||
|
|
||
| // 将所有线段按起始位置进行排序 | ||
| intervals.sort((a, b) => a[0] - b[0]); | ||
|
|
||
| // 初始化结果列表 | ||
| const merged = []; | ||
| let [currentStart, currentEnd] = intervals[0]; | ||
|
|
||
| for (const [start, end] of intervals.slice(1)) { | ||
| if (start <= currentEnd) { | ||
| // 当前线段与前一个线段有重叠 | ||
| currentEnd = Math.max(currentEnd, end); // 更新结束位置 | ||
| } else { | ||
| // 当前线段与前一个线段没有重叠 | ||
| merged.push([currentStart, currentEnd]); // 将前一个线段加入结果列表 | ||
| [currentStart, currentEnd] = [start, end]; // 更新当前线段的起始和结束位置 | ||
| } | ||
| } | ||
|
|
||
| // 添加最后一个线段 | ||
| merged.push([currentStart, currentEnd]); | ||
|
|
||
| return merged; | ||
| } | ||
|
|
||
| export const ggggggfn = (filecoverage, fileContent) => { | ||
| const statementStats = filecoverage.s; | ||
| const statementMeta = filecoverage.statementMap; | ||
| const structuredText = fileContent | ||
| .split("\n") | ||
| .reduce((previousValue, currentValue, currentIndex) => { | ||
| return { | ||
| ...previousValue, | ||
| [currentIndex]: currentValue, | ||
| }; | ||
| }, {}); | ||
| const statementDecorations = []; | ||
|
|
||
| Object.entries(statementStats).forEach(([stName, count]) => { | ||
| const meta = statementMeta[stName]; | ||
| if (meta) { | ||
| const type = count > 0 ? "yes" : "no"; | ||
| const startCol = meta.start.column; | ||
| let endCol = meta.end.column + 1; | ||
| const startLine = meta.start.line; | ||
| const endLine = meta.end.line; | ||
|
|
||
| if (type === "no" && structuredText[startLine]) { | ||
| if (endLine !== startLine) { | ||
| endCol = structuredText[startLine].length; | ||
| } | ||
| // 转化为字符的起始 | ||
|
|
||
| let start = 0; | ||
| let end = 0; | ||
|
|
||
| for (let i = 0; i < startLine - 1; i++) { | ||
| start += structuredText[i].length + 1; | ||
| } | ||
| for (let i = 0; i < endLine - 1; i++) { | ||
| end += structuredText[i].length + 1; | ||
| } | ||
|
|
||
| start += startCol; | ||
| end += endCol; | ||
| statementDecorations.push([start, end]); | ||
| } | ||
| } | ||
| }); | ||
|
|
||
| const fnDecorations = []; | ||
| const fnStats = filecoverage.f; | ||
| const fnMeta = filecoverage.fnMap; | ||
| Object.entries(fnStats).forEach(([fName, count]) => { | ||
| const meta = fnMeta[fName]; | ||
| if (meta) { | ||
| const type = count > 0 ? "yes" : "no"; | ||
| // Some versions of the instrumenter in the wild populate 'func' | ||
| // but not 'decl': | ||
| const decl = meta.decl || meta.loc; | ||
| const startCol = decl.start.column; | ||
| let endCol = decl.end.column + 1; | ||
| const startLine = decl.start.line; | ||
| const endLine = decl.end.line; | ||
|
|
||
| if (type === "no" && structuredText[startLine]) { | ||
| if (endLine !== startLine) { | ||
| endCol = structuredText[startLine].length; | ||
| } | ||
|
|
||
| // 转化为字符的起始 | ||
|
|
||
| let start = 0; | ||
| let end = 0; | ||
|
|
||
| for (let i = 0; i < startLine - 1; i++) { | ||
| start += structuredText[i].length + 1; | ||
| } | ||
| for (let i = 0; i < endLine - 1; i++) { | ||
| end += structuredText[i].length + 1; | ||
| } | ||
|
|
||
| start += startCol; | ||
| end += endCol; | ||
| fnDecorations.push([start, end]); | ||
| } | ||
| } | ||
| }); | ||
|
|
||
| return mergeIntervals( | ||
| [...statementDecorations, ...fnDecorations].filter((item) => { | ||
| // defaultValue | ||
| if (item[0] >= item[1]) { | ||
| return false; | ||
| } else if (item[1] > fileContent.length) { | ||
| return false; | ||
| } else { | ||
| return item[0] < item[1]; | ||
| } | ||
| }), | ||
| ).map(([start, end]) => { | ||
| return { | ||
| start, | ||
| end, | ||
| properties: { class: "content-class-no-found" }, | ||
| }; | ||
| }); | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters