public class MyEntity {
private Long id;
private String name;
public MyEntity() {
}
public MyEntity(String name) {
this.name = name;
}
public Long getId() {
return id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
public class EntityWithCrazyCompositeKey {
private CrazyCompositeKey id;
private String name;
public CrazyCompositeKey getId() {
return id;
}
public void setId(CrazyCompositeKey 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/generatedkeys/seqidentity/MyEntity.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/hql/EntityWithCrazyCompositeKey.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class MyEntity {
↵ | | 1 | public class EntityWithCrazyCompositeKey {↵
|
2 | private Long id;
↵ | | 2 | private CrazyCompositeKey id;↵
|
3 | private String name;↵ | | 3 | private String name;↵
|
4 |
↵ | | |
|
|
5 | public MyEntity() {↵ | | 4 | public ↵
|
6 | }↵ | | |
|
|
7 | public MyEntity(String name) {
↵ | | 5 | CrazyCompositeKey getId() {↵
|
8 | this.name = name;↵ | | 6 | ↵
|
9 | }↵ | | |
|
|
10 | public Long getId(↵ | | 7 | return id;↵
|
| | | 8 | }↵
|
|
11 | ) {
↵ | | 9 | public void setId(CrazyCompositeKey id) {↵
|
12 | return id;
↵ | | 10 | this.id = id;↵
|
13 | }↵ | | 11 | }↵
|
14 |
↵ | | |
|
|
15 | public String getName() {
↵ | | 12 | public String getName() {↵
|
16 | return name;
↵ | | 13 | return name;↵
|
17 | }↵ | | 14 | }↵
|
18 |
↵ | | |
|
|
19 | public void setName(String name) {
↵ | | 15 | public void setName(String name) {↵
|
20 | this.name = name;
↵ | | 16 | this.name = name;↵
|
21 | | | 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 |