public class DeleteOrphanChild {
private Long id;
private Parent parent;
public Long getId() {
return id;
}
public void setId(Long id) {
this.id = id;
}
public Parent getParent() {
return parent;
}
public void setParent(Parent parent) {
this.parent = parent
public class OtherAssigned {
private Long id;
private ParentAssigned owner;
public OtherAssigned() {
}
public OtherAssigned(Long id) {
this.id = id;
}
public Long getId() {
return id;
}
public ParentAssigned getOwner() {
return owner;
}
public void setOwner(ParentAssigned owner) {
this.owner = owner
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/cascade/DeleteOrphanChild.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/jpa/cascade/OtherAssigned.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class DeleteOrphanChild {↵ | | 1 | public class OtherAssigned {
↵
|
2 | private Long id;↵ | | 2 | private Long id;
↵
|
3 | private Parent parent;↵ | | 3 | private Parent↵
|
|
4 | public Long getId() {↵ | | |
|
5 | return id;↵ | | |
|
6 | }↵ | | |
|
|
7 | public void setI↵ | | 4 | Assigned owner;↵
|
|
| | | 5 | public OtherAssigned() {↵
|
| | | 6 | }↵
|
|
8 | d(Long id) {↵ | | 7 | public OtherAssigned(Long id) {
↵
|
9 | this.id = id;↵ | | 8 | this.id = id;
↵
|
10 | }↵ | | 9 | }↵
|
|
| | | 10 |
↵
|
11 | public Parent getParent↵ | | 11 | public Long getId() {↵
|
| | | 12 | return id;↵
|
| | | 13 | }↵
|
|
12 | () {↵ | | 14 | public ParentAssigned getOwner() {
↵
|
13 | return parent;↵ | | 15 | return ↵
|
14 | }↵ | | |
|
| | | 16 | owner;↵
|
| | | 17 | }↵
|
| | | 18 |
↵
|
15 | public void setParent(Parent parent) {↵ | | 19 | public void setOwner(ParentAssigned owner) {
↵
|
16 | this.parent = parent | | 20 | this.owner = owner
|
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 |