public class User {
private Long id;
private String name;
public User() {
}
public User(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
public class Child {
private String name;
private List friends;
Child() {}
public Child(String name) {
this.name = name;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public List getFriends() {
return friends;
}
public void setFriends(List friends) {
this.friends = friends
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/stateless/fetching/User.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/subselectfetch/Child.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class User {↵ | | 1 | public class Child {↵
|
2 | private Long id;↵ | | 2 | private ↵
|
3 | private String name;↵ | | |
|
|
4 | public User() {↵ | | |
|
5 | }↵ | | |
|
| | | 3 | String name;↵
|
| | | 4 | private List friends;↵
|
|
| | | 5 | Child() {}↵
|
6 | public User(String name) {↵ | | 6 | public Child(String name) {↵
|
7 | this.name = name;↵ | | 7 | this.name = name;↵
|
8 | }↵ | | 8 | }↵
|
|
9 | public Long getId() {↵ | | 9 | public String getName() {↵
|
10 | return id;↵ | | 10 | return name;↵
|
11 | }↵ | | 11 | }↵
|
| | | 12 | ↵
|
12 | public void setId(Long id) {↵ | | 13 | public void set↵
|
13 | this.id = id↵ | | 14 | Name(String name) {↵
|
14 | ;↵ | | 15 | this.name = name;↵
|
15 | }↵ | | 16 | }↵
|
|
16 | public String getName() {↵ | | 17 | public List getFriends() {↵
|
17 | return name;↵ | | 18 | return friends;↵
|
18 | }↵ | | 19 | }↵
|
| | | 20 | ↵
|
19 | public void setName(String name) {↵ | | 21 | public void set↵
|
20 | this.name = name | | 22 | Friends(List friends) {↵
|
| | | 23 | this.friends = friends
|
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 |