public class Child {
private String name;
private Parent parent;
public Child() {
}
public Child(String name) {
this.name = name;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Parent getParent() {
return parent;
}
public void setParent(Parent parent) {
this.parent = parent;
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;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/collection/set/Child.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/ops/Competitor.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Child {↵ | | 1 | public class C↵
|
2 | private String name;↵ | | |
|
3 | private Parent parent;↵ | | 2 | ompetitor {↵
|
| | | 3 | public Integer id;↵
|
| | | 4 | private String name;↵
|
|
|
4 | public Child() {↵ | | 5 | public Competitor() {↵
|
5 | }↵ | | 6 | }↵
|
|
6 | public Child(String name) {↵ | | 7 | public Competitor(String name) {↵
|
7 | this.name = name;↵ | | 8 | this.name = name;↵
|
8 | }↵ | | 9 | }↵
|
|
9 | public String getName() {↵ | | 10 | public Integer getId() {↵
|
10 | return name;↵ | | 11 | return id;↵
|
11 | }↵ | | 12 | }↵
|
|
12 | public void setName(String name) {↵ | | 13 | public void setId(Integer id) {↵
|
13 | this.name = name;↵ | | 14 | this.id = id;↵
|
14 | }↵ | | 15 | }↵
|
|
15 | public Parent getParent() {↵ | | 16 | public String getName() {↵
|
16 | return parent;↵ | | 17 | return name;↵
|
17 | }↵ | | 18 | }↵
|
|
18 | public void setParent(Parent parent) {↵ | | 19 | public void setName(String name) {↵
|
19 | this.parent = parent;↵ | | 20 | this.name = name;↵
|
20 | | | 21 |
|
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 |