void setTo(Address[] a) { getToList().clear(); for (int i = 0; i < a.length; i++) { getToList().add(a[i].toString()); } } /** * Set Cc: header * * @param a * address array */ public void setCc(Address[] a) { getCcList().clear(); for (int i = 0; i < a.length; i++) { getCcList().add(a[i].toString()); }
void setCc(Address[] a) { getCcList().clear(); for (int i = 0; i < a.length; i++) { getCcList().add(a[i].toString()); } } /** * Set Bcc: header * * @param a * address array */ public void setBcc(Address[] a) { getBccList().clear(); for (int i = 0; i < a.length; i++) { getBccList().add(a[i].toString()); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/composer/ComposerModel.java File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/composer/ComposerModel.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void setTo(Address[] a) {
1
void setCc(Address[] a) {
2
		getToList().clear();
2
		getCcList().clear();
3
		for (int i = 0; i < a.length; i++) {
3
		for (int i = 0; i < a.length; i++) {
4
			getToList().add(a[i].toString());
4
			getCcList().add(a[i].toString());
5
		}
5
		}
6
	}
6
	}
7
	/**
7
	/**
8
	 * Set Cc: header
8
	 * Set Bcc: header
9
	 *
9
	 *
10
	 * @param a
10
	 * @param a
11
	 *            address array
11
	 *            address array
12
	 */
12
	 */
13
	public void setCc(Address[] a) {
13
	public void setBcc(Address[] a) {
14
		getCcList().clear();
14
		getBccList().clear();
15
		for (int i = 0; i < a.length; i++) {
15
		for (int i = 0; i < a.length; i++) {
16
			getCcList().add(a[i].toString());
16
			getBccList().add(a[i].toString());
17
		}
17
		}
18
	
18
	
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