File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java | File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/SortedHashTree.java | |||
Method name: void HashTree(Collection)
|
Method name: void SortedHashTree(Collection)
|
|||
Number of AST nodes: 4 | Number of AST nodes: 4 | |||
1 | data = new HashMap();↵ | 1 | data = new TreeMap();↵ | |
2 | Iterator it = keys.iterator();↵ | 2 | Iterator it = keys.iterator();↵ | |
3 | while (it.hasNext()) {↵ | 3 | while (it.hasNext()) {↵ | |
4 | data.put(it.next(), new HashTree());↵ | 4 | data.put(it.next(), new SortedHashTree());↵ | |
5 | } | 5 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
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 having the same super class |
Number of node comparisons | 6 |
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 9.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | data = new HashMap(); |
| 1 | data = new TreeMap(); | ||||||||||
2 | Iterator it = keys.iterator(); | 2 | Iterator it = keys.iterator(); | |||||||||||
3 | while (it.hasNext()) | 3 | while (it.hasNext()) | |||||||||||
4 | data.put(it.next(), new HashTree()); |
| 4 | data.put(it.next(), new SortedHashTree()); |
Row | Violation |
---|