if (tree.equals(focusOwner)) { // tree has focus AddressbookTreeNode treeNode = null; // remember last selected folder treenode if (path != null) { treeNode = (AddressbookTreeNode) path.getLastPathComponent(); } // enable, if more than zero treenodes selected if ((path != null) && (treeNode instanceof IGroupFolder)) { setEnabled(true); } else setEnabled(false); } else setEnabled(false);
if (tree.equals(focusOwner)) { // tree has focus AddressbookTreeNode treeNode = null; // remember last selected folder treenode if (path != null) { treeNode = (AddressbookTreeNode) path.getLastPathComponent(); } // enable, if more than zero treenodes selected if ((path != null) && (treeNode instanceof IGroupFolder)) { setEnabled(true); } else setEnabled(false); } else setEnabled(false);
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/action/EditPropertiesAction.java File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/action/RemoveCardAction.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (tree.equals(focusOwner)) {
1
if (tree.equals(focusOwner)) {
2
			// tree has focus
2
			// tree has focus
3
			AddressbookTreeNode treeNode = null;
3
			AddressbookTreeNode treeNode = null;
4
			// remember last selected folder treenode
4
			// remember last selected folder treenode
5
			if (path != null) {
5
			if (path != null) {
6
				treeNode = (AddressbookTreeNode) path.getLastPathComponent();
6
				treeNode = (AddressbookTreeNode) path.getLastPathComponent();
7
			}
7
			}
8
			// enable, if more than zero treenodes selected
8
			// enable, if more than zero treenodes selected
9
			if ((path != null) && (treeNode instanceof IGroupFolder)) {
9
			if ((path != null) && (treeNode instanceof IGroupFolder)) {
10
				setEnabled(true);
10
				setEnabled(true);
11
			} else
11
			} else
12
				setEnabled(false);
12
				setEnabled(false);
13
		} else
13
		} else
14
			setEnabled(false);
14
			setEnabled(false);
15
	
15
	
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0