FeatureMapUtil.Validator validator = FeatureMapUtil.getValidator(owner.eClass(), feature);
for (int i = 0, size = delegateSize(); i < size; ++i)
{
Entry entry = delegateGet(i);
if (validator.isValid(entry.getEStructuralFeature()))
{
return false;
}
}
return true;
FeatureMapUtil.Validator validator = FeatureMapUtil.getValidator(owner.eClass(), entryFeature);
for (int i = 0, size = delegateSize(); i < size; ++i)
{
Entry otherEntry = delegateGet(i);
if (validator.isValid(otherEntry.getEStructuralFeature()) && i != index)
{
throw new IllegalArgumentException("The multiplicity constraint is violated");
}
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/DelegatingFeatureMap.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/DelegatingFeatureMap.java
|
Method name: boolean isEmpty(EStructuralFeature)
|
|
Method name: Entry set(int, Entry)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 5
|
|
1 | FeatureMapUtil.Validator validator = FeatureMapUtil.getValidator(owner.eClass(), feature);↵ | | 1 | FeatureMapUtil.Validator validator = FeatureMapUtil.getValidator(owner.eClass(), entryFeature);↵
|
2 | for (int i = 0, size = delegateSize(); i < size; ++i)↵ | | 2 | for (int i = 0, size = delegateSize(); i < size; ++i)↵
|
3 | {↵ | | 3 | ↵
|
| | | 4 | {↵
|
4 | Entry entry = delegateGet(i);↵ | | 5 | Entry otherEntry = delegateGet(i);↵
|
5 | if (validator.isValid(entry.getEStructuralFeature()))↵ | | 6 | if (validator.isValid(otherEntry.getEStructuralFeature())↵
|
| | | 7 | && i != index)↵
|
6 | {↵ | | 8 | {↵
|
7 | return false;↵ | | 9 | throw new IllegalArgumentException("The multiplicity constraint is violated");↵
|
8 | }↵ | | 10 | ↵
|
9 | }↵ | | 11 | }↵
|
10 | return true; | | 12 | }
|
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 declared in the same class |
Number of node comparisons | 1 |