protected Object generateNextUid() {
return new Integer(nextUid++);
}
public void setNextUid(int next) {
nextUid = next
protected Object generateNextUid() {
return new Integer(nextUid++);
}
public void setNextUid(int next) {
nextUid = next
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/temp/TempFolder.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/virtual/VirtualFolder.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | protected Object generateNextUid() {↵ | | 1 | protected Object generateNextUid() {↵
|
2 | return new Integer(nextUid++);↵ | | 2 | return new Integer(nextUid++);↵
|
3 | }↵ | | |
|
|
4 | ↵ | | 3 | }↵
|
|
5 | public void setNextUid(int next) {↵ | | 4 | public void setNextUid(int next) {↵
|
6 | nextUid = next | | 5 | nextUid = next
|
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 |