public class Product {
private String name;
private Map parts = new HashMap();
Product() {}
public Product(String n) {
name = n;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Map getParts() {
return parts;
}
public void setParts(Map users) {
this.parts = users;
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/mapcompelem/Product.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 Product {↵ | | 1 | public class Search {↵
|
2 | private String name;↵ | | 2 | private String ↵
|
3 | private Map parts = new HashMap();↵ | | |
|
4 | Product↵ | | 3 | searchString;↵
|
| | | 4 | private SortedSet searchResults = new TreeSet();↵
|
| | | 5 | ↵
|
5 | () {}↵ | | 6 | Search() {}↵
|
6 | ↵ | | 7 | ↵
|
7 | public Product(String n) {↵ | | 8 | public Search(String ↵
|
8 | name = n↵ | | 9 | string) {↵
|
9 | ;↵ | | 10 | searchString = string;↵
|
10 | }↵ | | 11 | }↵
|
11 | ↵ | | 12 | ↵
|
12 | public String getName() {↵ | | 13 | public SortedSet getSearchResults() {↵
|
13 | return name;↵ | | 14 | return searchResults;↵
|
14 | }↵ | | 15 | }↵
|
15 | public void setName(String name) {↵ | | 16 | public void set↵
|
16 | this.name = name↵ | | 17 | SearchResults(SortedSet searchResults) {↵
|
17 | ;↵ | | 18 | this.searchResults = searchResults;↵
|
18 | }↵ | | 19 | }↵
|
19 | public Map getParts() {↵ | | 20 | public String getSearchString() {↵
|
20 | return parts;↵ | | 21 | return searchString;↵
|
21 | }↵ | | 22 | }↵
|
22 | public void setParts(Map users) {↵ | | 23 | public void set↵
|
23 | this.parts↵ | | 24 | SearchString(String searchString) {↵
|
24 | = users;↵ | | 25 | this.searchString = searchString;↵
|
25 | | | 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 |