if (c < 0xff) {
bytes[i] = (byte)(c + 1);
pos = -1;
break;
}
if ((ASCII.isDigit(c) && c < '9') || (ASCII.isLower(c) && c < 'z') || (ASCII.isUpper(c) && c < 'Z')) {
bytes[i] = (byte)(c + 1);
pos = -1;
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 succ_bang()
|
|
Method name: IRubyObject succ_bang()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (c < 0xff) {↵ | | 1 | if ((ASCII.isDigit(c) && c < '9') || (ASCII.isLower(c) && c < 'z') || (ASCII.isUpper(c) && c < 'Z')) {↵
|
2 | bytes[i] = (byte)(c + 1);↵ | | 2 | bytes[i] = (byte)(c + 1);↵
|
3 | pos = -1;↵ | | 3 | pos = -1;↵
|
4 | break;↵ | | 4 | break;↵
|
5 | } | | 5 | }
|
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.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |