if (null != requiredImplementationVersion) {
if (null == implementationVersion
|| !isCompatible(implementationVersion, requiredImplementationVersion)) {
return REQUIRE_IMPLEMENTATION_UPGRADE;
}
}
for (int j = 0; j < alphaSize; j++) {
if (length[j] == i) {
perm[pp++] = j;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/extension/Extension.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
|
Method name: Compatibility getCompatibilityWith(Extension)
|
|
Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if (null != requiredImplementationVersion) {↵ | | 1 | for (int j = 0; j < alphaSize; j++) {↵
|
2 | if (null == implementationVersion↵ | | 2 | if (↵
|
3 | || !isCompatible(implementationVersion, requiredImplementationVersion)) {↵ | | |
|
4 | return REQUIRE_IMPLEMENTATION_UPGRADE;↵ | | 3 | length[j] == i) {↵
|
| | | 4 | perm[pp++] = j;↵
|
| | | 5 | }↵
|
5 | }↵ | | 6 | }
|
6 | } | | | |
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |