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 Group { private String name; private Set users = new HashSet(); public String getName() { return name; } public void setName(String name) { this.name = name; } public Set getUsers() { return users; } public void setUsers(Set users) { this.users = users
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/propertyref/basic/Group.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Fixed extends Broken {
1
public class Group {
2
	private Set set;
2
	private String name;
3
	private List list = new ArrayList();
3
	private 
4
Set users = new HashSet();
5
	
4
	public Set getSet() {
6
	public String getName() {
5
		return set;
7
		return name;
6
	}
8
	}
9

7
	public void setSet(Set set) {
10
	public void setName(String name) {
8
		this.set = set;
11
		this.name = name;
9
	}
12
	}
13

10
	public List getList() {
14
	public Set getUsers() {
11
		return list;
15
		return users;
12
	}
16
	}
17

13
	public void setList(List list) {
18
	public void setUsers(Set users) {
14
		this.list = list
19
		this.users = users
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