public class Product implements Serializable {
private String name;
private Set parts = new HashSet();
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Set getParts() {
return parts;
}
public void setParts(Set parts) {
this.parts = parts
public class Entity {
private String name;
private List values = new ArrayList();
public Entity() {
}
public Entity(String name) {
this.name = name;
}
public String getName() {
return name;
}
public List getValues() {
return values;
}
public void setValues(List 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/orphan/Product.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/usercollection/parameterized/Entity.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Product implements Serializable {↵ | | 1 | public class Entity {
↵
|
2 | private String name;↵ | | 2 | private String name;
↵
|
3 | private Set parts = new HashSet();↵ | | 3 | private List values = new ArrayList();↵
|
| | | 4 |
↵
|
4 | public ↵ | | 5 | public Entity() {↵
|
| | | 6 | }↵
|
|
5 | String getName() {↵ | | 7 | public Entity(String name) {
↵
|
6 | return name;↵ | | 8 | this.name = name;
↵
|
7 | }↵ | | 9 | }↵
|
| | | 10 |
↵
|
8 | public void setName(String name) {↵ | | 11 | public String getName() {
↵
|
9 | this.name = name;↵ | | 12 | return name;
↵
|
10 | }↵ | | 13 | }↵
|
| | | 14 |
↵
|
11 | public Set getParts() {↵ | | 15 | public List getValues() {
↵
|
12 | return parts;↵ | | 16 | return values;
↵
|
13 | }↵ | | 17 | }↵
|
| | | 18 |
↵
|
14 | public void setParts(Set parts) {↵ | | 19 | public void setValues(List values) {
↵
|
15 | this.parts = parts | | 20 | this.values = values
|
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 |