public class Competition { private Integer id; private List competitors = new ArrayList(); public Integer getId() { return id; } public void setId(Integer id) { this.id = id; } public List getCompetitors() { return competitors; } public void setCompetitors(List competitors) { this.competitors = competitors;
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/ops/Competition.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 Competition {
1
public class Group {
2
	private Integer id;
2
	private 
3
	private List competito
3
String name;
4
rs = new ArrayList();
4
	private Set users = new HashSet();
5
	
5
	public Integer getId() {
6
	public String getName() {
6
		return id;
7
		return name;
7
	}
8
	}
8
	public void setId(Integer id) {
9
	public void setName(String name) {
9
		this.id = id;
10
		this.name = name;
10
	}
11
	}
11
	public List getCompetitors() {
12
	public Set getUsers() {
12
		return competitors;
13
		return users;
13
	}
14
	}
14
	public void setCompetitors(List competitors) {
15
	public void setUsers(Set users) {
15
		this.competitors = competitors;
16
		this.users = users;
16
	
17
	
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