long val = 0;
if (data.length() > 0) {
try {
val = Long.parseLong(data);
} catch (NumberFormatException e) {
val = 0;
}
}
return val;
int val = 0;
if (data.length() > 0) {
try {
val = Integer.parseInt(data);
} catch (NumberFormatException e) {
val = 0;
}
}
return val;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/monitor/parser/MonitorHandler.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/monitor/parser/MonitorHandler.java
|
Method name: long parseLong(String)
|
|
Method name: int parseInt(String)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | long val = 0;↵ | | 1 | int val = 0;↵
|
2 | if (data.length() > 0) {↵ | | 2 | if (data.length() > 0) {↵
|
3 | try {↵ | | 3 | try {↵
|
4 | val = Long.parseLong(data);↵ | | 4 | val = Integer.parseInt(data);↵
|
5 | } catch (NumberFormatException e) {↵ | | 5 | } catch (NumberFormatException e) {↵
|
6 | val = 0;↵ | | 6 | val = 0;↵
|
7 | }↵ | | 7 | }↵
|
8 | }↵ | | 8 | }↵
|
9 | return val; | | 9 | return val;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 1 |