public class User {
private String name;
private Map groups = new HashMap();
public User(String name) {
this.name = name;
}
User() {}
public Map getGroups() {
return groups;
}
public void setGroups(Map groups) {
this.groups = groups;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
public class Search {
private String searchString;
private Set searchResults = new HashSet();
Search() {}
public Search(String string) {
searchString = string;
}
public Set getSearchResults() {
return searchResults;
}
public void setSearchResults(Set 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/joinfetch/User.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/ordered/Search.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public class User {↵ | | 1 | public class Search {↵
|
2 | private String name;↵ | | 2 | private String ↵
|
3 | private Map group↵ | | 3 | searchString;↵
|
4 | s = new HashMap();↵ | | 4 | private Set searchResults = new HashSet();↵
|
| | | 5 | ↵
|
| | | 6 | Search() {}↵
|
| | | 7 | ↵
|
5 | public User(String name) {↵ | | 8 | public Search(String ↵
|
6 | this.name = name↵ | | 9 | string) {↵
|
7 | ;↵ | | 10 | searchString = string;↵
|
8 | }↵ | | 11 | }↵
|
|
9 | User() {}↵ | | 12 | ↵
|
|
10 | public Map getGroups() {↵ | | 13 | public Set getSearchResults() {↵
|
11 | return groups;↵ | | 14 | return searchResults;↵
|
12 | }↵ | | 15 | }↵
|
|
13 | public void setGroups(Map groups) {↵ | | 16 | public void set↵
|
14 | this.groups = group↵ | | 17 | SearchResults(Set searchResults) {↵
|
15 | s;↵ | | 18 | this.searchResults = searchResults;↵
|
16 | }↵ | | 19 | }↵
|
|
17 | public String getName() {↵ | | 20 | public String getSearchString() {↵
|
18 | return name;↵ | | 21 | return searchString;↵
|
19 | }↵ | | 22 | }↵
|
|
20 | public void setName(String name) {↵ | | 23 | public void set↵
|
21 | this.name = name↵ | | 24 | SearchString(String searchString) {↵
|
22 | ;↵ | | 25 | this.searchString = searchString;↵
|
23 | | | 26 |
|
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 |