1 package com.google.checkstyle.test.chapter4formatting.rule451wheretobreak;
2
3 import java.util.Arrays;
4 import java.util.HashMap;
5 import java.util.Map;
6
7 class InputOperatorWrap
8 {
9 void test()
10 {
11 /*warn*/int x = 1 +
12 /*warn*/ 2 -
13 3
14 -
15 4;
16 x = x + 2;
17 boolean y = true
18 &&
19 false;
20 /*warn*/ y = true &&
21 false;
22 y = false
23 && true;
24 /* Note: The three tests below will be used when issue #3381 is closed */
25 Arrays.sort(null, String
26 ::
27 compareToIgnoreCase);
28 Arrays.sort(null, String:: /*(warn)*/
29 compareToIgnoreCase);
30 Arrays.sort(null, String
31 ::compareToIgnoreCase);
32 }
33
34 void testAssignment()
35 {
36 int x
37 = 0;
38 int y =
39 0;
40 }
41
42 <
43 T extends Comparable &
44 java.io.Serializable
45 >
46 void testGenerics1()
47 {
48 Comparable
49 <
50 String
51 >
52 c = new String();
53 Map<String, String> map = new HashMap<String, String>();
54
55 boolean flag = false;
56
57 int init = 9;
58
59 /*ok*/ for (Map.Entry<String, String> entry :
60 map.entrySet())
61 {
62 /*warn*/int i = flag == true ?
63 1 : 2;
64 }
65
66 /*warn*/ if (init !=
67 9)
68 {
69
70 }
71
72 /*warn*/ while (init ==
73 10)
74 {
75
76 }
77
78 /*warn*/ if (init >
79 10)
80 {
81
82 } else {}
83
84 /*warn*/ while (init < 10 ||
85 !flag) {
86
87 }
88 }
89
90 class Inner {
91 void testGenerics1
92 ()
93 {
94 Comparable
95 <
96 String
97 >
98 c = new String();
99 Map<String, String> map = new HashMap<String, String>();
100 boolean flag = false;
101
102 int init = 9;
103
104 /*ok*/ for (Map.Entry<String, String> entry :
105 map.entrySet())
106 {
107 /*warn*/int i = flag == true ?
108 1 : 2;
109 }
110
111 /*warn*/ if (init !=
112 9)
113 {
114
115 }
116
117 /*warn*/ while (init ==
118 10)
119 {
120
121 }
122
123 /*warn*/ if (init >
124 10)
125 {
126
127 } else {}
128
129 /*warn*/ while (init < 10 ||
130 !flag) {
131
132 }
133 }
134 }
135
136 Inner anon = new Inner
137 (){
138 void testGenerics1
139 ()
140 {
141 Comparable
142 <
143 String
144 >
145 c = new String();
146 Map<String, String> map = new HashMap<String, String>();
147 boolean flag = false;
148 int init = 9;
149
150 /*ok*/ for (Map.Entry<String, String> entry :
151 map.entrySet())
152 {
153 /*warn*/int i = flag == true ?
154 1 : 2;
155 }
156
157 /*warn*/ if (init !=
158 9)
159 {
160
161 }
162
163 /*warn*/ while (init ==
164 10)
165 {
166
167 }
168
169 /*warn*/ if (init >
170 10)
171 {
172
173 } else {}
174
175 /*warn*/ while (init < 10 ||
176 !flag) {
177
178 }
179 }
180 };
181 }
182
183 class AsInput {
184 int abc = 0;
185 String string
186 = "string";
187 double PI = // ok
188 3.1415;
189 }
190
191 class Ternary {
192 void foo() {
193 boolean flag = true;
194 /*warn*/int i = flag == true ?
195 1 :
196 2;
197 int i2 = flag == true
198 ?
199 1
200 :
201 2;
202 int i3 = flag == true
203 ? 1
204 : 2;
205
206 }
207 }
208
209 class AssignClass {
210 void foo() {
211 int i = 0;
212 int j = 0;
213 i +=
214 1;
215 j
216 += 2;
217 i -=
218 1;
219 j
220 -= 2;
221 i /=
222 1;
223 j
224 /= 2;
225 i *=
226 1;
227 j
228 *= 2;
229 i %=
230 1;
231 j
232 %= 2;
233 i ^=
234 1;
235 j
236 ^= 2;
237 i |=
238 1;
239 j
240 |= 2;
241 i &=
242 1;
243 j
244 &= 2;
245 i >>=
246 1;
247 j
248 >>= 2;
249 i >>>=
250 1;
251 j
252 >>>= 2;
253 i <<=
254 1;
255 j
256 <<= 2;
257 }
258
259 class InnerClass {
260 void foo() {
261 int i = 0;
262 int j = 0;
263 i +=
264 1;
265 j
266 += 2;
267 i -=
268 1;
269 j
270 -= 2;
271 i /=
272 1;
273 j
274 /= 2;
275 i *=
276 1;
277 j
278 *= 2;
279 i %=
280 1;
281 j
282 %= 2;
283 i ^=
284 1;
285 j
286 ^= 2;
287 i |=
288 1;
289 j
290 |= 2;
291 i &=
292 1;
293 j
294 &= 2;
295 i >>=
296 1;
297 j
298 >>= 2;
299 i >>>=
300 1;
301 j
302 >>>= 2;
303 i <<=
304 1;
305 j
306 <<= 2;
307 }
308 }
309
310 InnerClass anon = new InnerClass() {
311 void foo() {
312 int i = 0;
313 int j = 0;
314 i +=
315 1;
316 j
317 += 2;
318 i -=
319 1;
320 j
321 -= 2;
322 i /=
323 1;
324 j
325 /= 2;
326 i *=
327 1;
328 j
329 *= 2;
330 i %=
331 1;
332 j
333 %= 2;
334 i ^=
335 1;
336 j
337 ^= 2;
338 i |=
339 1;
340 j
341 |= 2;
342 i &=
343 1;
344 j
345 &= 2;
346 i >>=
347 1;
348 j
349 >>= 2;
350 i >>>=
351 1;
352 j
353 >>>= 2;
354 i <<=
355 1;
356 j
357 <<= 2;
358 }
359 };
360 }