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 Definition {
private Long id;
private Set values = new HashSet();
public Long getId() {
return id;
}
public void setId(Long id) {
this.id = id;
}
public Set getValues() {
return values;
}
public void setValues(Set values) {
this.values = values;
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/component/cascading/collection/Definition.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Product implements Serializable {↵ | | 1 | public class ↵
|
2 | private String name;↵ | | 2 | Definition {↵
|
| | | 3 | private Long id;
↵
|
3 | private Map parts = new HashMap();↵ | | 4 | private Set values = new Hash↵
|
|
4 | public Product() {↵ | | |
|
5 | }↵ | | |
|
|
6 | public Product(String name↵ | | 5 | Set();↵
|
|
| | | 6 | public Long getId() {↵
|
| | | 7 | return id;↵
|
| | | 8 | }↵
|
|
7 | ) {↵ | | 9 | public void setId(Long id) {
↵
|
8 | this.name = name;↵ | | 10 | this.↵
|
9 | }↵ | | |
|
|
10 | public String getName() {↵ | | |
|
11 | return name;↵ | | |
|
12 | }↵ | | |
|
|
13 | public Map getPart↵ | | 11 | id = id;↵
|
| | | 12 | }↵
|
|
14 | s() {↵ | | 13 | public Set getValues() {
↵
|
15 | return parts;↵ | | 14 | return values;
↵
|
16 | }↵ | | 15 | }↵
|
|
| | | 16 |
↵
|
17 | public void setParts(Map parts) {↵ | | 17 | public void setValues(Set values) {
↵
|
18 | this.parts = parts;↵ | | 18 | this.values = values;
↵
|
19 | | | 19 |
|
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 |