if (event.isPre() && event.getFqn().equals(fqn)) { try { latch.await(); } catch (InterruptedException e) { log.error("Interrupted waiting for latch", e); } }
if ( toggleAutoCommit ) { try { connection.commit(); } catch( Throwable ignore ) { // might happen with a managed connection } connection.setAutoCommit( true ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/cache-jbosscache2/src/test/java/org/hibernate/test/cache/jbc2/query/QueryRegionImplTestCase.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tool/hbm2ddl/SuppliedConnectionHelper.java
Method name: void nodeVisisted(NodeVisitedEvent) Method name: void prepare(boolean)
Number of AST nodes: 3 Number of AST nodes: 4
1
if (event.isPre() && event.getFqn().equals(fqn)) {
1
if (
2
                try {
3
                    latch.await();
4
                }
5
                catch (InterruptedException e) {
6
                    log.error("Interrupted waiting for latch", e);
7
                }
8
            
2
 toggleAutoCommit ) {
3
			try {
4
				connection.commit();
5
			}
6
			catch( Throwable ignore ) {
7
				// might happen with a managed connection
8
			}
9
			connection.setAutoCommit( true );
9
}
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.1
Clones locationClones are in different classes
Number of node comparisons1