if (e.getStateChange() == ItemEvent.SELECTED) {
AccountItem item = (AccountItem) ((AccountView)e.getSource()).getSelectedItem();
SecurityItem pgp = item.getPGPItem();
setState(pgp.getBooleanWithDefault("always_sign", false));
}
MessageNode rootNode = tableModel.getRootNode();
// get a list of MessageNode objects of the first
// hierachy level
List v = rootNode.getVector();
if (v == null)
return;
// do the sorting
Collections.sort(v, new MessageHeaderComparator(getSortingColumn(),
tableModel.getColumnNumber(getSortingColumn()),
getSortingOrder()));
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/composer/action/SignMessageAction.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/model/TableModelSorter.java
|
Method name: void itemStateChanged(ItemEvent)
|
|
Method name: void sort(HeaderTableModel)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 5
|
|
1 | if (e.getStateChange() == ItemEvent.SELECTED) {↵ | | |
|
2 | AccountItem item = (AccountItem) ((AccountView)e.getSource()).getSelectedItem();↵ | | |
|
3 | SecurityItem pgp = item.getPGPItem();↵ | | |
|
4 | setState(pgp.getBooleanWithDefault("always_sign", false));↵ | | |
|
5 | } | | 1 | MessageNode rootNode = tableModel.getRootNode();↵
|
|
| | | 2 | // get a list of MessageNode objects of the first↵
|
| | | 3 | // hierachy level↵
|
| | | 4 | List v = rootNode.getVector();↵
|
| | | 5 | if (v == null)↵
|
| | | 6 | return;↵
|
|
| | | 7 | // do the sorting↵
|
| | | 8 | Collections.sort(v, new MessageHeaderComparator(getSortingColumn(),↵
|
| | | 9 | tableModel.getColumnNumber(getSortingColumn()),↵
|
| | | 10 | getSortingOrder()));
|
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 |