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