public void valueChanged(TreeSelectionEvent e) { TreePath path = e.getNewLeadSelectionPath(); // remember last selected folder treenode if (path != null) { treeNode = (AddressbookTreeNode) path.getLastPathComponent(); } // enable, if more than zero treenodes selected if ((path != null) && (treeNode instanceof AddressbookFolder)) { setEnabled(true); } else { setEnabled(false);
public void valueChanged(TreeSelectionEvent e) { TreePath path = e.getNewLeadSelectionPath(); // remember last selected folder treenode if (path != null) { treeNode = (AddressbookTreeNode) path.getLastPathComponent(); } // enable, if more than zero treenodes selected if ( (path != null) && ( treeNode instanceof AddressbookFolder ) ){ setEnabled(true); } 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/AddContactCardAction.java File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/action/DefaultTreeAction.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public void valueChanged(TreeSelectionEvent e) {
1
public void valueChanged(TreeSelectionEvent e) {
2
		TreePath path = e.getNewLeadSelectionPath();
2
		TreePath path = e.getNewLeadSelectionPath();
3
		// remember last selected folder treenode
3
		// remember last selected folder treenode
4
		if (path != null) {
4
		if (path != null) {
5
			treeNode = (AddressbookTreeNode) path.getLastPathComponent();
5
			treeNode = (AddressbookTreeNode) path.getLastPathComponent();
6
		}
6
		}
7
		// enable, if more than zero treenodes selected
7
		// enable, if more than zero treenodes selected
8
		if ((path != null) && (treeNode instanceof AddressbookFolder)) {
8
		if ( (path != null) && ( treeNode instanceof AddressbookFolder ) ){
9
			setEnabled(true);
9
			setEnabled(true);
10
		} else {
10
		} else {
11
			setEnabled(false);
11
			setEnabled(false);
12
		
12
		
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