for (int i = originalMapSize; i < size; ++i)
{
EClassifier eClassifier = eClassifiers.get(i);
String eClassifierName = getName(eClassifier);
EClassifier conflictingEClassifier = nameToClassifierMap.put(eClassifierName, eClassifier);
if (conflictingEClassifier != null && conflictingEClassifier != eClassifier)
{
nameToClassifierMap.put(eClassifierName, conflictingEClassifier);
for (int i = 0; i < originalMapSize; ++i)
{
EClassifier eClassifier = eClassifiers.get(i);
String eClassifierName = getName(eClassifier);
EClassifier conflictingEClassifier = nameToClassifierMap.put(eClassifierName, eClassifier);
if (conflictingEClassifier != null && conflictingEClassifier != eClassifier)
{
nameToClassifierMap.put(eClassifierName, conflictingEClassifier);
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicExtendedMetaData.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicExtendedMetaData.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = originalMapSize; i < size; ++i)↵ | | 1 | for (int i = 0; i < originalMapSize; ++i)↵
|
2 | {↵ | | 2 | ↵
|
| | | 3 | {↵
|
3 | EClassifier eClassifier = eClassifiers.get(i);↵ | | 4 | EClassifier eClassifier = eClassifiers.get(i);↵
|
4 | String eClassifierName = getName(eClassifier);↵ | | 5 | String eClassifierName = getName(eClassifier);↵
|
5 | EClassifier conflictingEClassifier = nameToClassifierMap.put(eClassifierName, eClassifier);↵ | | 6 | EClassifier conflictingEClassifier = nameToClassifierMap.put(eClassifierName, eClassifier);↵
|
6 | if (conflictingEClassifier != null && conflictingEClassifier != eClassifier)↵ | | 7 | if (conflictingEClassifier != null && conflictingEClassifier != eClassifier)↵
|
7 | {↵ | | 8 | {↵
|
8 | nameToClassifierMap.put(eClassifierName, conflictingEClassifier);↵ | | 9 | nameToClassifierMap.put(eClassifierName, conflictingEClassifier);↵
|
9 | | | 10 |
|
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 |