try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
try { load(); } catch (IOException e) { LOG.severe(e.getLocalizedMessage()); throw new RuntimeException("Mailbox is corrupted!"); }
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/mbox/MboxDataStorage.java
Method name: ICloseableIterator keyIterator() Method name: void MboxDataStorage(AbstractMessageFolder)
Number of AST nodes: 3 Number of AST nodes: 2
1
try {
1
try {
2
			openDatabase();
2
				load();
3
		} catch (DatabaseException e) {
3
			} catch (IOException e) {
4
			LOG.severe(e.getMessage());
4
				LOG.severe(e.getLocalizedMessage());
5
			
5
					
6
throw new RuntimeException(e);
6
				throw new RuntimeException(
7
		}
8
		return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
7
"Mailbox is corrupted!");
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.3
Clones locationClones are in different classes
Number of node comparisons1