public class Parent {
private String name;
private Set children = new HashSet();
public Parent() {
}
public Parent(String name) {
this.name = name;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Set getChildren() {
return children;
}
public void setChildren(Set children) {
this.children = children
public class Search {
private String searchString;
private SortedSet searchResults = new TreeSet();
Search() {}
public Search(String string) {
searchString = string;
}
public SortedSet getSearchResults() {
return searchResults;
}
public void setSearchResults(SortedSet searchResults) {
this.searchResults = searchResults;
}
public String getSearchString() {
return searchString;
}
public void setSearchString(String searchString) {
this.searchString = searchString
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/reattachment/Parent.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/sorted/Search.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class Parent {
↵ | | 1 | public class Search {↵
|
2 | private String name;↵ | | 2 | private String ↵
|
3 | private Set children↵ | | 3 | searchString;↵
|
4 | = new HashSet();↵ | | 4 | private SortedSet searchResults = new TreeSet();↵
|
|
5 | public Parent() {↵ | | |
|
6 | }↵ | | |
|
7 |
↵ | | |
|
| | | 5 | ↵
|
| | | 6 | Search() {}↵
|
| | | 7 | ↵
|
8 | public Parent(String name) {
↵ | | 8 | public Search(String string) {↵
|
9 | this.name = name;↵ | | 9 | ↵
|
10 | }↵ | | |
|
11 |
↵ | | 10 | searchString = string;↵
|
| | | 11 | }↵
|
| | | 12 | ↵
|
12 | public String getName() {
↵ | | 13 | public SortedSet getSearchResults() {↵
|
13 | return name;↵ | | 14 | return ↵
|
14 | }↵ | | |
|
|
15 | public void setName(String name↵ | | 15 | searchResults;↵
|
| | | 16 | }↵
|
16 | ) {
↵ | | 17 | public void setSearchResults(SortedSet searchResults) {↵
|
17 | this.name = name;↵ | | 18 | this.↵
|
18 | }↵ | | |
|
|
19 | public Set getChildren↵ | | 19 | searchResults = searchResults;↵
|
| | | 20 | }↵
|
20 | () {
↵ | | 21 | public String getSearchString() {↵
|
21 | return children;↵ | | 22 | return ↵
|
22 | }↵ | | |
|
23 |
↵ | | 23 | searchString;↵
|
| | | 24 | }↵
|
24 | public void setChildren(Set children) {
↵ | | 25 | public void setSearchString(String searchString) {↵
|
25 | this.children = children | | 26 | this.searchString = searchString
|
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 |