private class AddAction extends AbstractAction {
private AddAction() {
super("Add");
putValue(MNEMONIC_KEY, new Integer(KeyEvent.VK_A));
putValue(ACCELERATOR_KEY, new Integer(KeyEvent.VK_A));
}
public void actionPerformed(ActionEvent event) {
_userAction = ADD;
dispose()
private class IgnoreAllAction extends AbstractAction {
private IgnoreAllAction() {
super("Ignore All");
// putValue( MNEMONIC_KEY, new Integer(KeyEvent.VK_G) );
// putValue( ACCELERATOR_KEY, new Integer(KeyEvent.VK_G) );
putValue(MNEMONIC_KEY, new Integer(KeyEvent.VK_G));
putValue(ACCELERATOR_KEY, new Integer(KeyEvent.VK_G));
}
public void actionPerformed(ActionEvent event) {
_userAction = IGNORE_ALL;
dispose()
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spellcheck/cswilly/ValidationDialog.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/spellcheck/cswilly/ValidationDialog.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | private class AddAction extends AbstractAction {↵ | | 1 | private class IgnoreAllAction extends AbstractAction {↵
|
|
2 | private AddAction() {↵ | | 2 | private IgnoreAllAction() {↵
|
|
3 | super("Add");↵ | | 3 | super("Ignore All");↵
|
|
4 | putValue(MNEMONIC_KEY, new Integer(KeyEvent.VK_A↵ | | 4 | // putValue( MNEMONIC_KEY, new Integer(KeyEvent.VK_G) );↵
|
|
| | | 5 | // putValue( ACCELERATOR_KEY, new Integer(KeyEvent.VK_G) );↵
|
|
5 | ));↵ | | 6 | putValue(MNEMONIC_KEY, new Integer(KeyEvent.VK_G));↵
|
|
6 | putValue(ACCELERATOR_KEY, new Integer(KeyEvent.VK_A));↵ | | 7 | putValue(ACCELERATOR_KEY, new Integer(KeyEvent.VK_G));↵
|
|
7 | }↵ | | 8 | }↵
|
|
8 | public void actionPerformed(ActionEvent event) {↵ | | 9 | public void actionPerformed(ActionEvent event) {↵
|
|
9 | _userAction = ADD;↵ | | 10 | _userAction = IGNORE_ALL;↵
|
|
10 | dispose() | | 11 | dispose()
|
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 |