for ( int i=0; i<length; i++ ) {
Element elem = (Element) elements.get(i);
Object object = elementType.fromXMLNode( elem, persister.getFactory() );
result.add(object);
}
for ( int i = 0; i < size; i++ ) {
Map.Entry e = ( Map.Entry ) list.get( i );
( (CollectionEntry) e.getValue() ).preFlush( (PersistentCollection) e.getKey() );
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentElementHolder.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/event/def/AbstractFlushingEventListener.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for ( int i=0; i<length; i++ ) {↵ | | 1 | for ( int i = 0; i < size; i++ ) {↵
|
2 | Element elem = (Element) elements.get(i);↵ | | 2 | Map.Entry e = ( Map.Entry ) list.get( i );↵
|
3 | Object object = elementType.fromXMLNode( elem, persister.getFactory() );↵ | | 3 | ↵
|
4 | result.add(object);↵ | | 4 | ( (CollectionEntry) e.getValue() ).preFlush( (PersistentCollection) e.getKey() );↵
|
5 | } | | 5 | }
|
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 | |
Number of node comparisons | 0 |