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/gui/search/SearchPanel.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/search/SearchManager.java
Method name: void searchComplex(List, boolean, boolean) Method name: void execute(IWorkerStatusController)
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
					}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.4
Clones locationClones are in different classes
Number of node comparisons37
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements6
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)13.5
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    12
    if (map.containsKey(providerName))
    29
    if (map.containsKey(providerName))
    13
    Vector<ISearchRequest> v = map.get(providerName);
    30
    Vector<ISearchRequest> v = map.get(providerName);
    14
    v.add(r);
    31
    v.add(r);
    else
    else
    15
    Vector<ISearchRequest> v = new Vector<ISearchRequest>();
    32
    Vector<ISearchRequest> v = new Vector<ISearchRequest>();
    16
    v.add(r);
    33
    v.add(r);
    17
    map.put(providerName, v);
    34
    map.put(providerName, v);
    Precondition Violations (1)
    Row Violation
    1The refactoring of the clones is infeasible, because classes org.columba.core.gui.search.SearchPanel and org.columba.core.search.SearchManager.SearchCommand do not have a common superclass