if (recurse) {
NodeList recmatches = listChildNodes(child, filter, recurse);
final int reclength = recmatches.getLength();
for (int j = 0; j < reclength; j++) {
matches.addElement(recmatches.item(i));
for (int i = 0; i < instructions.size(); i++) {
ImageOperation instr = ((ImageOperation) instructions.elementAt(i));
if (instr instanceof DrawOperation) {
PlanarImage image = null;
// If this TransformOperation has DrawOperation children
// then Rotate the first child and return.
performScale(image);
return image;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/DOMUtil.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/optional/image/Scale.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (recurse) {↵ | | |
|
2 | NodeList recmatches = listChildNodes(child, filter, recurse);↵ | | |
|
3 | final int reclength = recmatches.getLength();↵ | | |
|
4 | for (int j = 0; j < reclength; j++) {↵ | | |
|
5 | matches.addElement(recmatches.item(i));↵ | | |
|
6 | ↵ | | 1 | for (int i = 0; i < instructions.size(); i++) {↵
|
| | | 2 | ImageOperation instr = ((ImageOperation) instructions.elementAt(i));↵
|
| | | 3 | if (instr instanceof DrawOperation) {↵
|
| | | 4 | PlanarImage image = null;↵
|
| | | 5 | // If this TransformOperation has DrawOperation children↵
|
| | | 6 | // then Rotate the first child and return.↵
|
| | | 7 | performScale(image);↵
|
| | | 8 | return image;↵
|
7 | | | 9 |
|
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 |