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(Object[])
|
Method name: void SortedHashTree(Object[])
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | data = new HashMap();↵ | 1 | data = new TreeMap();↵ | |
2 | for (int x = 0; x < keys.length; x++) {↵ | 2 | for (int x = 0; x < keys.length; x++) {↵ | |
3 | data.put(keys[x], new HashTree());↵ | 3 | data.put(keys[x], new SortedHashTree());↵ | |
4 | } | 4 |
| |
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.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 5 |
Number of mapped statements | 3 |
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) | 49.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | data = new HashMap(); |
| 1 | data = new TreeMap(); | ||||||||||||
2 | for (int x = 0; x < keys.length; x++) | 2 | for (int x = 0; x < keys.length; x++) | |||||||||||||
3 | data.put(keys[x], new HashTree()); |
| 3 | data.put(keys[x], new SortedHashTree()); |
Row | Violation |
---|---|
1 | Expression new HashMap() cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression new TreeMap() cannot be parameterized, because it has dependencies to/from statements that will be extracted |