public class Definition { private Long id; private Set values = new HashSet(); public Long getId() { return id; } public void setId(Long id) { this.id = id; } public Set getValues() { return values; } public void setValues(Set values) { this.values = values
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/component/cascading/collection/Definition.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 Definition {
1
public class 
2
    private Long id;
3
	private Set values = new HashSe
2
Fixed extends Broken {
3
	private Set set;
4
t();
4
	private List list = new ArrayList();
5

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

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

11
set = set;
12
	}
14
	public Set getValues() {
13
	public List getList() {
15
		return values;
14
		return 
16
	}
17

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