for ( int i = 0, max = filterNames.length; i < max; i++ ) {
if ( enabledFilters.containsKey( filterNames[i] ) ) {
return true;
}
}
while ( it.hasNext() ) {
if ( !map.containsKey( it.next() ) ) {
return false;
}
}
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/core/src/main/java/org/hibernate/util/IdentitySet.java
|
Method name: boolean isAffectedBy(Map)
|
|
Method name: boolean containsAll(Collection)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for ( int i = 0, max = filterNames.length; i < max; i++ ) {↵ | | |
|
2 | if ( enabledFilters.containsKey( filterNames[i]↵ | | 1 | while ( it.hasNext() ) {↵
|
3 | ) ) {↵ | | 2 | if ( !map.containsKey( it.next() ) ) {↵
|
4 | return true;↵ | | 3 | return false;↵
|
5 | }↵ | | 4 | }↵
|
6 | } | | 5 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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) | 0.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | if (enabledFilters.containsKey(filterNames[i])) | | 3 | if (!map.containsKey(it.next())) |
3 | | | 4 | |
Precondition Violations (0)
Row |
Violation |