public class Eye { private long id; private String name; private Jay jay; private Set jays = new HashSet(); /** * @return Returns the id. */ public long getId() { return id; } /** * @param id The id to set. */ public void setId(long id) { this.id = id; } /** * @return Returns the jay. */ public Jay getJay() { return jay; } /** * @param jay The jay to set. */ public void setJay(Jay jay) { this.jay = jay; } /** * @return Returns the jays. */ public Set getJays() { return jays; } /** * @param jays The jays to set. */ public void setJays(Set jays) { this.jays = jays; } /** * @return Returns the name. */ public String getName() { return name; } /** * @param name The name to set. */ public void setName(String name) { this.name = name;
public class DataPoint { private long id; private BigDecimal x; private BigDecimal y; private String description; /** * @return Returns the description. */ public String getDescription() { return description; } /** * @param description The description to set. */ public void setDescription(String description) { this.description = description; } /** * @return Returns the id. */ public long getId() { return id; } /** * @param id The id to set. */ public void setId(long id) { this.id = id; } /** * @return Returns the x. */ public BigDecimal getX() { return x; } /** * @param x The x to set. */ public void setX(BigDecimal x) { this.x = x; } /** * @return Returns the y. */ public BigDecimal getY() { return y; } /** * @param y The y to set. */ public void setY(BigDecimal y) { this.y = y;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/Eye.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/readonly/DataPoint.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Eye {
1
public class DataPoint {
2
	private long id;
2
	private long id;
3
	private String name;
3
	private 
4
	private Jay jay;
5
	private Set jays = new HashSet();
4
BigDecimal x;
5
	private BigDecimal y;
6
	private String description;
6
	/**
7
	/**
7
	 * @return Returns the id.
8
	 * @return Returns the description.
8
	 */
9
	 */
9
	public long getId() {
10
	public String getDescription() {
10
		return id;
11
		return description;
11
	}
12
	}
12
	/**
13
	/**
13
	 * @param id The id to set.
14
	 * @param description The description to set.
14
	 */
15
	 */
15
	public void setId(long id) {
16
	public void set
16
		this.id = id
17
Description(String description) {
17
;
18
		this.description = description;
18
	}
19
	}
19
	/**
20
	/**
20
	 * @return Returns the jay.
21
	 * @return Returns the id.
21
	 */
22
	 */
22
	public Jay getJay() {
23
	public long getId() {
23
		return jay;
24
		return id;
24
	}
25
	}
25
	/**
26
	/**
26
	 * @param jay The jay to set.
27
	 * @param id The id to set.
27
	 */
28
	 */
28
	public void setJay(Jay jay) {
29
	public void setId(long id) {
29
		this.jay = jay;
30
		this.id = id;
30
	}
31
	}
31
	/**
32
	/**
32
	 * @return Returns the jays.
33
	 * @return Returns the x.
33
	 */
34
	 */
34
	public Set getJays() {
35
	public BigDecimal getX() {
35
		return jays;
36
		return x;
36
	}
37
	}
37
	/**
38
	/**
38
	 * @param jays The jays to set.
39
	 * @param x The x to set.
39
	 */
40
	 */
40
	public void setJays(Set jays) {
41
	public void set
41
		this.jays = jays
42
X(BigDecimal x) {
42
;
43
		this.x = x;
43
	}
44
	}
44
	/**
45
	/**
45
	 * @return Returns the name.
46
	 * @return Returns the y.
46
	 */
47
	 */
47
	public String getName() {
48
	public BigDecimal getY() {
48
		return name;
49
		return y;
49
	}
50
	}
50
	/**
51
	/**
51
	 * @param name The name to set.
52
	 * @param y The y to set.
52
	 */
53
	 */
53
	public void setName(String name) {
54
	public void set
54
		this.name = name
55
Y(BigDecimal y) {
55
;
56
		this.y = y;
56
	
57
	
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