for (int count = 0; count < h.length; count++) {
tempList = (List) data.get(h[count]);
if (count < line.length && line[count].length() > 0) {
tempList.add(line[count]);
} else {
tempList.add("N/A");
for (int count = 0; count < h.length; count++) {
tempList = (List) data.get(h[count]);
if (count < line.length && line[count].length() > 0) {
tempList.add(line[count]);
} else {
tempList.add(deflt);
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/Data.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/Data.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int count = 0; count < h.length; count++) {↵ | | 1 | for (int count = 0; count < h.length; count++) {↵
|
2 | tempList = (List) data.get(h[count]);↵ | | 2 | tempList = (List) data.get(h[count]);↵
|
3 | if (count < line.length && line[count].length() > 0) {↵ | | 3 | if (count < line.length && line[count].length() > 0) {↵
|
4 | tempList.add(line[count]);↵ | | 4 | tempList.add(line[count]);↵
|
5 | } else {↵ | | 5 | } else {↵
|
6 | tempList.add("N/A");↵ | | 6 | tempList.add(deflt);↵
|
7 | | | 7 |
|
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 |