int multi = 4;
StringBuffer spaces = new StringBuffer(level * multi);
for (int i = 0; i < level * multi; i++) {
spaces.append(" "); // $NON-NLS-1$
}
return spaces.toString();
int multi = 4;
StringBuffer spaces = new StringBuffer(level * multi);
for (int i = 0; i < level * multi; i++) {
spaces.append(" "); // $NON-NLS-1$
}
return spaces.toString();
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/control/gui/ModuleControllerGui.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/proxy/gui/ProxyControlGui.java
|
Method name: String spaces(int)
|
|
Method name: String spaces(int)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int multi = 4;↵ | | 1 | int multi = 4;↵
|
2 | StringBuffer spaces = new StringBuffer(level * multi);↵ | | 2 | StringBuffer spaces = new StringBuffer(level * multi);↵
|
3 | for (int i = 0; i < level * multi; i++) {↵ | | 3 | for (int i = 0; i < level * multi; i++) {↵
|
4 | spaces.append(" "); // $NON-NLS-1$↵ | | 4 | spaces.append(" "); // $NON-NLS-1$↵
|
5 | }↵ | | 5 | }↵
|
6 | return spaces.toString(); | | 6 | return spaces.toString();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | int multi = 4; | | 1 | int multi = 4; |
2 | StringBuffer spaces = new StringBuffer(level * multi); | | 2 | StringBuffer spaces = new StringBuffer(level * multi); |
3 | for (int i = 0; i < level * multi; i++) | | 3 | for (int i = 0; i < level * multi; i++) |
4 | | | 4 | |
5 | return spaces.toString(); | | 5 | return spaces.toString(); |
Precondition Violations (0)
Row |
Violation |