for (Map.Entry<? extends K, ? extends V> entry : map.entrySet())
{
put(entry.getKey(), entry.getValue());
}
for (Map.Entry<? extends String, ? extends Object> entry : map.entrySet())
{
put(entry.getKey(), entry.getValue());
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEMap.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/EPackageRegistryImpl.java
|
Method name: void putAll(Map extends K,? extends V>)
|
|
Method name: void putAll(Map extends String,? extends Object>)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for (Map.Entry<? extends K, ? extends V> entry : map.entrySet())↵ | | 1 | for (Map.Entry<? extends String, ? extends Object> entry : map.entrySet())↵
|
2 | {↵ | | 2 | ↵
|
| | | 3 | {↵
|
3 | put(entry.getKey(), entry.getValue());↵ | | 4 | put(entry.getKey(), entry.getValue());↵
|
4 | } | | 5 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |