cyclomatic
美
英 
- 網(wǎng)絡(luò)圈;環(huán)形量度之和
例句
I've explained in previous articles in this series that cyclomatic complexity tends to be one of the harbingers of sticky code.
我在本系列前面的文章中已經(jīng)解釋了圈復(fù)雜性,它是令人討厭的代碼的一種先兆。
The bottom of the figure indicates the CheckStyle cyclomatic-complexity violation for a method.
該圖下面的部分指示出了一個方法的CheckStyle圈復(fù)雜度違規(guī)。
What's more, this tool also gathers the cyclomatic complexity of every method in a code base.
此外,此工具還收集代碼庫中每個方法的圈復(fù)雜度。
Testing methods with high cyclomatic complexity values is almost always like stepping into a maze -- no easy exit in sight.
具有高圈復(fù)雜度值的測試方法幾乎總是把事情弄得一團糟,無法輕易收場。
Measuring cyclomatic complexity is, therefore, particularly valuable in situations where you're working with a legacy code base.
所以,在使用遺留代碼庫的情況下,測量圈復(fù)雜度特別有價值。
Programs with lower cyclomatic complexity are easier to understand and less risky to modify.
循環(huán)復(fù)雜性低的程序更容易理解,編輯起來風(fēng)險也更小。
Cyclomatic complexity isn't the only complexity measurement for spotting high risk code, however.
不過,圈復(fù)雜性并不是確定高風(fēng)險代碼的惟一復(fù)雜性度量。
A good rule of thumb is to create a number of test cases equal to the cyclomatic complexity value of the code being tested.
一個好的經(jīng)驗法則是創(chuàng)建數(shù)量與將被測試代碼的圈復(fù)雜度值相等的測試用例。
This installment of the series covers the cyclomatic-complexity metric in a discussion about testing.
本系列的這一期在討論測試時介紹了圈復(fù)雜度度量。
The total number of noncommenting lines of code and the cyclomatic complexity per each method in the code base.
代碼庫中每個方法的非注釋代碼行的總數(shù)和圈復(fù)雜度。
Cyclomatic complexity, pioneered during those studies I previously mentioned, precisely measures path complexity.
圈復(fù)雜度是在我前面提到的那些研究期間開創(chuàng)的,它可以精確地測量路徑復(fù)雜度。
CheckStyle is another open source project with a similar cyclomatic complexity rule.
CheckStyle是另一個具有類似的圈復(fù)雜度規(guī)則的開放源碼項目。
Cyclomatic complexity is a measurement to determine the stability and level of confidence in a COBOL program.
Cyclomatic復(fù)雜性是決定COBOL程序中穩(wěn)定性及實效性程度的評價手段。
The maintainability index is a synthesis of three metrics: cyclomatic complexity, lines of code, and computational complexity.
可維護性指數(shù)由三個度量合成:圈復(fù)雜度、代碼行數(shù)和計算復(fù)雜性。
To determine the conditional-complexity code smell, you determine a method's cyclomatic complexity.
要確定條件復(fù)雜度代碼味道,需要確定方法的圈復(fù)雜度。
A few open source tools available to Java developers can report on cyclomatic complexity.
Java開發(fā)人員可使用一些開放源碼工具來報告圈復(fù)雜度。
What's interesting here is that we were able to spot this defect using cyclomatic complexity rather than code coverage.
在這里,有趣的是我們可以使用圈復(fù)雜度而不是使用代碼覆蓋率來找出這個缺陷。
The approximate size of a covering set as a lower limit (n+1, equivalent to cyclomatic complexity of a graph).
而覆蓋集的近似大小則被作為下限(n+1,等價于某個圖的環(huán)復(fù)雜性)。
At the code level, Maurice Halstead's software metrics and Tom McCabe's cyclomatic complexity model were widely accepted.
在代碼層次,MauriceHalstead的軟件規(guī)格和TomMcCabe的秩復(fù)雜度模型被廣泛接受。
Complexity indicators are mainly the cyclomatic complexity number V(g) and the number of statements in the code.
復(fù)雜度指示器主要是圈復(fù)雜數(shù)V和代碼中的聲明語句數(shù)。
The cyclomatic complexity formula, first developed by Thomas McCabe, is based on the number of branches in a function.
圈復(fù)雜性公式(cyclomaticcomplexityformula),被ThomasMcCabe首先提出,它是基于一個函數(shù)的分支數(shù)量來確定復(fù)雜度的。
PMD, another open source project that analyzes Java source files, has a series of rules, one of which reports cyclomatic complexity.
PMD是另一個分析Java源文件的開源項目,它有一系列的規(guī)則,其中之一就是報告圈復(fù)雜度。
Cyclomatic complexity is purely a measure of the relative complexity of one method versus another.
圈復(fù)雜度是衡量一個方法相對于另一個方法的相對復(fù)雜度的指標(biāo)。
Cyclomatic complexity is a measure of the relative complexity of one method versus another.
圈復(fù)雜度度量方法的相對復(fù)雜度。
Cyclomatic complexity is a measure of the structural complexity of the type or method.
圈復(fù)雜度用于衡量類型或方法在結(jié)構(gòu)上的復(fù)雜度。
A nice open source tool that measures cyclomatic complexity for the Java language is the open source JavaNCSS tool (see Resources).
一種可以度量Java語言圈復(fù)雜度的非常不錯的開源工具就是JavaNCSS工具(見參考資料)。
This graph shows three key metrics over time: code coverage, cyclomatic complexity, and cyclomatic complexity per method.
該圖顯示了過去的3個關(guān)鍵度量:代碼覆蓋、圈復(fù)雜度和每個方法的圈復(fù)雜度。
The two metrics I focus on in this article are cyclomatic complexity and afferent coupling.
本文主要討論兩個指標(biāo),圈復(fù)雜度(cyclomaticcomplexity)和傳入耦合(afferentcoupling)。
The cyclomatic complexity number ckjm reports represents the sum of the complexity of all the methods in the class.
ckjm報告的圈復(fù)雜度數(shù)字表示這個類中所有方法的復(fù)雜度之和。
I covered cyclomatic complexity in " Test-driven design, Part 2, " but it has some nuances I didn't discuss there.
我在“測試驅(qū)動設(shè)計,第2部分”中討論過圈復(fù)雜度,但是有一些細節(jié)沒有討論。
Thus, it makes sense only when compared to other cyclomatic-complexity measures.
因此,該指標(biāo)只有與其他圈復(fù)雜度指標(biāo)相比較才有用。
JavaNCSS: JavaNCSS is an open source metrics tool that provides method-level values for cyclomatic complexity.
JavaNCSS:JavaNCSS是一個開源的度量工具,提供圈復(fù)雜度的方法級的值。
More technical definitions come from such measures as cyclomatic complexity developed by McCabe 4 and others.
更學(xué)術(shù)的定義來自McCabe4和其他人開發(fā)出的度量秩數(shù)復(fù)雜度的方法。
The most effective way to reduce cyclomatic complexity is to pull out portions of code and place them into new methods.
減少圈復(fù)雜度的最有效方式是隔離代碼部分,將它們放入新的方法中。
CheckStyle, JavaNCSS, and PMD are open source tools that measure cyclomatic complexity.
以及PMD都是度量圈復(fù)雜度的開源工具。
Cyclomatic complexity is a measure that dates back to 1975 as defined by Thomas McCabe.
圈復(fù)雜度是一種度量方法,由ThomasMcCabe于1975年定義。
The maintainability index is calculated by using the following metrics: lines of code, program volume, and cyclomatic complexity.
可維護性索引的計算依據(jù)為:代碼行數(shù)、程序量和圈復(fù)雜度。
Cyclomatic complexity is a way to measure how tangled the paths are in the state space.
秩數(shù)復(fù)雜度是度量狀態(tài)空間中路徑有多紊亂的方式。
The original method had a cyclomatic complexity of 43.
原始的方法的圈復(fù)雜度是43。
Each of the former if blocks took 3 lines of code (and contributed 1 cyclomatic complexity point).
之前每個if塊占用3行代碼(并貢獻了1個點的圈復(fù)雜度)。