if (dndAction == true) { Object[] list = getSelectedValues(); selection1 = new IBasicModelPartial[list.length]; for (int i = 0; i < list.length; i++) { selection1[i] = (IBasicModelPartial) list[i]; } dndAction = false; } else { Object[] list = getSelectedValues(); selection2 = new IBasicModelPartial[list.length]; for (int i = 0; i < list.length; i++) { selection2[i] = (IBasicModelPartial) list[i]; } dndAction = true; }
if (dndAction == true) { Object[] list = getSelectedValues(); selection1 = new IHeaderItem[list.length]; for (int i = 0; i < list.length; i++) { selection1[i] = (IHeaderItem) list[i]; } dndAction = false; } else { Object[] list = getSelectedValues(); selection2 = new IHeaderItem[list.length]; for (int i = 0; i < list.length; i++) { selection2[i] = (IHeaderItem) list[i]; } dndAction = true; }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/contact/src/main/java/org/columba/addressbook/gui/list/AddressbookDNDListView.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/contact/list/ContactDNDListView.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (dndAction == true) {
1
if (dndAction == true) {
2
			Object[] list = getSelectedValues();
2
			Object[] list = getSelectedValues();
3
			selection1 = new IBasicModelPartial[list.length];
3
			selection1 = new IHeaderItem[list.length];
4
			for (int i = 0; i < list.length; i++) {
4
			for (int i = 0; i < list.length; i++) {
5
				selection1[i] = (IBasicModelPartial) list[i];
5
				selection1[i] = (IHeaderItem) list[i];
6
			}
6
			}
7
			dndAction = false;
7
			dndAction = false;
8
		} else {
8
		} else {
9
			Object[] list = getSelectedValues();
9
			Object[] list = getSelectedValues();
10
			selection2 = new IBasicModelPartial[list.length];
10
			selection2 = new IHeaderItem[list.length];
11
			for (int i = 0; i < list.length; i++) {
11
			for (int i = 0; i < list.length; i++) {
12
				selection2[i] = (IBasicModelPartial) list[i];
12
				selection2[i] = (IHeaderItem) list[i];
13
			}
13
			}
14
			dndAction = true;
14
			dndAction = true;
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