IActivity activity = ((CalendarFrameMediator) getFrameMediator())
.getCalendarView().getSelectedActivity();
String calendarId = activity.getCalendarId();
String activityId = activity.getId();
for (Iterator<ITag> iter = TagManager.getInstance().getAllTags(); iter
.hasNext();) {
ITag tag = iter.next();
AssociationStore.getInstance().removeAssociation(SERVICE_ID,
tag.getId(), createURI(calendarId, activityId).toString());
}
IName name = it.next();
String str = value.getObject(name.getName(), name.getNamespace()).toString();
StringBuffer buf = new StringBuffer();
buf.append(name.getName());
buf.append(":");
buf.append(str);
DefaultMutableTreeNode child = new DefaultMutableTreeNode(buf.toString());
parent.add(child);
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/tagging/TagCalendarMenu.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/context/ContextDebugProvider.java
|
Method name: void removeAllTags()
|
|
Method name: void createTree(DefaultMutableTreeNode, IStructureValue)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 8
|
|
1 | IActivity activity = ((CalendarFrameMediator) ↵ | | 1 | IName name = it.next();↵
|
2 | getFrameMediator())↵ | | 2 | String str = value.getObject(name.getName↵
|
3 | .getCalendarView().getSelectedActivity();↵ | | 3 | (), name.getNamespace()).toString();↵
|
4 | ↵ | | 4 | ↵
|
5 | String calendarId = activity.getCalendarId();↵ | | 5 | String↵
|
6 | String activityId = activity.getId();↵ | | 6 | Buffer buf = new StringBuffer();↵
|
|
7 | for (Iterator<ITag> iter = TagManager.getInstance().getAllTags(); iter↵ | | 7 | ↵
|
8 | .hasNext();) {↵ | | |
|
9 | ITag tag = iter.next(↵ | | 8 | buf.append(name.getName());↵
|
| | | 9 | buf.append(":");↵
|
10 | );↵ | | 10 | buf.append(str);↵
|
|
11 | AssociationStore.getInstance().removeAssociation(SERVICE_ID,↵ | | 11 | ↵
|
12 | tag.getId(), createURI(calendarId, activityId).toString());↵ | | 12 | DefaultMutableTreeNode child = new DefaultMutableTreeNode(buf.toString());↵
|
|
13 | } | | 13 | parent.add(child);
|
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 having the same super class |
Number of node comparisons | 24 |