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