public void resultArrived(IResultEvent event) {
if (!event.getProviderName().equals(providerTechnicalName))
return;
if (!event.getSearchCriteria().getTechnicalName().equals(
this.criteriaTechnicalName))
return;
List<ISearchResult> result = event.getSearchResults();
list.addAll(result);
public void resultArrived(IResultEvent event) {
if (!event.getProviderName().equals(providerTechnicalName))
return;
if (!event.getSearchCriteria().getTechnicalName().equals(
this.criteriaTechnicalName))
return;
List<ISearchResult> result = event.getSearchResults();
list.addAll(result);
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/search/BasicResultPanel.java
|
|
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/search/BasicResultPanel.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public void resultArrived(IResultEvent event) {↵ | | 1 | public void resultArrived(IResultEvent event) {↵
|
2 | if (!event.getProviderName().equals(providerTechnicalName))↵ | | 2 | if (!event.getProviderName().equals(providerTechnicalName))↵
|
3 | return;↵ | | 3 | return;↵
|
4 | if (!event.getSearchCriteria().getTechnicalName().equals(↵ | | 4 | if (!event.getSearchCriteria().getTechnicalName().equals(↵
|
5 | this.criteriaTechnicalName))↵ | | 5 | this.criteriaTechnicalName))↵
|
6 | return;↵ | | 6 | return;↵
|
|
7 | List<ISearchResult> result = event.getSearchResults();↵ | | 7 | List<ISearchResult> result = event.getSearchResults();↵
|
|
8 | list.addAll(result);↵ | | 8 | list.addAll(result);↵
|
9 | | | 9 |
|
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 |