"SonarSource介绍—认知复杂度文档及其新的理解度测量方法"

需积分: 20 38 浏览量更新于2024-01-15 收藏 548KB PDF 举报

SonarSource is a Swiss company that has developed a document titled "Cognitive Complexity.pdf," which introduces a new way of measuring understandability. The document was authored by G. Ann Campbell and copyrighted by SonarSource S.A. The concept of Cognitive Complexity is presented as a new measurement that goes beyond the traditional Cyclomatic Complexity, which was originally designed to assess the "testability and maintainability" of a module's control flow. The document discusses the limitations of Cyclomatic Complexity and introduces Cognitive Complexity as an alternative approach to measuring the cognitive load required to understand a piece of code. By taking into account the nesting and logical operators, Cognitive Complexity provides a more accurate assessment of code understandability. This new metric aims to help developers write clearer, more readable code and ultimately improve the maintainability of software systems. The document provides a comprehensive overview of the principles behind Cognitive Complexity and explains the process for calculating it. It also includes examples to illustrate how Cognitive Complexity differs from Cyclomatic Complexity in specific code scenarios. By emphasizing the importance of writing code that is not only functionally correct but also easily comprehensible, SonarSource's document highlights the company's commitment to improving the overall quality of software development. In summary, the "Cognitive Complexity.pdf" document from SonarSource introduces a new way of evaluating code understandability through the concept of Cognitive Complexity. By addressing the limitations of traditional metrics like Cyclomatic Complexity, SonarSource aims to provide developers with a more effective tool for writing maintainable and understandable code. This underscores the company's dedication to advancing the field of software development and promoting best practices for code quality.

An illustration of the problem

It is useful to begin the discussion of Cognitive Complexity with an example of the problem it

is designed to address. The two following methods have equal Cyclomatic Complexity, but

are strikingly different in terms of understandability.

int sumOfPrimes(int max) { // +1

int total = 0;

OUT: for (int i = 1; i <= max; ++i) { // +1

for (int j = 2; j < i; ++j) { // +1

if (i % j == 0) { // +1

continue OUT;

}

total += i;

}

return total;

} // Cyclomatic Complexity 4

String getWords(int number) { // +1

switch (number) {

case 1: // +1

return "one";

case 2: // +1

return "a couple";

case 3: // +1

return “a few”;

default:

return "lots";

}

} // Cyclomatic Complexity 4

The mathematical model underlying Cyclomatic Complexity gives these two methods equal

weight, yet it is intuitivel

y obvious that the control flow of sumOfPrimes is more difficult to

understand than that of getWords. This is why Cognitive Complexity abandons the use of

mathematical models for assessing control flow in favor of a set of simple rules for turning

programmer intuition into numbers.

Basic criteria and methodology

A Cognitive Complexity score is assessed according to three basic rules:

1. Ignore structures that a

llow multiple statements to be readably shorthanded into one

2. Increment (add one) for each break in the linear flow of the code

3. Increment when flow-breaking structures are nested

Additionally, a complexity score is made up of four different types of increments:

A. Nesting - assessed for nesting control flow structures inside each other

B. Structural - assessed on control flow structures that are subject to

a nesting

increment, and that increase the nesting count

C. Fundamental - assessed on statements not subject to a nesting increment

D. Hybrid - assessed on control flow structures that are not subject to a nesting

increment, but which do increase the nesting count

- 4 -

Cognitive Complexity - a new way of measuring understandability

剩余20页未读，继续阅读

一线大码

粉丝: 2905
资源: 2

"SonarSource介绍—认知复杂度文档及其新的理解度测量方法"

复杂性思考第二版英文版pdf

NOIP普及组 提高组 CSP-J CSP-S初赛 算法的时间复杂度部分题目.pdf

CognitiveComplexity.pdf

时间复杂度计算练习.zip

时间复杂度分析AlgorithmFloyd.pptx

时间复杂度比较.pdf

Dinkelbach复杂度分析.pdf

各种排序算法的稳定性和时间复杂度小结.doc

银河麒麟桌面版操作系统密码复杂度设置.pdf原版文档

最新资源

NOIP普及组提高组 CSP-J CSP-S初赛算法的时间复杂度部分题目.pdf