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