-
Notifications
You must be signed in to change notification settings - Fork 101
/
Strings.java
133 lines (116 loc) · 3.38 KB
/
Strings.java
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
/**
* Copyright 2018 The original authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package io.dekorate.utils;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Path;
import java.util.Arrays;
import java.util.Iterator;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.stream.Collectors;
import io.dekorate.DekorateException;
public class Strings {
private static final char COMMA = ',';
public static boolean isNotNullOrEmpty(String str) {
return !isNullOrEmpty(str);
}
public static boolean isNullOrEmpty(String str) {
return str == null || str.isEmpty();
}
public static String join(final Object[] array) {
return join(array, ',');
}
public static String join(final Object[] array, final char separator) {
if (array == null) {
return null;
}
if (array.length == 0) {
return "";
}
final StringBuilder buf = new StringBuilder();
for (int i = 0; i < array.length; i++) {
if (i > 0) {
buf.append(separator);
}
if (array[i] != null) {
buf.append(array[i]);
}
}
return buf.toString();
}
/**
* Uppercase the first character of the word and ignore the rest.
* Examples:
* null -> null
* "" -> ""
* "a" -> "A"
* "string" -> "String"
* "myString" -> "MyString"
* @param str The input string.
* @return The input string with the first character upper cased.
*/
public static String uppercaseFirst(String str) {
if (str == null) {
return null;
}
if (str.isEmpty()) {
return str;
}
if (str.length() == 1) {
return str.toUpperCase();
}
return str.substring(0, 1).toUpperCase() + str.substring(1);
}
/**
* Lowercase the first character of the word and ignore the rest.
* Examples:
* null -> null
* "" -> ""
* "A" -> "a"
* "String" -> "string"
* "MyString" -> "myString"
* @param str The input string.
* @return The input string with the first character lower cased.
*/
public static String lowerFirst(String str) {
if (str == null) {
return null;
}
if (str.isEmpty()) {
return str;
}
if (str.length() == 1) {
return str.toLowerCase();
}
return str.substring(0, 1).toLowerCase() + str.substring(1);
}
/**
* Convert kebab case to camel case.
* @param The input string.
* @return The camel cased string.
*/
public static String kebabToCamelCase(String str) {
final AtomicBoolean first = new AtomicBoolean(true);
return str != null && str.contains("-") ? Arrays.stream(str.split("-")).map(s -> first.getAndSet(false) ? s : Strings.uppercaseFirst(s)).collect(Collectors.joining()) : str;
}
public static String read(Path path) {
try {
return new String(Files.readAllBytes(path));
} catch (IOException e) {
throw DekorateException.launderThrowable(e);
}
}
}