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;
public class Identity implements Serializable {
private String name;
private String ssn;
public String getSsn() {
return ssn;
}
public void setSsn(String id) {
this.ssn = 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/jpa/cascade/OtherAssigned.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/propertyref/component/complete/Identity.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class OtherAssigned {↵ | | 1 | public class Identity implements Serializable {↵
|
2 | private Long id;↵ | | 2 | private String name;↵
|
3 | private ParentAssigned owner;↵ | | 3 | private ↵
|
|
4 | public OtherAssigned() {↵ | | |
|
5 | }↵ | | |
|
|
6 | public OtherAssigned(Lo↵ | | 4 | String ssn;↵
|
|
| | | 5 | public String getSsn() {↵
|
| | | 6 | return ssn;↵
|
| | | 7 | }↵
|
7 | ng id) {↵ | | 8 | public void setSsn(String id) {↵
|
8 | this.id = id;↵ | | 9 | this.ssn = id;↵
|
9 | }↵ | | 10 | }↵
|
|
10 | public Long getId() {↵ | | 11 | public ↵
|
11 | return id;↵ | | |
|
12 | }↵ | | |
|
|
13 | public ParentAssigned getOwner() {↵ | | 12 | String getName() {↵
|
14 | return owner;↵ | | 13 | return name;↵
|
15 | }↵ | | 14 | }↵
|
|
16 | public void setOwner(ParentAssigned owner) {↵ | | 15 | public void setName(String name) {↵
|
17 | this.owner = owner;↵ | | 16 | this.name = name;↵
|
18 | | | 17 |
|
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 |