public class Fixed extends Broken {
private Set set;
private List list = new ArrayList();
public Set getSet() {
return set;
}
public void setSet(Set set) {
this.set = set;
}
public List getList() {
return list;
}
public void setList(List list) {
this.list = list;
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/legacy/Fixed.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 Fixed extends Broken {↵ | | 1 | public class Competition {
↵
|
2 | private Set set;↵ | | 2 | private Integer id;↵
|
| | | 3 |
↵
|
3 | private List list = new ArrayList();↵ | | 4 | private List competitors = new ArrayList();↵
|
|
|
| | | 5 |
↵
|
4 | public Set getSet() {↵ | | 6 | public Integer getId() {
↵
|
5 | return set;↵ | | 7 | return ↵
|
6 | }↵ | | |
|
| | | 8 | id;↵
|
| | | 9 | }↵
|
| | | 10 |
↵
|
7 | public void setSet(Set set) {↵ | | 11 | public void setId(Integer id) {
↵
|
8 | this.set = set;↵ | | 12 | this.↵
|
9 | }↵ | | |
|
| | | 13 | id = id;↵
|
| | | 14 | }↵
|
| | | 15 |
↵
|
10 | public List getList() {↵ | | 16 | public List getCompetitors() {
↵
|
11 | return list;↵ | | 17 | return ↵
|
12 | }↵ | | |
|
|
13 | public void setList(List list↵ | | 18 | competitors;↵
|
| | | 19 | }↵
|
|
14 | ) {↵ | | 20 | public void setCompetitors(List competitors) {
↵
|
15 | this.list = list;↵ | | 21 | this.competitors = competitors;
↵
|
16 | | | 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 |