public class Address { private Long id; private Set lines = new HashSet(); public Long getId() { return id; } public void setId(Long id) { this.id = id; } public Set getLines() { return lines; } public void setLines(Set lines) { this.lines = lines;
public class Fixed extends Broken { private Set set; private List list = new ArrayList(); public Set getSet() { return set; } public void setSet(Set set) { this.set = set; } public List getList() { return list; } public void setList(List list) { this.list = list;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/any/Address.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/Fixed.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Address {
1
public class Fixed extends Broken {
2
	private Long id;
2
	private Set set;
3
	private Set lines = new HashSet();
3
	private List list = new ArrayList();
4

5
	public Long getId() {
4
	public Set getSet() {
6
		return id;
5
		return 
7
	}
8

6
set;
7
	}
9
	public void setId(Long id) {
8
	public void setSet(Set set) {
10
		this.id = id;
9
		this.
11
	}
12

10
set = set;
11
	}
13
	public Set getLines() {
12
	public List getList() {
14
		return lines;
13
		return li
15
	}
16

14
st;
15
	}
17
	public void setLines(Set lines) {
16
	public void setList(List list) {
18
		this.lines = lines;
17
		this.list = list;
19
	
18
	
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