if(prefixLength >= s.length())
break loop;
if(!compareChars(s.charAt(prefixLength),ch,ignoreCase))
break loop;
if(prefixLength >= s.length())
break loop;
if(!compareChars(s.charAt(prefixLength),ch,ignoreCase))
break loop;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/MiscUtilities.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/MiscUtilities.java
|
Method name: String getLongestPrefix(List, boolean)
|
|
Method name: String getLongestPrefix(Object[], boolean)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if(prefixLength >= s.length())↵ | | 1 | if(prefixLength >= s.length())↵
|
2 | break loop;↵ | | 2 | break loop;↵
|
3 | if(!compareChars(s.charAt(prefixLength),ch,ignoreCase))↵ | | 3 | if(!compareChars(s.charAt(prefixLength),ch,ignoreCase))↵
|
4 | break loop; | | 4 | break loop;
|
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.6 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 16 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 4 |
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.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
11 | if (prefixLength >= s.length()) | | 11 | if (prefixLength >= s.length()) |
12 | | | 12 | |
13 | if (!compareChars(s.charAt(prefixLength), ch, ignoreCase)) | | 13 | if (!compareChars(s.charAt(prefixLength), ch, ignoreCase)) |
14 | | | 14 | |
Precondition Violations (4)
Row |
Violation |
1 | Statement break loop; without innermost loop |
2 | Statement break loop; without innermost loop |
3 | Statement break loop; without innermost loop |
4 | Statement break loop; without innermost loop |