public abstract class Vehicle {
private Long id;
private String vin;
private String owner;
public String getVin() {
return vin;
}
public void setVin(String vin) {
this.vin = vin;
}
public String getOwner() {
return owner;
}
public void setOwner(String owner) {
this.owner = owner;
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/hql/Vehicle.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 abstract class Vehicle {↵ | | 1 | public class Competition {
↵
|
2 | private Long id;↵ | | 2 | private Integer id;↵
|
| | | 3 |
↵
|
3 | private String vin;↵ | | 4 | private ↵
|
4 | private String owner;↵ | | |
|
| | | 5 | List competitors = new ArrayList();↵
|
|
| | | 6 |
↵
|
5 | public String getVin() {↵ | | 7 | public Integer getId() {
↵
|
6 | return vin;↵ | | 8 | return ↵
|
7 | }↵ | | |
|
| | | 9 | id;↵
|
| | | 10 | }↵
|
| | | 11 |
↵
|
8 | public void setVin(String vin) {↵ | | 12 | public void setId(Integer id) {
↵
|
9 | this.vin = vin;↵ | | 13 | this.↵
|
10 | }↵ | | |
|
|
11 | public String getOwner↵ | | 14 | id = id;↵
|
| | | 15 | }↵
|
|
12 | () {↵ | | 16 | public List getCompetitors() {
↵
|
13 | return owner;↵ | | 17 | return ↵
|
14 | }↵ | | |
|
|
15 | public void setOwner(String owner↵ | | 18 | competitors;↵
|
| | | 19 | }↵
|
|
16 | ) {↵ | | 20 | public void setCompetitors(List competitors) {
↵
|
17 | this.owner = owner;↵ | | 21 | this.competitors = competitors;
↵
|
18 | | | 22 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |