try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
while (!this.open) { try { wait(); } catch (InterruptedException e) { e.printStackTrace(); } }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/headercache/BerkeleyDBHeaderList.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/base/Barrier.java
Method name: ICloseableIterator keyIterator() Method name: void join()
Number of AST nodes: 3 Number of AST nodes: 3
1
try {
2
			openDatabase
1
while (!this.open) {
2
	    try {
3
();
3
		wait();
4
		} catch (DatabaseException e) {
4
	    } catch (InterruptedException e) {
5
			LOG.severe(e.getMessage());
5
		
6
			throw new RuntimeException(e);
7
		}
8
		return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
6
e.printStackTrace();
7
	    }
8
	}
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.2
Clones locationClones are in different classes
Number of node comparisons1