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 Entity { private String name; private List values = new ArrayList(); public Entity() { } public Entity(String name) { this.name = name; } public String getName() { return name; } public List getValues() { return values; } public void setValues(List values) { this.values = values;
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/usercollection/parameterized/Entity.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Competition {
1
public class Entity {
2
	private Integer id;
2
	private 
3
String name;
3
	private List competitors = new ArrayList();
4
	private List values = new ArrayList();
5
	public Entity() {
6
	}
4
	public Integer getId() {
7
	public Ent
5
		return id;
6
	}
7
	public void setId(Integer id) {
8
		this.id = id
8
ity(String name) {
9
		this.name = name;
10
	}
11
	public String getName() {
9
;
12
		return name;
10
	}
13
	}
11
	public List getCompetitors() {
14
	public List getValues() {
12
		return competitors;
15
		return values;
13
	}
16
	}
14
	public void setCompetitors(List competitors) {
17
	public void set
15
		this.competitors = competitor
18
Values(List values) {
16
s;
19
		this.values = values;
17
	
20
	
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