1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*******************************************************************************
* Copyright (c) 2009, 2018 Mountainminds GmbH & Co. KG and Contributors
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Marc R. Hoffmann - initial API and implementation
*
*******************************************************************************/
package org.jacoco.core.test.validation.java5.targets;
import static org.jacoco.core.test.validation.targets.Stubs.f;
import static org.jacoco.core.test.validation.targets.Stubs.i1;
import static org.jacoco.core.test.validation.targets.Stubs.i2;
import static org.jacoco.core.test.validation.targets.Stubs.nop;
import static org.jacoco.core.test.validation.targets.Stubs.t;
/**
* This target exercises boolean expressions.
*/
public class BooleanExpressionsTarget {
public static void main(String[] args) {
/* 1. Boolean comparison result (one case) */
nop(i2() > 3); // assertPartlyCovered(1, 1)
/* 2. Boolean comparison result (both cases) */
for (int i = 0; i < 2; i++) {
nop(i < 1); // assertFullyCovered(0, 2)
}
/* 3. And */
if (f() & f()) { // assertFullyCovered(1, 1)
nop();
}
if (f() & t()) { // assertFullyCovered(1, 1)
nop();
}
if (t() & f()) { // assertFullyCovered(1, 1)
nop();
}
if (t() & t()) { // assertFullyCovered(1, 1)
nop();
}
/* 4. Conditional And */
if (f() && f()) { // assertPartlyCovered(3, 1)
nop();
}
if (f() && t()) { // assertPartlyCovered(3, 1)
nop();
}
if (t() && f()) { // assertFullyCovered(2, 2)
nop();
}
if (t() && t()) { // assertFullyCovered(2, 2)
nop();
}
/* 5. Or */
if (f() | f()) { // assertFullyCovered(1, 1)
nop();
}
if (f() | t()) { // assertFullyCovered(1, 1)
nop();
}
if (t() | f()) { // assertFullyCovered(1, 1)
nop();
}
if (t() | t()) { // assertFullyCovered(1, 1)
nop();
}
/* 6. Conditional Or */
if (f() || f()) { // assertFullyCovered(2, 2)
nop();
}
if (f() || t()) { // assertFullyCovered(2, 2)
nop();
}
if (t() || f()) { // assertPartlyCovered(3, 1)
nop();
}
if (t() || t()) { // assertPartlyCovered(3, 1)
nop();
}
/* 7. Exclusive Or */
if (f() ^ f()) { // assertFullyCovered(1, 1)
nop();
}
if (f() ^ t()) { // assertFullyCovered(1, 1)
nop();
}
if (t() ^ f()) { // assertFullyCovered(1, 1)
nop();
}
if (t() ^ t()) { // assertFullyCovered(1, 1)
nop();
}
/* 8. Conditional Operator */
nop(t() ? i1() : i2()); // assertPartlyCovered(1, 1)
nop(f() ? i1() : i2()); // assertPartlyCovered(1, 1)
/* 9. Not (one case) */
nop(!t()); // assertPartlyCovered(1, 1)
nop(!f()); // assertPartlyCovered(1, 1)
/* 10. Not (both cases) */
for (boolean b : new boolean[] { true, false }) {
nop(!b); // assertFullyCovered(0, 2)
}
}
}
|
