for (int i = 0; i < size; ++i)
{
Object o1 = data[i];
Object o2 = objects.next();
if (o1 == null ? o2 != null : !o1.equals(o2))
{
return false;
}
}
for (int i = 0; i < size; ++i)
{
Object o1 = data[i];
Object o2 = objects.next();
if (o1 != o2)
{
return false;
}
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEList.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEList.java
|
Method name: boolean equals(Object)
|
|
Method name: boolean equals(Object)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | for (int i = 0; i < size; ++i)↵ | | 1 | for (int i = 0; i < size; ++i)↵
|
2 | {↵ | | 2 | {↵
|
3 | Object o1 = data[i];↵ | | 3 | Object o1 = data[i];↵
|
4 | Object o2 = objects.next();↵ | | 4 | Object o2 = objects.next();↵
|
5 | if (o1 == null ? o2 != null : !o1.equals(o2))↵ | | 5 | if (o1 != o2)↵
|
6 | {↵ | | 6 | {↵
|
7 | return false;↵ | | 7 | return false;↵
|
8 | }↵ | | 8 | }↵
|
9 | } | | 9 | }
|
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.0 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |