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 Info {
private Long id;
private String details;
public Info() {
}
public Info(String details) {
this.details = details;
}
public Long getId() {
return id;
}
public void setId(Long id) {
this.id = id;
}
public String getDetails() {
return details;
}
public void setDetails(String details) {
this.details = details;
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/proxy/Info.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Competitor {↵ | | 1 | public class ↵
|
2 | public Integer↵ | | 2 | Info {↵
|
3 | id;↵ | | 3 | private Long id;↵
|
4 | private String name;↵ | | 4 | private String ↵
|
| | | 5 | details;↵
|
|
5 | public Competitor() {↵ | | 6 | public Info() {↵
|
6 | }↵ | | 7 | }↵
|
|
7 | public Competitor(String name) {↵ | | 8 | public Info(String details) {↵
|
8 | this.name = name;↵ | | 9 | this.details = details;↵
|
9 | }↵ | | 10 | }↵
|
|
10 | public Integer getId() {↵ | | 11 | public Long getId() {↵
|
11 | return id;↵ | | 12 | return id;↵
|
12 | }↵ | | 13 | }↵
|
|
13 | public void setId(Integer id) {↵ | | 14 | public void setId(Long id) {↵
|
14 | this.id = id;↵ | | 15 | this.id = id;↵
|
15 | }↵ | | 16 | }↵
|
|
16 | public String getName() {↵ | | 17 | public String getDetails() {↵
|
17 | return name;↵ | | 18 | return details;↵
|
18 | }↵ | | 19 | }↵
|
|
19 | public void setName(String name) {↵ | | 20 | public void setDetails(String details) {↵
|
20 | this.name = name;↵ | | 21 | this.details = details;↵
|
21 | | | 22 |
|
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 |