for ( int i = 0, max = filterNames.length; i < max; i++ ) {
if ( enabledFilters.containsKey( filterNames[i] ) ) {
return true;
}
}
for (Iterator it = node.getChildren().iterator(); it.hasNext(); ) {
if (((Node) it.next()).isValid()) {
result++;
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/FilterHelper.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: boolean isAffectedBy(Map)
|
|
Method name: int getValidChildrenCount(Node)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 0, max = filterNames.length; i < max; i++ ) {↵ | | 1 | for (↵
|
2 | if ( enabledFilters.containsKey( filterNames[i] ) ) {↵ | | |
|
3 | return true;↵ | | |
|
4 | }↵ | | |
|
5 | ↵ | | 2 | Iterator it = node.getChildren().iterator(); it.hasNext(); ) {↵
|
| | | 3 | if (((Node) it.next()).isValid()) {↵
|
| | | 4 | result++;↵
|
| | | 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 |