for (int i = 0; i < parent.getChildCount(); i++) {
IMailFolder child = (IMailFolder) parent.getChildAt(i);
CheckableTreeNode c = new CheckableTreeNode(child.getName());
c.setIcon(FolderTreeCellRenderer.getFolderIcon(child, false));
c.setNode(child);
root.add(c);
createChildNodes(c, child);
}
for (int i = 0; i < items.length; i++) {
String item = (String) items[i];
// all headerfields are lowercase in property file
String i18n = MailResourceLoader.getString("header", item
.toLowerCase());
headerMenuItem = new JRadioButtonMenuItem(i18n);
headerMenuItem.setActionCommand(item);
headerMenuItem.addActionListener(this);
columnGroup.add(headerMenuItem);
add(headerMenuItem);
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/export/ExportDialog.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/action/SortMessagesMenu.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = 0; i < parent.getChildCount(); i++) {↵ | | 1 | for (int i = 0; i < ↵
|
2 | IMailFolder child = (IMailFolder) parent.getChildAt(i);↵ | | |
|
|
3 | CheckableTreeNode c = new CheckableTreeNode(child.getNam↵ | | 2 | items.length; i++) {↵
|
| | | 3 | String item = (String) items[i];↵
|
|
| | | 4 | // all headerfields are lowercase in property file↵
|
| | | 5 | String i18n = MailResourceLoader.getString("header", item↵
|
4 | e());↵ | | 6 | .toLowerCase());↵
|
|
5 | c.setIcon(FolderTreeCellRenderer.getFolderIcon(child, false));↵ | | 7 | ↵
|
6 | c.setNode(child);↵ | | |
|
7 | root.add(c↵ | | 8 | headerMenuItem = new JRadioButtonMenuItem(i18n);↵
|
| | | 9 | headerMenuItem.setActionCommand(item);↵
|
| | | 10 | headerMenuItem.addActionListener(this);↵
|
8 | );↵ | | 11 | columnGroup.add(headerMenuItem);↵
|
|
9 | createChildNodes(c, child);↵ | | 12 | add(headerMenuItem);↵
|
10 | } | | 13 | }
|
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 |