this.sizeOfPieces = sizeOfPieces;
index = 0;
count = uids.length / sizeOfPieces;
rest = uids.length % sizeOfPieces;
list = new ArrayList(Arrays.asList(uids));
this.sizeOfPieces = sizeOfPieces;
index = 0;
count = uids.length / sizeOfPieces;
rest = uids.length % sizeOfPieces;
list = new ArrayList(Arrays.asList(uids));
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/imap/MessageSetTokenizer.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/imap/MessageSetTokenizer.java
|
Method name: void MessageSetTokenizer(List, int)
|
|
Method name: void MessageSetTokenizer(Object[], int)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | this.sizeOfPieces = sizeOfPieces;↵ | | 1 | this.sizeOfPieces = sizeOfPieces;↵
|
|
2 | index = 0;↵ | | 2 | index = 0;↵
|
|
3 | count = uids.length / sizeOfPieces;↵ | | 3 | count = uids.length / sizeOfPieces;↵
|
4 | rest = uids.length % sizeOfPieces;↵ | | 4 | rest = uids.length % sizeOfPieces;↵
|
|
5 | list = new ArrayList(Arrays.asList(uids)); | | 5 | list = new ArrayList(Arrays.asList(uids));
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 15 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | this.sizeOfPieces = sizeOfPieces; | | 2 | this.sizeOfPieces = sizeOfPieces; |
3 | index = 0; | | 3 | index = 0; |
4 | count = uids.length / sizeOfPieces; | | 4 | count = uids.length / sizeOfPieces; |
5 | rest = uids.length % sizeOfPieces; | | 5 | rest = uids.length % sizeOfPieces; |
6 | list = new ArrayList(Arrays.asList(uids)); | | 6 | list = new ArrayList(Arrays.asList(uids)); |
Precondition Violations (0)
Row |
Violation |