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