for(int i = 0; i < NUMBER_OF_MENU_ITEMS; i++) {
String fileName = (String)newRecentFiles.get(i);
if(fileName != null) {
setRecentFile(i, fileName);
}
}
if (treePath != null && values != null) {
set(Arrays.asList(treePath), Arrays.asList(values));
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/action/LoadRecentProject.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
Method name: void updateRecentFileMenuItems(List, String)
|
|
Method name: void set(Object[], Object[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 2
|
|
1 | for(int i = 0; i < NUMBER_OF_MENU_ITEMS; i++) {↵ | | 1 | if↵
|
2 | String fileName = (String)newRecentFiles.get(i);↵ | | 2 | (tr↵
|
3 | if(fileName != null) {↵ | | |
|
4 | setRecentFile(i, fileName);↵ | | |
|
5 | }↵ | | |
|
6 | ↵ | | 3 | eePath != null && values != null) {↵
|
| | | 4 | set(Arrays.asList(treePath), Arrays.asList(values));↵
|
7 | } | | 5 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |