int i = 0;
for (Operand p: _pieces) {
_pieces.set(i, p.getSimplifiedOperand(valueMap));
i++;
}
return this;
int i = 0;
for (Operand p: _pieces) {
_pieces.set(i, p.getSimplifiedOperand(valueMap));
i++;
}
return this;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/compiler/ir/operands/CompoundString.java
|
|
File path: /jruby-1.4.0/src/org/jruby/compiler/ir/operands/BacktickString.java
|
Method name: Operand getSimplifiedOperand(Map)
|
|
Method name: Operand getSimplifiedOperand(Map)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int i = 0;↵ | | 1 | int i = 0;↵
|
2 | for (Operand p: _pieces) {↵ | | 2 | for (Operand p: _pieces) {↵
|
3 | _pieces.set(i, p.getSimplifiedOperand(valueMap));↵ | | 3 | _pieces.set(i, p.getSimplifiedOperand(valueMap));↵
|
4 | i++;↵ | | 4 | i++;↵
|
5 | }↵ | | 5 | }↵
|
|
6 | return this; | | 6 | return this;
|
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.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 13 |
-
{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.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | int i = 0; | | 1 | int i = 0; |
2 | for (Operand p : _pieces) | | 2 | for (Operand p : _pieces) |
3 | _pieces.set(i, p.getSimplifiedOperand(valueMap)); | | 3 | _pieces.set(i, p.getSimplifiedOperand(valueMap)); |
4 | | | 4 | |
5 | return this; | | 5 | return this; |
Precondition Violations (0)
Row |
Violation |