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: void testProcessing() Method name: void testProcessing2()
Number of AST nodes: 11 Number of AST nodes: 11
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
				}
16
			}
16
			}
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.6
Clones locationClones are declared in the same class
Number of node comparisons35
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements11
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)9.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    24
    for (int i = 0; i < 4; i++)
    25
    for (int i = 0; i < 4; i++)
    25
    assertEquals(15, counter);
    25
    assertEquals(15, counter);
    26
    assertEquals(11, counter);
    Differences
    Expression1Expression2Difference
    1511LITERAL_VALUE_MISMATCH
    26
    assertEquals(11, counter);
    26
    counter = 0;
    27
    counter = 0;
    27
    if (i > 0)
    28
    if (i > 0)
    28
    counter = 2;
    29
    counter = 2;
    29
    TestElement sampler = null;
    30
    TestElement sampler = null;
    30
    while ((sampler = controller.next()) != null)
    31
    while ((sampler = controller.next()) != null)
    31
    if (i == 0 && counter < 2)
    32
    if (i == 0 && counter < 2)
    32
    assertEquals(interleaveOrder[counter], sampler.getName());
    33
    assertEquals(interleaveOrder[counter], sampler.getName());
    else
    else
    33
    assertEquals(order[counter], sampler.getName());
    34
    assertEquals(order[counter], sampler.getName());
    34
    counter++;
    35
    counter++;
    Precondition Violations (0)
    Row Violation