protected FeatureMap.Entry createEntry(EStructuralFeature eStructuralFeature, Object value)
{
return FeatureMapUtil.createEntry(eStructuralFeature, value);
}
protected FeatureMap.Entry.Internal createRawEntry(EStructuralFeature eStructuralFeature, Object value)
{
return FeatureMapUtil.createRawEntry(eStructuralFeature, value);
}
protected NotificationImpl createNotification
(int eventType, EStructuralFeature feature, Object oldObject, Object newObject, int index, boolean wasSet)
{
return new FeatureMapUtil.FeatureENotificationImpl(owner, eventType, feature, oldObject, newObject, index, wasSet);
}
protected boolean isMany(EStructuralFeature feature)
{
return FeatureMapUtil.isMany(owner, feature);
}
@Override
protected boolean hasInverse()
{
return true;
}
@Override
protected boolean hasShadow()
{
return true;
protected FeatureMap.Entry createEntry(EStructuralFeature eStructuralFeature, Object value)
{
return FeatureMapUtil.createEntry(eStructuralFeature, value);
}
protected FeatureMap.Entry.Internal createRawEntry(EStructuralFeature eStructuralFeature, Object value)
{
return FeatureMapUtil.createRawEntry(eStructuralFeature, value);
}
protected NotificationImpl createNotification
(int eventType, EStructuralFeature feature, Object oldObject, Object newObject, int index, boolean wasSet)
{
return new FeatureMapUtil.FeatureENotificationImpl(owner, eventType, feature, oldObject, newObject, index, wasSet);
}
protected boolean isMany(EStructuralFeature feature)
{
return FeatureMapUtil.isMany(owner, feature);
}
@Override
protected boolean hasInverse()
{
return true;
}
@Override
protected boolean hasShadow()
{
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | protected FeatureMap.Entry createEntry(EStructuralFeature eStructuralFeature, Object value)↵ | | 1 | protected FeatureMap.Entry createEntry(EStructuralFeature eStructuralFeature, Object value)↵
|
2 | {↵ | | 2 | {↵
|
3 | return FeatureMapUtil.createEntry(eStructuralFeature, value);↵ | | 3 | return FeatureMapUtil.createEntry(eStructuralFeature, value);↵
|
4 | }↵ | | 4 | }↵
|
|
5 | protected FeatureMap.Entry.Internal createRawEntry(EStructuralFeature eStructuralFeature, Object value)↵ | | 5 | protected FeatureMap.Entry.Internal createRawEntry(EStructuralFeature eStructuralFeature, Object value)↵
|
6 | {↵ | | 6 | {↵
|
7 | return FeatureMapUtil.createRawEntry(eStructuralFeature, value);↵ | | 7 | return FeatureMapUtil.createRawEntry(eStructuralFeature, value);↵
|
8 | }↵ | | 8 | }↵
|
|
9 | protected NotificationImpl createNotification↵ | | 9 | protected NotificationImpl createNotification↵
|
10 | (int eventType, EStructuralFeature feature, Object oldObject, Object newObject, int index, boolean wasSet)↵ | | 10 | (int eventType, EStructuralFeature feature, Object oldObject, Object newObject, int index, boolean wasSet)↵
|
11 | {↵ | | 11 | {↵
|
12 | return new FeatureMapUtil.FeatureENotificationImpl(owner, eventType, feature, oldObject, newObject, index, wasSet);↵ | | 12 | return new FeatureMapUtil.FeatureENotificationImpl(owner, eventType, feature, oldObject, newObject, index, wasSet);↵
|
13 | }↵ | | 13 | }↵
|
|
14 | protected boolean isMany(EStructuralFeature feature)↵ | | 14 | protected boolean isMany(EStructuralFeature feature)↵
|
15 | {↵ | | 15 | {↵
|
16 | return FeatureMapUtil.isMany(owner, feature);↵ | | 16 | return FeatureMapUtil.isMany(owner, feature);↵
|
17 | }↵ | | 17 | }↵
|
|
18 | @Override↵ | | 18 | @Override↵
|
19 | protected boolean hasInverse()↵ | | 19 | protected boolean hasInverse()↵
|
20 | {↵ | | 20 | {↵
|
21 | return true;↵ | | 21 | return true;↵
|
22 | }↵ | | 22 | }↵
|
|
23 | @Override↵ | | 23 | @Override↵
|
24 | protected boolean hasShadow()↵ | | 24 | protected boolean hasShadow()↵
|
25 | {↵ | | 25 | {↵
|
26 | return true; | | 26 | return true;
|
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 | |
Number of node comparisons | 0 |