for ( Iterator iterator = getWalker().getQuerySpaces().iterator(); iterator.hasNext(); ) {
buf.append( iterator.next() );
if ( iterator.hasNext() ) {
buf.append( "," );
}
}
while ( itr.hasNext() ) {
buff.append( itr.next() );
if ( itr.hasNext() ) {
buff.append( ", " );
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/AbstractStatement.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/any/ComplexPropertyValue.java
|
Method name: String getDisplayText()
|
|
Method name: String keyString()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for ( Iterator iterator = getWalker().getQuerySpaces().iterator(); iterator.hasNext(); ) {↵ | | 1 | while ( itr.hasNext() ) {
↵
|
2 | buf.append( iterator.next() );↵ | | 2 | buff.append( itr.next() );
↵
|
3 | if ( iterator.hasNext() ) {↵ | | 3 | if ( itr.hasNext() ) {
↵
|
4 | buf.append( "," );↵ | | 4 | buff.append( ", " );
↵
|
5 | }↵ | | 5 | }
↵
|
6 | } | | 6 | }
|
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 | 6 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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 |
5 | buf.append(iterator.next()); | | 4 | buff.append(itr.next()); |
6 | if (iterator.hasNext()) | | 5 | if (itr.hasNext()) |
7 | | | 6 | |
Precondition Violations (0)
Row |
Violation |