for (int i = 0; i < keys.length; i++) { value = header.get(keys[i]); if (value != null) { subHeader.set(keys[i], value); } }
for (int i = 0; i < rows.length; i++) { TreePath treePath = getTree().getPathForRow(rows[i]); if (treePath == null) { continue; } nodes[i] = (MessageNode) treePath.getLastPathComponent(); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/AbstractLocalFolder.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/TableView.java
Method name: Header getHeaderFields(Object, String[]) Method name: MessageNode[] getSelectedNodes()
Number of AST nodes: 4 Number of AST nodes: 5
1
for (int i = 0; i < keys.length; i++) {
1
for (int i = 0; i < rows.length; i++) {
2
				value = header.get(keys[i]);
2
			TreePath treePath = getTree().getPathForRow(rows[i]);
3
				if (value != null) {
3
			if (treePath == null) {
4
					subHeader.set(keys[i], value);
4
				
5
				}
6
	
5
continue;
6
			}
7
			nodes[i] = (MessageNode) treePath.getLastPathComponent();
7
		}
8
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1