Calendar cal = new GregorianCalendar(); if (date != null && date instanceof java.util.Date) { cal.setTime((java.util.Date) date); return cal; } else if (date != null) { DateFormat formatter = DateFormat.getDateInstance(DateFormat.SHORT); java.util.Date d = null; try { d = formatter.parse(date.toString()); } catch (ParseException e) { formatter = DateFormat.getDateInstance(DateFormat.MEDIUM); try { d = formatter.parse((String) date); } catch (ParseException e1) { formatter = DateFormat.getDateInstance(DateFormat.LONG); try { d = formatter.parse((String) date); } catch (ParseException e2) { formatter = DateFormat.getDateInstance(DateFormat.FULL); try { d = formatter.parse((String) date); } catch (ParseException e3) { return defaultValue; } } } } cal.setTime(d); } else { cal = defaultValue; } return cal;
Date val = null; if (date != null && date instanceof java.util.Date) { return (Date) date; } else if (date != null) { DateFormat formatter = DateFormat.getDateInstance(DateFormat.SHORT); // java.util.Date d = null; try { val = formatter.parse(date.toString()); } catch (ParseException e) { formatter = DateFormat.getDateInstance(DateFormat.MEDIUM); try { val = formatter.parse((String) date); } catch (ParseException e1) { formatter = DateFormat.getDateInstance(DateFormat.LONG); try { val = formatter.parse((String) date); } catch (ParseException e2) { formatter = DateFormat.getDateInstance(DateFormat.FULL); try { val = formatter.parse((String) date); } catch (ParseException e3) { return defaultValue; } } } } } else { return defaultValue; } return val;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/util/Converter.java File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/util/Converter.java
Method name: Calendar getCalendar(Object, Calendar) Method name: Date getDate(Object, Date)
Number of AST nodes: 12 Number of AST nodes: 9
1
Calendar cal = new GregorianCalendar();
1
Date val = null;
2
		if (date != null && date instanceof java.util.Date) {
2
		if (date != null && date instanceof java.util.Date) {
3
			cal.setTime((java.util.Date) date);
3
			
4
			return cal;
4
return (Date) date;
5
		} else if (date != null) {
5
		} else if (date != null) {
6
			DateFormat formatter = DateFormat.getDateInstance(DateFormat.SHORT);
6
			DateFormat formatter = DateFormat.getDateInstance(DateFormat.SHORT);
7
			java.util.Date d = null;
7
			// java.util.Date d = null;
8
			try {
8
			try {
9
				d = formatter.parse(date.toString());
9
				val = formatter.parse(date.toString());
10
			} catch (ParseException e) {
10
			} catch (ParseException e) {
11
				formatter = DateFormat.getDateInstance(DateFormat.MEDIUM);
11
				formatter = DateFormat.getDateInstance(DateFormat.MEDIUM);
12
				try {
12
				try {
13
					d = formatter.parse((String) date);
13
					val = formatter.parse((String) date);
14
				} catch (ParseException e1) {
14
				} catch (ParseException e1) {
15
					formatter = DateFormat.getDateInstance(DateFormat.LONG);
15
					formatter = DateFormat.getDateInstance(DateFormat.LONG);
16
					try {
16
					try {
17
						d = formatter.parse((String) date);
17
						val = formatter.parse((String) date);
18
					} catch (ParseException e2) {
18
					} catch (ParseException e2) {
19
						formatter = DateFormat.getDateInstance(DateFormat.FULL);
19
						formatter = DateFormat.getDateInstance(DateFormat.FULL);
20
						try {
20
						try {
21
							d = formatter.parse((String) date);
21
							val = formatter.parse((String) date);
22
						} catch (ParseException e3) {
22
						} catch (ParseException e3) {
23
							return defaultValue;
23
							return defaultValue;
24
						}
24
						}
25
					}
25
					}
26
				}
26
				}
27
			}
27
			}
28
			cal.setTime(d);
28
		
29
		} else {
29
} else {
30
			cal = defaultValue;
30
			return defaultValue;
31
		}
31
		}
32
		return cal;
32
		return val;
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)1.7
Clones locationClones are declared in the same class
Number of node comparisons1