try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredValueSet(db,headerBinding, false).iterator());
try { mergeRAMtoIndex(); } catch (IOException e) { LOG.severe(e.getMessage()); }
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/mail/src/main/java/org/columba/mail/folder/search/LuceneQueryEngine.java
Method name: ICloseableIterator headerIterator() Method name: void save()
Number of AST nodes: 3 Number of AST nodes: 2
1
try {
1
try {
2
			openDatabase();
2
			mergeRAMtoIndex();
3
		} catch (DatabaseException e) {
3
		} catch (IOException e) {
4
			LOG.severe(e.getMessage());
4
			LOG.severe(e.getMessage());
5
			throw new RuntimeException(e);
5
		
6
		}
7
		return new BerkeleyDBIterator( (StoredIterator)new StoredValueSet(db,headerBinding, false).iterator());
6
}
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