for (int i = 0; i < keys.length; i++) { value = header.get(keys[i]); if (value != null) { subHeader.set(keys[i], value); } }
for (int j = 0; j < columnNames.length; j++) { String v = (String) header.get(columnNames[j]); if ( v==null) v = ""; out.writeString(v); }
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/folder/headercache/DefaultHeaderBinding.java
Method name: Header getHeaderFields(Object, String[]) Method name: void objectToEntry(Object, TupleOutput)
Number of AST nodes: 4 Number of AST nodes: 5
1
for (int i = 0; i < keys.length; i++) {
1
for (int j = 0; j < columnNames.length; j++) {
2
				value = header.get(keys[i]);
2
			String v = (String) header.get(columnNames[j]);
3
				if (value != null) {
3
			if (
4
					subHeader.set(keys[i], value);
5
				}
6
	
4
 v==null) v = "";
5
			out.writeString(v);
7
		}
6
		}
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