if( addresses.length > 0) { addressList.clear(); for(int i=0; i<addresses.length; i++ ) { addressList.add(addresses[i].toString()); } result.put("cc", addressList.toArray(new String[0])); }
if( addresses.length > 0) { addressList.clear(); for(int i=0; i<addresses.length; i++ ) { addressList.add(addresses[i].toString()); } result.put("bcc", addressList.toArray(new String[0])); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/parser/MailUrlParser.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/parser/MailUrlParser.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if( addresses.length > 0) {
1
if( addresses.length > 0) {
2
				addressList.clear();
2
				addressList.clear();
3
				for(int i=0; i<addresses.length; i++ ) {
3
				for(int i=0; i<addresses.length; i++ ) {
4
					addressList.add(addresses[i].toString());
4
					addressList.add(addresses[i].toString());
5
				}
5
				}
6
				result.put("cc", addressList.toArray(new String[0]));				
6
				result.put("bcc", addressList.toArray(new String[0]));				
7
			}
7
			}
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