public boolean contains(EStructuralFeature feature, Object object)
{
return featureMap.contains(feature, object);
}
public boolean containsAll(EStructuralFeature feature, Collection<?> collection)
{
return featureMap.containsAll(feature, collection);
}
public int indexOf(EStructuralFeature feature, Object object)
{
return featureMap.indexOf(feature, object);
public boolean basicContains(EStructuralFeature feature, Object object)
{
return featureMap.basicContains(feature, object);
}
public boolean basicContainsAll(EStructuralFeature feature, Collection<?> collection)
{
return featureMap.basicContainsAll(feature, collection);
}
public int basicIndexOf(EStructuralFeature feature, Object object)
{
return featureMap.basicIndexOf(feature, object);
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/FeatureMapUtil.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/FeatureMapUtil.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public boolean contains(EStructuralFeature feature, Object object)↵ | | 1 | public boolean basicContains(EStructuralFeature feature, Object object)↵
|
2 | {↵ | | 2 | {↵
|
3 | return featureMap.contains(feature, object);↵ | | 3 | return featureMap.basicContains(feature, object);↵
|
4 | }↵ | | 4 | }↵
|
|
5 | public boolean containsAll(EStructuralFeature feature, Collection<?> collection)↵ | | 5 | public boolean basicContainsAll(EStructuralFeature feature, Collection<?> collection)↵
|
6 | {↵ | | 6 | {↵
|
7 | return featureMap.containsAll(feature, collection);↵ | | 7 | return featureMap.basicContainsAll(feature, collection);↵
|
8 | }↵ | | 8 | }↵
|
|
9 | public int indexOf(EStructuralFeature feature, Object object)↵ | | 9 | public int basicIndexOf(EStructuralFeature feature, Object object)↵
|
10 | {↵ | | 10 | {↵
|
11 | return featureMap.indexOf(feature, object); | | 11 | return featureMap.basicIndexOf(feature, object);
|
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 |