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 Account { private String accountId; private Customer customer; private Person person; private char type; /** * @return Returns the user. */ public Customer getCustomer() { return customer; } /** * @param user The user to set. */ public void setCustomer(Customer user) { this.customer = user; } /** * @return Returns the accountId. */ public String getAccountId() { return accountId; } /** * @param accountId The accountId to set. */ public void setAccountId(String accountId) { this.accountId = accountId; } /** * @return Returns the type. */ public char getType() { return type; } /** * @param type The type to set. */ public void setType(char type) { this.type = type; } public Person getPerson() { return person; } public void setPerson(Person person) { this.person = person;
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/propertyref/inheritence/discrim/Account.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Eye {
1
public class Account {
2
	private long id;
2
	private String accountId;
3
	private String name;
3
	private 
4
	private Jay jay;
5
	private Set jays = new HashSet();
4
Customer customer;
5
	private Person person;
6
	private char type;
6
	/**
7
	/**
7
	 * @return Returns the id.
8
	 * @return Returns the user.
8
	 */
9
	 */
9
	public long getId() {
10
	public Customer getCustomer() {
10
		return id;
11
		return customer;
11
	}
12
	}
13

12
	/**
14
	/**
13
	 * @param id The id to set.
15
	 * @param user The user to set.
14
	 */
16
	 */
15
	public void setId(long id) {
17
	public void setCustomer(Customer user) {
16
		this.id = id;
18
		this.customer = user;
17
	}
19
	}
20

18
	/**
21
	/**
19
	 * @return Returns the jay.
22
	 * @return Returns the accountId.
20
	 */
23
	 */
21
	public Jay getJay() {
24
	public String getAccountId() {
22
		return jay;
25
		return accountId;
23
	}
26
	}
27

24
	/**
28
	/**
25
	 * @param jay The jay to set.
29
	 * @param accountId The accountId to set.
26
	 */
30
	 */
27
	public void setJay(Jay jay) {
31
	public void setAccountId(String accountId) {
28
		this.jay = jay;
32
		this.accountId = accountId;
29
	}
33
	}
34

30
	/**
35
	/**
31
	 * @return Returns the jays.
36
	 * @return Returns the type.
32
	 */
37
	 */
33
	public Set getJays() {
38
	public char getType() {
34
		return jays;
39
		return type;
35
	}
40
	}
41

36
	/**
42
	/**
37
	 * @param jays The jays to set.
43
	 * @param type The type to set.
38
	 */
44
	 */
39
	public void setJays(Set jays) {
45
	public void setType(char type) {
40
		this.jays = jays;
46
		this.
41
	}
42
	/**
43
	 * @return Returns the name.
44
	 */
47
type = type;
48
	}
45
	public String getName() {
49
	public Person getPerson() {
46
		return name;
50
		return person;
47
	}
51
	}
52

48
	/**
53
	
49
	 * @param name The name to set.
50
	 */
51
	public void setName(String name
52
) {
54
	public void setPerson(Person person) {
53
		this.name = name;
55
		this.person = person;
54
	
56
	
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