for ( int i = 0; i < spaces.length; i++ ) {
querySpaces.add( spaces[i] );
}
for ( int i = 0; i < spaces.length; i++ ) {
querySpaces.add( spaces[i] );
}
if ( superQuery != null ) superQuery.addQuerySpaces( spaces );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/HqlSqlWalker.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/classic/QueryTranslatorImpl.java
|
Method name: void addQuerySpaces(Serializable[])
|
|
Method name: void addQuerySpaces(Serializable[])
|
Number of AST nodes: 2
|
|
Number of AST nodes: 4
|
|
1 | for ( int i = 0; i < spaces.length; i++ ) {↵ | | 1 | for ( int i = 0; i < spaces.length; i++ ) {↵
|
2 | querySpaces.add( spaces[i] );↵ | | 2 | querySpaces.add( spaces[i] );↵
|
3 | } | | 3 | }↵
|
| | | 4 | if ( superQuery != null ) superQuery.addQuerySpaces( spaces );
|
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.2 |
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 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | for (int i = 0; i < spaces.length; i++) | | 1 | for (int i = 0; i < spaces.length; i++) |
2 | querySpaces.add(spaces[i]); | | 2 | querySpaces.add(spaces[i]); |
Precondition Violations (0)
Row |
Violation |