Iterator<IEventInfo> it = new CalendarImporter()
.importCalendar(calendar, sourceFiles[i]);
while (it.hasNext()) {
IEventInfo event = it.next();
event.setCalendar(calendar.getId());
try {
store.add(event);
} catch (StoreException e) {
JOptionPane.showMessageDialog(FrameManager.getInstance()
.getActiveFrame(), e.getMessage());
e.printStackTrace();
}
}
Iterator<ITag> it = tagList.getSelectedTags();
while (it.hasNext() ) {
ITag tag = it.next();
try {
TagManager.getInstance().removeTag(tag.getId());
} catch (StoreException e) {
if ( Logging.DEBUG)
e.printStackTrace();
JOptionPane.showMessageDialog(FrameManager.getInstance()
.getActiveFrame(), "Error deleting Tag");
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/command/ImportCalendarCommand.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/tagging/RemoveTagAction.java
|
Method name: void execute(IWorkerStatusController)
|
|
Method name: void actionPerformed(ActionEvent)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 5
|
|
1 | Iterator<IEventInfo> it = new CalendarImporter()↵ | | 1 | Iterator<ITag> it = ↵
|
2 | .importCalendar(calendar, sourceFiles[i]);↵ | | |
|
|
3 | ↵ | | 2 | tagList.getSelectedTags();↵
|
|
4 | while (it.hasNext()) {↵ | | 3 | while (it.hasNext() ) {
↵
|
5 | IEventInfo event = it.next();↵ | | 4 | ITag tag = it.next();↵
|
| | | 5 |
↵
|
6 | event.setCalendar(calendar.getId());↵ | | 6 | ↵
|
|
7 | try {↵ | | |
|
8 | store.add(event);↵ | | |
|
9 | ↵ | | 7 | try {↵
|
| | | 8 | TagManager.getInstance().removeTag(tag.getId());↵
|
10 | } catch (StoreException e) {↵ | | 9 | } catch (StoreException e) {
↵
|
11 | ↵ | | 10 | if ( Logging.DEBUG)↵
|
| | | 11 | e.printStackTrace();↵
|
12 | JOptionPane.showMessageDialog(FrameManager.getInstance()↵ | | 12 | JOptionPane.showMessageDialog(FrameManager.getInstance()
↵
|
13 | .getActiveFrame(), e.getMessage());↵ | | 13 | .getActiveFrame(), ↵
|
14 | e.printStackTrace();↵ | | |
|
15 | ↵ | | 14 | "Error deleting Tag");↵
|
16 | }↵ | | 15 | }
↵
|
17 | } | | 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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |