void setDTStamp(Calendar c) { set(ICALENDAR.DTSTAMP, DateParser.createStringFromCalendar(c)); } public Calendar getDTStamp() { String s = get(ICALENDAR.DTSTAMP); Calendar c; try { c = DateParser.createCalendarFromString(s); return c; } catch (IllegalArgumentException e) { LOG.severe("date parsing exception"); e.printStackTrace(); } return Calendar.getInstance();
void setDTStart(Calendar c) { set(ICALENDAR.DTSTART, DateParser.createStringFromCalendar(c)); } public Calendar getDTStart() { String s = get(ICALENDAR.DTSTART); Calendar c; try { c = DateParser.createCalendarFromString(s); return c; } catch (IllegalArgumentException e) { LOG.severe("date parsing exception"); e.printStackTrace(); } return Calendar.getInstance();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/parser/XCSDocumentParser.java File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/parser/XCSDocumentParser.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void setDTStamp(Calendar c) {
1
void setDTStart(Calendar c) {
2
		set(ICALENDAR.DTSTAMP, DateParser.createStringFromCalendar(c));
2
		set(ICALENDAR.DTSTART, DateParser.createStringFromCalendar(c));
3
	}
3
	}
4
	public Calendar getDTStamp() {
4
	public Calendar getDTStart() {
5
		String s = get(ICALENDAR.DTSTAMP);
5
		String s = get(ICALENDAR.DTSTART);
6
		Calendar c;
6
		Calendar c;
7
		try {
7
		try {
8
			c = DateParser.createCalendarFromString(s);
8
			c = DateParser.createCalendarFromString(s);
9
			return c;
9
			return c;
10
		} catch (IllegalArgumentException e) {
10
		} catch (IllegalArgumentException e) {
11
			LOG.severe("date parsing exception");
11
			LOG.severe("date parsing exception");
12
			e.printStackTrace();
12
			e.printStackTrace();
13
		}
13
		}
14
		return Calendar.getInstance();
14
		return Calendar.getInstance();
15
	
15
	
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