Entry entry = entries[i];
if (validator.isValid(entry.getEStructuralFeature()))
{
if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue()))
{
return false;
}
else
{
doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object));
return true;
}
}
Entry entry = delegateGet(i);
if (validator.isValid(entry.getEStructuralFeature()))
{
if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue()))
{
return false;
}
else
{
doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object));
return true;
}
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicFeatureMap.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/DelegatingFeatureMap.java
|
Method name: boolean add(EStructuralFeature, Object)
|
|
Method name: boolean add(EStructuralFeature, Object)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | Entry entry = entries[i];↵ | | 1 | Entry entry = delegateGet(i);↵
|
2 | if (validator.isValid(entry.getEStructuralFeature()))↵ | | 2 | if (validator.isValid(entry.getEStructuralFeature()))↵
|
3 | {↵ | | 3 | {↵
|
4 | if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue()))↵ | | 4 | if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue()))↵
|
5 | {↵ | | 5 | {↵
|
6 | return false;↵ | | 6 | return false;↵
|
7 | }↵ | | 7 | }↵
|
8 | else↵ | | 8 | else↵
|
9 | {↵ | | 9 | {↵
|
10 | doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object));↵ | | 10 | doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object));↵
|
11 | return true;↵ | | 11 | return true;↵
|
12 | }↵ | | 12 | }↵
|
13 | } | | 13 | }
|
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 in different classes having the same super class |
Number of node comparisons | 19 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 6 |
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) | 1.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | Entry entry = entries[i]; | | 7 | Entry entry = delegateGet(i); |
9 | if (validator.isValid(entry.getEStructuralFeature())) | | 8 | if (validator.isValid(entry.getEStructuralFeature())) |
10 | if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue())) | | 9 | if (isFeatureMap ? entry.equals(object) : object == null ? entry.getValue() == null : object.equals(entry.getValue())) |
11 | | | 10 | |
| | | | |
12 | doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object)); | | 11 | doSet(i, isFeatureMap ? (Entry)object : createEntry(feature, object)); |
13 | | | 12 | |
Precondition Violations (4)
Row |
Violation |
1 | Conditional return true; |
2 | Conditional return true; |
3 | Conditional return false; |
4 | Conditional return false; |