try { Iterator itr = files.iterator(); while ( itr.hasNext() ) { final File file = ( File ) itr.next(); collectClassNames( file, classNames ); } } catch ( ExecutionException ee ) { throw ee; } catch ( Exception e ) { throw new ExecutionException( e );
try { Iterator itr = files.iterator(); while ( itr.hasNext() ) { final File file = ( File ) itr.next(); processFile( file, classNames ); } } catch ( ExecutionException ee ) { throw ee; } catch ( Exception e ) { throw new ExecutionException( e );
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/bytecode/buildtime/AbstractInstrumenter.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/bytecode/buildtime/AbstractInstrumenter.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
try {
1
try {
2
				Iterator itr = files.iterator();
2
			Iterator itr = files.iterator();
3
				while ( itr.hasNext() ) {
3
			while ( itr.hasNext() ) {
4
					final File file = ( File ) itr.next();
4
				final File file = ( File ) itr.next();
5
					collectClassNames( file, classNames );
5
				processFile( file, classNames );
6
				}
6
			}
7
			}
7
		}
8
			catch ( ExecutionException ee ) {
8
		catch ( ExecutionException ee ) {
9
				throw ee;
9
			throw ee;
10
			}
10
		}
11
			catch ( Exception e ) {
11
		catch ( Exception e ) {
12
				throw new ExecutionException( e );
12
			throw new ExecutionException( e );
13
			
13
		
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 location
Number of node comparisons0