Rectangle bounds = tableItems[i].getBounds(j);
if (bounds.y > event.y)
{
break LOOP;
}
else if (bounds.contains(event.x, event.y))
{
if (j != 0 || !tableItems[i].getImageBounds(0).contains(event.x, event.y))
{
TableItem tableItem = tableItems[i];
if (tableItem == editTableItem)
{
selectedTableItem = null;
table.showSelection();
editItem(editTableItem, editTableItemColumn);
}
}
break LOOP;
}
if (bounds.contains(event.x, event.y))
{
if (j != 0 || !tableItems[i].getImageBounds(0).contains(event.x, event.y))
{
TableItem tableItem = tableItems[i];
TableTreeItem tableTreeItem = (TableTreeItem)tableItems[i].getData(ExtendedTableTreeViewer.ITEM_ID);
if (tableTreeItem == editTableTreeItem)
{
selectedTableItem = null;
table.showSelection();
editItem(tableItem, editTableTreeItem, editTableTreeItemColumn);
}
}
break LOOP;
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/ui/celleditor/ExtendedTableEditor.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/common/ui/celleditor/ExtendedTableTreeEditor.java
|
Method name: void mouseUp(MouseEvent)
|
|
Method name: void mouseUp(MouseEvent)
|
Number of AST nodes: 11
|
|
Number of AST nodes: 9
|
|
1 | Rectangle bounds = tableItems[i].getBounds(j);↵ | | |
|
2 | if (bounds.y > event.y)↵ | | |
|
3 | {↵ | | |
|
4 | break LOOP;↵ | | |
|
5 | }↵ | | |
|
6 | else if (bounds.contains(event.x, event.y))↵ | | 1 | if (bounds.contains(event.x, event.y))↵
|
7 | {↵ | | 2 | {↵
|
8 | if (j != 0 || !tableItems[i].getImageBounds(0).contains(event.x, event.y))↵ | | 3 | if (j != 0 || !tableItems[i].getImageBounds(0).contains(event.x, event.y))↵
|
9 | {↵ | | 4 | {↵
|
10 | TableItem tableItem = tableItems[i];↵ | | 5 | TableItem tableItem = tableItems[i];↵
|
| | | 6 | TableTreeItem tableTreeItem = (TableTreeItem)tableItems[i].getData(ExtendedTableTreeViewer.ITEM_ID);↵
|
11 | if (tableItem == editTableItem)↵ | | 7 | if (tableTreeItem == editTableTreeItem)↵
|
12 | {↵ | | 8 | {↵
|
13 | selectedTableItem = null;↵ | | 9 | selectedTableItem = null;↵
|
14 | table.showSelection();↵ | | 10 | table.showSelection();↵
|
15 | editItem(editTableItem, editTableItemColumn);↵ | | 11 | editItem(tableItem, editTableTreeItem, editTableTreeItemColumn);↵
|
16 | }↵ | | 12 | }↵
|
17 | }↵ | | 13 | }↵
|
|
18 | break LOOP;↵ | | 14 | break LOOP;↵
|
19 | } | | 15 | }
|
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 | 0 |