Cor*_*ott 6 java code-complexity
我想知道如何减少以下代码的Cyclomatic Complexity,如果这是我应该担心的事情.
请参考方法ValuePojo.getSomething()(请不要担心变量命名,为了清楚起见,这个问题已重写)
public class ValuePojo
{
private ValueTypeEnum type;
private BigDecimal value1;
private BigDecimal value2;
private BigDecimal value3;
public ValuePojo()
{
super();
}
/**
* This method reports as "HIGH Cyclomatic Complexity"
*
* @return
*/
public BigDecimal getSomething()
{
if (this.type == null)
{
return null;
}
switch (this.type)
{
case TYPE_A:
case TYPE_B:
case TYPE_C:
case TYPE_D:
return this.value1;
case TYPE_E:
case TYPE_F:
case TYPE_G:
case TYPE_H:
return this.value2;
case TYPE_I:
case TYPE_J:
return this.value3;
}
return null;
}
}
Run Code Online (Sandbox Code Playgroud)
如果你真的需要降低圈复杂度,可以考虑使用Map.显然,在您的实现中,它应该只被创建和初始化一次.
public BigDecimal getSomething() {
if (this.type == null) {
return null;
}
Map<Type,BigDecimal> map = new HashMap<Type,BigDecimal>();
map.put(TYPE_A, value1);
map.put(TYPE_B, value1);
map.put(TYPE_C, value1);
map.put(TYPE_D, value1);
map.put(TYPE_E, value2);
map.put(TYPE_F, value2);
map.put(TYPE_G, value2);
map.put(TYPE_H, value2);
map.put(TYPE_I, value3);
map.put(TYPE_J, value3);
return map.get(type);
}
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
19693 次 |
| 最近记录: |