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