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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498 | package Torello.Java;
import java.util.function.Predicate;
import static Torello.Java.StrTokCmpr.AND;
import static Torello.Java.StrTokCmpr.OR;
import static Torello.Java.StrTokCmpr.XOR;
import static Torello.Java.StrTokCmpr.NAND;
class TokCmprCN
{
// This method remains 'protected' because it utilizes a specialized Loop-Control
// Variable Class Version of 'LV'. It is used internally by the search methods above.
static boolean contains(
final String srcStr,
final LV l,
final String token
)
{
// String.regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)
// Tests if two string regions are equal. A substring of this String object is
// compared to a substring of the argument other. The result is true if these substrings
// represent character sequences that are the same, ignoring case if and only if ignoreCase
// is true.
final int tokenLen = token.length();
final int loopLen = l.end - tokenLen;
if ((l.end - l.start) < token.length())
return false;
for (int i=l.start; i <= loopLen; i++)
if ( srcStr.regionMatches(i, token, 0, tokenLen)
&& ( (i == 0)
|| Character.isWhitespace(srcStr.charAt(i-1)))
&& ( ((i + tokenLen) == srcStr.length())
|| Character.isWhitespace(srcStr.charAt(i + tokenLen)))
)
return true;
return false;
}
// This method remains 'protected' because it utilizes a specialized Loop-Control
// Variable Class Version of 'LV'. It is used internally by the search methods above.
static boolean containsIgnoreCase(
final String srcStr,
final LV l,
final String token
)
{
// String.regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)
// Tests if two string regions are equal. A substring of this String object is
// compared to a substring of the argument other. The result is true if these substrings
// represent character sequences that are the same, ignoring case if and only if ignoreCase
// is true.
int tokenLen = token.length();
int loopLen = l.end - tokenLen;
if ((l.end - l.start) < token.length()) return false;
for (int i=l.start; i <= loopLen; i++)
if ( srcStr.regionMatches(true, i, token, 0, tokenLen)
&& ( (i == 0)
|| Character.isWhitespace(srcStr.charAt(i-1)))
&& ( ((i + tokenLen) == srcStr.length())
|| Character.isWhitespace(srcStr.charAt(i + tokenLen)))
)
return true;
return false;
}
// This method remains 'protected' because it utilizes a specialized Loop-Control
// Variable Class Version of 'LV'. It is used internally by the search methods above.
static boolean contains(
final String srcStr,
final LV l,
final Predicate<Character> extraDelimiterTest,
final String token
)
{
// String.regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)
// Tests if two string regions are equal. A substring of this String object is
// compared to a substring of the argument other. The result is true if these substrings
// represent character sequences that are the same, ignoring case if and only if ignoreCase
// is true.
final int tokenLen = token.length();
final int loopLen = l.end - tokenLen;
if ((l.end - l.start) < token.length())
return false;
for (int i=l.start; i <= loopLen; i++)
if ( srcStr.regionMatches(i, token, 0, tokenLen)
&& ( (i == 0)
|| Character.isWhitespace(srcStr.charAt(i-1))
|| extraDelimiterTest.test(srcStr.charAt(i-1)))
&& ( ((i + tokenLen) == srcStr.length())
|| Character.isWhitespace(srcStr.charAt(i + tokenLen))
|| extraDelimiterTest.test(srcStr.charAt(i + tokenLen)))
)
return true;
return false;
}
// This method remains 'protected' because it utilizes a specialized Loop-Control
// Variable Class Version of 'LV'. It is used internally by the search methods above.
static boolean containsIgnoreCase(
final String srcStr,
final LV l,
final Predicate<Character> extraDelimiterTest,
final String token
)
{
// String.regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)
// Tests if two string regions are equal. A substring of this String object is
// compared to a substring of the argument other. The result is true if these substrings
// represent character sequences that are the same, ignoring case if and only if ignoreCase
// is true.
final int tokenLen = token.length();
final int loopLen = l.end - tokenLen;
if ((l.end - l.start) < token.length())
return false;
for (int i=l.start; i <= loopLen; i++)
if ( srcStr.regionMatches(true, i, token, 0, tokenLen)
&& ( (i == 0)
|| Character.isWhitespace(srcStr.charAt(i-1))
|| extraDelimiterTest.test(srcStr.charAt(i-1)))
&& ( ((i + tokenLen) == srcStr.length())
|| Character.isWhitespace(srcStr.charAt(i + tokenLen))
|| extraDelimiterTest.test(srcStr.charAt(i + tokenLen)))
)
return true;
return false;
}
/**
* Implementing a 'contains' is more efficient by performing only one loop iteration.
* Therefore, the methods that implement some variant of the String.contains method
* will use this general-purpose contains-testing method.
*
* @param ignoresCase This is used to signify whether to ignore case when performing the
* String-comparison operations.
*
* @param booleanOperation This is designed to take one of four values. This method will
* throw an exception if it does not.
*
* @param l Loop end-point parameter
* @param srcStr Any non-null instance of java.lang.String
* @param extraDelimiterTest <EMBED CLASS='external-html' DATA-FILE-ID='XTRADELIM'>
*
* @param tokens This is one (or many) java String's, each of which shall be
* checked whether it is contained by 'srcStr'.
*
* @return The appropriate response based on the inputs for boolean logic.
*/
static boolean CONTAINS(
final boolean ignoresCase,
final byte booleanOperation,
final LV l,
final String srcStr,
final Predicate<Character> extraDelimiterTest,
final String[] tokens
)
{
int count = (booleanOperation == XOR) ? 0 : tokens.length;
final int len = srcStr.length();
final int[] tokLenArr = new int[tokens.length];
for (int i=0; i < tokLenArr.length; i++)
tokLenArr[i] = tokens[i].length();
for (int i=l.start; i < l.end; i++)
for (int j=0; j < tokens.length; j++)
if (tokLenArr[j] != -1)
if (srcStr.regionMatches(ignoresCase, i, tokens[j], 0, tokLenArr[j]))
if ( ( (i==0)
|| Character.isWhitespace(srcStr.charAt(i-1))
|| extraDelimiterTest.test(srcStr.charAt(i-1)))
&& ( ((i + tokLenArr[j]) == len)
|| Character.isWhitespace(srcStr.charAt(i + tokLenArr[j]))
|| extraDelimiterTest.test(srcStr.charAt(i + tokLenArr[j])))
)
switch (booleanOperation)
{
case AND :
tokLenArr[j] = -1;
if (--count == 0) return true;
else break;
case XOR :
tokLenArr[j] = -1;
if (++count > 1) return false;
else break;
case OR : return true;
case NAND : return false;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
switch(booleanOperation)
{
case AND : return false;
case OR : return false;
case XOR : return count == 1;
case NAND : return true;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
}
/**
* Implementing a 'contains' is more efficient by performing only one loop iteration.
* Therefore, the methods that implement some variant of the String.contains method
* will use this general-purpose contains-testing method.
*
* @param ignoresCase This is used to signify whether to ignore case when performing the
* String-comparison operations.
*
* @param booleanOperation This is designed to take one of four values. This method will
* throw an exception if it does not.
*
* @param srcStr Any non-null instance of java.lang.String
* @param extraDelimiterTest <EMBED CLASS='external-html' DATA-FILE-ID='XTRADELIM'>
*
* @param tokens This is one (or many) java String's, each of which shall be
* checked whether it is contained by 'srcStr'.
*
* @return The appropriate response based on the inputs for boolean logic.
*/
static boolean CONTAINS(
final boolean ignoresCase,
final byte booleanOperation,
final String srcStr,
final Predicate<Character> extraDelimiterTest,
final String[] tokens
)
{
int count = (booleanOperation == XOR) ? 0 : tokens.length;
final int len = srcStr.length();
final int[] tokLenArr = new int[tokens.length];
for (int i=0; i < tokLenArr.length; i++)
tokLenArr[i] = tokens[i].length();
for (int i=0; i < len; i++)
for (int j=0; j < tokens.length; j++)
if (tokLenArr[j] != -1)
if (srcStr.regionMatches(ignoresCase, i, tokens[j], 0, tokLenArr[j]))
if ( ( (i==0)
|| Character.isWhitespace(srcStr.charAt(i-1))
|| extraDelimiterTest.test(srcStr.charAt(i-1)))
&& ( ((i+tokLenArr[j]) == len)
|| Character.isWhitespace(srcStr.charAt(i+tokLenArr[j]))
|| extraDelimiterTest.test(srcStr.charAt(i+tokLenArr[j])))
)
switch (booleanOperation)
{
case AND :
tokLenArr[j] = -1;
if (--count == 0) return true;
else break;
case XOR :
tokLenArr[j] = -1;
if (++count > 1) return false;
else break;
case OR : return true;
case NAND : return false;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
switch(booleanOperation)
{
case AND : return false;
case OR : return false;
case XOR : return count == 1;
case NAND : return true;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
}
private static final String CONTAINS_EX =
"The value passed to parameter 'booleanOperation' was [BOOL]." +
"However, this parameter is intended to must be chosen from one of the four boolean " +
"static-constants available in this class. Valid values for this parameter include: " +
"StrCmpr.AND, StrCmpr.OR, StrCmpr.XOR and StrCmpr.NAND.";
/**
* Implementing a 'contains' is more efficient by performing only one loop iteration.
* Therefore, the methods that implement some variant of the String.contains method
* will use this general-purpose contains-testing method.
*
* @param ignoresCase This is used to signify whether to ignore case when performing the
* String-comparison operations.
*
* @param booleanOperation This is designed to take one of four values. This method will
* throw an exception if it does not.
*
* @param l Loop end-point parameter
* @param srcStr Any non-null instance of java.lang.String
*
* @param tokens This is one (or many) java String's, each of which shall be
* checked whether it is contained by 'srcStr'.
*
* @return The appropriate response based on the inputs for boolean logic.
*/
static boolean CONTAINS_LV(
final boolean ignoresCase,
final byte booleanOperation,
final LV l,
final String srcStr,
final String[] tokens
)
{
int count = (booleanOperation == XOR) ? 0 : tokens.length;
final int len = srcStr.length();
final int[] tokLenArr = new int[tokens.length];
for (int i=0; i < tokens.length; i++)
tokLenArr[i] = tokens[i].length();
for (int i=l.start; i < l.end; i++)
for (int j=0; j < tokens.length; j++)
if (tokLenArr[j] != -1)
if (srcStr.regionMatches(ignoresCase, i, tokens[j], 0, tokLenArr[j]))
if ( ( (i==0)
|| Character.isWhitespace(srcStr.charAt(i-1)))
&& ( ((i + tokLenArr[j]) == len)
|| Character.isWhitespace(srcStr.charAt(i + tokLenArr[j])))
)
switch (booleanOperation)
{
case AND :
tokLenArr[j] = -1;
if (--count == 0) return true;
else break;
case XOR :
tokLenArr[j] = -1;
if (++count > 1) return false;
else break;
case OR : return true;
case NAND : return false;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
switch(booleanOperation)
{
case AND : return false;
case OR : return false;
case XOR : return count == 1;
case NAND : return true;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
}
/**
* Implementing a 'contains' is more efficient by performing only one loop iteration.
* Therefore, the methods that implement some variant of the String.contains method
* will use this general-purpose contains-testing method.
*
* @param ignoresCase This is used to signify whether to ignore case when performing the
* String-comparison operations.
*
* @param booleanOperation This is designed to take one of four values. This method will
* throw an exception if it does not.
*
* @param srcStr Any non-null instance of java.lang.String
*
* @param tokens This is one (or many) java String's, each of which shall be
* checked whether it is contained by 'srcStr'.
*
* @return The appropriate response based on the inputs for boolean logic.
*/
static boolean CONTAINS(
final boolean ignoresCase,
final byte booleanOperation,
final String srcStr,
final String[] tokens
)
{
int count = (booleanOperation == XOR) ? 0 : tokens.length;
final int len = srcStr.length();
final int[] tokLenArr = new int[tokens.length];
for (int i=0; i < tokens.length; i++)
tokLenArr[i] = tokens[i].length();
for (int i=0; i < len; i++)
for (int j=0; j < tokens.length; j++)
if (tokLenArr[j] != -1)
if (srcStr.regionMatches(ignoresCase, i, tokens[j], 0, tokLenArr[j]))
if ( ( (i==0)
|| Character.isWhitespace(srcStr.charAt(i-1)))
&& ( ((i + tokens[j].length()) == len)
|| Character.isWhitespace(srcStr.charAt(i + tokens[j].length())))
)
switch (booleanOperation)
{
case AND :
tokLenArr[j] = -1;
if (--count == 0) return true;
else break;
case XOR :
tokLenArr[j] = -1;
if (++count > 1) return false;
else break;
case OR : return true;
case NAND : return false;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
switch(booleanOperation)
{
case AND : return false;
case OR : return false;
case XOR : return count == 1;
case NAND : return true;
default :
throw new IllegalArgumentException
(CONTAINS_EX.replace("BOOL", "" + booleanOperation));
}
}
}
|