public class Address { private Long id; private Set lines = new HashSet(); public Long getId() { return id; } public void setId(Long id) { this.id = id; } public Set getLines() { return lines; } public void setLines(Set lines) { this.lines = lines
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
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/any/Address.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/ops/Competition.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Address {
1
public class Competition {
2
	private Long id;
2
	private Integer id;
3
	private Set lines = new HashSet();
3
	private List competitors = new ArrayList();
4
	public Long getId() {
4
	public Integer getId() {
5
		return id;
5
		return id;
6
	}
6
	}
7
	public void setId(Long id) {
7
	public void setId(Integer id) {
8
		this.id = id;
8
		this.id = id;
9
	}
9
	}
10
	public Set getLines() {
10
	public List getCompetitors() {
11
		return lines;
11
		return competitors;
12
	}
12
	}
13
	public void setLines(Set lines) {
13
	public void set
14
		this.lines = line
14
Competitors(List competitors) {
15
s
15
		this.competitors = competitors
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