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 (final Exception 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/core/src/main/java/org/columba/core/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 (final Exception e) {↵
|
4 | LOG.severe(e.getMessage());↵ | | 4 | LOG.severe(e.getMessage());↵
|
5 | throw new RuntimeException(e);↵ | | 5 | ↵
|
6 | }↵ | | |
|
7 | return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator()); | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |