public ICloseableIterator headerIterator() { try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredValueSet(db,headerBinding, false).iterator());
public ICloseableIterator keyIterator() { try { openDatabase(); } catch (DatabaseException e) { LOG.severe(e.getMessage()); throw new RuntimeException(e); } return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
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/headercache/BerkeleyDBHeaderList.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public ICloseableIterator headerIterator() {
1
public ICloseableIterator keyIterator() {
2
		try {
2
		try {
3
			openDatabase();
3
			openDatabase();
4
		} catch (DatabaseException e) {
4
		} catch (DatabaseException e) {
5
			LOG.severe(e.getMessage());
5
			LOG.severe(e.getMessage());
6
			throw new RuntimeException(e);
6
			throw new RuntimeException(e);
7
		}
7
		}
8
		return new BerkeleyDBIterator( (StoredIterator)new StoredValueSet(db,headerBinding, false).iterator());
8
		return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
9
	
9
	
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