public class Radio {
private Integer id;
private String frequency;
public Integer getId() {
return id;
}
public void setId(Integer id) {
this.id = id;
}
public String getFrequency() {
return frequency;
}
public void setFrequency(String frequency) {
this.frequency = frequency;
public class BankAccount extends Account {
private String accountNumber;
private String bsb;
public String getAccountNumber() {
return accountNumber;
}
public void setAccountNumber(String accountNumber) {
this.accountNumber = accountNumber;
}
public String getBsb() {
return bsb;
}
public void setBsb(String bsb) {
this.bsb = bsb;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/id/Radio.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/propertyref/inheritence/joined/BankAccount.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Radio {↵ | | 1 | public class BankAccount extends Account {
↵
|
2 | private Integer id;↵ | | 2 | private String accountNumber;
↵
|
3 | private String frequency;↵ | | 3 | private String ↵
|
|
4 | public Integer getId↵ | | 4 | bsb;↵
|
|
5 | () {↵ | | 5 | public String getAccountNumber() {
↵
|
6 | return id;↵ | | 6 | return ↵
|
7 | }↵ | | |
|
|
8 | public void setId(Integer id↵ | | 7 | accountNumber;↵
|
| | | 8 | }↵
|
|
9 | ) {↵ | | 9 | public void setAccountNumber(String accountNumber) {
↵
|
10 | this.id = id;↵ | | 10 | this.↵
|
11 | }↵ | | |
|
| | | 11 | accountNumber = accountNumber;↵
|
| | | 12 | }↵
|
| | | 13 |
↵
|
12 | public String getFrequency() {↵ | | 14 | public String getBsb() {
↵
|
13 | return frequency;↵ | | 15 | return ↵
|
14 | }↵ | | |
|
| | | 16 | bsb;↵
|
| | | 17 | }↵
|
| | | 18 |
↵
|
15 | public void setFrequency(String frequency) {↵ | | 19 | public void setBsb(String bsb) {
↵
|
16 | this.frequency = frequency;↵ | | 20 | this.bsb = bsb;
↵
|
17 | | | 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 |