try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
try { save(); } catch (Exception 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/plugins/org.columba.chat.altura/src/org/columba/chat/config/Config.java
Method name: ICloseableIterator keyIterator() Method name: void run()
Number of AST nodes: 3 Number of AST nodes: 2
1
try {
1
try {
2
			openDatabase();
2
					save();
3
		} catch (DatabaseException e) {
3
				} catch (Exception e) {
4
			LOG.severe(e.getMessage());
4
			
5
			throw new RuntimeException(e);
6
		}
7
		return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
5
		e.printStackTrace();
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.1
Clones locationClones are in different classes
Number of node comparisons1