for (int i = 0; i < 4; i++) {
assertEquals(15, counter);
counter = 0;
if (i > 0) {
counter = 2;
}
TestElement sampler = null;
while ((sampler = controller.next()) != null) {
if (i == 0 && counter < 2) {
assertEquals(interleaveOrder[counter], sampler.getName());
} else {
assertEquals(order[counter], sampler.getName());
}
counter++;
for (int i = 0; i < 4; i++) {
assertEquals(11, counter);
counter = 0;
if (i > 0) {
counter = 2;
}
TestElement sampler = null;
while ((sampler = controller.next()) != null) {
if (i == 0 && counter < 2) {
assertEquals(interleaveOrder[counter], sampler.getName());
} else {
assertEquals(order[counter], sampler.getName());
}
counter++;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/test/src/org/apache/jmeter/control/TestOnceOnlyController.java
|
|
File path: /jakarta-jmeter-2.3.2/test/src/org/apache/jmeter/control/TestOnceOnlyController.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int i = 0; i < 4; i++) {↵ | | 1 | for (int i = 0; i < 4; i++) {↵
|
2 | assertEquals(15, counter);↵ | | 2 | assertEquals(11, counter);↵
|
3 | counter = 0;↵ | | 3 | counter = 0;↵
|
4 | if (i > 0) {↵ | | 4 | if (i > 0) {↵
|
5 | counter = 2;↵ | | 5 | counter = 2;↵
|
6 | }↵ | | 6 | }↵
|
7 | TestElement sampler = null;↵ | | 7 | TestElement sampler = null;↵
|
8 | while ((sampler = controller.next()) != null) {↵ | | 8 | while ((sampler = controller.next()) != null) {↵
|
9 | if (i == 0 && counter < 2) {↵ | | 9 | if (i == 0 && counter < 2) {↵
|
10 | assertEquals(interleaveOrder[counter], sampler.getName());↵ | | 10 | assertEquals(interleaveOrder[counter], sampler.getName());↵
|
11 | } else {↵ | | 11 | } else {↵
|
12 | assertEquals(order[counter], sampler.getName());↵ | | 12 | assertEquals(order[counter], sampler.getName());↵
|
13 | }↵ | | 13 | }↵
|
14 | counter++;↵ | | 14 | counter++;↵
|
15 | | | 15 |
|
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 |