for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) {
if (this.ranges[i] <= ch && ch <= this.ranges[i+1])
return true;
}
for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) {
if (this.ranges[i] <= ch && ch <= this.ranges[i+1])
return false;
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java
|
Method name: boolean match(int)
|
|
Method name: boolean match(int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) {↵ | | 1 | for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) {↵
|
2 | if (this.ranges[i] <= ch && ch <= this.ranges[i+1])↵ | | 2 | if (this.ranges[i] <= ch && ch <= this.ranges[i+1])↵
|
3 | return true;↵ | | 3 | return false;↵
|
4 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are in the same method |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 3 |
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.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) | | 14 | for (int i = this.nonMapIndex; i < this.ranges.length; i += 2) |
9 | if (this.ranges[i] <= ch && ch <= this.ranges[i + 1]) | | 15 | if (this.ranges[i] <= ch && ch <= this.ranges[i + 1]) |
10 | | | 16 | |
Precondition Violations (2)
Row |
Violation |
1 | Conditional return true; |
2 | Conditional return false; |