PreInsertEvent preEvent = new PreInsertEvent( getInstance(), null, state, getPersister(), (EventSource)getSession() ); for ( int i = 0; i < preListeners.length; i++ ) { veto = preListeners[i].onPreInsert(preEvent) || veto; }
for ( int i=0; i<props.length; i++ ) { int propTableNumber = getSubclassPropertyTableNumber( props[i], classes[i] ); if ( isSubclassTableSequentialSelect(propTableNumber) && !isSubclassTableLazy(propTableNumber) ) { tableNumbers.add( new Integer(propTableNumber) ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/action/EntityIdentityInsertAction.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/persister/entity/SingleTableEntityPersister.java
Method name: boolean preInsert() Method name: String generateSequentialSelect(Loadable)
Number of AST nodes: 3 Number of AST nodes: 4
1
PreInsertEvent preEvent = new PreInsertEvent( getInstance(), null, state, getPersister(), (EventSource)getSession()
1
for ( int i=0; i<props.length; i++ ) {
2
 );
2
			int propTableNumber = getSubclassPropertyTableNumber( props[i], classes[i] );
3
			for ( int i = 0; i < preListeners.length; i++ ) {
3
			if ( i
4
				veto = preListeners[i].onPreIns
4
sSubclassTableSequentialSelect(propTableNumber) && !isSubclassTableLazy(propTableNumber) ) {
5
ert(preEvent) || veto;
5
				tableNumbers.add( new Integer(propTableNumber) );
6
			}
6
			}
7
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1