cyclomatic-complexity

问题 I have one function which is having if elseif conditions and the cyclomatic complexity is approaching 5. How do I reduce it? function testFunc() { var step = getModel('step'); if(step === 1) { this.resetTask(); //calling some function this.updateStep(0); return true; } else if(step === 2) { this.initTask; //some other function return true; } else if(step === 3) { this.name === 'add' ? this.add() : this.edit(); return true; } return false; } tried replacing with switch case but it didn't help.

问题 I have one function which is having if elseif conditions and the cyclomatic complexity is approaching 5. How do I reduce it? function testFunc() { var step = getModel('step'); if(step === 1) { this.resetTask(); //calling some function this.updateStep(0); return true; } else if(step === 2) { this.initTask; //some other function return true; } else if(step === 3) { this.name === 'add' ? this.add() : this.edit(); return true; } return false; } tried replacing with switch case but it didn't help.

来源： https://stackoverflow.com/questions/23782629/cyclomatic-complexity-for-multiple-return-statements

来源： https://stackoverflow.com/questions/23782629/cyclomatic-complexity-for-multiple-return-statements

问题 I want to know how will it affect to the Cyclomatic Complexity when having multiple start or stop nodes in a control flow diagram.If you could explain the relationship between Cyclomatic Complexity and Start/Stop nodes it will be a great help. 回答1: • A control flow graph can consist of many starts and stops. But according to McCabe's theory, if it is consist of multiple starts and stops it doesn't satisfy the formula. 来源： https://stackoverflow.com/questions/60485378/what-would-happen-if-a

问题 I want to know how will it affect to the Cyclomatic Complexity when having multiple start or stop nodes in a control flow diagram.If you could explain the relationship between Cyclomatic Complexity and Start/Stop nodes it will be a great help. 回答1: • A control flow graph can consist of many starts and stops. But according to McCabe's theory, if it is consist of multiple starts and stops it doesn't satisfy the formula. 来源： https://stackoverflow.com/questions/60485378/what-would-happen-if-a

问题 I want to reduce cyclomatic complexity of my switch case my code is : public String getCalenderName() { switch (type) { case COUNTRY: return country == null ? name : country.getName() + HOLIDAY_CALENDAR; case CCP: return ccp == null ? name : ccp.getName() + " CCP" + HOLIDAY_CALENDAR; case EXCHANGE: return exchange == null ? name : exchange.getName() + HOLIDAY_CALENDAR; case TENANT: return tenant == null ? name : tenant.getName() + HOLIDAY_CALENDAR; default: return name; } } This code blocks

问题 I want to reduce cyclomatic complexity of my switch case my code is : public String getCalenderName() { switch (type) { case COUNTRY: return country == null ? name : country.getName() + HOLIDAY_CALENDAR; case CCP: return ccp == null ? name : ccp.getName() + " CCP" + HOLIDAY_CALENDAR; case EXCHANGE: return exchange == null ? name : exchange.getName() + HOLIDAY_CALENDAR; case TENANT: return tenant == null ? name : tenant.getName() + HOLIDAY_CALENDAR; default: return name; } } This code blocks

问题 How does Sonar calculates software metrics particularly LOC and cyclomatic complexity? Does it uses any particular tools? IF yes, please also give the names. 回答1: For each supported language, a "squid" plugin is used to parse the source code and determine some base metrics such as LOC and complexity. How the complexity is calculated varies based on the plugin. For example, here's the source code files for the JavaScript plugin: https://github.com/SonarCommunity/sonar-javascript/tree/master

问题 I have a case here where the switch statement contains about 40 cases of each returning a different configured object based on input. This method is shown as having too high cyclomatic complexity in the metrics and usually I would change this into a map of handler objects. But this switch sits in a piece of code where performance is all-important so I came up with the question of how a HashMap lookup and handler call compares to a switch block execution performance-wise. Anyone compared that