public boolean hasNext() {
return it.hasNext();
}
public Object next() {
return it.next();
}
public void remove() {
it.remove()
public boolean hasNext() {
return it.hasNext();
}
/* (non-Javadoc)
* @see java.util.Iterator#next()
*/
public Object next() {
return it.next();
}
/* (non-Javadoc)
* @see java.util.Iterator#remove()
*/
public void remove() {
it.remove()
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/headercache/BerkeleyDBIterator.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/headercache/DefaultCloseableIterator.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public boolean hasNext() {↵ | | 1 | public boolean hasNext() {↵
|
2 | return it.hasNext();↵ | | 2 | return it.hasNext();↵
|
3 | }↵ | | 3 | }↵
|
|
4 | public Object next() {↵ | | 4 | ↵
|
5 | return it.next();↵ | | |
|
6 | }↵ | | |
|
| | | 5 | /* (non-Javadoc)↵
|
| | | 6 | * @see java.util.Iterator#next()↵
|
| | | 7 | */↵
|
| | | 8 | public Object next() {↵
|
| | | 9 | return it.next();↵
|
| | | 10 | }↵
|
|
| | | 11 | /* (non-Javadoc)↵
|
| | | 12 | * @see java.util.Iterator#remove()↵
|
| | | 13 | */↵
|
7 | public void remove() {↵ | | 14 | public void remove() {↵
|
8 | it.remove() | | 15 | it.remove()
|
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 | |
Number of node comparisons | 0 |