public class User {
private String name;
private Map groups = new HashMap();
public User(String name) {
this.name = name;
}
User() {}
public Map getGroups() {
return groups;
}
public void setGroups(Map groups) {
this.groups = groups;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name
public class Product {
private String name;
private Map parts = new HashMap();
Product() {}
public Product(String n) {
name = n;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Map getParts() {
return parts;
}
public void setParts(Map users) {
this.parts = users
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/joinfetch/User.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/mapcompelem/Product.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class User {↵ | | 1 | public class Product {↵
|
2 | private String name;↵ | | 2 | private String name;↵
|
3 | private Map groups = new HashMap();↵ | | 3 | private Map parts = new HashMap();↵
|
| | | 4 | Product() {}↵
|
4 | public User(String name) {↵ | | 5 | public Product(String n) {↵
|
5 | this.name = name;↵ | | 6 | name = n;↵
|
6 | }↵ | | 7 | }↵
|
|
7 | User() {}↵ | | |
|
|
8 | public Map getGroups() {↵ | | 8 | public String getName() {↵
|
9 | return groups;↵ | | 9 | return name;↵
|
10 | }↵ | | 10 | }↵
|
|
11 | public void setGroups(Map groups) {↵ | | 11 | public void set↵
|
12 | this.groups = groups↵ | | 12 | Name(String name) {↵
|
13 | ;↵ | | 13 | this.name = name;↵
|
14 | }↵ | | 14 | }↵
|
|
15 | public String getName() {↵ | | 15 | public Map getParts() {↵
|
16 | return name;↵ | | 16 | return parts;↵
|
17 | }↵ | | 17 | }↵
|
|
18 | public void setName(String name) {↵ | | 18 | public void set↵
|
19 | this.name = name | | 19 | Parts(Map users) {↵
|
| | | 20 | this.parts = users
|
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 |