void setMinimumDate(Calendar date) { minDate = ((date == null) ? null : copyDate(date, minDate)); minDay = ((date == null) ? (-1) : minDate.get(Calendar.DATE)); _refresh(); } /** * Get the earliest selectable date for the chooser. * * @return The minimum selectable date, or <code>null</code> if there is * no minimum date currently set. */ public Calendar getMinimumDate() { return (minDate); }
void setMaximumDate(Calendar date) { maxDate = ((date == null) ? null : copyDate(date, maxDate)); maxDay = ((date == null) ? (-1) : maxDate.get(Calendar.DATE)); _refresh(); } /** * Get the latest selectable date for the chooser. * * @return The maximum selectable date, or <code>null</code> if there is * no maximum date currently set. */ public Calendar getMaximumDate() { return (maxDate); }
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/base/DateChooser.java File path: /columba-1.4-src/core/src/main/java/org/columba/core/gui/base/DateChooser.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void setMinimumDate(Calendar date) {
1
void setMaximumDate(Calendar date) {
2
		minDate = ((date == null) ? null : copyDate(date, minDate));
2
		maxDate = ((date == null) ? null : copyDate(date, maxDate));
3
		minDay = ((date == null) ? (-1) : minDate.get(Calendar.DATE));
3
		maxDay = ((date == null) ? (-1) : maxDate.get(Calendar.DATE));
4
		_refresh();
4
		_refresh();
5
	}
5
	}
6
	/**
6
	/**
7
	 * Get the earliest selectable date for the chooser.
7
	 * Get the latest selectable date for the chooser.
8
	 * 
8
	 * 
9
	 * @return The minimum selectable date, or <code>null</code> if there is
9
	 * @return The maximum selectable date, or <code>null</code> if there is
10
	 *         no minimum date currently set.
10
	 *         no maximum date currently set.
11
	 */
11
	 */
12
	public Calendar getMinimumDate() {
12
	public Calendar getMaximumDate() {
13
		return (minDate);
13
		return (maxDate);
14
	}
14
	}
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