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