while (!current.op_equal19(context, afterEnd).isTrue()) {
block.yield(context, current);
if (!excl && current.op_equal19(context, end).isTrue()) break;
current = current.callMethod(context, "succ").convertToString();
if (excl && current.op_equal19(context, end).isTrue()) break;
if (current.value.realSize > end.value.realSize || current.value.realSize == 0) break;
}
while (!current.op_equal19(context, afterEnd).isTrue()) {
block.yield(context, current);
if (!excl && current.op_equal19(context, end).isTrue()) break;
current = current.callMethod(context, "succ").convertToString();
if (excl && current.op_equal19(context, end).isTrue()) break;
if (current.value.realSize > end.value.realSize || current.value.realSize == 0) break;
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyString.java
|
Method name: IRubyObject uptoCommon18(ThreadContext, IRubyObject, boolean, Block)
|
|
Method name: IRubyObject uptoCommon19(ThreadContext, IRubyObject, boolean, Block)
|
Number of AST nodes: 9
|
|
Number of AST nodes: 9
|
|
1 | while (!current.op_equal19(context, afterEnd).isTrue()) {↵ | | 1 | while (!current.op_equal19(context, afterEnd).isTrue()) {↵
|
2 | block.yield(context, current);↵ | | 2 | block.yield(context, current);↵
|
3 | if (!excl && current.op_equal19(context, end).isTrue()) break;↵ | | 3 | if (!excl && current.op_equal19(context, end).isTrue()) break;↵
|
4 | current = current.callMethod(context, "succ").convertToString();↵ | | 4 | current = current.callMethod(context, "succ").convertToString();↵
|
5 | if (excl && current.op_equal19(context, end).isTrue()) break;↵ | | 5 | if (excl && current.op_equal19(context, end).isTrue()) break;↵
|
6 | if (current.value.realSize > end.value.realSize || current.value.realSize == 0) break;↵ | | 6 | if (current.value.realSize > end.value.realSize || current.value.realSize == 0) break;↵
|
7 | } | | 7 | }
|
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) | 2.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 36 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 9 |
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) | 5.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
9 | while (!current.op_equal19(context, afterEnd).isTrue()) | | 23 | while (!current.op_equal19(context, afterEnd).isTrue()) |
10 | block.yield(context, current); | | 24 | block.yield(context, current); |
11 | if (!excl && current.op_equal19(context, end).isTrue()) | | 25 | if (!excl && current.op_equal19(context, end).isTrue()) |
12 | | | 26 | |
13 | current = current.callMethod(context, "succ").convertToString(); | | 27 | current = current.callMethod(context, "succ").convertToString(); |
14 | if (excl && current.op_equal19(context, end).isTrue()) | | 28 | if (excl && current.op_equal19(context, end).isTrue()) |
15 | | | 29 | |
16 | if (current.value.realSize > end.value.realSize || current.value.realSize == 0) | | 30 | if (current.value.realSize > end.value.realSize || current.value.realSize == 0) |
17 | | | 31 | |
Precondition Violations (0)
Row |
Violation |