public class Radio { private Integer id; private String frequency; public Integer getId() { return id; } public void setId(Integer id) { this.id = id; } public String getFrequency() { return frequency; } public void setFrequency(String frequency) { this.frequency = frequency
public class Paper { private Integer id; private String color; public Integer getId() { return id; } public void setId(Integer id) { this.id = id; } public String getColor() { return color; } public void setColor(String color) { this.color = color
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/id/Radio.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/stateless/Paper.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class Radio {
1
public class Paper {
2
	private Integer id;
2
	private Integer id;
3
	private String frequency;
3
	private String color;
4
	public Integer getId() {
4
	public Integer getId() {
5
		return id;
5
		return id;
6
	}
6
	}
7
	public void setId(Integer id) {
7
	public void setId(Integer id) {
8
		this.id = id;
8
		this.id = id;
9
	}
9
	}
10
	public String getFrequency() {
10
	public String getColor() {
11
		return frequency;
11
		return color;
12
	}
12
	}
13
	public void setFrequency(String frequency) {
13
	public void set
14
		this.frequency = frequency
14
Color(String color) {
15
		this.color = color
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