for (Item i = tab[index]; i != null; i = i.next) {
if (i.hashCode == hashCode && key.isEqualTo(i)) {
return i;
}
}
if(MiscUtilities.compareStrings(
files[i],file,ignoreCase) == 0)
{
return file;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/objectweb/asm/ClassWriter.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/BufferListSet.java
|
Method name: Item get(Item)
|
|
Method name: String getNextFile(View, String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 2
|
|
1 | for (Item i = tab[index]; i != null; i = i.next) {↵ | | |
|
2 | if (i.hashCode == hashCode && key.isEqualTo(i)) {↵ | | |
|
3 | return i;↵ | | |
|
4 | }↵ | | |
|
5 | ↵ | | 1 | if(MiscUtilities.compareStrings(↵
|
| | | 2 | files[i],file,ignoreCase) == 0)↵
|
| | | 3 | {↵
|
| | | 4 | return file;↵
|
6 | } | | 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 different classes |
Number of node comparisons | 1 |