boolean foundMatch = false;
for (int i = 0; i < NAMES.length; i++) {
if (type.equals(NAMES[i])) {
foundMatch = true;
this.type = i;
}
}
boolean foundMatch = false;
for (int i = 0; i < NAMES.length; i++) {
if (type.equals(NAMES[i])) {
foundMatch = true;
this.type = i;
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/model/InstantMessagingModel.java
|
|
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/model/PhoneModel.java
|
Method name: void InstantMessagingModel(String, String)
|
|
Method name: void PhoneModel(String, String)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | boolean foundMatch = false;↵ | | 1 | boolean foundMatch = false;↵
|
2 | for (int i = 0; i < NAMES.length; i++) {↵ | | 2 | for (int i = 0; i < NAMES.length; i++) {↵
|
3 | if (type.equals(NAMES[i])) {↵ | | 3 | if (type.equals(NAMES[i])) {↵
|
4 | foundMatch = true;↵ | | 4 | foundMatch = true;↵
|
5 | this.type = i;↵ | | 5 | this.type = i;↵
|
6 | }↵ | | 6 | }↵
|
7 | } | | 7 | }
|
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.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 11 |
-
{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) | 1.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
6 | boolean foundMatch = false; | | 2 | boolean foundMatch = false; |
7 | for (int i = 0; i < NAMES.length; i++) | | 3 | for (int i = 0; i < NAMES.length; i++) |
8 | if (type.equals(NAMES[i])) | | 4 | if (type.equals(NAMES[i])) |
9 | | | 5 | |
10 | | | 6 | |
Precondition Violations (0)
Row |
Violation |