标签:which his nbsp close not algo https nal ring
https://docs.sonarqube.org/latest/user-guide/issues/#header-4
To determine the creation date of an issue, an algorithm is executed during each analysis to determine whether an issue is new or existed previously.
This algorithm relies on content hashes (excluding whitespace) for the line the issue is reported on.
For multi-line issues, the hash of the first line is used.
For each file (after detection of file renaming), the algorithm takes the base list of issues from the previous analysis, and tries to match those issues with the raw issue list reported by the new analysis.
The algorithm tries to first match using the strongest evidence, and then falls back to weaker heuristics启发式的.
Unmatched "base" issues are closed as fixed.
Unmatched "raw" issues are new.
标签:which his nbsp close not algo https nal ring
原文地址:https://www.cnblogs.com/chucklu/p/10678639.html