GroupFolder folder = (GroupFolder) mediator.getTree()
.getSelectedFolder();
IGroupModel card = folder.getGroup();
EditGroupDialog dialog = new EditGroupDialog(mediator.getView()
.getFrame(), card, (AbstractFolder) folder.getParent());
if (dialog.getResult()) {
// re-select folder
mediator.getTree().setSelectedFolder(folder);
}
final ISearchProvider p = it.next();
// query using all criteria
Iterator<ISearchCriteria> it2 = p.getAllCriteria(
ref.getSearchTerm()).iterator();
while (it2.hasNext()) {
ISearchCriteria c = it2.next();
String searchCriteriaTechnicalName = c
.getTechnicalName();
// execute search
doExecute(ref.getSearchTerm(), p,
searchCriteriaTechnicalName, ref
.isSearchInside(), ref.getStartIndex(),
ref.getResultCount());
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/action/EditPropertiesAction.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/search/SearchManager.java
|
Method name: void actionPerformed(ActionEvent)
|
|
Method name: void execute(IWorkerStatusController)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 6
|
|
1 | GroupFolder folder = (GroupFolder) mediator.getTree()↵ | | |
|
| | | 1 | final ISearchProvider p = it.next();↵
|
|
| | | 2 | // query using all criteria↵
|
| | | 3 | Iterator<ISearchCriteria> it2 = p.getAllCriteria(↵
|
2 | .getSelectedFolder();↵ | | 4 | ref.getSe↵
|
|
3 | IGroupModel card = folder.getGroup↵ | | 5 | archTerm()).iterator();↵
|
| | | 6 | while (it2.hasNext()) {↵
|
4 | ();↵ | | 7 | ISearchCriteria c = it2.next();↵
|
|
5 | EditGroupDialog dialog = new EditGroupDialog(mediator.getView↵ | | 8 | String searchCriteriaTechnicalName = c↵
|
6 | ()↵ | | 9 | .getTechnicalName();↵
|
7 | .getFrame(), card, (AbstractFolder) folder.getParent());↵ | | 10 | ↵
|
|
8 | if (dialog.getResult()) {↵ | | |
|
9 | // re-select folder↵ | | |
|
10 | mediator.getTree().setSelectedFolder(folder↵ | | 11 | // execute search↵
|
| | | 12 | doExecute(ref.getSearchTerm(), p,↵
|
| | | 13 | searchCriteriaTechnicalName, ref↵
|
| | | 14 | .isSearchInside(), ref.getStartIndex(),↵
|
11 | );↵ | | 15 | ref.getResultCount());↵
|
|
12 | } | | 16 | }
|
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 | Clones are in different classes |
Number of node comparisons | 1 |