原始的方法的圈复杂度是 43。
圈复杂度用于衡量类型或方法在结构上的复杂度。
Cyclomatic complexity is a measure of the structural complexity of the type or method.
可维护性索引的计算依据为：代码行数、程序量和圈复杂度。
The maintainability index is calculated by using the following metrics: lines of code, program volume, and cyclomatic complexity.
圈复杂度是衡量一个方法相对于另一个方法的相对复杂度的指标。
Cyclomatic complexity is purely a measure of the relative complexity of one method versus another.
在这里，有趣的是我们可以使用圈复杂度而不是使用代码覆盖率来找出这个缺陷。
What's interesting here is that we were able to spot this defect using cyclomatic complexity rather than code coverage.
之前每个if块占用3行代码（并贡献了1 个点的圈复杂度）。
Each of the former if blocks took 3 lines of code (and contributed 1 cyclomatic complexity point).
圈复杂度是在我前面提到的那些研究期间开创的，它可以精确地测量路径复杂度。
Cyclomatic complexity, pioneered during those studies I previously mentioned, precisely measures path complexity.
什么叫圈复杂度(cyclomatic complexity) ？为什么它很重要？
与圈复杂度相关的常见问题包括 “我的代码与别人的代码相比怎么样？”和 “对于一个类，多大的数值是合适的？”
Some of the common questions relating to cyclomatic complexity are "How does my code compare to others?" and "What is a good number for a particular class?"
圈复杂性公式(cyclomatic complexity formula)，被Thomas McCabe首先提出，它是基于一个函数的分支数量来确定复杂度的。
The cyclomatic complexity formula, first developed by Thomas McCabe, is based on the number of branches in a function.
圈复杂性公式(cyclomatic complexity formula)，被Thomas McCabe首先提出，它是基于一个函数的分支数量来确定复杂度的。
The cyclomatic complexity formula, first developed by Thomas McCabe, is based on the number of branches in a function.
应用推荐