public class Address {
private Long id;
private Set lines = new HashSet();
public Long getId() {
return id;
}
public void setId(Long id) {
this.id = id;
}
public Set getLines() {
return lines;
}
public void setLines(Set lines) {
this.lines = lines;
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;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/any/Address.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/collection/backref/map/compkey/Product.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Address {↵ | | 1 | public class ↵
|
2 | private Long id;
↵ | | 2 | Product implements Serializable {↵
|
| | | 3 | private String name;↵
|
3 | private Set lines = new HashSet();↵ | | 4 | private Map parts = new Hash↵
|
|
4 | public Long getId() {↵ | | |
|
5 | return id;↵ | | |
|
6 | }↵ | | |
|
|
7 | public void setId(Long id↵ | | 5 | Map();↵
|
|
| | | 6 | public Product() {↵
|
| | | 7 | }↵
|
|
8 | ) {
↵ | | 8 | public Product(String name) {↵
|
9 | this.id = id;↵ | | 9 | this.↵
|
10 | }↵ | | |
|
11 |
↵ | | 10 | name = name;↵
|
| | | 11 | }↵
|
|
12 | public Set getLines() {
↵ | | 12 | public String getName() {↵
|
13 | return line↵ | | 13 | return name;↵
|
| | | 14 | }↵
|
|
| | | 15 | public Map getParts() {↵
|
14 | s;
↵ | | 16 | return parts;↵
|
15 | }↵ | | 17 | }↵
|
16 |
↵ | | |
|
|
17 | public void setLines(Set lines) {
↵ | | 18 | public void setParts(Map parts) {↵
|
18 | this.lines = lines;
↵ | | 19 | this.parts = parts;↵
|
19 | | | 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 |