if ( hasQueuedOperations() ) { Collection additions = new ArrayList( operationQueue.size() ); Collection removals = new ArrayList( operationQueue.size() ); for ( int i = 0; i < operationQueue.size(); i++ ) { DelayedOperation op = (DelayedOperation) operationQueue.get(i); additions.add( op.getAddedInstance() ); removals.add( op.getOrphan() ); } return getOrphans(removals, additions, entityName, session); } else { return CollectionHelper.EMPTY_COLLECTION; }
for ( int i=0; i<snapshot.size(); i++ ) { Object old = snapshot.get(i); if ( i >= elements.size() ) { result.add(old); } else { Element elem = (Element) elements.get(i); Object object = elementType.fromXMLNode( elem, persister.getFactory() ); if ( elementType.isDirty( old, object, getSession() ) ) result.add(old); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/AbstractPersistentCollection.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/collection/PersistentElementHolder.java
Method name: Collection getQueuedOrphans(String) Method name: Iterator getDeletes(CollectionPersister, boolean)
Number of AST nodes: 9 Number of AST nodes: 8
1
if ( hasQueuedOperations() ) {
2
			Collection additions = new ArrayList( operationQueue.size() );
3
			Collection removals = new ArrayList( operationQueue.size() 
1
for ( int i=0; i<snapshot.size(); i++ ) {
4
);
2
			Object old = snapshot.get(i);
5
			for ( int i = 0; i &lt; operationQueue.size(); i++ ) {
3
			if ( i &gt;= elements.size() ) {
6
				DelayedOperation op = (DelayedOperation) operationQueue.get(i);
4
				
7
				additions.add( op.getAddedInstance() );
8
				removals.add( op.getOrphan() );
9
			}
10
			return getOrphans(removals, additions, entityName, session);
11
		}
12
		else {
13
			return CollectionHelper.EMPTY_COLLECTION;
5
result.add(old);
6
			}
7
			else {
8
				Element elem = (Element) elements.get(i);
9
				Object object = elementType.fromXMLNode( elem, persister.getFactory() );
10
				if ( elementType.isDirty( old, object, getSession() ) ) result.add(old);
11
			}
14
		}
12
		}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are in different classes having the same super class
Number of node comparisons1