Object previous = data.get(key);
add(key, value);
return previous;
if (nameMap.containsKey(key)) {
String newName = nameMap.getProperty(key);
log.info("Upgrading " + key + " to " + newName);
return newName;
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/util/NameUpdater.java
|
Method name: Object put(Object, Object)
|
|
Method name: String getCurrentTestName(String, String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | Object previous = data.get(key);↵ | | |
|
2 | add(key, value);↵ | | |
|
3 | return previous; | | 1 | if (nameMap.containsKey(key)) {↵
|
| | | 2 | String newName = nameMap.getProperty(key);↵
|
| | | 3 | log.info("Upgrading " + key + " to " + newName);↵
|
| | | 4 | return newName;↵
|
| | | 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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |