for (int i = 0; i < size; ++i)
{
if (object.equals(data[i]))
{
return true;
}
}
for (int i = 0; i < size; ++i)
{
if (data[i] == object)
{
return true;
}
}
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 contains(Object)
|
|
Method name: boolean contains(Object)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < size; ++i)↵ | | 1 | for (int i = 0; i < size; ++i)↵
|
2 | {↵ | | 2 | {↵
|
3 | if (object.equals(data[i]))↵ | | 3 | if (data[i] == object)↵
|
4 | {↵ | | 4 | {↵
|
5 | return true;↵ | | 5 | return true;↵
|
6 | }↵ | | 6 | }↵
|
7 | } | | 7 | }
|
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |