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 Product implements Serializable {
private String name;
private Set parts = new HashSet();
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Set getParts() {
return parts;
}
public void setParts(Set parts) {
this.parts = parts
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/orphan/Product.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Competition {
↵ | | 1 | public class Product implements Serializable {↵
|
2 | private Integer id;↵ | | 2 | private ↵
|
|
3 | private List competitors = new ArrayList();↵ | | |
|
|
|
4 | public Integer getId↵ | | 3 | String name;↵
|
| | | 4 | private Set parts = new HashSet();↵
|
5 | () {
↵ | | 5 | public String getName() {↵
|
6 | return id;↵ | | 6 | return ↵
|
7 | }↵ | | |
|
8 |
↵ | | 7 | name;↵
|
| | | 8 | }↵
|
9 | public void setId(Integer id) {
↵ | | 9 | public void setName(String name) {↵
|
10 | this.id = id;↵ | | 10 | this.↵
|
11 | }↵ | | |
|
12 |
↵ | | 11 | name = name;↵
|
| | | 12 | }↵
|
13 | public List getCompetitors() {
↵ | | 13 | public Set getParts() {↵
|
14 | return competitors;
↵ | | 14 | return parts;↵
|
15 | }↵ | | 15 | }↵
|
16 |
↵ | | |
|
17 | public void setCompetitors(List competitors) {
↵ | | 16 | public void setParts(Set parts) {↵
|
18 | this.competitors = competitors | | 17 | this.parts = parts
|
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 |