int result = 0;
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {
if (((Node) it.next()).isValid()) {
result++;
}
}
return result;
int result = 0;
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {
if (((Node) it.next()).isValid()) {
result++;
}
}
return result;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/collection/AbstractCollectionRegionAccessStrategyTestCase.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/entity/AbstractEntityRegionAccessStrategyTestCase.java
|
Method name: int getValidChildrenCount(Node)
|
|
Method name: int getValidChildrenCount(Node)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int result = 0;↵ | | 1 | int result = 0;↵
|
2 | for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {↵ | | 2 | for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {↵
|
3 | if (((Node) it.next()).isValid()) {↵ | | 3 | if (((Node) it.next()).isValid()) {↵
|
4 | result++;↵ | | 4 | result++;↵
|
5 | }↵ | | 5 | }↵
|
6 | }↵ | | 6 | }↵
|
7 | return result; | | 7 | return result;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | int result = 0; | | 1 | int result = 0; |
2 | for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) | | 2 | for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) |
3 | if (((Node)it.next()).isValid()) | | 3 | if (((Node)it.next()).isValid()) |
4 | | | 4 | |
5 | return result; | | 5 | return result; |
Precondition Violations (0)
Row |
Violation |