if (map.containsKey(providerName)) {
Vector<ISearchRequest> v = map.get(providerName);
v.add(r);
} else {
Vector<ISearchRequest> v = new Vector<ISearchRequest>();
v.add(r);
map.put(providerName, v);
}
if (map.containsKey(providerName)) {
Vector<ISearchRequest> v = map.get(providerName);
v.add(r);
} else {
Vector<ISearchRequest> v = new Vector<ISearchRequest>();
v.add(r);
map.put(providerName, v);
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/search/SearchManager.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/search/SearchPanel.java
|
Method name: void execute(IWorkerStatusController)
|
|
Method name: void searchComplex(List, boolean, boolean)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | if (map.containsKey(providerName)) {↵ | | 1 | if (map.containsKey(providerName)) {↵
|
2 | Vector<ISearchRequest> v = map.get(providerName);↵ | | 2 | Vector<ISearchRequest> v = map.get(providerName);↵
|
3 | v.add(r);↵ | | 3 | v.add(r);↵
|
4 | } else {↵ | | 4 | } else {↵
|
5 | Vector<ISearchRequest> v = new Vector<ISearchRequest>();↵ | | 5 | Vector<ISearchRequest> v = new Vector<ISearchRequest>();↵
|
6 | v.add(r);↵ | | 6 | v.add(r);↵
|
7 | map.put(providerName, v);↵ | | 7 | map.put(providerName, v);↵
|
8 | } | | 8 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 37 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 6 |
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) | 6.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
29 | if (map.containsKey(providerName)) | | 12 | if (map.containsKey(providerName)) |
30 | Vector<ISearchRequest> v = map.get(providerName); | | 13 | Vector<ISearchRequest> v = map.get(providerName); |
31 | | | 14 | |
| | | | |
32 | Vector<ISearchRequest> v = new Vector<ISearchRequest>(); | | 15 | Vector<ISearchRequest> v = new Vector<ISearchRequest>(); |
33 | | | 16 | |
34 | map.put(providerName, v); | | 17 | map.put(providerName, v); |
Precondition Violations (0)
Row |
Violation |