Map.Entry element = ( Map.Entry ) iter.next();
String path = ( String ) element.getKey();
if ( path.startsWith( keyPrefix ) ) {
result.put( path.substring( keyPrefix.length() ), element.getValue() );
}
while ( iter.hasNext() ) {
Map.Entry me = (Map.Entry) iter.next();
TypedValue tv = (TypedValue) me.getValue();
result.put( me.getKey(), tv.getType().toLoggableString( tv.getValue(), factory ) );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/loader/custom/sql/SQLQueryReturnProcessor.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/pretty/Printer.java
|
Method name: Map filter(Map)
|
|
Method name: String toString(Map)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
| | | 1 | while ( iter.hasNext() ) {↵
|
1 | Map.Entry element = ( Map.Entry ) iter.next();
↵ | | 2 | Map.Entry me = (Map.Entry) iter.next();↵
|
2 | String path = ( String ) element.getKey();
↵ | | 3 | TypedValue tv = (TypedValue) me.getValue();↵
|
3 | if ( path.startsWith( keyPrefix ) ) {↵ | | 4 | ↵
|
4 | result.put( path.substring( keyPrefix.length() ), element.getValue() );↵ | | |
|
5 | ↵ | | 5 | result.put( me.getKey(), tv.getType().toLoggableString( tv.getValue(), factory ) );↵
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |