protected static class EPackageData
{
public int id;
public EClassData[] eClassData;
public final int allocateEClassID()
{
for (int i = 0, length = eClassData.length; i < length; ++i)
{
EClassData eClassData = this.eClassData[i];
if (eClassData == null)
{
return i;
}
}
return -1;
protected static class EPackageData
{
public EPackage ePackage;
public EClassData[] eClassData;
public final int allocateEClassID()
{
for (int i = 0, length = eClassData.length; i < length; ++i)
{
EClassData eClassData = this.eClassData[i];
if (eClassData == null)
{
return i;
}
}
return -1;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/BinaryResourceImpl.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/BinaryResourceImpl.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | protected static class EPackageData↵ | | 1 | protected static class EPackageData↵
|
2 | {↵ | | 2 | {↵
|
3 | public int id;↵ | | 3 | public EPackage ePackage;↵
|
4 | public EClassData[] eClassData;↵ | | 4 | public EClassData[] eClassData;↵
|
|
5 | public final int allocateEClassID()↵ | | 5 | public final int allocateEClassID()↵
|
6 | {↵ | | 6 | {↵
|
7 | for (int i = 0, length = eClassData.length; i < length; ++i)↵ | | 7 | for (int i = 0, length = eClassData.length; i < length; ++i)↵
|
8 | {↵ | | 8 | {↵
|
9 | EClassData eClassData = this.eClassData[i];↵ | | 9 | EClassData eClassData = this.eClassData[i];↵
|
10 | if (eClassData == null)↵ | | 10 | if (eClassData == null)↵
|
11 | {↵ | | 11 | {↵
|
12 | return i;↵ | | 12 | return i;↵
|
13 | }↵ | | 13 | }↵
|
14 | }↵ | | 14 | }↵
|
15 | return -1; | | 15 | return -1;
|
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 |