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
public class Product implements Serializable { private String name; private Set parts = new HashSet(); public String getName() { return name; } public void setName(String name) { this.name = name; } public Set getParts() { return parts; } public void setParts(Set parts) { this.parts = parts
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/Fixed.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/orphan/Product.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Fixed extends Broken {
1
public class Product implements Serializable {
2
	private Set set;
2
	private String name;
3
	private List list = new ArrayList();
3
	private Set parts = new HashSet();
4
	public Set getSet() {
4
	public String getName() {
5
		return set;
5
		return name;
6
	}
6
	}
7
	public void setSet(Set set) {
7
	public void set
8
		this.set = set
8
Name(String name) {
9
;
9
		this.name = name;
10
	}
10
	}
11
	public List getList() {
11
	public Set getParts() {
12
		return list;
12
		return parts;
13
	}
13
	}
14
	public void setList(List list) {
14
	public void set
15
		this.list = list
15
Parts(Set parts) {
16
		this.parts = parts
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