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 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/collection/backref/map/compkey/Product.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 Product implements Serializable {↵ | | 1 | public class Competition {
↵
|
2 | private String name;↵ | | 2 | private ↵
|
3 | private Map parts = new HashMap();↵ | | |
|
|
4 | public Product() {↵ | | |
|
5 | }↵ | | |
|
|
6 | public Product(String name↵ | | 3 | Integer id;↵
|
|
| | | 4 | private List competitors = new ArrayList();↵
|
|
|
| | | 5 | public Integer getId() {↵
|
| | | 6 | return id;↵
|
| | | 7 | }↵
|
|
7 | ) {↵ | | 8 | public void setId(Integer id) {
↵
|
8 | this.name = name;↵ | | 9 | this.↵
|
9 | }↵ | | |
|
| | | 10 | id = id;↵
|
| | | 11 | }↵
|
| | | 12 |
↵
|
10 | public String getName() {↵ | | 13 | public ↵
|
11 | return name;↵ | | |
|
12 | }↵ | | |
|
|
13 | public Map getParts() {↵ | | 14 | List getCompetitors() {
↵
|
14 | return parts;↵ | | 15 | return competitors;
↵
|
15 | }↵ | | 16 | }↵
|
|
| | | 17 |
↵
|
16 | public void setParts(Map parts) {↵ | | 18 | public void setCompetitors(List competitors) {
↵
|
17 | this.parts = parts;↵ | | 19 | this.competitors = competitors;
↵
|
18 | | | 20 |
|
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 |