for ( int i = 0; i < operationQueue.size(); i++ ) { DelayedOperation op = (DelayedOperation) operationQueue.get(i); additions.add( op.getAddedInstance() ); removals.add( op.getOrphan() ); }
for ( int i=0; i<synchronizations.size(); i++ ) { Synchronization sync = (Synchronization) synchronizations.get(i); try { sync.beforeCompletion(); } catch (Throwable t) { log.error("exception calling user Synchronization", t); } }
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/transaction/JDBCTransaction.java
Method name: Collection getQueuedOrphans(String) Method name: void notifyLocalSynchsBeforeTransactionCompletion()
Number of AST nodes: 4 Number of AST nodes: 4
1
for ( int i = 0; i < operationQueue.size(); i++ ) {
1
for ( int i=0; i<synchronizations.size(); i++ ) {
2
				DelayedOperation op = (DelayedOperation) operationQueue.get(i);
2
				
3
				additions.add( op.getAddedInstance() );
4
				removals.add( op.getOrphan() );
3
Synchronization sync = (Synchronization) synchronizations.get(i);
4
				try {
5
					sync.beforeCompletion();
6
				}
7
				catch (Throwable t) {
8
					log.error("exception calling user Synchronization", t);
9
				}
5
			}
10
			}
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
Number of node comparisons1