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
|
/*
* Copyright (C) 2009-2022, Google Inc. and others
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Distribution License v. 1.0 which is available at
* https://www.eclipse.org/org/documents/edl-v10.php.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
package org.eclipse.jgit.util;
import java.text.MessageFormat;
import java.util.Collection;
import org.eclipse.jgit.annotations.NonNull;
import org.eclipse.jgit.internal.JGitText;
import org.eclipse.jgit.lib.Constants;
/**
* Miscellaneous string comparison utility methods.
*/
public final class StringUtils {
private static final long KiB = 1024;
private static final long MiB = 1024 * KiB;
private static final long GiB = 1024 * MiB;
private static final char[] LC;
static {
LC = new char['Z' + 1];
for (char c = 0; c < LC.length; c++)
LC[c] = c;
for (char c = 'A'; c <= 'Z'; c++)
LC[c] = (char) ('a' + (c - 'A'));
}
private StringUtils() {
// Do not create instances
}
/**
* Convert the input to lowercase.
* <p>
* This method does not honor the JVM locale, but instead always behaves as
* though it is in the US-ASCII locale. Only characters in the range 'A'
* through 'Z' are converted. All other characters are left as-is, even if
* they otherwise would have a lowercase character equivalent.
*
* @param c
* the input character.
* @return lowercase version of the input.
*/
public static char toLowerCase(char c) {
return c <= 'Z' ? LC[c] : c;
}
/**
* Convert the input string to lower case, according to the "C" locale.
* <p>
* This method does not honor the JVM locale, but instead always behaves as
* though it is in the US-ASCII locale. Only characters in the range 'A'
* through 'Z' are converted, all other characters are left as-is, even if
* they otherwise would have a lowercase character equivalent.
*
* @param in
* the input string. Must not be null.
* @return a copy of the input string, after converting characters in the
* range 'A'..'Z' to 'a'..'z'.
*/
public static String toLowerCase(String in) {
final StringBuilder r = new StringBuilder(in.length());
for (int i = 0; i < in.length(); i++)
r.append(toLowerCase(in.charAt(i)));
return r.toString();
}
/**
* Borrowed from commons-lang <code>StringUtils.capitalize()</code> method.
*
* <p>
* Capitalizes a String changing the first letter to title case as per
* {@link java.lang.Character#toTitleCase(char)}. No other letters are
* changed.
* </p>
* <p>
* A <code>null</code> input String returns <code>null</code>.
* </p>
*
* @param str
* the String to capitalize, may be null
* @return the capitalized String, <code>null</code> if null String input
* @since 4.0
*/
public static String capitalize(String str) {
int strLen;
if (str == null || (strLen = str.length()) == 0) {
return str;
}
return new StringBuilder(strLen)
.append(Character.toTitleCase(str.charAt(0)))
.append(str.substring(1)).toString();
}
/**
* Test if two strings are equal, ignoring case.
* <p>
* This method does not honor the JVM locale, but instead always behaves as
* though it is in the US-ASCII locale.
*
* @param a
* first string to compare.
* @param b
* second string to compare.
* @return true if a equals b
*/
public static boolean equalsIgnoreCase(String a, String b) {
if (References.isSameObject(a, b)) {
return true;
}
if (a.length() != b.length())
return false;
for (int i = 0; i < a.length(); i++) {
if (toLowerCase(a.charAt(i)) != toLowerCase(b.charAt(i)))
return false;
}
return true;
}
/**
* Compare two strings, ignoring case.
* <p>
* This method does not honor the JVM locale, but instead always behaves as
* though it is in the US-ASCII locale.
*
* @param a
* first string to compare.
* @param b
* second string to compare.
* @since 2.0
* @return an int.
*/
public static int compareIgnoreCase(String a, String b) {
for (int i = 0; i < a.length() && i < b.length(); i++) {
int d = toLowerCase(a.charAt(i)) - toLowerCase(b.charAt(i));
if (d != 0)
return d;
}
return a.length() - b.length();
}
/**
* Compare two strings, honoring case.
* <p>
* This method does not honor the JVM locale, but instead always behaves as
* though it is in the US-ASCII locale.
*
* @param a
* first string to compare.
* @param b
* second string to compare.
* @since 2.0
* @return an int.
*/
public static int compareWithCase(String a, String b) {
for (int i = 0; i < a.length() && i < b.length(); i++) {
int d = a.charAt(i) - b.charAt(i);
if (d != 0)
return d;
}
return a.length() - b.length();
}
/**
* Parse a string as a standard Git boolean value. See
* {@link #toBooleanOrNull(String)}.
*
* @param stringValue
* the string to parse.
* @return the boolean interpretation of {@code value}.
* @throws java.lang.IllegalArgumentException
* if {@code value} is not recognized as one of the standard
* boolean names.
*/
public static boolean toBoolean(String stringValue) {
if (stringValue == null)
throw new NullPointerException(JGitText.get().expectedBooleanStringValue);
final Boolean bool = toBooleanOrNull(stringValue);
if (bool == null)
throw new IllegalArgumentException(MessageFormat.format(JGitText.get().notABoolean, stringValue));
return bool.booleanValue();
}
/**
* Parse a string as a standard Git boolean value.
* <p>
* The terms {@code yes}, {@code true}, {@code 1}, {@code on} can all be
* used to mean {@code true}.
* <p>
* The terms {@code no}, {@code false}, {@code 0}, {@code off} can all be
* used to mean {@code false}.
* <p>
* Comparisons ignore case, via {@link #equalsIgnoreCase(String, String)}.
*
* @param stringValue
* the string to parse.
* @return the boolean interpretation of {@code value} or null in case the
* string does not represent a boolean value
*/
public static Boolean toBooleanOrNull(String stringValue) {
if (stringValue == null)
return null;
if (equalsIgnoreCase("yes", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("true", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("1", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("on", stringValue)) //$NON-NLS-1$
return Boolean.TRUE;
else if (equalsIgnoreCase("no", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("false", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("0", stringValue) //$NON-NLS-1$
|| equalsIgnoreCase("off", stringValue)) //$NON-NLS-1$
return Boolean.FALSE;
else
return null;
}
/**
* Join a collection of Strings together using the specified separator.
*
* @param parts
* Strings to join
* @param separator
* used to join
* @return a String with all the joined parts
*/
public static String join(Collection<String> parts, String separator) {
return StringUtils.join(parts, separator, separator);
}
/**
* Join a collection of Strings together using the specified separator and a
* lastSeparator which is used for joining the second last and the last
* part.
*
* @param parts
* Strings to join
* @param separator
* separator used to join all but the two last elements
* @param lastSeparator
* separator to use for joining the last two elements
* @return a String with all the joined parts
*/
public static String join(Collection<String> parts, String separator,
String lastSeparator) {
StringBuilder sb = new StringBuilder();
int i = 0;
int lastIndex = parts.size() - 1;
for (String part : parts) {
sb.append(part);
if (i == lastIndex - 1) {
sb.append(lastSeparator);
} else if (i != lastIndex) {
sb.append(separator);
}
i++;
}
return sb.toString();
}
/**
* Appends {@link Constants#DOT_GIT_EXT} unless the given name already ends
* with that suffix.
*
* @param name
* to complete
* @return the name ending with {@link Constants#DOT_GIT_EXT}
* @since 6.1
*/
public static String nameWithDotGit(String name) {
if (name.endsWith(Constants.DOT_GIT_EXT)) {
return name;
}
return name + Constants.DOT_GIT_EXT;
}
/**
* Test if a string is empty or null.
*
* @param stringValue
* the string to check
* @return <code>true</code> if the string is <code>null</code> or empty
*/
public static boolean isEmptyOrNull(String stringValue) {
return stringValue == null || stringValue.length() == 0;
}
/**
* Replace CRLF, CR or LF with a single space.
*
* @param in
* A string with line breaks
* @return in without line breaks
* @since 3.1
*/
public static String replaceLineBreaksWithSpace(String in) {
char[] buf = new char[in.length()];
int o = 0;
for (int i = 0; i < buf.length; ++i) {
char ch = in.charAt(i);
switch (ch) {
case '\r':
if (i + 1 < buf.length && in.charAt(i + 1) == '\n') {
buf[o++] = ' ';
++i;
} else
buf[o++] = ' ';
break;
case '\n':
buf[o++] = ' ';
break;
default:
buf[o++] = ch;
break;
}
}
return new String(buf, 0, o);
}
/**
* Parses a number with optional case-insensitive suffix 'k', 'm', or 'g'
* indicating KiB, MiB, and GiB, respectively. The suffix may follow the
* number with optional separation by one or more blanks.
*
* @param value
* {@link String} to parse; with leading and trailing whitespace
* ignored
* @param positiveOnly
* {@code true} to only accept positive numbers, {@code false} to
* allow negative numbers, too
* @return the value parsed
* @throws NumberFormatException
* if the {@value} is not parseable, or beyond the range of
* {@link Long}
* @throws StringIndexOutOfBoundsException
* if the string is empty or contains only whitespace, or
* contains only the letter 'k', 'm', or 'g'
* @since 6.0
*/
public static long parseLongWithSuffix(@NonNull String value,
boolean positiveOnly)
throws NumberFormatException, StringIndexOutOfBoundsException {
String n = value.strip();
if (n.isEmpty()) {
throw new StringIndexOutOfBoundsException();
}
long mul = 1;
switch (n.charAt(n.length() - 1)) {
case 'g':
case 'G':
mul = GiB;
break;
case 'm':
case 'M':
mul = MiB;
break;
case 'k':
case 'K':
mul = KiB;
break;
default:
break;
}
if (mul > 1) {
n = n.substring(0, n.length() - 1).trim();
}
if (n.isEmpty()) {
throw new StringIndexOutOfBoundsException();
}
long number;
if (positiveOnly) {
number = Long.parseUnsignedLong(n);
if (number < 0) {
throw new NumberFormatException(
MessageFormat.format(JGitText.get().valueExceedsRange,
value, Long.class.getSimpleName()));
}
} else {
number = Long.parseLong(n);
}
if (mul == 1) {
return number;
}
try {
return Math.multiplyExact(mul, number);
} catch (ArithmeticException e) {
NumberFormatException nfe = new NumberFormatException(
e.getLocalizedMessage());
nfe.initCause(e);
throw nfe;
}
}
/**
* Parses a number with optional case-insensitive suffix 'k', 'm', or 'g'
* indicating KiB, MiB, and GiB, respectively. The suffix may follow the
* number with optional separation by blanks.
*
* @param value
* {@link String} to parse; with leading and trailing whitespace
* ignored
* @param positiveOnly
* {@code true} to only accept positive numbers, {@code false} to
* allow negative numbers, too
* @return the value parsed
* @throws NumberFormatException
* if the {@value} is not parseable or beyond the range of
* {@link Integer}
* @throws StringIndexOutOfBoundsException
* if the string is empty or contains only whitespace, or
* contains only the letter 'k', 'm', or 'g'
* @since 6.0
*/
public static int parseIntWithSuffix(@NonNull String value,
boolean positiveOnly)
throws NumberFormatException, StringIndexOutOfBoundsException {
try {
return Math.toIntExact(parseLongWithSuffix(value, positiveOnly));
} catch (ArithmeticException e) {
NumberFormatException nfe = new NumberFormatException(
MessageFormat.format(JGitText.get().valueExceedsRange,
value, Integer.class.getSimpleName()));
nfe.initCause(e);
throw nfe;
}
}
/**
* Formats an integral value as a decimal number with 'k', 'm', or 'g'
* suffix if it is an exact multiple of 1024, otherwise returns the value
* representation as a decimal number without suffix.
*
* @param value
* Value to format
* @return the value's String representation
* @since 6.0
*/
public static String formatWithSuffix(long value) {
if (value >= GiB && (value % GiB) == 0) {
return String.valueOf(value / GiB) + 'g';
}
if (value >= MiB && (value % MiB) == 0) {
return String.valueOf(value / MiB) + 'm';
}
if (value >= KiB && (value % KiB) == 0) {
return String.valueOf(value / KiB) + 'k';
}
return String.valueOf(value);
}
}
|