public class Address { private Long id; private String street1; private String street2; private String city; private String state; private String zipCode; public Long getId() { return id; } public void setId(Long id) { this.id = id; } public String getStreet1() { return street1; } public void setStreet1(String street1) { this.street1 = street1; } public String getStreet2() { return street2; } public void setStreet2(String street2) { this.street2 = street2; } public String getCity() { return city; } public void setCity(String city) { this.city = city; } public String getState() { return state; } public void setState(String state) { this.state = state; } public String getZipCode() { return zipCode; } public void setZipCode(String zipCode) { this.zipCode = zipCode
public class Salesperson { private Long id; private String name; private String region; private Date hireDate; private Department department; private Set orders = new HashSet(); public Long getId() { return id; } public void setId(Long id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } public String getRegion() { return region; } public void setRegion(String region) { this.region = region; } public Set getOrders() { return orders; } public void setOrders(Set orders) { this.orders = orders; } public Date getHireDate() { return hireDate; } public void setHireDate(Date hireDate) { this.hireDate = hireDate; } public Department getDepartment() { return department; } public void setDepartment(Department department) { this.department = department
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/component/cascading/toone/Address.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/filter/Salesperson.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Address {
1
public class Salesperson {
2
	private Long id;
2
	private Long id;
3
	private String street1;
3
	private String name;
4
	private String street2;
4
	private String region;
5
	private String city;
5
	private 
6
	private String state;
7
	private String zipCode;
8

6
Date hireDate;
7
	private Department department;
8
	private Set orders = new HashSet();
9
	public Long getId() {
9
	public Long getId() {
10
		return id;
10
		return id;
11
	}
11
	}
12

13
	public void setId(Long id) {
12
	public void setId(Long id) {
14
		this.id = id;
13
		this.id = id;
15
	}
14
	}
16

17
	public String getStreet1() {
15
	public String getName() {
18
		return street1;
16
		return 
19
	}
20

17
name;
18
	}
21
	public void setStreet1(String street1) {
19
	public void setName(String name) {
22
		this.street1 = street1;
20
		this.
23
	}
24

21
name = name;
22
	}
25
	public String getStreet2() {
23
	public String getRegion() {
26
		return street2;
24
		return 
27
	}
28

25
region;
26
	}
29
	public void setStreet2(String street2) {
27
	public void setRegion(String region) {
30
		this.street2 = street2;
28
		this.
31
	}
32
	public String getCity
29
region = region;
30
	}
33
() {
31
	public Set getOrders() {
34
		return city;
32
		return 
35
	}
36

33
orders;
34
	}
37
	public void setCity(String city) {
35
	public void setOrders(Set orders) {
38
		this.city = city;
36
		this.
39
	}
40
	public String getSt
37
orders = orders;
38
	}
41
ate() {
39
	public Date getHireDate() {
42
		return state;
40
		return hireDate;
43
	}
41
	}
44

45
	public void setState(String state) {
42
	public void setHireDate(Date hireDate) {
46
		this.state = state;
43
		this.hireDate = hireDate;
47
	}
44
	}
48

49
	public String getZipCode() {
45
	public Department getDepartment() {
50
		return zipCode;
46
		return 
51
	}
52

47
department;
48
	}
53
	public void setZipCode(String zipCode) {
49
	public void setDepartment(Department department) {
54
		this.zipCode = zipCode
50
		this.department = department
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