public class Product implements Serializable {
private String name;
private Map parts = new HashMap();
public Product() {
}
public Product(String name) {
this.name = name;
}
public String getName() {
return name;
}
public Map getParts() {
return parts;
}
public void setParts(Map parts) {
this.parts = parts;
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;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/collection/backref/map/compkey/Product.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/Fixed.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Product implements Serializable {↵ | | 1 | public class Fixed extends Broken {↵
|
2 | private String name;↵ | | 2 | private Set set;↵
|
3 | private Map parts = new HashMap();↵ | | 3 | private ↵
|
|
4 | public Product() {↵ | | |
|
5 | }↵ | | |
|
|
6 | public Product(String name) {↵ | | |
|
7 | this.name = name;↵ | | |
|
8 | }↵ | | |
|
|
9 | public String getName() {↵ | | |
|
10 | return name↵ | | 4 | List list = new ArrayList();↵
|
|
| | | 5 | public Set getSet() {↵
|
| | | 6 | return set;↵
|
| | | 7 | }↵
|
|
| | | 8 | public void setSet(Set set) {↵
|
11 | ;↵ | | 9 | this.set = set;↵
|
12 | }↵ | | 10 | }↵
|
|
13 | public Map getParts() {↵ | | 11 | public List getList() {↵
|
14 | return parts;↵ | | 12 | return list;↵
|
15 | }↵ | | 13 | }↵
|
|
16 | public void setParts(Map parts) {↵ | | 14 | public void set↵
|
17 | this.parts = parts↵ | | 15 | List(List list) {↵
|
18 | ;↵ | | 16 | this.list = list;↵
|
19 | | | 17 |
|
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 |