try {
openDatabase();
} catch (DatabaseException e) {
LOG.severe(e.getMessage());
throw new RuntimeException(e);
}
return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator());
while (!tryToGetLock(theLocker)) {
try {
wait();
} catch (InterruptedException e) {
// nothing to do
}
}
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/base/Lock.java
|
Method name: ICloseableIterator keyIterator()
|
|
Method name: void getLock(Object)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | try {↵ | | |
|
2 | openDatabase↵ | | 1 | while (!tryToGetLock(theLocker)) {↵
|
| | | 2 | try {↵
|
3 | ();↵ | | 3 | wait();↵
|
4 | } catch (DatabaseException e) {↵ | | 4 | } catch (InterruptedException e) {↵
|
5 | LOG.severe(e.getMessage());↵ | | 5 | ↵
|
6 | throw new RuntimeException(e);↵ | | |
|
7 | }↵ | | |
|
8 | return new BerkeleyDBIterator( (StoredIterator)new StoredKeySet(db, integerBinding, false).iterator()); | | 6 | // nothing to do↵
|
| | | 7 | }↵
|
| | | 8 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |